Package evaluation of LearningToOptimize on Julia 1.13.0-DEV.1035 (d28a587c89*) started at 2025-08-25T01:19:29.175 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.9s ################################################################################ # Installation # Installing LearningToOptimize... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [e1d8bfa7] + LearningToOptimize v1.0.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [621f4979] + AbstractFFTs v1.5.0 [7d9f7c33] + Accessors v0.1.42 [79e6a3ab] + Adapt v4.3.0 [66dad0bd] + AliasTables v1.1.3 [dce04be8] + ArgCheck v2.5.0 [69666777] + Arrow v2.8.0 [31f734f8] + ArrowTypes v2.3.0 [a9b6321e] + Atomix v1.1.2 [fbb218c0] + BSON v0.3.9 [198e06fe] + BangBang v0.4.4 [9718e550] + Baselet v0.1.1 [6e4b80f9] + BenchmarkTools v1.6.0 [c3b6d118] + BitIntegers v0.3.5 [fa961155] + CEnum v0.5.0 [336ed68f] + CSV v0.10.15 ⌅ [324d7699] + CategoricalArrays v0.10.8 [082447d4] + ChainRules v1.72.5 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [5ba52731] + CodecLz4 v0.4.6 [944b1d66] + CodecZlib v0.7.8 [6b39b394] + CodecZstd v0.8.6 [3da002f7] + ColorTypes v0.12.1 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.0 [a33af91c] + CompositionsBase v0.1.2 [ed09eef8] + ComputationalResources v0.3.2 [f0e56b4a] + ConcurrentUtilities v2.5.0 [187b0558] + ConstructionBase v1.6.0 [6add18c4] + ContextVariablesX v0.1.3 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [a93c6f00] + DataFrames v1.7.0 ⌅ [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [244e2a9f] + DefineSingletons v0.1.2 [8bb1440f] + DelimitedFiles v1.9.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [31c24e10] + Distributions v0.25.120 [ffbed154] + DocStringExtensions v0.9.5 [4e289a0a] + EnumX v1.0.5 [e2ba6199] + ExprTools v0.1.10 [cc61a311] + FLoops v0.2.2 [b9860ae5] + FLoopsBase v0.1.1 [5789e2e9] + FileIO v1.17.0 [48062228] + FilePathsBase v0.9.24 [1a297f60] + FillArrays v1.13.0 [53c48c17] + FixedPointNumbers v0.8.5 ⌅ [587475ba] + Flux v0.14.25 [f6369f11] + ForwardDiff v1.0.1 ⌅ [d9f16b24] + Functors v0.4.12 [0c68f7d7] + GPUArrays v11.2.3 [46192b85] + GPUArraysCore v0.2.0 [076d061b] + HashArrayMappedTries v0.2.0 [34004b35] + HypergeometricFunctions v0.3.28 [7869d1d1] + IRTools v0.4.15 [22cec73e] + InitialValues v0.3.1 [842dd82b] + InlineStrings v1.4.4 [3587e190] + InverseFunctions v0.1.17 [41ab1584] + InvertedIndices v1.3.1 [92d709cd] + IrrationalConstants v0.2.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [033835bb] + JLD2 v0.5.15 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.28.0 [b14d175d] + JuliaVariables v0.2.4 [63c18a36] + KernelAbstractions v0.9.38 [929cbde3] + LLVM v9.4.2 [b964fa9f] + LaTeXStrings v1.4.0 [e1d8bfa7] + LearningToOptimize v1.0.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [c2834f40] + MLCore v1.0.0 ⌃ [7e8f7934] + MLDataDevices v1.5.3 [094fc8d1] + MLJFlux v0.6.6 [e80e1ace] + MLJModelInterface v1.12.0 [d8e11817] + MLStyle v0.4.17 [f1d291b0] + MLUtils v0.4.8 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.43.0 [dbeba491] + Metalhead v0.9.5 [128add7d] + MicroCollections v0.2.0 [e1d29d7a] + Missings v1.2.0 [78c3b35d] + Mocking v0.8.1 [d8a4904e] + MutableArithmetics v1.6.4 [872c559c] + NNlib v0.9.31 [77ba4419] + NaNMath v1.1.3 [71a1bf82] + NameResolution v0.1.5 [0b1bfda6] + OneHotArrays v0.2.10 ⌅ [3bd65402] + Optimisers v0.3.4 [bac558e1] + OrderedCollections v1.8.1 [90014a1f] + PDMats v0.11.35 ⌅ [0ce4ce61] + ParametricOptInterface v0.8.2 [69de0a69] + Parsers v2.8.3 [570af359] + PartialFunctions v1.2.1 [2dfb63ee] + PooledArrays v1.4.3 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.5.0 [8162dcfd] + PrettyPrint v0.2.0 [08abe8d2] + PrettyTables v2.4.0 [33c8b6b6] + ProgressLogging v0.1.5 [92933f4c] + ProgressMeter v1.10.4 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [c1ae055f] + RealDot v0.1.0 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [79098fc4] + Rmath v0.8.0 [30f210dd] + ScientificTypesBase v3.0.0 [7e506255] + ScopedValues v1.4.0 [6c6a2e73] + Scratch v1.3.0 [91c51154] + SentinelArrays v1.4.8 [efcf1570] + Setfield v1.1.2 [605ecd9f] + ShowCases v0.1.0 [699a6c99] + SimpleTraits v0.9.5 [a2af1166] + SortingAlgorithms v1.2.2 [dc90abb0] + SparseInverseSubset v0.1.2 [276daf66] + SpecialFunctions v2.5.1 [171d559e] + SplittablesBase v0.1.15 [90137ffa] + StaticArrays v1.9.14 [1e83bf80] + StaticArraysCore v1.4.3 [64bff920] + StatisticalTraits v3.5.0 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.1 [2913bbd2] + StatsBase v0.34.6 [4c63d2b9] + StatsFuns v1.5.0 [892a3eda] + StringManipulation v0.4.1 [354b36f9] + StringViews v1.3.5 [09ab397b] + StructArrays v0.7.1 [856f2bd8] + StructTypes v1.11.0 [dc5dba14] + TZJData v1.5.0+2025b [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [f269a46b] + TimeZones v1.22.0 [3bb67fe8] + TranscodingStreams v0.11.3 [28d57a85] + Transducers v0.4.84 [013be700] + UnsafeAtomics v0.3.0 [ea10d353] + WeakRefStrings v1.4.2 [76eceee3] + WorkerUtilities v1.6.1 ⌅ [e88e6eb3] + Zygote v0.6.77 [700de1a5] + ZygoteRules v0.2.7 [6e34b625] + Bzip2_jll v1.0.9+0 [dad2f222] + LLVMExtra_jll v0.0.37+2 [5ced341a] + Lz4_jll v1.10.1+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f50d1b31] + Rmath_jll v0.5.1+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.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [3fa0cd96] + REPL v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [4607b0f0] + SuiteSparse [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+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.8.12 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.2+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.66.0+0 [3f19e933] + p7zip_jll v17.6.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 6.6s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 854.69s ################################################################################ # Testing # Testing LearningToOptimize Status `/tmp/jl_o8EC5o/Project.toml` [69666777] Arrow v2.8.0 [336ed68f] CSV v0.10.15 [61c947e1] Clarabel v0.11.0 [a93c6f00] DataFrames v1.7.0 [8bb1440f] DelimitedFiles v1.9.1 [31c24e10] Distributions v0.25.120 ⌅ [587475ba] Flux v0.14.25 [87dc4568] HiGHS v1.19.0 [b6b21f68] Ipopt v1.10.6 [4076af6c] JuMP v1.28.0 [e1d8bfa7] LearningToOptimize v1.0.0 [add582a8] MLJ v0.20.9 [094fc8d1] MLJFlux v0.6.6 [872c559c] NNlib v0.9.31 ⌅ [3bd65402] Optimisers v0.3.4 [07a8691f] PGLib v0.2.1 ⌅ [0ce4ce61] ParametricOptInterface v0.8.2 [c36e90e8] PowerModels v0.21.5 [10745b16] Statistics v1.11.1 ⌅ [e88e6eb3] Zygote v0.6.77 [37e2e46d] LinearAlgebra v1.13.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 Status `/tmp/jl_o8EC5o/Manifest.toml` [47edcb42] ADTypes v1.17.0 [14f7f29c] AMD v0.5.3 [da404889] ARFFFiles v1.5.0 [621f4979] AbstractFFTs v1.5.0 [7d9f7c33] Accessors v0.1.42 [79e6a3ab] Adapt v4.3.0 [66dad0bd] AliasTables v1.1.3 [dce04be8] ArgCheck v2.5.0 [4fba245c] ArrayInterface v7.19.0 [69666777] Arrow v2.8.0 [31f734f8] ArrowTypes v2.3.0 [a9b6321e] Atomix v1.1.2 [fbb218c0] BSON v0.3.9 [198e06fe] BangBang v0.4.4 [9718e550] Baselet v0.1.1 [6e4b80f9] BenchmarkTools v1.6.0 [d1d4a3ce] BitFlags v0.1.9 [c3b6d118] BitIntegers v0.3.5 [fa961155] CEnum v0.5.0 [336ed68f] CSV v0.10.15 ⌅ [324d7699] CategoricalArrays v0.10.8 ⌅ [af321ab8] CategoricalDistributions v0.1.15 [082447d4] ChainRules v1.72.5 [d360d2e6] ChainRulesCore v1.26.0 [61c947e1] Clarabel v0.11.0 [523fee87] CodecBzip2 v0.8.5 [5ba52731] CodecLz4 v0.4.6 [944b1d66] CodecZlib v0.7.8 [6b39b394] CodecZstd v0.8.6 [3da002f7] ColorTypes v0.12.1 [861a8166] Combinatorics v1.0.3 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.0 [a33af91c] CompositionsBase v0.1.2 [ed09eef8] ComputationalResources v0.3.2 [f0e56b4a] ConcurrentUtilities v2.5.0 [187b0558] ConstructionBase v1.6.0 [6add18c4] ContextVariablesX v0.1.3 [a8cc5b0e] Crayons v4.1.1 [9a962f9c] DataAPI v1.16.0 [a93c6f00] DataFrames v1.7.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [244e2a9f] DefineSingletons v0.1.2 [8bb1440f] DelimitedFiles v1.9.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.7.7 [b4f34e82] Distances v0.10.12 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [792122b4] EarlyStopping v0.3.0 [4e289a0a] EnumX v1.0.5 [460bff9d] ExceptionUnwrapping v0.1.11 [e2ba6199] ExprTools v0.1.10 [cc61a311] FLoops v0.2.2 [b9860ae5] FLoopsBase v0.1.1 [33837fe5] FeatureSelection v0.2.3 [5789e2e9] FileIO v1.17.0 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.13.0 [6a86dc24] FiniteDiff v2.28.1 [53c48c17] FixedPointNumbers v0.8.5 ⌅ [587475ba] Flux v0.14.25 [f6369f11] ForwardDiff v1.0.1 ⌅ [d9f16b24] Functors v0.4.12 [0c68f7d7] GPUArrays v11.2.3 [46192b85] GPUArraysCore v0.2.0 [14197337] GenericLinearAlgebra v0.3.18 [cd3eb016] HTTP v1.10.17 [076d061b] HashArrayMappedTries v0.2.0 [87dc4568] HiGHS v1.19.0 [34004b35] HypergeometricFunctions v0.3.28 [7869d1d1] IRTools v0.4.15 [2030c09a] InfrastructureModels v0.7.8 [22cec73e] InitialValues v0.3.1 [842dd82b] InlineStrings v1.4.4 [3587e190] InverseFunctions v0.1.17 [41ab1584] InvertedIndices v1.3.1 [b6b21f68] Ipopt v1.10.6 [92d709cd] IrrationalConstants v0.2.4 [b3c1a2ee] IterationControl v0.5.4 [82899510] IteratorInterfaceExtensions v1.0.0 [033835bb] JLD2 v0.5.15 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.28.0 [b14d175d] JuliaVariables v0.2.4 [63c18a36] KernelAbstractions v0.9.38 [929cbde3] LLVM v9.4.2 [b964fa9f] LaTeXStrings v1.4.0 [a5e1c1ea] LatinHypercubeSampling v1.9.0 [92ad9a40] LearnAPI v1.0.1 [e1d8bfa7] LearningToOptimize v1.0.0 [d3d80556] LineSearches v7.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 [e6f89c97] LoggingExtras v1.1.0 [c2834f40] MLCore v1.0.0 ⌃ [7e8f7934] MLDataDevices v1.5.3 ⌅ [64a0f543] MLFlowClient v0.5.1 [add582a8] MLJ v0.20.9 [45f359ea] MLJBalancing v0.1.5 [a7f614a8] MLJBase v1.8.2 [50ed68f4] MLJEnsembles v0.4.3 [7b7b8358] MLJFlow v0.5.0 [094fc8d1] MLJFlux v0.6.6 [614be32b] MLJIteration v0.6.3 [e80e1ace] MLJModelInterface v1.12.0 ⌅ [d491faf4] MLJModels v0.17.9 [03970b2e] MLJTuning v0.8.8 [d8e11817] MLStyle v0.4.17 [f1d291b0] MLUtils v0.4.8 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.43.0 [739be429] MbedTLS v1.1.9 [f28f55f0] Memento v1.4.1 [dbeba491] Metalhead v0.9.5 [128add7d] MicroCollections v0.2.0 [e1d29d7a] Missings v1.2.0 [78c3b35d] Mocking v0.8.1 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.10.0 [2774e3e8] NLsolve v4.5.1 [872c559c] NNlib v0.9.31 [77ba4419] NaNMath v1.1.3 [71a1bf82] NameResolution v0.1.5 [0b1bfda6] OneHotArrays v0.2.10 [8b6db2d4] OpenML v0.3.2 [4d8831e6] OpenSSL v1.5.0 ⌅ [3bd65402] Optimisers v0.3.4 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [07a8691f] PGLib v0.2.1 [d96e819e] Parameters v0.12.3 ⌅ [0ce4ce61] ParametricOptInterface v0.8.2 [69de0a69] Parsers v2.8.3 [570af359] PartialFunctions v1.2.1 [2dfb63ee] PooledArrays v1.4.3 [c36e90e8] PowerModels v0.21.5 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.5.0 [8162dcfd] PrettyPrint v0.2.0 [54e16d92] PrettyPrinting v0.4.2 [08abe8d2] PrettyTables v2.4.0 [33c8b6b6] ProgressLogging v0.1.5 [92933f4c] ProgressMeter v1.10.4 [43287f4e] PtrArrays v1.3.0 [bfc457fd] QDLDL v0.4.1 [1fd47b50] QuadGK v2.11.2 [c1ae055f] RealDot v0.1.0 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [05181044] RelocatableFolders v1.0.1 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.8.0 [321657f4] ScientificTypes v3.1.1 [30f210dd] ScientificTypesBase v3.0.0 [7e506255] ScopedValues v1.4.0 [6c6a2e73] Scratch v1.3.0 [91c51154] SentinelArrays v1.4.8 [efcf1570] Setfield v1.1.2 [605ecd9f] ShowCases v0.1.0 [777ac1f9] SimpleBufferStream v1.2.0 [699a6c99] SimpleTraits v0.9.5 [66db9d55] SnoopPrecompile v1.0.3 [a2af1166] SortingAlgorithms v1.2.2 [dc90abb0] SparseInverseSubset v0.1.2 [276daf66] SpecialFunctions v2.5.1 [171d559e] SplittablesBase v0.1.15 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.14 [1e83bf80] StaticArraysCore v1.4.3 [a19d573c] StatisticalMeasures v0.2.1 [c062fc1d] StatisticalMeasuresBase v0.1.3 [64bff920] StatisticalTraits v3.5.0 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [4c63d2b9] StatsFuns v1.5.0 [892a3eda] StringManipulation v0.4.1 [354b36f9] StringViews v1.3.5 [09ab397b] StructArrays v0.7.1 [856f2bd8] StructTypes v1.11.0 [dc5dba14] TZJData v1.5.0+2025b [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [f269a46b] TimeZones v1.22.0 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [28d57a85] Transducers v0.4.84 [5c2747f8] URIs v1.6.1 [3a884ed6] UnPack v1.0.2 [013be700] UnsafeAtomics v0.3.0 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 ⌅ [e88e6eb3] Zygote v0.6.77 [700de1a5] ZygoteRules v0.2.7 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.1+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1701+0 [dad2f222] LLVMExtra_jll v0.0.37+2 [5ced341a] Lz4_jll v1.10.1+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.0+0 [c8ffd9c3] MbedTLS_jll v2.28.6+2 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f50d1b31] Rmath_jll v0.5.1+0 [319450e9] SPRAL_jll v2025.5.20+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.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [3fa0cd96] REPL v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [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+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.8.12 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.2+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.66.0+0 [3f19e933] p7zip_jll v17.6.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... Precompiling packages... 10581.6 ms ✓ MLDataDevices → MLDataDevicesMLUtilsExt 200520.3 ms ✓ Flux 2 dependencies successfully precompiled in 216 seconds. 169 already precompiled. Precompiling packages... 84610.0 ms ✓ MathOptInterface 9887.2 ms ✓ MathOptIIS 39470.0 ms ✓ HiGHS 3 dependencies successfully precompiled in 137 seconds. 51 already precompiled. Precompiling packages... 69529.8 ms ✓ JuMP 1 dependency successfully precompiled in 72 seconds. 51 already precompiled. Precompiling packages... 9446.6 ms ✓ BangBang → BangBangDataFramesExt 48650.4 ms ✓ JLD2 8231.9 ms ✓ Transducers → TransducersDataFramesExt 10891.6 ms ✓ Distributions 15361.5 ms ✓ GPUArrays 10872.7 ms ✓ ParametricOptInterface 6207.1 ms ✓ Distributions → DistributionsTestExt 6301.6 ms ✓ Distributions → DistributionsChainRulesCoreExt 6781.0 ms ✓ MLDataDevices → MLDataDevicesGPUArraysExt 27375.6 ms ✓ Metalhead 29911.0 ms ✓ MLJFlux 74421.9 ms ✓ LearningToOptimize 12 dependencies successfully precompiled in 264 seconds. 240 already precompiled. Precompiling packages... 54152.0 ms ✓ Ipopt → IpoptMathOptInterfaceExt 1 dependency successfully precompiled in 56 seconds. 75 already precompiled. Precompiling packages... 3285.2 ms ✓ LatinHypercubeSampling 6230.2 ms ✓ MLFlowClient 6903.7 ms ✓ OpenML 10469.0 ms ✓ ScientificTypes 21272.0 ms ✓ StatisticalMeasuresBase 10144.5 ms ✓ CategoricalDistributions 43466.1 ms ✓ StatisticalMeasures 27705.1 ms ✓ MLJModels 15534.0 ms ✓ MLJEnsembles 19503.6 ms ✓ MLJBase 12371.6 ms ✓ StatisticalMeasures → ScientificTypesExt 13039.5 ms ✓ MLJBase → DefaultMeasuresExt 16396.8 ms ✓ MLJBalancing 17030.6 ms ✓ MLJIteration 17002.1 ms ✓ MLJTuning 16216.4 ms ✓ MLJFlow 23196.7 ms ✓ MLJ 17 dependencies successfully precompiled in 284 seconds. 190 already precompiled. Precompiling packages... 6113.1 ms ✓ JLD2 → UnPackExt 1 dependency successfully precompiled in 6 seconds. 39 already precompiled. Precompiling packages... 6954.2 ms ✓ FileIO → HTTPExt 1 dependency successfully precompiled in 7 seconds. 47 already precompiled. Precompiling packages... 1993.7 ms ? Memento 2125.3 ms ✓ DifferentiationInterface → DifferentiationInterfaceForwardDiffExt 15831.4 ms ? InfrastructureModels 4882.2 ms ✓ NLSolversBase 7278.3 ms ✓ LineSearches 5240.1 ms ✓ NLsolve 16730.6 ms ? PowerModels Info Given PGLib was explicitly requested, output will be shown live  WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 16178.4 ms ? PGLib 4 dependencies successfully precompiled in 73 seconds. 76 already precompiled. 4 dependencies failed but may be precompilable after restarting julia 4 dependencies had output during precompilation: ┌ Memento │ WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ ┌ InfrastructureModels │ WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ ┌ PGLib │ [Output was shown above] └ ┌ PowerModels │ WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. Precompiling packages... 2053.4 ms ? Memento 14847.9 ms ? InfrastructureModels Info Given PowerModels was explicitly requested, output will be shown live  WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 15838.8 ms ? PowerModels WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. Precompiling packages... 1935.5 ms ? Memento Info Given InfrastructureModels was explicitly requested, output will be shown live  WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 14481.1 ms ? InfrastructureModels WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. Precompiling packages... Info Given Memento was explicitly requested, output will be shown live  WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 1314.8 ms ? Memento WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. Precompiling packages... 9730.5 ms ✓ Zygote → ZygoteDistancesExt 1 dependency successfully precompiled in 11 seconds. 110 already precompiled. Precompiling packages... 4964.0 ms ✓ DifferentiationInterface → DifferentiationInterfaceZygoteExt 1 dependency successfully precompiled in 7 seconds. 115 already precompiled. Precompiling packages... 1578.7 ms ✓ ArrayInterface → ArrayInterfaceChainRulesExt 1 dependency successfully precompiled in 2 seconds. 40 already precompiled. ┌ Warning: `MvNormal(μ::AbstractVector{<:Real}, σ::Real)` is deprecated, use `MvNormal(μ, σ ^ 2 * I)` instead. │ caller = ip:0x0 └ @ Core :-1 ┌ Warning: No functional GPU backend found! Defaulting to CPU. │ │ 1. If no GPU is available, nothing needs to be done. │ 2. If GPU is available, load the corresponding trigger package. │ a. `CUDA.jl` and `cuDNN.jl` (or just `LuxCUDA.jl`) for NVIDIA CUDA Support. │ b. `AMDGPU.jl` for AMD GPU ROCM Support. │ c. `Metal.jl` for Apple Metal GPU Support. (Experimental) │ d. `oneAPI.jl` for Intel oneAPI GPU Support. (Experimental) └ @ MLDataDevices.Internal ~/.julia/packages/MLDataDevices/hoL1S/src/internal.jl:94 ┌ Warning: Layer with Float32 parameters got Float64 input. │ The input will be converted, but any earlier layers may be very slow. │ layer = Dense(10 => 1) # 11 parameters │ summary(x) = "10×32 Matrix{Float64}" └ @ Flux ~/.julia/packages/Flux/vwk6M/src/layers/stateless.jl:59 Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [1e-01, 1e+10] Cost [3e-01, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 9 rows, 6 cols, 26 nonzeros 0s 5 rows, 5 cols, 17 nonzeros 0s 4 rows, 5 cols, 14 nonzeros 0s Solving MIP model with: 4 rows 5 cols (1 binary, 0 integer, 0 implied int., 4 continuous, 0 domain fixed) 14 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% -inf -1.22296546 Large 0 0 0 0 0.2s T 0 0 0 0.00% -2.760313812 -1.635215888 68.80% 0 0 0 2 0.2s 1 0 1 100.00% -1.635215888 -1.635215888 0.00% 0 0 0 2 0.2s Solving report Status Optimal Primal bound -1.63521588768 Dual bound -1.63521588768 Gap 0% (tolerance: 0.01%) P-D integral 0.00104700833357 Solution status feasible -1.63521588768 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.18 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 2 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [2e-01, 1e+10] Cost [2e-01, 6e-01] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 10 rows, 9 cols, 36 nonzeros 0s Solving MIP model with: 10 rows 9 cols (3 binary, 0 integer, 0 implied int., 6 continuous, 0 domain fixed) 36 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% -inf -0.1574913345 Large 0 0 0 0 0.0s 0 0 0 0.00% -1.419449766 -0.1574913345 801.29% 0 0 2 6 0.0s L 0 0 0 0.00% -0.5396084996 -0.5396084037 0.00% 29 5 2 11 0.0s 1 0 1 100.00% -0.5396084996 -0.5396084037 0.00% 29 5 2 12 0.0s Solving report Status Optimal Primal bound -0.539608403669 Dual bound -0.53960849964 Gap 1.8e-05% (tolerance: 0.01%) P-D integral 0.0750967648756 Solution status feasible -0.539607973359 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 1 (1 feasible; 4 iterations) LP iterations 12 (total) 0 (strong br.) 5 (separation) 1 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [1e-01, 1e+10] Cost [8e-02, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 9 rows, 6 cols, 26 nonzeros 0s 5 rows, 5 cols, 17 nonzeros 0s 4 rows, 5 cols, 14 nonzeros 0s Solving MIP model with: 4 rows 5 cols (1 binary, 0 integer, 0 implied int., 4 continuous, 0 domain fixed) 14 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% -inf -4.051405142 Large 0 0 0 0 0.0s R 0 0 0 0.00% -8.495844625 -7.742409494 9.73% 0 0 0 3 0.0s 1 0 1 100.00% -7.742409494 -7.742409494 0.00% 0 0 0 4 0.0s Solving report Status Optimal Primal bound -7.74240949399 Dual bound -7.74240949399 Gap 0% (tolerance: 0.01%) P-D integral 0.00211061748147 Solution status feasible -7.74240949399 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 4 (total) 0 (strong br.) 1 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [1e-01, 1e+10] Cost [5e-02, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 8 rows, 8 cols, 29 nonzeros 0s 6 rows, 6 cols, 22 nonzeros 0s 4 rows, 5 cols, 14 nonzeros 0s Solving MIP model with: 4 rows 5 cols (1 binary, 0 integer, 0 implied int., 4 continuous, 0 domain fixed) 14 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 100.00% -inf 1.720533863 Large 0 0 0 0 0.0s 1 0 1 100.00% 1.720533863 1.720533863 0.00% 0 0 0 0 0.0s Solving report Status Optimal Primal bound 1.72053386348 Dual bound 1.72053386348 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 1.72053386348 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 0 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [3e-02, 1e+10] Cost [4e-01, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous, 0 domain fixed) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% -inf 0 Large 0 0 0 0 0.0s 0 0 0 0.00% -1.203978645 0 Large 0 0 3 5 0.0s C 0 0 0 0.00% -0.9719005424 -0.9719001327 0.00% 2 0 3 8 0.0s 1 0 1 100.00% -0.9719001327 -0.9719001327 0.00% 0 0 3 9 0.0s Solving report Status Optimal Primal bound -0.971900132749 Dual bound -0.971900132749 Gap 0% (tolerance: 0.01%) P-D integral 3.42004942661e-10 Solution status feasible -0.971900132749 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 9 (total) 0 (strong br.) 3 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [1e-01, 1e+10] Cost [1e-02, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 8 rows, 8 cols, 29 nonzeros 0s 7 rows, 6 cols, 23 nonzeros 0s 5 rows, 5 cols, 17 nonzeros 0s 4 rows, 5 cols, 14 nonzeros 0s Solving MIP model with: 4 rows 5 cols (1 binary, 0 integer, 0 implied int., 4 continuous, 0 domain fixed) 14 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% -inf -4.248306919 Large 0 0 0 0 0.0s R 0 0 0 0.00% -5.573829977 -5.267622124 5.81% 0 0 0 3 0.0s 1 0 1 100.00% -5.267622124 -5.267622124 0.00% 3 1 0 4 0.0s Solving report Status Optimal Primal bound -5.26762212368 Dual bound -5.26762212368 Gap 0% (tolerance: 0.01%) P-D integral 0.000614791467975 Solution status feasible -5.26762212368 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 4 (total) 0 (strong br.) 1 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [4e-02, 1e+10] Cost [8e-01, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous, 0 domain fixed) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% -inf 2.704246485 Large 0 0 0 0 0.0s 0 0 0 0.00% 1.44031342 2.704246485 46.74% 0 0 1 4 0.0s 1 0 1 100.00% 2.704246485 2.704246485 0.00% 0 0 1 7 0.0s Solving report Status Optimal Primal bound 2.7042464848 Dual bound 2.7042464848 Gap 0% (tolerance: 0.01%) P-D integral 0.000644144578307 Solution status feasible 2.7042464848 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 7 (total) 0 (strong br.) 3 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [5e-02, 1e+10] Cost [7e-02, 6e-01] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 8 rows, 8 cols, 29 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous, 0 domain fixed) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% -inf -0.1824965989 Large 0 0 0 0 0.0s R 0 0 0 0.00% -0.8671450622 -0.7656834398 13.25% 0 0 0 5 0.0s 1 0 1 100.00% -0.7656834398 -0.7656834398 0.00% 0 0 0 9 0.0s Solving report Status Optimal Primal bound -0.765683439805 Dual bound -0.765683439805 Gap 0% (tolerance: 0.01%) P-D integral 0.00522501515933 Solution status feasible -0.765683439805 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 9 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [2e-01, 1e+10] Cost [4e-01, 7e-01] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 8 rows, 7 cols, 28 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous, 0 domain fixed) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% -inf -1.496314785 Large 0 0 0 0 0.0s R 0 0 0 0.00% -5.215552824 -4.888240453 6.70% 0 0 0 5 0.0s 1 0 1 100.00% -4.888240473 -4.888240453 0.00% 0 0 0 6 0.0s Solving report Status Optimal Primal bound -4.88824045251 Dual bound -4.88824047342 Gap 0% (tolerance: 0.01%) P-D integral 0.0040295104052 Solution status feasible -4.88824045251 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 6 (total) 0 (strong br.) 1 (separation) 0 (heuristics) Running HiGHS 1.11.0 (git hash: 364c83a51e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [1e-01, 1e+10] Cost [3e-01, 4e-01] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 8 rows, 8 cols, 29 nonzeros 0s 4 rows, 5 cols, 14 nonzeros 0s Solving MIP model with: 4 rows 5 cols (1 binary, 0 integer, 0 implied int., 4 continuous, 0 domain fixed) 14 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 100.00% -inf 0 Large 0 0 0 0 0.0s 1 0 1 100.00% 0 0 0.00% 0 0 0 0 0.0s Solving report Status Optimal Primal bound 0 Dual bound 0 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 0 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 0 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 279 running 1 of 1 signal (10): User defined signal 1 _useref_getindex at ./../usr/share/julia/Compiler/src/ssair/ir.jl:530 unknown function (ip: 0x7ffe08fc12ff) at (unknown file) iterate at ./../usr/share/julia/Compiler/src/ssair/ir.jl:661 [inlined] iterate at ./../usr/share/julia/Compiler/src/ssair/ir.jl:660 [inlined] renumber_ssa2! at ./../usr/share/julia/Compiler/src/ssair/ir.jl:1350 process_node! at ./../usr/share/julia/Compiler/src/ssair/ir.jl:1535 iterate_compact at ./../usr/share/julia/Compiler/src/ssair/ir.jl:1949 iterate at ./../usr/share/julia/Compiler/src/ssair/ir.jl:1871 [inlined] iterate at ./../usr/share/julia/Compiler/src/ssair/ir.jl:1871 [inlined] batch_inline! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:648 ssa_inlining_pass! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:79 [inlined] run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1035 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1048 [inlined] optimize at ./../usr/share/julia/Compiler/src/optimize.jl:1021 jfptr_optimize_86086.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 finish_nocycle at ./../usr/share/julia/Compiler/src/typeinfer.jl:232 jfptr_finish_nocycle_86418.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4528 typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1385 typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1568 [inlined] typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1577 jfptr_typeinf_ext_toplevel_82900.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] jl_type_infer at /source/src/gf.c:462 jl_compile_method_internal at /source/src/gf.c:3511 _jl_invoke at /source/src/gf.c:4003 [inlined] ijl_apply_generic at /source/src/gf.c:4208 eachcolumn at /home/pkgeval/.julia/packages/Tables/cRTb7/src/utils.jl:70 unknown function (ip: 0x7b60f329f0f5) at (unknown file) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 toarrowtable at /home/pkgeval/.julia/packages/Arrow/3GbnS/src/write.jl:527 unknown function (ip: 0x7b60f329bbb8) at (unknown file) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 macro expansion at /home/pkgeval/.julia/packages/Arrow/3GbnS/src/write.jl:264 [inlined] macro expansion at ./task.jl:633 [inlined] write at /home/pkgeval/.julia/packages/Arrow/3GbnS/src/write.jl:254 #137 at /home/pkgeval/.julia/packages/Arrow/3GbnS/src/write.jl:58 unknown function (ip: 0x7b60f3294642) at (unknown file) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 #open#332 at ./io.jl:420 open at ./io.jl:417 [inlined] #write#135 at /home/pkgeval/.julia/packages/Arrow/3GbnS/src/write.jl:57 [inlined] write at /home/pkgeval/.julia/packages/Arrow/3GbnS/src/write.jl:56 [inlined] #test_compress_batch_arrow#17 at /home/pkgeval/.julia/packages/LearningToOptimize/zmKk4/test/datasetgen.jl:191 test_compress_batch_arrow at /home/pkgeval/.julia/packages/LearningToOptimize/zmKk4/test/datasetgen.jl:185 [inlined] test_compress_batch_arrow at /home/pkgeval/.julia/packages/LearningToOptimize/zmKk4/test/datasetgen.jl:185 [inlined] #159 at /home/pkgeval/.julia/packages/LearningToOptimize/zmKk4/test/runtests.jl:44 #mktempdir#21 at ./file.jl:899 _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 mktempdir at ./file.jl:895 mktempdir at ./file.jl:895 jfptr_mktempdir_63618.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:708 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:899 jl_toplevel_eval_flex at /source/src/toplevel.c:773 jl_toplevel_eval_flex at /source/src/toplevel.c:713 ijl_toplevel_eval at /source/src/toplevel.c:785 ijl_toplevel_eval_in at /source/src/toplevel.c:830 eval at ./boot.jl:489 include_string at ./loading.jl:2863 _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 _include at ./loading.jl:2923 include at ./Base.jl:309 IncludeInto at ./Base.jl:310 jfptr_IncludeInto_68479.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:708 jl_interpret_toplevel_thunk at /source/src/interpreter.c:899 jl_toplevel_eval_flex at /source/src/toplevel.c:773 jl_toplevel_eval_flex at /source/src/toplevel.c:713 ijl_toplevel_eval at /source/src/toplevel.c:785 ijl_toplevel_eval_in at /source/src/toplevel.c:830 eval at ./boot.jl:489 exec_options at ./client.jl:296 _start at ./client.jl:563 jfptr__start_71327.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7b61091b3249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1200 wait_forever at ./task.jl:1137 jfptr_wait_forever_63342.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] start_task at /source/src/task.c:1253 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.13/Profile/src/Profile.jl:1362 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007e9b8a06c880 Total snapshots: 409. Utilization: 0% ╎409 @Base/task.jl:1137 wait_forever() 408╎ 409 @Base/task.jl:1200 wait() [279] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/LearningToOptimize/zmKk4/test/runtests.jl:33 adce_pass! at ./../usr/share/julia/Compiler/src/ssair/passes.jl:2161 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1035 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1048 [inlined] optimize at ./../usr/share/julia/Compiler/src/optimize.jl:1021 jfptr_optimize_86086.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 finish_nocycle at ./../usr/share/julia/Compiler/src/typeinfer.jl:232 jfptr_finish_nocycle_86418.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4528 typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1385 typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1568 [inlined] typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1577 jfptr_typeinf_ext_toplevel_82900.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] jl_type_infer at /source/src/gf.c:462 jl_compile_method_internal at /source/src/gf.c:3511 _jl_invoke at /source/src/gf.c:4003 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] jl_f_invoke_in_world at /source/src/builtins.c:896 ansi_write_ at ./strings/annotated_io.jl:216 [inlined] print at ./strings/annotated_io.jl:241 [inlined] print at ./strings/io.jl:46 println at ./strings/io.jl:77 [inlined] print_tree at /source/usr/share/julia/stdlib/v1.13/Profile/src/Profile.jl:1249 tree at /source/usr/share/julia/stdlib/v1.13/Profile/src/Profile.jl:1309 print_group at /source/usr/share/julia/stdlib/v1.13/Profile/src/Profile.jl:389 #print#5 at /source/usr/share/julia/stdlib/v1.13/Profile/src/Profile.jl:331 print at /source/usr/share/julia/stdlib/v1.13/Profile/src/Profile.jl:271 [inlined] print at /source/usr/share/julia/stdlib/v1.13/Profile/src/Profile.jl:271 [inlined] print at /source/usr/share/julia/stdlib/v1.13/Profile/src/Profile.jl:271 _peek_report at /source/usr/share/julia/stdlib/v1.13/Profile/src/Profile.jl:94 unknown function (ip: 0x7b60f32cd80f) at (unknown file) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] jl_f_invokelatest at /source/src/builtins.c:877 profile_printing_listener at ./Base.jl:336 #start_profile_listener##0 at ./Base.jl:354 jfptr_YY.start_profile_listenerYY.YY.0_1495.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4011 [inlined] ijl_apply_generic at /source/src/gf.c:4208 jl_apply at /source/src/julia.h:2378 [inlined] start_task at /source/src/task.c:1253 unknown function (ip: (nil)) at (unknown file) Allocations: 303486993 (Pool: 303483741; Big: 3252); GC: 216 PkgEval terminated after 2729.01s: test duration exceeded the time limit