Package evaluation of Boscia on Julia 1.13.0-DEV.790 (77b90b9e62*) started at 2025-07-01T06:43:02.140 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 7.35s ################################################################################ # 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.16.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.04s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 116.5s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_OiDfNI/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_OiDfNI/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.16.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... 10634.9 ms ✓ Distributions 1 dependency successfully precompiled in 13 seconds. 46 already precompiled. Precompiling packages... 3753.4 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 23 already precompiled. Precompiling packages... 5028.3 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. Precompiling packages... 5252.3 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 52 already precompiled. seed = 0x8ae4d5ed33c8a6fd [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x502786bb05875c1b seed = 0xc420b879bf84fee4 [ Info: Polish solution seed = 0xf85e75e9b2878cac 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 3.728420e+00 3.831238e+00 1.028175e-01 2.757670e-02 2.133300e+01 1.406272e-01 8410 53 11 23 4 0 9 2 3.795419e+00 3.831238e+00 3.581864e-02 9.437336e-03 2.550400e+01 4.313049e-01 18 13 57 2 1 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 ---------------------------------------------------------------------------------------------------------------- Last 0 3.831238e+00 3.831238e+00 0.000000e+00 3.825912e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.831238e+00 3.831238e+00 0.000000e+00 2.303089e+00 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.831237564487332 Dual Bound: 3.7954189201822985 Dual Gap (relative): 0.009437336182988006 Search Statistics. Total number of nodes processed: 11 Total number of lmo calls: 61 Total time (s): 29.789 LMO calls / sec: 2.0477357413810466 Nodes / sec: 0.3692638222162543 LMO calls / node: 5.545454545454546 Total number of global tightenings: 44 Global tightenings / node: 4.89 Total number of local tightenings: 44 Local tightenings / node: 4.89 Total number of potential local tightenings: 44 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.290322e+00 3.533467e+00 1.243145e+00 5.427819e-01 1.723500e+01 1.740644e-01 7907 249 36 110 18 1 100 53 3.067048e+00 3.533467e+00 4.664188e-01 1.520742e-01 2.535000e+01 6.035503e+00 37 27 1145 28 11 0 200 53 3.179604e+00 3.533467e+00 3.538628e-01 1.112914e-01 2.830900e+01 8.937087e+00 42 32 1613 30 11 0 300 53 3.260673e+00 3.533467e+00 2.727947e-01 8.366211e-02 3.144500e+01 1.122595e+01 40 29 2098 30 10 1 400 53 3.335391e+00 3.533467e+00 1.980764e-01 5.938627e-02 3.485000e+01 1.299857e+01 43 32 2604 21 5 0 500 53 3.397143e+00 3.533467e+00 1.363242e-01 4.012906e-02 3.828500e+01 1.444430e+01 43 32 3130 42 12 4 600 53 3.448913e+00 3.533467e+00 8.455377e-02 2.451606e-02 4.165900e+01 1.567488e+01 40 31 3664 23 4 0 689 48 3.499192e+00 3.533467e+00 3.427545e-02 9.795248e-03 4.463300e+01 1.651245e+01 8 6 4161 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 8.848641e+00 1.125903e+00 7.722738e+00 0.000000e+00 Inf 1 LD 3 3.651879e+00 3.529723e+00 1.221557e-01 3.083335e-01 9.729724e+00 2 LD 5 3.533467e+00 3.533467e+00 0.000000e+00 5.113623e-01 9.777804e+00 1 Last 5 3.533467e+00 3.533467e+00 0.000000e+00 5.200825e-01 9.613859e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.533467e+00 3.533467e+00 0.000000e+00 5.249307e-01 9.525068e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.5334672359876858 Dual Bound: 3.49919178348505 Dual Gap (relative): 0.009795248338317408 Search Statistics. Total number of nodes processed: 737 Total number of lmo calls: 4167 Total time (s): 47.059 LMO calls / sec: 88.54841794343271 Nodes / sec: 15.661191270532736 LMO calls / node: 5.654002713704206 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 1 Non zero entries: 8th entry: 0.17435406586791813 49th entry: 0.17435406586791813 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.459038e+00 3.533467e+00 1.074429e+00 4.369305e-01 3.200000e-01 9.375000e+00 316 256 36 110 18 1 100 26 3.207013e+00 3.533467e+00 3.264547e-01 1.017940e-01 9.193000e+00 1.370608e+01 36 28 1218 23 12 3 200 24 3.381878e+00 3.533467e+00 1.515891e-01 4.482392e-02 1.401100e+01 1.598744e+01 38 28 2001 33 9 1 289 23 3.500100e+00 3.533467e+00 3.336725e-02 9.533228e-03 1.831600e+01 1.703429e+01 42 31 2765 43 11 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 8.848641e+00 1.125903e+00 7.722738e+00 0.000000e+00 Inf 1 LD 3 3.651879e+00 3.529723e+00 1.221557e-01 1.271478e-03 2.359459e+03 2 LD 5 3.533467e+00 3.533467e+00 0.000000e+00 5.861274e-03 8.530569e+02 1 Last 5 3.533467e+00 3.533467e+00 0.000000e+00 1.324350e-02 3.775436e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.533467e+00 3.533467e+00 0.000000e+00 1.716904e-02 2.912219e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.5334672359876858 Dual Bound: 3.5000999865417377 Dual Gap (relative): 0.009533227500428194 Search Statistics. Total number of nodes processed: 312 Total number of lmo calls: 2771 Total time (s): 18.347 LMO calls / sec: 151.03286640867717 Nodes / sec: 17.005504987191365 LMO calls / node: 8.881410256410257 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 seed = 0xd800d6ea08a3882b 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 -8.119637e+02 -7.900970e+02 2.186669e+01 2.767595e-02 1.984900e+01 1.511411e-01 10186 122 33 2597 11 3 * 2 3 -8.119637e+02 -7.908557e+02 2.110804e+01 2.669012e-02 2.136000e+01 2.340824e-01 1504 118 62 1623 14 6 * 3 4 -8.108191e+02 -7.944464e+02 1.637268e+01 2.060891e-02 2.210200e+01 3.167134e-01 735 101 86 764 15 2 * 25 20 -8.081348e+02 -7.954128e+02 1.272205e+01 1.599427e-02 4.794700e+01 9.385363e-01 1187 89 574 1448 9 7 * 45 30 -8.067920e+02 -7.964874e+02 1.030451e+01 1.293745e-02 7.042400e+01 1.064978e+00 2505 150 969 3005 24 4 100 55 -8.049865e+02 -7.964874e+02 8.499056e+00 1.067067e-02 1.260200e+02 1.229963e+00 13 7 1995 6 11 7 119 64 -8.044417e+02 -7.964874e+02 7.954261e+00 9.986675e-03 1.539130e+02 1.188983e+00 2775 116 2372 3484 15 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.161861e+03 1.157573e+03 4.287681e+00 0.000000e+00 Inf 1 LD 3 -7.733147e+02 -7.742774e+02 9.626531e-01 3.500160e-01 8.571037e+00 2 LD 67 -7.963098e+02 -7.966304e+02 3.206229e-01 5.959668e-01 1.124224e+02 3 LD 157 -7.988302e+02 -7.989707e+02 1.404997e-01 7.476756e-01 2.099841e+02 4 LD 225 -7.991417e+02 -7.992030e+02 6.134247e-02 7.862304e-01 2.861756e+02 6 LD 267 -7.991889e+02 -7.992176e+02 2.876175e-02 8.064952e-01 3.310621e+02 5 LD 336 -7.992021e+02 -7.992139e+02 1.176587e-02 8.403576e-01 3.998298e+02 6 LD 357 -7.992036e+02 -7.992093e+02 5.714296e-03 8.520949e-01 4.189674e+02 6 LD 384 -7.992040e+02 -7.992065e+02 2.546416e-03 8.665517e-01 4.431357e+02 6 LD 411 -7.992041e+02 -7.992051e+02 1.022429e-03 8.817537e-01 4.661166e+02 6 LD 446 -7.992041e+02 -7.992044e+02 3.562627e-04 8.999125e-01 4.956037e+02 6 LD 474 -7.992041e+02 -7.992043e+02 1.658451e-04 9.156443e-01 5.176683e+02 6 LD 501 -7.992041e+02 -7.992042e+02 7.297896e-05 9.340777e-01 5.363579e+02 6 LD 527 -7.992041e+02 -7.992041e+02 2.775680e-05 9.516062e-01 5.538005e+02 6 LD 561 -7.992041e+02 -7.992041e+02 1.120485e-05 9.738971e-01 5.760362e+02 6 LD 588 -7.992041e+02 -7.992041e+02 5.160647e-06 9.920246e-01 5.927272e+02 6 LD 610 -7.992041e+02 -7.992041e+02 2.002602e-06 1.007299e+00 6.055796e+02 6 LD 644 -7.992041e+02 -7.992041e+02 9.586107e-07 1.028030e+00 6.264406e+02 6 LD 671 -7.992041e+02 -7.992041e+02 4.335135e-07 1.046009e+00 6.414861e+02 6 P 1000 -7.992041e+02 -7.992041e+02 4.335135e-07 1.215978e+00 8.223832e+02 6 P 2000 -7.992041e+02 -7.992041e+02 4.335135e-07 1.851872e+00 1.079988e+03 6 P 3000 -7.992041e+02 -7.992041e+02 4.335135e-07 2.343154e+00 1.280326e+03 6 P 4000 -7.992041e+02 -7.992041e+02 4.335135e-07 2.852948e+00 1.402058e+03 6 P 5000 -7.992041e+02 -7.992041e+02 4.335135e-07 3.333926e+00 1.499733e+03 6 P 6000 -7.992041e+02 -7.992041e+02 4.335135e-07 3.752899e+00 1.598764e+03 6 P 7000 -7.992041e+02 -7.992041e+02 4.335135e-07 4.207404e+00 1.663734e+03 6 P 8000 -7.992041e+02 -7.992041e+02 4.335135e-07 4.637941e+00 1.724903e+03 6 P 9000 -7.992041e+02 -7.992041e+02 4.335135e-07 5.050011e+00 1.782174e+03 6 P 10000 -7.992041e+02 -7.992041e+02 4.335135e-07 5.481960e+00 1.824165e+03 6 Last 10001 -7.992041e+02 -7.992041e+02 4.332868e-07 5.487559e+00 1.822486e+03 6 ---------------------------------------------------------------------------------------------------------------- PP 10001 -7.992041e+02 -7.992041e+02 4.332868e-07 5.492959e+00 1.820694e+03 6 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -799.2040937881195 Dual Bound: -804.4417045409558 Dual Gap (relative): 0.006553533438512228 Search Statistics. Total number of nodes processed: 183 Total number of lmo calls: 2401 Total time (s): 161.737 LMO calls / sec: 14.845088013256088 Nodes / sec: 1.131466516628848 LMO calls / node: 13.120218579234972 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: 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 -6.783035e+02 -6.754328e+02 2.870709e+00 4.250177e-03 2.377100e+01 1.262042e-01 9365 54 8 7 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 -3.404784e+02 -3.411836e+02 7.051464e-01 0.000000e+00 Inf 1 LD 2 -6.754328e+02 -6.754328e+02 0.000000e+00 2.208441e-01 9.056162e+00 1 Last 2 -6.754328e+02 -6.754328e+02 0.000000e+00 4.599205e-01 4.348577e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -6.754328e+02 -6.754328e+02 0.000000e+00 4.669270e-01 4.283325e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -675.4327718171824 Dual Bound: -678.3034807542306 Dual Gap (relative): 0.00425017715578839 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 26.477 LMO calls / sec: 0.49099218189371907 Nodes / sec: 0.11330588812931978 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 27m52.0s Norm hyperbox | 4 4 1m00.3s Norm hyperbox - strong branching | 2 2 49.8s Normbox - Shadow set activation | 4 4 25.8s Normbox - strong convexity and sharpness | 6 6 20.5s Start with Active Set | 2 2 20.5s Interface - sparse poisson regression | 4 4 27.3s Different FW variants | 10 10 1m22.4s Different line search types | 8 8 2m31.7s Lazification | 5 5 30.6s DICG - Lazification | 10 10 3m12.9s DICG - warm_start | 5 5 2m19.4s User stop | 2 2 19.2s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 32.7s BLMO - Strong Branching | 4 4 28.5s Probability Simplex LMO | 4 4 1m02.7s Unit Simplex LMO | 4 4 1m36.8s Indicators | 5 5 0.4s Hyperplane Aware Rounding - Probability Simplex | 2 2 35.3s Hyperplane Aware Rounding - Unit Simplex | 2 2 50.2s Following Gradient Heuristic - Unit Simplex | 6 6 1m18.9s Rounding Heuristic - Unit Simplex | 3 3 1m12.6s Probability Rounding - Unit Cube | 2 2 27.1s Probability rounding - Probability Simplex | 3 3 23.9s Sparse Regression | 2 2 35.0s Sparse Regression Group | 7 7 1m08.6s Poisson sparse regression | 2 2 2m44.3s Hybrid branching poisson sparse regression | 3 3 29.8s RNG of the outermost testset: Xoshiro(0xd108282b5467e72a, 0xda80b75c71ff1f54, 0x57199da2ee2e6bc0, 0xf0777f4864f39c94, 0xa74edd6a13f6a7f2) 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 1707.45s 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 1891.69s: package tests unexpectedly errored