Package evaluation of Boscia on Julia 1.13.0-DEV.1114 (7de5585024*) started at 2025-09-14T04:07:49.994 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 11.16s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Installed Bzip2_jll ──────────── v1.0.9+0 Installed MacroTools ─────────── v0.5.16 Installed DiffResults ────────── v1.1.0 Installed ForwardDiff ────────── v1.2.1 Installed ConstructionBase ───── v1.6.0 Installed GenericSchur ───────── v0.5.5 Installed FillArrays ─────────── v1.14.0 Installed DataStructures ─────── v0.18.22 Installed CodecZlib ──────────── v0.7.8 Installed ExprTools ──────────── v0.1.10 Installed Compat ─────────────── v4.18.0 Installed OrderedCollections ─── v1.8.1 Installed Statistics ─────────── v1.11.1 Installed TranscodingStreams ─── v0.11.3 Installed PrecompileTools ────── v1.3.3 Installed ProgressMeter ──────── v1.11.0 Installed CommonSubexpressions ─ v0.3.1 Installed TimerOutputs ───────── v0.5.29 Installed Richardson ─────────── v1.4.2 Installed StaticArraysCore ───── v1.4.3 Installed StaticArrays ───────── v1.9.15 Installed IrrationalConstants ── v0.2.4 Installed Hungarian ──────────── v0.7.0 Installed CodecBzip2 ─────────── v0.8.5 Installed NaNMath ────────────── v1.1.3 Installed Bonobo ─────────────── v0.1.3 Installed JSON3 ──────────────── v1.14.3 Installed FrankWolfe ─────────── v0.5.6 Installed ChainRulesCore ─────── v1.26.0 Installed OpenSpecFun_jll ────── v0.5.6+0 Installed DiffRules ──────────── v1.15.1 Installed LogExpFunctions ────── v0.3.29 Installed Arpack_jll ─────────── v3.5.1+1 Installed Parsers ────────────── v2.8.3 Installed JSON ───────────────── v0.21.4 Installed NamedTupleTools ────── v0.14.3 Installed FiniteDifferences ──── v0.12.33 Installed Setfield ───────────── v1.1.2 Installed SpecialFunctions ───── v2.5.1 Installed JLLWrappers ────────── v1.7.1 Installed Arpack ─────────────── v0.5.4 Installed Preferences ────────── v1.5.0 Installed MathOptSetDistances ── v0.2.11 Installed BenchmarkTools ─────── v1.6.0 Installed MutableArithmetics ─── v1.6.4 Installed StructTypes ────────── v1.11.0 Installed DocStringExtensions ── v0.9.5 Installed ProximalCore ───────── v0.1.2 Installed BlockDiagonals ─────── v0.1.42 Installed MathOptInterface ───── v1.44.0 Installed Boscia ─────────────── v0.1.39 Installing 3 artifacts Installed artifact OpenSpecFun 194.9 KiB Installed artifact Bzip2 503.5 KiB Installed artifact Arpack 147.2 KiB 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.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.44.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.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.0+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 9.08s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling packages... 4780.2 ms ✓ TestEnv 1 dependency successfully precompiled in 5 seconds. 27 already precompiled. Precompiling package dependencies... Precompilation completed after 569.94s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_yLyBsw/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.6 [87dc4568] HiGHS v1.19.0 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.44.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.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_yLyBsw/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.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.44.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.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 [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.0+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... seed = 0x5b830192d4138c48 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xcf39601c9b39d8fb seed = 0x7677d76adbf88dea [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x97706d8c2cbda097 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.478615e+00 2.691599e+00 2.129837e-01 8.592852e-02 1.737800e+01 1.726321e-01 7018 58 16 18 7 1 37 8 2.666142e+00 2.691599e+00 2.545694e-02 9.548232e-03 2.164700e+01 2.078810e+00 7 5 193 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.160241e+00 -8.669031e-01 8.027144e+00 0.000000e+00 Inf 1 LD 2 3.595424e+00 2.144607e+00 1.450817e+00 2.034111e+00 9.832306e-01 2 LD 5 2.691599e+00 2.691599e+00 0.000000e+00 2.296285e+00 2.177430e+00 1 Last 5 2.691599e+00 2.691599e+00 0.000000e+00 2.304650e+00 2.169527e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.691599e+00 2.691599e+00 0.000000e+00 2.309405e+00 2.165060e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.6915986455794485 Dual Bound: 2.666141706052959 Dual Gap (relative): 0.009548231989580519 Search Statistics. Total number of nodes processed: 45 Total number of lmo calls: 199 Total time (s): 25.557 LMO calls / sec: 7.786516414289627 Nodes / sec: 1.760770043432328 LMO calls / node: 4.4222222222222225 Total number of global tightenings: 38 Global tightenings / node: 1.03 Total number of local tightenings: 49 Local tightenings / node: 1.32 Total number of potential local tightenings: 49 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.160434e+00 3.114564e+00 9.541305e-01 4.416383e-01 1.436800e+01 2.087973e-01 6504 200 32 79 16 1 100 39 2.785134e+00 3.114564e+00 3.294300e-01 1.182816e-01 2.200500e+01 6.316746e+00 166 112 1218 159 18 10 200 39 2.919188e+00 3.114564e+00 1.953766e-01 6.692843e-02 2.437100e+01 9.806738e+00 25 18 1675 22 13 3 300 39 3.001795e+00 3.114564e+00 1.127696e-01 3.756740e-02 2.656500e+01 1.276115e+01 29 20 2097 25 12 1 400 35 3.064991e+00 3.114564e+00 4.957316e-02 1.617400e-02 2.877300e+01 1.511834e+01 34 25 2535 24 13 0 433 32 3.085015e+00 3.114564e+00 2.954945e-02 9.578383e-03 2.951300e+01 1.575577e+01 6 4 2681 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 8.267892e+00 -4.080763e-01 8.675968e+00 0.000000e+00 Inf 1 LD 3 3.258590e+00 3.094280e+00 1.643096e-01 2.272551e-01 1.320103e+01 2 LD 5 3.114564e+00 3.114564e+00 0.000000e+00 3.824751e-01 1.307275e+01 1 Last 5 3.114564e+00 3.114564e+00 0.000000e+00 3.893267e-01 1.284268e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.114564e+00 3.114564e+00 0.000000e+00 3.930877e-01 1.271981e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.1145644527082683 Dual Bound: 3.085014998779114 Dual Gap (relative): 0.009578382581883281 Search Statistics. Total number of nodes processed: 465 Total number of lmo calls: 2687 Total time (s): 31.282 LMO calls / sec: 85.8960424525286 Nodes / sec: 14.864778466849947 LMO calls / node: 5.778494623655914 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.16942184934894272 35th entry: 0.16942184934894272 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.295195e+00 3.114564e+00 8.193697e-01 3.569936e-01 2.300000e-01 1.304348e+01 227 185 32 79 16 1 100 15 2.910776e+00 3.114564e+00 2.037883e-01 7.001167e-02 8.002000e+00 1.437141e+01 25 18 1251 21 10 0 200 13 3.080041e+00 3.114564e+00 3.452394e-02 1.120892e-02 1.166300e+01 1.826288e+01 25 18 1928 22 12 2 203 13 3.084695e+00 3.114564e+00 2.986980e-02 9.683227e-03 1.176400e+01 1.836110e+01 26 18 1947 22 9 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 8.267892e+00 -4.080763e-01 8.675968e+00 0.000000e+00 Inf 1 LD 3 3.258590e+00 3.094280e+00 1.643096e-01 1.037479e-03 2.891625e+03 2 LD 5 3.114564e+00 3.114564e+00 0.000000e+00 4.696214e-03 1.064687e+03 1 Last 5 3.114564e+00 3.114564e+00 0.000000e+00 1.103650e-02 4.530421e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.114564e+00 3.114564e+00 0.000000e+00 1.442359e-02 3.466544e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.1145644527082683 Dual Bound: 3.084694654520435 Dual Gap (relative): 0.009683226877597402 Search Statistics. Total number of nodes processed: 216 Total number of lmo calls: 1953 Total time (s): 11.791 LMO calls / sec: 165.63480620812484 Nodes / sec: 18.319056907811042 LMO calls / node: 9.041666666666666 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 = 0x12e10e701c211a9a 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 -4.127926e+02 -3.788760e+02 3.391660e+01 8.951901e-02 1.632200e+01 1.838010e-01 8746 110 36 1003 12 3 * 6 7 -4.123072e+02 -3.853737e+02 2.693342e+01 6.988910e-02 2.174800e+01 5.977561e-01 802 100 183 611 17 11 * 8 9 -4.121253e+02 -3.935149e+02 1.861034e+01 4.729259e-02 2.320600e+01 7.325692e-01 896 80 234 761 21 7 100 99 -4.100586e+02 -3.935149e+02 1.654365e+01 4.204071e-02 1.114180e+02 1.786067e+00 1356 82 2713 1178 14 5 200 199 -4.093437e+02 -3.935149e+02 1.582879e+01 4.022410e-02 2.272100e+02 1.756085e+00 743 92 5492 599 10 7 * 252 249 -4.091072e+02 -3.941540e+02 1.495320e+01 3.793747e-02 2.832730e+02 1.768612e+00 1143 86 6915 1050 12 9 300 297 -4.089362e+02 -3.941540e+02 1.478223e+01 3.750369e-02 3.297700e+02 1.810353e+00 1226 72 8194 1151 3 3 400 397 -4.086140e+02 -3.941540e+02 1.445996e+01 3.668608e-02 4.475790e+02 1.780691e+00 634 64 10934 530 12 7 440 435 -4.085276e+02 -3.941540e+02 1.437355e+01 3.646685e-02 5.000050e+02 1.749983e+00 1651 76 12040 1463 10 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 6.984736e+02 6.940933e+02 4.380231e+00 0.000000e+00 Inf 1 LD 6 -3.764997e+02 -3.774389e+02 9.391893e-01 3.835752e-01 1.564230e+01 2 LD 85 -3.963629e+02 -3.966716e+02 3.086153e-01 6.045259e-01 1.406060e+02 4 LD 156 -3.986874e+02 -3.988316e+02 1.442398e-01 6.323458e-01 2.467005e+02 4 LD 248 -3.991639e+02 -3.991990e+02 3.508326e-02 6.724296e-01 3.688119e+02 5 LD 296 -3.991877e+02 -3.992052e+02 1.744273e-02 6.950957e-01 4.258406e+02 6 LD 380 -3.991971e+02 -3.992022e+02 5.139496e-03 7.315529e-01 5.194430e+02 7 LD 536 -3.991993e+02 -3.992015e+02 2.216206e-03 8.124470e-01 6.597353e+02 6 LD 625 -3.991996e+02 -3.992004e+02 8.368535e-04 8.620688e-01 7.250002e+02 7 LD 718 -3.991996e+02 -3.991999e+02 3.096497e-04 9.107443e-01 7.883662e+02 7 LD 803 -3.991996e+02 -3.991997e+02 1.151510e-04 9.575838e-01 8.385689e+02 7 LD 903 -3.991996e+02 -3.991997e+02 4.113227e-05 1.012757e+00 8.916256e+02 7 LD 984 -3.991996e+02 -3.991996e+02 1.573107e-05 1.057022e+00 9.309173e+02 7 P 1000 -3.991996e+02 -3.991996e+02 1.573107e-05 1.068705e+00 9.357122e+02 7 LD 1077 -3.991996e+02 -3.991996e+02 5.503569e-06 1.170052e+00 9.204720e+02 7 LD 1168 -3.991996e+02 -3.991996e+02 1.604841e-06 1.218676e+00 9.584171e+02 7 LD 1269 -3.991996e+02 -3.991996e+02 6.408587e-07 1.273673e+00 9.963308e+02 7 LD 1363 -3.991996e+02 -3.991996e+02 2.438647e-07 1.324303e+00 1.029220e+03 7 P 2000 -3.991996e+02 -3.991996e+02 2.438647e-07 1.689444e+00 1.183821e+03 7 P 3000 -3.991996e+02 -3.991996e+02 2.438647e-07 2.167564e+00 1.384042e+03 7 P 4000 -3.991996e+02 -3.991996e+02 2.438647e-07 2.596000e+00 1.540832e+03 7 P 5000 -3.991996e+02 -3.991996e+02 2.438647e-07 2.988418e+00 1.673126e+03 7 P 6000 -3.991996e+02 -3.991996e+02 2.438647e-07 3.347122e+00 1.792585e+03 7 P 7000 -3.991996e+02 -3.991996e+02 2.438647e-07 3.724609e+00 1.879392e+03 7 P 8000 -3.991996e+02 -3.991996e+02 2.438647e-07 4.080558e+00 1.960516e+03 7 P 9000 -3.991996e+02 -3.991996e+02 2.438647e-07 4.445650e+00 2.024451e+03 7 P 10000 -3.991996e+02 -3.991996e+02 2.438647e-07 4.811991e+00 2.078142e+03 7 Last 10001 -3.991996e+02 -3.991996e+02 1.739100e-07 4.816740e+00 2.076300e+03 7 ---------------------------------------------------------------------------------------------------------------- PP 10001 -3.991996e+02 -3.991996e+02 1.739100e-07 4.820604e+00 2.074636e+03 7 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -399.199631546318 Dual Bound: -408.52756247064383 Dual Gap (relative): 0.023366581998569603 Search Statistics. Total number of nodes processed: 875 Total number of lmo calls: 12068 Total time (s): 506.656 LMO calls / sec: 23.818922503631654 Nodes / sec: 1.7270100423166803 LMO calls / node: 13.792 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 [ Info: Polish solution Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2.0 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -3.728093e+02 -3.694789e+02 3.330450e+00 9.013911e-03 1.899900e+01 1.579030e-01 7472 73 12 16 2 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 -1.916641e+02 -1.923628e+02 6.986823e-01 0.000000e+00 Inf 1 LD 2 -3.694789e+02 -3.694789e+02 0.000000e+00 1.832403e-01 1.091463e+01 1 Last 2 -3.694789e+02 -3.694789e+02 0.000000e+00 3.755094e-01 5.326099e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.694789e+02 -3.694789e+02 0.000000e+00 3.802222e-01 5.260083e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -369.4788673081521 Dual Bound: -372.8093168709321 Dual Gap (relative): 0.009013910828091725 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 17 Total time (s): 21.151 LMO calls / sec: 0.8037445038059666 Nodes / sec: 0.14183726537752353 LMO calls / node: 5.666666666666667 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:1952 [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 26m08.2s Norm hyperbox | 4 4 55.5s Norm hyperbox - strong branching | 2 2 48.3s Normbox - Shadow set activation | 4 4 23.6s Normbox - strong convexity and sharpness | 6 6 16.4s Start with Active Set | 2 2 18.2s Interface - sparse poisson regression | 4 4 26.2s Different FW variants | 10 10 1m07.3s Different line search types | 8 8 2m27.0s Lazification | 5 5 23.2s DICG - Lazification | 10 10 1m51.8s DICG - warm_start | 5 5 1m29.5s User stop | 2 2 15.9s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 24.3s BLMO - Strong Branching | 4 4 21.2s Probability Simplex LMO | 4 4 48.2s Unit Simplex LMO | 4 4 56.7s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 24.0s Hyperplane Aware Rounding - Unit Simplex | 2 2 24.3s Following Gradient Heuristic - Unit Simplex | 6 6 32.6s Rounding Heuristic - Unit Simplex | 3 3 30.0s Probability Rounding - Unit Cube | 2 2 19.3s Probability rounding - Probability Simplex | 3 3 21.0s Sparse Regression | 2 2 31.1s Sparse Regression Group | 7 7 46.8s Poisson sparse regression | 2 2 8m29.7s Hybrid branching poisson sparse regression | 3 3 24.7s RNG of the outermost testset: Xoshiro(0x035e9e62c47d1ca6, 0xb9533fdf5125ef62, 0xbf4da376a7f370b1, 0x2980a64d84494379, 0x0e611b709db0f690) 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 1595.55s 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: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 2217.25s: package tests unexpectedly errored