Package evaluation of Boscia on Julia 1.13.0-DEV.868 (f2a8e18a98*) started at 2025-07-15T18:32:25.382 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 7.09s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.1.39 Updating `~/.julia/environments/v1.13/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.25.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.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.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.0.1 [f55ce6ea] + FrankWolfe v0.5.4 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.42.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.2 [21216c6a] + Preferences v1.4.3 [92933f4c] + ProgressMeter v1.10.4 [dc4f5ac2] + ProximalCore v0.1.2 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.13 [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.7.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.13.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.14.1+1 [e37daf67] + LibGit2_jll v1.9.1+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.5+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.65.0+0 [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 3.4s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 100.54s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_mqJvpc/Project.toml` [4c88cf16] Aqua v0.8.13 [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.4 [87dc4568] HiGHS v1.18.1 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.42.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_mqJvpc/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.13 [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.25.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.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.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.0.1 [f55ce6ea] FrankWolfe v0.5.4 [14197337] GenericLinearAlgebra v0.3.17 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.18.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.42.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.2 [21216c6a] Preferences v1.4.3 [92933f4c] ProgressMeter v1.10.4 [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.1 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.5 [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.1+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+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 [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.7.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.13.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.14.1+1 [e37daf67] LibGit2_jll v1.9.1+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.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [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... 4127.5 ms ✓ StatsBase 8015.7 ms ✓ Distributions 2 dependencies successfully precompiled in 14 seconds. 45 already precompiled. Precompiling packages... 3063.8 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 3 seconds. 23 already precompiled. Precompiling packages... 3708.2 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 5 seconds. 49 already precompiled. Precompiling packages... 4635.7 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 52 already precompiled. seed = 0xff7ed3b5c0f82f02 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xb493e918e76371f4 seed = 0xb8485df55648f55a [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution seed = 0xbc5fccc75e1d2dc7 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.697208e+00 3.855873e+00 1.586649e-01 4.291479e-02 1.757900e+01 1.706582e-01 7240 54 14 15 2 1 17 4 3.832102e+00 3.855873e+00 2.377038e-02 6.202960e-03 2.146600e+01 9.782913e-01 39 29 79 10 6 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.370696e+00 5.209819e-01 8.849714e+00 0.000000e+00 Inf 1 LD 3 3.855873e+00 3.855873e+00 0.000000e+00 2.102598e+00 1.426806e+00 1 Last 3 3.855873e+00 3.855873e+00 0.000000e+00 2.276127e+00 1.318028e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 3 3.855873e+00 3.855873e+00 0.000000e+00 2.280081e+00 1.315743e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.8558725810051353 Dual Bound: 3.832102205834082 Dual Gap (relative): 0.006202959601355257 Search Statistics. Total number of nodes processed: 21 Total number of lmo calls: 84 Total time (s): 25.549 LMO calls / sec: 3.2877999138909546 Nodes / sec: 0.8219499784727387 LMO calls / node: 4.0 Total number of global tightenings: 42 Global tightenings / node: 2.47 Total number of local tightenings: 48 Local tightenings / node: 2.82 Total number of potential local tightenings: 48 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 2.139147e+00 3.650023e+00 1.510876e+00 7.062984e-01 1.510500e+01 1.986097e-01 7201 270 39 88 24 1 * 3 4 2.158364e+00 3.624357e+00 1.465993e+00 6.792152e-01 1.542500e+01 4.538088e-01 111 83 84 35 15 0 100 67 2.967432e+00 3.624357e+00 6.569249e-01 2.213782e-01 2.412900e+01 6.921132e+00 34 24 1338 26 15 0 200 67 3.059702e+00 3.624357e+00 5.646556e-01 1.845460e-01 2.653500e+01 1.006218e+01 27 19 1753 23 16 3 300 67 3.136084e+00 3.624357e+00 4.882735e-01 1.556953e-01 2.891700e+01 1.269150e+01 29 21 2168 20 9 0 400 69 3.192326e+00 3.624357e+00 4.320316e-01 1.353345e-01 3.153600e+01 1.487189e+01 33 24 2615 22 9 1 500 69 3.244294e+00 3.624357e+00 3.800634e-01 1.171483e-01 3.418300e+01 1.664570e+01 36 26 3067 21 7 0 600 69 3.305405e+00 3.624357e+00 3.189524e-01 9.649422e-02 3.689300e+01 1.813352e+01 34 25 3541 30 5 0 700 69 3.360672e+00 3.624357e+00 2.636856e-01 7.846216e-02 3.956100e+01 1.943834e+01 27 20 4022 11 3 0 800 69 3.413585e+00 3.624357e+00 2.107719e-01 6.174502e-02 4.229200e+01 2.054762e+01 35 25 4504 24 5 1 900 67 3.480911e+00 3.624357e+00 1.434458e-01 4.120926e-02 4.507200e+01 2.145456e+01 50 37 5038 28 7 1 997 28 3.588511e+00 3.624357e+00 3.584614e-02 9.989141e-03 4.726100e+01 2.168807e+01 7 5 5468 0 1 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 8.733491e+00 1.572126e+00 7.161364e+00 0.000000e+00 Inf 1 LD 3 3.822466e+00 3.616415e+00 2.060503e-01 2.647922e-01 1.132964e+01 2 LD 5 3.624357e+00 3.624357e+00 0.000000e+00 4.336896e-01 1.152898e+01 1 Last 5 3.624357e+00 3.624357e+00 0.000000e+00 4.415307e-01 1.132424e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.624357e+00 3.624357e+00 0.000000e+00 4.450645e-01 1.123433e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.6243572379396913 Dual Bound: 3.588511093783153 Dual Gap (relative): 0.009989141239841641 Search Statistics. Total number of nodes processed: 1025 Total number of lmo calls: 5474 Total time (s): 49.269 LMO calls / sec: 111.10434553167306 Nodes / sec: 20.80415677200674 LMO calls / node: 5.340487804878049 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: 1 Non zero entries: 3th entry: 0.17005076090049445 32th entry: 0.17005076090049445 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 2.301613e+00 3.650023e+00 1.348411e+00 5.858547e-01 3.400000e-01 8.823529e+00 336 275 39 88 24 1 * 3 4 2.318572e+00 3.624357e+00 1.305785e+00 5.631851e-01 6.360000e-01 1.100629e+01 105 79 84 35 15 0 100 32 3.084163e+00 3.624357e+00 5.401938e-01 1.751508e-01 9.506000e+00 1.388597e+01 22 16 1348 21 14 1 200 33 3.247730e+00 3.624357e+00 3.766272e-01 1.159663e-01 1.347300e+01 1.729385e+01 27 20 2006 19 8 0 300 32 3.377399e+00 3.624357e+00 2.469580e-01 7.312077e-02 1.762200e+01 1.884009e+01 32 23 2713 25 11 3 400 32 3.499278e+00 3.624357e+00 1.250788e-01 3.574418e-02 2.227700e+01 1.939220e+01 43 31 3481 21 7 0 457 16 3.589058e+00 3.624357e+00 3.529917e-02 9.835218e-03 2.484500e+01 1.903804e+01 21 15 3937 12 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 8.733491e+00 1.572126e+00 7.161364e+00 0.000000e+00 Inf 1 LD 3 3.822466e+00 3.616415e+00 2.060503e-01 1.475975e-03 2.032555e+03 2 LD 5 3.624357e+00 3.624357e+00 0.000000e+00 5.301578e-03 9.431154e+02 1 Last 5 3.624357e+00 3.624357e+00 0.000000e+00 1.191103e-02 4.197789e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.624357e+00 3.624357e+00 0.000000e+00 1.614390e-02 3.097145e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.6243572379396913 Dual Bound: 3.589058070003059 Dual Gap (relative): 0.009835217833798454 Search Statistics. Total number of nodes processed: 473 Total number of lmo calls: 3943 Total time (s): 24.875 LMO calls / sec: 158.51256281407035 Nodes / sec: 19.015075376884422 LMO calls / node: 8.33615221987315 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 = 0x50591a50f38cecee 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 -1.165140e+03 -1.141877e+03 2.326360e+01 2.037313e-02 1.561300e+01 1.921476e-01 7681 106 33 410 9 5 * 5 6 -1.162805e+03 -1.143165e+03 1.964027e+01 1.718061e-02 1.717400e+01 6.405031e-01 287 60 119 196 13 9 * 10 11 -1.162253e+03 -1.143888e+03 1.836559e+01 1.605541e-02 1.934200e+01 1.085720e+00 485 65 231 358 6 10 * 15 16 -1.161179e+03 -1.152954e+03 8.224945e+00 7.133804e-03 2.183800e+01 1.419544e+00 676 76 343 523 10 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.601991e+03 1.597674e+03 4.317049e+00 0.000000e+00 Inf 1 LD 6 -1.118649e+03 -1.120435e+03 1.785804e+00 2.839115e-01 2.113334e+01 2 LD 35 -1.137968e+03 -1.138628e+03 6.597947e-01 4.876477e-01 7.177312e+01 3 LD 109 -1.153270e+03 -1.153377e+03 1.068704e-01 5.224405e-01 2.086362e+02 3 LD 154 -1.153909e+03 -1.153942e+03 3.321014e-02 5.458166e-01 2.821460e+02 3 LD 157 -1.153912e+03 -1.153919e+03 7.461785e-03 5.504469e-01 2.852228e+02 3 LD 166 -1.153912e+03 -1.153915e+03 3.130608e-03 6.128504e-01 2.708655e+02 4 LD 177 -1.153912e+03 -1.153913e+03 1.244810e-03 6.208699e-01 2.850839e+02 4 LD 191 -1.153912e+03 -1.153913e+03 5.323879e-04 6.293512e-01 3.034871e+02 4 LD 199 -1.153912e+03 -1.153912e+03 2.329673e-04 6.356799e-01 3.130507e+02 4 LD 212 -1.153912e+03 -1.153912e+03 9.738774e-05 6.441003e-01 3.291413e+02 4 LD 223 -1.153912e+03 -1.153912e+03 4.215105e-05 6.516027e-01 3.422331e+02 4 LD 234 -1.153912e+03 -1.153912e+03 1.788757e-05 6.591063e-01 3.550262e+02 4 LD 245 -1.153912e+03 -1.153912e+03 7.094001e-06 6.665969e-01 3.675384e+02 4 LD 256 -1.153912e+03 -1.153912e+03 2.826022e-06 6.743975e-01 3.795981e+02 4 LD 269 -1.153912e+03 -1.153912e+03 1.240136e-06 6.826554e-01 3.940495e+02 4 LD 281 -1.153912e+03 -1.153912e+03 5.138024e-07 6.907589e-01 4.067989e+02 4 P 1000 -1.153912e+03 -1.153912e+03 5.138024e-07 1.053099e+00 9.495787e+02 4 P 2000 -1.153912e+03 -1.153912e+03 5.138024e-07 1.524167e+00 1.312193e+03 4 P 3000 -1.153912e+03 -1.153912e+03 5.138024e-07 1.976809e+00 1.517598e+03 4 P 4000 -1.153912e+03 -1.153912e+03 5.138024e-07 2.324525e+00 1.720782e+03 4 P 5000 -1.153912e+03 -1.153912e+03 5.138024e-07 2.693814e+00 1.856104e+03 4 P 6000 -1.153912e+03 -1.153912e+03 5.138024e-07 3.071389e+00 1.953513e+03 4 P 7000 -1.153912e+03 -1.153912e+03 5.138024e-07 3.409037e+00 2.053366e+03 4 P 8000 -1.153912e+03 -1.153912e+03 5.138024e-07 3.788323e+00 2.111752e+03 4 P 9000 -1.153912e+03 -1.153912e+03 5.138024e-07 4.144302e+00 2.171656e+03 4 P 10000 -1.153912e+03 -1.153912e+03 5.138024e-07 4.503970e+00 2.220264e+03 4 Last 10001 -1.153912e+03 -1.153912e+03 2.300738e-07 4.507976e+00 2.218512e+03 4 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.153912e+03 -1.153912e+03 2.300738e-07 4.511295e+00 2.216880e+03 4 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -1153.9121352128352 Dual Bound: -1161.178529938247 Dual Gap (relative): 0.006297181998239031 Search Statistics. Total number of nodes processed: 31 Total number of lmo calls: 368 Total time (s): 28.041 LMO calls / sec: 13.123640383723833 Nodes / sec: 1.1055240540636924 LMO calls / node: 11.870967741935484 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 -9.355209e+02 -9.343890e+02 1.131849e+00 1.211326e-03 1.682300e+01 1.783273e-01 5932 34 6 4 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.797458e+02 -4.804205e+02 6.747255e-01 0.000000e+00 Inf 1 LD 2 -9.343890e+02 -9.343890e+02 0.000000e+00 1.786185e-01 1.119705e+01 1 Last 2 -9.343890e+02 -9.343890e+02 0.000000e+00 3.695850e-01 5.411474e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -9.343890e+02 -9.343890e+02 0.000000e+00 3.748081e-01 5.336064e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -934.3890273348237 Dual Bound: -935.5208768124085 Dual Gap (relative): 0.0012113257374320285 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 19.118 LMO calls / sec: 0.5753739930955122 Nodes / sec: 0.15692017993513968 LMO calls / node: 3.6666666666666665 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:310 [3] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1858 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [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:286 [10] _start() @ Base ./client.jl:553 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 17m01.5s Norm hyperbox | 4 4 39.5s Norm hyperbox - strong branching | 2 2 35.0s Normbox - Shadow set activation | 4 4 17.4s Normbox - strong convexity and sharpness | 6 6 13.4s Start with Active Set | 2 2 14.7s Interface - sparse poisson regression | 4 4 17.5s Different FW variants | 10 10 55.2s Different line search types | 8 8 2m24.6s Lazification | 5 5 19.4s DICG - Lazification | 10 10 1m07.2s DICG - warm_start | 5 5 38.4s User stop | 2 2 13.3s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 23.2s BLMO - Strong Branching | 4 4 21.3s Probability Simplex LMO | 4 4 58.4s Unit Simplex LMO | 4 4 1m17.2s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 27.1s Hyperplane Aware Rounding - Unit Simplex | 2 2 26.7s Following Gradient Heuristic - Unit Simplex | 6 6 33.8s Rounding Heuristic - Unit Simplex | 3 3 31.2s Probability Rounding - Unit Cube | 2 2 22.5s Probability rounding - Probability Simplex | 3 3 22.0s Sparse Regression | 2 2 31.1s Sparse Regression Group | 7 7 1m17.8s Poisson sparse regression | 2 2 31.5s Hybrid branching poisson sparse regression | 3 3 22.7s RNG of the outermost testset: Xoshiro(0x7e51e478d47ac78f, 0xadf85b7ba49753a7, 0xb4b79265384e8fae, 0x7c7d02898563b249, 0x773be4a8818370e9) 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 1047.89s ERROR: LoadError: Package Boscia errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/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.13/Pkg/src/Operations.jl:2661 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2510 [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.13/Pkg/src/API.jl:537 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:168 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:309 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:320 [12] _start() @ Base ./client.jl:553 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1177.76s: package tests unexpectedly errored