Package evaluation to test Boscia on Julia 1.14.0-DEV.2212 (062a90bc8c*) started at 2026-05-22T04:32:06.233 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.42s ################################################################################ # 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 [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.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.4 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.3 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.4 [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.7.2 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.2 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.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.1+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 6.02s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:460 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 2.1 s ? GenericLinearAlgebra 1.4 s ✓ Bonobo 31.3 s ✓ GraphsMatching ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14197337-ba66-59df-a3e3-ca00e7dcff7a"), "GenericLinearAlgebra") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base ./module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [13] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3271  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [17] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [19] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 16.6 s ✓ Boscia 14.5 s ✓ Boscia → BosciaHiGHSExt 20.4 s ✓ Boscia → BosciaSCIPExt 29.1 s ✓ CombinatorialLinearOracles 6 dependencies successfully precompiled in 122 seconds. 170 already precompiled. 1 dependency failed but may be precompilable after restarting julia 1 dependency had output during precompilation: ┌ GenericLinearAlgebra │ WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:460 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ Precompilation completed after 153.53s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_oIGDFV/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.125 [497a8b3b] DoubleFloats v1.7.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_oIGDFV/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.4 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.125 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.7.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.3 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.4.0 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.23.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.0 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.4 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.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.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.10 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.6 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.2 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.8.2 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.3 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.14.0+0 [e33a78d0] Hwloc_jll v2.13.0+1 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.5+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.33+1 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.9+0 [1317d2d5] oneTBB_jll v2022.3.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.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.1+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.3+0 [29816b5a] LibSSH2_jll v1.11.101+0 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.6+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0xe6d07b630c5ac547 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 = 0xc7d9706dfe147d14 LMO Tests seed = 0x24b97e3144ce4cc9 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 = 0xbf214c2272a82649 Heuristics Tests seed = 0xd4cf74d4e27b9f16 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 Sparse Regression Tests seed = 0x1a5d19c23ca6132c 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.390731e+00 2.537000e+00 1.462689e-01 6.118165e-02 2.122800e+01 1.413228e-01 9312 45 16 24 8 1 15 4 2.519822e+00 2.537000e+00 1.717767e-02 6.817016e-03 2.515400e+01 7.553471e-01 14 9 99 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 7.515348e+00 -1.257885e+00 8.773233e+00 0.000000e+00 Inf 1 LD 2 2.537000e+00 2.537000e+00 0.000000e+00 2.147107e+00 9.314861e-01 1 Last 2 2.537000e+00 2.537000e+00 0.000000e+00 2.301335e+00 8.690609e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.537000e+00 2.537000e+00 0.000000e+00 2.304462e+00 8.678815e-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.536999573501861 Dual Bound: 2.5198219068771786 Dual Gap (relative): 0.006817016146181008 Search Statistics. Total number of nodes processed: 19 Total number of lmo calls: 104 Total time (s): 30.139 LMO calls / sec: 3.4506785228441554 Nodes / sec: 0.6304124224426823 LMO calls / node: 5.473684210526316 Total number of global tightenings: 40 Global tightenings / node: 2.67 Total number of local tightenings: 56 Local tightenings / node: 3.73 Total number of potential local tightenings: 56 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.062231e+00 3.365663e+00 1.303432e+00 6.320497e-01 1.978200e+01 1.516530e-01 9149 183 40 99 28 1 100 63 2.828530e+00 3.365663e+00 5.371330e-01 1.898983e-01 2.576300e+01 6.326903e+00 23 15 1272 21 13 0 200 65 2.940499e+00 3.365663e+00 4.251640e-01 1.445891e-01 2.762300e+01 9.593455e+00 21 14 1728 19 13 3 300 65 3.017928e+00 3.365663e+00 3.477345e-01 1.152229e-01 2.947300e+01 1.238422e+01 19 12 2200 21 12 2 400 65 3.078523e+00 3.365663e+00 2.871395e-01 9.327183e-02 3.127600e+01 1.486763e+01 22 14 2686 22 8 0 500 65 3.127813e+00 3.365663e+00 2.378499e-01 7.604354e-02 3.316800e+01 1.703449e+01 24 15 3177 22 9 3 600 65 3.179946e+00 3.365663e+00 1.857168e-01 5.840252e-02 3.532600e+01 1.882466e+01 20 14 3721 16 5 0 700 65 3.238082e+00 3.365663e+00 1.275809e-01 3.940015e-02 3.759100e+01 2.035062e+01 31 20 4309 21 3 0 800 59 3.300457e+00 3.365663e+00 6.520574e-02 1.975658e-02 4.000100e+01 2.147446e+01 38 15 4909 39 10 5 851 42 3.333979e+00 3.365663e+00 3.168393e-02 9.503339e-03 4.102400e+01 2.176775e+01 10 6 5183 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 ---------------------------------------------------------------------------------------------------------------- I 1 8.032077e+00 -2.931899e-01 8.325267e+00 0.000000e+00 Inf 1 LD 2 3.365663e+00 3.365663e+00 0.000000e+00 1.588278e-01 1.259225e+01 1 Last 2 3.365663e+00 3.365663e+00 0.000000e+00 3.203328e-01 6.243507e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.365663e+00 3.365663e+00 0.000000e+00 3.238698e-01 6.175321e+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.3656628257787053 Dual Bound: 3.33397889517714 Dual Gap (relative): 0.009503338682616899 Search Statistics. Total number of nodes processed: 893 Total number of lmo calls: 5188 Total time (s): 44.071 LMO calls / sec: 117.71913503210729 Nodes / sec: 20.262757822604435 LMO calls / node: 5.80963045912654 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Non zero entries: 24th entry: 0.17003080172553897 30th entry: 0.17003080172553897 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.179558e+00 3.365663e+00 1.186105e+00 5.441950e-01 2.500000e-01 1.200000e+01 242 181 40 99 28 1 100 36 2.884393e+00 3.365663e+00 4.812696e-01 1.668530e-01 6.872000e+00 1.979045e+01 24 16 1241 21 14 0 200 30 3.070809e+00 3.365663e+00 2.948540e-01 9.601834e-02 9.871000e+00 2.330058e+01 24 16 1879 24 11 3 300 29 3.187015e+00 3.365663e+00 1.786476e-01 5.605482e-02 1.318200e+01 2.495828e+01 22 14 2611 28 11 0 400 27 3.309736e+00 3.365663e+00 5.592664e-02 1.689761e-02 1.630700e+01 2.618507e+01 35 21 3384 41 13 2 419 21 3.332445e+00 3.365663e+00 3.321745e-02 9.967891e-03 1.701600e+01 2.585802e+01 30 20 3554 24 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.032077e+00 -2.931899e-01 8.325267e+00 0.000000e+00 Inf 1 LD 2 3.365663e+00 3.365663e+00 0.000000e+00 1.404266e-03 1.424232e+03 1 Last 2 3.365663e+00 3.365663e+00 0.000000e+00 7.454398e-03 2.682980e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.365663e+00 3.365663e+00 0.000000e+00 1.072396e-02 1.864983e+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.3656628257787053 Dual Bound: 3.332445372849624 Dual Gap (relative): 0.00996789120677368 Search Statistics. Total number of nodes processed: 440 Total number of lmo calls: 3559 Total time (s): 17.038 LMO calls / sec: 208.88601948585514 Nodes / sec: 25.82462730367414 LMO calls / node: 8.088636363636363 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Poisson Tests seed = 0xe1038b4452c3a990 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.864186e+02 -3.692765e+02 1.714210e+01 4.642076e-02 3.737700e+01 8.026326e-02 26296 141 51 10001 31 8 * 3 4 -3.863531e+02 -3.714803e+02 1.487281e+01 4.003659e-02 4.416800e+01 1.584858e-01 2889 105 130 1677 31 17 * 4 5 -3.863531e+02 -3.720546e+02 1.429851e+01 3.843122e-02 4.828000e+01 1.864126e-01 4104 128 178 2515 35 32 * 6 7 -3.862300e+02 -3.743770e+02 1.185297e+01 3.166052e-02 5.449700e+01 2.385452e-01 3021 84 245 1842 25 14 * 23 24 -3.853179e+02 -3.762602e+02 9.057691e+00 2.407294e-02 1.159380e+02 4.053891e-01 3015 89 885 1973 28 19 25 26 -3.853179e+02 -3.762602e+02 9.057691e+00 2.407294e-02 1.200140e+02 4.249504e-01 407 37 937 204 20 22 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.641437e+02 -6.901092e+02 1.354253e+03 0.000000e+00 Inf 1 LD 2 -3.580168e+02 -4.227139e+02 6.469709e+01 1.711745e-01 1.168399e+01 2 LD 17 -3.708313e+02 -4.019225e+02 3.109122e+01 4.591811e-01 3.702243e+01 3 LD 36 -3.759819e+02 -3.910636e+02 1.508169e+01 4.943613e-01 7.282124e+01 3 LD 46 -3.801547e+02 -3.858464e+02 5.691693e+00 5.163325e-01 8.908987e+01 5 LD 83 -3.806973e+02 -3.828538e+02 2.156518e+00 5.773465e-01 1.437612e+02 6 LD 118 -3.808658e+02 -3.817373e+02 8.714513e-01 6.293558e-01 1.874933e+02 6 LD 146 -3.809041e+02 -3.813356e+02 4.315586e-01 6.729554e-01 2.169535e+02 7 LD 192 -3.809096e+02 -3.809945e+02 8.483516e-02 8.193454e-01 2.343334e+02 8 LD 245 -3.809101e+02 -3.809364e+02 2.638872e-02 8.790823e-01 2.786997e+02 9 LD 292 -3.809101e+02 -3.809204e+02 1.034872e-02 9.256583e-01 3.154512e+02 9 LD 359 -3.809101e+02 -3.809147e+02 4.588036e-03 9.928513e-01 3.615849e+02 9 LD 428 -3.809101e+02 -3.809122e+02 2.115139e-03 1.078014e+00 3.970263e+02 9 LD 487 -3.809101e+02 -3.809111e+02 1.046745e-03 1.148108e+00 4.241760e+02 9 LD 541 -3.809101e+02 -3.809106e+02 4.733558e-04 1.204106e+00 4.492962e+02 9 LD 602 -3.809101e+02 -3.809103e+02 2.109337e-04 1.265492e+00 4.757042e+02 9 LD 664 -3.809101e+02 -3.809102e+02 9.693657e-05 1.335961e+00 4.970207e+02 9 LD 727 -3.809101e+02 -3.809101e+02 4.501066e-05 1.401228e+00 5.188306e+02 9 LD 784 -3.809101e+02 -3.809101e+02 2.079228e-05 1.458982e+00 5.373610e+02 9 LD 859 -3.809101e+02 -3.809101e+02 5.105537e-06 1.536796e+00 5.589552e+02 10 P 1000 -3.809101e+02 -3.809101e+02 5.105537e-06 1.675252e+00 5.969250e+02 10 P 2000 -3.809101e+02 -3.809101e+02 5.105537e-06 2.763882e+00 7.236199e+02 10 P 3000 -3.809101e+02 -3.809101e+02 5.105537e-06 3.642425e+00 8.236271e+02 10 P 4000 -3.809101e+02 -3.809101e+02 5.105537e-06 4.517976e+00 8.853522e+02 10 P 5000 -3.809101e+02 -3.809101e+02 5.105537e-06 5.369335e+00 9.312139e+02 10 P 6000 -3.809101e+02 -3.809101e+02 5.105537e-06 6.223199e+00 9.641343e+02 10 P 7000 -3.809101e+02 -3.809101e+02 5.105537e-06 7.114989e+00 9.838385e+02 10 P 8000 -3.809101e+02 -3.809101e+02 5.105537e-06 8.065200e+00 9.919159e+02 10 P 9000 -3.809101e+02 -3.809101e+02 5.105537e-06 8.916490e+00 1.009366e+03 10 P 10000 -3.809101e+02 -3.809101e+02 5.105537e-06 9.768986e+00 1.023648e+03 10 Last 10001 -3.809101e+02 -3.809101e+02 2.835280e-06 9.773958e+00 1.023229e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -3.809101e+02 -3.809101e+02 2.835280e-06 9.777444e+00 1.022864e+03 10 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -380.91009141264806 Dual Bound: -385.317925166223 Dual Gap (relative): 0.011571848194486 Search Statistics. Total number of nodes processed: 51 Total number of lmo calls: 971 Total time (s): 132.753 LMO calls / sec: 7.314335645898775 Nodes / sec: 0.38417210910487903 LMO calls / node: 19.03921568627451 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 -3.569226e+02 -3.545715e+02 2.351101e+00 6.630823e-03 2.693500e+01 1.113792e-01 10630 122 25 98 10 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.976257e+02 -3.875830e+02 1.899574e+02 0.000000e+00 Inf 1 LD 2 -3.545715e+02 -3.545715e+02 0.000000e+00 1.634053e-01 1.223950e+01 1 Last 2 -3.545715e+02 -3.545715e+02 0.000000e+00 3.366513e-01 5.940865e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.545715e+02 -3.545715e+02 0.000000e+00 3.411981e-01 5.861698e+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.57154173399954 Dual Bound: -356.9226428655917 Dual Gap (relative): 0.006630822992996847 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 30 Total time (s): 30.08 LMO calls / sec: 0.9973404255319149 Nodes / sec: 0.0997340425531915 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 1.654105e+02 3.326483e+02 1.672378e+02 1.011047e+00 2.186200e+01 1.372244e-01 10616 129 25 45 12 0 * 4 5 1.827390e+02 3.282342e+02 1.454952e+02 7.961916e-01 2.237800e+01 4.021807e-01 173 86 83 55 10 1 100 97 2.747674e+02 3.282342e+02 5.346684e+01 1.945895e-01 3.700400e+01 5.323749e+00 102 39 1507 45 4 0 200 137 2.988000e+02 3.282342e+02 2.943425e+01 9.850821e-02 4.513100e+01 7.467151e+00 77 32 2453 34 3 0 300 91 3.158457e+02 3.282342e+02 1.238848e+01 3.922318e-02 4.868400e+01 8.031386e+00 10 6 2946 2 0 0 389 32 3.252901e+02 3.282342e+02 2.944120e+00 9.050753e-03 5.038400e+01 8.355827e+00 7 4 3248 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.282342e+02 3.282342e+02 0.000000e+00 1.312877e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.282342e+02 3.282342e+02 0.000000e+00 1.907396e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 328.23421938591616 Dual Bound: 325.2900991840319 Dual Gap (relative): 0.009050752572148412 Search Statistics. Total number of nodes processed: 421 Total number of lmo calls: 3252 Total time (s): 53.468 LMO calls / sec: 60.8214258996035 Nodes / sec: 7.873868482082741 LMO calls / node: 7.724465558194774 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.654105e+02 3.326483e+02 1.672378e+02 1.011047e+00 2.539000e+01 1.181568e-01 9862 121 25 45 12 0 * 3 4 1.819411e+02 3.306631e+02 1.487220e+02 8.174185e-01 2.767700e+01 2.529176e-01 166 99 63 39 11 2 * 5 6 1.860012e+02 3.298885e+02 1.438873e+02 7.735825e-01 2.976100e+01 3.696112e-01 230 88 104 116 12 1 * 8 9 1.972494e+02 3.282342e+02 1.309848e+02 6.640566e-01 3.281800e+01 5.180084e-01 160 82 161 54 9 0 100 81 2.692868e+02 3.282342e+02 5.894743e+01 2.189021e-01 9.773200e+01 1.852003e+00 93 37 1398 43 5 2 200 123 2.982988e+02 3.282342e+02 2.993538e+01 1.003537e-01 1.373760e+02 2.351211e+00 12 7 2203 2 2 0 300 95 3.140398e+02 3.282342e+02 1.419440e+01 4.519938e-02 1.555540e+02 2.539311e+00 5 3 2673 0 0 0 397 14 3.254162e+02 3.282342e+02 2.818002e+00 8.659684e-03 1.604250e+02 2.561945e+00 12 7 2967 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.282342e+02 3.282342e+02 0.000000e+00 1.225751e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.282342e+02 3.282342e+02 0.000000e+00 1.790383e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 328.23421938591616 Dual Bound: 325.41621768735985 Dual Gap (relative): 0.008659684260922978 Search Statistics. Total number of nodes processed: 411 Total number of lmo calls: 2971 Total time (s): 163.358 LMO calls / sec: 18.187049302758357 Nodes / sec: 2.515946571334125 LMO calls / node: 7.228710462287105 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 = 0x230b1deeb75e7f80 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 -6.072935e+01 -1.455558e+01 4.617377e+01 3.172239e+00 2.613400e+01 1.147930e-01 13034 242 46 10001 27 9 * 5 6 -5.856844e+01 -2.323566e+01 3.533277e+01 1.520627e+00 2.800400e+01 3.928010e-01 498 242 154 6091 21 10 * 19 20 -5.480202e+01 -2.709040e+01 2.771162e+01 1.022932e+00 3.354600e+01 1.162583e+00 347 138 705 4625 22 18 * 75 76 -4.757948e+01 -3.169773e+01 1.588175e+01 5.010372e-01 5.455100e+01 2.768052e+00 224 106 2618 2224 17 5 89 90 -4.729358e+01 -3.169773e+01 1.559585e+01 4.920177e-01 6.000300e+01 2.983184e+00 144 74 3156 1368 18 9 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -31.69773471578351 Dual Bound: -47.293582801534875 Dual Gap (relative): 0.4920177490786304 Search Statistics. Total number of nodes processed: 179 Total number of lmo calls: 3156 Total time (s): 61.227 LMO calls / sec: 51.54588661864864 Nodes / sec: 2.9235468012478156 LMO calls / node: 17.631284916201118 Total number of global tightenings: 7 Global tightenings / node: 0.08 Total number of local tightenings: 431 Local tightenings / node: 4.84 Total number of potential local tightenings: 844 Time Limit Test seed = 0x86a316ae1fd49a7b 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 -7.462143e+00 0.000000e+00 7.462143e+00 Inf 2.483400e+01 1.208021e-01 13792 611 27 10001 8 12 * 2 3 -7.462143e+00 -1.721281e-01 7.290015e+00 4.235226e+01 2.515800e+01 1.987439e-01 321 94 40 10001 7 13 * 3 4 -7.462143e+00 -5.473950e+00 1.988193e+00 3.632099e-01 2.593300e+01 2.699263e-01 773 528 62 10001 8 10 * 4 5 -7.462143e+00 -6.712333e+00 7.498093e-01 1.117062e-01 2.646400e+01 3.400846e-01 528 276 86 10001 9 22 * 17 16 -7.084698e+00 -6.728012e+00 3.566859e-01 5.301505e-02 3.013500e+01 1.095072e+00 386 224 323 6534 6 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -6.7280116797390885 Dual Bound: -7.0846975469729365 Dual Gap (relative): 0.053015048756229304 Search Statistics. Total number of nodes processed: 33 Total number of lmo calls: 323 Total time (s): 31.436 LMO calls / sec: 10.274844127751622 Nodes / sec: 1.0497518768291132 LMO calls / node: 9.787878787878787 Total number of global tightenings: 14 Global tightenings / node: 0.82 Total number of local tightenings: 61 Local tightenings / node: 3.59 Total number of potential local tightenings: 136 Strong Convexity and Sharpness Tests seed = 0x2b2fa500ac348e9d 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.089011e+02 2.089011e+02 0.000000e+00 0.000000e+00 1.853000e+01 5.396654e-02 7621 0 4 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 208.90111801536952 Dual Bound: 208.90111801536952 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 4 Total time (s): 19.675 LMO calls / sec: 0.20330368487928843 Nodes / sec: 0.05082592121982211 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 2.163633e+02 2.168339e+02 4.705768e-01 2.174938e-03 2.169000e+01 1.383126e-01 9868 0 15 21 4 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 216.83390157084227 Dual Bound: 216.3633247677396 Dual Gap (relative): 0.002174937936490906 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 15 Total time (s): 22.906 LMO calls / sec: 0.6548502575744347 Nodes / sec: 0.13097005151488694 LMO calls / node: 5.0 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 16 Branching Strategy Tests seed = 0xe076ad8a94d9c001 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 2.212000e+01 1.356239e-01 10541 48 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 2.354200e+01 2.761023e+00 9 6 953 27 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321771298479149 Dual Gap (relative): 0.008253858173238702 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 953 Total time (s): 24.77 LMO calls / sec: 38.4739604360113 Nodes / sec: 2.624142107387969 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.890000e-01 7.712082e+00 248 48 48 3749 24 11 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.811000e+00 4.803976e+01 3 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.016760210963634 Dual Gap (relative): 0.05208157873473409 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.812 LMO calls / sec: 560.1545253863135 Nodes / sec: 48.01324503311258 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.680000e-01 8.152174e+00 238 40 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.612000e+00 3.660050e+01 3 2 859 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.338246272538823 Dual Gap (relative): 0.005990244287570652 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 859 Total time (s): 1.612 LMO calls / sec: 532.8784119106699 Nodes / sec: 36.60049627791563 LMO calls / node: 14.559322033898304 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 1.35 Total number of potential local tightenings: 167 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Uniform Random Choice FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.950000e-01 7.594937e+00 237 41 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.757000e+00 4.268640e+01 11 7 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.758 LMO calls / sec: 513.0830489192264 Nodes / sec: 42.66211604095563 LMO calls / node: 12.026666666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 54 Local tightenings / node: 0.74 Total number of potential local tightenings: 118 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Index FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.580000e-01 8.379888e+00 242 41 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.955000e+00 4.961637e+01 4 2 1174 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 1.956 LMO calls / sec: 600.2044989775051 Nodes / sec: 49.59100204498978 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.920000e-01 6.097561e+00 489 63 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.840000e-01 1.147959e+01 81 30 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.140000e-01 1.203501e+01 128 40 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.212000e+00 2.447638e+01 79 29 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.754000e+00 2.478867e+01 59 21 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.429700e+01 2.804784e+01 44 19 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.005500e+01 2.976814e+01 50 19 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.586800e+01 3.065564e+01 53 23 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.074100e+01 3.145636e+01 19 10 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.591600e+01 3.171289e+01 64 27 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.996800e+01 3.185048e+01 14 8 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.355300e+01 3.143297e+01 6 4 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.617500e+01 3.086086e+01 8 5 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.828500e+01 3.046495e+01 30 12 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.016600e+01 2.980106e+01 9 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.161800e+01 2.927273e+01 12 7 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.291900e+01 2.866645e+01 12 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.402600e+01 2.819013e+01 12 8 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.456700e+01 2.791064e+01 6 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 54.568 LMO calls / sec: 504.4165078434247 Nodes / sec: 27.910130479401847 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.196000e+00 1.366120e+00 526 74 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.516000e+00 3.577107e+00 91 36 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.649000e+00 4.152510e+00 131 42 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.027200e+01 1.956776e+01 89 33 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.087100e+01 1.996137e+01 58 20 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.684400e+01 2.356922e+01 88 26 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.154300e+01 2.604094e+01 51 23 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.607100e+01 2.734839e+01 24 13 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 2.979100e+01 2.849854e+01 41 17 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.343500e+01 2.951996e+01 23 13 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.661500e+01 3.017889e+01 9 5 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 3.983700e+01 3.064990e+01 9 5 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.270600e+01 3.079193e+01 9 6 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.521500e+01 3.102953e+01 12 7 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.714500e+01 3.098950e+01 9 5 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.903600e+01 3.097724e+01 7 5 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.040800e+01 3.128472e+01 10 6 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.180600e+01 3.128981e+01 12 7 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.303200e+01 3.128300e+01 10 5 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.403800e+01 3.107073e+01 6 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.418000e+01 3.098929e+01 14 8 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 54.181 LMO calls / sec: 493.53094258134774 Nodes / sec: 30.98872298407191 LMO calls / node: 15.926146515783204 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2233 Local tightenings / node: 1.38 Total number of potential local tightenings: 5463 Number of alternative decisions: 438 Number of stable decisions: 401 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.820000e-01 5.154639e+00 503 63 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.427000e+00 9.110021e+00 114 31 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.468000e+00 1.994434e+01 53 20 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 8.755000e+00 2.295831e+01 68 22 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.472700e+01 2.722890e+01 68 26 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.001800e+01 2.972325e+01 47 24 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.461500e+01 3.107861e+01 17 11 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 2.875600e+01 3.237585e+01 57 22 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.261800e+01 3.314121e+01 45 14 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.612200e+01 3.346991e+01 40 16 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 3.958200e+01 3.372745e+01 5 3 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.222900e+01 3.421819e+01 42 17 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.483700e+01 3.432433e+01 31 15 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 4.718200e+01 3.448349e+01 5 3 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 4.899900e+01 3.442927e+01 10 6 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.084900e+01 3.443529e+01 28 11 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.244300e+01 3.422764e+01 8 4 27751 16 0 0 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.384400e+01 3.396850e+01 8 4 28707 8 0 0 1600 253 2.705726e+01 2.836265e+01 1.305388e+00 4.824539e-02 5.500000e+01 3.369091e+01 3 2 29538 6 0 0 1700 167 2.749886e+01 2.836265e+01 8.637814e-01 3.141153e-02 5.616100e+01 3.324371e+01 3 2 30350 3 0 0 1800 75 2.797765e+01 2.836265e+01 3.849984e-01 1.376093e-02 5.716800e+01 3.279807e+01 4 2 31067 6 0 0 1821 54 2.809262e+01 2.836265e+01 2.700204e-01 9.611791e-03 5.739200e+01 3.267006e+01 10 6 31241 16 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.09262459123141 Dual Gap (relative): 0.009611790927425446 Search Statistics. Total number of nodes processed: 1875 Total number of lmo calls: 31241 Total time (s): 57.393 LMO calls / sec: 544.334674960361 Nodes / sec: 32.6694893105431 LMO calls / node: 16.66186666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2696 Local tightenings / node: 1.48 Total number of potential local tightenings: 6228 Number of alternative decisions: 543 Number of stable decisions: 394 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.870000e-01 5.110733e+00 524 62 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.517000e+00 1.628923e+01 82 32 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.117000e+00 2.021174e+01 50 23 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.429000e+00 2.705613e+01 14 6 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.159400e+01 3.303433e+01 29 13 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.591100e+01 3.563572e+01 20 10 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.078100e+01 3.536885e+01 24 10 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.504600e+01 3.645293e+01 37 15 11880 193 16 11 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.865900e+01 3.737046e+01 28 14 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.226500e+01 3.790485e+01 20 10 15981 55 10 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.512100e+01 3.852396e+01 32 15 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.806400e+01 3.869798e+01 14 7 19510 37 0 0 ====================================================================================== 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 41 running 1 of 1 signal (10): User defined signal 1 getindex at ./dict.jl:478:2 [inlined] var at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/scip_data.jl:181:5 [inlined] var at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:128:9 [inlined] #sol_values##0 at ./none (unknown line) [inlined] iterate at ./generator.jl:48:23 [inlined] collect_to! at ./array.jl:914:7 [inlined] collect_to_with_first! at ./array.jl:869:9 collect at ./array.jl:843:83 [inlined] sol_values at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/convenience.jl:25:7 [inlined] find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:28:30 unknown function (ip: 0x785308d478f2) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:591:3 unknown function (ip: 0x785308d46b7d) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:97:362 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:59:21 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:24:15 unknown function (ip: 0x785308d4fac2) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:261:543 unknown function (ip: 0x785308d3a4f5) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:177 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x785308d26ed7) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:25 unknown function (ip: 0x785308d02bfa) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:693 unknown function (ip: 0x785308cfff29) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x785308cf883c) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 exec_options at ./client.jl:321:353 _start at ./client.jl:596:35 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x785378da6249) 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) 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.146700e+01 3.851255e+01 89 34 21254 396 22 10 ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.381700e+01 3.868362e+01 9 5 22747 24 0 0 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.577300e+01 3.864724e+01 4 3 24101 6 0 0 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 5.248300e+01 3.484938e+01 14 9 25317 23 0 0 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.452300e+01 3.420575e+01 7 5 26374 10 0 0 ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.899800e+01 3.208583e+01 11 7 27346 16 0 0 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000078535e5fc010 Total snapshots: 112. Utilization: 100% ╎104 @Base/client.jl:596 _start() ╎ 104 @Base/client.jl:321 exec_options(opts::Base.JLOptions) ╎ 104 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ 104 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ 104 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path::St… ╎ 104 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module, _pa… ╎ ╎ 104 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity), m… ╎ ╎ 104 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ 104 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ ╎ 104 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 104 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module… ╎ ╎ ╎ 104 @Base/loading.jl:3113 include_string(mapexpr::typeof(identit… ╎ ╎ ╎ 104 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ ╎ 104 @Boscia/…oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 104 @Boscia/…oracle.jl:834 #solve#147 ╎ ╎ ╎ 104 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Na… ╎ ╎ ╎ ╎ 104 @Boscia/…rface.jl:269 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 104 @Boscia/…onobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 102 @Boscia/…onobo.jl:36 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 5 @Boscia/…node.jl:333 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 5 @Boscia/…ties.jl:30 getindex(h::Dict{Int64, Float64… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…cle.jl:474 check_feasibility(lmo::FrankWo… ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…apper.jl:427 optimize!(o::SCIP.Optimizer) ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…apper.jl:16 string(::String, ::String, ::… 5╎ ╎ ╎ ╎ ╎ 5 @SCIP/…CIP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ 2 @Boscia/…node.jl:350 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 2 @Boscia/…blem.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…cle.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…cle.jl:234 is_linear_feasible(o::SCIP.Op… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:253 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:254 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…xt.jl:56 get(model::SCIP.Optimizer, ::… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:224 throw_if_not_valid(model::S… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ata.jl:114 get_parameter(scipd::SCIP.S… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17170 SCIPgetParam(scip::SCIP.S… ╎ ╎ ╎ ╎ 95 @Boscia/…node.jl:373 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 95 @Boscia/…ants.jl:188 kwcall(::@NamedTuple{epsilon::… ╎ ╎ ╎ ╎ ╎ 95 @Boscia/…nts.jl:208 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 95 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_sear… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:0 blended_pairwise_conditional_gr… ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:24 set(o::SCIP.Optimizer, ::Ma… ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…er.jl:16 string(::String, ::String… 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:455 getindex(A::Vector{Float64}… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:49 _getindex(l::IndexLinear, A… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…loop.jl:77 iterate(r::Base.OneTo{Int64… ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1049 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ls.jl:1040 getindex 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…at.jl:494 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:211 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:355 dot(x::Vector{Float64}, y::V… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:0 active_set_argminmax(active_s… ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:467 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 6 @LinearAlgebra/…:1048 dot(x::Vector{Float64},… 2╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…oop.jl:75 first(a::Vector{Float64}) ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…oop.jl:77 iterate(r::Base.OneTo{Int64… ╎ ╎ ╎ ╎ ╎ ╎ 4 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex 3╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…at.jl:494 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:245 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 30 @FrankWolfe/…l:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 30 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 30 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 26 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 26 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 7 @SCIP/…ce.jl:25 iterate(A::Vector{Ptr{Noth… ╎ ╎ ╎ ╎ ╎ ╎ 7 @Base/…ay.jl:843 iterate(A::Vector{Ptr{No… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 7 @Base/…ay.jl:869 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @Base/…ay.jl:914 setindex!(A::Vector{Fl… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @Base/…or.jl:48 _setindex!(A::Vector{F… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 none:? #sol_values##0 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…IP.jl:20760 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @SCIP/…ta.jl:181 var 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex(key::… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 rem(x::UInt64, … ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ls.jl:878 objectid ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:479 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:403 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:918 setindex!(A::Vector{Fl… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1048 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1053 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ 19 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:44 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:38 -(A::Vector{Float64}, B::… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:13 promote_shape(a::Vector{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:3622 axes(A::Vector{Float6… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:843 map(f::typeof(Base.un… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:869 collect_to_with_firs… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:914 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:416 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:425 _zip_iterate_all ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:433 _zip_iterate_so… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1242 iterate 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/…ay.jl:1249 _iterate_abst… ╎ ╎ ╎ ╎ ╎ ╎ 18 @Boscia/….jl:45 (::var"#f#build_examples##… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:0 dot(x::Vector{Float64}, A:… ╎ ╎ ╎ ╎ ╎ ╎ 17 @LinearAlgebra/…:1048 dot(x::Vector{Float… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 first(a::Vector{Float64}) ╎ ╎ ╎ ╎ ╎ ╎ ╎ 16 @Base/…op.jl:77 iterate(r::Base.OneTo{In… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 16 @LinearAlgebra/…:1049 macro expansion 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ls.jl:1040 getindex 13╎ ╎ ╎ ╎ ╎ ╎ ╎ 13 @Base/…at.jl:494 + ╎ ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…s.jl:119 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:44 (::var"#f#build_examples##0… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ath.jl:38 -(A::Vector{Float64}, B::V… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…th.jl:13 promote_shape(a::Vector{Fl… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:3622 axes(A::Vector{Float64}) ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:843 map(f::typeof(Base.unch… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:869 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:918 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1048 setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1053 _setindex! ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:45 (::var"#f#build_examples##0… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1048 dot(x::Vector{Float64… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:0 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 iterate(r::Base.OneTo{Int6… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:120 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ 41 @FrankWolfe/…l:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 41 @Boscia/…mo.jl:108 storage_find_argmin_vertex(v… ╎ ╎ ╎ ╎ ╎ 31 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 31 @FrankWolfe/…l:24 set(o::SCIP.Optimizer, ::Ma… ╎ ╎ ╎ ╎ ╎ ╎ 31 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 29 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 29 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 29 @SCIP/…er.jl:16 string(::String, ::String… 29╎ ╎ ╎ ╎ ╎ ╎ ╎ 29 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:364 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:899 materialize(bc::Base.Broa… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:930 instantiate(bc::Base.Bro… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:958 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:1005 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:1006 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:615 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:619 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:675 _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:702 _broadcast_getin… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ts.jl:92 get(o::SCIP.Opti… 2╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:20760 assert_solve… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…em.jl:94 set(o::SCIP.Optimizer, ::Ma… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…e.jl:229 SCIPinfinity(scip::SCIP.Op… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/….jl:234 is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:251 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:434 get(o::SCIP.Optimizer, :… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…er.jl:316 is_valid(o::SCIP.Optimi… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:253 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:254 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:56 get(model::SCIP.Optimizer… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:224 throw_if_not_valid(mode… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:114 get_parameter(scipd::S… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17170 SCIPgetParam(scip::… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:139 get_parameter(scipd::S… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:16 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:17213 SCIPgetRealParam 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:255 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…e.jl:455 getindex(A::Vector{Float64}… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…t.jl:49 _getindex(l::IndexLinear, A… 5╎ ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1048 dot(x::Vector{Float… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:0 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 iterate(r::Base.OneTo{In… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:395 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:591 find_best_solution(tree::B… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:42 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:427 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:494 + ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:483 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:108 !=(x::Vector{Float64}, y::Ve… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:455 getindex(A::Vector{Float64}… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…t.jl:49 _getindex(l::IndexLinear, A… 2╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ 2 @Boscia/…onobo.jl:85 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 2 @Base/array.jl:843 collect(itr::Base.Generator{DataS… ╎ ╎ ╎ ╎ 2 @Base/array.jl:869 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ 2 @Base/array.jl:914 collect_to! ╎ ╎ ╎ ╎ ╎ 2 @Base/…rator.jl:45 iterate 1╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:424 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:425 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:324 popfirst!(pq::DataStructu… ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:179 pop!(a::Vector{Pair{Int6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:356 setindex!(h::Dict{Int64, In… 1570 335 2.665586e+01 2.836265e+01 1.706785e+00 6.403038e-02 6.000400e+01 3.174788e+01 3 2 27951 1 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.655860086964076 Dual Gap (relative): 0.06403038329555144 Search Statistics. Total number of nodes processed: 1905 Total number of lmo calls: 27951 Total time (s): 60.004 LMO calls / sec: 465.81894540363976 Nodes / sec: 31.74788347443504 LMO calls / node: 14.67244094488189 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1812 Local tightenings / node: 1.15 Total number of potential local tightenings: 4328 Number of alternative decisions: 331 Number of stable decisions: 621 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.770000e-01 6.289308e+00 472 62 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.740000e-01 1.162791e+01 82 30 176 523 25 27 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457:34 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.420000e-01 1.167728e+01 166 50 217 944 28 30 wait at ./task.jl:1246:44 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007e73b1bd51e0 Total snapshots: 411. Utilization: 0% ╎411 @Base/task.jl:1168 wait_forever() 410╎ 411 @Base/task.jl:1246 wait() 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.023700e+01 1.963466e+01 80 28 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.063300e+01 2.040816e+01 40 14 3485 420 20 24 [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457:34 wait at ./task.jl:1246:44 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) Allocations: 19321539 (Pool: 19320845; Big: 694); GC: 16 [41] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:133 SCIPvarGetType at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPvarGetType at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:79084:9 [inlined] get at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper/variable.jl:434:28 is_linear_feasible_subroutine at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:251:55 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:234:25 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:229:3 [inlined] is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/problem.jl:94:3 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:118:62 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:108:4 [inlined] #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291:649 unknown function (ip: 0x785308d3a4f5) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:177 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x785308d26ed7) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:25 unknown function (ip: 0x785308d02bfa) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:693 unknown function (ip: 0x785308cfff29) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x785308cf883c) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 exec_options at ./client.jl:321:353 _start at ./client.jl:596:35 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x785378da6249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) Allocations: 4602512176 (Pool: 4602508604; Big: 3572); GC: 1790 PkgEval terminated after 2740.44s: test duration exceeded the time limit