Package evaluation of Boscia on Julia 1.12.0-rc1.2 (995ff9db19*) started at 2025-07-14T18:07:59.821 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.77s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [36b166db] + Boscia v0.1.39 Updating `~/.julia/environments/v1.12/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.4 [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.42.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.6.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.11.1+1 [e37daf67] + LibGit2_jll v1.9.0+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 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.64.0+1 [3f19e933] + p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.5s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 126.57s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_GSsmLF/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.4 [87dc4568] HiGHS v1.18.1 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.42.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_GSsmLF/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.4 [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.42.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.6.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.11.1+1 [e37daf67] LibGit2_jll v1.9.0+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 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.64.0+1 [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... 5649.8 ms ✓ StatsBase 11090.8 ms ✓ Distributions 2 dependencies successfully precompiled in 19 seconds. 46 already precompiled. Precompiling packages... 4782.5 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 50 already precompiled. Precompiling packages... 4928.3 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 53 already precompiled. seed = 0xeaff795e3e0a4628 Sharpness: Error During Test at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/interface_test.jl:163 Got exception outside of a @test AssertionError: node dual gap is negative: -1.1102230246251565e-16 Stacktrace: [1] tightening_lowerbound(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedBoundedLMO{Boscia.CubeSimpleBLMO}}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, x::Vector{Float64}, lower_bound::Float64) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/tightenings.jl:228 [2] evaluate_node!(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedBoundedLMO{Boscia.CubeSimpleBLMO}}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}, node::Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/node.jl:383 [3] optimize!(tree::Bonobo.BnBTree{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, @NamedTuple{problem::Boscia.SimpleOptimizationProblem{var"#f#f##5", var"#grad!#grad!##3", Boscia.TimeTrackingLMO{Boscia.ManagedBoundedLMO{Boscia.CubeSimpleBLMO}}, Boscia.IntegerBounds}, current_node_id::Base.RefValue{Int64}, updated_incumbent::Base.RefValue{Bool}, global_tightening_rhs::Base.RefValue{Float64}, global_tightening_root_info::@NamedTuple{lower_bounds::Dict{Int64, Tuple{Float64, Float64}}, upper_bounds::Dict{Int64, Tuple{Float64, Float64}}}, global_tightenings::Boscia.IntegerBounds, options::Dict{Symbol, Any}, result::Dict{Symbol, Any}}, Vector{Float64}, Boscia.FrankWolfeSolution{Boscia.FrankWolfeNode{FrankWolfe.ActiveSet{Vector{Float64}, Float64, Vector{Float64}}, FrankWolfe.DeletedVertexStorage{Vector{Float64}}, Boscia.IntegerBounds, Boscia.NodeInfo{Float64}}, Vector{Float64}}}; callback::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#39#build_bnb_callback##1"{DateTime, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Int64}, Vector{Int64}, Bool, Vector{Int64}, Vector{Int64}, Vector{Int64}, Dict{Symbol, Any}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Vector{Int64}}, Vector{Int64}, Nothing, Vector{Int64}, Vector{Int64}, Vector{Int64}, Int64, Int64, Int64, String, Vector{String}}}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/custom_bonobo.jl:35 [4] solve(f::var"#f#f##5", grad!::var"#grad!#grad!##3", blmo::Boscia.ManagedBoundedLMO{Boscia.CubeSimpleBLMO}; traverse_strategy::Bonobo.BestFirstSearch, branching_strategy::Bonobo.MOST_INFEASIBLE, variant::Boscia.BPCG, line_search::FrankWolfe.Secant{FrankWolfe.var"#Secant##2#Secant##3", FrankWolfe.Adaptive{Float64, Int64, FrankWolfe.var"#Adaptive##4#Adaptive##5"}}, active_set::Nothing, lazy::Bool, lazy_tolerance::Float64, fw_epsilon::Float64, verbose::Bool, dual_gap::Float64, rel_dual_gap::Float64, time_limit::Float64, node_limit::Float64, print_iter::Int64, dual_gap_decay_factor::Float64, max_fw_iter::Int64, min_number_lower::Float64, min_node_fw_epsilon::Float64, use_postsolve::Bool, min_fw_iterations::Int64, max_iteration_post::Int64, dual_tightening::Bool, global_dual_tightening::Bool, bnb_callback::Nothing, strong_convexity::Float64, sharpness_constant::Float64, sharpness_exponent::Float64, domain_oracle::typeof(Boscia._trivial_domain), find_domain_point::typeof(Boscia._trivial_domain_point), start_solution::Nothing, fw_verbose::Bool, use_shadow_set::Bool, custom_heuristics::Vector{Boscia.Heuristic{Boscia.var"#Heuristic##0#Heuristic##1"}}, rounding_prob::Float64, clean_solutions::Bool, max_clean_iter::Int64, use_strong_lazy::Bool, use_DICG_warm_start::Bool, use_strong_warm_start::Bool, build_dicg_start_point::typeof(Boscia.trivial_build_dicg_start_point), kwargs::@Kwargs{}) @ Boscia ~/.julia/packages/Boscia/qQ4D3/src/interface.jl:344 [5] #solve#107 @ ~/.julia/packages/Boscia/qQ4D3/src/managed_blmo.jl:340 [inlined] [6] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/interface_test.jl:133 [7] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [8] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/interface_test.jl:164 [inlined] [9] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [10] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/interface_test.jl:172 [inlined] [11] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:306 [12] IncludeInto @ ./Base.jl:307 [inlined] [13] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [inlined] [14] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [15] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [16] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:306 [17] top-level scope @ none:6 [18] eval(m::Module, e::Any) @ Core ./boot.jl:489 [19] exec_options(opts::Base.JLOptions) @ Base ./client.jl:287 [20] _start() @ Base ./client.jl:554 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution seed = 0xfef9949e4d4fd538 seed = 0x4444aa7c96a64949 seed = 0xb7002856353136f6 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.746677e+00 2.826115e+00 7.943747e-02 2.892130e-02 1.885700e+01 1.590921e-01 7326 39 9 14 1 0 5 2 2.802946e+00 2.826115e+00 2.316882e-02 8.265882e-03 2.233300e+01 3.134375e-01 16 11 27 2 1 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 2.826115e+00 2.826115e+00 0.000000e+00 3.901359e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 2.826115e+00 2.826115e+00 0.000000e+00 2.205225e+00 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.8261149490857327 Dual Bound: 2.8029461271245815 Dual Gap (relative): 0.008265882007842616 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 31 Total time (s): 26.31 LMO calls / sec: 1.1782592170277462 Nodes / sec: 0.266058532877233 LMO calls / node: 4.428571428571429 Total number of global tightenings: 46 Global tightenings / node: 9.2 Total number of local tightenings: 46 Local tightenings / node: 9.2 Total number of potential local tightenings: 46 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 3.134317e-01 7.298897e-01 4.164580e-01 1.328704e+00 1.554200e+01 1.930254e-01 7395 309 43 115 22 2 * 3 4 3.283001e-01 7.081465e-01 3.798464e-01 1.157010e+00 1.587300e+01 4.410004e-01 110 79 80 58 15 1 * 37 36 4.551258e-01 6.092718e-01 1.541461e-01 3.386889e-01 2.095000e+01 3.484487e+00 33 24 734 10 3 0 100 47 5.089009e-01 6.092718e-01 1.003709e-01 1.972307e-01 2.502100e+01 5.875065e+00 45 31 1316 51 11 4 200 51 5.391919e-01 6.092718e-01 7.007995e-02 1.299722e-01 3.051800e+01 8.224654e+00 97 54 2162 161 16 4 300 51 5.569966e-01 6.092718e-01 5.227518e-02 9.385188e-02 3.579000e+01 9.807209e+00 50 33 2984 76 11 7 400 53 5.712230e-01 6.092718e-01 3.804884e-02 6.660943e-02 4.135300e+01 1.095447e+01 81 44 3843 219 15 5 500 53 5.844228e-01 6.092718e-01 2.484899e-02 4.251885e-02 4.670700e+01 1.183977e+01 86 51 4715 165 12 4 600 51 5.989520e-01 6.092718e-01 1.031982e-02 1.722979e-02 5.251300e+01 1.239693e+01 70 46 5596 101 12 4 629 42 6.033607e-01 6.092718e-01 5.911144e-03 9.797031e-03 5.414200e+01 1.239334e+01 26 19 5849 6 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.380196e+00 -3.208370e+00 6.588566e+00 0.000000e+00 Inf 1 LD 2 1.114025e+00 -3.421955e-01 1.456220e+00 2.108124e-01 9.487108e+00 2 LD 5 6.149771e-01 5.561793e-01 5.879785e-02 5.130487e-01 9.745663e+00 2 LD 8 6.092939e-01 6.057757e-01 3.518163e-03 5.181274e-01 1.544022e+01 2 LD 13 6.092722e-01 6.081934e-01 1.078887e-03 5.272313e-01 2.465711e+01 3 LD 17 6.092719e-01 6.090339e-01 2.379840e-04 5.317535e-01 3.196970e+01 3 LD 21 6.092718e-01 6.091983e-01 7.352328e-05 5.364283e-01 3.914782e+01 3 LD 24 6.092718e-01 6.092547e-01 1.714315e-05 5.411168e-01 4.435271e+01 3 LD 28 6.092718e-01 6.092646e-01 7.230245e-06 5.456583e-01 5.131417e+01 3 LD 31 6.092718e-01 6.092704e-01 1.427642e-06 5.500579e-01 5.635770e+01 3 LD 36 6.092718e-01 6.092716e-01 2.462937e-07 5.548963e-01 6.487699e+01 3 LD 40 6.092718e-01 6.092718e-01 4.428456e-08 5.597933e-01 7.145495e+01 3 Last 40 6.092718e-01 6.092718e-01 4.428456e-08 5.687833e-01 7.032556e+01 3 ---------------------------------------------------------------------------------------------------------------- PP 40 6.092718e-01 6.092718e-01 4.428456e-08 5.733427e-01 6.976631e+01 3 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 0.6092718034564604 Dual Bound: 0.6033606805769913 Dual Gap (relative): 0.009796997168950853 Search Statistics. Total number of nodes processed: 671 Total number of lmo calls: 5865 Total time (s): 56.473 LMO calls / sec: 103.8549395286243 Nodes / sec: 11.881784215465798 LMO calls / node: 8.740685543964233 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: 3 Non zero entries: 14th entry: 0.11648011699630888 26th entry: 0.11453685760449674 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 3.140164e-01 7.298897e-01 4.158733e-01 1.324368e+00 4.040000e-01 7.425743e+00 399 319 43 115 22 2 * 3 4 3.288434e-01 7.081465e-01 3.793031e-01 1.153446e+00 7.070000e-01 9.900990e+00 98 70 80 58 15 1 * 37 36 4.557049e-01 6.092718e-01 1.535669e-01 3.369876e-01 5.789000e+00 1.261012e+01 28 21 734 10 3 0 100 47 5.092002e-01 6.092718e-01 1.000716e-01 1.965271e-01 9.530000e+00 1.542497e+01 41 28 1316 51 11 4 200 51 5.394372e-01 6.092718e-01 6.983461e-02 1.294583e-01 1.459500e+01 1.719767e+01 89 55 2162 161 16 4 300 51 5.572546e-01 6.092718e-01 5.201726e-02 9.334559e-02 1.965200e+01 1.786078e+01 48 32 2984 76 11 7 400 53 5.714676e-01 6.092718e-01 3.780424e-02 6.615290e-02 2.477900e+01 1.828161e+01 76 42 3843 219 15 5 500 53 5.847086e-01 6.092718e-01 2.456318e-02 4.200927e-02 2.976500e+01 1.857887e+01 86 51 4715 165 12 4 600 49 5.992592e-01 6.092718e-01 1.001266e-02 1.670839e-02 3.493100e+01 1.857949e+01 45 31 5596 101 12 4 627 35 6.034968e-01 6.092718e-01 5.775025e-03 9.569272e-03 3.589700e+01 1.844165e+01 13 10 5832 6 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.380196e+00 -3.208370e+00 6.588566e+00 0.000000e+00 Inf 1 LD 2 1.114025e+00 -3.421955e-01 1.456220e+00 9.338610e-04 2.141646e+03 2 LD 5 6.149771e-01 5.561793e-01 5.879785e-02 4.273108e-03 1.170109e+03 2 LD 8 6.092939e-01 6.057757e-01 3.518163e-03 7.116130e-03 1.124207e+03 2 LD 13 6.092722e-01 6.081934e-01 1.078887e-03 1.216065e-02 1.069022e+03 3 LD 17 6.092719e-01 6.090339e-01 2.379840e-04 1.482961e-02 1.146355e+03 3 LD 21 6.092718e-01 6.091983e-01 7.352328e-05 1.774768e-02 1.183253e+03 3 LD 24 6.092718e-01 6.092547e-01 1.714315e-05 2.047118e-02 1.172380e+03 3 LD 28 6.092718e-01 6.092646e-01 7.230245e-06 2.334582e-02 1.199358e+03 3 LD 31 6.092718e-01 6.092704e-01 1.427642e-06 2.647183e-02 1.171056e+03 3 LD 36 6.092718e-01 6.092716e-01 2.462937e-07 2.949411e-02 1.220583e+03 3 LD 40 6.092718e-01 6.092718e-01 4.428456e-08 3.252445e-02 1.229844e+03 3 Last 40 6.092718e-01 6.092718e-01 4.428456e-08 3.772156e-02 1.060402e+03 3 ---------------------------------------------------------------------------------------------------------------- PP 40 6.092718e-01 6.092718e-01 4.428456e-08 4.070634e-02 9.826480e+02 3 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 0.6092718034564604 Dual Bound: 0.603496798855111 Dual Gap (relative): 0.009569238167137097 Search Statistics. Total number of nodes processed: 662 Total number of lmo calls: 5848 Total time (s): 35.95 LMO calls / sec: 162.6703755215577 Nodes / sec: 18.4144645340751 LMO calls / node: 8.833836858006043 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: 3 seed = 0xaada350eb246a15f 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 -5.761839e+02 -5.437625e+02 3.242145e+01 5.962428e-02 1.917300e+01 1.564700e-01 10880 164 46 2583 18 7 * 2 3 -5.761839e+02 -5.453539e+02 3.083006e+01 5.653222e-02 2.019400e+01 2.475983e-01 1015 86 71 710 13 9 * 4 5 -5.760449e+02 -5.487961e+02 2.724876e+01 4.965188e-02 2.303700e+01 3.906759e-01 1473 113 136 1012 15 8 * 8 9 -5.753578e+02 -5.489650e+02 2.639277e+01 4.807733e-02 2.850500e+01 5.963866e-01 1363 94 240 974 10 4 * 10 11 -5.750785e+02 -5.515902e+02 2.348831e+01 4.258290e-02 3.261200e+01 6.439347e-01 1209 92 293 839 15 7 * 18 19 -5.748239e+02 -5.524997e+02 2.232422e+01 4.040585e-02 4.977900e+01 7.432853e-01 881 98 465 545 11 11 * 30 31 -5.741310e+02 -5.540395e+02 2.009149e+01 3.626364e-02 6.902500e+01 8.837378e-01 1825 90 791 1256 12 11 100 101 -5.728519e+02 -5.540395e+02 1.881245e+01 3.395508e-02 1.848400e+02 1.087427e+00 1911 105 2697 1484 13 7 * 163 164 -5.722874e+02 -5.543468e+02 1.794063e+01 3.236354e-02 2.866550e+02 1.140744e+00 1322 93 4468 995 11 4 200 199 -5.720744e+02 -5.543468e+02 1.772754e+01 3.197915e-02 3.465650e+02 1.151299e+00 1290 80 5471 1004 10 10 298 297 -5.715419e+02 -5.543468e+02 1.719509e+01 3.101865e-02 5.000070e+02 1.189983e+00 712 54 8139 495 10 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.906988e+02 8.864939e+02 4.204918e+00 0.000000e+00 Inf 1 LD 4 -5.471807e+02 -5.487286e+02 1.547891e+00 3.102121e-01 1.289441e+01 2 LD 62 -5.583246e+02 -5.590374e+02 7.127376e-01 5.358082e-01 1.157130e+02 3 LD 95 -5.628543e+02 -5.630911e+02 2.367977e-01 5.590695e-01 1.699252e+02 4 LD 181 -5.642778e+02 -5.643866e+02 1.087675e-01 5.989198e-01 3.022107e+02 5 LD 300 -5.644524e+02 -5.644760e+02 2.366787e-02 7.348128e-01 4.082672e+02 6 LD 532 -5.644832e+02 -5.644878e+02 4.641332e-03 8.295724e-01 6.412943e+02 8 LD 736 -5.644847e+02 -5.644866e+02 1.852271e-03 9.245318e-01 7.960787e+02 8 LD 889 -5.644848e+02 -5.644857e+02 8.669282e-04 1.012478e+00 8.780441e+02 9 P 1000 -5.644848e+02 -5.644857e+02 8.669282e-04 1.079141e+00 9.266629e+02 10 LD 1027 -5.644848e+02 -5.644852e+02 3.279552e-04 1.166347e+00 8.805273e+02 10 LD 1172 -5.644848e+02 -5.644849e+02 9.216719e-05 1.252961e+00 9.353840e+02 11 LD 1325 -5.644848e+02 -5.644849e+02 2.409095e-05 1.338715e+00 9.897552e+02 11 LD 1498 -5.644848e+02 -5.644848e+02 5.840785e-06 1.433239e+00 1.045185e+03 11 LD 1695 -5.644848e+02 -5.644848e+02 1.357853e-06 1.554333e+00 1.090500e+03 11 P 2000 -5.644848e+02 -5.644848e+02 1.357853e-06 1.878897e+00 1.064454e+03 11 P 3000 -5.644848e+02 -5.644848e+02 1.357853e-06 2.550447e+00 1.176265e+03 11 P 4000 -5.644848e+02 -5.644848e+02 1.357853e-06 3.054202e+00 1.309671e+03 11 P 5000 -5.644848e+02 -5.644848e+02 1.357853e-06 3.553427e+00 1.407092e+03 11 P 6000 -5.644848e+02 -5.644848e+02 1.357853e-06 4.076470e+00 1.471862e+03 11 P 7000 -5.644848e+02 -5.644848e+02 1.357853e-06 4.532262e+00 1.544483e+03 11 P 8000 -5.644848e+02 -5.644848e+02 1.357853e-06 4.998026e+00 1.600632e+03 11 P 9000 -5.644848e+02 -5.644848e+02 1.357853e-06 5.464995e+00 1.646845e+03 11 P 10000 -5.644848e+02 -5.644848e+02 1.357853e-06 5.920434e+00 1.689065e+03 11 Last 10001 -5.644848e+02 -5.644848e+02 9.026341e-07 5.925164e+00 1.687886e+03 11 ---------------------------------------------------------------------------------------------------------------- PP 10001 -5.644848e+02 -5.644848e+02 9.026341e-07 5.928516e+00 1.686931e+03 11 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -564.4848396727434 Dual Bound: -571.5419021154167 Dual Gap (relative): 0.01250177497550619 Search Statistics. Total number of nodes processed: 595 Total number of lmo calls: 8167 Total time (s): 507.701 LMO calls / sec: 16.086239735592404 Nodes / sec: 1.171949631771456 LMO calls / node: 13.726050420168066 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 -5.098254e+02 -5.060034e+02 3.821906e+00 7.553122e-03 2.064700e+01 1.452996e-01 5644 49 8 6 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 -2.695856e+02 -2.702560e+02 6.704553e-01 0.000000e+00 Inf 1 LD 2 -5.060034e+02 -5.060034e+02 0.000000e+00 1.845147e-01 1.083925e+01 1 Last 2 -5.060034e+02 -5.060034e+02 0.000000e+00 3.832054e-01 5.219134e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -5.060034e+02 -5.060034e+02 0.000000e+00 3.883315e-01 5.150238e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -506.0034493829611 Dual Bound: -509.8253553789699 Dual Gap (relative): 0.007553122415804437 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 22.902 LMO calls / sec: 0.5676360143218933 Nodes / sec: 0.13099292638197538 LMO calls / node: 4.333333333333333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Test Suite: Error During Test at /home/pkgeval/.julia/packages/Boscia/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:306 [3] macro expansion @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/qQ4D3/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:306 [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:287 [10] _start() @ Base ./client.jl:554 in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/poisson.jl:192 Test Summary: | Pass Error Total Time Boscia Test Suite | 127 2 129 27m41.5s Norm hyperbox | 4 4 59.3s Norm hyperbox - strong branching | 2 2 51.5s Normbox - Shadow set activation | 4 4 23.2s Normbox - strong convexity and sharpness | 4 1 5 22.5s Strong convexity | 2 2 19.0s Sharpness | 1 1 3.5s Strong convexity and sharpness | 2 2 0.0s Start with Active Set | 2 2 19.1s Interface - sparse poisson regression | 4 4 25.4s Different FW variants | 10 10 1m05.7s Different line search types | 8 8 2m28.8s Lazification | 5 5 16.9s DICG - Lazification | 10 10 1m51.1s DICG - warm_start | 5 5 40.3s User stop | 2 2 16.4s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 27.6s BLMO - Strong Branching | 4 4 24.1s Probability Simplex LMO | 4 4 53.2s Unit Simplex LMO | 4 4 1m10.2s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 27.5s Hyperplane Aware Rounding - Unit Simplex | 2 2 29.9s Following Gradient Heuristic - Unit Simplex | 6 6 38.4s Rounding Heuristic - Unit Simplex | 3 3 36.3s Probability Rounding - Unit Cube | 2 2 23.6s Probability rounding - Probability Simplex | 3 3 23.3s Sparse Regression | 2 2 32.1s Sparse Regression Group | 7 7 1m36.0s Poisson sparse regression | 2 2 8m30.6s Hybrid branching poisson sparse regression | 3 3 26.5s RNG of the outermost testset: Xoshiro(0x541c20d1407c2af2, 0x28f9466bc74b0438, 0xbc8fc071b2c93a13, 0xc81a4c5c8634ef09, 0xf68eccd4bfbde338) ERROR: LoadError: Some tests did not pass: 127 passed, 0 failed, 2 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/qQ4D3/test/runtests.jl:15 Testing failed after 1690.9s ERROR: LoadError: Package Boscia errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.12/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.12/Pkg/src/Operations.jl:2458 [3] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2313 [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.12/Pkg/src/API.jl:511 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.12/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:305 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:321 [12] _start() @ Base ./client.jl:554 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1868.76s: package tests unexpectedly errored