Package evaluation of Boscia on Julia 1.13.0-DEV.1200 (a5576b4ddb*) started at 2025-09-25T18:36:24.161 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 10.22s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.2.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.2.0 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.0 [187b0558] + ConstructionBase v1.6.0 ⌅ [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.14.0 [26cc04aa] + FiniteDifferences v0.12.33 [f6369f11] + ForwardDiff v1.2.1 [f55ce6ea] + FrankWolfe v0.5.6 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.45.0 [3b969827] + MathOptSetDistances v0.2.11 [d8a4904e] + MutableArithmetics v1.6.5 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [92933f4c] + ProgressMeter v1.11.0 [dc4f5ac2] + ProximalCore v0.1.2 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.16.0+0 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.9.9 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.2+0 [efcefdf7] + PCRE2_jll v10.46.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.67.1+0 [3f19e933] + p7zip_jll v17.6.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 6.1s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 280.41s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_9mZ03M/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.0 [31c24e10] Distributions v0.25.120 [497a8b3b] DoubleFloats v1.4.3 [f55ce6ea] FrankWolfe v0.5.6 [87dc4568] HiGHS v1.19.0 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.45.0 [3b969827] MathOptSetDistances v0.2.11 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_9mZ03M/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.0 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.0 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.4.3 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.14.0 [26cc04aa] FiniteDifferences v0.12.33 [f6369f11] ForwardDiff v1.2.1 [f55ce6ea] FrankWolfe v0.5.6 [14197337] GenericLinearAlgebra v0.3.18 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.19.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.45.0 [3b969827] MathOptSetDistances v0.2.11 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.5 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [92933f4c] ProgressMeter v1.11.0 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [708f8203] Richardson v1.4.2 [79098fc4] Rmath v0.8.0 [82193955] SCIP v0.12.7 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [4c63d2b9] StatsFuns v1.5.0 [856f2bd8] StructTypes v1.11.0 [fd094767] Suppressor v0.2.8 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.200+0 [e5ac4fe4] SCIP_jll v900.200.200+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.8+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [1317d2d5] oneTBB_jll v2022.0.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.9.9 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.2+0 [efcefdf7] PCRE2_jll v10.46.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.67.1+0 [3f19e933] p7zip_jll v17.6.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 9833.6 ms ✓ StatsBase 10330.5 ms ✓ Distributions 2 dependencies successfully precompiled in 24 seconds. 45 already precompiled. Precompiling packages... 4612.9 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 52 already precompiled. Precompiling packages... 4430.1 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 5 seconds. 49 already precompiled. Interface Tests seed = 0x8d15fdab4b1f04e8 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution LMO Tests seed = 0x76f240cd32be93ae Indicator Tests Heuristics Tests seed = 0xcda8562f7bdd9028 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Sparse Regression Tests seed = 0x0b8d3a4f8c821b02 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 3.419210e+00 3.525192e+00 1.059814e-01 3.099587e-02 1.893600e+01 1.584284e-01 7631 51 12 15 5 0 * 4 5 3.438338e+00 3.510374e+00 7.203515e-02 2.095057e-02 2.233000e+01 4.030452e-01 25 17 28 10 3 0 7 6 3.477622e+00 3.510374e+00 3.275182e-02 9.417877e-03 2.239900e+01 5.803831e-01 24 17 42 4 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.354437e+00 2.550788e+00 3.803649e+00 0.000000e+00 Inf 1 LD 2 3.510374e+00 3.510374e+00 0.000000e+00 2.075039e+00 9.638372e-01 1 Last 2 3.510374e+00 3.510374e+00 0.000000e+00 2.250749e+00 8.885931e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.510374e+00 3.510374e+00 0.000000e+00 2.255738e+00 8.866278e-01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.510373578596457 Dual Bound: 3.477621763112574 Dual Gap (relative): 0.009417877421657552 Search Statistics. Total number of nodes processed: 13 Total number of lmo calls: 47 Total time (s): 26.441 LMO calls / sec: 1.7775424530085853 Nodes / sec: 0.49166067849173634 LMO calls / node: 3.6153846153846154 Total number of global tightenings: 45 Global tightenings / node: 6.43 Total number of local tightenings: 47 Local tightenings / node: 6.71 Total number of potential local tightenings: 47 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.511414e+00 2.498907e+00 9.874930e-01 6.533569e-01 1.521100e+01 1.972257e-01 6862 229 35 81 20 1 100 59 2.098006e+00 2.498907e+00 4.009007e-01 1.910865e-01 2.345700e+01 6.778360e+00 40 30 1218 26 16 1 200 61 2.190897e+00 2.498907e+00 3.080105e-01 1.405865e-01 2.600100e+01 1.003808e+01 35 26 1636 25 16 0 300 61 2.245876e+00 2.498907e+00 2.530312e-01 1.126648e-01 2.843700e+01 1.269473e+01 30 21 2045 28 11 0 400 61 2.299415e+00 2.498907e+00 1.994926e-01 8.675798e-02 3.082300e+01 1.495636e+01 32 24 2453 19 7 0 500 59 2.345725e+00 2.498907e+00 1.531826e-01 6.530288e-02 3.333800e+01 1.676765e+01 34 25 2896 25 10 3 600 59 2.389853e+00 2.498907e+00 1.090543e-01 4.563223e-02 3.599400e+01 1.830861e+01 36 26 3358 22 6 0 700 59 2.428890e+00 2.498907e+00 7.001692e-02 2.882671e-02 3.870000e+01 1.961240e+01 40 29 3844 26 4 0 800 45 2.466342e+00 2.498907e+00 3.256539e-02 1.320392e-02 4.131400e+01 2.045312e+01 36 26 4327 29 6 0 817 38 2.475892e+00 2.498907e+00 2.301516e-02 9.295705e-03 4.170500e+01 2.050114e+01 7 5 4398 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.118812e+00 -2.909183e-01 7.409730e+00 0.000000e+00 Inf 1 LD 2 2.498907e+00 2.498907e+00 0.000000e+00 1.685338e-01 1.186706e+01 1 Last 2 2.498907e+00 2.498907e+00 0.000000e+00 3.354385e-01 5.962345e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.498907e+00 2.498907e+00 0.000000e+00 3.392320e-01 5.895671e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.4989072267369554 Dual Bound: 2.475892064419784 Dual Gap (relative): 0.009295705030083685 Search Statistics. Total number of nodes processed: 855 Total number of lmo calls: 4403 Total time (s): 43.778 LMO calls / sec: 100.5756315957787 Nodes / sec: 19.530357713920235 LMO calls / node: 5.1497076023391815 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: 4th entry: 0.1711082853811761 48th entry: 0.1711082853811761 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.627997e+00 2.498907e+00 8.709104e-01 5.349583e-01 2.860000e-01 1.048951e+01 280 230 35 81 20 1 100 29 2.181663e+00 2.498907e+00 3.172441e-01 1.454139e-01 8.454000e+00 1.525905e+01 28 21 1246 19 9 0 200 30 2.319447e+00 2.498907e+00 1.794602e-01 7.737198e-02 1.213100e+01 1.895969e+01 26 19 1866 15 7 1 300 29 2.428284e+00 2.498907e+00 7.062350e-02 2.908371e-02 1.590600e+01 2.068402e+01 32 24 2552 19 6 2 356 22 2.475561e+00 2.498907e+00 2.334659e-02 9.430828e-03 1.827600e+01 2.068286e+01 40 30 2974 23 8 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.118812e+00 -2.909183e-01 7.409730e+00 0.000000e+00 Inf 1 LD 2 2.498907e+00 2.498907e+00 0.000000e+00 1.363386e-03 1.466936e+03 1 Last 2 2.498907e+00 2.498907e+00 0.000000e+00 9.212291e-03 2.171013e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.498907e+00 2.498907e+00 0.000000e+00 1.353530e-02 1.477618e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.4989072267369554 Dual Bound: 2.4755606392970395 Dual Gap (relative): 0.00943082834219945 Search Statistics. Total number of nodes processed: 378 Total number of lmo calls: 2979 Total time (s): 18.303 LMO calls / sec: 162.7602032453696 Nodes / sec: 20.652352073430585 LMO calls / node: 7.880952380952381 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 Poisson Tests seed = 0xd417afac1c3d7cd9 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -3.409905e+02 -3.232676e+02 1.772290e+01 5.482422e-02 1.735700e+01 1.728409e-01 8981 112 35 1217 14 1 56 57 -3.399710e+02 -3.232676e+02 1.670338e+01 5.167045e-02 1.200050e+02 9.416274e-01 5227 128 1753 5074 21 9 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.955666e+02 5.913985e+02 4.168085e+00 0.000000e+00 Inf 1 LD 3 -3.231143e+02 -3.247503e+02 1.636007e+00 2.814718e-01 1.065826e+01 2 LD 43 -3.309955e+02 -3.315324e+02 5.369301e-01 5.085145e-01 8.456003e+01 3 LD 48 -3.327144e+02 -3.329271e+02 2.127369e-01 5.190634e-01 9.247426e+01 4 LD 97 -3.329416e+02 -3.329911e+02 4.956551e-02 5.650389e-01 1.716696e+02 5 LD 206 -3.330087e+02 -3.330326e+02 2.386898e-02 6.791511e-01 3.033198e+02 7 LD 268 -3.330132e+02 -3.330212e+02 7.991731e-03 7.481422e-01 3.582207e+02 8 LD 380 -3.330143e+02 -3.330162e+02 1.864449e-03 8.572587e-01 4.432734e+02 9 LD 486 -3.330144e+02 -3.330152e+02 8.173610e-04 9.562511e-01 5.082347e+02 11 LD 515 -3.330144e+02 -3.330146e+02 2.075033e-04 9.840439e-01 5.233507e+02 11 LD 584 -3.330144e+02 -3.330145e+02 5.092088e-05 1.038535e+00 5.623306e+02 11 LD 645 -3.330144e+02 -3.330144e+02 1.767548e-05 1.081988e+00 5.961250e+02 11 LD 681 -3.330144e+02 -3.330144e+02 5.992678e-06 1.111490e+00 6.126909e+02 12 LD 726 -3.330144e+02 -3.330144e+02 1.145152e-06 1.143833e+00 6.347082e+02 12 LD 843 -3.330144e+02 -3.330144e+02 3.304951e-07 1.220319e+00 6.908029e+02 12 LD 903 -3.330144e+02 -3.330144e+02 1.419956e-07 1.260244e+00 7.165278e+02 12 LD 935 -3.330144e+02 -3.330144e+02 8.920151e-08 1.283802e+00 7.283053e+02 12 Last 935 -3.330144e+02 -3.330144e+02 8.920151e-08 1.290963e+00 7.242653e+02 12 ---------------------------------------------------------------------------------------------------------------- PP 935 -3.330144e+02 -3.330144e+02 8.920150e-08 1.294774e+00 7.221340e+02 12 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -333.0144161609888 Dual Bound: -339.9710020589716 Dual Gap (relative): 0.020889743988199528 Search Statistics. Total number of nodes processed: 113 Total number of lmo calls: 1784 Total time (s): 123.237 LMO calls / sec: 14.476171928884995 Nodes / sec: 0.9169324147780293 LMO calls / node: 15.787610619469026 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 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -3.221004e+02 -3.187478e+02 3.352655e+00 1.051821e-02 1.879600e+01 1.596084e-01 7525 110 18 40 2 1 3 4 -3.213185e+02 -3.187478e+02 2.570742e+00 8.065130e-03 1.963600e+01 3.564881e-01 101 70 46 30 7 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.837744e+02 -1.844431e+02 6.687658e-01 0.000000e+00 Inf 1 LD 2 -3.187478e+02 -3.187478e+02 0.000000e+00 1.770385e-01 1.129698e+01 1 Last 2 -3.187478e+02 -3.187478e+02 0.000000e+00 3.595413e-01 5.562643e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.187478e+02 -3.187478e+02 0.000000e+00 3.644808e-01 5.487257e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -318.74775133236994 Dual Bound: -321.31849337679296 Dual Gap (relative): 0.008065129977159923 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 51 Total time (s): 21.793 LMO calls / sec: 2.3402009819666865 Nodes / sec: 0.32120405634836874 LMO calls / node: 7.285714285714286 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Test Suite: Error During Test at /home/pkgeval/.julia/packages/Boscia/Vk9ng/test/runtests.jl:15 Got exception outside of a @test LoadError: invalid assignment to constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/test/poisson.jl:201 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [3] macro expansion @ ~/.julia/packages/Boscia/Vk9ng/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [7] top-level scope @ none:6 [8] eval(m::Module, e::Any) @ Core ./boot.jl:489 [9] exec_options(opts::Base.JLOptions) @ Base ./client.jl:296 [10] _start() @ Base ./client.jl:563 in expression starting at /home/pkgeval/.julia/packages/Boscia/Vk9ng/test/poisson.jl:201 Test Summary: | Pass Error Total Time Boscia Test Suite | 128 1 129 19m05.8s Norm hyperbox | 4 4 58.2s Norm hyperbox - strong branching | 2 2 45.7s Normbox - Shadow set activation | 4 4 21.8s Normbox - strong convexity and sharpness | 6 6 17.5s Start with Active Set | 2 2 18.6s Interface - sparse poisson regression | 4 4 24.8s Different FW variants | 10 10 54.3s Different line search types | 8 8 1m22.5s Lazification | 5 5 21.6s DICG - Lazification | 10 10 1m09.8s DICG - warm_start | 5 5 1m22.4s User stop | 1 1 13.0s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 22.2s BLMO - Strong Branching | 4 4 20.3s Probability Simplex LMO | 4 4 48.2s Unit Simplex LMO | 2 2 35.8s Reverse Knapsack LMO | 2 2 50.0s Indicators | 5 5 0.2s Hyperplane Aware Rounding - Probability Simplex | 2 2 25.1s Hyperplane Aware Rounding - Unit Simplex | 2 2 26.8s Following Gradient Heuristic - Unit Simplex | 6 6 30.8s Rounding Heuristic - Unit Simplex | 3 3 32.3s Probability Rounding - Unit Cube | 2 2 23.1s Probability rounding - Probability Simplex | 3 3 21.6s Sparse Regression | 2 2 31.5s Sparse Regression Group | 7 7 1m05.7s Poisson sparse regression | 2 2 2m06.5s Hybrid branching poisson sparse regression | 3 3 25.3s RNG of the outermost testset: Xoshiro(0xb94fb0fbf14aa987, 0x54ce8c9e558d6135, 0xe7512db7b6544efb, 0xef6712ab9b4eb52c, 0xc822be1ec0bf4c41) ERROR: LoadError: Some tests did not pass: 128 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/Vk9ng/test/runtests.jl:15 caused by: Test.FailFastError() Stacktrace: [1] record(ts::Test.DefaultTestSet, t::Union{Test.Error, Test.Fail}; print_result::Bool) @ Test /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1288 [2] record(ts::Test.DefaultTestSet, t::Union{Test.Error, Test.Fail}) @ Test /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1274 [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1963 [inlined] [4] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/test/runtests.jl:17 [5] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [6] top-level scope @ none:6 [7] eval(m::Module, e::Any) @ Core ./boot.jl:489 [8] exec_options(opts::Base.JLOptions) @ Base ./client.jl:296 [9] _start() @ Base ./client.jl:563 caused by: LoadError: invalid assignment to constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/test/poisson.jl:201 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [3] macro expansion @ ~/.julia/packages/Boscia/Vk9ng/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/Vk9ng/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [7] top-level scope @ none:6 [8] eval(m::Module, e::Any) @ Core ./boot.jl:489 [9] exec_options(opts::Base.JLOptions) @ Base ./client.jl:296 [10] _start() @ Base ./client.jl:563 in expression starting at /home/pkgeval/.julia/packages/Boscia/Vk9ng/test/poisson.jl:201 Testing failed after 1176.95s ERROR: LoadError: Package Boscia errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2673 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2522 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:538 [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:515 [6] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:168 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:157 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [9] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [12] include(mod::Module, _path::String) @ Base ./Base.jl:309 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:330 [14] _start() @ Base ./client.jl:563 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1494.86s: package tests unexpectedly errored