Package evaluation to test Jutul on Julia 1.12.4 (01a2eadb04*) started at 2026-01-09T14:30:27.201 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 6.38s ################################################################################ # Installation # Installing Jutul... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [2b460a1a] + Jutul v0.4.11 Updating `~/.julia/environments/v1.12/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.13 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [9aa1b823] + FastClosures v0.3.2 [5789e2e9] + FileIO v1.17.1 [1a297f60] + FillArrays v1.15.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.11 ⌅ [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.3.3 [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 [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.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [4af54fe1] + LazyArtifacts v1.11.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.12.1 [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.12.0 [f489334b] + StyledStrings 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.3.0+1 [deac9b47] + LibCURL_jll v8.15.0+0 [e37daf67] + LibGit2_jll v1.9.0+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.11.4 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.4+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.64.0+1 [3f19e933] + p7zip_jll v17.7.0+0 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 8.17s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Error: Failed to use TestEnv.jl; test dependencies will not be precompiled │ exception = │ UndefVarError: `project_rel_path` not defined in `TestEnv` │ Suggestion: this global was defined as `Pkg.Operations.project_rel_path` but not assigned a value. │ Stacktrace: │ [1] get_test_dir(ctx::Pkg.Types.Context, pkgspec::PackageSpec) │ @ TestEnv ~/.julia/packages/TestEnv/iseFl/src/julia-1.11/common.jl:75 │ [2] test_dir_has_project_file │ @ ~/.julia/packages/TestEnv/iseFl/src/julia-1.11/common.jl:52 [inlined] │ [3] maybe_gen_project_override! │ @ ~/.julia/packages/TestEnv/iseFl/src/julia-1.11/common.jl:83 [inlined] │ [4] activate(pkg::String; allow_reresolve::Bool) │ @ TestEnv ~/.julia/packages/TestEnv/iseFl/src/julia-1.11/activate_set.jl:12 │ [5] activate(pkg::String) │ @ TestEnv ~/.julia/packages/TestEnv/iseFl/src/julia-1.11/activate_set.jl:9 │ [6] top-level scope │ @ /PkgEval.jl/scripts/precompile.jl:24 │ [7] include(mod::Module, _path::String) │ @ Base ./Base.jl:306 │ [8] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:317 │ [9] _start() │ @ Base ./client.jl:550 └ @ Main /PkgEval.jl/scripts/precompile.jl:26 Precompiling package dependencies... Precompiling packages... 73259.3 ms ✓ Jutul 1 dependency successfully precompiled in 77 seconds. 174 already precompiled. Precompilation completed after 90.25s ################################################################################ # Testing # Testing Jutul Status `/tmp/jl_38GlNp/Project.toml` ⌅ [2169fc97] AlgebraicMultigrid v0.5.1 [a8cc5b0e] Crayons v4.1.1 ⌅ [864edb3b] DataStructures v0.18.22 [a0c0ee7d] DifferentiationInterface v0.7.13 [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.11 [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.12.0 [56ddb016] Logging v1.11.0 [de0858da] Printf v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_38GlNp/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.13 [ffbed154] DocStringExtensions v0.9.5 [e2ba6199] ExprTools v0.1.10 [9aa1b823] FastClosures v0.3.2 [5789e2e9] FileIO v1.17.1 [1a297f60] FillArrays v1.15.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.11 [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.3.3 [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.1+1 [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 [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.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.1 [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.12.0 [f489334b] StyledStrings 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.3.0+1 [deac9b47] LibCURL_jll v8.15.0+0 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.11.4 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.7.0+0 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 2m14.8s Test Summary: | Pass Total Time Simple heat equation 2D | 1 1 29.2s Precompiling packages... 7688.1 ms ✓ HYPRE_jll 6263.9 ms ✓ HYPRE 2 dependencies successfully precompiled in 14 seconds. 47 already precompiled. Precompiling packages... 5390.4 ms ✓ HDF5 → MPIExt 1 dependency successfully precompiled in 6 seconds. 51 already precompiled. Precompiling packages... 5029.7 ms ✓ HYPRE → HYPRESparseArrays 18386.0 ms ✓ Jutul → JutulHYPREExt 2 dependencies successfully precompiled in 25 seconds. 181 already precompiled. Test Summary: | Pass Total Time Algebraic multigrid heat | 2 2 23.9s Test Summary: | Pass Total Time Variable Poisson | 1 1 30.0s Test Summary: | Pass Total Time data_domain gradients | 81 81 50.3s Test Summary: | Pass Total Time Termination criterion | 4 4 10.8s Test Summary: | Pass Total Time Multi-model: Scalar test system | 5 5 1m04.0s Test Summary: | Pass Total Time Test serialization of results | 6 6 0.9s Test Summary: | Pass Total Time Test restart from stored results | 2 2 0.1s Test Summary: | Pass Total Time Helper | 2 2 22.8s Test Summary: | Pass Total Time CartesianMesh indices | 302 302 0.7s Test Summary: | Pass Total Time UnstructuredMesh | 189 189 1m01.4s Test Summary: | Pass Total Time CoarseMesh | 13 13 2.8s Test Summary: | Pass Total Time Trajectories | 5 5 17.5s Test Summary: | Pass Total Time RadialMeshes | 322 322 4.1s Test Summary: | Pass Total Time extrude_mesh | 65 65 4.8s Test Summary: | Pass Total Time Adjoint utilities | 6 6 4.7s Precompiling packages... 14530.9 ms ✓ Jutul → JutulLBFGSBExt 1 dependency successfully precompiled in 16 seconds. 177 already precompiled. Test Summary: | Pass Total Time simple adjoint sensitivities | 56 56 34.5s Test Summary: | Pass Total Time AdjointDI.solve_adjoint_generic | 227 227 2m13.6s It. | Objective | Proj. grad | Linesearch-its ----------------------------------------------- 0 | 8.2326e-02 | 2.7343e-01 | - LBFGS: Resetting 'm' to number of parameters: m = 2 1 | 1.5410e-03 | 2.7343e-01 | 3 2 | 6.7077e-05 | 2.0528e-01 | 3 3 | 5.4655e-06 | 5.2749e-02 | 1 4 | 1.4128e-08 | 1.4403e-02 | 1 5 | 7.7710e-12 | 7.3924e-04 | 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= 8.23264D-02 |proj g|= 2.73428D-01 At iterate 1 f= 3.04096D-04 |proj g|= 9.67293D-02 At iterate 2 f= 2.00528D-06 |proj g|= 8.75875D-03 At iterate 3 f= 2.91284D-08 |proj g|= 1.06277D-03 At iterate 4 f= 2.39091D-12 |proj g|= 9.62134D-06 At iterate 5 f= 1.85893D-13 |proj g|= 1.70735D-05 * * * 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 5 11 6 0 0 1.707D-05 1.859D-13 F = 1.8589254032701084E-013 CONVERGENCE: REL_REDUCTION_OF_F_<=_FACTR*EPSMCH Cauchy time 0.000E+00 seconds. Subspace minimization time 0.000E+00 seconds. Line search time 2.209E-02 seconds. Total User time 1.171E+00 seconds. Jutul: Simulating 1 second as 1 report steps Jutul: Simulating 1 second as 1 report steps Optimization: Starting calibration of 1 parameters. Optimization: Setting up adjoint storage. Optimization: Finished setup in 0.57143005 seconds. It. | Objective | Proj. grad | Linesearch-its ----------------------------------------------- 0 | 1.5045e+02 | 3.4622e+03 | - LBFGS: Resetting 'm' to number of parameters: m = 1 1 | 2.7143e+01 | 3.4622e+03 | 1 2 | 8.7277e-05 | 1.4704e+03 | 1 3 | 4.8769e-08 | 2.6705e+00 | 1 4 | 2.4397e-15 | 6.3118e-02 | 1 Optimization: Finished in 9.813322663 seconds. Test Summary: | Pass Total Time DictOptimization | 43 43 1m25.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= 8.23264D-02 |proj g|= 2.73428D-01 At iterate 1 f= 3.04096D-04 |proj g|= 9.67293D-02 At iterate 2 f= 2.00528D-06 |proj g|= 8.75875D-03 At iterate 3 f= 2.91284D-08 |proj g|= 1.06277D-03 At iterate 4 f= 2.39079D-12 |proj g|= 9.62134D-06 At iterate 5 f= 2.94323D-18 |proj g|= 1.04427D-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 2 5 11 6 0 0 1.044D-08 2.943D-18 F = 2.9432312734561647E-018 CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL Cauchy time 0.000E+00 seconds. Subspace minimization time 0.000E+00 seconds. Line search time 1.782E-02 seconds. Total User time 8.472E+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= 8.23264D-02 |proj g|= 2.73428D-01 At iterate 1 f= 3.04096D-04 |proj g|= 9.67293D-02 At iterate 2 f= 2.00528D-06 |proj g|= 8.75875D-03 At iterate 3 f= 2.91284D-08 |proj g|= 1.06277D-03 At iterate 4 f= 2.39079D-12 |proj g|= 9.62134D-06 At iterate 5 f= 2.83681D-18 |proj g|= 1.04427D-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 2 5 11 6 0 0 1.044D-08 2.837D-18 F = 2.8368136084319164E-018 CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL Cauchy time 0.000E+00 seconds. Subspace minimization time 1.221E-04 seconds. Line search time 1.831E-02 seconds. Total User time 3.831E-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= 8.23264D-02 |proj g|= 2.76189D-02 At iterate 1 f= 8.15599D-02 |proj g|= 2.78905D-02 ys=-7.501E-06 -gs= 7.628E-04 BFGS update SKIPPED At iterate 2 f= 4.60579D-04 |proj g|= 1.47453D-02 At iterate 3 f= 4.15667D-05 |proj g|= 3.94225D-03 At iterate 4 f= 6.82327D-07 |proj g|= 5.17375D-04 At iterate 5 f= 1.22274D-09 |proj g|= 2.19818D-05 At iterate 6 f= 3.40172D-14 |proj g|= 1.15926D-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 11 6 1 0 1.159D-07 3.402D-14 F = 3.4017186752551176E-014 CONVERGENCE: NORM_OF_PROJECTED_GRADIENT_<=_PGTOL Cauchy time 0.000E+00 seconds. Subspace minimization time 0.000E+00 seconds. Line search time 2.063E-02 seconds. Total User time 3.015E-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= 8.23264D-02 |proj g|= 2.43759D-01 At iterate 1 f= 5.51584D-02 |proj g|= 5.43670D-01 At iterate 2 f= 4.09139D-02 |proj g|= 5.85227D-01 At iterate 3 f= 3.37510D-02 |proj g|= 4.20478D-01 At iterate 4 f= 2.70799D-02 |proj g|= 2.21936D-01 At iterate 5 f= 2.66643D-02 |proj g|= 8.69890D-02 At iterate 6 f= 2.65122D-02 |proj g|= 6.01318D-02 At iterate 7 f= 2.59074D-02 |proj g|= 1.19896D-01 At iterate 8 f= 2.46917D-02 |proj g|= 3.17359D-01 At iterate 9 f= 2.22497D-02 |proj g|= 5.83761D-01 At iterate 10 f= 1.95674D-02 |proj g|= 5.79007D-01 At iterate 11 f= 1.34345D-02 |proj g|= 5.58481D-01 At iterate 12 f= 5.31490D-03 |proj g|= 5.18844D-01 At iterate 13 f= 1.57282D-03 |proj g|= 2.48150D-01 At iterate 14 f= 4.03240D-04 |proj g|= 4.56726D-02 At iterate 15 f= 2.27054D-05 |proj g|= 2.08373D-02 At iterate 16 f= 9.20792D-07 |proj g|= 2.56976D-03 At iterate 17 f= 1.41257D-08 |proj g|= 9.25882D-04 At iterate 18 f= 1.34132D-10 |proj g|= 5.13816D-05 At iterate 19 f= 2.21408D-12 |proj g|= 1.07435D-05 * * * 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 25 19 0 0 1.074D-05 2.214D-12 F = 2.2140759111345977E-012 CONVERGENCE: REL_REDUCTION_OF_F_<=_FACTR*EPSMCH Cauchy time 1.221E-04 seconds. Subspace minimization time 0.000E+00 seconds. Line search time 5.432E-02 seconds. Total User time 3.457E+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= 8.23264D-02 |proj g|= 2.43759D-01 At iterate 1 f= 4.79822D-02 |proj g|= 3.16832D-01 At iterate 2 f= 2.85716D-02 |proj g|= 4.90837D-01 At iterate 3 f= 4.68370D-03 |proj g|= 5.13935D-02 At iterate 4 f= 3.25870D-03 |proj g|= 2.15117D-01 At iterate 5 f= 1.83589D-03 |proj g|= 8.68679D-02 At iterate 6 f= 1.59218D-03 |proj g|= 2.65657D-02 At iterate 7 f= 1.49264D-03 |proj g|= 2.63944D-02 At iterate 8 f= 1.21157D-03 |proj g|= 4.81078D-02 At iterate 9 f= 5.81049D-04 |proj g|= 6.33061D-02 At iterate 10 f= 9.94705D-05 |proj g|= 1.79958D-02 At iterate 11 f= 4.04769D-06 |proj g|= 2.08365D-03 At iterate 12 f= 2.37509D-08 |proj g|= 1.34886D-03 At iterate 13 f= 5.76238D-10 |proj g|= 9.12982D-05 At iterate 14 f= 3.29331D-12 |proj g|= 1.16211D-05 At iterate 15 f= 3.86595D-14 |proj g|= 1.38079D-06 * * * 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 19 15 0 0 1.381D-06 3.866D-14 F = 3.8659475899266043E-014 CONVERGENCE: REL_REDUCTION_OF_F_<=_FACTR*EPSMCH Cauchy time 1.221E-04 seconds. Subspace minimization time 1.221E-04 seconds. Line search time 4.126E-02 seconds. Total User time 5.070E+00 seconds. Test Summary: | Pass Total Time DictOptimization with vectors, scalars and lumping | 55 55 23.3s Test Summary: | Pass Total Time LBFGS Rosenbrock | 1124 1124 12.7s Test Summary: | Pass Total Time entity_eachindex | 2 2 0.1s Test Summary: | Pass Total Time load_balanced_endpoint | 358550 358550 0.4s Test Summary: | Pass Total Time JutulConfig | 24 24 1.0s Test Summary: | Pass Total Time DataDomain | 14 14 1.3s Test Summary: | Pass Total Time get_1d_interpolator | 21 21 2.7s Test Summary: | Pass Total Time get_2d_interpolator | 180720 180720 14.8s 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.9s Test Summary: | Pass Total Time IndirectionMap | 3 3 0.2s Test Summary: | Pass Total Time IndexRenumerator | 11 11 0.7s Test Summary: | Pass Total Time numerical_type/eltype | 8 8 0.3s Test Summary: | Pass Total Time jutul_output_path | 2 2 0.1s 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 1.9s Test Summary: | Pass Total Time devectorize_nested | 12 12 2.8s Test Summary: | Pass Total Time Progress recorder | 8 8 0.1s Precompiling packages... 1359.0 ms ✓ boost_jll 1253.4 ms ✓ KaHyPar_jll 2881.5 ms ✓ KaHyPar 3 dependencies successfully precompiled in 6 seconds. 31 already precompiled. Precompiling packages... 17386.5 ms ✓ Jutul → JutulKaHyParExt 1 dependency successfully precompiled in 19 seconds. 178 already precompiled. +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ + _ __ _ _ ____ + + | |/ /__ _| | | |_ _| _ \ __ _ _ __ + + | ' // _` | |_| | | | | |_) / _` | '__| + + | . \ (_| | _ | |_| | __/ (_| | | + + |_|\_\__,_|_| |_|\__, |_| \__,_|_| + + |___/ + + 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 ------------------------------------------------------------------------------- ******************************************************************************** * Partitioning Result * ******************************************************************************** Objectives: Hyperedge Cut (minimize) = 12 SOED (minimize) = 24 (k-1) (minimize) = 12 Absorption (maximize) = 0 Imbalance = 0 Partition sizes and weights: |part 0 | = 1 w( 0 ) = 13 |part 1 | = 1 w( 1 ) = 12 Timings: Partition time = 0.00121334 s + Input Validation = 1.637e-05 s + Preprocessing = 3.408e-05 s | min hash sparsifier = 0 s | community detection = 3.408e-05 s + Coarsening = 1.252e-05 s + Initial Partitioning = 0.000764732 s + Coarsening = 1.5e-07 s | bisection 1 ( 0 , 1 ) = 1.5e-07 s + Initial Partitioning = 0.000676984 s | bisection 1 ( 0 , 1 ) = 0.000676984 s + Local Search = 3.72e-06 s | bisection 1 ( 0 , 1 ) = 3.72e-06 s + Local Search = 1.636e-05 s | flow refinement = 0 s + Postprocessing = 0 s | undo sparsifier = 0 s Test Summary: | Pass Total Time Partitioning | 181 181 47.5s Test Summary: | Pass Total Time unit conversion | 186 186 1.5s Test Summary: | Pass Total Time SparsityTracingWrapper | 146 146 0.5s Test Summary: | Pass Total Time ad_tags | 3 3 0.3s [ 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 4.8s Test Summary: | Pass Total Time WENO setup | 17 17 17.0s Testing Jutul tests passed Testing completed after 2133.34s PkgEval succeeded after 2252.74s