Package evaluation of Boscia on Julia 1.12.0-rc2.1 (1fad90817e*) started at 2025-09-11T08:54:06.058 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.89s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [36b166db] + Boscia v0.1.39 Updating `~/.julia/environments/v1.12/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.1.39 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.0 [187b0558] + ConstructionBase v1.6.0 ⌅ [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.14.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.2.0 [f55ce6ea] + FrankWolfe v0.5.6 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.44.0 [3b969827] + MathOptSetDistances v0.2.11 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [92933f4c] + ProgressMeter v1.11.0 [dc4f5ac2] + ProximalCore v0.1.2 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+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 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.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.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile 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.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.11.1+1 [e37daf67] + LibGit2_jll v1.9.0+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.5.20 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+1 [8e850ede] + nghttp2_jll v1.64.0+1 [3f19e933] + p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.93s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 153.31s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_NSRIFs/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 ⌅ [864edb3b] DataStructures v0.18.22 [31c24e10] Distributions v0.25.120 [497a8b3b] DoubleFloats v1.4.3 [f55ce6ea] FrankWolfe v0.5.6 [87dc4568] HiGHS v1.19.0 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.44.0 [3b969827] MathOptSetDistances v0.2.11 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_NSRIFs/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.0 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.4.3 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.14.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.2.0 [f55ce6ea] FrankWolfe v0.5.6 [14197337] GenericLinearAlgebra v0.3.18 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.19.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.44.0 [3b969827] MathOptSetDistances v0.2.11 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [92933f4c] ProgressMeter v1.11.0 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [708f8203] Richardson v1.4.2 [79098fc4] Rmath v0.8.0 [82193955] SCIP v0.12.7 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [4c63d2b9] StatsFuns v1.5.0 [856f2bd8] StructTypes v1.11.0 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.200+0 [e5ac4fe4] SCIP_jll v900.200.200+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.8+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [1317d2d5] oneTBB_jll v2022.0.0+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 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.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.0 [de0858da] Printf v1.11.0 [9abbd945] Profile 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.12.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 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.11.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.1+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+1 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 5599.9 ms ✓ StatsBase 10935.1 ms ✓ Distributions 2 dependencies successfully precompiled in 19 seconds. 46 already precompiled. Precompiling packages... 4761.0 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 7 seconds. 50 already precompiled. Precompiling packages... 4771.4 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 53 already precompiled. seed = 0x64231ce97d6de652 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x6ca096f78c5edf5b seed = 0x0a4b70b107825b41 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution seed = 0x48608ecc7137d664 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 3.686619e+00 3.754626e+00 6.800714e-02 1.844702e-02 1.868000e+01 1.605996e-01 7289 44 12 16 6 0 7 4 3.720453e+00 3.754626e+00 3.417284e-02 9.185128e-03 2.225500e+01 4.942710e-01 31 22 49 6 4 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.474656e+00 9.953850e-01 8.479271e+00 0.000000e+00 Inf 1 LD 3 3.831838e+00 3.752836e+00 7.900171e-02 2.320226e+00 1.292978e+00 2 LD 5 3.754626e+00 3.754626e+00 0.000000e+00 2.516782e+00 1.986664e+00 1 Last 5 3.754626e+00 3.754626e+00 0.000000e+00 2.525736e+00 1.979621e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.754626e+00 3.754626e+00 0.000000e+00 2.530830e+00 1.975636e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.754626269883642 Dual Bound: 3.720453430543996 Dual Gap (relative): 0.009185127559747314 Search Statistics. Total number of nodes processed: 11 Total number of lmo calls: 55 Total time (s): 26.479 LMO calls / sec: 2.0771177159258283 Nodes / sec: 0.4154235431851656 LMO calls / node: 5.0 Total number of global tightenings: 43 Global tightenings / node: 6.14 Total number of local tightenings: 46 Local tightenings / node: 6.57 Total number of potential local tightenings: 46 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.711058e+00 2.302921e+00 5.918633e-01 3.459050e-01 1.577200e+01 1.902105e-01 7021 193 29 50 13 1 * 3 4 1.730051e+00 2.297748e+00 5.676967e-01 3.281387e-01 1.607400e+01 4.354859e-01 121 57 60 21 9 0 100 35 2.111306e+00 2.297748e+00 1.864417e-01 8.830633e-02 2.189900e+01 6.164665e+00 33 24 913 16 9 0 200 35 2.191629e+00 2.297748e+00 1.061183e-01 4.841981e-02 2.529200e+01 9.291476e+00 40 30 1444 22 9 1 300 35 2.246698e+00 2.297748e+00 5.104959e-02 2.272205e-02 2.809400e+01 1.192425e+01 29 21 1928 21 11 0 361 32 2.275259e+00 2.297748e+00 2.248839e-02 9.883881e-03 2.970200e+01 1.323143e+01 16 12 2214 6 6 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.729946e+00 -3.903739e-01 7.120320e+00 0.000000e+00 Inf 1 LD 3 2.409570e+00 2.288457e+00 1.211133e-01 3.114718e-01 9.631691e+00 2 LD 5 2.297748e+00 2.297748e+00 0.000000e+00 5.148101e-01 9.712318e+00 1 Last 5 2.297748e+00 2.297748e+00 0.000000e+00 5.226024e-01 9.567504e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.297748e+00 2.297748e+00 0.000000e+00 5.267047e-01 9.492985e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.2977475982004996 Dual Bound: 2.275259206491535 Dual Gap (relative): 0.009883881205623902 Search Statistics. Total number of nodes processed: 393 Total number of lmo calls: 2220 Total time (s): 31.914 LMO calls / sec: 69.56194773453656 Nodes / sec: 12.314344801654446 LMO calls / node: 5.648854961832061 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Non zero entries: 7th entry: 0.16000366019299006 49th entry: 0.16000366019299006 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.782059e+00 2.302921e+00 5.208615e-01 2.922806e-01 2.580000e-01 1.162791e+01 254 213 29 50 13 1 * 3 4 1.802264e+00 2.297748e+00 4.954836e-01 2.749229e-01 4.710000e-01 1.486200e+01 61 46 60 21 9 0 100 15 2.158022e+00 2.297748e+00 1.397254e-01 6.474695e-02 6.210000e+00 1.851852e+01 33 24 903 21 11 0 191 14 2.275788e+00 2.297748e+00 2.195995e-02 9.649386e-03 1.079400e+01 1.899203e+01 55 27 1634 26 9 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.729946e+00 -3.903739e-01 7.120320e+00 0.000000e+00 Inf 1 LD 3 2.409570e+00 2.288457e+00 1.211133e-01 1.292558e-03 2.320979e+03 2 LD 5 2.297748e+00 2.297748e+00 0.000000e+00 5.134881e-03 9.737324e+02 1 Last 5 2.297748e+00 2.297748e+00 0.000000e+00 1.199963e-02 4.166797e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.297748e+00 2.297748e+00 0.000000e+00 1.545442e-02 3.235320e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.2977475982004996 Dual Bound: 2.2757876450597716 Dual Gap (relative): 0.009649385867964497 Search Statistics. Total number of nodes processed: 205 Total number of lmo calls: 1640 Total time (s): 10.822 LMO calls / sec: 151.5431528368139 Nodes / sec: 18.942894104601738 LMO calls / node: 8.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 seed = 0xe99f512312a882fa Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.221079e+02 -2.071796e+02 1.492837e+01 7.205522e-02 1.684400e+01 1.781050e-01 8150 99 32 765 5 1 100 99 -2.214478e+02 -2.071796e+02 1.426824e+01 6.886895e-02 1.747920e+02 1.138496e+00 1484 114 3103 1204 19 19 * 107 106 -2.214442e+02 -2.087426e+02 1.270162e+01 6.084824e-02 1.878980e+02 1.133594e+00 2170 109 3337 1800 12 10 200 199 -2.212220e+02 -2.087426e+02 1.247942e+01 5.978377e-02 3.352010e+02 1.190331e+00 784 95 6175 591 17 5 * 251 250 -2.211524e+02 -2.093951e+02 1.175731e+01 5.614895e-02 4.168400e+02 1.201900e+00 1285 102 7772 1041 11 5 300 299 -2.210481e+02 -2.093951e+02 1.165299e+01 5.565073e-02 4.878610e+02 1.227809e+00 1386 90 9244 1204 16 11 308 307 -2.210436e+02 -2.093951e+02 1.164856e+01 5.562957e-02 5.000060e+02 1.229985e+00 1097 64 9485 857 17 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.399594e+02 4.355031e+02 4.456302e+00 0.000000e+00 Inf 1 LD 4 -2.107774e+02 -2.118958e+02 1.118493e+00 3.075687e-01 1.300523e+01 2 LD 85 -2.167503e+02 -2.171769e+02 4.265738e-01 6.077345e-01 1.398637e+02 4 LD 129 -2.173981e+02 -2.175884e+02 1.902521e-01 6.316442e-01 2.042289e+02 6 LD 213 -2.176331e+02 -2.177026e+02 6.950244e-02 6.754892e-01 3.153270e+02 7 LD 389 -2.176859e+02 -2.177096e+02 2.367985e-02 7.484867e-01 5.197153e+02 10 LD 641 -2.176945e+02 -2.177031e+02 8.629517e-03 8.796552e-01 7.286946e+02 11 LD 761 -2.176957e+02 -2.176996e+02 3.893974e-03 9.423638e-01 8.075438e+02 11 LD 899 -2.176959e+02 -2.176973e+02 1.347890e-03 1.019091e+00 8.821589e+02 12 P 1000 -2.176959e+02 -2.176973e+02 1.347890e-03 1.073227e+00 9.317693e+02 12 LD 1104 -2.176960e+02 -2.176965e+02 5.344242e-04 1.199974e+00 9.200196e+02 12 LD 1273 -2.176960e+02 -2.176962e+02 2.152699e-04 1.288264e+00 9.881516e+02 12 LD 1386 -2.176960e+02 -2.176960e+02 8.883761e-05 1.348939e+00 1.027474e+03 12 LD 1544 -2.176960e+02 -2.176960e+02 3.745228e-05 1.500808e+00 1.028779e+03 13 LD 1638 -2.176960e+02 -2.176960e+02 1.524457e-05 1.535918e+00 1.066463e+03 13 LD 1737 -2.176960e+02 -2.176960e+02 6.369199e-06 1.573146e+00 1.104157e+03 13 LD 1836 -2.176960e+02 -2.176960e+02 2.803572e-06 1.608994e+00 1.141086e+03 13 LD 1919 -2.176960e+02 -2.176960e+02 1.220113e-06 1.650536e+00 1.162652e+03 13 P 2000 -2.176960e+02 -2.176960e+02 1.220113e-06 1.701888e+00 1.175165e+03 13 P 3000 -2.176960e+02 -2.176960e+02 1.220113e-06 2.541155e+00 1.180566e+03 13 P 4000 -2.176960e+02 -2.176960e+02 1.220113e-06 3.245150e+00 1.232609e+03 13 P 5000 -2.176960e+02 -2.176960e+02 1.220113e-06 3.952876e+00 1.264902e+03 13 P 6000 -2.176960e+02 -2.176960e+02 1.220113e-06 4.723264e+00 1.270308e+03 13 P 7000 -2.176960e+02 -2.176960e+02 1.220113e-06 5.481917e+00 1.276925e+03 13 P 8000 -2.176960e+02 -2.176960e+02 1.220113e-06 6.218610e+00 1.286461e+03 13 P 9000 -2.176960e+02 -2.176960e+02 1.220113e-06 6.723904e+00 1.338508e+03 13 P 10000 -2.176960e+02 -2.176960e+02 1.220113e-06 7.410507e+00 1.349435e+03 13 Last 10001 -2.176960e+02 -2.176960e+02 5.814950e-07 7.415756e+00 1.348615e+03 13 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.176960e+02 -2.176960e+02 5.814950e-07 7.419707e+00 1.347897e+03 13 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -217.69595521364482 Dual Bound: -221.04363546779982 Dual Gap (relative): 0.015377778842374961 Search Statistics. Total number of nodes processed: 615 Total number of lmo calls: 9518 Total time (s): 509.124 LMO calls / sec: 18.69485626291434 Nodes / sec: 1.2079571970679048 LMO calls / node: 15.476422764227642 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.117242e+02 -2.060981e+02 5.626164e+00 2.729848e-02 1.901500e+01 1.577702e-01 7223 98 15 17 4 2 * 2 3 -2.117242e+02 -2.069656e+02 4.758673e+00 2.299258e-02 1.966800e+01 2.542201e-01 121 74 26 18 6 2 * 7 8 -2.106132e+02 -2.079766e+02 2.636572e+00 1.267725e-02 2.227800e+01 6.733100e-01 107 72 77 22 7 0 * 9 10 -2.105700e+02 -2.085243e+02 2.045666e+00 9.810203e-03 2.317800e+01 8.197429e-01 78 59 99 11 4 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.084641e+02 -1.091570e+02 6.929702e-01 0.000000e+00 Inf 1 LD 2 -2.085243e+02 -2.085243e+02 0.000000e+00 1.975892e-01 1.012201e+01 1 Last 2 -2.085243e+02 -2.085243e+02 0.000000e+00 4.038666e-01 4.952130e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.085243e+02 -2.085243e+02 0.000000e+00 4.093692e-01 4.885565e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -208.52430712800435 Dual Bound: -210.5699729994918 Dual Gap (relative): 0.009810203422623986 Search Statistics. Total number of nodes processed: 19 Total number of lmo calls: 104 Total time (s): 25.216 LMO calls / sec: 4.124365482233502 Nodes / sec: 0.753489847715736 LMO calls / node: 5.473684210526316 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Test Suite: Error During Test at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Got exception outside of a @test LoadError: invalid assignment to constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:306 [3] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:306 [7] top-level scope @ none:6 [8] eval(m::Module, e::Any) @ Core ./boot.jl:489 [9] exec_options(opts::Base.JLOptions) @ Base ./client.jl:287 [10] _start() @ Base ./client.jl:554 in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 Test Summary: | Pass Error Total Time Boscia Test Suite | 129 1 130 25m23.6s Norm hyperbox | 4 4 57.1s Norm hyperbox - strong branching | 2 2 50.0s Normbox - Shadow set activation | 4 4 24.1s Normbox - strong convexity and sharpness | 6 6 19.0s Start with Active Set | 2 2 19.0s Interface - sparse poisson regression | 4 4 25.6s Different FW variants | 10 10 1m00.0s Different line search types | 8 8 2m26.9s Lazification | 5 5 20.7s DICG - Lazification | 10 10 51.0s DICG - warm_start | 5 5 43.4s User stop | 2 2 15.4s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 23.7s BLMO - Strong Branching | 4 4 22.2s Probability Simplex LMO | 4 4 48.9s Unit Simplex LMO | 4 4 1m00.9s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 26.7s Hyperplane Aware Rounding - Unit Simplex | 2 2 27.6s Following Gradient Heuristic - Unit Simplex | 6 6 35.9s Rounding Heuristic - Unit Simplex | 3 3 34.5s Probability Rounding - Unit Cube | 2 2 23.7s Probability rounding - Probability Simplex | 3 3 23.0s Sparse Regression | 2 2 32.3s Sparse Regression Group | 7 7 46.6s Poisson sparse regression | 2 2 8m32.7s Hybrid branching poisson sparse regression | 3 3 28.5s RNG of the outermost testset: Xoshiro(0xcd3c74d4c963ec65, 0xb992853ad0919fd6, 0xa732309e985e2433, 0x46b7665903ec3d03, 0x2cf2c40d50652bfb) ERROR: LoadError: Some tests did not pass: 129 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Testing failed after 1551.47s ERROR: LoadError: Package Boscia errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2427 [3] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2280 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:483 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:151 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:305 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:321 [12] _start() @ Base ./client.jl:554 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1737.74s: package tests unexpectedly errored