Package evaluation to test Boscia on Julia 1.14.0-DEV.2130 (8560e32f58*) started at 2026-05-07T20:39:12.235 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 12.76s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.11 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.11 [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.2 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.0 [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.4 [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.1 [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 [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.5.1+0 [4536629a] + OpenBLAS_jll v0.3.33+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 5.9s ################################################################################ # 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. 1.8 s ? GenericLinearAlgebra 1.9 s ✓ Bonobo 2.4 s ✓ LEMON_jll 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(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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] push!(a::Vector{SubString{String}}, item::String)  @ Base ./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 14.4 s ✓ MathOptSetDistances 17.0 s ✓ LEMONGraphs 16.5 s ✓ Boscia 30.1 s ✓ GraphsMatching 15.5 s ✓ Boscia → BosciaHiGHSExt 20.3 s ✓ Boscia → BosciaSCIPExt 28.1 s ✓ CombinatorialLinearOracles 9 dependencies successfully precompiled in 154 seconds. 167 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 181.72s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_zpzPcZ/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.11 [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.51.0 [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_zpzPcZ/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.11 [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.2 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.0 [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.4 [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.1 [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.4+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.33+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.19.0+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 [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.5.1+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.19.0+0 [e37daf67] LibGit2_jll v1.9.3+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.33+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 = 0x82c271e4837ce1ba WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/interface_test.jl:97 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution 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 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/interface_test.jl:986 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 = 0x87b560c090284f85 LMO Tests seed = 0x5638b2a7236b4cc8 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/LMO_test.jl:254 Indicator Tests seed = 0x611085f7c91388ea Heuristics Tests seed = 0x8a5f441ae94dfa20 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:124 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:193 [ Info: Polish solution Sparse Regression Tests seed = 0x9ae1a27e5a4fe3a6 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.710108e+00 2.825704e+00 1.155961e-01 4.265369e-02 2.339500e+01 1.282325e-01 9773 36 12 14 5 1 * 2 3 2.710108e+00 2.821751e+00 1.116433e-01 4.119516e-02 2.734900e+01 1.828220e-01 35 22 22 19 6 3 23 6 2.806165e+00 2.821751e+00 1.558606e-02 5.554220e-03 2.765300e+01 1.048711e+00 16 11 104 5 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 7.336761e+00 4.466463e-01 6.890115e+00 0.000000e+00 Inf 1 LD 2 2.821751e+00 2.821751e+00 0.000000e+00 2.226070e+00 8.984445e-01 1 Last 2 2.821751e+00 2.821751e+00 0.000000e+00 2.386036e+00 8.382104e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.821751e+00 2.821751e+00 0.000000e+00 2.388949e+00 8.371883e-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.8217508768420365 Dual Bound: 2.8061648211973225 Dual Gap (relative): 0.005554219597858067 Search Statistics. Total number of nodes processed: 29 Total number of lmo calls: 109 Total time (s): 32.821 LMO calls / sec: 3.3210444532463974 Nodes / sec: 0.8835806343499589 LMO calls / node: 3.7586206896551726 Total number of global tightenings: 42 Global tightenings / node: 1.83 Total number of local tightenings: 48 Local tightenings / node: 2.09 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.622880e+00 2.124752e+00 5.018727e-01 3.092482e-01 2.017800e+01 1.486768e-01 9287 145 35 73 23 1 100 27 2.035614e+00 2.124752e+00 8.913805e-02 4.378926e-02 2.478300e+01 5.124480e+00 22 14 925 14 12 0 191 24 2.105761e+00 2.124752e+00 1.899175e-02 9.018951e-03 2.648000e+01 8.119335e+00 6 4 1311 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 6.763189e+00 -3.963168e-01 7.159506e+00 0.000000e+00 Inf 1 LD 2 2.124752e+00 2.124752e+00 0.000000e+00 1.431698e-01 1.396943e+01 1 Last 2 2.124752e+00 2.124752e+00 0.000000e+00 2.872281e-01 6.963108e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.124752e+00 2.124752e+00 0.000000e+00 2.906797e-01 6.880426e+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: 2.1247524167058316 Dual Bound: 2.105760665304072 Dual Gap (relative): 0.009018950593332159 Search Statistics. Total number of nodes processed: 215 Total number of lmo calls: 1316 Total time (s): 29.305 LMO calls / sec: 44.907012455212424 Nodes / sec: 7.336631974065859 LMO calls / node: 6.120930232558139 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 Non zero entries: 10th entry: 0.171112499772152 33th entry: 0.171112499772152 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.724310e+00 2.124752e+00 4.004425e-01 2.322335e-01 1.990000e-01 1.507538e+01 193 144 35 73 23 1 74 8 2.105009e+00 2.124752e+00 1.974383e-02 9.379454e-03 4.315000e+00 1.900348e+01 17 11 826 17 11 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 6.763189e+00 -3.963168e-01 7.159506e+00 0.000000e+00 Inf 1 LD 2 2.124752e+00 2.124752e+00 0.000000e+00 1.007500e-03 1.985112e+03 1 Last 2 2.124752e+00 2.124752e+00 0.000000e+00 6.976994e-03 2.866564e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.124752e+00 2.124752e+00 0.000000e+00 1.032001e-02 1.937982e+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: 2.1247524167058316 Dual Bound: 2.105008585887825 Dual Gap (relative): 0.009379453818084615 Search Statistics. Total number of nodes processed: 82 Total number of lmo calls: 831 Total time (s): 4.338 LMO calls / sec: 191.56293222683263 Nodes / sec: 18.902720147533426 LMO calls / node: 10.134146341463415 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 = 0xc9d4ee6240bb1e28 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 -7.290176e+02 -7.063111e+02 2.270658e+01 3.214813e-02 2.404600e+01 1.247609e-01 12753 127 49 1540 27 8 * 8 9 -7.279074e+02 -7.140802e+02 1.382717e+01 1.936361e-02 4.189100e+01 4.058151e-01 3442 82 317 2066 29 17 38 39 -7.263326e+02 -7.140802e+02 1.225236e+01 1.715823e-02 1.200060e+02 6.416346e-01 2438 62 1344 1458 25 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 1.079137e+03 -1.105101e+03 2.184238e+03 0.000000e+00 Inf 1 LD 2 -7.005860e+02 -7.779706e+02 7.738458e+01 1.802279e-01 1.109706e+01 2 LD 14 -7.134133e+02 -7.469168e+02 3.350357e+01 5.579812e-01 2.509045e+01 3 LD 30 -7.153265e+02 -7.285916e+02 1.326515e+01 5.869535e-01 5.111138e+01 3 LD 40 -7.173154e+02 -7.210133e+02 3.697859e+00 6.090401e-01 6.567712e+01 4 LD 54 -7.174030e+02 -7.187742e+02 1.371200e+00 6.374246e-01 8.471590e+01 6 LD 77 -7.174403e+02 -7.179521e+02 5.117969e-01 6.722133e-01 1.145470e+02 7 LD 91 -7.174438e+02 -7.176206e+02 1.767997e-01 6.914029e-01 1.316165e+02 6 LD 116 -7.174441e+02 -7.175302e+02 8.606102e-02 7.205970e-01 1.609776e+02 6 LD 157 -7.174442e+02 -7.174579e+02 1.369770e-02 7.662976e-01 2.048812e+02 7 LD 216 -7.174442e+02 -7.174475e+02 3.284201e-03 8.304129e-01 2.601116e+02 7 LD 337 -7.174442e+02 -7.174457e+02 1.484548e-03 9.611125e-01 3.506353e+02 8 LD 368 -7.174442e+02 -7.174450e+02 7.078334e-04 9.906716e-01 3.714652e+02 8 LD 404 -7.174442e+02 -7.174446e+02 3.189879e-04 1.026370e+00 3.936204e+02 8 LD 478 -7.174442e+02 -7.174444e+02 1.566608e-04 1.100250e+00 4.344468e+02 8 LD 536 -7.174442e+02 -7.174443e+02 6.797570e-05 1.155745e+00 4.637700e+02 8 LD 607 -7.174442e+02 -7.174443e+02 3.268729e-05 1.225150e+00 4.954496e+02 8 LD 678 -7.174442e+02 -7.174443e+02 9.542679e-06 1.294122e+00 5.239074e+02 9 LD 724 -7.174442e+02 -7.174443e+02 3.387307e-06 1.339878e+00 5.403479e+02 9 P 1000 -7.174442e+02 -7.174443e+02 3.387307e-06 1.688687e+00 5.921761e+02 9 P 2000 -7.174442e+02 -7.174443e+02 3.387307e-06 2.677745e+00 7.468970e+02 9 P 3000 -7.174442e+02 -7.174443e+02 3.387307e-06 3.622801e+00 8.280885e+02 9 P 4000 -7.174442e+02 -7.174443e+02 3.387307e-06 4.503250e+00 8.882474e+02 9 P 5000 -7.174442e+02 -7.174443e+02 3.387307e-06 5.382917e+00 9.288645e+02 9 P 6000 -7.174442e+02 -7.174443e+02 3.387307e-06 6.260046e+00 9.584595e+02 9 P 7000 -7.174442e+02 -7.174443e+02 3.387307e-06 7.166451e+00 9.767736e+02 9 P 8000 -7.174442e+02 -7.174443e+02 3.387307e-06 8.086907e+00 9.892534e+02 9 P 9000 -7.174442e+02 -7.174443e+02 3.387307e-06 8.914394e+00 1.009603e+03 9 P 10000 -7.174442e+02 -7.174443e+02 3.387307e-06 9.756178e+00 1.024992e+03 9 Last 10001 -7.174442e+02 -7.174443e+02 3.387307e-06 9.763120e+00 1.024365e+03 9 ---------------------------------------------------------------------------------------------------------------- PP 10001 -7.174442e+02 -7.174443e+02 3.509446e-06 9.766795e+00 1.023980e+03 9 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -717.4442491452837 Dual Bound: -726.3325637529654 Dual Gap (relative): 0.012388857556905095 Search Statistics. Total number of nodes processed: 77 Total number of lmo calls: 1376 Total time (s): 132.573 LMO calls / sec: 10.379187315667593 Nodes / sec: 0.5808120808912826 LMO calls / node: 17.87012987012987 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 -6.184161e+02 -6.166902e+02 1.725896e+00 2.798643e-03 2.538500e+01 1.181800e-01 10156 81 17 46 7 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 -3.153288e+02 -6.472179e+02 3.318891e+02 0.000000e+00 Inf 1 LD 2 -6.166902e+02 -6.166902e+02 0.000000e+00 1.620520e-01 1.234171e+01 1 Last 2 -6.166902e+02 -6.166902e+02 0.000000e+00 3.231546e-01 6.188988e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -6.166902e+02 -6.166902e+02 0.000000e+00 3.274354e-01 6.108075e+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: -616.6901576972828 Dual Bound: -618.4160533135091 Dual Gap (relative): 0.002798643037649306 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 22 Total time (s): 28.484 LMO calls / sec: 0.7723634321022328 Nodes / sec: 0.10532228619575902 LMO calls / node: 7.333333333333333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia 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.733508e+02 3.391222e+02 1.657714e+02 9.562773e-01 2.123600e+01 1.412695e-01 10278 135 27 72 13 0 * 3 4 1.886371e+02 3.304948e+02 1.418578e+02 7.520143e-01 2.180100e+01 3.210862e-01 309 106 70 73 13 3 * 10 11 2.079229e+02 3.286256e+02 1.207027e+02 5.805165e-01 2.333500e+01 8.999357e-01 156 67 195 50 12 1 * 48 49 2.563905e+02 3.281867e+02 7.179618e+01 2.800267e-01 3.062800e+01 3.167037e+00 204 61 794 84 7 3 100 99 2.770064e+02 3.281867e+02 5.118028e+01 1.847621e-01 3.851800e+01 5.166416e+00 91 47 1509 25 6 1 200 153 2.987724e+02 3.281867e+02 2.941429e+01 9.845049e-02 5.401300e+01 6.535464e+00 67 28 2501 28 3 0 300 135 3.115659e+02 3.281867e+02 1.662077e+01 5.334591e-02 5.819200e+01 7.475254e+00 13 8 3054 3 0 0 400 87 3.202200e+02 3.281867e+02 7.966691e+00 2.487881e-02 6.102800e+01 7.979944e+00 23 11 3500 6 0 0 455 42 3.255673e+02 3.281867e+02 2.619362e+00 8.045532e-03 6.211300e+01 8.001546e+00 14 8 3693 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.281867e+02 3.281867e+02 0.000000e+00 9.227173e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.281867e+02 3.281867e+02 0.000000e+00 1.636977e-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: 328.18666781638194 Dual Bound: 325.5673057236006 Dual Gap (relative): 0.00804553174330444 Search Statistics. Total number of nodes processed: 497 Total number of lmo calls: 3697 Total time (s): 65.004 LMO calls / sec: 56.87342317395852 Nodes / sec: 7.645683342563534 LMO calls / node: 7.438631790744467 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.733508e+02 3.391222e+02 1.657714e+02 9.562773e-01 2.397500e+01 1.251303e-01 9614 136 27 72 13 0 * 2 3 1.733508e+02 3.286256e+02 1.552748e+02 8.957261e-01 2.522600e+01 1.982082e-01 250 105 48 80 13 2 * 14 15 2.138581e+02 3.281867e+02 1.143285e+02 5.346000e-01 3.823900e+01 7.583880e-01 138 72 275 37 7 3 100 83 2.707677e+02 3.281867e+02 5.741894e+01 2.120598e-01 9.413100e+01 1.944099e+00 72 35 1396 23 0 0 200 133 2.945082e+02 3.281867e+02 3.367850e+01 1.143551e-01 1.336130e+02 2.492272e+00 63 31 2243 23 4 1 300 137 3.105215e+02 3.281867e+02 1.766517e+01 5.688872e-02 1.560310e+02 2.800725e+00 36 19 2719 10 0 0 400 59 3.194224e+02 3.281867e+02 8.764247e+00 2.743779e-02 1.615080e+02 2.841964e+00 5 3 3014 0 0 0 449 14 3.255156e+02 3.281867e+02 2.671030e+00 8.205535e-03 1.628380e+02 2.843317e+00 9 6 3147 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.281867e+02 3.281867e+02 0.000000e+00 1.072859e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.281867e+02 3.281867e+02 0.000000e+00 1.513814e-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: 328.18666781638194 Dual Bound: 325.51563794954785 Dual Gap (relative): 0.008205534713045266 Search Statistics. Total number of nodes processed: 463 Total number of lmo calls: 3151 Total time (s): 165.36 LMO calls / sec: 19.055394291243346 Nodes / sec: 2.7999516207063375 LMO calls / node: 6.80561555075594 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 = 0x3e12cf7b723cc89f 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 -3.333365e+01 2.547260e+01 5.880625e+01 Inf 2.445800e+01 1.226593e-01 12204 130 41 10001 24 7 * 8 9 -2.521081e+01 2.230329e+01 4.751410e+01 Inf 2.666500e+01 6.375398e-01 121 32 224 2252 20 5 * 29 30 -1.616279e+01 2.129151e+01 3.745430e+01 Inf 3.370800e+01 1.750326e+00 326 98 960 5362 17 10 100 101 -8.117342e+00 2.129151e+01 2.940886e+01 Inf 5.582500e+01 3.600537e+00 516 119 3373 10001 21 8 119 120 -6.430911e+00 2.129151e+01 2.772242e+01 Inf 6.000400e+01 3.983068e+00 126 67 4021 1171 19 8 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 21.29151279483999 Dual Bound: -6.430911182262847 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 239 Total number of lmo calls: 4021 Total time (s): 61.195 LMO calls / sec: 65.70798267832339 Nodes / sec: 3.905547838875725 LMO calls / node: 16.824267782426777 Total number of global tightenings: 7 Global tightenings / node: 0.06 Total number of local tightenings: 546 Local tightenings / node: 4.59 Total number of potential local tightenings: 1185 Time Limit Test seed = 0x61e681227995d361 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 -1.549076e+00 0.000000e+00 1.549076e+00 Inf 2.354700e+01 1.274048e-01 12461 69 29 1235 11 7 59 0 -1.472964e-04 0.000000e+00 1.472964e-04 Inf 2.588600e+01 2.279224e+00 1 1 854 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: -0.00014729638785500928 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 854 Total time (s): 27.051 LMO calls / sec: 31.569997412295297 Nodes / sec: 2.18106539499464 LMO calls / node: 14.474576271186441 Total number of global tightenings: 5 Global tightenings / node: 0.08 Total number of local tightenings: 58 Local tightenings / node: 0.98 Total number of potential local tightenings: 70 Strong Convexity and Sharpness Tests seed = 0xe8ed8bbf17a8b5fc WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:29 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 0 1.973971e+02 1.973971e+02 0.000000e+00 0.000000e+00 1.890100e+01 5.290725e-02 7581 0 4 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 197.3971181699544 Dual Bound: 197.3971181699544 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 4 Total time (s): 20.127 LMO calls / sec: 0.19873801361355395 Nodes / sec: 0.04968450340338849 LMO calls / node: 4.0 Total number of global tightenings: 10 Global tightenings / node: 10.0 Total number of local tightenings: 10 Local tightenings / node: 10.0 Total number of potential local tightenings: 20 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:135 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:135 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 1.915755e+02 1.917619e+02 1.863775e-01 9.728670e-04 2.117700e+01 1.416631e-01 9788 0 9 9 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 191.7618774657191 Dual Bound: 191.57549997807834 Dual Gap (relative): 0.0009728670297719778 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 9 Total time (s): 22.458 LMO calls / sec: 0.4007480630510286 Nodes / sec: 0.1335826876836762 LMO calls / node: 3.0 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 17 Branching Strategy Tests seed = 0xa49b265ca0e4e28d 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.266400e+01 1.323685e-01 10750 46 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.411800e+01 2.695083e+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): 25.382 LMO calls / sec: 37.54629264833346 Nodes / sec: 2.560869907808683 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.880000e-01 7.731959e+00 244 43 48 3749 24 11 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.833000e+00 4.746318e+01 4 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.016760210963634 Dual Gap (relative): 0.05208157873473409 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.834 LMO calls / sec: 553.4351145038167 Nodes / sec: 47.43729552889858 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.900000e-01 7.692308e+00 249 46 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.628000e+00 3.624079e+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.629 LMO calls / sec: 527.31737262124 Nodes / sec: 36.21853898096992 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.990000e-01 7.518797e+00 234 38 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.750000e+00 4.285714e+01 12 8 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.751 LMO calls / sec: 515.1342090234152 Nodes / sec: 42.832667047401486 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.610000e-01 8.310249e+00 242 42 48 3749 24 11 ====================================================================================== 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 unknown function (ip: 0x7351704c5bf4) at /lib/x86_64-linux-gnu/libc.so.6 malloc at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) _ZN6soplex9spx_allocIPiEEvRT_m.constprop.0 at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex12LPColSetBaseIdEC1Eii at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) _ZN6soplex13SPxSolverBaseIdEC2ENS1_4TypeENS1_14RepresentationENS_5Timer4TYPEE 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:27 _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:69 compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:24:3 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/time_tracking_lmo.jl:116:59 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/4nmmg/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:649 unknown function (ip: 0x73510c34b8b5) at (unknown file) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337: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/4nmmg/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x73510c3382f7) at (unknown file) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/custom_bonobo.jl:29:25 unknown function (ip: 0x73510c31395a) at (unknown file) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/interface.jl:269:693 unknown function (ip: 0x73510c310c79) at (unknown file) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 solve at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x73510c30949c) at (unknown file) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337: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:125 _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 _include at ./loading.jl:3173:35 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:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337: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:125 _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 _include at ./loading.jl:3173:35 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:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337: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:353 _start at ./client.jl:593:35 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337: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: 0x735170455249) 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 ============================================================== 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.717000e+00 3.570114e+01 3 2 1174 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ 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 Solution Statistics.Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x0000735155bfc010 Total snapshots: 1. Utilization: 100% ╎1 @Base/client.jl:593 _start() ╎ 1 @Base/client.jl:318 exec_options(opts::Base.JLOptions) ╎ 1 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ 1 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ 1 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path::Strin… ╎ 1 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module, _path:… ╎ ╎ 1 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity), mod:… ╎ ╎ 1 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ 1 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ ╎ 1 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path::… ╎ ╎ 1 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module, _… ╎ ╎ ╎ 1 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity),… ╎ ╎ ╎ 1 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ ╎ 1 @Boscia/…d_oracle.jl:832 kwcall(::@NamedTuple{settings::@Name… ╎ ╎ ╎ 1 @Boscia/…_oracle.jl:834 #solve#147 ╎ ╎ ╎ 1 @Boscia/…terface.jl:28 kwcall(::@NamedTuple{settings::@Name… ╎ ╎ ╎ ╎ 1 @Boscia/…erface.jl:269 solve(f::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ 1 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bosc… ╎ ╎ ╎ ╎ 1 @Boscia/…bonobo.jl:36 optimize!(tree::BnBTree{Boscia.Fra… ╎ ╎ ╎ ╎ 1 @Boscia/…/node.jl:373 evaluate_node!(tree::BnBTree{Bosc… ╎ ╎ ╎ ╎ 1 @Boscia/…iants.jl:188 kwcall(::@NamedTuple{epsilon::Fl… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ants.jl:208 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/….jl:76 kwcall(::@NamedTuple{line_search… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/….jl:261 blended_pairwise_conditional_g… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:24 (::Boscia.var"#33#34"{Bool, Bn… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cks.jl:97 process_FW_callback_logic(tre… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:591 find_best_solution(tree::BnB… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…xt.jl:28 find_best_solution(tree::BnB… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ence.jl:25 iterate(A::Vector{Ptr{Nothi… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ray.jl:843 iterate(A::Vector{Ptr{Noth… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:869 collect_to_with_first!(des… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:918 setindex!(A::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1048 setindex! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1053 _setindex! 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): 7.602 LMO calls / sec: 154.43304393580635 Nodes / sec: 12.75980005261773 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.620000e-01 6.493506e+00 457 59 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.470000e-01 1.204819e+01 79 27 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.330000e-01 1.178992e+01 184 98 217 944 28 30 ====================================================================================== 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:44 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:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337: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 ============================================================== ┌ 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 0x0000775c67655000 Total snapshots: 410. Utilization: 0% ╎410 @Base/task.jl:1168 wait_forever() 409╎ 410 @Base/task.jl:1246 wait() 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.010100e+01 1.989902e+01 81 29 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.064200e+01 2.039090e+01 59 20 3485 420 20 24 [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:44 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:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337: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: 19275242 (Pool: 19274554; Big: 688); GC: 16 [51] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/4nmmg/test/branching_strategy_test.jl:133 PkgEval terminated after 2723.42s: test duration exceeded the time limit