Package evaluation of Boscia on Julia 1.13.0-DEV.1216 (bcb9a929e5*) started at 2025-09-28T18:37:58.695 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 10.04s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.2.0 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.2.0 [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.33 [f6369f11] + ForwardDiff v1.2.1 [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.45.0 [3b969827] + MathOptSetDistances v0.2.11 [d8a4904e] + MutableArithmetics v1.6.6 [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.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.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [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.16.0+0 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.9.9 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.2+0 [efcefdf7] + PCRE2_jll v10.46.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.67.1+0 [3f19e933] + p7zip_jll v17.6.0+0 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 5.87s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 146.96s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_Of2xOA/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.0 [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.45.0 [3b969827] MathOptSetDistances v0.2.11 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_Of2xOA/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.2.0 [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.33 [f6369f11] ForwardDiff v1.2.1 [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.45.0 [3b969827] MathOptSetDistances v0.2.11 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.6 [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 [fd094767] Suppressor v0.2.8 [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.9+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.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.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.9.9 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.2+0 [efcefdf7] PCRE2_jll v10.46.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.67.1+0 [3f19e933] p7zip_jll v17.6.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 8691.6 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 10 seconds. 52 already precompiled. Interface Tests seed = 0xba09014031710415 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution LMO Tests seed = 0xe31b8eb147039013 [ Info: Polish solution Indicator Tests Heuristics Tests seed = 0x45a57498d8b07d77 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Sparse Regression Tests seed = 0x74814114268c60b6 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 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.024552e+00 3.262589e+00 2.380373e-01 7.870169e-02 1.835900e+01 1.634076e-01 7322 77 17 19 6 1 * 5 6 3.059235e+00 3.254168e+00 1.949330e-01 6.371951e-02 2.195900e+01 5.009336e-01 71 52 59 14 7 0 73 14 3.222550e+00 3.254168e+00 3.161848e-02 9.811635e-03 2.348500e+01 3.704492e+00 10 7 297 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.738576e+00 4.714014e-01 7.267175e+00 0.000000e+00 Inf 1 LD 2 3.254168e+00 3.254168e+00 0.000000e+00 2.015897e+00 9.921143e-01 1 Last 2 3.254168e+00 3.254168e+00 0.000000e+00 2.180867e+00 9.170663e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.254168e+00 3.254168e+00 0.000000e+00 2.186180e+00 9.148376e-01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.254168299249411 Dual Bound: 3.22254981751163 Dual Gap (relative): 0.009811634739039078 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 302 Total time (s): 27.378 LMO calls / sec: 11.030754620498211 Nodes / sec: 3.1777339469647163 LMO calls / node: 3.471264367816092 Total number of global tightenings: 38 Global tightenings / node: 0.52 Total number of local tightenings: 51 Local tightenings / node: 0.7 Total number of potential local tightenings: 51 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 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.101895e+00 2.653138e+00 1.551243e+00 1.407796e+00 1.590600e+01 1.886081e-01 7521 327 46 106 31 1 * 3 4 1.115000e+00 2.641773e+00 1.526773e+00 1.369303e+00 1.629300e+01 4.296324e-01 151 115 99 45 21 0 100 51 1.926777e+00 2.641773e+00 7.149958e-01 3.710839e-01 2.420700e+01 6.237865e+00 26 19 1228 21 19 2 200 51 1.988025e+00 2.641773e+00 6.537480e-01 3.288430e-01 2.684800e+01 9.348927e+00 26 19 1626 20 18 1 300 51 2.031596e+00 2.641773e+00 6.101771e-01 3.003438e-01 2.932200e+01 1.197053e+01 22 16 2037 13 7 0 400 51 2.071063e+00 2.641773e+00 5.707098e-01 2.755637e-01 3.188200e+01 1.414591e+01 53 29 2471 31 16 0 500 51 2.107165e+00 2.641773e+00 5.346079e-01 2.537096e-01 3.459600e+01 1.592670e+01 30 22 2912 27 16 7 600 51 2.143151e+00 2.641773e+00 4.986219e-01 2.326583e-01 3.747000e+01 1.737390e+01 38 27 3387 42 17 2 700 51 2.179624e+00 2.641773e+00 4.621490e-01 2.120316e-01 4.031800e+01 1.862692e+01 41 30 3865 38 14 2 800 51 2.215721e+00 2.641773e+00 4.260514e-01 1.922856e-01 4.339700e+01 1.960965e+01 39 28 4392 31 8 1 900 51 2.261840e+00 2.641773e+00 3.799327e-01 1.679751e-01 4.573700e+01 2.079279e+01 28 21 4922 28 8 2 1000 51 2.316771e+00 2.641773e+00 3.250021e-01 1.402824e-01 4.839600e+01 2.171667e+01 14 10 5466 2 1 0 1100 51 2.396996e+00 2.641773e+00 2.447764e-01 1.021180e-01 5.138600e+01 2.239910e+01 29 21 6006 13 3 0 1200 23 2.550789e+00 2.641773e+00 9.098312e-02 3.566861e-02 5.382200e+01 2.272305e+01 38 27 6477 30 2 0 1211 14 2.616644e+00 2.641773e+00 2.512832e-02 9.603263e-03 5.403700e+01 2.266965e+01 12 9 6518 2 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.335876e+00 -1.857123e-01 6.521589e+00 0.000000e+00 Inf 1 LD 2 2.641773e+00 2.641773e+00 0.000000e+00 1.620436e-01 1.234236e+01 1 Last 2 2.641773e+00 2.641773e+00 0.000000e+00 3.305958e-01 6.049684e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.641773e+00 2.641773e+00 0.000000e+00 3.353641e-01 5.963668e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.641772619381151 Dual Bound: 2.616644296361758 Dual Gap (relative): 0.009603262871583883 Search Statistics. Total number of nodes processed: 1225 Total number of lmo calls: 6523 Total time (s): 56.016 LMO calls / sec: 116.4488717509283 Nodes / sec: 21.86875178520423 LMO calls / node: 5.324897959183674 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: 23 Non zero entries: 17th entry: 0.15841009677231283 36th entry: 0.15841009677231283 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 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.209266e+00 2.653138e+00 1.443872e+00 1.194007e+00 4.370000e-01 6.864989e+00 431 325 46 106 31 1 * 3 4 1.222661e+00 2.641773e+00 1.419111e+00 1.160674e+00 8.160000e-01 8.578431e+00 140 108 99 45 21 0 100 37 1.976290e+00 2.641773e+00 6.654822e-01 3.367330e-01 8.309000e+00 1.648815e+01 20 14 1195 17 15 0 200 29 2.041331e+00 2.641773e+00 6.004418e-01 2.941423e-01 1.094400e+01 2.092471e+01 30 23 1592 27 18 0 300 25 2.125398e+00 2.641773e+00 5.163749e-01 2.429545e-01 1.474800e+01 2.203689e+01 24 17 2207 14 7 0 400 25 2.203584e+00 2.641773e+00 4.381885e-01 1.988527e-01 1.896200e+01 2.241325e+01 33 23 2944 35 17 2 500 25 2.287702e+00 2.641773e+00 3.540704e-01 1.547712e-01 2.348000e+01 2.235945e+01 57 41 3745 50 17 3 600 25 2.405685e+00 2.641773e+00 2.360877e-01 9.813739e-02 2.799000e+01 2.232940e+01 64 30 4581 63 18 8 675 8 2.618921e+00 2.641773e+00 2.285165e-02 8.725596e-03 3.074400e+01 2.221572e+01 11 8 5175 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.335876e+00 -1.857123e-01 6.521589e+00 0.000000e+00 Inf 1 LD 2 2.641773e+00 2.641773e+00 0.000000e+00 1.432967e-03 1.395706e+03 1 Last 2 2.641773e+00 2.641773e+00 0.000000e+00 1.286054e-02 1.555145e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.641773e+00 2.641773e+00 0.000000e+00 1.669459e-02 1.197993e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.641772619381151 Dual Bound: 2.6189209734472154 Dual Gap (relative): 0.008725595833407832 Search Statistics. Total number of nodes processed: 683 Total number of lmo calls: 5180 Total time (s): 30.777 LMO calls / sec: 168.3075023556552 Nodes / sec: 22.191896546122102 LMO calls / node: 7.584187408491947 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: 21 Poisson Tests seed = 0xeb199feb4351ad8d 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 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 -6.977330e+02 -6.788466e+02 1.888640e+01 2.782130e-02 1.617500e+01 1.854714e-01 8492 130 39 1355 14 4 * 10 11 -6.964042e+02 -6.804597e+02 1.594451e+01 2.343197e-02 2.802500e+01 7.493310e-01 746 71 301 613 14 7 * 19 20 -6.957025e+02 -6.807218e+02 1.498069e+01 2.200707e-02 4.117200e+01 9.472457e-01 674 91 533 519 18 6 * 39 40 -6.946537e+02 -6.813127e+02 1.334102e+01 1.958135e-02 6.021100e+01 1.312053e+00 850 82 1092 775 14 3 98 99 -6.935095e+02 -6.813127e+02 1.219677e+01 1.790187e-02 1.200060e+02 1.641585e+00 594 95 2736 430 10 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.056654e+03 1.052431e+03 4.222669e+00 0.000000e+00 Inf 1 LD 2 -6.667352e+02 -6.686754e+02 1.940218e+00 1.782047e-01 1.122305e+01 2 LD 37 -6.787395e+02 -6.792724e+02 5.329271e-01 4.950052e-01 7.474669e+01 3 LD 66 -6.882713e+02 -6.884311e+02 1.597870e-01 5.323386e-01 1.239812e+02 4 LD 104 -6.889221e+02 -6.890019e+02 7.978123e-02 5.732461e-01 1.814230e+02 4 LD 153 -6.889972e+02 -6.890197e+02 2.246369e-02 6.299820e-01 2.428641e+02 6 LD 198 -6.890025e+02 -6.890097e+02 7.219144e-03 6.789222e-01 2.916387e+02 6 LD 231 -6.890030e+02 -6.890056e+02 2.627442e-03 7.142931e-01 3.233966e+02 6 LD 255 -6.890031e+02 -6.890043e+02 1.191791e-03 7.399951e-01 3.445969e+02 6 LD 300 -6.890031e+02 -6.890037e+02 5.339550e-04 7.849428e-01 3.821935e+02 7 LD 342 -6.890031e+02 -6.890034e+02 2.413327e-04 8.201289e-01 4.170076e+02 7 LD 382 -6.890031e+02 -6.890033e+02 1.018717e-04 8.491541e-01 4.498594e+02 7 LD 420 -6.890031e+02 -6.890032e+02 4.402618e-05 8.767915e-01 4.790192e+02 7 LD 472 -6.890031e+02 -6.890032e+02 1.569627e-05 9.100772e-01 5.186373e+02 7 LD 513 -6.890031e+02 -6.890032e+02 6.495635e-06 9.356555e-01 5.482787e+02 7 LD 546 -6.890031e+02 -6.890032e+02 3.106203e-06 9.567343e-01 5.706914e+02 7 LD 602 -6.890031e+02 -6.890032e+02 1.405488e-06 9.921029e-01 6.067919e+02 7 LD 612 -6.890031e+02 -6.890031e+02 6.087803e-07 1.001491e+00 6.110889e+02 7 P 1000 -6.890031e+02 -6.890031e+02 6.087803e-07 1.250106e+00 7.999318e+02 7 LD 1023 -6.890031e+02 -6.890031e+02 2.181534e-07 1.324889e+00 7.721400e+02 7 LD 1066 -6.890031e+02 -6.890031e+02 9.801552e-08 1.354542e+00 7.869820e+02 7 Last 1066 -6.890031e+02 -6.890031e+02 9.801552e-08 1.362381e+00 7.824538e+02 7 ---------------------------------------------------------------------------------------------------------------- PP 1066 -6.890031e+02 -6.890031e+02 9.801549e-08 1.366636e+00 7.800172e+02 7 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -689.0031491496894 Dual Bound: -693.5094556461495 Dual Gap (relative): 0.006540327866456605 Search Statistics. Total number of nodes processed: 197 Total number of lmo calls: 2766 Total time (s): 123.347 LMO calls / sec: 22.42454214532984 Nodes / sec: 1.5971203190997756 LMO calls / node: 14.040609137055837 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 [ Info: Polish solution 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 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: 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 -5.995915e+02 -5.973436e+02 2.247970e+00 3.763278e-03 1.812200e+01 1.655446e-01 6951 83 14 20 5 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -3.110104e+02 -3.116739e+02 6.635759e-01 0.000000e+00 Inf 1 LD 2 -5.973436e+02 -5.973436e+02 0.000000e+00 2.021080e-01 9.895699e+00 1 Last 2 -5.973436e+02 -5.973436e+02 0.000000e+00 3.741739e-01 5.345109e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -5.973436e+02 -5.973436e+02 0.000000e+00 3.791763e-01 5.274591e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -597.3435540276614 Dual Bound: -599.5915236745594 Dual Gap (relative): 0.003763277651095095 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 19 Total time (s): 20.314 LMO calls / sec: 0.935315545928916 Nodes / sec: 0.14768140198877622 LMO calls / node: 6.333333333333333 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/Vk9ng/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/Vk9ng/test/poisson.jl:201 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [3] macro expansion @ ~/.julia/packages/Boscia/Vk9ng/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/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:296 [10] _start() @ Base ./client.jl:563 in expression starting at /home/pkgeval/.julia/packages/Boscia/Vk9ng/test/poisson.jl:201 Test Summary: | Pass Error Total Time Boscia Test Suite | 128 1 129 19m58.1s Norm hyperbox | 4 4 1m01.1s Norm hyperbox - strong branching | 2 2 48.6s Normbox - Shadow set activation | 4 4 25.0s Normbox - strong convexity and sharpness | 6 6 17.7s Start with Active Set | 2 2 18.8s Interface - sparse poisson regression | 4 4 25.3s Different FW variants | 10 10 1m00.4s Different line search types | 8 8 1m24.4s Lazification | 5 5 22.2s DICG - Lazification | 10 10 1m31.5s DICG - warm_start | 5 5 1m32.2s User stop | 1 1 15.3s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 23.4s BLMO - Strong Branching | 4 4 20.6s Probability Simplex LMO | 4 4 47.5s Unit Simplex LMO | 2 2 35.8s Reverse Knapsack LMO | 2 2 54.3s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 25.6s Hyperplane Aware Rounding - Unit Simplex | 2 2 26.8s Following Gradient Heuristic - Unit Simplex | 6 6 30.7s Rounding Heuristic - Unit Simplex | 3 3 30.4s Probability Rounding - Unit Cube | 2 2 21.8s Probability rounding - Probability Simplex | 3 3 22.3s Sparse Regression | 2 2 32.4s Sparse Regression Group | 7 7 1m30.0s Poisson sparse regression | 2 2 2m06.6s Hybrid branching poisson sparse regression | 3 3 23.8s RNG of the outermost testset: Xoshiro(0xf21baae3e41a2365, 0x036817d686ee714b, 0x7335095483fde6d4, 0xbba5b6abf6929535, 0x5de51fc1cadd0ddd) ERROR: LoadError: Some tests did not pass: 128 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/Vk9ng/test/runtests.jl:15 caused by: Test.FailFastError() Stacktrace: [1] record(ts::Test.DefaultTestSet, t::Union{Test.Error, Test.Fail}; print_result::Bool) @ Test /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1288 [2] record(ts::Test.DefaultTestSet, t::Union{Test.Error, Test.Fail}) @ Test /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1274 [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1963 [inlined] [4] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/test/runtests.jl:17 [5] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [6] top-level scope @ none:6 [7] eval(m::Module, e::Any) @ Core ./boot.jl:489 [8] exec_options(opts::Base.JLOptions) @ Base ./client.jl:296 [9] _start() @ Base ./client.jl:563 caused by: LoadError: invalid assignment to constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/test/poisson.jl:201 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [3] macro expansion @ ~/.julia/packages/Boscia/Vk9ng/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/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:296 [10] _start() @ Base ./client.jl:563 in expression starting at /home/pkgeval/.julia/packages/Boscia/Vk9ng/test/poisson.jl:201 Testing failed after 1232.2s 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:2673 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2522 [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:538 [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:515 [6] 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 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:157 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [9] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [12] include(mod::Module, _path::String) @ Base ./Base.jl:309 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:330 [14] _start() @ Base ./client.jl:563 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1413.53s: package tests unexpectedly errored