Package evaluation to test Boscia on Julia 1.14.0-DEV.2082 (4fdd12e277*) started at 2026-04-26T19:04:44.281 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.23s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.10 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.8.0 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.10 [d360d2e6] + ChainRulesCore v1.26.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.4 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.3 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.5.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.50.1 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.7.1 [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.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.2 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.4.0+0 [4536629a] + OpenBLAS_jll v0.3.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 6.13s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:448 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 2.1 s ? GenericLinearAlgebra 1.7 s ✓ Bonobo ERROR: LoadError: UndefVarError: `get_liblemoncxxwrap_path` not defined in `LEMON_jll` Suggestion: check for spelling errors or missing imports. Stacktrace:  [1] getproperty(x::Module, f::Symbol)  @ Base ./Base_compiler.jl:51  [2] top-level scope  @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:9  [3] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [4] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3271  [5] top-level scope  @ stdin:5  [6] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [7] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [8] materialize(bc::Base.Broadcast.Broadcasted{Base.Broadcast.DefaultArrayStyle{1}, Nothing, Type{Symbol}, Tuple{Vector{SubString{String}}}})  @ Base.Broadcast ./loading.jl:3123 [inlined]  [9] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:350  [10] _start()  @ Base ./client.jl:593 in expression starting at /home/pkgeval/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:1 in expression starting at stdin:5 ✗ LEMONGraphs ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14197337-ba66-59df-a3e3-ca00e7dcff7a"), "GenericLinearAlgebra") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] String(s::Symbol)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base ./module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [13] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3271  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [17] materialize(bc::Base.Broadcast.Broadcasted{Base.Broadcast.DefaultArrayStyle{1}, Nothing, Type{Symbol}, Tuple{Vector{SubString{String}}}})  @ Base.Broadcast ./loading.jl:3123 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:350  [19] _start()  @ Base ./client.jl:593 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 13.7 s ✓ MathOptSetDistances 33.3 s ✓ FrankWolfe ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14b1564f-c77f-4800-9e89-efd961faef7c"), "LEMONGraphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] String(s::Symbol)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] _eval_import(imported::Bool, to::Module, from::Nothing, paths::Expr)  @ Base ./module.jl:111  [10] top-level scope  @ ~/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:10  [11] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [12] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3271  [13] top-level scope  @ stdin:5  [14] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [15] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [16] materialize(bc::Base.Broadcast.Broadcasted{Base.Broadcast.DefaultArrayStyle{1}, Nothing, Type{Symbol}, Tuple{Vector{SubString{String}}}})  @ Base.Broadcast ./loading.jl:3123 [inlined]  [17] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:350  [18] _start()  @ Base ./client.jl:593 in expression starting at /home/pkgeval/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:1 in expression starting at stdin:5 ✗ GraphsMatching 17.0 s ✓ Boscia 15.5 s ✓ Boscia → BosciaHiGHSExt 21.8 s ✓ Boscia → BosciaSCIPExt ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("c3af3a8c-b79e-4b01-bf44-c718d7e0e0d6"), "GraphsMatching") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] String(s::Symbol)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base ./module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/CombinatorialLinearOracles/tVMpY/src/CombinatorialLinearOracles.jl:6  [12] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [13] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3271  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [17] materialize(bc::Base.Broadcast.Broadcasted{Base.Broadcast.DefaultArrayStyle{1}, Nothing, Type{Symbol}, Tuple{Vector{SubString{String}}}})  @ Base.Broadcast ./loading.jl:3123 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:350  [19] _start()  @ Base ./client.jl:593 in expression starting at /home/pkgeval/.julia/packages/CombinatorialLinearOracles/tVMpY/src/CombinatorialLinearOracles.jl:1 in expression starting at stdin:5 ✗ CombinatorialLinearOracles 6 dependencies successfully precompiled in 153 seconds. 169 already precompiled. 1 dependency failed but may be precompilable after restarting julia 1 dependency had output during precompilation: ┌ GenericLinearAlgebra │ WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:448 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ Precompilation completed after 185.09s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_BMcDI7/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.10 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.125 [497a8b3b] DoubleFloats v1.7.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.50.1 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_BMcDI7/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.8.0 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.10 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.4 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.125 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.7.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.3 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.4.0 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.23.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.5.0 [4076af6c] JuMP v1.30.0 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.50.1 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.7.1 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.3 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.3 [be4d8f0f] Quadmath v1.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.2 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.8.0 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.3 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.14.0+0 [e33a78d0] Hwloc_jll v2.13.0+1 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.9+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [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.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [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.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.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.4.0+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.19.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.3.19 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.6+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0xd52f2273b0a4b2a9 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##14", var"#grad!#grad!##6", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##32", var"#grad!#grad!##12", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = OPT_TREE_EMPTY Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = OPT_TREE_EMPTY Callback Tests seed = 0xbc6ccc10fdfbc289 LMO Tests seed = 0x58f2742ed6f254a4 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##38", var"#grad!#grad!##16", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##44", var"#grad!#grad!##18", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.CubeLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##50", var"#grad!#grad!##20", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##53", var"#grad!#grad!##21", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.ReverseKnapsackLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 Indicator Tests Heuristics Tests seed = 0xf178d663673cdaa4 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##59", var"#grad!#grad!##23", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##62", var"#grad!#grad!##24", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(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##65", var"#grad!#grad!##25", Boscia.TimeTrackingLMO{Boscia.ManagedLMO{Boscia.UnitSimplexLMO}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: Polish solution Sparse Regression Tests seed = 0xa7ce34a91666b051 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.849445e+00 2.940000e+00 9.055469e-02 3.177976e-02 2.197200e+01 1.365374e-01 9101 40 14 14 7 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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##74", var"#grad!#grad!##28", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 9 4 2.921926e+00 2.940000e+00 1.807432e-02 6.185757e-03 2.592500e+01 5.014465e-01 20 13 54 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.774614e+00 -1.589743e-01 8.933588e+00 0.000000e+00 Inf 1 LD 2 2.940000e+00 2.940000e+00 0.000000e+00 2.243629e+00 8.914129e-01 1 Last 2 2.940000e+00 2.940000e+00 0.000000e+00 2.393645e+00 8.355458e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.940000e+00 2.940000e+00 0.000000e+00 2.396747e+00 8.344642e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.93999989023425 Dual Bound: 2.921925569657092 Dual Gap (relative): 0.006185756668428492 Search Statistics. Total number of nodes processed: 13 Total number of lmo calls: 59 Total time (s): 30.865 LMO calls / sec: 1.911550299692208 Nodes / sec: 0.4211890490847238 LMO calls / node: 4.538461538461538 Total number of global tightenings: 43 Global tightenings / node: 4.78 Total number of local tightenings: 48 Local tightenings / node: 5.33 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 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.207869e+00 1.691693e+00 4.838248e-01 4.005608e-01 1.697000e+01 1.767826e-01 8366 125 34 63 22 1 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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##75", var"#grad!#grad!##29", Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 100 35 1.538750e+00 1.691693e+00 1.529436e-01 9.939472e-02 2.215000e+01 6.094808e+00 15 10 957 15 9 0 200 35 1.608680e+00 1.691693e+00 8.301314e-02 5.160325e-02 2.387800e+01 9.841695e+00 16 10 1403 19 13 3 300 33 1.642818e+00 1.691693e+00 4.887525e-02 2.975086e-02 2.541900e+01 1.310044e+01 22 14 1827 22 12 1 397 32 1.675697e+00 1.691693e+00 1.599648e-02 9.546166e-03 2.697500e+01 1.590361e+01 5 3 2251 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.496400e+00 -1.003006e+00 6.499407e+00 0.000000e+00 Inf 1 LD 2 1.691693e+00 1.691693e+00 0.000000e+00 1.213625e-01 1.647955e+01 1 Last 2 1.691693e+00 1.691693e+00 0.000000e+00 2.441681e-01 8.191077e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.691693e+00 1.691693e+00 0.000000e+00 2.465771e-01 8.111053e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.6916934810320283 Dual Bound: 1.6756969996227336 Dual Gap (relative): 0.009546165812134424 Search Statistics. Total number of nodes processed: 429 Total number of lmo calls: 2256 Total time (s): 29.311 LMO calls / sec: 76.96769131042953 Nodes / sec: 14.636143427382212 LMO calls / node: 5.258741258741258 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: 25th entry: 0.17212765554453024 45th entry: 0.17212765554453024 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.270299e+00 1.691693e+00 4.213947e-01 3.317288e-01 1.650000e-01 1.818182e+01 161 122 34 63 22 1 100 15 1.610757e+00 1.691693e+00 8.093683e-02 5.024771e-02 4.345000e+00 2.646720e+01 17 12 1031 13 12 3 185 14 1.675086e+00 1.691693e+00 1.660775e-02 9.914565e-03 6.569000e+00 3.029380e+01 25 16 1604 22 11 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.496400e+00 -1.003006e+00 6.499407e+00 0.000000e+00 Inf 1 LD 2 1.691693e+00 1.691693e+00 0.000000e+00 9.740510e-04 2.053281e+03 1 Last 2 1.691693e+00 1.691693e+00 0.000000e+00 7.819759e-03 2.557624e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.691693e+00 1.691693e+00 0.000000e+00 1.104513e-02 1.810753e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.6916934810320283 Dual Bound: 1.6750857352295887 Dual Gap (relative): 0.009914564641769425 Search Statistics. Total number of nodes processed: 199 Total number of lmo calls: 1609 Total time (s): 6.598 LMO calls / sec: 243.86177629584722 Nodes / sec: 30.160654743861777 LMO calls / node: 8.085427135678392 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Poisson Tests seed = 0x1e02ca9f7e8d552a Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.653771e+02 -1.452542e+02 2.012286e+01 1.385355e-01 1.825500e+01 1.643385e-01 8978 88 38 529 24 1 * 2 3 -1.653771e+02 -1.479039e+02 1.747312e+01 1.181383e-01 1.915100e+01 2.610830e-01 891 86 71 510 26 5 * 4 5 -1.653765e+02 -1.495737e+02 1.580278e+01 1.056521e-01 2.088700e+01 4.308900e-01 931 85 138 571 31 11 * 12 13 -1.653650e+02 -1.497894e+02 1.557567e+01 1.039838e-01 3.876200e+01 6.449616e-01 6139 89 427 4486 40 19 * 24 25 -1.652215e+02 -1.515339e+02 1.368757e+01 9.032678e-02 6.332300e+01 7.738105e-01 1547 84 864 1033 32 14 46 47 -1.649303e+02 -1.515339e+02 1.339635e+01 8.840498e-02 1.200050e+02 7.749677e-01 2635 73 1662 1869 34 12 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.544677e+02 -3.804217e+02 7.348894e+02 0.000000e+00 Inf 1 LD 2 -1.573271e+02 -1.789714e+02 2.164436e+01 1.904322e-01 1.050243e+01 2 LD 24 -1.597062e+02 -1.691430e+02 9.436850e+00 4.928276e-01 4.869857e+01 3 LD 89 -1.613529e+02 -1.656820e+02 4.329127e+00 5.852719e-01 1.520661e+02 4 LD 107 -1.617407e+02 -1.638253e+02 2.084687e+00 6.971449e-01 1.534832e+02 5 LD 149 -1.618038e+02 -1.626423e+02 8.384379e-01 7.534779e-01 1.977497e+02 7 LD 222 -1.618203e+02 -1.621364e+02 3.161339e-01 8.368872e-01 2.652687e+02 9 LD 279 -1.618235e+02 -1.619603e+02 1.368376e-01 8.945197e-01 3.118992e+02 9 LD 325 -1.618239e+02 -1.618804e+02 5.648892e-02 9.558695e-01 3.400046e+02 10 LD 349 -1.618240e+02 -1.618395e+02 1.550178e-02 9.928798e-01 3.515028e+02 11 LD 454 -1.618241e+02 -1.618311e+02 7.082135e-03 1.121032e+00 4.049841e+02 11 LD 555 -1.618241e+02 -1.618268e+02 2.794815e-03 1.237761e+00 4.483903e+02 12 LD 605 -1.618241e+02 -1.618253e+02 1.227067e-03 1.300106e+00 4.653465e+02 13 LD 659 -1.618241e+02 -1.618245e+02 4.335626e-04 1.359270e+00 4.848192e+02 14 LD 720 -1.618241e+02 -1.618242e+02 1.647465e-04 1.419722e+00 5.071417e+02 14 LD 769 -1.618241e+02 -1.618241e+02 7.039148e-05 1.466499e+00 5.243783e+02 14 LD 820 -1.618241e+02 -1.618241e+02 2.722910e-05 1.515543e+00 5.410603e+02 14 LD 875 -1.618241e+02 -1.618241e+02 1.016308e-05 1.570497e+00 5.571486e+02 14 LD 942 -1.618241e+02 -1.618241e+02 3.196159e-06 1.705606e+00 5.522965e+02 15 P 1000 -1.618241e+02 -1.618241e+02 3.196159e-06 1.750320e+00 5.713241e+02 15 P 2000 -1.618241e+02 -1.618241e+02 3.196159e-06 2.704518e+00 7.395032e+02 15 P 3000 -1.618241e+02 -1.618241e+02 3.196159e-06 3.531340e+00 8.495358e+02 15 P 4000 -1.618241e+02 -1.618241e+02 3.196159e-06 4.302165e+00 9.297644e+02 15 P 5000 -1.618241e+02 -1.618241e+02 3.196159e-06 5.088025e+00 9.826996e+02 15 P 6000 -1.618241e+02 -1.618241e+02 3.196159e-06 5.877412e+00 1.020857e+03 15 P 7000 -1.618241e+02 -1.618241e+02 3.196159e-06 6.647921e+00 1.052961e+03 15 P 8000 -1.618241e+02 -1.618241e+02 3.196159e-06 7.422309e+00 1.077832e+03 15 P 9000 -1.618241e+02 -1.618241e+02 3.196159e-06 8.169973e+00 1.101595e+03 15 P 10000 -1.618241e+02 -1.618241e+02 3.196159e-06 8.939582e+00 1.118621e+03 15 Last 10001 -1.618241e+02 -1.618241e+02 3.196159e-06 8.944146e+00 1.118162e+03 15 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.618241e+02 -1.618241e+02 5.351256e-06 8.947115e+00 1.117790e+03 15 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -161.8240523808857 Dual Bound: -164.93028128011198 Dual Gap (relative): 0.019195100193852246 Search Statistics. Total number of nodes processed: 93 Total number of lmo calls: 1698 Total time (s): 131.785 LMO calls / sec: 12.884622680881739 Nodes / sec: 0.7056948818150776 LMO calls / node: 18.258064516129032 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.621076e+02 -1.560562e+02 6.051368e+00 3.877685e-02 2.629000e+01 1.141118e-01 10624 173 35 173 20 1 * 6 7 -1.621037e+02 -1.568926e+02 5.211090e+00 3.321438e-02 3.263000e+01 3.984064e-01 403 131 151 174 22 6 * 15 16 -1.606653e+02 -1.575320e+02 3.133354e+00 1.989027e-02 4.276300e+01 7.249258e-01 197 72 347 90 15 2 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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##79"{Float64}, var"#grad!#grad!##31"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 89 88 -1.590966e+02 -1.575320e+02 1.564583e+00 9.931843e-03 1.113350e+02 1.589797e+00 220 87 1773 84 13 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -9.150119e+01 -1.858138e+02 9.431258e+01 0.000000e+00 Inf 1 LD 2 -1.575320e+02 -1.575320e+02 0.000000e+00 1.707949e-01 1.170995e+01 1 Last 2 -1.575320e+02 -1.575320e+02 0.000000e+00 3.373732e-01 5.928154e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.575320e+02 -1.575320e+02 0.000000e+00 3.416047e-01 5.854720e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -157.5319689846215 Dual Bound: -159.0965518114458 Dual Gap (relative): 0.00993184327542458 Search Statistics. Total number of nodes processed: 177 Total number of lmo calls: 1778 Total time (s): 114.475 LMO calls / sec: 15.53177549683337 Nodes / sec: 1.5461891242629395 LMO calls / node: 10.045197740112995 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: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.826530e+02 4.434873e+02 2.608343e+02 1.428031e+00 2.071700e+01 1.448086e-01 10049 128 25 59 13 0 * 2 3 1.826530e+02 3.441544e+02 1.615014e+02 8.841976e-01 2.096500e+01 2.384927e-01 243 110 47 72 13 0 * 3 4 2.027536e+02 3.364967e+02 1.337432e+02 6.596341e-01 2.129300e+01 3.287465e-01 321 97 67 78 12 3 * 4 5 2.027536e+02 3.347700e+02 1.320164e+02 6.511175e-01 2.148200e+01 4.189554e-01 182 86 87 59 11 2 * 27 28 2.492840e+02 3.337872e+02 8.450324e+01 3.389838e-01 2.498700e+01 2.201145e+00 118 46 480 67 7 2 100 75 2.930566e+02 3.337872e+02 4.073069e+01 1.389858e-01 3.221900e+01 5.431578e+00 75 38 1414 21 4 1 200 43 3.226923e+02 3.337872e+02 1.109497e+01 3.438250e-02 3.707700e+01 6.553928e+00 11 6 2035 2 0 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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##82"{Float64}, var"#grad!#grad!##32"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 243 14 3.307944e+02 3.337872e+02 2.992835e+00 9.047418e-03 3.801500e+01 6.760489e+00 18 10 2177 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.337872e+02 3.337872e+02 0.000000e+00 1.017648e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.337872e+02 3.337872e+02 0.000000e+00 1.725064e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 333.78724219919195 Dual Bound: 330.7944068011294 Dual Gap (relative): 0.009047418385951744 Search Statistics. Total number of nodes processed: 257 Total number of lmo calls: 2181 Total time (s): 41.043 LMO calls / sec: 53.13939039543893 Nodes / sec: 6.261725507394684 LMO calls / node: 8.486381322957198 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.826530e+02 4.434873e+02 2.608343e+02 1.428031e+00 2.390300e+01 1.255073e-01 9611 123 25 59 13 0 * 2 3 1.826530e+02 3.380889e+02 1.554359e+02 8.509901e-01 2.527100e+01 1.978552e-01 300 122 50 109 11 3 * 3 4 1.934502e+02 3.378848e+02 1.444345e+02 7.466238e-01 2.640900e+01 2.650612e-01 203 102 70 58 11 3 * 4 5 1.934502e+02 3.364967e+02 1.430465e+02 7.394487e-01 2.740900e+01 3.283593e-01 175 90 89 51 9 3 * 6 7 2.074076e+02 3.347568e+02 1.273492e+02 6.140045e-01 2.946200e+01 4.412464e-01 214 85 123 71 8 2 * 7 8 2.115387e+02 3.337872e+02 1.222486e+02 5.779016e-01 3.047600e+01 4.921906e-01 186 94 144 55 10 3 100 59 2.931846e+02 3.337872e+02 4.060265e+01 1.384883e-01 8.251200e+01 1.926992e+00 31 16 1204 9 0 0 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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##85"{Float64}, var"#grad!#grad!##33"{Float64}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 200 37 3.224520e+02 3.337872e+02 1.133523e+01 3.515323e-02 1.019200e+02 2.325353e+00 6 3 1694 0 0 0 239 6 3.321032e+02 3.337872e+02 1.684009e+00 5.070739e-03 1.044620e+02 2.345350e+00 5 3 1844 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.337872e+02 3.337872e+02 0.000000e+00 9.842030e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.337872e+02 3.337872e+02 0.000000e+00 1.720523e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 333.78724219919195 Dual Bound: 332.10323329764896 Dual Gap (relative): 0.005070739254241753 Search Statistics. Total number of nodes processed: 245 Total number of lmo calls: 1848 Total time (s): 107.388 LMO calls / sec: 17.20862666219689 Nodes / sec: 2.2814467165791337 LMO calls / node: 7.542857142857143 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 Mean Risk Test seed = 0xfe9d4da7ebc860d1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.002745e+02 -8.807380e+01 1.220066e+01 1.385277e-01 2.421000e+01 1.239157e-01 12227 888 38 10001 21 7 * 2 3 -1.002745e+02 -8.822388e+01 1.205058e+01 1.365909e-01 2.488700e+01 2.009081e-01 673 275 47 10001 20 6 * 3 4 -1.002745e+02 -9.254862e+01 7.725843e+00 8.347875e-02 2.601300e+01 2.690962e-01 1092 662 88 10001 19 12 * 4 5 -1.002745e+02 -9.491533e+01 5.359128e+00 5.646219e-02 2.789500e+01 3.226385e-01 1877 1489 114 10001 19 22 * 25 26 -9.898810e+01 -9.567486e+01 3.313235e+00 3.463015e-02 6.010800e+01 8.484727e-01 756 470 866 7461 15 13 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -95.67486499435492 Dual Bound: -98.98809969263127 Dual Gap (relative): 0.034630147619981864 Search Statistics. Total number of nodes processed: 51 Total number of lmo calls: 866 Total time (s): 61.274 LMO calls / sec: 14.133237588536737 Nodes / sec: 0.8323269249600157 LMO calls / node: 16.980392156862745 Total number of global tightenings: 9 Global tightenings / node: 0.36 Total number of local tightenings: 129 Local tightenings / node: 5.16 Total number of potential local tightenings: 228 Time Limit Test seed = 0xebf11700a9b8caa9 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.067887e+00 -4.578476e+00 4.894110e-01 1.068939e-01 2.203900e+01 1.361223e-01 11097 220 21 353 8 5 * 2 3 -5.067887e+00 -4.787545e+00 2.803423e-01 5.855659e-02 2.227300e+01 2.244870e-01 231 183 41 1892 8 12 11 8 -4.831109e+00 -4.787545e+00 4.356448e-02 9.099546e-03 2.330700e+01 8.152057e-01 16 12 185 35 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -4.787544952805582 Dual Bound: -4.831109437222741 Dual Gap (relative): 0.009099545768573962 Search Statistics. Total number of nodes processed: 19 Total number of lmo calls: 185 Total time (s): 24.568 LMO calls / sec: 7.53012048192771 Nodes / sec: 0.7733637251709541 LMO calls / node: 9.736842105263158 Total number of global tightenings: 7 Global tightenings / node: 0.64 Total number of local tightenings: 31 Local tightenings / node: 2.82 Total number of potential local tightenings: 32 Strong Convexity and Sharpness Tests seed = 0xc44e185b9f190c17 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.035852e+02 2.039000e+02 3.148208e-01 1.546384e-03 2.084900e+01 1.438918e-01 9658 0 13 14 3 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 203.90000625983734 Dual Bound: 203.585185468505 Dual Gap (relative): 0.0015463835966642824 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 13 Total time (s): 22.086 LMO calls / sec: 0.5886081680702708 Nodes / sec: 0.1358326541700625 LMO calls / node: 4.333333333333333 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 17 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.045682e+02 2.049952e+02 4.269552e-01 2.087104e-03 1.997300e+01 1.502028e-01 9596 0 14 20 5 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 204.99516248294978 Dual Bound: 204.56820733221414 Dual Gap (relative): 0.002087104131690763 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 14 Total time (s): 21.107 LMO calls / sec: 0.6632870611645426 Nodes / sec: 0.14213294167811627 LMO calls / node: 4.666666666666667 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 15 Branching Strategy Tests seed = 0xee4032b12bcb2bfe Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 2.015000e+01 1.488834e-01 10065 45 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.144400e+01 3.031151e+00 9 6 953 27 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321771298479149 Dual Gap (relative): 0.008253858173238702 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 953 Total time (s): 22.704 LMO calls / sec: 41.97498238195912 Nodes / sec: 2.8629316420014095 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.610000e-01 8.310249e+00 225 40 48 3749 24 11 ┌ Warning: `peek(q::PriorityQueue)` is deprecated, use `first(q)` instead. │ caller = (::Boscia.var"#callback#build_bnb_callback##0"{Boscia.var"#callback#41#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}}})(tree::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#build_examples##0"{Vector{Float64}}, var"#grad!#build_examples##1"{Vector{Float64}}, Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime}, 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}}; worse_than_incumbent::Bool, node_infeasible::Bool, lb_update::Bool) at callbacks.jl:252 └ @ Boscia ~/.julia/packages/Boscia/F2hrt/src/callbacks.jl:252 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.767000e+00 4.923599e+01 4 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.382204160353686 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.768 LMO calls / sec: 574.0950226244344 Nodes / sec: 49.20814479638009 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.540000e-01 8.474576e+00 221 38 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.501000e+00 3.930713e+01 3 2 859 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.338246272538823 Dual Gap (relative): 0.005990244287570652 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 859 Total time (s): 1.502 LMO calls / sec: 571.9041278295606 Nodes / sec: 39.280958721704394 LMO calls / node: 14.559322033898304 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 1.35 Total number of potential local tightenings: 167 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Uniform Random Choice FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.830000e-01 7.832898e+00 226 39 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.739000e+00 4.312823e+01 10 7 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.741 LMO calls / sec: 518.0930499712808 Nodes / sec: 43.0786904078116 LMO calls / node: 12.026666666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 54 Local tightenings / node: 0.74 Total number of potential local tightenings: 118 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Index FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.320000e-01 9.036145e+00 218 37 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.951000e+00 4.971809e+01 3 2 1174 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 1.952 LMO calls / sec: 601.4344262295082 Nodes / sec: 49.692622950819676 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 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 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.840000e-01 6.198347e+00 480 62 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.130000e-01 1.107011e+01 83 31 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.370000e-01 1.173959e+01 121 35 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.286000e+00 2.425778e+01 82 29 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.830000e+00 2.457531e+01 58 19 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.432700e+01 2.798911e+01 49 21 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.041700e+01 2.924034e+01 52 20 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.623800e+01 3.022334e+01 56 24 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.101900e+01 3.117444e+01 17 9 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.589500e+01 3.173144e+01 70 27 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.991900e+01 3.188958e+01 13 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.297500e+01 3.185573e+01 6 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.543200e+01 3.136556e+01 6 3 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.736400e+01 3.105734e+01 29 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.920500e+01 3.038309e+01 9 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.060200e+01 2.986048e+01 12 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.189100e+01 2.923436e+01 13 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.292800e+01 2.877494e+01 10 5 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.345100e+01 2.849339e+01 6 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 53.452 LMO calls / sec: 514.9479907206465 Nodes / sec: 28.49285340118237 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 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 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.032000e+00 1.476378e+00 465 61 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.324000e+00 3.872633e+00 87 33 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.453000e+00 4.484305e+00 126 39 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.010300e+01 1.989508e+01 82 30 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.068000e+01 2.031835e+01 60 20 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.665600e+01 2.383525e+01 95 31 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.126600e+01 2.638014e+01 39 16 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.551300e+01 2.794654e+01 22 12 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 2.902800e+01 2.924762e+01 47 17 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.244400e+01 3.042165e+01 19 10 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.543400e+01 3.118474e+01 8 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 3.835600e+01 3.183335e+01 7 4 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.084900e+01 3.219173e+01 7 4 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.282800e+01 3.275894e+01 11 7 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.492100e+01 3.252376e+01 10 6 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.684600e+01 3.242539e+01 9 6 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 4.811400e+01 3.277632e+01 9 5 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 4.940900e+01 3.280779e+01 11 6 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.063200e+01 3.276584e+01 12 7 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.171300e+01 3.246766e+01 6 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.183800e+01 3.238937e+01 12 7 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 51.839 LMO calls / sec: 515.827851617508 Nodes / sec: 32.3887420667837 LMO calls / node: 15.926146515783204 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2233 Local tightenings / node: 1.38 Total number of potential local tightenings: 5463 Number of alternative decisions: 438 Number of stable decisions: 401 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 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 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.230000e-01 5.736138e+00 453 55 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.241000e+00 1.047542e+01 96 31 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 5.961000e+00 2.164066e+01 57 21 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 8.541000e+00 2.353354e+01 68 25 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.439600e+01 2.785496e+01 69 26 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.001600e+01 2.972622e+01 50 25 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.497500e+01 3.063063e+01 16 10 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 2.982800e+01 3.121228e+01 65 28 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.420300e+01 3.160541e+01 54 20 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.912600e+01 3.090017e+01 48 21 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.308000e+01 3.098886e+01 7 4 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.608000e+01 3.135851e+01 48 21 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.909600e+01 3.134675e+01 36 18 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.174400e+01 3.144326e+01 6 4 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.386400e+01 3.131962e+01 11 7 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.591000e+01 3.131819e+01 34 15 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.777200e+01 3.107041e+01 9 5 27751 16 0 0 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.934700e+01 3.081874e+01 7 5 28707 8 0 0 1546 295 2.684204e+01 2.836265e+01 1.520609e+00 5.665029e-02 6.000100e+01 3.068282e+01 6 3 29118 9 10 8 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.842035852142264 Dual Gap (relative): 0.05665029216259515 Search Statistics. Total number of nodes processed: 1841 Total number of lmo calls: 29118 Total time (s): 60.002 LMO calls / sec: 485.28382387253754 Nodes / sec: 30.68231058964701 LMO calls / node: 15.8164041281912 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2536 Local tightenings / node: 1.64 Total number of potential local tightenings: 6005 Number of alternative decisions: 543 Number of stable decisions: 377 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 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 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.290000e-01 5.671078e+00 467 67 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.352000e+00 1.743197e+01 82 31 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.010000e+00 2.093023e+01 59 26 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.451000e+00 2.697624e+01 14 7 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.209000e+01 3.167907e+01 32 15 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.639900e+01 3.457528e+01 21 12 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.036400e+01 3.609311e+01 25 11 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.483200e+01 3.676707e+01 40 18 11880 193 16 11 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.873400e+01 3.727292e+01 30 15 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.261300e+01 3.750038e+01 21 12 15981 55 10 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.561100e+01 3.799388e+01 38 19 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.896300e+01 3.780510e+01 15 8 19510 37 0 0 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.215500e+01 3.788400e+01 66 26 21254 396 22 10 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.487500e+01 3.777159e+01 11 6 22747 24 0 0 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.693600e+01 3.768962e+01 5 3 24101 6 0 0 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 4.899600e+01 3.732958e+01 15 9 25317 23 0 0 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.064600e+01 3.682423e+01 6 4 26374 10 0 0 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.216900e+01 3.628592e+01 11 7 27346 16 0 0 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.345100e+01 3.567754e+01 18 9 28188 61 8 5 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.469700e+01 3.512076e+01 5 3 29039 10 0 0 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.575500e+01 3.459779e+01 6 4 29805 14 0 0 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.641500e+01 3.422849e+01 5 3 30260 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.106101931570876 Dual Gap (relative): 0.009127665389483692 Search Statistics. Total number of nodes processed: 1931 Total number of lmo calls: 30260 Total time (s): 56.416 LMO calls / sec: 536.3726602382303 Nodes / sec: 34.227878615995465 LMO calls / node: 15.67063697566028 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1888 Local tightenings / node: 1.01 Total number of potential local tightenings: 4439 Number of alternative decisions: 331 Number of stable decisions: 634 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 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 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.920000e-01 6.097561e+00 488 64 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 6.840000e-01 1.315789e+01 54 21 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 7.770000e-01 1.415701e+01 91 29 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 6.252000e+00 3.214971e+01 54 21 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 6.725000e+00 3.226766e+01 61 22 3485 420 20 24 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 51 running 1 of 1 signal (10): User defined signal 1 malloc at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) ijl_gc_counted_malloc at /source/src/gc-stock.c:3812:18 __gmpq_init at /opt/julia/bin/../lib/julia/libgmp.so.10 (unknown line) _ZNSt6vectorIN5boost14multiprecision6numberINS1_8backends12gmp_rationalELNS1_26expression_template_optionE0EEESaIS6_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS6_S8_EEmRKS6_ at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex10VectorBaseIN5boost14multiprecision6numberINS2_8backends12gmp_rationalELNS2_26expression_template_optionE0EEEE5reDimEib.constprop.0 at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex17SLUFactorRational4initEv at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex17SLUFactorRationalC2Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex10SoPlexBaseIdEC1Ev at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpiCreate at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPlpCreate at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPtransformProb at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPpresolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21458:9 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16:1 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:427:31 _optimize_and_return at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:358:4 #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:43:82 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:24:4 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/time_tracking_lmo.jl:116:63 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/time_tracking_lmo.jl:108:4 [inlined] #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291:797 unknown function (ip: 0x7861600f6a35) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:177 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/frank_wolfe_variants.jl:207:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/frank_wolfe_variants.jl:187:105 unknown function (ip: 0x7861600e3477) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/node.jl:361:607 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/custom_bonobo.jl:36:25 optimize! at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/custom_bonobo.jl:29:28 unknown function (ip: 0x7861600bffaa) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 #solve#109 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/interface.jl:270:892 unknown function (ip: 0x7861600bd2c9) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 solve at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/interface.jl:28:17 #solve#146 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:834:13 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:832:17 unknown function (ip: 0x7861600b5b0c) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:145 _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 _include at ./loading.jl:3173:45 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:145 _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 _include at ./loading.jl:3173:45 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:693:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 exec_options at ./client.jl:318:410 _start at ./client.jl:593:36 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x7861d229c249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.319400e+01 3.039260e+01 49 22 6086 247 19 20 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457:34 wait at ./task.jl:1246:50 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.058600e+01 2.900029e+01 119 39 8821 325 14 10 ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x0000704e03898d30 Total snapshots: 386. Utilization: 0% ╎386 @Base/task.jl:1168 wait_forever() 385╎ 386 @Base/task.jl:1246 wait() [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457:34 wait at ./task.jl:1246:50 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) Allocations: 20701609 (Pool: 20700874; Big: 735); GC: 16 [51] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/F2hrt/test/branching_strategy_test.jl:133 getproperty at ./Base_compiler.jl:58:3 [inlined] ht_keyindex at ./dict.jl:242:19 getindex at ./dict.jl:478:4 [inlined] var at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/scip_data.jl:181:5 [inlined] var at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:128:9 [inlined] #sol_values##0 at ./none (unknown line) [inlined] iterate at ./generator.jl:48:23 [inlined] collect at ./array.jl:833:52 [inlined] sol_values at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/convenience.jl:25:8 [inlined] find_best_solution at /home/pkgeval/.julia/packages/Boscia/F2hrt/ext/BosciaSCIPExt.jl:28:32 unknown function (ip: 0x7860cfefdcf2) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 find_best_solution at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:591:3 unknown function (ip: 0x7860cfefcf7d) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:97:469 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:59:23 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/callbacks.jl:24:15 unknown function (ip: 0x7861600fa14e) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:356:909 unknown function (ip: 0x7861600f6a35) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:177 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/frank_wolfe_variants.jl:207:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/frank_wolfe_variants.jl:187:105 unknown function (ip: 0x7861600e3477) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/node.jl:361:607 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/custom_bonobo.jl:36:25 optimize! at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/custom_bonobo.jl:29:28 unknown function (ip: 0x7861600bffaa) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 #solve#109 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/interface.jl:270:892 unknown function (ip: 0x7861600bd2c9) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 solve at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/interface.jl:28:17 #solve#146 at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:834:13 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/F2hrt/src/MOI_bounded_oracle.jl:832:17 unknown function (ip: 0x7861600b5b0c) at (unknown file) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:145 _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 _include at ./loading.jl:3173:45 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:145 _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 _include at ./loading.jl:3173:45 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:693:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 exec_options at ./client.jl:318:410 _start at ./client.jl:593:36 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4113:23 [inlined] ijl_apply_generic at /source/src/gf.c:4339:12 jl_apply at /source/src/julia.h:2327:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x7861d229c249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) Allocations: 4985327268 (Pool: 4985323375; Big: 3893); GC: 2210 PkgEval terminated after 2724.65s: test duration exceeded the time limit