Package evaluation of Boscia on Julia 1.13.0-DEV.834 (c3282ceaac*) started at 2025-07-08T18:30:16.589 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.32s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Installed Boscia ─ v0.1.39 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.25.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.0 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.0.1 [f55ce6ea] + FrankWolfe v0.5.3 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.41.0 [3b969827] + MathOptSetDistances v0.2.11 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [92933f4c] + ProgressMeter v1.10.4 [dc4f5ac2] + ProximalCore v0.1.2 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.14.1+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.5.20 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.65.0+0 [3f19e933] + p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.37s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 124.9s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_RYAoI5/Project.toml` [4c88cf16] Aqua v0.8.13 [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.3 [87dc4568] HiGHS v1.18.1 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.41.0 [3b969827] MathOptSetDistances v0.2.11 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_RYAoI5/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.13 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.39 [d360d2e6] ChainRulesCore v1.25.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.0 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.4.3 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.0.1 [f55ce6ea] FrankWolfe v0.5.3 [14197337] GenericLinearAlgebra v0.3.17 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.18.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.41.0 [3b969827] MathOptSetDistances v0.2.11 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [92933f4c] ProgressMeter v1.10.4 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [708f8203] Richardson v1.4.2 [79098fc4] Rmath v0.8.0 [82193955] SCIP v0.12.7 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.1 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.5 [4c63d2b9] StatsFuns v1.5.0 [856f2bd8] StructTypes v1.11.0 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.1+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.200+0 [e5ac4fe4] SCIP_jll v900.200.200+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [1317d2d5] oneTBB_jll v2022.0.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.14.1+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 11378.3 ms ✓ Distributions 1 dependency successfully precompiled in 14 seconds. 46 already precompiled. Precompiling packages... 5043.2 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. Precompiling packages... 5283.2 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 7 seconds. 52 already precompiled. seed = 0xeba903754915cdcf [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0x92c540739d5049c5 seed = 0x28bdbd56e00c6fd2 seed = 0xe84301ce5e172908 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 3.758686e+00 4.025898e+00 2.672121e-01 7.109190e-02 1.905500e+01 1.574390e-01 7814 84 18 26 5 1 41 12 3.994827e+00 4.025898e+00 3.107078e-02 7.777753e-03 2.358300e+01 2.247382e+00 9 6 202 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 9.241642e+00 4.350202e-01 8.806621e+00 0.000000e+00 Inf 1 LD 2 4.952196e+00 3.635418e+00 1.316778e+00 2.267261e+00 8.821215e-01 2 LD 4 4.025898e+00 4.025898e+00 0.000000e+00 2.525499e+00 1.583846e+00 1 Last 4 4.025898e+00 4.025898e+00 0.000000e+00 2.532961e+00 1.579180e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 4 4.025898e+00 4.025898e+00 0.000000e+00 2.536758e+00 1.576815e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 4.025898207676322 Dual Bound: 3.994827426327001 Dual Gap (relative): 0.007777753087544167 Search Statistics. Total number of nodes processed: 53 Total number of lmo calls: 208 Total time (s): 27.945 LMO calls / sec: 7.443191984254786 Nodes / sec: 1.8965825729110752 LMO calls / node: 3.9245283018867925 Total number of global tightenings: 39 Global tightenings / node: 0.95 Total number of local tightenings: 48 Local tightenings / node: 1.17 Total number of potential local tightenings: 48 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.415535e+00 3.467686e+00 1.052151e+00 4.355768e-01 1.705900e+01 1.758602e-01 7851 235 32 71 18 1 100 55 3.082165e+00 3.467686e+00 3.855207e-01 1.250811e-01 2.607900e+01 5.943479e+00 30 20 1184 20 12 1 200 55 3.180567e+00 3.467686e+00 2.871188e-01 9.027284e-02 2.888300e+01 8.828723e+00 41 30 1621 24 14 1 300 55 3.248760e+00 3.467686e+00 2.189258e-01 6.738750e-02 3.175600e+01 1.117899e+01 46 35 2056 18 9 0 400 55 3.316831e+00 3.467686e+00 1.508545e-01 4.548150e-02 3.459100e+01 1.315371e+01 42 31 2507 19 4 0 500 55 3.373048e+00 3.467686e+00 9.463757e-02 2.805699e-02 3.735100e+01 1.485904e+01 33 23 2964 18 4 1 600 49 3.422574e+00 3.467686e+00 4.511148e-02 1.318057e-02 4.020600e+01 1.614187e+01 35 25 3438 30 5 0 615 46 3.433685e+00 3.467686e+00 3.400091e-02 9.902164e-03 4.060900e+01 1.627718e+01 8 6 3502 0 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.204152e+00 -5.051025e-01 9.709254e+00 0.000000e+00 Inf 1 LD 2 4.538499e+00 3.001216e+00 1.537284e+00 1.666726e-01 1.199957e+01 2 LD 5 3.467686e+00 3.467686e+00 0.000000e+00 4.253042e-01 1.175629e+01 1 Last 5 3.467686e+00 3.467686e+00 0.000000e+00 4.336962e-01 1.152881e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.467686e+00 3.467686e+00 0.000000e+00 4.393767e-01 1.137976e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.467685842551479 Dual Bound: 3.4336849305111294 Dual Gap (relative): 0.009902164213793615 Search Statistics. Total number of nodes processed: 661 Total number of lmo calls: 3508 Total time (s): 42.833 LMO calls / sec: 81.89947003478626 Nodes / sec: 15.432026708379054 LMO calls / node: 5.3071104387291985 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: 16th entry: 0.1699400374051933 44th entry: 0.1699400374051933 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.526414e+00 3.467686e+00 9.412717e-01 3.725722e-01 2.870000e-01 1.045296e+01 283 231 32 71 18 1 100 32 3.132702e+00 3.467686e+00 3.349837e-01 1.069312e-01 8.545000e+00 1.544763e+01 29 21 1155 20 12 1 200 25 3.286007e+00 3.467686e+00 1.816787e-01 5.528861e-02 1.263100e+01 1.781332e+01 29 20 1794 21 11 0 300 23 3.417356e+00 3.467686e+00 5.032992e-02 1.472774e-02 1.712500e+01 1.886131e+01 31 23 2509 19 6 0 312 23 3.433731e+00 3.467686e+00 3.395449e-02 9.888510e-03 1.765200e+01 1.897802e+01 41 29 2595 27 10 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.204152e+00 -5.051025e-01 9.709254e+00 0.000000e+00 Inf 1 LD 2 4.538499e+00 3.001216e+00 1.537284e+00 1.290347e-03 1.549971e+03 2 LD 5 3.467686e+00 3.467686e+00 0.000000e+00 5.757573e-03 8.684215e+02 1 Last 5 3.467686e+00 3.467686e+00 0.000000e+00 1.313442e-02 3.806791e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 5 3.467686e+00 3.467686e+00 0.000000e+00 1.698755e-02 2.943331e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.467685842551479 Dual Bound: 3.4337313563124887 Dual Gap (relative): 0.009888509820830723 Search Statistics. Total number of nodes processed: 335 Total number of lmo calls: 2601 Total time (s): 17.683 LMO calls / sec: 147.09042583272068 Nodes / sec: 18.944749194141266 LMO calls / node: 7.764179104477612 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 = 0xc1553f40d3c123d6 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 -2.610136e+02 -2.436167e+02 1.739695e+01 7.141116e-02 1.673300e+01 1.792864e-01 7429 121 38 1106 20 1 * 15 16 -2.609692e+02 -2.457531e+02 1.521609e+01 6.191615e-02 4.414500e+01 7.022313e-01 1586 120 493 1151 11 5 100 99 -2.601868e+02 -2.457531e+02 1.443374e+01 5.873267e-02 2.033770e+02 9.784784e-01 1094 90 3086 908 18 10 * 164 163 -2.600010e+02 -2.473735e+02 1.262753e+01 5.104642e-02 3.130360e+02 1.044608e+00 462 77 5055 310 12 10 200 199 -2.599541e+02 -2.473735e+02 1.258055e+01 5.085651e-02 3.709190e+02 1.075707e+00 1062 82 6145 898 17 3 267 266 -2.597948e+02 -2.473735e+02 1.242130e+01 5.021273e-02 5.000070e+02 1.065985e+00 832 70 8207 499 11 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.882810e+02 4.839451e+02 4.335923e+00 0.000000e+00 Inf 1 LD 4 -2.481130e+02 -2.488710e+02 7.580038e-01 3.213780e-01 1.244640e+01 2 LD 117 -2.535700e+02 -2.539326e+02 3.625923e-01 5.837658e-01 2.004228e+02 5 LD 207 -2.543413e+02 -2.545080e+02 1.666676e-01 7.243318e-01 2.857806e+02 7 LD 320 -2.545780e+02 -2.546289e+02 5.094956e-02 7.790629e-01 4.107499e+02 7 LD 368 -2.545985e+02 -2.546235e+02 2.504630e-02 8.077085e-01 4.556099e+02 8 LD 430 -2.546024e+02 -2.546100e+02 7.554472e-03 8.457246e-01 5.084397e+02 10 LD 502 -2.546031e+02 -2.546065e+02 3.389564e-03 8.847990e-01 5.673605e+02 11 LD 577 -2.546032e+02 -2.546047e+02 1.461689e-03 9.338519e-01 6.178710e+02 12 LD 646 -2.546032e+02 -2.546038e+02 5.349129e-04 9.755056e-01 6.622207e+02 12 LD 759 -2.546032e+02 -2.546034e+02 2.011174e-04 1.040054e+00 7.297696e+02 12 LD 862 -2.546032e+02 -2.546033e+02 6.974226e-05 1.097127e+00 7.856881e+02 12 LD 972 -2.546032e+02 -2.546033e+02 2.574955e-05 1.157843e+00 8.394917e+02 12 P 1000 -2.546032e+02 -2.546033e+02 2.574955e-05 1.176200e+00 8.501952e+02 12 LD 1084 -2.546032e+02 -2.546033e+02 9.510933e-06 1.298396e+00 8.348761e+02 12 LD 1191 -2.546032e+02 -2.546033e+02 3.479606e-06 1.357700e+00 8.772185e+02 12 LD 1292 -2.546032e+02 -2.546032e+02 1.345102e-06 1.413255e+00 9.142014e+02 12 P 2000 -2.546032e+02 -2.546032e+02 1.345102e-06 1.848181e+00 1.082145e+03 12 P 3000 -2.546032e+02 -2.546032e+02 1.345102e-06 2.375240e+00 1.263030e+03 12 P 4000 -2.546032e+02 -2.546032e+02 1.345102e-06 2.870307e+00 1.393579e+03 12 P 5000 -2.546032e+02 -2.546032e+02 1.345102e-06 3.328987e+00 1.501959e+03 12 P 6000 -2.546032e+02 -2.546032e+02 1.345102e-06 3.773416e+00 1.590071e+03 12 P 7000 -2.546032e+02 -2.546032e+02 1.345102e-06 4.251031e+00 1.646659e+03 12 P 8000 -2.546032e+02 -2.546032e+02 1.345102e-06 4.727898e+00 1.692084e+03 12 P 9000 -2.546032e+02 -2.546032e+02 1.345102e-06 5.209446e+00 1.727631e+03 12 P 10000 -2.546032e+02 -2.546032e+02 1.345102e-06 5.667151e+00 1.764555e+03 12 Last 10001 -2.546032e+02 -2.546032e+02 6.355096e-07 5.672889e+00 1.762947e+03 12 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.546032e+02 -2.546032e+02 6.355096e-07 5.677421e+00 1.761539e+03 12 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -254.60324736157642 Dual Bound: -259.79480622108196 Dual Gap (relative): 0.020390780217083047 Search Statistics. Total number of nodes processed: 533 Total number of lmo calls: 8238 Total time (s): 507.782 LMO calls / sec: 16.223497485141262 Nodes / sec: 1.0496630443773116 LMO calls / node: 15.455909943714822 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 -2.494914e+02 -2.425686e+02 6.922750e+00 2.853935e-02 2.151200e+01 1.394570e-01 8351 87 13 18 3 2 * 2 3 -2.494914e+02 -2.444045e+02 5.086840e+00 2.081320e-02 2.202200e+01 2.270457e-01 70 52 21 9 4 2 * 3 4 -2.487810e+02 -2.450792e+02 3.701787e+00 1.510445e-02 2.262400e+01 3.094059e-01 112 81 33 19 5 0 * 9 10 -2.481313e+02 -2.451495e+02 2.981756e+00 1.216301e-02 2.518700e+01 7.543574e-01 74 56 90 9 5 0 17 18 -2.476006e+02 -2.451495e+02 2.451041e+00 9.998148e-03 2.885000e+01 1.213172e+00 95 68 169 16 3 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 -1.392580e+02 -1.399440e+02 6.859810e-01 0.000000e+00 Inf 1 LD 2 -2.451495e+02 -2.451495e+02 0.000000e+00 1.918912e-01 1.042257e+01 1 Last 2 -2.451495e+02 -2.451495e+02 0.000000e+00 3.942779e-01 5.072565e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.451495e+02 -2.451495e+02 0.000000e+00 4.002610e-01 4.996740e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -245.14951217180638 Dual Bound: -247.60055334408196 Dual Gap (relative): 0.009998148275154776 Search Statistics. Total number of nodes processed: 35 Total number of lmo calls: 174 Total time (s): 31.236 LMO calls / sec: 5.570495582020746 Nodes / sec: 1.1205019848892304 LMO calls / node: 4.9714285714285715 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:310 [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:1855 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [7] top-level scope @ none:6 [8] eval(m::Module, e::Any) @ Core ./boot.jl:489 [9] exec_options(opts::Base.JLOptions) @ Base ./client.jl:290 [10] _start() @ Base ./client.jl:557 in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 Test Summary: | Pass Error Total Time Boscia Test Suite | 130 1 131 27m45.4s Norm hyperbox | 4 4 56.9s Norm hyperbox - strong branching | 2 2 50.2s Normbox - Shadow set activation | 4 4 26.7s Normbox - strong convexity and sharpness | 6 6 21.0s Start with Active Set | 2 2 22.5s Interface - sparse poisson regression | 4 4 28.4s Different FW variants | 10 10 1m07.8s Different line search types | 8 8 2m27.2s Lazification | 5 5 22.6s DICG - Lazification | 10 10 1m22.4s DICG - warm_start | 5 5 1m00.5s User stop | 2 2 17.8s Linear feasible | 4 4 0.2s Integer bounds | 10 10 0.1s Cube LMO | 4 4 27.3s BLMO - Strong Branching | 4 4 25.6s Probability Simplex LMO | 4 4 1m00.5s Unit Simplex LMO | 4 4 1m19.9s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 28.8s Hyperplane Aware Rounding - Unit Simplex | 2 2 31.8s Following Gradient Heuristic - Unit Simplex | 6 6 39.6s Rounding Heuristic - Unit Simplex | 3 3 36.2s Probability Rounding - Unit Cube | 2 2 21.7s Probability rounding - Probability Simplex | 4 4 24.5s Sparse Regression | 2 2 33.5s Sparse Regression Group | 7 7 1m04.3s Poisson sparse regression | 2 2 8m31.4s Hybrid branching poisson sparse regression | 3 3 35.2s RNG of the outermost testset: Xoshiro(0xff76b85b590fa256, 0xdfd07d584ea50551, 0x276eb1f69944e2ac, 0x0ce03b7d0b86918a, 0xbe334aa094051a6b) ERROR: LoadError: Some tests did not pass: 130 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Testing failed after 1700.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:2446 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2301 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:500 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:151 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:309 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:324 [12] _start() @ Base ./client.jl:557 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1868.93s: package tests unexpectedly errored