Package evaluation to test Boscia on Julia 1.14.0-DEV.3141 (fbd24f51d0*) started at 2026-09-08T22:51:02.903 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 13.7s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.12 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [4c555306] + ArrayLayouts v1.12.2 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.12 [d360d2e6] + ChainRulesCore v1.26.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.9 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.6 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.11 [1a297f60] + FillArrays v1.17.0 [f6369f11] + ForwardDiff v1.4.5 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.8 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.8.0 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.53.0 [3b969827] + MathOptSetDistances v0.2.12 [a3b82374] + MatrixFactorizations v3.1.3 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v2.0.1 [69de0a69] + Parsers v3.0.0 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.9.0 [90137ffa] + StaticArrays v1.9.20 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.5 [ec057cc2] + StructUtils v2.8.5 ⌅ [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.12.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.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.7+0 [4536629a] + OpenBLAS_jll v0.3.34+0 [05823500] + OpenLibm_jll v0.8.8+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 4.83s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ TestEnv ~/.julia/packages/TestEnv/sTG3E/src/julia-1.13/activate_set.jl:78 Precompiling package dependencies... Precompiling project... 1.9 s ✓ Bonobo terminate called after throwing an instance of 'std::runtime_error' what(): Symbol for type FILE was not found. A Value of type DataType was found instead. Searched modules: Libc [24] signal 6 (-6): Aborted in expression starting at /home/pkgeval/.julia/packages/CxxWrap/0hc89/src/CxxWrap.jl:457 unknown function (ip: 0x7d519c28febc) at /lib/x86_64-linux-gnu/libc.so.6 gsignal at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) abort at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) __verbose_terminate_handler at /workspace/srcdir/gcc-15.2.0/libstdc++-v3/libsupc++/vterminate.cc:95:10 __terminate at /workspace/srcdir/gcc-15.2.0/libstdc++-v3/libsupc++/eh_terminate.cc:48:15 terminate at /workspace/srcdir/gcc-15.2.0/libstdc++-v3/libsupc++/eh_terminate.cc:58:27 __cxa_throw at /workspace/srcdir/gcc-15.2.0/libstdc++-v3/libsupc++/eh_throw.cc:98:18 _ZN5jlcxx10julia_typeERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEES7_.cold at /home/pkgeval/.julia/artifacts/8bf36e12e0b76a45fc51bc0ee19a7ea25ab26c5a/lib/libcxxwrap_julia.so (unknown line) _ZN5jlcxx19register_core_typesEv at /home/pkgeval/.julia/artifacts/8bf36e12e0b76a45fc51bc0ee19a7ea25ab26c5a/lib/libcxxwrap_julia.so (unknown line) initialize_cxxwrap at /home/pkgeval/.julia/artifacts/8bf36e12e0b76a45fc51bc0ee19a7ea25ab26c5a/lib/libcxxwrap_julia.so (unknown line) initialize_cxx_lib at /home/pkgeval/.julia/packages/CxxWrap/0hc89/src/CxxWrap.jl:453:0 (pc: 1) unknown function (ip: 0x7d517f91cc4f) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:829:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 ijl_eval_thunk at /source/src/toplevel.c:772:18 jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_eval_module_expr at /source/src/toplevel.c:266:5 [inlined] jl_toplevel_eval_flex at /source/src/toplevel.c:669:27 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_eval_module_expr at /source/src/toplevel.c:266:5 [inlined] jl_toplevel_eval_flex at /source/src/toplevel.c:669:27 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 ijl_toplevel_eval at /source/src/toplevel.c:786:12 ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 eval at ./boot.jl:618:0 (pc: 1) include_string at ./loading.jl:3291:0 (pc: 140) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 _include at ./loading.jl:3353:0 (pc: 123) include at ./Base.jl:334:0 (pc: 1) include_package_for_output at ./loading.jl:3468:0 (pc: 489) jfptr_include_package_for_output_3.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:829:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 ijl_eval_thunk at /source/src/toplevel.c:772:18 jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 ijl_toplevel_eval at /source/src/toplevel.c:786:12 ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 eval at ./boot.jl:618:0 (pc: 1) include_string at ./loading.jl:3291:0 (pc: 140) include_string at ./loading.jl:3301:0 [inlined] __script_entry_include_string at ./client.jl:104:0 [inlined] exec_options at ./client.jl:382:0 (pc: 900) _start at ./client.jl:695:0 (pc: 217) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] true_main at /source/src/jlapi.c:990:29 jl_repl_entrypoint at /source/src/jlapi.c:1157:15 main at /source/cli/loader_exe.c:117:15 unknown function (ip: 0x7d519c22c249) 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 Allocations: 723633 (Pool: 723623; Big: 10); GC: 1 ✗ CxxWrap 11.7 s ✓ MathOptSetDistances 17.0 s ✓ FrankWolfe 24.0 s ✓ SCIP ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("1f15a43c-97ca-5a2a-ae31-89f07a497df4"), "CxxWrap") 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(into::Module, mod::Symbol) @ Base loading.jl:2694 [inlined] [3] top-level scope @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:7 [4] include(mod::Module, _path::String) @ Base Base.jl:334 [5] top-level scope @ stdin:5 in expression starting at /home/pkgeval/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:1 in expression starting at stdin:5 ✗ LEMONGraphs 14.1 s ✓ Boscia 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(into::Module, mod::Symbol) @ Base loading.jl:2694 [inlined] [3] top-level scope @ ~/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:10 [4] include(mod::Module, _path::String) @ Base Base.jl:334 [5] top-level scope @ stdin:5 in expression starting at /home/pkgeval/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:1 in expression starting at stdin:5 ✗ GraphsMatching 11.9 s ✓ Boscia → BosciaHiGHSExt 17.1 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(into::Module, mod::Symbol) @ Base loading.jl:2694 [inlined] [3] top-level scope @ ~/.julia/packages/CombinatorialLinearOracles/tVMpY/src/CombinatorialLinearOracles.jl:6 [4] include(mod::Module, _path::String) @ Base Base.jl:334 [5] top-level scope @ stdin:5 in expression starting at /home/pkgeval/.julia/packages/CombinatorialLinearOracles/tVMpY/src/CombinatorialLinearOracles.jl:1 in expression starting at stdin:5 ✗ CombinatorialLinearOracles 7 dependencies successfully precompiled in 137 seconds. 186 already precompiled. 4 dependencies had output during precompilation: ┌ CxxWrap │ terminate called after throwing an instance of 'std::runtime_error' │ what(): Symbol for type FILE was not found. A Value of type DataType was found instead. Searched modules: Libc │ │ [24] signal 6 (-6): Aborted │ in expression starting at /home/pkgeval/.julia/packages/CxxWrap/0hc89/src/CxxWrap.jl:457 │ unknown function (ip: 0x7d519c28febc) at /lib/x86_64-linux-gnu/libc.so.6 │ gsignal at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) │ abort at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) │ __verbose_terminate_handler at /workspace/srcdir/gcc-15.2.0/libstdc++-v3/libsupc++/vterminate.cc:95:10 │ __terminate at /workspace/srcdir/gcc-15.2.0/libstdc++-v3/libsupc++/eh_terminate.cc:48:15 │ terminate at /workspace/srcdir/gcc-15.2.0/libstdc++-v3/libsupc++/eh_terminate.cc:58:27 │ __cxa_throw at /workspace/srcdir/gcc-15.2.0/libstdc++-v3/libsupc++/eh_throw.cc:98:18 │ _ZN5jlcxx10julia_typeERKNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEES7_.cold at /home/pkgeval/.julia/artifacts/8bf36e12e0b76a45fc51bc0ee19a7ea25ab26c5a/lib/libcxxwrap_julia.so (unknown line) │ _ZN5jlcxx19register_core_typesEv at /home/pkgeval/.julia/artifacts/8bf36e12e0b76a45fc51bc0ee19a7ea25ab26c5a/lib/libcxxwrap_julia.so (unknown line) │ initialize_cxxwrap at /home/pkgeval/.julia/artifacts/8bf36e12e0b76a45fc51bc0ee19a7ea25ab26c5a/lib/libcxxwrap_julia.so (unknown line) │ initialize_cxx_lib at /home/pkgeval/.julia/packages/CxxWrap/0hc89/src/CxxWrap.jl:453:0 (pc: 1) │ unknown function (ip: 0x7d517f91cc4f) at (unknown file) │ _jl_invoke at /source/src/gf.c:4590:23 [inlined] │ ijl_apply_generic at /source/src/gf.c:4838:12 │ jl_apply at /source/src/julia.h:2538:12 [inlined] │ do_call at /source/src/interpreter.c:123:26 │ eval_value at /source/src/interpreter.c:259:16 │ eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] │ eval_body at /source/src/interpreter.c:829:21 │ jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 │ ijl_eval_thunk at /source/src/toplevel.c:772:18 │ jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 │ jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 │ jl_eval_module_expr at /source/src/toplevel.c:266:5 [inlined] │ jl_toplevel_eval_flex at /source/src/toplevel.c:669:27 │ jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 │ jl_eval_module_expr at /source/src/toplevel.c:266:5 [inlined] │ jl_toplevel_eval_flex at /source/src/toplevel.c:669:27 │ jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 │ jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 │ ijl_toplevel_eval at /source/src/toplevel.c:786:12 │ ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 │ eval at ./boot.jl:618:0 (pc: 1) │ include_string at ./loading.jl:3291:0 (pc: 140) │ _jl_invoke at /source/src/gf.c:4590:23 [inlined] │ ijl_apply_generic at /source/src/gf.c:4838:12 │ _include at ./loading.jl:3353:0 (pc: 123) │ include at ./Base.jl:334:0 (pc: 1) │ include_package_for_output at ./loading.jl:3468:0 (pc: 489) │ jfptr_include_package_for_output_3.1 at /opt/julia/lib/julia/sys.so (unknown line) │ _jl_invoke at /source/src/gf.c:4590:23 [inlined] │ ijl_apply_generic at /source/src/gf.c:4838:12 │ jl_apply at /source/src/julia.h:2538:12 [inlined] │ do_call at /source/src/interpreter.c:123:26 │ eval_value at /source/src/interpreter.c:259:16 │ eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] │ eval_body at /source/src/interpreter.c:829:21 │ jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 │ ijl_eval_thunk at /source/src/toplevel.c:772:18 │ jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 │ jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 │ jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 │ ijl_toplevel_eval at /source/src/toplevel.c:786:12 │ ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 │ eval at ./boot.jl:618:0 (pc: 1) │ include_string at ./loading.jl:3291:0 (pc: 140) │ include_string at ./loading.jl:3301:0 [inlined] │ __script_entry_include_string at ./client.jl:104:0 [inlined] │ exec_options at ./client.jl:382:0 (pc: 900) │ _start at ./client.jl:695:0 (pc: 217) │ jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) │ _jl_invoke at /source/src/gf.c:4590:23 [inlined] │ ijl_apply_generic at /source/src/gf.c:4838:12 │ jl_apply at /source/src/julia.h:2538:12 [inlined] │ true_main at /source/src/jlapi.c:990:29 │ jl_repl_entrypoint at /source/src/jlapi.c:1157:15 │ main at /source/cli/loader_exe.c:117:15 │ unknown function (ip: 0x7d519c22c249) 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 │ Allocations: 723633 (Pool: 723623; Big: 10); GC: 1 └ ┌ GraphsMatching │ 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(into::Module, mod::Symbol) │ @ Base loading.jl:2694 [inlined] │ [3] top-level scope │ @ ~/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:10 │ [4] include(mod::Module, _path::String) │ @ Base Base.jl:334 │ [5] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/GraphsMatching/0EoW1/src/GraphsMatching.jl:1 │ in expression starting at stdin:5 └ ┌ CombinatorialLinearOracles │ 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(into::Module, mod::Symbol) │ @ Base loading.jl:2694 [inlined] │ [3] top-level scope │ @ ~/.julia/packages/CombinatorialLinearOracles/tVMpY/src/CombinatorialLinearOracles.jl:6 │ [4] include(mod::Module, _path::String) │ @ Base Base.jl:334 │ [5] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/CombinatorialLinearOracles/tVMpY/src/CombinatorialLinearOracles.jl:1 │ in expression starting at stdin:5 └ ┌ LEMONGraphs │ ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("1f15a43c-97ca-5a2a-ae31-89f07a497df4"), "CxxWrap") 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(into::Module, mod::Symbol) │ @ Base loading.jl:2694 [inlined] │ [3] top-level scope │ @ ~/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:7 │ [4] include(mod::Module, _path::String) │ @ Base Base.jl:334 │ [5] top-level scope │ @ stdin:5 │ in expression starting at /home/pkgeval/.julia/packages/LEMONGraphs/vcNOz/src/LEMONGraphs.jl:1 │ in expression starting at stdin:5 └ ERROR: LoadError: The following 4 packages failed to precompile: CxxWrap Failed to precompile CxxWrap [1f15a43c-97ca-5a2a-ae31-89f07a497df4] to "/home/pkgeval/.julia/compiled/v1.14/CxxWrap/jl_INb3Uk" (ProcessSignaled(6)). GraphsMatching Failed to precompile GraphsMatching [c3af3a8c-b79e-4b01-bf44-c718d7e0e0d6] to "/home/pkgeval/.julia/compiled/v1.14/GraphsMatching/jl_4qbas5" (ProcessExited(1)). CombinatorialLinearOracles Failed to precompile CombinatorialLinearOracles [0002e35e-4a6a-41c8-a2f5-6940c7e5949f] to "/home/pkgeval/.julia/compiled/v1.14/CombinatorialLinearOracles/jl_E46Qtn" (ProcessExited(1)). LEMONGraphs Failed to precompile LEMONGraphs [14b1564f-c77f-4800-9e89-efd961faef7c] to "/home/pkgeval/.julia/compiled/v1.14/LEMONGraphs/jl_rlfgEa" (ProcessExited(1)). in expression starting at /PkgEval.jl/scripts/precompile.jl:34 Precompilation failed after 163.0s ################################################################################ # Testing # Testing Boscia Test Could not use exact versions of packages in manifest, re-resolving. Note: if you do not check your manifest file into source control, then you can probably ignore this message. However, if you do check your manifest file into source control, then you probably want to pass the `allow_reresolve = false` kwarg when calling the `Pkg.test` function. Updating `/tmp/jl_K0EQvb/Project.toml` [4c88cf16] + Aqua v0.8.16 [36b166db] + Boscia v0.2.12 [336ed68f] + CSV v0.10.17 [0002e35e] + CombinatorialLinearOracles v0.1.5 [31c24e10] + Distributions v0.25.131 [497a8b3b] + DoubleFloats v1.11.2 [86223c79] + Graphs v1.15.0 [87dc4568] + HiGHS v1.25.2 [82193955] + SCIP v0.12.8 [860ef19b] + StableRNGs v1.0.4 [fd094767] + Suppressor v0.2.8 Updating `/tmp/jl_K0EQvb/Manifest.toml` [7d9f7c33] + Accessors v0.1.45 [66dad0bd] + AliasTables v1.1.3 [4c88cf16] + Aqua v0.8.16 [ec485272] + ArnoldiMethod v0.4.0 [36b166db] + Boscia v0.2.12 [336ed68f] + CSV v0.10.17 [0002e35e] + CombinatorialLinearOracles v0.1.5 [38540f10] + CommonSolve v0.2.14 [a33af91c] + CompositionsBase v0.1.2 [1f15a43c] + CxxWrap v0.17.5 [9a962f9c] + DataAPI v1.16.0 [e2d170a0] + DataValueInterfaces v1.0.0 [31c24e10] + Distributions v0.25.131 [497a8b3b] + DoubleFloats v1.11.2 [48062228] + FilePathsBase v0.9.24 [a0844989] + Gamma v1.2.0 [14197337] + GenericLinearAlgebra v0.4.1 [86223c79] + Graphs v1.15.0 [c3af3a8c] + GraphsMatching v0.2.1 [87dc4568] + HiGHS v1.25.2 [34004b35] + HypergeometricFunctions v0.3.30 [d25df0c9] + Inflate v0.1.5 ⌅ [842dd82b] + InlineStrings v1.4.6 [3587e190] + InverseFunctions v0.1.17 [82899510] + IteratorInterfaceExtensions v1.0.0 [4076af6c] + JuMP v1.31.2 [14b1564f] + LEMONGraphs v0.1.1 [8c4f8055] + MathOptIIS v0.2.0 [e1d29d7a] + Missings v1.2.0 [90014a1f] + PDMats v0.11.41 ⌅ [69de0a69] ↓ Parsers v3.0.0 ⇒ v2.8.8 [2dfb63ee] + PooledArrays v1.4.3 [43287f4e] + PtrArrays v1.4.0 [1fd47b50] + QuadGK v2.11.3 [be4d8f0f] + Quadmath v1.1.0 [189a3867] + Reexport v1.2.2 [79098fc4] + Rmath v0.9.0 [f2b01f46] + Roots v3.0.8 [82193955] + SCIP v0.12.8 [91c51154] + SentinelArrays v1.4.10 [699a6c99] + SimpleTraits v0.9.6 [a2af1166] + SortingAlgorithms v1.2.3 [860ef19b] + StableRNGs v1.0.4 [82ae8749] + StatsAPI v1.8.0 [2913bbd2] + StatsBase v0.34.13 [4c63d2b9] + StatsFuns v2.2.1 [fd094767] + Suppressor v0.2.8 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.14.0 [ea10d353] + WeakRefStrings v1.4.3 [76eceee3] + WorkerUtilities v1.6.1 [ae81ac8f] + ASL_jll v0.1.5+0 [8fd58aa0] + HiGHS_jll v1.15.1+3 [e33a78d0] + Hwloc_jll v2.14.0+0 ⌅ [9cc047cb] + Ipopt_jll v300.1400.1900+0 [9f9b04fa] + LEMON_jll v1.3.6+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.34+0 [05236dd9] + Readline_jll v8.3.3+0 [f50d1b31] + Rmath_jll v0.5.2+0 [fc9abe76] + SCIP_PaPILO_jll v1000.0.300+0 [e5ac4fe4] + SCIP_jll v1000.0.300+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.10+1 [1317d2d5] + oneTBB_jll v2022.3.0+0 [0dad84c5] + ArgTools v1.2.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [4af54fe1] + LazyArtifacts v1.11.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.14.0 [4607b0f0] + SuiteSparse [a4e569a6] + Tar v1.10.0 [781609d7] + GMP_jll v6.3.0+5 [deac9b47] + LibCURL_jll v8.22.0+0 [e37daf67] + LibGit2_jll v1.9.7+0 [29816b5a] + LibSSH2_jll v1.11.104+0 [3a97d323] + MPFR_jll v4.2.2+1 [14a3606d] + MozillaCACerts_jll v2026.8.13 [458c3c95] + OpenSSL_jll v3.5.8+0 [efcefdf7] + PCRE2_jll v10.48.0+0 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850ede] + nghttp2_jll v1.70.0+0 [3f19e933] + p7zip_jll v17.8.2+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Test Successfully re-resolved Status `/tmp/jl_K0EQvb/Project.toml` [4c88cf16] Aqua v0.8.16 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.17 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.131 [497a8b3b] DoubleFloats v1.11.2 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.15.0 [87dc4568] HiGHS v1.25.2 [b8f27783] MathOptInterface v1.53.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.5 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_K0EQvb/Manifest.toml` [7d9f7c33] Accessors v0.1.45 [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.16 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [4c555306] ArrayLayouts v1.12.2 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.17 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.9 [0002e35e] CombinatorialLinearOracles v0.1.5 [38540f10] CommonSolve v0.2.14 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [a33af91c] CompositionsBase v0.1.2 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.6 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [31c24e10] Distributions v0.25.131 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.11.2 [e2ba6199] ExprTools v0.1.11 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.17.0 [f6369f11] ForwardDiff v1.4.5 [f55ce6ea] FrankWolfe v0.6.4 [a0844989] Gamma v1.2.0 [14197337] GenericLinearAlgebra v0.4.1 [c145ed77] GenericSchur v0.5.8 [86223c79] Graphs v1.15.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.25.2 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.30 [d25df0c9] Inflate v0.1.5 ⌅ [842dd82b] InlineStrings v1.4.6 [3587e190] InverseFunctions v0.1.17 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.8.0 [4076af6c] JuMP v1.31.2 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v1.0.1 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.53.0 [3b969827] MathOptSetDistances v0.2.12 [a3b82374] MatrixFactorizations v3.1.3 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.4 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v2.0.1 [90014a1f] PDMats v0.11.41 ⌅ [69de0a69] Parsers v2.8.8 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.4 [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.1.0 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [f2b01f46] Roots v3.0.8 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.10 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.6 [a2af1166] SortingAlgorithms v1.2.3 [276daf66] SpecialFunctions v2.9.0 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.20 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.5 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.13 [4c63d2b9] StatsFuns v2.2.1 [ec057cc2] StructUtils v2.8.5 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.14.0 ⌅ [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.5+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.15.1+3 [e33a78d0] Hwloc_jll v2.14.0+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.6+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.34+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.2+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.300+0 [e5ac4fe4] SCIP_jll v1000.0.300+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.10+1 [1317d2d5] oneTBB_jll v2022.3.0+0 [0dad84c5] ArgTools v1.2.0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.12.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.14.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.13.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.7+0 [781609d7] GMP_jll v6.3.0+5 [deac9b47] LibCURL_jll v8.22.0+0 [e37daf67] LibGit2_jll v1.9.7+0 [29816b5a] LibSSH2_jll v1.11.104+0 [3a97d323] MPFR_jll v4.2.2+1 [14a3606d] MozillaCACerts_jll v2026.8.13 [4536629a] OpenBLAS_jll v0.3.34+0 [05823500] OpenLibm_jll v0.8.8+0 [458c3c95] OpenSSL_jll v3.5.8+0 [efcefdf7] PCRE2_jll v10.48.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.70.0+0 [3f19e933] p7zip_jll v17.8.2+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x136f07c46b726d69 ┌ Warning: `disable_sigint` no longer defers Ctrl-C: SIGINT is delivered as a cancellation of the current ^C scope and observed at cancellation points regardless of the sigatomic region this establishes. Shield a region from cancellation by scoping `Base.CANCEL_TOKEN => nothing` over it instead. │ caller = optimize!(model::HiGHS.Optimizer) at MOI_wrapper.jl:2318 └ @ HiGHS ~/.julia/packages/HiGHS/4ZEBB/src/MOI_wrapper.jl:2318 WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/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 = TIME_LIMIT_REACHED WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/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 = TIME_LIMIT_REACHED Callback Tests seed = 0xd95139cb03474eef LMO Tests seed = 0x34ab6271fc2fc565 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:254 Indicator Tests seed = 0x2d71a9c119d13c6b Heuristics Tests seed = 0x640704b2d44ba47e WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:193 [ Info: Polish solution Sparse Regression Tests seed = 0x24d7553907b3c575 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.387036e+00 2.660210e+00 2.731742e-01 1.144408e-01 2.063800e+01 1.453629e-01 7876 40 15 19 9 0 * 2 3 2.387036e+00 2.631059e+00 2.440235e-01 1.022287e-01 2.435400e+01 2.053051e-01 31 20 24 13 9 1 * 3 4 2.405811e+00 2.599263e+00 1.934524e-01 8.041049e-02 2.438700e+01 2.870382e-01 29 19 34 10 7 0 29 6 2.577680e+00 2.599263e+00 2.158373e-02 8.373317e-03 2.488500e+01 1.406470e+00 14 9 163 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 4.713355e+00 1.084981e+00 3.628374e+00 0.000000e+00 Inf 1 LD 2 2.599263e+00 2.599263e+00 0.000000e+00 2.063712e+00 9.691273e-01 1 Last 2 2.599263e+00 2.599263e+00 0.000000e+00 2.252281e+00 8.879888e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.599263e+00 2.599263e+00 0.000000e+00 2.254836e+00 8.869823e-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.5992633483943064 Dual Bound: 2.577679619997994 Dual Gap (relative): 0.008373316927698361 Search Statistics. Total number of nodes processed: 35 Total number of lmo calls: 168 Total time (s): 30.462 LMO calls / sec: 5.515067953515856 Nodes / sec: 1.1489724903158034 LMO calls / node: 4.8 Total number of global tightenings: 40 Global tightenings / node: 1.38 Total number of local tightenings: 46 Local tightenings / node: 1.59 Total number of potential local tightenings: 46 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.116683e+00 3.801483e+00 1.684801e+00 7.959627e-01 1.966800e+01 1.525320e-01 8988 199 42 92 29 1 100 53 3.142035e+00 3.801483e+00 6.594477e-01 2.098791e-01 2.575300e+01 5.941055e+00 21 14 1178 17 16 2 200 53 3.251076e+00 3.801483e+00 5.504074e-01 1.693001e-01 2.781700e+01 9.095158e+00 25 17 1594 20 14 1 300 53 3.328972e+00 3.801483e+00 4.725110e-01 1.419390e-01 3.000100e+01 1.176627e+01 37 24 2041 33 17 3 400 53 3.398483e+00 3.801483e+00 4.030001e-01 1.185823e-01 3.217700e+01 1.407838e+01 23 15 2497 28 12 1 500 53 3.462739e+00 3.801483e+00 3.387444e-01 9.782557e-02 3.442200e+01 1.606531e+01 24 16 2966 22 9 0 600 53 3.512347e+00 3.801483e+00 2.891361e-01 8.231990e-02 3.644000e+01 1.791987e+01 15 11 3433 16 5 0 700 53 3.561891e+00 3.801483e+00 2.395922e-01 6.726545e-02 3.860000e+01 1.950777e+01 28 18 3929 41 15 4 800 53 3.618933e+00 3.801483e+00 1.825499e-01 5.044301e-02 4.061800e+01 2.100054e+01 22 15 4426 21 5 0 900 53 3.678491e+00 3.801483e+00 1.229920e-01 3.343545e-02 4.280000e+01 2.226636e+01 25 17 4936 23 5 0 1000 37 3.753759e+00 3.801483e+00 4.772435e-02 1.271375e-02 4.491000e+01 2.309063e+01 37 23 5414 38 11 1 1013 34 3.764911e+00 3.801483e+00 3.657181e-02 9.713857e-03 4.515000e+01 2.318937e+01 5 3 5476 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 8.823775e+00 9.538045e-01 7.869971e+00 0.000000e+00 Inf 1 LD 2 3.801483e+00 3.801483e+00 0.000000e+00 1.745996e-01 1.145478e+01 1 Last 2 3.801483e+00 3.801483e+00 0.000000e+00 4.133010e-01 4.839088e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.801483e+00 3.801483e+00 0.000000e+00 4.163074e-01 4.804142e+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: 3.8014831883622655 Dual Bound: 3.764911379037046 Dual Gap (relative): 0.009713856620596907 Search Statistics. Total number of nodes processed: 1047 Total number of lmo calls: 5481 Total time (s): 48.966 LMO calls / sec: 111.9348119103051 Nodes / sec: 21.382183555936773 LMO calls / node: 5.234957020057307 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: 14 Non zero entries: 22th entry: 0.16602088433187082 44th entry: 0.16602088433187082 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 2.298790e+00 3.801483e+00 1.502693e+00 6.536886e-01 2.660000e-01 1.127820e+01 260 201 42 92 29 1 100 26 3.287624e+00 3.801483e+00 5.138587e-01 1.563009e-01 6.853000e+00 1.838611e+01 24 16 1255 17 16 2 200 26 3.457926e+00 3.801483e+00 3.435575e-01 9.935363e-02 1.022600e+01 2.210053e+01 30 20 1942 26 16 6 300 26 3.582791e+00 3.801483e+00 2.186917e-01 6.103947e-02 1.381300e+01 2.360096e+01 22 14 2694 25 13 3 400 26 3.694455e+00 3.801483e+00 1.070284e-01 2.897000e-02 1.739100e+01 2.449543e+01 28 18 3485 40 16 7 454 16 3.765044e+00 3.801483e+00 3.643889e-02 9.678210e-03 1.923400e+01 2.443589e+01 16 11 3919 9 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.823775e+00 9.538045e-01 7.869971e+00 0.000000e+00 Inf 1 LD 2 3.801483e+00 3.801483e+00 0.000000e+00 9.907810e-04 2.018610e+03 1 Last 2 3.801483e+00 3.801483e+00 0.000000e+00 6.081953e-03 3.288417e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.801483e+00 3.801483e+00 0.000000e+00 9.169484e-03 2.181148e+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: 3.8014831883622655 Dual Bound: 3.7650442980650496 Dual Gap (relative): 0.009678210244682321 Search Statistics. Total number of nodes processed: 470 Total number of lmo calls: 3924 Total time (s): 19.258 LMO calls / sec: 203.7594765811611 Nodes / sec: 24.405441894277704 LMO calls / node: 8.348936170212767 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: 10 Poisson Tests seed = 0x1713f82ae80b876f 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 -3.113159e+02 -2.925378e+02 1.877810e+01 6.419032e-02 2.462800e+01 1.218126e-01 12958 129 49 2481 30 7 * 3 4 -3.112594e+02 -2.946877e+02 1.657169e+01 5.623476e-02 3.151300e+01 2.221305e-01 2042 95 129 1387 31 12 * 9 10 -3.105850e+02 -2.952947e+02 1.529031e+01 5.177982e-02 3.935000e+01 4.828463e-01 1342 76 336 913 22 13 * 12 13 -3.105178e+02 -2.955807e+02 1.493712e+01 5.053483e-02 4.665700e+01 5.358253e-01 2221 104 450 1467 29 23 * 14 15 -3.104876e+02 -2.963568e+02 1.413081e+01 4.768175e-02 4.984700e+01 5.817802e-01 1293 79 520 885 26 19 * 23 24 -3.102190e+02 -2.966481e+02 1.357095e+01 4.574765e-02 7.168100e+01 6.556828e-01 2307 81 839 1668 30 12 * 34 35 -3.099155e+02 -2.981795e+02 1.173603e+01 3.935896e-02 9.272700e+01 7.441198e-01 1597 90 1220 1110 29 13 47 48 -3.096670e+02 -2.981795e+02 1.148758e+01 3.852573e-02 1.200050e+02 7.916337e-01 1870 57 1643 1275 22 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.443238e+02 -5.702857e+02 1.114609e+03 0.000000e+00 Inf 1 LD 2 -2.886040e+02 -3.345176e+02 4.591360e+01 3.267437e-01 6.121005e+00 2 LD 30 -2.984725e+02 -3.164702e+02 1.799773e+01 6.720822e-01 4.463740e+01 3 LD 35 -3.033864e+02 -3.046195e+02 1.233070e+00 6.828281e-01 5.125741e+01 3 LD 68 -3.034391e+02 -3.038896e+02 4.504467e-01 7.239207e-01 9.393295e+01 5 LD 114 -3.034492e+02 -3.035563e+02 1.071744e-01 7.764942e-01 1.468137e+02 6 LD 145 -3.034503e+02 -3.034803e+02 3.007053e-02 8.118428e-01 1.786060e+02 6 LD 184 -3.034504e+02 -3.034554e+02 5.023089e-03 8.545521e-01 2.153175e+02 7 LD 230 -3.034504e+02 -3.034527e+02 2.355681e-03 9.053835e-01 2.540360e+02 7 LD 245 -3.034504e+02 -3.034512e+02 8.133666e-04 9.247603e-01 2.649335e+02 7 LD 270 -3.034504e+02 -3.034507e+02 3.138726e-04 9.518506e-01 2.836580e+02 7 LD 289 -3.034504e+02 -3.034505e+02 1.374485e-04 9.703843e-01 2.978201e+02 7 LD 314 -3.034504e+02 -3.034504e+02 4.333492e-05 9.982854e-01 3.145393e+02 8 LD 336 -3.034504e+02 -3.034504e+02 1.472977e-05 1.020932e+00 3.291109e+02 8 LD 365 -3.034504e+02 -3.034504e+02 4.816143e-06 1.049632e+00 3.477410e+02 8 LD 398 -3.034504e+02 -3.034504e+02 2.265627e-06 1.082392e+00 3.677042e+02 8 LD 414 -3.034504e+02 -3.034504e+02 9.264996e-07 1.099679e+00 3.764734e+02 8 Last 414 -3.034504e+02 -3.034504e+02 9.264996e-07 1.105817e+00 3.743838e+02 8 ---------------------------------------------------------------------------------------------------------------- PP 414 -3.034504e+02 -3.034504e+02 9.264996e-07 1.108801e+00 3.733762e+02 8 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -303.4503594831221 Dual Bound: -309.6670346156529 Dual Gap (relative): 0.02048662965211136 Search Statistics. Total number of nodes processed: 95 Total number of lmo calls: 1671 Total time (s): 124.66 LMO calls / sec: 13.404460131557837 Nodes / sec: 0.7620728381196855 LMO calls / node: 17.589473684210525 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 -2.863954e+02 -2.835927e+02 2.802721e+00 9.882910e-03 2.376800e+01 1.262201e-01 9322 123 25 82 13 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 -1.463898e+02 -3.098328e+02 1.634430e+02 0.000000e+00 Inf 1 LD 2 -2.835927e+02 -2.835927e+02 0.000000e+00 1.863115e-01 1.073471e+01 1 Last 2 -2.835927e+02 -2.835927e+02 0.000000e+00 3.762317e-01 5.315874e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.835927e+02 -2.835927e+02 0.000000e+00 3.796102e-01 5.268562e+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: -283.59272184762773 Dual Bound: -286.39544323076115 Dual Gap (relative): 0.009882910128558582 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 30 Total time (s): 27.394 LMO calls / sec: 1.0951303205081406 Nodes / sec: 0.10951303205081406 LMO calls / node: 10.0 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 2.623325e+02 3.584043e+02 9.607183e+01 3.662217e-01 2.036700e+01 1.472971e-01 9360 140 28 178 13 2 * 11 10 3.035146e+02 3.549538e+02 5.143925e+01 1.694787e-01 2.233300e+01 9.403125e-01 62 33 185 21 3 5 53 6 3.524756e+02 3.549538e+02 2.478274e+00 7.031051e-03 2.575600e+01 2.290728e+00 30 18 572 8 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.549538e+02 3.549538e+02 0.000000e+00 8.525270e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.549538e+02 3.549538e+02 0.000000e+00 2.095929e-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: 354.9538399509132 Dual Bound: 352.47556614862907 Dual Gap (relative): 0.0070310513416953595 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 576 Total time (s): 29.175 LMO calls / sec: 19.74293059125964 Nodes / sec: 2.0222793487574977 LMO calls / node: 9.76271186440678 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 2.623325e+02 3.584043e+02 9.607183e+01 3.662217e-01 2.479200e+01 1.210068e-01 9371 138 28 178 13 2 * 3 4 2.675761e+02 3.549538e+02 8.737771e+01 3.265527e-01 2.722200e+01 2.571450e-01 185 90 70 77 7 6 69 6 3.518726e+02 3.549538e+02 3.081227e+00 8.756655e-03 4.760700e+01 1.575399e+00 12 7 616 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.549538e+02 3.549538e+02 0.000000e+00 9.545580e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.549538e+02 3.549538e+02 0.000000e+00 2.612727e-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: 354.9538399509132 Dual Bound: 351.8726127471009 Dual Gap (relative): 0.00875665536955804 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 620 Total time (s): 51.223 LMO calls / sec: 12.103937684243407 Nodes / sec: 1.4641860101907347 LMO calls / node: 8.266666666666667 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 = 0x8345660bf9b748ed 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.577868e+01 6.525235e+01 8.103103e+01 Inf 2.441700e+01 1.228652e-01 11369 121 49 10001 25 12 * 3 4 -1.104066e+01 5.757750e+01 6.861816e+01 Inf 2.513700e+01 2.784740e-01 221 82 110 4161 23 7 * 4 5 -1.104066e+01 5.706095e+01 6.810161e+01 Inf 2.554900e+01 3.522643e-01 409 46 134 10001 22 23 * 5 6 -8.335889e+00 4.492123e+01 5.325712e+01 Inf 2.590700e+01 4.245957e-01 355 129 180 5921 21 13 100 73 1.936787e+01 4.492123e+01 2.555336e+01 1.319369e+00 4.610000e+01 3.752711e+00 395 60 2671 10001 22 3 154 111 2.782642e+01 4.492123e+01 1.709481e+01 6.143376e-01 6.000300e+01 4.416446e+00 115 45 4261 1877 25 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 44.92122875841106 Dual Bound: 27.826415059961086 Dual Gap (relative): 0.6143376234996001 Search Statistics. Total number of nodes processed: 265 Total number of lmo calls: 4261 Total time (s): 61.897 LMO calls / sec: 68.84016995977188 Nodes / sec: 4.2813060406804855 LMO calls / node: 16.079245283018867 Total number of global tightenings: 18 Global tightenings / node: 0.12 Total number of local tightenings: 870 Local tightenings / node: 5.65 Total number of potential local tightenings: 1189 Time Limit Test seed = 0x2b862155b415e829 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.134401e+00 0.000000e+00 1.134401e+00 Inf 2.207800e+01 1.358819e-01 10072 53 24 1134 12 0 23 0 -1.909352e-02 0.000000e+00 1.909352e-02 Inf 2.272200e+01 1.012235e+00 3 2 288 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: -0.019093520093946496 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 23 Total number of lmo calls: 288 Total time (s): 24.584 LMO calls / sec: 11.71493654409372 Nodes / sec: 0.9355678490074846 LMO calls / node: 12.521739130434783 Total number of global tightenings: 4 Global tightenings / node: 0.17 Total number of local tightenings: 22 Local tightenings / node: 0.96 Total number of potential local tightenings: 27 Strong Convexity and Sharpness Tests seed = 0x39a6be27a7fcd498 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/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 2.002508e+02 2.002508e+02 0.000000e+00 0.000000e+00 1.920500e+01 5.206977e-02 6578 0 4 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 200.2507902566215 Dual Bound: 200.2507902566215 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 4 Total time (s): 21.132 LMO calls / sec: 0.1892863903085368 Nodes / sec: 0.0473215975771342 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/EgUlC/test/strong_convexity_and_sharpness.jl:135 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/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.769608e+02 1.772661e+02 3.052168e-01 1.724770e-03 2.084400e+01 1.439263e-01 7898 0 14 14 5 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 177.26605656678908 Dual Bound: 176.9608397477854 Dual Gap (relative): 0.0017247704036592929 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 14 Total time (s): 22.748 LMO calls / sec: 0.6154387198874626 Nodes / sec: 0.13187972569017056 LMO calls / node: 4.666666666666667 Total number of global tightenings: 7 Global tightenings / node: 7.0 Total number of local tightenings: 7 Local tightenings / node: 7.0 Total number of potential local tightenings: 15 Branching Strategy Tests seed = 0x5d8dc8ee8d78466b 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.196500e+01 1.365809e-01 9282 42 46 3163 25 9 61 4 7.321141e+00 7.382204e+00 6.106274e-02 8.340603e-03 2.326200e+01 2.794257e+00 9 6 978 28 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321141423252462 Dual Gap (relative): 0.008340603407452801 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 978 Total time (s): 25.154 LMO calls / sec: 38.88049614375447 Nodes / sec: 2.584082054544009 LMO calls / node: 15.046153846153846 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 85 Local tightenings / node: 1.39 Total number of potential local tightenings: 163 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.470000e-01 1.214575e+01 154 42 46 3163 25 9 100 13 6.622429e+00 7.382204e+00 7.597754e-01 1.147276e-01 1.897000e+00 5.956774e+01 5 3 1248 6 0 0 115 2 7.321773e+00 7.382204e+00 6.043155e-02 8.253678e-03 2.010000e+00 5.820896e+01 6 4 1343 35 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.32177260672484 Dual Gap (relative): 0.008253678019628835 Search Statistics. Total number of nodes processed: 117 Total number of lmo calls: 1343 Total time (s): 2.011 LMO calls / sec: 667.8269517652909 Nodes / sec: 58.18000994530084 LMO calls / node: 11.478632478632479 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 63 Local tightenings / node: 0.55 Total number of potential local tightenings: 156 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.260000e-01 1.327434e+01 139 37 46 3163 25 9 79 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.509000e+00 5.235255e+01 2 1 1127 0 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: 79 Total number of lmo calls: 1127 Total time (s): 1.51 LMO calls / sec: 746.3576158940398 Nodes / sec: 52.317880794701985 LMO calls / node: 14.265822784810126 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 72 Local tightenings / node: 0.91 Total number of potential local tightenings: 168 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 3.000000e-01 1.000000e+01 169 34 46 3163 25 9 73 2 7.335122e+00 7.382204e+00 4.708210e-02 6.418721e-03 1.396000e+00 5.372493e+01 10 7 909 33 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.335122056868152 Dual Gap (relative): 0.006418721204706988 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 909 Total time (s): 1.397 LMO calls / sec: 650.6800286327846 Nodes / sec: 53.686471009305656 LMO calls / node: 12.12 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 59 Local tightenings / node: 0.81 Total number of potential local tightenings: 119 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.350000e-01 1.276596e+01 161 35 46 3163 25 9 95 4 7.324924e+00 7.382204e+00 5.728014e-02 7.819896e-03 1.641000e+00 6.032907e+01 3 2 1181 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.324924018471204 Dual Gap (relative): 0.007819895706499947 Search Statistics. Total number of nodes processed: 99 Total number of lmo calls: 1181 Total time (s): 1.642 LMO calls / sec: 719.2448233861145 Nodes / sec: 60.292326431181486 LMO calls / node: 11.929292929292929 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 76 Local tightenings / node: 0.8 Total number of potential local tightenings: 157 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.387474e-03 3.396650e+01 3.397589e+01 Inf 4.060000e-01 7.389163e+00 403 64 64 5398 39 11 * 4 5 4.050753e-01 3.102006e+01 3.061499e+01 7.557851e+01 6.390000e-01 1.408451e+01 72 29 182 711 24 20 * 19 20 5.437344e+00 2.836265e+01 2.292530e+01 4.216269e+00 1.762000e+00 2.213394e+01 63 26 707 494 21 30 100 101 1.300626e+01 2.836265e+01 1.535638e+01 1.180692e+00 6.609000e+00 3.041307e+01 64 27 3234 501 25 19 200 201 1.669715e+01 2.836265e+01 1.166549e+01 6.986518e-01 1.143700e+01 3.506164e+01 39 19 6079 293 18 23 300 297 1.877920e+01 2.836265e+01 9.583446e+00 5.103224e-01 1.585000e+01 3.766562e+01 37 17 8823 275 15 12 400 393 2.048424e+01 2.836265e+01 7.878402e+00 3.846079e-01 2.025600e+01 3.914889e+01 39 19 11527 298 18 22 500 467 2.164467e+01 2.836265e+01 6.717973e+00 3.103754e-01 2.419400e+01 3.996859e+01 17 11 14002 37 0 0 600 539 2.275256e+01 2.836265e+01 5.610089e+00 2.465696e-01 2.819500e+01 4.039723e+01 32 17 16435 187 17 10 700 573 2.371197e+01 2.836265e+01 4.650680e+00 1.961322e-01 3.137600e+01 4.057241e+01 13 8 18519 53 0 0 800 569 2.442884e+01 2.836265e+01 3.933808e+00 1.610313e-01 3.410200e+01 4.014427e+01 6 4 20354 10 0 0 900 525 2.527566e+01 2.836265e+01 3.086984e+00 1.221327e-01 3.619300e+01 3.937225e+01 10 6 21854 25 0 0 1000 471 2.586635e+01 2.836265e+01 2.496292e+00 9.650730e-02 3.795900e+01 3.875234e+01 28 15 23188 147 14 8 1100 395 2.634758e+01 2.836265e+01 2.015068e+00 7.648018e-02 3.953300e+01 3.781651e+01 8 5 24403 17 0 0 1200 309 2.698695e+01 2.836265e+01 1.375691e+00 5.097616e-02 4.074800e+01 3.703249e+01 9 5 25376 23 0 0 1300 215 2.746620e+01 2.836265e+01 8.964413e-01 3.263797e-02 4.194600e+01 3.611787e+01 8 5 26337 20 0 0 1400 121 2.789287e+01 2.836265e+01 4.697781e-01 1.684223e-02 4.297200e+01 3.539514e+01 9 6 27159 12 0 0 1449 72 2.808272e+01 2.836265e+01 2.799226e-01 9.967788e-03 4.346600e+01 3.499287e+01 5 3 27537 9 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404973 Dual Bound: 28.082722399220863 Dual Gap (relative): 0.009967788101337218 Search Statistics. Total number of nodes processed: 1521 Total number of lmo calls: 27537 Total time (s): 43.467 LMO calls / sec: 633.5150804058251 Nodes / sec: 34.992062944302575 LMO calls / node: 18.104536489151872 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2367 Local tightenings / node: 1.63 Total number of potential local tightenings: 5140 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.387474e-03 3.396650e+01 3.397589e+01 Inf 1.507000e+00 1.990710e+00 343 65 64 5398 39 11 * 4 5 4.050753e-01 3.102006e+01 3.061499e+01 7.557851e+01 1.765000e+00 5.099150e+00 83 38 182 711 24 20 * 19 20 5.437344e+00 2.836265e+01 2.292530e+01 4.216269e+00 2.737000e+00 1.424918e+01 58 25 707 494 21 30 100 101 1.300626e+01 2.836265e+01 1.535638e+01 1.180692e+00 7.342000e+00 2.737674e+01 57 25 3234 501 25 19 200 197 1.666624e+01 2.836265e+01 1.169641e+01 7.018025e-01 1.245300e+01 3.187987e+01 57 24 6034 528 18 8 300 261 1.834594e+01 2.836265e+01 1.001671e+01 5.459906e-01 1.633200e+01 3.434974e+01 43 22 8409 220 21 14 400 313 1.984829e+01 2.836265e+01 8.514355e+00 4.289717e-01 1.977500e+01 3.605563e+01 16 9 10607 69 0 0 500 349 2.103532e+01 2.836265e+01 7.327321e+00 3.483341e-01 2.286400e+01 3.713261e+01 37 19 12567 236 13 12 600 387 2.187947e+01 2.836265e+01 6.483180e+00 2.963135e-01 2.581400e+01 3.823507e+01 20 11 14521 104 10 6 700 405 2.283284e+01 2.836265e+01 5.529809e+00 2.421867e-01 2.833600e+01 3.899633e+01 9 5 16156 15 0 0 800 421 2.364750e+01 2.836265e+01 4.715149e+00 1.993931e-01 3.089000e+01 3.952736e+01 8 5 17902 11 0 0 900 415 2.432574e+01 2.836265e+01 4.036906e+00 1.659520e-01 3.320500e+01 3.960247e+01 8 5 19416 9 0 0 1000 403 2.516307e+01 2.836265e+01 3.199577e+00 1.271537e-01 3.558400e+01 3.942783e+01 10 6 20885 15 0 0 1100 361 2.578915e+01 2.836265e+01 2.573492e+00 9.978970e-02 3.734700e+01 3.911961e+01 12 7 22117 24 0 0 1200 319 2.638577e+01 2.836265e+01 1.976875e+00 7.492202e-02 3.881600e+01 3.913335e+01 4 3 23245 7 0 0 1300 279 2.677434e+01 2.836265e+01 1.588304e+00 5.932188e-02 3.997600e+01 3.949870e+01 10 6 24202 15 0 0 1400 221 2.729240e+01 2.836265e+01 1.070245e+00 3.921401e-02 4.121000e+01 3.933511e+01 8 5 25134 19 0 0 1500 159 2.767344e+01 2.836265e+01 6.892086e-01 2.490506e-02 4.226500e+01 3.925234e+01 13 8 25994 40 0 0 1600 77 2.801447e+01 2.836265e+01 3.481788e-01 1.242854e-02 4.311500e+01 3.889598e+01 7 4 26723 8 0 0 1613 64 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 4.324100e+01 3.878264e+01 11 7 26831 48 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404973 Dual Bound: 28.083355821757866 Dual Gap (relative): 0.009945008189894616 Search Statistics. Total number of nodes processed: 1677 Total number of lmo calls: 26831 Total time (s): 43.242 LMO calls / sec: 620.4847139355256 Nodes / sec: 38.78173997502429 LMO calls / node: 15.999403697078115 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2152 Local tightenings / node: 1.33 Total number of potential local tightenings: 5367 Number of alternative decisions: 435 Number of stable decisions: 403 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.387474e-03 3.396650e+01 3.397589e+01 Inf 3.770000e-01 7.957560e+00 326 55 64 5398 39 11 * 12 13 1.957007e+00 2.836265e+01 2.640564e+01 1.349287e+01 1.481000e+00 1.688049e+01 53 26 481 379 17 18 100 101 1.009608e+01 2.836265e+01 1.826656e+01 1.809273e+00 6.159000e+00 3.263517e+01 49 23 3123 404 23 28 ====================================================================================== 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 66 running 1 of 1 signal (10): User defined signal 1 SCIPsolCheckOrig at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPtransformProb at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPpresolve at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPsolve at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21458:0 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16:0 [inlined] optimize! at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:427:0 (pc: 23) _optimize_and_return at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:358:0 (pc: 2) #compute_extreme_point#108 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:43:0 (pc: 304) compute_extreme_point at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/moi_oracle.jl:24:0 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:116:0 (pc: 67) compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:108:0 [inlined] #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291:0 (pc: 738) unknown function (ip: 0x753c47a5da52) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:0 (pc: 49) #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:0 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:0 (pc: 28) unknown function (ip: 0x753c47a4ace4) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:0 (pc: 3173) #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:0 (pc: 370) optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:0 (pc: 5) unknown function (ip: 0x753c47a24b6a) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:0 (pc: 6301) unknown function (ip: 0x753c47a21fe9) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:0 (pc: 3) #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:0 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:0 (pc: 8) unknown function (ip: 0x753c47a1554c) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:829:21 eval_body at /source/src/interpreter.c:704:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:704:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 ijl_eval_thunk at /source/src/toplevel.c:772:18 jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 ijl_toplevel_eval at /source/src/toplevel.c:786:12 ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 eval at ./boot.jl:618:0 (pc: 1) include_string at ./loading.jl:3291:0 (pc: 140) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 _include at ./loading.jl:3353:0 (pc: 123) include at ./Base.jl:335:0 (pc: 1) IncludeInto at ./Base.jl:336:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:829:21 eval_body at /source/src/interpreter.c:704:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 ijl_eval_thunk at /source/src/toplevel.c:772:18 jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 ijl_toplevel_eval at /source/src/toplevel.c:786:12 ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 eval at ./boot.jl:618:0 (pc: 1) include_string at ./loading.jl:3291:0 (pc: 140) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 _include at ./loading.jl:3353:0 (pc: 123) include at ./Base.jl:335:0 (pc: 1) IncludeInto at ./Base.jl:336:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:829:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 ijl_eval_thunk at /source/src/toplevel.c:772:18 jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 ijl_toplevel_eval at /source/src/toplevel.c:786:12 ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 eval at ./boot.jl:618:0 (pc: 1) __script_entry_eval at ./client.jl:106:0 [inlined] exec_options at ./client.jl:350:0 (pc: 426) _start at ./client.jl:695:0 (pc: 217) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] true_main at /source/src/jlapi.c:990:29 jl_repl_entrypoint at /source/src/jlapi.c:1157:15 main at /source/cli/loader_exe.c:117:15 unknown function (ip: 0x753dc53b3249) 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 195 1.386634e+01 2.836265e+01 1.449630e+01 1.045431e+00 1.130800e+01 3.493102e+01 37 17 5918 329 18 14 300 285 1.591186e+01 2.836265e+01 1.245079e+01 7.824847e-01 1.559800e+01 3.750481e+01 72 30 8546 690 24 10 ====================================================================================== 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:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:573:34 wait at ./task.jl:1652:0 (pc: 108) wait_forever at ./task.jl:1528:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] start_task at /source/src/task.c:1280:23 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000079cccad7e890 Total snapshots: 374. Utilization: 0% ╎374 @Base/task.jl:1528 wait_forever() 373╎ 374 @Base/task.jl:? wait() 400 369 1.758996e+01 2.836265e+01 1.077269e+01 6.124340e-01 2.202700e+01 3.491170e+01 46 20 11015 407 18 16 500 437 1.913121e+01 2.836265e+01 9.231431e+00 4.825324e-01 2.604200e+01 3.598034e+01 40 20 13290 281 13 11 [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:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:573:34 wait at ./task.jl:1652:0 (pc: 108) [66] signal 15: Terminated in expression starting at none:1 subtype at /source/src/subtype.c:2772:1 subtype_unionall at /source/src/subtype.c:1789:15 subtype at /source/src/subtype.c:2961:16 subtype_unionall at /source/src/subtype.c:1789:15 subtype at /source/src/subtype.c:2961:16 exists_subtype at /source/src/subtype.c:3339:13 [inlined] forall_exists_subtype at /source/src/subtype.c:3368:15 ijl_subtype_env at /source/src/subtype.c:3893:19 [inlined] ijl_subtype_env at /source/src/subtype.c:3857:18 simple_subtype at /source/src/jltypes.c:672:29 ijl_type_union at /source/src/jltypes.c:771:21 inst_type_w_ at /source/src/jltypes.c:3150:21 inst_type_w_ at /source/src/jltypes.c:3130:13 inst_type_w_ at /source/src/jltypes.c:3130:13 instantiate_unionall_ at /source/src/jltypes.c:1689:12 [inlined] apply_type_ at /source/src/jltypes.c:1610:14 _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2538:12 [inlined] jl_f__apply_iterate at /source/src/builtins.c:1041:26 make_typealias at ./show.jl:724:0 (pc: 414) show_typealias at ./show.jl:887:0 [inlined] _show_type at ./show.jl:1081:0 (pc: 72) show at ./show.jl:1062:0 (pc: 25) jfptr_show_5.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 PkgEval terminated after 2728.41s: test duration exceeded the time limit