Package evaluation of Boscia on Julia 1.13.0-DEV.791 (d5209bd37d*) started at 2025-07-04T14:42:42.295 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.14s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.1.38 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.38 [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.2 [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.41.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.0+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 4.11s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 132.97s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_hK3prv/Project.toml` [4c88cf16] Aqua v0.8.13 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.38 [864edb3b] DataStructures v0.18.22 [31c24e10] Distributions v0.25.120 [497a8b3b] DoubleFloats v1.4.3 [f55ce6ea] FrankWolfe v0.5.2 [87dc4568] HiGHS v1.18.1 [b8f27783] MathOptInterface v1.41.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_hK3prv/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.38 [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.2 [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.41.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.0+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... 5181.7 ms ✓ StatsBase 10000.1 ms ✓ Distributions 2 dependencies successfully precompiled in 17 seconds. 45 already precompiled. Precompiling packages... 3390.2 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 23 already precompiled. Precompiling packages... 4131.0 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 5 seconds. 49 already precompiled. Precompiling packages... 4240.3 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 5 seconds. 52 already precompiled. seed = 0x77049cf7e047a10d [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xb3bd9285347dd606 seed = 0x4d3ca368178e19ba [ Info: Polish solution seed = 0x0cfe5bb65cce4e87 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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.919719e+00 3.351048e+00 4.313296e-01 1.477299e-01 1.696500e+01 1.768347e-01 6538 67 18 53 9 0 * 3 4 2.954914e+00 3.233067e+00 2.781533e-01 9.413246e-02 2.018900e+01 3.467235e-01 71 50 42 27 10 0 55 12 3.204632e+00 3.233067e+00 2.843503e-02 8.873105e-03 2.158000e+01 3.104727e+00 7 5 327 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 5.692281e+00 1.446373e+00 4.245908e+00 0.000000e+00 Inf 1 LD 2 3.557831e+00 3.095151e+00 4.626803e-01 1.848115e+00 1.082184e+00 2 LD 4 3.233067e+00 3.233067e+00 0.000000e+00 2.096807e+00 1.907663e+00 1 Last 4 3.233067e+00 3.233067e+00 0.000000e+00 2.104073e+00 1.901075e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 4 3.233067e+00 3.233067e+00 0.000000e+00 2.107625e+00 1.897871e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.2330668700336975 Dual Bound: 3.204631836837504 Dual Gap (relative): 0.008873104507460206 Search Statistics. Total number of nodes processed: 67 Total number of lmo calls: 333 Total time (s): 25.337 LMO calls / sec: 13.142834589730434 Nodes / sec: 2.6443541066424596 LMO calls / node: 4.970149253731344 Total number of global tightenings: 37 Global tightenings / node: 0.67 Total number of local tightenings: 46 Local tightenings / node: 0.84 Total number of potential local tightenings: 46 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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.309786e+00 4.036847e+00 1.727061e+00 7.477145e-01 1.554800e+01 1.929509e-01 6883 339 49 170 25 1 * 3 4 2.340812e+00 4.017414e+00 1.676602e+00 7.162481e-01 1.587900e+01 4.408338e-01 87 65 93 55 18 0 100 65 3.248140e+00 4.017414e+00 7.692749e-01 2.368355e-01 2.510000e+01 6.573705e+00 30 22 1429 27 13 0 200 67 3.372981e+00 4.017414e+00 6.444337e-01 1.910576e-01 2.766400e+01 9.651533e+00 28 20 1886 32 16 5 300 67 3.439601e+00 4.017414e+00 5.778134e-01 1.679885e-01 3.012100e+01 1.218419e+01 33 24 2338 38 15 3 400 67 3.496443e+00 4.017414e+00 5.209715e-01 1.490004e-01 3.224400e+01 1.448331e+01 29 21 2797 17 4 0 500 67 3.550705e+00 4.017414e+00 4.667091e-01 1.314412e-01 3.448300e+01 1.644288e+01 20 15 3274 20 5 0 600 67 3.600511e+00 4.017414e+00 4.169032e-01 1.157900e-01 3.653000e+01 1.825897e+01 34 25 3762 40 12 4 700 67 3.647653e+00 4.017414e+00 3.697618e-01 1.013698e-01 3.900800e+01 1.966263e+01 36 26 4265 51 13 5 800 67 3.694828e+00 4.017414e+00 3.225864e-01 8.730755e-02 4.132400e+01 2.098054e+01 21 15 4770 9 1 0 900 67 3.751532e+00 4.017414e+00 2.658824e-01 7.087303e-02 4.373300e+01 2.211145e+01 46 32 5279 55 14 6 1000 67 3.819978e+00 4.017414e+00 1.974361e-01 5.168514e-02 4.605000e+01 2.317047e+01 15 12 5778 7 1 0 1100 49 3.911937e+00 4.017414e+00 1.054779e-01 2.696309e-02 4.803600e+01 2.391956e+01 25 19 6246 15 2 0 1145 20 3.977745e+00 4.017414e+00 3.966916e-02 9.972775e-03 4.872000e+01 2.391215e+01 7 4 6409 0 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 9.276654e+00 1.542121e+00 7.734533e+00 0.000000e+00 Inf 1 LD 3 4.017414e+00 4.017414e+00 0.000000e+00 2.325446e-01 1.290075e+01 1 Last 3 4.017414e+00 4.017414e+00 0.000000e+00 3.923461e-01 7.646311e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 3 4.017414e+00 4.017414e+00 0.000000e+00 3.956035e-01 7.583350e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 4.017414447179415 Dual Bound: 3.9777452868536853 Dual Gap (relative): 0.009972775395356454 Search Statistics. Total number of nodes processed: 1165 Total number of lmo calls: 6414 Total time (s): 50.645 LMO calls / sec: 126.64626320465987 Nodes / sec: 23.003257972159144 LMO calls / node: 5.505579399141631 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: 11 Non zero entries: 2th entry: 0.15885829942867982 36th entry: 0.15885829942867982 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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.479811e+00 4.036847e+00 1.557036e+00 6.278847e-01 3.670000e-01 8.174387e+00 364 292 49 170 25 1 * 3 4 2.503666e+00 4.017414e+00 1.513749e+00 6.046130e-01 6.760000e-01 1.035503e+01 81 60 93 55 18 0 100 32 3.363981e+00 4.017414e+00 6.534330e-01 1.942439e-01 9.885000e+00 1.335357e+01 33 24 1433 31 17 0 200 33 3.533215e+00 4.017414e+00 4.841999e-01 1.370423e-01 1.376000e+01 1.693314e+01 33 24 2151 37 15 1 300 33 3.657551e+00 4.017414e+00 3.598633e-01 9.838914e-02 1.775300e+01 1.875739e+01 32 24 2906 33 8 1 400 33 3.765726e+00 4.017414e+00 2.516885e-01 6.683665e-02 2.207700e+01 1.961317e+01 34 26 3718 28 6 0 500 32 3.896487e+00 4.017414e+00 1.209274e-01 3.103498e-02 2.624300e+01 2.027207e+01 18 14 4555 20 4 0 544 15 3.978289e+00 4.017414e+00 3.912568e-02 9.834801e-03 2.787900e+01 2.005093e+01 24 18 4908 16 4 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.276654e+00 1.542121e+00 7.734533e+00 0.000000e+00 Inf 1 LD 3 4.017414e+00 4.017414e+00 0.000000e+00 8.820920e-04 3.401006e+03 1 Last 3 4.017414e+00 4.017414e+00 0.000000e+00 6.913966e-03 4.339044e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 3 4.017414e+00 4.017414e+00 0.000000e+00 9.986718e-03 3.003990e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 4.017414447179415 Dual Bound: 3.978288769189263 Dual Gap (relative): 0.009834800905648011 Search Statistics. Total number of nodes processed: 559 Total number of lmo calls: 4913 Total time (s): 27.9 LMO calls / sec: 176.09318996415772 Nodes / sec: 20.03584229390681 LMO calls / node: 8.788908765652952 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: 7 seed = 0x2ca480ffd25ffdfc Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive 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 -3.280105e+02 -3.084509e+02 1.955962e+01 6.341242e-02 1.751300e+01 1.713013e-01 9472 114 40 4028 16 2 3 0 -3.280105e+02 -3.084509e+02 1.955962e+01 6.341242e-02 1.754600e+01 1.709791e-01 13 8 45 6 14 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 5.865087e+02 5.822174e+02 4.291256e+00 0.000000e+00 Inf 1 LD 6 -3.119746e+02 -3.127175e+02 7.428244e-01 1.912717e-01 3.136899e+01 2 LD 125 -3.199747e+02 -3.203361e+02 3.614548e-01 3.434840e-01 3.639180e+02 4 LD 222 -3.209724e+02 -3.211388e+02 1.664457e-01 3.920429e-01 5.662646e+02 5 LD 381 -3.213774e+02 -3.214268e+02 4.940707e-02 4.314711e-01 8.830255e+02 8 LD 479 -3.214149e+02 -3.214395e+02 2.460136e-02 4.532813e-01 1.056739e+03 8 LD 579 -3.214195e+02 -3.214270e+02 7.458752e-03 4.839580e-01 1.196385e+03 9 LD 717 -3.214203e+02 -3.214235e+02 3.210013e-03 5.399106e-01 1.327998e+03 10 LD 790 -3.214204e+02 -3.214219e+02 1.498874e-03 5.585284e-01 1.414431e+03 11 LD 912 -3.214204e+02 -3.214211e+02 7.222501e-04 5.862819e-01 1.555566e+03 12 P 1000 -3.214204e+02 -3.214211e+02 7.222501e-04 6.113434e-01 1.635742e+03 13 LD 1011 -3.214204e+02 -3.214207e+02 2.767906e-04 6.640678e-01 1.522435e+03 13 LD 1099 -3.214204e+02 -3.214205e+02 1.249460e-04 7.049711e-01 1.558929e+03 13 LD 1243 -3.214204e+02 -3.214204e+02 3.847923e-05 7.370678e-01 1.686412e+03 14 LD 1393 -3.214204e+02 -3.214204e+02 1.713257e-05 7.680337e-01 1.813722e+03 14 LD 1532 -3.214204e+02 -3.214204e+02 6.745157e-06 8.265133e-01 1.853570e+03 15 LD 1619 -3.214204e+02 -3.214204e+02 2.788084e-06 8.452768e-01 1.915349e+03 15 LD 1725 -3.214204e+02 -3.214204e+02 1.185084e-06 8.676649e-01 1.988095e+03 15 P 2000 -3.214204e+02 -3.214204e+02 1.185084e-06 9.432758e-01 2.120271e+03 15 P 3000 -3.214204e+02 -3.214204e+02 1.185084e-06 1.168992e+00 2.566314e+03 15 P 4000 -3.214204e+02 -3.214204e+02 1.185084e-06 1.394131e+00 2.869172e+03 15 P 5000 -3.214204e+02 -3.214204e+02 1.185084e-06 1.656392e+00 3.018609e+03 15 P 6000 -3.214204e+02 -3.214204e+02 1.185084e-06 1.905220e+00 3.149242e+03 15 P 7000 -3.214204e+02 -3.214204e+02 1.185084e-06 2.144961e+00 3.263463e+03 15 P 8000 -3.214204e+02 -3.214204e+02 1.185084e-06 2.373661e+00 3.370321e+03 15 P 9000 -3.214204e+02 -3.214204e+02 1.185084e-06 2.601169e+00 3.459983e+03 15 P 10000 -3.214204e+02 -3.214204e+02 1.185084e-06 2.846765e+00 3.512760e+03 15 Last 10001 -3.214204e+02 -3.214204e+02 1.109005e-06 2.849749e+00 3.509432e+03 15 ---------------------------------------------------------------------------------------------------------------- PP 10001 -3.214204e+02 -3.214204e+02 1.109005e-06 2.851911e+00 3.506772e+03 15 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: -321.42038164537206 Dual Bound: -321.42038275437716 Dual Gap (relative): 3.4503259931917663e-9 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 80 Total time (s): 22.011 LMO calls / sec: 3.6345463631820456 Nodes / sec: 0.1362954886193267 LMO calls / node: 26.666666666666668 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: Adaptive 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 -3.114185e+02 -3.071367e+02 4.281788e+00 1.394099e-02 1.311800e+01 2.286934e-01 4773 60 14 20 4 2 * 3 4 -3.108950e+02 -3.071813e+02 3.713705e+00 1.208962e-02 1.353700e+01 5.171013e-01 43 32 28 12 3 0 * 5 6 -3.105510e+02 -3.074356e+02 3.115382e+00 1.013345e-02 1.383500e+01 7.950849e-01 47 37 45 16 3 1 7 8 -3.102042e+02 -3.074356e+02 2.768623e+00 9.005537e-03 1.420800e+01 1.055743e+00 40 31 60 10 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.731484e+02 -1.738043e+02 6.559303e-01 0.000000e+00 Inf 1 LD 2 -3.074356e+02 -3.074356e+02 0.000000e+00 1.229367e-01 1.626853e+01 1 Last 2 -3.074356e+02 -3.074356e+02 0.000000e+00 2.505229e-01 7.983303e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.074356e+02 -3.074356e+02 0.000000e+00 2.539012e-01 7.877080e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -307.43561984512434 Dual Bound: -310.20424258136717 Dual Gap (relative): 0.009005536631173613 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 65 Total time (s): 15.643 LMO calls / sec: 4.1552131944000505 Nodes / sec: 0.9588953525538579 LMO calls / node: 4.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/juH72/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/juH72/test/poisson.jl:192 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [3] macro expansion @ ~/.julia/packages/Boscia/juH72/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1855 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/juH72/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:290 [10] _start() @ Base ./client.jl:557 in expression starting at /home/pkgeval/.julia/packages/Boscia/juH72/test/poisson.jl:192 Test Summary: | Pass Error Total Time Boscia Test Suite | 129 1 130 22m33.9s Norm hyperbox | 4 4 52.4s Norm hyperbox - strong branching | 2 2 44.9s Normbox - Shadow set activation | 4 4 24.8s Normbox - strong convexity and sharpness | 6 6 19.5s Start with Active Set | 2 2 19.5s Interface - sparse poisson regression | 4 4 26.1s Different FW variants | 10 10 1m27.6s Different line search types | 8 8 2m30.6s Lazification | 5 5 23.3s DICG - Lazification | 10 10 2m00.6s DICG - warm_start | 5 5 1m29.9s User stop | 2 2 17.2s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 26.6s BLMO - Strong Branching | 4 4 23.4s Probability Simplex LMO | 4 4 1m03.7s Unit Simplex LMO | 4 4 2m17.3s Indicators | 5 5 0.2s Hyperplane Aware Rounding - Probability Simplex | 2 2 25.7s Hyperplane Aware Rounding - Unit Simplex | 2 2 41.4s Following Gradient Heuristic - Unit Simplex | 6 6 1m04.6s Rounding Heuristic - Unit Simplex | 3 3 1m00.6s Probability Rounding - Unit Cube | 2 2 20.6s Probability rounding - Probability Simplex | 3 3 20.8s Sparse Regression | 2 2 29.0s Sparse Regression Group | 7 7 1m21.2s Poisson sparse regression | 2 2 24.2s Hybrid branching poisson sparse regression | 3 3 17.2s RNG of the outermost testset: Xoshiro(0x31afc9cd7c082960, 0x04de5efa007cc825, 0xe35f4f8f3411b7b0, 0x4d3f90bd2d9e2b68, 0xcde469b3c12a4817) ERROR: LoadError: Some tests did not pass: 129 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/juH72/test/runtests.jl:15 Testing failed after 1384.81s 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:2423 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2278 [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:500 [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:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/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:309 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:324 [12] _start() @ Base ./client.jl:557 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1558.26s: package tests unexpectedly errored