Package evaluation of Boscia on Julia 1.12.0-rc2.1 (084dab1917*) started at 2025-09-12T09:30:25.311 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.42s ################################################################################ # 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.78s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 222.54s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_XQlXgs/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_XQlXgs/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... 4779.1 ms ✓ StatsBase 10624.8 ms ✓ Distributions 2 dependencies successfully precompiled in 18 seconds. 46 already precompiled. Precompiling packages... 3800.1 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 24 already precompiled. Precompiling packages... 4324.6 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 50 already precompiled. Precompiling packages... 4451.2 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 53 already precompiled. seed = 0x1116e5644384a77e [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xb3ddb92c391edcff seed = 0xf88f82bcfc7c4f24 [ Info: Polish solution seed = 0xdd8875b650bbd40e 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 2.015588e+00 2.085186e+00 6.959757e-02 3.452965e-02 1.807200e+01 1.660027e-01 6894 38 8 8 2 0 9 4 2.076432e+00 2.085186e+00 8.754543e-03 4.216148e-03 2.139500e+01 6.076186e-01 8 5 38 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 6.054296e+00 -4.153791e-01 6.469675e+00 0.000000e+00 Inf 1 LD 3 2.351962e+00 2.032194e+00 3.197684e-01 2.230642e+00 1.344904e+00 2 LD 5 2.085186e+00 2.085186e+00 0.000000e+00 2.415241e+00 2.070187e+00 1 Last 5 2.085186e+00 2.085186e+00 0.000000e+00 2.424020e+00 2.062689e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.085186e+00 2.085186e+00 0.000000e+00 2.428514e+00 2.058872e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.085186044375987 Dual Bound: 2.076431501064288 Dual Gap (relative): 0.004216148381110427 Search Statistics. Total number of nodes processed: 13 Total number of lmo calls: 44 Total time (s): 25.445 LMO calls / sec: 1.7292198860286894 Nodes / sec: 0.5109058754175673 LMO calls / node: 3.3846153846153846 Total number of global tightenings: 46 Global tightenings / node: 5.11 Total number of local tightenings: 48 Local tightenings / node: 5.33 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 1.407905e+00 2.572848e+00 1.164943e+00 8.274303e-01 1.583400e+01 1.894657e-01 7147 287 40 83 23 1 100 55 2.129197e+00 2.572848e+00 4.436505e-01 2.083651e-01 2.419400e+01 6.406547e+00 40 29 1183 21 17 0 200 55 2.237392e+00 2.572848e+00 3.354559e-01 1.499317e-01 2.689500e+01 9.481316e+00 36 25 1608 23 6 0 300 55 2.291924e+00 2.572848e+00 2.809238e-01 1.225711e-01 2.963100e+01 1.198070e+01 36 25 2031 26 16 1 400 55 2.330990e+00 2.572848e+00 2.418583e-01 1.037578e-01 3.235600e+01 1.406231e+01 36 25 2459 32 16 4 500 55 2.372339e+00 2.572848e+00 2.005086e-01 8.451938e-02 3.512800e+01 1.579936e+01 52 36 2915 39 16 5 600 55 2.413924e+00 2.572848e+00 1.589241e-01 6.583643e-02 3.784000e+01 1.730973e+01 32 23 3368 19 8 0 700 51 2.457835e+00 2.572848e+00 1.150132e-01 4.679451e-02 4.044200e+01 1.856980e+01 49 33 3833 35 16 1 800 51 2.506599e+00 2.572848e+00 6.624886e-02 2.642978e-02 4.308700e+01 1.975074e+01 33 22 4303 37 13 1 889 28 2.548060e+00 2.572848e+00 2.478788e-02 9.728140e-03 4.534600e+01 2.022229e+01 8 6 4699 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 6.894171e+00 7.088553e-02 6.823286e+00 0.000000e+00 Inf 1 LD 3 2.766823e+00 2.550566e+00 2.162566e-01 2.748961e-01 1.091321e+01 2 LD 5 2.572848e+00 2.572848e+00 0.000000e+00 4.594861e-01 1.088172e+01 1 Last 5 2.572848e+00 2.572848e+00 0.000000e+00 4.677187e-01 1.069019e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.572848e+00 2.572848e+00 0.000000e+00 4.720520e-01 1.059205e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.5728478706131455 Dual Bound: 2.5480599863726074 Dual Gap (relative): 0.009728139986149149 Search Statistics. Total number of nodes processed: 917 Total number of lmo calls: 4705 Total time (s): 47.416 LMO calls / sec: 99.22810865530623 Nodes / sec: 19.339463472245658 LMO calls / node: 5.1308615049073065 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: 4 Non zero entries: 8th entry: 0.15631639705458822 41th entry: 0.15631639705458822 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.543574e+00 2.572848e+00 1.029274e+00 6.668125e-01 3.510000e-01 8.547009e+00 347 282 40 83 23 1 100 27 2.268340e+00 2.572848e+00 3.045079e-01 1.342426e-01 9.016000e+00 1.408607e+01 25 17 1239 15 12 0 200 27 2.374650e+00 2.572848e+00 1.981982e-01 8.346417e-02 1.335800e+01 1.699356e+01 47 33 1918 36 16 1 300 27 2.464685e+00 2.572848e+00 1.081630e-01 4.388512e-02 1.769400e+01 1.848084e+01 34 24 2614 22 8 0 382 21 2.549153e+00 2.572848e+00 2.369472e-02 9.295133e-03 2.146000e+01 1.877912e+01 45 32 3234 36 10 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 6.894171e+00 7.088553e-02 6.823286e+00 0.000000e+00 Inf 1 LD 3 2.766823e+00 2.550566e+00 2.162566e-01 1.141548e-02 2.628011e+02 2 LD 5 2.572848e+00 2.572848e+00 0.000000e+00 1.592380e-02 3.139953e+02 1 Last 5 2.572848e+00 2.572848e+00 0.000000e+00 2.398111e-02 2.084974e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.572848e+00 2.572848e+00 0.000000e+00 2.793831e-02 1.789657e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.5728478706131455 Dual Bound: 2.5491531527223903 Dual Gap (relative): 0.009295133117227652 Search Statistics. Total number of nodes processed: 403 Total number of lmo calls: 3240 Total time (s): 21.501 LMO calls / sec: 150.69066555043952 Nodes / sec: 18.743314264452817 LMO calls / node: 8.03970223325062 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 seed = 0x721625178af1ab76 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.368976e+02 -1.150103e+02 2.188735e+01 1.903078e-01 1.682100e+01 1.783485e-01 8150 98 30 665 12 1 * 3 4 -1.368962e+02 -1.164528e+02 2.044336e+01 1.755506e-01 1.793400e+01 3.903201e-01 523 91 85 344 11 1 * 5 6 -1.368951e+02 -1.208999e+02 1.599517e+01 1.323009e-01 1.919500e+01 5.730659e-01 782 90 138 575 14 3 * 17 18 -1.368830e+02 -1.217325e+02 1.515052e+01 1.244575e-01 3.793000e+01 9.227524e-01 401 79 504 241 15 1 * 22 23 -1.368813e+02 -1.217393e+02 1.514204e+01 1.243809e-01 4.194400e+01 1.072859e+00 1047 101 640 792 23 5 * 55 56 -1.366960e+02 -1.217817e+02 1.491425e+01 1.224671e-01 8.398200e+01 1.321712e+00 1173 99 1629 889 21 2 100 101 -1.365513e+02 -1.217817e+02 1.476963e+01 1.212796e-01 1.468760e+02 1.368501e+00 1293 97 3029 1076 23 2 * 161 158 -1.363992e+02 -1.355251e+02 8.740611e-01 6.449440e-03 2.360090e+02 1.360118e+00 442 53 4869 335 13 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 3.097073e+02 3.051540e+02 4.553278e+00 0.000000e+00 Inf 1 LD 4 -1.339812e+02 -1.344195e+02 4.382313e-01 3.054500e-01 1.309543e+01 2 LD 278 -1.355047e+02 -1.356945e+02 1.898279e-01 6.106232e-01 4.552726e+02 7 LD 326 -1.355178e+02 -1.356075e+02 8.972958e-02 6.349848e-01 5.133981e+02 8 LD 399 -1.355234e+02 -1.355616e+02 3.813673e-02 6.900425e-01 5.782252e+02 11 LD 476 -1.355248e+02 -1.355397e+02 1.487316e-02 7.372563e-01 6.456371e+02 12 LD 534 -1.355251e+02 -1.355323e+02 7.271070e-03 7.722421e-01 6.914930e+02 12 LD 595 -1.355251e+02 -1.355284e+02 3.346016e-03 8.091787e-01 7.353135e+02 12 LD 688 -1.355251e+02 -1.355265e+02 1.350202e-03 8.643039e-01 7.960163e+02 13 LD 782 -1.355251e+02 -1.355256e+02 4.970493e-04 9.246731e-01 8.457043e+02 14 LD 863 -1.355251e+02 -1.355253e+02 2.019238e-04 9.694759e-01 8.901717e+02 14 LD 959 -1.355251e+02 -1.355252e+02 7.912343e-05 1.024443e+00 9.361187e+02 14 P 1000 -1.355251e+02 -1.355252e+02 7.912343e-05 1.050375e+00 9.520406e+02 14 LD 1069 -1.355251e+02 -1.355251e+02 3.181517e-05 1.158117e+00 9.230501e+02 15 LD 1152 -1.355251e+02 -1.355251e+02 1.495883e-05 1.204839e+00 9.561440e+02 15 LD 1258 -1.355251e+02 -1.355251e+02 5.384869e-06 1.264629e+00 9.947580e+02 16 LD 1330 -1.355251e+02 -1.355251e+02 1.799038e-06 1.304513e+00 1.019537e+03 16 P 2000 -1.355251e+02 -1.355251e+02 1.799038e-06 1.828736e+00 1.093651e+03 16 P 3000 -1.355251e+02 -1.355251e+02 1.799038e-06 2.393110e+00 1.253599e+03 16 P 4000 -1.355251e+02 -1.355251e+02 1.799038e-06 2.909413e+00 1.374848e+03 16 P 5000 -1.355251e+02 -1.355251e+02 1.799038e-06 3.356053e+00 1.489845e+03 16 P 6000 -1.355251e+02 -1.355251e+02 1.799038e-06 3.815013e+00 1.572734e+03 16 P 7000 -1.355251e+02 -1.355251e+02 1.799038e-06 4.298861e+00 1.628338e+03 16 P 8000 -1.355251e+02 -1.355251e+02 1.799038e-06 4.778804e+00 1.674059e+03 16 P 9000 -1.355251e+02 -1.355251e+02 1.799038e-06 5.275249e+00 1.706080e+03 16 P 10000 -1.355251e+02 -1.355251e+02 1.799038e-06 5.705478e+00 1.752702e+03 16 Last 10001 -1.355251e+02 -1.355251e+02 1.391926e-06 5.710303e+00 1.751396e+03 16 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.355251e+02 -1.355251e+02 1.391926e-06 5.713599e+00 1.750385e+03 16 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -135.52511333185691 Dual Bound: -136.399174127558 Dual Gap (relative): 0.006449437851129535 Search Statistics. Total number of nodes processed: 321 Total number of lmo calls: 4903 Total time (s): 243.48 LMO calls / sec: 20.13717759158863 Nodes / sec: 1.318383440118285 LMO calls / node: 15.274143302180685 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 -1.352414e+02 -1.296419e+02 5.599534e+00 4.319231e-02 1.887400e+01 1.589488e-01 7154 113 17 25 6 1 * 3 4 -1.346655e+02 -1.300332e+02 4.632246e+00 3.562355e-02 2.006100e+01 3.489357e-01 120 84 43 28 7 0 * 7 8 -1.341016e+02 -1.312502e+02 2.851409e+00 2.172499e-02 2.226800e+01 6.736124e-01 129 79 94 34 6 0 59 60 -1.325330e+02 -1.312502e+02 1.282870e+00 9.774238e-03 4.742000e+01 2.509490e+00 113 75 736 24 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 -7.028947e+01 -7.099428e+01 7.048157e-01 0.000000e+00 Inf 1 LD 2 -1.312502e+02 -1.312502e+02 0.000000e+00 1.949406e-01 1.025953e+01 1 Last 2 -1.312502e+02 -1.312502e+02 0.000000e+00 3.885998e-01 5.146683e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.312502e+02 -1.312502e+02 0.000000e+00 3.936394e-01 5.080793e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -131.25016810810962 Dual Bound: -132.53303844008892 Dual Gap (relative): 0.009774237629338557 Search Statistics. Total number of nodes processed: 119 Total number of lmo calls: 741 Total time (s): 49.579 LMO calls / sec: 14.945844006535024 Nodes / sec: 2.400209766231671 LMO calls / node: 6.226890756302521 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 21m48.2s Norm hyperbox | 4 4 52.7s Norm hyperbox - strong branching | 2 2 46.1s Normbox - Shadow set activation | 4 4 22.5s Normbox - strong convexity and sharpness | 6 6 19.2s Start with Active Set | 2 2 20.2s Interface - sparse poisson regression | 4 4 25.8s Different FW variants | 10 10 1m02.8s Different line search types | 8 8 2m28.0s Lazification | 5 5 20.7s DICG - Lazification | 10 10 52.2s DICG - warm_start | 5 5 44.6s User stop | 2 2 14.7s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 24.7s BLMO - Strong Branching | 4 4 22.7s Probability Simplex LMO | 4 4 52.5s Unit Simplex LMO | 4 4 52.2s Indicators | 5 5 0.2s Hyperplane Aware Rounding - Probability Simplex | 2 2 25.4s Hyperplane Aware Rounding - Unit Simplex | 2 2 28.6s Following Gradient Heuristic - Unit Simplex | 6 6 40.5s Rounding Heuristic - Unit Simplex | 3 3 37.6s Probability Rounding - Unit Cube | 2 2 21.5s Probability rounding - Probability Simplex | 3 3 23.0s Sparse Regression | 2 2 31.0s Sparse Regression Group | 7 7 1m12.7s Poisson sparse regression | 2 2 4m07.0s Hybrid branching poisson sparse regression | 3 3 53.0s RNG of the outermost testset: Xoshiro(0xdea7d018f8136cbe, 0x4d75e129bacfaff4, 0xe80a759714de3378, 0x03cdb04be61729d8, 0x69dd919cdb7ba2da) 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 1332.77s 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 1588.61s: package tests unexpectedly errored