Package evaluation of Boscia on Julia 1.13.0-DEV.985 (9c94e7ae32*) started at 2025-08-14T18:46:22.584 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 10.34s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.1.39 Updating `~/.julia/environments/v1.13/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.1.39 [d360d2e6] + ChainRulesCore v1.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.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.0.1 [f55ce6ea] + FrankWolfe v0.5.5 [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.42.1 [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.5.0 [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.14 [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.15.0+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.7.15 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.2+0 [efcefdf7] + PCRE2_jll v10.45.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.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 5.06s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 135.52s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_v567As/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 ⌅ [864edb3b] DataStructures v0.18.22 [31c24e10] Distributions v0.25.120 [497a8b3b] DoubleFloats v1.4.3 [f55ce6ea] FrankWolfe v0.5.5 [87dc4568] HiGHS v1.19.0 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.42.1 [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.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_v567As/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.0 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.4.3 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.0.1 [f55ce6ea] FrankWolfe v0.5.5 [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.42.1 [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.5.0 [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.2 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.14 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [4c63d2b9] StatsFuns v1.5.0 [856f2bd8] StructTypes v1.11.0 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.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.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.15.0+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.7.15 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.2+0 [efcefdf7] PCRE2_jll v10.45.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.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... 11306.7 ms ✓ Distributions 1 dependency successfully precompiled in 14 seconds. 46 already precompiled. Precompiling packages... 3924.9 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 4 seconds. 23 already precompiled. Precompiling packages... 5370.3 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 7 seconds. 52 already precompiled. Precompiling packages... 5219.1 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 7 seconds. 49 already precompiled. seed = 0xfa8592a51d40347e [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x982809ac1205f76d seed = 0xb59ba819bcd91611 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x64f07e04e5832711 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.013965e+00 2.250175e+00 2.362099e-01 1.172860e-01 1.723600e+01 1.740543e-01 7220 80 18 24 3 1 51 6 2.232845e+00 2.250175e+00 1.732990e-02 7.761355e-03 2.213000e+01 2.575689e+00 8 5 274 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 7.116115e+00 -1.570444e+00 8.686559e+00 0.000000e+00 Inf 1 LD 2 3.212231e+00 1.688807e+00 1.523423e+00 1.963053e+00 1.018821e+00 2 LD 5 2.250175e+00 2.250175e+00 0.000000e+00 2.203479e+00 2.269139e+00 1 Last 5 2.250175e+00 2.250175e+00 0.000000e+00 2.211455e+00 2.260955e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.250175e+00 2.250175e+00 0.000000e+00 2.215423e+00 2.256905e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.250174719424873 Dual Bound: 2.2328448171508897 Dual Gap (relative): 0.007761355442558785 Search Statistics. Total number of nodes processed: 57 Total number of lmo calls: 280 Total time (s): 25.972 LMO calls / sec: 10.780840905590635 Nodes / sec: 2.194671184352379 LMO calls / node: 4.912280701754386 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 169 Local tightenings / node: 3.31 Total number of potential local tightenings: 601 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.007330e+00 2.865071e+00 8.577407e-01 4.273043e-01 1.470400e+01 2.040261e-01 6963 277 38 80 22 1 100 49 2.564741e+00 2.865071e+00 3.003295e-01 1.170993e-01 2.232100e+01 6.675328e+00 31 23 1121 16 12 3 200 49 2.659380e+00 2.865071e+00 2.056909e-01 7.734543e-02 2.477400e+01 1.005086e+01 30 22 1532 19 7 0 300 49 2.712347e+00 2.865071e+00 1.527242e-01 5.630704e-02 2.727300e+01 1.279654e+01 42 31 1972 23 10 0 400 49 2.760158e+00 2.865071e+00 1.049128e-01 3.800970e-02 2.972600e+01 1.510462e+01 28 19 2411 27 13 1 500 49 2.798820e+00 2.865071e+00 6.625083e-02 2.367099e-02 3.214400e+01 1.707939e+01 32 22 2861 29 10 1 589 44 2.837983e+00 2.865071e+00 2.708789e-02 9.544769e-03 3.447700e+01 1.836007e+01 7 5 3289 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 7.733221e+00 1.102529e+00 6.630692e+00 0.000000e+00 Inf 1 LD 3 2.865071e+00 2.865071e+00 0.000000e+00 2.506544e-01 1.196867e+01 1 Last 3 2.865071e+00 2.865071e+00 0.000000e+00 4.159272e-01 7.212801e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 3 2.865071e+00 2.865071e+00 0.000000e+00 4.199356e-01 7.143953e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.865070704048952 Dual Bound: 2.837982813765468 Dual Gap (relative): 0.009544768964806789 Search Statistics. Total number of nodes processed: 633 Total number of lmo calls: 3294 Total time (s): 36.477 LMO calls / sec: 90.30347890451519 Nodes / sec: 17.353400773089895 LMO calls / node: 5.203791469194313 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 Non zero entries: 10th entry: 0.1652438306000626 28th entry: 0.1652438306000626 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.137112e+00 2.865071e+00 7.279584e-01 3.406271e-01 3.060000e-01 9.803922e+00 302 249 38 80 22 1 100 22 2.686623e+00 2.865071e+00 1.784479e-01 6.642088e-02 7.922000e+00 1.540015e+01 32 24 1167 19 10 1 200 21 2.804613e+00 2.865071e+00 6.045777e-02 2.155655e-02 1.160200e+01 1.904844e+01 34 25 1834 22 9 0 238 19 2.837737e+00 2.865071e+00 2.733345e-02 9.632129e-03 1.298900e+01 1.978597e+01 35 25 2097 27 12 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 7.733221e+00 1.102529e+00 6.630692e+00 0.000000e+00 Inf 1 LD 3 2.865071e+00 2.865071e+00 0.000000e+00 9.918910e-04 3.024526e+03 1 Last 3 2.865071e+00 2.865071e+00 0.000000e+00 8.127422e-03 3.691207e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 3 2.865071e+00 2.865071e+00 0.000000e+00 1.225599e-02 2.447782e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.865070704048952 Dual Bound: 2.8377372541002193 Dual Gap (relative): 0.009632128523963487 Search Statistics. Total number of nodes processed: 257 Total number of lmo calls: 2102 Total time (s): 13.014 LMO calls / sec: 161.51836483786693 Nodes / sec: 19.747963731366223 LMO calls / node: 8.178988326848248 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 = 0xc3137d50ccc211c1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.000485e+03 -9.740160e+02 2.646939e+01 2.717552e-02 1.573600e+01 1.906457e-01 8174 118 37 897 15 3 * 9 10 -9.990204e+02 -9.774783e+02 2.154214e+01 2.203848e-02 2.178400e+01 8.721998e-01 775 88 248 579 11 3 * 15 16 -9.982915e+02 -9.795184e+02 1.877306e+01 1.916560e-02 2.970700e+01 1.043525e+00 635 76 377 495 10 9 * 16 17 -9.982915e+02 -9.811968e+02 1.709464e+01 1.742223e-02 3.010200e+01 1.096273e+00 391 71 400 269 12 8 * 34 35 -9.973945e+02 -9.823714e+02 1.502309e+01 1.529268e-02 5.176600e+01 1.332921e+00 1241 89 866 1024 12 5 100 99 -9.958175e+02 -9.823714e+02 1.344605e+01 1.368733e-02 1.455630e+02 1.367106e+00 1137 87 2578 951 20 9 200 197 -9.946198e+02 -9.823714e+02 1.224842e+01 1.246822e-02 2.722370e+02 1.458288e+00 1327 68 5194 1136 17 9 * 243 240 -9.944057e+02 -9.838123e+02 1.059339e+01 1.076769e-02 3.191210e+02 1.513532e+00 356 81 6329 231 15 4 300 297 -9.941773e+02 -9.838123e+02 1.036494e+01 1.053548e-02 3.945920e+02 1.512955e+00 14 6 7736 6 4 4 390 381 -9.937618e+02 -9.838123e+02 9.949490e+00 1.011320e-02 5.000050e+02 1.541985e+00 238 34 9971 165 11 11 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.362587e+03 1.358458e+03 4.129568e+00 0.000000e+00 Inf 1 LD 7 -9.659529e+02 -9.673990e+02 1.446127e+00 3.001587e-01 2.332099e+01 2 LD 30 -9.757154e+02 -9.762697e+02 5.543809e-01 5.020389e-01 5.975632e+01 3 LD 68 -9.834043e+02 -9.835644e+02 1.601106e-01 5.225386e-01 1.301339e+02 4 LD 159 -9.858784e+02 -9.859255e+02 4.712108e-02 6.486258e-01 2.451337e+02 4 LD 207 -9.859721e+02 -9.859890e+02 1.691648e-02 6.785763e-01 3.050505e+02 5 LD 235 -9.859771e+02 -9.859836e+02 6.489791e-03 6.926974e-01 3.392535e+02 5 LD 300 -9.859785e+02 -9.859802e+02 1.734584e-03 7.218895e-01 4.155761e+02 6 LD 323 -9.859786e+02 -9.859789e+02 3.666671e-04 7.332327e-01 4.405150e+02 6 LD 385 -9.859786e+02 -9.859787e+02 9.066365e-05 7.598012e-01 5.067115e+02 6 LD 445 -9.859786e+02 -9.859786e+02 2.335498e-05 7.838511e-01 5.677099e+02 6 LD 504 -9.859786e+02 -9.859786e+02 5.919503e-06 8.068602e-01 6.246435e+02 6 LD 565 -9.859786e+02 -9.859786e+02 1.736186e-06 8.398111e-01 6.727703e+02 6 LD 619 -9.859786e+02 -9.859786e+02 3.801660e-07 8.702666e-01 7.112763e+02 6 P 1000 -9.859786e+02 -9.859786e+02 3.801660e-07 1.257810e+00 7.950328e+02 6 P 2000 -9.859786e+02 -9.859786e+02 3.801660e-07 2.364050e+00 8.460058e+02 6 P 3000 -9.859786e+02 -9.859786e+02 3.801660e-07 3.192671e+00 9.396521e+02 6 P 4000 -9.859786e+02 -9.859786e+02 3.801660e-07 3.983960e+00 1.004026e+03 6 P 5000 -9.859786e+02 -9.859786e+02 3.801660e-07 4.747480e+00 1.053190e+03 6 P 6000 -9.859786e+02 -9.859786e+02 3.801660e-07 5.537831e+00 1.083457e+03 6 P 7000 -9.859786e+02 -9.859786e+02 3.801660e-07 6.315952e+00 1.108305e+03 6 P 8000 -9.859786e+02 -9.859786e+02 3.801660e-07 7.035187e+00 1.137141e+03 6 P 9000 -9.859786e+02 -9.859786e+02 3.801660e-07 7.814321e+00 1.151731e+03 6 P 10000 -9.859786e+02 -9.859786e+02 3.801660e-07 8.620135e+00 1.160075e+03 6 Last 10001 -9.859786e+02 -9.859786e+02 2.373377e-07 8.625129e+00 1.159519e+03 6 ---------------------------------------------------------------------------------------------------------------- PP 10001 -9.859786e+02 -9.859786e+02 2.373377e-07 8.629145e+00 1.158979e+03 6 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -985.9785748456438 Dual Bound: -993.7618019258979 Dual Gap (relative): 0.007893910961982642 Search Statistics. Total number of nodes processed: 771 Total number of lmo calls: 9995 Total time (s): 510.473 LMO calls / sec: 19.579879836935547 Nodes / sec: 1.5103639173864238 LMO calls / node: 12.963683527885863 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.146301e+02 -8.125604e+02 2.069720e+00 2.547158e-03 1.599000e+01 1.876173e-01 5081 30 6 4 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -4.173466e+02 -4.180203e+02 6.736760e-01 0.000000e+00 Inf 1 LD 2 -8.125604e+02 -8.125604e+02 0.000000e+00 1.677427e-01 1.192302e+01 1 Last 2 -8.125604e+02 -8.125604e+02 0.000000e+00 3.512146e-01 5.694525e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -8.125604e+02 -8.125604e+02 0.000000e+00 3.556829e-01 5.622986e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -812.5604052901899 Dual Bound: -814.6301251131252 Dual Gap (relative): 0.0025471581059824918 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 18.21 LMO calls / sec: 0.6040637012630422 Nodes / sec: 0.16474464579901152 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Test Suite: Error During Test at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Got exception outside of a @test LoadError: invalid assignment to constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:309 [3] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1929 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:309 [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/qQ4D3/test/poisson.jl:192 Test Summary: | Pass Error Total Time Boscia Test Suite | 129 1 130 26m49.4s Norm hyperbox | 4 4 55.9s Norm hyperbox - strong branching | 2 2 41.5s Normbox - Shadow set activation | 4 4 18.2s Normbox - strong convexity and sharpness | 6 6 19.1s Start with Active Set | 2 2 18.7s Interface - sparse poisson regression | 4 4 22.7s Different FW variants | 10 10 1m09.3s Different line search types | 8 8 2m27.1s Lazification | 5 5 21.6s DICG - Lazification | 10 10 1m41.7s DICG - warm_start | 5 5 1m19.8s User stop | 2 2 15.9s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 24.8s BLMO - Strong Branching | 4 4 23.4s Probability Simplex LMO | 4 4 55.8s Unit Simplex LMO | 4 4 53.5s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 26.1s Hyperplane Aware Rounding - Unit Simplex | 2 2 30.4s Following Gradient Heuristic - Unit Simplex | 6 6 39.0s Rounding Heuristic - Unit Simplex | 3 3 38.1s Probability Rounding - Unit Cube | 2 2 22.2s Probability rounding - Probability Simplex | 3 3 20.8s Sparse Regression | 2 2 31.2s Sparse Regression Group | 7 7 52.9s Poisson sparse regression | 2 2 8m33.7s Hybrid branching poisson sparse regression | 3 3 21.8s RNG of the outermost testset: Xoshiro(0xe33c6dc2f0574023, 0x8d24137f338987ac, 0xe6d08abf9e663b84, 0xeeac486ba1f28436, 0x937158f010949e35) ERROR: LoadError: Some tests did not pass: 129 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Testing failed after 1644.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:2672 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2521 [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:308 [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 1822.05s: package tests unexpectedly errored