Package evaluation to test Jutul on Julia 1.11.8 (29b3528cce*) started at 2026-01-20T16:50:01.166 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.11` Set-up completed after 8.44s ################################################################################ # Installation # Installing Jutul... Resolving package versions... Installed Jutul ─ v0.4.12 Updating `~/.julia/environments/v1.11/Project.toml` [2b460a1a] + Jutul v0.4.12 Updating `~/.julia/environments/v1.11/Manifest.toml` [47edcb42] + ADTypes v1.21.0 [79e6a3ab] + Adapt v4.4.0 ⌅ [2169fc97] + AlgebraicMultigrid v0.5.1 [ec485272] + ArnoldiMethod v0.4.0 [4fba245c] + ArrayInterface v7.22.0 [62783981] + BitTwiddlingConvenienceFunctions v0.1.6 [fa961155] + CEnum v0.5.0 [2a0fbf3d] + CPUSummary v0.2.7 [0b6fb165] + ChunkCodecCore v1.0.1 [4c0bbee4] + ChunkCodecLibZlib v1.0.0 [55437552] + ChunkCodecLibZstd v1.0.0 [fb6a15b2] + CloseOpenIntervals v0.1.13 [944b1d66] + CodecZlib v0.7.8 [38540f10] + CommonSolve v0.2.6 [bbf7d656] + CommonSubexpressions v0.3.1 [f70d9fcc] + CommonWorldInvalidations v1.0.0 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [adafc99b] + CpuId v0.3.1 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 ⌅ [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [a0c0ee7d] + DifferentiationInterface v0.7.14 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [9aa1b823] + FastClosures v0.3.2 [5789e2e9] + FileIO v1.17.1 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.1 ⌃ [86223c79] + Graphs v1.13.1 [f67ccb44] + HDF5 v0.17.2 [076d061b] + HashArrayMappedTries v0.2.0 [3e5b6fbb] + HostCPUFeatures v0.1.18 [88f59080] + ILUZero v0.2.0 [615f187c] + IfElse v0.1.1 [d25df0c9] + Inflate v0.1.5 [92d709cd] + IrrationalConstants v0.2.6 [82899510] + IteratorInterfaceExtensions v1.0.0 [033835bb] + JLD2 v0.6.3 [692b3bcd] + JLLWrappers v1.7.1 [2b460a1a] + Jutul v0.4.12 ⌅ [ba0b0d4f] + Krylov v0.9.10 [b964fa9f] + LaTeXStrings v1.4.0 [10f19ff3] + LayoutPointers v0.1.17 [5c8ed15e] + LinearOperators v2.11.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [bdcacae8] + LoopVectorization v0.12.173 [23992714] + MAT v0.11.4 [3da0fdf6] + MPIPreferences v0.1.11 [1914dd2f] + MacroTools v0.5.16 [d125e4d3] + ManualMemory v0.1.8 [dbb5928d] + MappedArrays v0.4.3 [2679e427] + Metis v1.5.0 [77ba4419] + NaNMath v1.1.3 [6fe1bfb0] + OffsetArrays v1.17.0 [bac558e1] + OrderedCollections v1.8.1 [f517fe37] + Polyester v0.7.18 [1d0040c9] + PolyesterWeave v0.2.2 [f27b6e38] + Polynomials v4.1.0 [2dfb63ee] + PooledArrays v1.4.3 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.5.1 ⌅ [08abe8d2] + PrettyTables v2.4.0 [92933f4c] + ProgressMeter v1.11.0 [3cdcf5f2] + RecipesBase v1.3.4 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [94e857df] + SIMDTypes v0.1.0 [476501e8] + SLEEFPirates v0.6.43 [431bcebd] + SciMLPublic v1.0.1 [7e506255] + ScopedValues v1.5.0 [efcf1570] + Setfield v1.1.2 [699a6c99] + SimpleTraits v0.9.5 [9f842d2f] + SparseConnectivityTracer v1.1.3 [0a514795] + SparseMatrixColorings v0.4.23 [06eadbd4] + SparsityTracing v0.2.6 [276daf66] + SpecialFunctions v2.6.1 [aedffcd0] + Static v1.3.1 [0d7ed370] + StaticArrayInterface v1.8.0 [90137ffa] + StaticArrays v1.9.16 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [7792a7ef] + StrideArraysCore v0.5.8 [69024149] + StringEncodings v0.3.7 [892a3eda] + StringManipulation v0.4.2 [286e6d88] + SymRCM v0.2.2 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [8290d209] + ThreadingUtilities v0.5.5 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 [bc48ee85] + Tullio v0.3.8 [3a884ed6] + UnPack v1.0.2 [3d5dd08c] + VectorizationBase v0.21.72 ⌅ [0234f1f7] + HDF5_jll v1.14.6+0 [e33a78d0] + Hwloc_jll v2.12.2+0 [94ce4f54] + Libiconv_jll v1.18.0+0 [d00139f3] + METIS_jll v5.1.3+0 [7cb0a576] + MPICH_jll v4.3.2+0 [f1f71cc9] + MPItrampoline_jll v5.5.4+0 [9237b28f] + MicrosoftMPI_jll v10.1.4+3 [fe0851c0] + OpenMPI_jll v5.0.9+0 [458c3c95] + OpenSSL_jll v3.5.4+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 ⌅ [02c8fc9c] + XML2_jll v2.13.9+0 [a65dc6b1] + Xorg_libpciaccess_jll v0.18.1+0 [3161d3a3] + Zstd_jll v1.5.7+1 [477f73a3] + libaec_jll v1.1.4+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.6.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [4af54fe1] + LazyArtifacts v1.11.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.11.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.2.0 [44cfe95a] + Pkg v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [1a1011a3] + SharedArrays v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.11.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] + LibCURL_jll v8.6.0+0 [e37daf67] + LibGit2_jll v1.7.2+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.6+0 [14a3606d] + MozillaCACerts_jll v2023.12.12 [4536629a] + OpenBLAS_jll v0.3.27+1 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.7.0+0 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 [8e850ede] + nghttp2_jll v1.59.0+0 [3f19e933] + p7zip_jll v17.4.0+2 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 12.06s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... 155867.4 ms ✓ Jutul 13861.5 ms ✓ Jutul → JutulLBFGSBExt 27480.3 ms ✓ Jutul → JutulHYPREExt 20279.4 ms ✓ Jutul → JutulKaHyParExt 4 dependencies successfully precompiled in 223 seconds. 186 already precompiled. Precompilation completed after 240.59s ################################################################################ # Testing # Testing Jutul Status `/tmp/jl_vcub02/Project.toml` ⌅ [2169fc97] AlgebraicMultigrid v0.5.1 [a8cc5b0e] Crayons v4.1.1 ⌅ [864edb3b] DataStructures v0.18.22 [a0c0ee7d] DifferentiationInterface v0.7.14 [e2ba6199] ExprTools v0.1.10 [f6369f11] ForwardDiff v1.3.1 ⌃ [86223c79] Graphs v1.13.1 [b5ffcf37] HYPRE v1.7.0 [88f59080] ILUZero v0.2.0 [033835bb] JLD2 v0.6.3 [2b460a1a] Jutul v0.4.12 [2a6221f6] KaHyPar v0.3.1 ⌅ [ba0b0d4f] Krylov v0.9.10 [5be7bae1] LBFGSB v0.4.1 [5c8ed15e] LinearOperators v2.11.0 [bdcacae8] LoopVectorization v0.12.173 [23992714] MAT v0.11.4 [dbb5928d] MappedArrays v0.4.3 [2679e427] Metis v1.5.0 [bac558e1] OrderedCollections v1.8.1 [f517fe37] Polyester v0.7.18 [1d0040c9] PolyesterWeave v0.2.2 [f27b6e38] Polynomials v4.1.0 ⌅ [08abe8d2] PrettyTables v2.4.0 [92933f4c] ProgressMeter v1.11.0 [9f842d2f] SparseConnectivityTracer v1.1.3 [0a514795] SparseMatrixColorings v0.4.23 [06eadbd4] SparsityTracing v0.2.6 [90137ffa] StaticArrays v1.9.16 [10745b16] Statistics v1.11.1 [286e6d88] SymRCM v0.2.2 [a759f4b9] TimerOutputs v0.5.29 [bc48ee85] Tullio v0.3.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [de0858da] Printf v1.11.0 [2f01184e] SparseArrays v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_vcub02/Manifest.toml` [47edcb42] ADTypes v1.21.0 [79e6a3ab] Adapt v4.4.0 ⌅ [2169fc97] AlgebraicMultigrid v0.5.1 [ec485272] ArnoldiMethod v0.4.0 [4fba245c] ArrayInterface v7.22.0 [62783981] BitTwiddlingConvenienceFunctions v0.1.6 [fa961155] CEnum v0.5.0 [2a0fbf3d] CPUSummary v0.2.7 [0b6fb165] ChunkCodecCore v1.0.1 [4c0bbee4] ChunkCodecLibZlib v1.0.0 [55437552] ChunkCodecLibZstd v1.0.0 [fb6a15b2] CloseOpenIntervals v0.1.13 [944b1d66] CodecZlib v0.7.8 [38540f10] CommonSolve v0.2.6 [bbf7d656] CommonSubexpressions v0.3.1 [f70d9fcc] CommonWorldInvalidations v1.0.0 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [adafc99b] CpuId v0.3.1 [a8cc5b0e] Crayons v4.1.1 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.7.14 [ffbed154] DocStringExtensions v0.9.5 [e2ba6199] ExprTools v0.1.10 [9aa1b823] FastClosures v0.3.2 [5789e2e9] FileIO v1.17.1 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.1 ⌃ [86223c79] Graphs v1.13.1 [f67ccb44] HDF5 v0.17.2 [b5ffcf37] HYPRE v1.7.0 [076d061b] HashArrayMappedTries v0.2.0 [3e5b6fbb] HostCPUFeatures v0.1.18 [88f59080] ILUZero v0.2.0 [615f187c] IfElse v0.1.1 [d25df0c9] Inflate v0.1.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [033835bb] JLD2 v0.6.3 [692b3bcd] JLLWrappers v1.7.1 [2b460a1a] Jutul v0.4.12 [2a6221f6] KaHyPar v0.3.1 ⌅ [ba0b0d4f] Krylov v0.9.10 [5be7bae1] LBFGSB v0.4.1 [b964fa9f] LaTeXStrings v1.4.0 [10f19ff3] LayoutPointers v0.1.17 [5c8ed15e] LinearOperators v2.11.0 [2ab3a3ac] LogExpFunctions v0.3.29 [bdcacae8] LoopVectorization v0.12.173 [23992714] MAT v0.11.4 [da04e1cc] MPI v0.20.23 [3da0fdf6] MPIPreferences v0.1.11 [1914dd2f] MacroTools v0.5.16 [d125e4d3] ManualMemory v0.1.8 [dbb5928d] MappedArrays v0.4.3 [2679e427] Metis v1.5.0 [77ba4419] NaNMath v1.1.3 [6fe1bfb0] OffsetArrays v1.17.0 [bac558e1] OrderedCollections v1.8.1 [eebad327] PkgVersion v0.3.3 [f517fe37] Polyester v0.7.18 [1d0040c9] PolyesterWeave v0.2.2 [f27b6e38] Polynomials v4.1.0 [2dfb63ee] PooledArrays v1.4.3 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.5.1 ⌅ [08abe8d2] PrettyTables v2.4.0 [92933f4c] ProgressMeter v1.11.0 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [94e857df] SIMDTypes v0.1.0 [476501e8] SLEEFPirates v0.6.43 [431bcebd] SciMLPublic v1.0.1 [7e506255] ScopedValues v1.5.0 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [9f842d2f] SparseConnectivityTracer v1.1.3 [0a514795] SparseMatrixColorings v0.4.23 [06eadbd4] SparsityTracing v0.2.6 [276daf66] SpecialFunctions v2.6.1 [aedffcd0] Static v1.3.1 [0d7ed370] StaticArrayInterface v1.8.0 [90137ffa] StaticArrays v1.9.16 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [7792a7ef] StrideArraysCore v0.5.8 [69024149] StringEncodings v0.3.7 [892a3eda] StringManipulation v0.4.2 [286e6d88] SymRCM v0.2.2 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [8290d209] ThreadingUtilities v0.5.5 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [bc48ee85] Tullio v0.3.8 [3a884ed6] UnPack v1.0.2 [3d5dd08c] VectorizationBase v0.21.72 ⌅ [0234f1f7] HDF5_jll v1.14.6+0 ⌅ [0a602bbd] HYPRE_jll v2.23.1+1 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [87a0c12d] KaHyPar_jll v1.3.3+0 ⌅ [51474c39] LAPACK_jll v3.12.0+3 [81d17ec3] L_BFGS_B_jll v3.0.1+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [7cb0a576] MPICH_jll v4.3.2+0 [f1f71cc9] MPItrampoline_jll v5.5.4+0 [9237b28f] MicrosoftMPI_jll v10.1.4+3 [fe0851c0] OpenMPI_jll v5.0.9+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [3161d3a3] Zstd_jll v1.5.7+1 ⌅ [28df3c45] boost_jll v1.76.0+1 [477f73a3] libaec_jll v1.1.4+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.6.0+0 [e37daf67] LibGit2_jll v1.7.2+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.6+0 [14a3606d] MozillaCACerts_jll v2023.12.12 [4536629a] OpenBLAS_jll v0.3.27+1 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.7.0+0 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.59.0+0 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... Test Summary: | Pass Total Time Scalar test system | 20 20 2m34.2s Test Summary: | Pass Total Time Simple heat equation 2D | 1 1 30.9s Precompiling HYPRESparseArrays... 4566.4 ms ✓ HYPRE → HYPRESparseArrays 1 dependency successfully precompiled in 5 seconds. 49 already precompiled. Test Summary: | Pass Total Time Algebraic multigrid heat | 2 2 27.9s Test Summary: | Pass Total Time Variable Poisson | 1 1 32.1s Test Summary: | Pass Total Time data_domain gradients | 81 81 57.7s Test Summary: | Pass Total Time Termination criterion | 4 4 10.5s Test Summary: | Pass Total Time Multi-model: Scalar test system | 5 5 1m07.2s Test Summary: | Pass Total Time Test serialization of results | 6 6 0.7s Test Summary: | Pass Total Time Test restart from stored results | 2 2 0.1s Test Summary: | Pass Total Time Helper | 2 2 23.4s Test Summary: | Pass Total Time CartesianMesh indices | 302 302 0.7s Test Summary: | Pass Total Time UnstructuredMesh | 189 189 1m04.8s Test Summary: | Pass Total Time CoarseMesh | 13 13 3.6s Test Summary: | Pass Total Time Trajectories | 5 5 19.9s Test Summary: | Pass Total Time RadialMeshes | 322 322 0.0s Test Summary: | Pass Total Time extrude_mesh | 65 65 4.4s Test Summary: | Pass Total Time Adjoint utilities | 10 10 9.0s Test Summary: | Pass Total Time simple adjoint sensitivities | 56 56 27.5s Test Summary: | Pass Total Time AdjointDI.solve_adjoint_generic | 227 227 2m09.1s It. | Objective | Proj. grad | Linesearch-its ----------------------------------------------- 0 | 2.9808e+00 | 9.9000e+00 | - LBFGS: Resetting 'm' to number of parameters: m = 2 1 | 5.5794e-02 | 9.9000e+00 | 3 2 | 2.4287e-03 | 7.4325e+00 | 3 3 | 1.9789e-04 | 1.9099e+00 | 1 4 | 5.1153e-07 | 5.2150e-01 | 1 5 | 2.8137e-10 | 2.6766e-02 | 1 RUNNING THE L-BFGS-B CODE * * * Machine precision = 2.220D-16 N = 2 M = 10 At X0 0 variables are exactly at the bounds At iterate 0 f= 2.98080D+00 |proj g|= 3.26566D-01 At iterate 1 f= 2.08246D-02 |proj g|= 9.16426D-01 At iterate 2 f= 2.45730D-03 |proj g|= 9.36040D-02 At iterate 3 f= 5.00084D-05 |proj g|= 9.12878D-02 At iterate 4 f= 1.49083D-07 |proj g|= 1.44609D-02 At iterate 5 f= 8.93862D-12 |proj g|= 1.71855D-04 At iterate 6 f= 7.93574D-12 |proj g|= 1.04971D-04 * * * Tit = total number of iterations Tnf = total number of function evaluations Tnint = total number of segments explored during Cauchy searches Skip = number of BFGS updates skipped Nact = number of active bounds at final generalized Cauchy point Projg = norm of the final projected gradient F = final function value * * * N Tit Tnf Tnint Skip Nact Projg F 2 6 11 7 0 0 1.050D-04 7.936D-12 F = 7.9357396289438106E-012 CONVERGENCE: REL_REDUCTION_OF_F_<=_FACTR*EPSMCH Cauchy time 0.000E+00 seconds. Subspace minimization time 6.104E-05 seconds. Line search time 1.691E-02 seconds. Total User time 1.361E+00 seconds. Jutul: Simulating 1 second as 1 report steps Jutul: Simulating 1 second as 1 report steps It. | Objective | Proj. grad | Linesearch-its ----------------------------------------------- 0 | 4.3020e-01 | 9.9000e+00 | - LBFGS: Resetting 'm' to number of parameters: m = 1 1 | 7.7613e-02 | 9.9000e+00 | 1 2 | 2.4956e-07 | 4.2044e+00 | 1 3 | 1.3945e-10 | 7.6361e-03 | 1 Test Summary: | Pass Total Time DictOptimization | 43 43 1m31.7s Test Summary: | Pass Total Time AdjointPackedResult | 5 5 1.7s RUNNING THE L-BFGS-B CODE * * * Machine precision = 2.220D-16 N = 2 M = 10 At X0 0 variables are exactly at the bounds At iterate 0 f= 2.98080D+00 |proj g|= 3.26566D-01 At iterate 1 f= 2.08246D-02 |proj g|= 9.16426D-01 At iterate 2 f= 2.45730D-03 |proj g|= 9.36040D-02 At iterate 3 f= 5.00084D-05 |proj g|= 9.12878D-02 At iterate 4 f= 1.49083D-07 |proj g|= 1.44609D-02 At iterate 5 f= 8.41847D-12 |proj g|= 1.08638D-04 At iterate 6 f= 1.75639D-17 |proj g|= 4.45587D-07 * * * Tit = total number of iterations Tnf = total number of function evaluations Tnint = total number of segments explored during Cauchy searches Skip = number of BFGS updates skipped Nact = number of active bounds at final generalized Cauchy point Projg = norm of the final projected gradient F = final function value * * * N Tit Tnf Tnint Skip Nact Projg F 2 6 10 7 0 0 4.456D-07 1.756D-17 F = 1.7563868105302675E-017 CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL Cauchy time 0.000E+00 seconds. Subspace minimization time 0.000E+00 seconds. Line search time 2.106E-02 seconds. Total User time 8.195E+00 seconds. RUNNING THE L-BFGS-B CODE * * * Machine precision = 2.220D-16 N = 2 M = 10 At X0 0 variables are exactly at the bounds At iterate 0 f= 2.98080D+00 |proj g|= 3.26566D-01 At iterate 1 f= 2.08246D-02 |proj g|= 9.16426D-01 At iterate 2 f= 2.45730D-03 |proj g|= 9.36040D-02 At iterate 3 f= 5.00084D-05 |proj g|= 9.12878D-02 At iterate 4 f= 1.49083D-07 |proj g|= 1.44609D-02 At iterate 5 f= 8.41847D-12 |proj g|= 1.08638D-04 At iterate 6 f= 4.17653D-18 |proj g|= 1.84591D-07 * * * Tit = total number of iterations Tnf = total number of function evaluations Tnint = total number of segments explored during Cauchy searches Skip = number of BFGS updates skipped Nact = number of active bounds at final generalized Cauchy point Projg = norm of the final projected gradient F = final function value * * * N Tit Tnf Tnint Skip Nact Projg F 2 6 10 7 0 0 1.846D-07 4.177D-18 F = 4.1765331752205010E-018 CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL Cauchy time 0.000E+00 seconds. Subspace minimization time 6.104E-05 seconds. Line search time 2.069E-02 seconds. Total User time 3.275E-01 seconds. RUNNING THE L-BFGS-B CODE * * * Machine precision = 2.220D-16 N = 2 M = 10 At X0 0 variables are exactly at the bounds At iterate 0 f= 2.98080D+00 |proj g|= 1.00000D+00 At iterate 1 f= 1.78134D+00 |proj g|= 1.41512D+00 ys=-4.151E-01 -gs= 1.000E+00 BFGS update SKIPPED At iterate 2 f= 2.69872D-02 |proj g|= 6.95360D-01 At iterate 3 f= 2.20798D-04 |proj g|= 5.56114D-02 At iterate 4 f= 5.42976D-06 |proj g|= 8.79844D-03 At iterate 5 f= 1.37410D-09 |proj g|= 1.40200D-04 At iterate 6 f= 8.37269D-15 |proj g|= 3.46068D-07 * * * Tit = total number of iterations Tnf = total number of function evaluations Tnint = total number of segments explored during Cauchy searches Skip = number of BFGS updates skipped Nact = number of active bounds at final generalized Cauchy point Projg = norm of the final projected gradient F = final function value * * * N Tit Tnf Tnint Skip Nact Projg F 2 6 8 6 1 0 3.461D-07 8.373D-15 F = 8.3726910037188873E-015 CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL Cauchy time 0.000E+00 seconds. Subspace minimization time 0.000E+00 seconds. Line search time 1.801E-02 seconds. Total User time 2.966E-02 seconds. RUNNING THE L-BFGS-B CODE * * * Machine precision = 2.220D-16 N = 4 M = 10 At X0 0 variables are exactly at the bounds At iterate 0 f= 2.38433D-01 |proj g|= 5.00000D-01 At iterate 1 f= 1.61905D-01 |proj g|= 5.46719D-01 At iterate 2 f= 1.17668D-01 |proj g|= 5.76825D-01 At iterate 3 f= 7.86554D-02 |proj g|= 5.31761D-01 At iterate 4 f= 7.40105D-02 |proj g|= 2.29000D-01 At iterate 5 f= 7.36110D-02 |proj g|= 1.78047D-01 At iterate 6 f= 7.21586D-02 |proj g|= 4.89352D-01 At iterate 7 f= 7.04360D-02 |proj g|= 5.89390D-01 At iterate 8 f= 6.50739D-02 |proj g|= 5.79494D-01 At iterate 9 f= 5.70857D-02 |proj g|= 5.77040D-01 At iterate 10 f= 4.17484D-02 |proj g|= 5.63227D-01 At iterate 11 f= 1.69567D-02 |proj g|= 5.33468D-01 At iterate 12 f= 5.55361D-03 |proj g|= 5.16673D-01 At iterate 13 f= 2.41375D-03 |proj g|= 1.87127D-01 At iterate 14 f= 2.33374D-04 |proj g|= 1.95721D-01 At iterate 15 f= 2.13953D-05 |proj g|= 3.90782D-02 At iterate 16 f= 2.04854D-07 |proj g|= 2.06400D-03 At iterate 17 f= 4.33872D-10 |proj g|= 3.11929D-04 At iterate 18 f= 3.44449D-12 |proj g|= 2.92980D-05 At iterate 19 f= 5.98709D-15 |proj g|= 7.76082D-07 * * * Tit = total number of iterations Tnf = total number of function evaluations Tnint = total number of segments explored during Cauchy searches Skip = number of BFGS updates skipped Nact = number of active bounds at final generalized Cauchy point Projg = norm of the final projected gradient F = final function value * * * N Tit Tnf Tnint Skip Nact Projg F 4 19 27 22 0 0 7.761D-07 5.987D-15 F = 5.9870914464576199E-015 CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL Cauchy time 1.221E-04 seconds. Subspace minimization time 2.441E-04 seconds. Line search time 6.885E-02 seconds. Total User time 2.820E+00 seconds. RUNNING THE L-BFGS-B CODE * * * Machine precision = 2.220D-16 N = 8 M = 10 At X0 0 variables are exactly at the bounds At iterate 0 f= 2.38624D-01 |proj g|= 5.00000D-01 At iterate 1 f= 1.40922D-01 |proj g|= 5.00000D-01 At iterate 2 f= 6.96757D-02 |proj g|= 6.28252D-01 At iterate 3 f= 8.72355D-03 |proj g|= 1.26013D-01 At iterate 4 f= 5.73814D-03 |proj g|= 4.73365D-01 At iterate 5 f= 3.91501D-03 |proj g|= 1.21595D-01 At iterate 6 f= 3.64494D-03 |proj g|= 6.93635D-02 At iterate 7 f= 3.32940D-03 |proj g|= 9.35695D-02 At iterate 8 f= 2.55140D-03 |proj g|= 2.02337D-01 At iterate 9 f= 1.33825D-03 |proj g|= 2.51401D-01 At iterate 10 f= 2.06106D-04 |proj g|= 8.65844D-02 At iterate 11 f= 8.63091D-06 |proj g|= 2.50897D-02 At iterate 12 f= 3.78469D-07 |proj g|= 7.55913D-03 At iterate 13 f= 3.40660D-09 |proj g|= 7.14336D-04 At iterate 14 f= 6.68356D-12 |proj g|= 3.00843D-05 At iterate 15 f= 5.38467D-17 |proj g|= 5.41772D-08 * * * Tit = total number of iterations Tnf = total number of function evaluations Tnint = total number of segments explored during Cauchy searches Skip = number of BFGS updates skipped Nact = number of active bounds at final generalized Cauchy point Projg = norm of the final projected gradient F = final function value * * * N Tit Tnf Tnint Skip Nact Projg F 8 15 20 17 0 0 5.418D-08 5.385D-17 F = 5.3846719372087028E-017 CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL Cauchy time 6.104E-05 seconds. Subspace minimization time 1.221E-04 seconds. Line search time 4.639E-02 seconds. Total User time 3.902E+00 seconds. Test Summary: | Pass Total Time DictOptimization with vectors, scalars and lumping | 55 55 22.6s Test Summary: | Pass Total Time LBFGS Rosenbrock | 1124 1124 17.6s Test Summary: | Pass Total Time entity_eachindex | 2 2 0.1s Test Summary: | Pass Total Time load_balanced_endpoint | 358550 358550 0.2s Test Summary: | Pass Total Time JutulConfig | 24 24 0.3s Test Summary: | Pass Total Time DataDomain | 14 14 1.0s Test Summary: | Pass Total Time get_1d_interpolator | 21 21 2.8s Test Summary: | Pass Total Time get_2d_interpolator | 180720 180720 16.7s Test Summary: | Pass Total Time first_lower fast lookup | 45738 45738 0.0s Test Summary: | Pass Total Time compress_timesteps | 7 7 1.1s Test Summary: | Pass Total Time Transmissibilities | 17 17 7.2s Test Summary: | Pass Total Time IndirectionMap | 3 3 0.2s Test Summary: | Pass Total Time IndexRenumerator | 11 11 0.8s Test Summary: | Pass Total Time numerical_type/eltype | 8 8 0.3s Test Summary: | Pass Total Time jutul_output_path | 2 2 0.5s Test Summary: | Pass Total Time mesh tags | 18 18 0.2s Test Summary: | Pass Total Time check_equal_perm | 12 12 0.2s Test Summary: | Pass Total Time BlendingVariable | 4 4 2.2s Test Summary: | Pass Total Time devectorize_nested | 12 12 7.7s Test Summary: | Pass Total Time Progress recorder | 8 8 0.0s +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ + _ __ _ _ ____ + + | |/ /__ _| | | |_ _| _ \ __ _ _ __ + + | ' // _` | |_| | | | | |_) / _` | '__| + + | . \ (_| | _ | |_| | __/ (_| | | + + |_|\_\__,_|_| |_|\__, |_| \__,_|_| + + |___/ + + Karlsruhe Hypergraph Partitioning Framework + +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ******************************************************************************* * Partitioning Context * ******************************************************************************* Partitioning Parameters: Hypergraph: Partition File: Mode: direct Objective: cut k: 2 epsilon: 0.03 seed: -1 # V-cycles: 0 time limit: -1s hyperedge size ignore threshold: 1000 hyperedge size removal threshold: 4294967295 use individual block weights: false L_opt: 13 L_max: 13 ------------------------------------------------------------------------------- Preprocessing Parameters: enable deduplication: false enable min hash sparsifier: true enable community detection: true ------------------------------------------------------------------------------- MinHash Sparsifier Parameters: max hyperedge size: 1200 max cluster size: 10 min cluster size: 2 number of hash functions: 5 number of combined hash functions: 100 active at median net size >=: 28 sparsifier is active: false ------------------------------------------------------------------------------- Community Detection Parameters: use community detection in IP: true maximum louvain-pass iterations: 100 minimum quality improvement: 0.0001 graph edge weight: degree reuse community structure: false large HE threshold: 4294967295 ------------------------------------------------------------------------------- Coarsening Parameters: Algorithm: ml_style max-allowed-weight-multiplier: 1 contraction-limit-multiplier: 160 hypernode weight fraction: 0.003125 max. allowed hypernode weight: 1 contraction limit: 320 Rating Parameters: Rating Function: heavy_edge Use Community Structure: true Heavy Node Penalty: no_penalty Acceptance Policy: best_prefer_unmatched Partition Policy: normal Fixed Vertex Acceptance Policy: fixed_vertex_allowed ------------------------------------------------------------------------------- Initial Partitioning Parameters: # IP trials: 20 Mode: recursive Technique: multilevel Algorithm: pool Bin Packing algorithm: worst_fit early restart on infeasible: true late restart on infeasible: true IP Coarsening: Coarsening Parameters: Algorithm: ml_style max-allowed-weight-multiplier: 1 contraction-limit-multiplier: 150 hypernode weight fraction: determined before IP max. allowed hypernode weight: determined before IP contraction limit: determined before IP Rating Parameters: Rating Function: heavy_edge Use Community Structure: true Heavy Node Penalty: no_penalty Acceptance Policy: best_prefer_unmatched Partition Policy: normal Fixed Vertex Acceptance Policy: fixed_vertex_allowed IP Local Search: Local Search Parameters: Algorithm: twoway_fm iterations per level: 2147483647 stopping rule: simple max. # fruitless moves: 50 Flow Refinement Parameters: execution policy: UNDEFINED ------------------------------------------------------------------------------- Local Search Parameters: Algorithm: kway_fm_hyperflow_cutter iterations per level: 2147483647 stopping rule: adaptive_opt adaptive stopping alpha: 1 Flow Refinement Parameters: execution policy: exponential ------------------------------------------------------------------------------- Test Summary: | Pass Total Time Partitioning | 181 181 19.8s Test Summary: | Pass Total Time unit conversion | 186 186 1.2s Test Summary: | Pass Total Time SparsityTracingWrapper | 146 146 0.0s Test Summary: | Pass Total Time ad_tags | 3 3 0.2s [ Info: Value 1.0001194468511725 < 1.0001194468511725, setting current best value to (1, 3) ┌ Info: Picking best found triplet. │ best_triplet_W = (1.0001194468511725, 0.014626356362619457) └ best_triplet = (1, 3) [ Info: Value 1.0000002909371606 < Inf, setting current best value to (1, 2, 6) ┌ Info: Picking best found triplet. │ best_triplet_W = (1.0000002909371606, 0.0007637413445774712, 2.027936130755417e-14) └ best_triplet = (1, 2, 6) [ Info: Value 1.0000002909371606 < 1.0000002909371606, setting current best value to (1, 2) ┌ Info: Picking best found triplet. │ best_triplet_W = (1.0000002909371606, 0.0007637413445774712) └ best_triplet = (1, 2) Test Summary: | Pass Total Time triplets | 3308 3308 1.7s Test Summary: | Pass Total Time WENO setup | 17 17 16.1s Testing Jutul tests passed Testing completed after 1037.2s PkgEval succeeded after 1313.39s