Package evaluation to test Boscia on Julia 1.14.0-DEV.1262 (4060c45d70*) started at 2025-11-18T18:36:04.442 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.23s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.2 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.3 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.2.2 [d360d2e6] + ChainRulesCore v1.26.0 [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.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.15.0 [f6369f11] + ForwardDiff v1.3.0 [f55ce6ea] + FrankWolfe v0.6.1 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.3.0 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.46.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [92933f4c] + ProgressMeter v1.11.0 [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.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.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.16.0+0 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.11.4 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.4+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.68.0+1 [3f19e933] + p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.75s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Error: Failed to use TestEnv.jl; test dependencies will not be precompiled │ exception = │ UndefVarError: `project_rel_path` not defined in `TestEnv` │ Suggestion: this global was defined as `Pkg.Operations.project_rel_path` but not assigned a value. │ Stacktrace: │ [1] get_test_dir(ctx::Pkg.Types.Context, pkgspec::PackageSpec) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:75 │ [2] test_dir_has_project_file │ @ ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:52 [inlined] │ [3] maybe_gen_project_override! │ @ ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/common.jl:83 [inlined] │ [4] activate(pkg::String; allow_reresolve::Bool) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/activate_set.jl:12 │ [5] activate(pkg::String) │ @ TestEnv ~/.julia/packages/TestEnv/i9lgt/src/julia-1.11/activate_set.jl:9 │ [6] top-level scope │ @ /PkgEval.jl/scripts/precompile.jl:24 │ [7] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [8] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:344 │ [9] _start() │ @ Base ./client.jl:577 └ @ Main /PkgEval.jl/scripts/precompile.jl:26 Precompiling package dependencies... Precompiling packages... 1592.4 ms ✓ Bonobo 78640.3 ms ✓ MathOptInterface 10013.9 ms ✓ MathOptSetDistances 34946.2 ms ✓ FrankWolfe 13907.6 ms ✓ Boscia 5 dependencies successfully precompiled in 142 seconds. 95 already precompiled. Precompilation completed after 151.25s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_fB0kaV/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.2 [336ed68f] CSV v0.10.15 [0002e35e] CombinatorialLinearOracles v0.1.2 [31c24e10] Distributions v0.25.122 [497a8b3b] DoubleFloats v1.5.0 [f55ce6ea] FrankWolfe v0.6.1 [86223c79] Graphs v1.13.1 [87dc4568] HiGHS v1.20.1 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.46.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.7 [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_fB0kaV/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.2 [336ed68f] CSV v0.10.15 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.2 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.3 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.0 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.15.0 [f6369f11] ForwardDiff v1.3.0 [f55ce6ea] FrankWolfe v0.6.1 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.13.1 [06909019] GraphsFlows v0.1.1 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.20.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.3.0 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.3 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.46.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.36 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [92933f4c] ProgressMeter v1.11.0 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.7 [91c51154] SentinelArrays v1.4.8 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.8 [4c63d2b9] StatsFuns v1.5.2 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.0 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [9f9b04fa] LEMON_jll v1.3.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.400+0 [e5ac4fe4] SCIP_jll v900.200.400+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.7+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.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.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.11.4 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0xa5a2602fd0b8f103 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = OPT_TREE_EMPTY Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = OPT_TREE_EMPTY LMO Tests seed = 0x4ae99e186b0d65d0 Indicator Tests Heuristics Tests seed = 0x6fa076c0cecb8f80 [ Info: Polish solution Sparse Regression Tests seed = 0xe557e50ce433208b 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 3.425537e+00 3.478064e+00 5.252714e-02 1.533399e-02 1.551300e+01 1.933862e-01 5205 16 4 2 1 0 5 0 3.478064e+00 3.478064e+00 0.000000e+00 0.000000e+00 1.835000e+01 2.724796e-01 8 5 16 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.777208e+00 2.754586e+00 3.022622e+00 0.000000e+00 Inf 1 LD 2 3.478064e+00 3.478064e+00 0.000000e+00 1.675994e+00 1.193322e+00 1 Last 2 3.478064e+00 3.478064e+00 0.000000e+00 1.819984e+00 1.098911e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.478064e+00 3.478064e+00 0.000000e+00 1.824092e+00 1.096436e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 3.478064255438512 Dual Bound: 3.478064255438512 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 5 Total number of lmo calls: 21 Total time (s): 21.775 LMO calls / sec: 0.9644087256027555 Nodes / sec: 0.2296211251435132 LMO calls / node: 4.2 Total number of global tightenings: 48 Global tightenings / node: 9.6 Total number of local tightenings: 49 Local tightenings / node: 9.8 Total number of potential local tightenings: 49 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.943766e+00 3.779729e+00 1.835964e+00 9.445398e-01 1.547500e+01 1.938611e-01 7868 347 51 112 31 1 100 59 2.945641e+00 3.779729e+00 8.340884e-01 2.831602e-01 2.423500e+01 6.560759e+00 25 18 1339 19 17 0 200 59 3.029423e+00 3.779729e+00 7.503069e-01 2.476732e-01 2.668500e+01 9.705827e+00 29 22 1734 14 12 0 300 59 3.086615e+00 3.779729e+00 6.931141e-01 2.245548e-01 2.920900e+01 1.229073e+01 27 20 2170 24 10 3 400 59 3.135556e+00 3.779729e+00 6.441738e-01 2.054417e-01 3.188800e+01 1.439413e+01 43 31 2639 34 12 0 500 59 3.173575e+00 3.779729e+00 6.061542e-01 1.910004e-01 3.477200e+01 1.607615e+01 40 28 3159 45 15 6 600 59 3.212531e+00 3.779729e+00 5.671985e-01 1.765582e-01 3.785700e+01 1.740761e+01 40 28 3719 46 16 5 700 59 3.253595e+00 3.779729e+00 5.261347e-01 1.617087e-01 4.100000e+01 1.851220e+01 31 22 4304 27 6 0 800 59 3.302195e+00 3.779729e+00 4.775346e-01 1.446113e-01 4.384700e+01 1.959085e+01 38 27 4896 40 13 5 900 59 3.359176e+00 3.779729e+00 4.205531e-01 1.251953e-01 4.656700e+01 2.059398e+01 29 21 5544 27 5 1 1000 59 3.430127e+00 3.779729e+00 3.496023e-01 1.019211e-01 4.968500e+01 2.131428e+01 35 26 6188 23 4 1 1100 59 3.552563e+00 3.779729e+00 2.271662e-01 6.394432e-02 5.276500e+01 2.196532e+01 13 9 6790 2 1 0 1185 20 3.746184e+00 3.779729e+00 3.354517e-02 8.954489e-03 5.488700e+01 2.195420e+01 15 11 7229 2 2 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.169483e+00 -1.885518e-02 8.188338e+00 0.000000e+00 Inf 1 LD 2 3.779729e+00 3.779729e+00 0.000000e+00 1.607392e-01 1.244252e+01 1 Last 2 3.779729e+00 3.779729e+00 0.000000e+00 3.257847e-01 6.139024e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.779729e+00 3.779729e+00 0.000000e+00 3.301353e-01 6.058122e+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.7797294294448807 Dual Bound: 3.746184262529456 Dual Gap (relative): 0.008954489305546003 Search Statistics. Total number of nodes processed: 1205 Total number of lmo calls: 7234 Total time (s): 57.05 LMO calls / sec: 126.80105170902718 Nodes / sec: 21.12182296231376 LMO calls / node: 6.003319502074689 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: 18 Non zero entries: 19th entry: 0.15997142907601344 33th entry: 0.15997142907601344 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.062433e+00 3.779729e+00 1.717296e+00 8.326554e-01 4.690000e-01 6.396588e+00 463 336 51 112 31 1 100 40 3.009635e+00 3.779729e+00 7.700941e-01 2.558762e-01 8.971000e+00 1.560584e+01 25 18 1301 19 16 1 200 40 3.099355e+00 3.779729e+00 6.803741e-01 2.195212e-01 1.132600e+01 2.119018e+01 33 24 1692 20 13 1 300 30 3.190873e+00 3.779729e+00 5.888564e-01 1.845440e-01 1.466500e+01 2.250256e+01 29 21 2252 28 14 1 400 29 3.274406e+00 3.779729e+00 5.053239e-01 1.543254e-01 1.901200e+01 2.256470e+01 38 26 3011 40 13 5 500 29 3.377008e+00 3.779729e+00 4.027212e-01 1.192538e-01 2.387400e+01 2.215800e+01 32 23 3885 23 6 1 600 29 3.518217e+00 3.779729e+00 2.615120e-01 7.433082e-02 2.890500e+01 2.176094e+01 53 31 4810 32 6 3 672 8 3.747947e+00 3.779729e+00 3.178253e-02 8.479983e-03 3.199000e+01 2.125664e+01 29 20 5403 24 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.169483e+00 -1.885518e-02 8.188338e+00 0.000000e+00 Inf 1 LD 2 3.779729e+00 3.779729e+00 0.000000e+00 1.465456e-03 1.364763e+03 1 Last 2 3.779729e+00 3.779729e+00 0.000000e+00 9.458362e-03 2.114531e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.779729e+00 3.779729e+00 0.000000e+00 1.415431e-02 1.412997e+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.7797294294448807 Dual Bound: 3.7479469027578056 Dual Gap (relative): 0.008479983177907055 Search Statistics. Total number of nodes processed: 680 Total number of lmo calls: 5408 Total time (s): 32.019 LMO calls / sec: 168.89971579374748 Nodes / sec: 21.237390299509666 LMO calls / node: 7.952941176470588 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: 16 Poisson Tests seed = 0x2b155701264c7fc4 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.957110e+02 -1.775099e+02 1.820111e+01 1.025358e-01 1.741000e+01 1.723148e-01 8843 110 36 691 16 1 * 2 3 -1.957110e+02 -1.800228e+02 1.568822e+01 8.714576e-02 1.794500e+01 2.786291e-01 529 100 66 278 16 6 * 10 11 -1.957060e+02 -1.801250e+02 1.558106e+01 8.650138e-02 4.143500e+01 5.068179e-01 2641 119 371 1935 23 7 29 30 -1.955973e+02 -1.801250e+02 1.547227e+01 8.589739e-02 1.200050e+02 4.916462e-01 526 48 1090 323 11 8 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.012122e+02 -4.271701e+02 8.283823e+02 0.000000e+00 Inf 1 LD 2 -1.848892e+02 -2.030252e+02 1.813597e+01 1.833325e-01 1.090914e+01 2 LD 71 -1.884952e+02 -1.973706e+02 8.875417e+00 5.495439e-01 1.291980e+02 5 LD 80 -1.890304e+02 -1.915507e+02 2.520295e+00 6.460338e-01 1.238325e+02 6 LD 168 -1.892228e+02 -1.901942e+02 9.714468e-01 7.660367e-01 2.193106e+02 8 LD 231 -1.892610e+02 -1.895901e+02 3.291307e-01 8.467133e-01 2.728196e+02 9 LD 330 -1.892686e+02 -1.894213e+02 1.527303e-01 9.799251e-01 3.367604e+02 10 LD 450 -1.892696e+02 -1.893301e+02 6.058566e-02 1.139375e+00 3.949534e+02 12 LD 497 -1.892697e+02 -1.892853e+02 1.559525e-02 1.202085e+00 4.134484e+02 13 LD 649 -1.892697e+02 -1.892751e+02 5.356737e-03 1.391970e+00 4.662457e+02 15 LD 770 -1.892697e+02 -1.892721e+02 2.370350e-03 1.619731e+00 4.753875e+02 15 LD 873 -1.892697e+02 -1.892708e+02 1.130201e-03 1.702502e+00 5.127746e+02 15 LD 983 -1.892697e+02 -1.892703e+02 5.491357e-04 1.786856e+00 5.501282e+02 16 P 1000 -1.892697e+02 -1.892703e+02 5.491357e-04 1.802094e+00 5.549100e+02 16 LD 1076 -1.892697e+02 -1.892699e+02 2.011320e-04 1.923475e+00 5.594042e+02 16 LD 1190 -1.892697e+02 -1.892698e+02 6.795367e-05 2.025781e+00 5.874278e+02 16 LD 1331 -1.892697e+02 -1.892697e+02 2.721268e-05 2.181701e+00 6.100743e+02 16 LD 1460 -1.892697e+02 -1.892697e+02 1.197449e-05 2.281004e+00 6.400690e+02 16 LD 1573 -1.892697e+02 -1.892697e+02 5.503563e-06 2.379302e+00 6.611184e+02 16 P 2000 -1.892697e+02 -1.892697e+02 5.503563e-06 2.740018e+00 7.299223e+02 16 P 3000 -1.892697e+02 -1.892697e+02 5.503563e-06 3.517090e+00 8.529779e+02 16 LD 3090 -1.892697e+02 -1.892697e+02 2.298086e-06 3.576199e+00 8.640460e+02 16 P 4000 -1.892697e+02 -1.892697e+02 2.298086e-06 4.257740e+00 9.394655e+02 16 P 5000 -1.892697e+02 -1.892697e+02 2.298086e-06 5.013474e+00 9.973124e+02 16 P 6000 -1.892697e+02 -1.892697e+02 2.298086e-06 5.760140e+00 1.041641e+03 16 P 7000 -1.892697e+02 -1.892697e+02 2.298086e-06 6.490050e+00 1.078574e+03 16 P 8000 -1.892697e+02 -1.892697e+02 2.298086e-06 7.200513e+00 1.111032e+03 16 P 9000 -1.892697e+02 -1.892697e+02 2.298086e-06 7.957388e+00 1.131024e+03 16 P 10000 -1.892697e+02 -1.892697e+02 2.298086e-06 8.718900e+00 1.146934e+03 16 Last 10001 -1.892697e+02 -1.892697e+02 2.298086e-06 8.724472e+00 1.146316e+03 16 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.892697e+02 -1.892697e+02 2.756902e-06 8.730844e+00 1.145479e+03 16 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -189.2697021019727 Dual Bound: -195.5972546906539 Dual Gap (relative): 0.03343140776579283 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 1128 Total time (s): 130.671 LMO calls / sec: 8.632366783754621 Nodes / sec: 0.45151563851198817 LMO calls / node: 19.11864406779661 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 [ Info: Polish solution Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.915427e+02 -1.861056e+02 5.437067e+00 2.921495e-02 2.029000e+01 1.478561e-01 7950 200 31 108 9 1 * 2 3 -1.915427e+02 -1.878431e+02 3.699557e+00 1.969493e-02 2.136600e+01 2.340167e-01 242 123 50 80 6 4 15 16 -1.897132e+02 -1.878431e+02 1.870095e+00 9.955621e-03 3.382900e+01 9.163735e-01 154 83 296 59 7 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 -1.056247e+02 -2.161334e+02 1.105087e+02 0.000000e+00 Inf 1 LD 2 -1.878431e+02 -1.878431e+02 0.000000e+00 1.645502e-01 1.215435e+01 1 Last 2 -1.878431e+02 -1.878431e+02 0.000000e+00 3.363171e-01 5.946769e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.878431e+02 -1.878431e+02 0.000000e+00 3.412596e-01 5.860641e+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: -187.8431307749545 Dual Bound: -189.71322578677865 Dual Gap (relative): 0.009955620970056285 Search Statistics. Total number of nodes processed: 31 Total number of lmo calls: 301 Total time (s): 36.019 LMO calls / sec: 8.356700630222939 Nodes / sec: 0.8606568755379106 LMO calls / node: 9.709677419354838 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.001387e+02 3.432287e+02 1.430900e+02 7.149539e-01 1.615600e+01 1.856895e-01 7720 178 27 95 5 0 100 43 3.247820e+02 3.432287e+02 1.844664e+01 5.679698e-02 3.049900e+01 4.688678e+00 112 55 1220 47 4 2 149 16 3.400280e+02 3.432287e+02 3.200705e+00 9.413063e-03 3.254000e+01 5.070682e+00 20 14 1464 2 1 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.432287e+02 3.432287e+02 0.000000e+00 1.185626e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.432287e+02 3.432287e+02 0.000000e+00 1.748465e-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: 343.2286645602107 Dual Bound: 340.02795981126724 Dual Gap (relative): 0.009413063416079092 Search Statistics. Total number of nodes processed: 165 Total number of lmo calls: 1468 Total time (s): 34.529 LMO calls / sec: 42.514987401894054 Nodes / sec: 4.778591908251035 LMO calls / node: 8.896969696969697 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.001387e+02 3.432287e+02 1.430900e+02 7.149539e-01 1.948500e+01 1.539646e-01 7848 177 27 95 7 0 100 33 3.215401e+02 3.432287e+02 2.168852e+01 6.745199e-02 7.241800e+01 1.836560e+00 9 7 1091 0 1 0 155 8 3.402643e+02 3.432287e+02 2.964359e+00 8.711931e-03 8.251600e+01 1.975374e+00 5 4 1351 0 1 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.432287e+02 3.432287e+02 0.000000e+00 1.095927e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.432287e+02 3.432287e+02 0.000000e+00 1.388790e-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: 343.2286645602107 Dual Bound: 340.2643052699881 Dual Gap (relative): 0.008711931414229553 Search Statistics. Total number of nodes processed: 163 Total number of lmo calls: 1355 Total time (s): 84.02 LMO calls / sec: 16.127112592239943 Nodes / sec: 1.940014282313735 LMO calls / node: 8.312883435582823 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 = 0xf506b7e838ad3891 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.998419e+01 1.129206e+01 3.127625e+01 Inf 1.853600e+01 1.618472e-01 9225 148 43 10001 23 5 * 2 3 -1.998419e+01 2.253511e+00 2.223770e+01 Inf 1.903000e+01 2.627430e-01 440 45 64 9318 23 11 100 101 -7.852483e+00 2.253511e+00 1.010599e+01 Inf 5.085000e+01 3.952802e+00 518 140 3356 10001 17 42 128 127 -7.233690e+00 2.253511e+00 9.487200e+00 Inf 6.000400e+01 4.249717e+00 53 36 4242 298 16 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 2.253510518332291 Dual Bound: -7.2336898720263925 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 255 Total number of lmo calls: 4242 Total time (s): 60.84 LMO calls / sec: 69.72386587771203 Nodes / sec: 4.191321499013807 LMO calls / node: 16.63529411764706 Total number of global tightenings: 13 Global tightenings / node: 0.1 Total number of local tightenings: 691 Local tightenings / node: 5.4 Total number of potential local tightenings: 1165 Time Limit Test seed = 0xeff1fb9804c96416 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 -9.499354e-01 0.000000e+00 9.499354e-01 Inf 1.740000e+01 1.724138e-01 9181 215 28 1906 12 4 33 0 0.000000e+00 0.000000e+00 0.000000e+00 0.000000e+00 1.882000e+01 1.753454e+00 2 2 434 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: 0.0 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 33 Total number of lmo calls: 434 Total time (s): 19.669 LMO calls / sec: 22.06517870761096 Nodes / sec: 1.6777670445879302 LMO calls / node: 13.151515151515152 Total number of global tightenings: 3 Global tightenings / node: 0.09 Total number of local tightenings: 43 Local tightenings / node: 1.3 Total number of potential local tightenings: 46 Strong Convexity and Sharpness Tests seed = 0x6eac4e518f5f3716 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.070239e+02 2.073884e+02 3.645736e-01 1.761022e-03 1.601800e+01 1.872893e-01 7137 0 11 14 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 207.38843509441458 Dual Bound: 207.02386145275764 Dual Gap (relative): 0.0017610223241832773 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 16.896 LMO calls / sec: 0.6510416666666666 Nodes / sec: 0.17755681818181818 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 17 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.970438e+02 1.970859e+02 4.211521e-02 2.137352e-04 1.400300e+01 2.142398e-01 5381 0 10 8 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 197.08593534379213 Dual Bound: 197.0438201386259 Dual Gap (relative): 0.0002137352246652389 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 10 Total time (s): 14.817 LMO calls / sec: 0.674900452183303 Nodes / sec: 0.2024701356549909 LMO calls / node: 3.3333333333333335 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 Branching Strategy Tests seed = 0xf399b5a0e085c622 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 1.635500e+01 1.834301e-01 7846 45 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.783100e+01 3.645337e+00 10 7 953 27 1 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): 18.692 LMO calls / sec: 50.98437834367644 Nodes / sec: 3.477423496683073 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.520000e-01 8.522727e+00 228 41 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.765000e+00 4.929178e+01 4 3 1015 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.382204160353686 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.766 LMO calls / sec: 574.7451868629671 Nodes / sec: 49.2638731596829 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.660000e-01 8.196721e+00 232 40 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.647000e+00 3.582271e+01 4 3 859 2 1 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.647 LMO calls / sec: 521.5543412264724 Nodes / sec: 35.82270795385549 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 251 42 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.741000e+00 4.307869e+01 11 7 902 27 10 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.742 LMO calls / sec: 517.7956371986223 Nodes / sec: 43.053960964408724 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.520000e-01 8.522727e+00 249 36 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.159000e+00 4.492821e+01 4 3 1174 2 1 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): 2.16 LMO calls / sec: 543.5185185185185 Nodes / sec: 44.907407407407405 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 5.190000e-01 5.780347e+00 516 70 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.810000e-01 1.021566e+01 104 41 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.052000e+00 1.045627e+01 169 52 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.557000e+00 2.103170e+01 90 38 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.015600e+01 2.136668e+01 67 27 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.632600e+01 2.456205e+01 54 27 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.260800e+01 2.640658e+01 52 21 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.871600e+01 2.761527e+01 56 25 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.430700e+01 2.818667e+01 37 27 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.990200e+01 2.854494e+01 71 32 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.458500e+01 2.855220e+01 16 11 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.837500e+01 2.829974e+01 8 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.149500e+01 2.767259e+01 10 7 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.410200e+01 2.718938e+01 32 14 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.643700e+01 2.648971e+01 13 9 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.823400e+01 2.594704e+01 13 8 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.990900e+01 2.532174e+01 22 14 26318 33 12 12 1304 215 2.748583e+01 2.836265e+01 8.768112e-01 3.190048e-02 6.000300e+01 2.531540e+01 8 5 26354 6 2 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.4858337907554 Dual Gap (relative): 0.03190047794527825 Search Statistics. Total number of nodes processed: 1519 Total number of lmo calls: 26354 Total time (s): 60.004 LMO calls / sec: 439.20405306312915 Nodes / sec: 25.31497900139991 LMO calls / node: 17.349572086899276 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2353 Local tightenings / node: 1.8 Total number of potential local tightenings: 5107 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.127000e+00 1.410437e+00 471 79 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.473000e+00 3.639304e+00 98 42 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.623000e+00 4.193671e+00 147 53 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.093800e+01 1.837630e+01 90 38 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.154100e+01 1.880253e+01 68 30 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.831900e+01 2.167149e+01 96 34 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.370000e+01 2.367089e+01 49 24 8396 223 5 6 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.875800e+01 2.479310e+01 28 16 10594 67 10 19 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.325300e+01 2.553153e+01 52 26 12514 245 1 0 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.744500e+01 2.635866e+01 29 17 14423 73 2 2 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 4.101000e+01 2.694465e+01 10 6 16134 16 8 7 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.463800e+01 2.735338e+01 7 5 17857 8 5 1 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.779800e+01 2.751161e+01 11 7 19379 12 5 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 5.050200e+01 2.778108e+01 13 8 20802 22 9 5 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 5.256800e+01 2.779257e+01 10 7 22010 10 5 1 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 5.439500e+01 2.792536e+01 8 5 23131 12 9 5 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.562300e+01 2.835158e+01 10 7 24076 18 5 4 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.669700e+01 2.859058e+01 8 5 24995 22 9 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.774700e+01 2.872877e+01 9 5 25874 36 9 12 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.853800e+01 2.868222e+01 4 3 26633 8 6 3 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.865400e+01 2.862550e+01 10 6 26740 41 12 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 58.654 LMO calls / sec: 455.89388617997065 Nodes / sec: 28.625498687216556 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 3.490000e-01 8.595989e+00 306 48 64 4885 36 6 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 8.390000e-01 1.549464e+01 66 25 256 696 19 22 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 4.110000e+00 3.138686e+01 37 15 2096 346 11 15 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 5.890000e+00 3.412564e+01 43 18 3186 412 13 6 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 9.903000e+00 4.049278e+01 50 23 6017 417 2 1 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 1.381900e+01 4.305666e+01 51 28 8679 179 9 3 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 1.867700e+01 4.095947e+01 16 10 11070 27 9 3 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 2.327100e+01 4.000688e+01 72 35 13344 339 17 8 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 2.763100e+01 3.912272e+01 55 22 15506 341 8 3 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.161500e+01 3.824134e+01 54 28 17444 229 10 6 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 3.536600e+01 3.774812e+01 6 4 19379 9 7 6 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 3.850400e+01 3.752857e+01 49 23 21026 246 8 7 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.153900e+01 3.704952e+01 37 21 22661 137 4 3 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 4.454500e+01 3.652486e+01 6 4 24161 6 4 6 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 4.677300e+01 3.606782e+01 14 9 25390 20 6 3 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 4.909200e+01 3.566773e+01 37 18 26657 170 13 4 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.083900e+01 3.530754e+01 8 6 27751 16 7 3 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.226000e+01 3.499809e+01 7 5 28707 8 8 4 1600 253 2.705726e+01 2.836265e+01 1.305388e+00 4.824539e-02 5.362200e+01 3.455671e+01 4 3 29538 6 3 3 1700 167 2.749886e+01 2.836265e+01 8.637814e-01 3.141153e-02 5.489200e+01 3.401224e+01 3 2 30350 3 2 1 1800 75 2.797765e+01 2.836265e+01 3.849984e-01 1.376093e-02 5.582700e+01 3.358590e+01 5 3 31067 6 8 3 1821 54 2.809262e+01 2.836265e+01 2.700204e-01 9.611791e-03 5.606200e+01 3.344511e+01 10 7 31241 16 10 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 56.067 LMO calls / sec: 557.2083400217597 Nodes / sec: 33.44213173524533 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.190000e-01 5.780347e+00 464 66 64 4885 2 2 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.439000e+00 1.681017e+01 87 37 678 489 23 5 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.203000e+00 1.966906e+01 58 30 968 257 17 12 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.795000e+00 2.578576e+01 14 7 2918 60 2 4 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.240200e+01 3.088212e+01 31 16 5197 153 21 2 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.622400e+01 3.494822e+01 22 12 7469 83 5 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.033300e+01 3.614813e+01 25 12 9610 131 7 3 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.470100e+01 3.696207e+01 38 17 11880 193 7 5 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.848600e+01 3.759742e+01 35 20 13971 113 6 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.207800e+01 3.812582e+01 20 12 15981 55 3 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.502100e+01 3.863396e+01 25 14 17719 139 13 1 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.709800e+01 3.970564e+01 10 6 19510 37 9 3 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 3.914300e+01 4.079912e+01 37 15 21254 396 7 4 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.079600e+01 4.154819e+01 7 4 22747 24 8 3 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.224100e+01 4.187874e+01 4 3 24101 6 4 1 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 4.363000e+01 4.192070e+01 10 6 25317 23 11 5 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 4.489700e+01 4.153952e+01 4 3 26374 10 5 1 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 4.595000e+01 4.119695e+01 10 7 27346 16 8 1 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 4.706000e+01 4.052274e+01 17 9 28188 61 3 1 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 4.787700e+01 4.012365e+01 3 2 29039 10 7 8 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 4.873700e+01 3.957979e+01 4 3 29805 14 8 2 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 4.926600e+01 3.919539e+01 4 3 30260 6 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.106101931570876 Dual Gap (relative): 0.009127665389483692 Search Statistics. Total number of nodes processed: 1931 Total number of lmo calls: 30260 Total time (s): 49.267 LMO calls / sec: 614.204234071488 Nodes / sec: 39.194592729413195 LMO calls / node: 15.67063697566028 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1888 Local tightenings / node: 1.01 Total number of potential local tightenings: 4439 Number of alternative decisions: 331 Number of stable decisions: 634 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.780000e-01 6.276151e+00 476 62 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.650000e-01 1.176471e+01 81 32 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.900000e-01 1.235955e+01 123 42 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.801000e+00 2.576593e+01 86 31 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.441000e+00 2.570785e+01 66 27 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.343400e+01 2.984964e+01 47 22 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.897300e+01 3.146577e+01 52 22 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.470400e+01 3.210006e+01 51 23 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.940600e+01 3.288445e+01 19 11 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.424000e+01 3.326519e+01 55 22 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.840500e+01 3.314673e+01 12 8 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.171100e+01 3.282108e+01 5 3 20396 14 8 12 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.397100e+01 3.245321e+01 56 22 21910 381 1 1 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 4.591300e+01 3.203886e+01 10 7 23162 19 11 10 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 4.771000e+01 3.141899e+01 34 17 24363 145 12 7 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 4.908800e+01 3.086294e+01 10 6 25359 25 10 8 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.033200e+01 3.033855e+01 31 14 26283 172 9 5 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.135900e+01 2.984871e+01 12 8 27090 27 10 9 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.197000e+01 2.953627e+01 6 4 27580 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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: 1535 Total number of lmo calls: 27580 Total time (s): 51.971 LMO calls / sec: 530.680571857382 Nodes / sec: 29.53570260337496 LMO calls / node: 17.96742671009772 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2409 Local tightenings / node: 1.64 Total number of potential local tightenings: 5193 Number of alternative decisions: 718 Number of stable decisions: 49 Minimum number of branchings per variable: 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: 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.460000e-01 6.726457e+00 443 60 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.240000e-01 1.243094e+01 76 29 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.440000e-01 1.303318e+01 118 38 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.120000e+00 2.475369e+01 87 35 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.691000e+00 2.496836e+01 65 26 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.402400e+01 2.859384e+01 30 14 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.886800e+01 3.164087e+01 50 18 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.355700e+01 3.366303e+01 46 20 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.810800e+01 3.440302e+01 17 9 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.270600e+01 3.482541e+01 51 20 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.652300e+01 3.485475e+01 13 8 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 3.996100e+01 3.425840e+01 7 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.277000e+01 3.331775e+01 8 6 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.490700e+01 3.275659e+01 29 12 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.684000e+01 3.191716e+01 9 6 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.795900e+01 3.150608e+01 11 7 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 4.925300e+01 3.080015e+01 13 8 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.033500e+01 3.025728e+01 9 6 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.087500e+01 2.993612e+01 5 4 27525 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 50.876 LMO calls / sec: 541.0213067065021 Nodes / sec: 29.935529522761225 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: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "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: 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 3.225000e+00 9.302326e-01 455 64 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.567000e+00 2.523129e+00 98 44 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.713000e+00 2.962564e+00 144 55 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.179300e+01 1.704401e+01 87 35 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.238000e+01 1.752827e+01 66 27 3485 420 10 10 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.856300e+01 2.149437e+01 71 29 6090 444 9 4 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.326400e+01 2.514615e+01 31 15 8720 225 8 5 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 2.770900e+01 2.695875e+01 63 28 11144 379 18 5 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.224800e+01 2.787770e+01 10 6 13355 21 11 7 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 3.571300e+01 2.830902e+01 55 22 15250 331 10 3 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 3.894600e+01 2.842397e+01 40 18 17024 329 12 3 800 363 2.539631e+01 2.836265e+01 2.966336e+00 1.168019e-01 4.045500e+01 2.874799e+01 11 6 18354 67 15 10 900 301 2.616952e+01 2.836265e+01 2.193126e+00 8.380461e-02 4.235500e+01 2.835557e+01 10 5 19533 32 11 9 1000 225 2.691767e+01 2.836265e+01 1.444975e+00 5.368128e-02 4.377900e+01 2.798145e+01 7 4 20674 8 4 4 1100 137 2.763514e+01 2.836265e+01 7.275008e-01 2.632520e-02 4.487000e+01 2.756853e+01 18 9 21524 68 13 10 1187 52 2.808687e+01 2.836265e+01 2.757701e-01 9.818469e-03 4.583900e+01 2.702939e+01 7 4 22214 14 10 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.0868749251736 Dual Gap (relative): 0.009818468625151686 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22214 Total time (s): 45.84 LMO calls / sec: 484.5986038394415 Nodes / sec: 27.02879581151832 LMO calls / node: 17.92897497982244 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2160 Local tightenings / node: 1.82 Total number of potential local tightenings: 4714 Decisions made: [(62, 1), (516, 0), (40, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "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: 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.120000e-01 5.859375e+00 510 63 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 1.140000e+00 7.894737e+00 158 44 192 1340 13 25 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 8.296000e+00 2.422854e+01 46 24 3219 200 6 6 * 118 119 1.406031e+01 2.836265e+01 1.430233e+01 1.017213e+00 9.353000e+00 2.533946e+01 36 16 3726 178 10 12 200 199 1.704058e+01 2.836265e+01 1.132207e+01 6.644180e-01 1.443100e+01 2.764881e+01 44 22 6070 226 3 0 300 287 1.921318e+01 2.836265e+01 9.149468e+00 4.762080e-01 1.994800e+01 2.942651e+01 46 21 8686 275 8 3 400 359 2.087523e+01 2.836265e+01 7.487411e+00 3.586743e-01 2.494400e+01 3.042816e+01 47 25 11090 152 12 0 500 397 2.261057e+01 2.836265e+01 5.752072e+00 2.543975e-01 2.957800e+01 3.032659e+01 31 16 13255 124 12 8 600 411 2.379062e+01 2.836265e+01 4.572023e+00 1.921775e-01 3.343000e+01 3.024230e+01 25 14 15181 90 13 10 700 393 2.462769e+01 2.836265e+01 3.734957e+00 1.516568e-01 3.655700e+01 2.989851e+01 8 5 16798 8 6 12 800 359 2.546045e+01 2.836265e+01 2.902200e+00 1.139886e-01 3.934300e+01 2.945886e+01 13 8 18259 20 8 10 900 299 2.628929e+01 2.836265e+01 2.073352e+00 7.886678e-02 4.144100e+01 2.893270e+01 44 22 19506 212 13 1 1000 217 2.696789e+01 2.836265e+01 1.394758e+00 5.171920e-02 4.302000e+01 2.828917e+01 8 5 20487 10 7 4 1100 135 2.755469e+01 2.836265e+01 8.079536e-01 2.932182e-02 4.433100e+01 2.785861e+01 10 6 21358 19 9 4 1199 40 2.811400e+01 2.836265e+01 2.486474e-01 8.844257e-03 4.546500e+01 2.725173e+01 5 3 22136 6 4 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.113997603576518 Dual Gap (relative): 0.008844257061358888 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22136 Total time (s): 45.466 LMO calls / sec: 486.8693089341486 Nodes / sec: 27.251132714555933 LMO calls / node: 17.866020984665052 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2101 Local tightenings / node: 1.75 Total number of potential local tightenings: 4676 Decisions made: [(70, 0), (526, 0), (23, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "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: 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.710000e-01 6.369427e+00 467 71 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 9.980000e-01 9.018036e+00 162 47 192 1340 13 25 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 8.695000e+00 2.311673e+01 52 28 3215 200 6 6 200 201 1.675948e+01 2.977156e+01 1.301208e+01 7.764012e-01 1.546500e+01 2.592952e+01 93 37 6123 607 11 16 * 220 219 1.746732e+01 2.836265e+01 1.089532e+01 6.237546e-01 1.668100e+01 2.643726e+01 35 18 6667 132 6 1 300 289 1.916299e+01 2.836265e+01 9.199655e+00 4.800741e-01 2.166500e+01 2.727902e+01 47 29 8782 119 14 1 400 369 2.094004e+01 2.836265e+01 7.422603e+00 3.544694e-01 2.736800e+01 2.817159e+01 14 9 11289 16 7 4 500 403 2.263394e+01 2.836265e+01 5.728704e+00 2.531024e-01 3.201400e+01 2.826888e+01 52 26 13362 246 7 3 600 415 2.372403e+01 2.836265e+01 4.638612e+00 1.955238e-01 3.624000e+01 2.806291e+01 15 9 15332 35 8 13 700 399 2.451924e+01 2.836265e+01 3.843403e+00 1.567505e-01 3.948000e+01 2.788754e+01 23 13 16953 87 7 0 800 381 2.538724e+01 2.836265e+01 2.975402e+00 1.172007e-01 4.264100e+01 2.774325e+01 14 8 18530 35 6 14 900 315 2.615751e+01 2.836265e+01 2.205134e+00 8.430215e-02 4.475100e+01 2.719492e+01 42 22 19747 152 13 2 1000 237 2.690654e+01 2.836265e+01 1.456107e+00 5.411720e-02 4.639500e+01 2.670546e+01 11 7 20774 16 8 3 1100 153 2.751278e+01 2.836265e+01 8.498667e-01 3.088989e-02 4.787300e+01 2.621519e+01 6 4 21697 6 3 0 1200 55 2.805099e+01 2.836265e+01 3.116569e-01 1.111037e-02 4.904100e+01 2.563161e+01 15 9 22486 33 14 7 1207 50 2.813525e+01 2.836265e+01 2.273973e-01 8.082294e-03 4.911200e+01 2.563528e+01 6 3 22531 6 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.13524768122234 Dual Gap (relative): 0.008082294023464538 Search Statistics. Total number of nodes processed: 1259 Total number of lmo calls: 22531 Total time (s): 49.113 LMO calls / sec: 458.7583735467188 Nodes / sec: 25.634760654001994 LMO calls / node: 17.895949166004765 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2158 Local tightenings / node: 1.79 Total number of potential local tightenings: 4822 Decisions made: [(69, 0), (525, 0), (35, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["binary", "most_infeasible", "pseudocost", "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: 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.740000e-01 5.226481e+00 470 72 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 1.021000e+00 8.814887e+00 96 42 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.161000e+00 9.474591e+00 138 51 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.423000e+00 2.133079e+01 98 43 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.006400e+01 2.156200e+01 70 30 3485 420 10 10 200 199 1.683575e+01 2.836265e+01 1.152689e+01 6.846676e-01 1.669600e+01 2.389794e+01 62 31 6088 268 9 4 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.319900e+01 2.521660e+01 53 26 8721 225 8 5 400 345 2.074936e+01 2.836265e+01 7.613288e+00 3.669168e-01 2.917300e+01 2.553731e+01 15 10 11151 18 5 3 500 397 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.428500e+01 2.616305e+01 12 8 13344 21 11 7 600 403 2.372371e+01 2.836265e+01 4.638934e+00 1.955400e-01 3.834000e+01 2.616067e+01 17 11 15206 26 8 7 700 409 2.456583e+01 2.836265e+01 3.796813e+00 1.545566e-01 4.253400e+01 2.607326e+01 47 27 17024 145 7 1 800 361 2.545401e+01 2.836265e+01 2.908639e+00 1.142704e-01 4.504600e+01 2.577365e+01 6 4 18324 10 11 6 900 297 2.625404e+01 2.836265e+01 2.108608e+00 8.031557e-02 4.742300e+01 2.524092e+01 8 5 19524 7 7 3 1000 221 2.693668e+01 2.836265e+01 1.425964e+00 5.293764e-02 4.952100e+01 2.465621e+01 22 14 20637 44 11 6 1100 129 2.773552e+01 2.836265e+01 6.271248e-01 2.261089e-02 5.090800e+01 2.414159e+01 15 10 21469 24 6 4 1175 56 2.809454e+01 2.836265e+01 2.681003e-01 9.542790e-03 5.196200e+01 2.369039e+01 17 11 22080 34 10 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.094544691537212 Dual Gap (relative): 0.009542789776853822 Search Statistics. Total number of nodes processed: 1231 Total number of lmo calls: 22080 Total time (s): 51.962 LMO calls / sec: 424.92590739386475 Nodes / sec: 23.690389130518454 LMO calls / node: 17.93663688058489 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2139 Local tightenings / node: 1.82 Total number of potential local tightenings: 4646 Decisions made: [(1, 0), (63, 0), (514, 0), (37, 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 39 running 1 of 1 signal (10): User defined signal 1 has_free_typevars at /source/src/jltypes.c:140 has_free_typevars at /source/src/jltypes.c:147 has_free_typevars at /source/src/jltypes.c:126 has_free_typevars at /source/src/jltypes.c:147 has_free_typevars at /source/src/jltypes.c:126 subtype_tuple_tail at /source/src/subtype.c:1293 [inlined] subtype_tuple at /source/src/subtype.c:1377 [inlined] subtype at /source/src/subtype.c:1551 exists_subtype at /source/src/subtype.c:1794 [inlined] forall_exists_subtype at /source/src/subtype.c:1823 ijl_types_equal at /source/src/subtype.c:2375 [inlined] ijl_types_equal at /source/src/subtype.c:2322 jl_specializations_get_linfo_ at /source/src/gf.c:198 #specialize_method#8 at ./runtime_internals.jl:1790 [inlined] specialize_method at ./runtime_internals.jl:1777 [inlined] #specialize_method#9 at ./runtime_internals.jl:1794 [inlined] specialize_method at ./runtime_internals.jl:1793 [inlined] #analyze_method!#191 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:903 analyze_method! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:870 [inlined] #handle_call_result!#194 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1373 handle_call_result! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1362 [inlined] #handle_any_call_result!#192 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1269 handle_any_call_result! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1258 [inlined] compute_inlining_cases at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1322 handle_call! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1354 [inlined] assemble_inline_todo! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1601 ssa_inlining_pass! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:76 [inlined] run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1035 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1048 [inlined] optimize at ./../usr/share/julia/Compiler/src/optimize.jl:1021 jfptr_optimize_85384.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 finish_nocycle at ./../usr/share/julia/Compiler/src/typeinfer.jl:278 jfptr_finish_nocycle_88646.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4502 typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1527 typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1704 [inlined] typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1713 jfptr_typeinf_ext_toplevel_87781.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] jl_type_infer at /source/src/gf.c:463 jl_compile_method_internal at /source/src/gf.c:3636 _jl_invoke at /source/src/gf.c:4108 [inlined] ijl_apply_generic at /source/src/gf.c:4313 solve at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/interface.jl:28 unknown function (ip: 0x70c0ebb68d1d) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 include_string at ./loading.jl:3000 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3060 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_44862.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 include_string at ./loading.jl:3000 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3060 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_44862.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 exec_options at ./client.jl:310 _start at ./client.jl:577 jfptr__start_69940.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x70c0ed43a249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== Boscia Algorithm. Parameter settings. ====================================================================================== 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 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_41114.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] start_task at /source/src/task.c:1272 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 Tree traversal strategy: Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000070c0d33fc010 Total snapshots: 97. Utilization: 100% ╎97 @Base/client.jl:577 _start() ╎ 97 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 97 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 97 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ 97 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path::Str… ╎ 97 @Base/loading.jl:3060 _include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 97 @Base/loading.jl:3000 include_string(mapexpr::typeof(identity), mo… ╎ ╎ 97 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 97 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ ╎ 97 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path… ╎ ╎ 97 @Base/loading.jl:3060 _include(mapexpr::Function, mod::Module,… ╎ ╎ ╎ 97 @Base/loading.jl:3000 include_string(mapexpr::typeof(identity… ╎ ╎ ╎ 97 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 97 @Boscia/…terface.jl:28 kwcall(::@NamedTuple{settings::@Name… ╎ ╎ ╎ 97 @Compiler/…nfer.jl:1713 typeinf_ext_toplevel(mi::Core.Meth… ╎ ╎ ╎ 97 @Compiler/…nfer.jl:1704 typeinf_ext_toplevel ╎ ╎ ╎ ╎ 97 @Compiler/…fer.jl:1527 typeinf_ext(interp::Compiler.Nati… ╎ ╎ ╎ ╎ 2 @Compiler/…ion.jl:4486 typeinf(interp::Compiler.NativeI… ╎ ╎ ╎ ╎ 2 @Compiler/…te.jl:1206 doworkloop(interp::Compiler.Nati… ╎ ╎ ╎ ╎ 2 @Compiler/…on.jl:321 (::Compiler.var"#infercalls#abst… ╎ ╎ ╎ ╎ 2 @Compiler/…on.jl:305 (::Compiler.var"#infercalls2#ab… ╎ ╎ ╎ ╎ ╎ 2 @Base/…rnals.jl:1793 specialize_method ╎ ╎ ╎ ╎ ╎ 2 @Base/…rnals.jl:1794 #specialize_method#9 ╎ ╎ ╎ ╎ ╎ 2 @Base/…nals.jl:1777 specialize_method 2╎ ╎ ╎ ╎ ╎ 2 @Base/…nals.jl:1788 #specialize_method#8 ╎ ╎ ╎ ╎ 63 @Compiler/…ion.jl:4495 typeinf(interp::Compiler.NativeI… ╎ ╎ ╎ ╎ 63 @Compiler/…on.jl:4338 typeinf_local(interp::Compiler.N… ╎ ╎ ╎ ╎ 63 @Compiler/…on.jl:3789 abstract_eval_basic_statement ╎ ╎ ╎ ╎ 63 @Compiler/…on.jl:3832 abstract_eval_basic_statement ╎ ╎ ╎ ╎ ╎ 63 @Compiler/…n.jl:3433 abstract_eval_statement_expr(i… ╎ ╎ ╎ ╎ ╎ 63 @Compiler/…n.jl:3075 abstract_eval_call ╎ ╎ ╎ ╎ ╎ 63 @Compiler/….jl:3057 abstract_call(interp::Compile… ╎ ╎ ╎ ╎ ╎ 63 @Compiler/….jl:2897 abstract_call ╎ ╎ ╎ ╎ ╎ 63 @Compiler/….jl:2904 abstract_call(interp::Compi… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:2795 abstract_call_known(interp:… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:55 argtypes_to_type(argtypes::… ╎ ╎ ╎ ╎ ╎ ╎ 62 @Compiler/…jl:2796 abstract_call_known(interp:… ╎ ╎ ╎ ╎ ╎ ╎ 62 @Compiler/…jl:328 abstract_call_gf_by_type(in… ╎ ╎ ╎ ╎ ╎ ╎ 23 @Compiler/…jl:166 (::Compiler.var"#infercall… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:611 abstract_call_method(inter… ╎ ╎ ╎ ╎ ╎ ╎ 22 @Compiler/…l:725 abstract_call_method(inter… ╎ ╎ ╎ ╎ ╎ ╎ 22 @Compiler/…l:1109 typeinf_edge(interp::Com… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 22 @Base/…ls.jl:1777 specialize_method 22╎ ╎ ╎ ╎ ╎ ╎ ╎ 22 @Base/…ls.jl:1790 #specialize_method#8 ╎ ╎ ╎ ╎ ╎ ╎ 20 @Compiler/…jl:247 (::Compiler.var"#infercall… ╎ ╎ ╎ ╎ ╎ ╎ 20 @Compiler/…l:177 (::Compiler.var"#handle1#a… ╎ ╎ ╎ ╎ ╎ ╎ 20 @Compiler/…l:858 abstract_call_method_with… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 20 @Compiler/…l:875 abstract_call_method_wit… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 20 @Compiler/…l:1045 maybe_get_const_prop_p… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 20 @Base/…ls.jl:1793 specialize_method ╎ ╎ ╎ ╎ ╎ ╎ ╎ 20 @Base/…ls.jl:1794 #specialize_method#9 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 20 @Base/…ls.jl:1777 specialize_method 20╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 20 @Base/…ls.jl:1790 #specialize_method… ╎ ╎ ╎ ╎ ╎ ╎ 19 @Compiler/…jl:321 (::Compiler.var"#infercall… ╎ ╎ ╎ ╎ ╎ ╎ 19 @Compiler/…l:305 (::Compiler.var"#infercall… ╎ ╎ ╎ ╎ ╎ ╎ 19 @Base/…ls.jl:1793 specialize_method ╎ ╎ ╎ ╎ ╎ ╎ ╎ 19 @Base/…ls.jl:1794 #specialize_method#9 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 19 @Base/…ls.jl:1777 specialize_method 19╎ ╎ ╎ ╎ ╎ ╎ ╎ 19 @Base/…ls.jl:1788 #specialize_method#8 ╎ ╎ ╎ ╎ 32 @Compiler/…ion.jl:4502 typeinf(interp::Compiler.NativeI… ╎ ╎ ╎ ╎ 30 @Compiler/…fer.jl:278 finish_nocycle(interp::Compiler.… ╎ ╎ ╎ ╎ 30 @Compiler/…ze.jl:1021 optimize(interp::Compiler.Nativ… ╎ ╎ ╎ ╎ 30 @Compiler/…ze.jl:1048 run_passes_ipo_safe ╎ ╎ ╎ ╎ ╎ 30 @Compiler/…e.jl:1035 run_passes_ipo_safe(ci::Core.C… ╎ ╎ ╎ ╎ ╎ 24 @Compiler/…g.jl:76 ssa_inlining_pass! ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:1568 assemble_inline_todo!(ir::Com… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:1211 process_simple!(todo::Vector… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:1022 call_sig(ir::Compiler.IRCod… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:479 argextype ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:479 argextype ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:518 argextype(x::Any, src::Com… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3582 abstract_eval_globalref_t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3713 abstract_load_all_consis… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3698 scan_leaf_partitions ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3677 scan_specified_partiti… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:3636 abstract_eval_partiti… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:346 is_mutation_free_argt… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:348 is_mutation_free_type ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:959 ismutationfree ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:945 datatype_ismutatio… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…on.jl:637 == ╎ ╎ ╎ ╎ ╎ 23 @Compiler/….jl:1601 assemble_inline_todo!(ir::Com… ╎ ╎ ╎ ╎ ╎ 23 @Compiler/….jl:1354 handle_call! ╎ ╎ ╎ ╎ ╎ 23 @Compiler/….jl:1322 compute_inlining_cases(info… ╎ ╎ ╎ ╎ ╎ ╎ 23 @Compiler/…jl:1258 handle_any_call_result! ╎ ╎ ╎ ╎ ╎ ╎ 23 @Compiler/…jl:1269 handle_any_call_result!(ca… ╎ ╎ ╎ ╎ ╎ ╎ 23 @Compiler/…l:1362 handle_call_result! ╎ ╎ ╎ ╎ ╎ ╎ 23 @Compiler/…l:1373 handle_call_result!(cases… ╎ ╎ ╎ ╎ ╎ ╎ 23 @Compiler/…l:870 analyze_method! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 21 @Compiler/…l:903 analyze_method!(call_res… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 21 @Base/…ls.jl:1793 specialize_method ╎ ╎ ╎ ╎ ╎ ╎ ╎ 21 @Base/…ls.jl:1794 #specialize_method#9 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 21 @Base/…ls.jl:1777 specialize_method 21╎ ╎ ╎ ╎ ╎ ╎ ╎ 21 @Base/…ls.jl:1790 #specialize_method#8 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:904 analyze_method!(call_res… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:851 resolve_todo(mi::Core.M… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…l:916 retrieve_ir_for_inlini… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…pr.jl:88 copy(c::Core.CodeInfo) ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:385 copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ry.jl:139 unsafe_copyto! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…em.jl:28 memmove ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…pr.jl:0 copy_exprs(x::Any) ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…g.jl:79 ssa_inlining_pass! ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…g.jl:663 batch_inline!(ir::Compiler.IR… ╎ ╎ ╎ ╎ ╎ 2 @Compiler/….jl:438 ir_inline_item!(compact::Comp… ╎ ╎ ╎ ╎ ╎ 2 @Compiler/….jl:1871 iterate 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1877 iterate_compact(compact::Co… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1949 iterate_compact(compact::Co… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1535 process_node!(compact::Com… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:1352 renumber_ssa2!(stmt::Any, … ╎ ╎ ╎ ╎ ╎ 2 @Compiler/…r.jl:2146 compact! ╎ ╎ ╎ ╎ ╎ 2 @Compiler/….jl:2148 compact!(code::Compiler.IRCod… ╎ ╎ ╎ ╎ ╎ 2 @Compiler/….jl:1871 iterate ╎ ╎ ╎ ╎ ╎ 2 @Compiler/….jl:1949 iterate_compact(compact::Co… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1460 process_node!(compact::Comp… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:319 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…als.jl:965 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1641 process_node!(compact::Comp… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…s.jl:2152 adce_pass!(ir::Compiler.IRCod… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:1871 iterate ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:1949 iterate_compact(compact::Com… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:1505 process_node!(compact::Comp… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:1394 kill_edge!(compact::Compile… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:0 domtree_delete_edge!(domtree… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…jl:259 update_domtree! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…l:345 SNCA!(domtree::Compiler.Ge… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:385 copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ry.jl:139 unsafe_copyto! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…em.jl:28 memmove ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…s.jl:1407 sroa_pass!(ir::Compiler.IRCod… ╎ ╎ ╎ ╎ ╎ 1 @Compiler/…s.jl:582 lift_comparison! 1╎ ╎ ╎ ╎ ╎ 1 @Compiler/….jl:604 lift_comparison_leaves!(tfunc… ╎ ╎ ╎ ╎ 2 @Compiler/…fer.jl:285 finish_nocycle(interp::Compiler.… ╎ ╎ ╎ ╎ 2 @Compiler/…er.jl:181 finish!(interp::Compiler.NativeI… 2╎ ╎ ╎ ╎ 2 @Compiler/…er.jl:805 store_backedges(caller::Core.Co… 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: 10 Number of integer variables: 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ┌ 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 0x00007d93885f9b40 Total snapshots: 343. Utilization: 0% ╎343 @Base/task.jl:1168 wait_forever() 342╎ 343 @Base/task.jl:1246 wait() [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 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 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_41114.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] start_task at /source/src/task.c:1272 unknown function (ip: (nil)) at (unknown file) Allocations: 28061379 (Pool: 28060709; Big: 670); GC: 22 [39] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/Kl8FO/test/branching_strategy_test.jl:379 _ZN4llvm8RAGreedy19addSplitConstraintsENS_17InterferenceCache6CursorERNS_14BlockFrequencyE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm8RAGreedy33calculateRegionSplitCostAroundRegEtRNS_15AllocationOrderERNS_14BlockFrequencyERjS5_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm8RAGreedy14tryRegionSplitERKNS_12LiveIntervalERNS_15AllocationOrderERNS_15SmallVectorImplINS_8RegisterEEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm8RAGreedy8trySplitERKNS_12LiveIntervalERNS_15AllocationOrderERNS_15SmallVectorImplINS_8RegisterEEERKNS_8SmallSetIS7_Lj16ESt4lessIS7_EEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm8RAGreedy17selectOrSplitImplERKNS_12LiveIntervalERNS_15SmallVectorImplINS_8RegisterEEERNS_8SmallSetIS5_Lj16ESt4lessIS5_EEERNS_11SmallVectorISt4pairIPS2_NS_10MCRegisterEELj8EEEj at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm8RAGreedy13selectOrSplitERKNS_12LiveIntervalERNS_15SmallVectorImplINS_8RegisterEEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm12RegAllocBase16allocatePhysRegsEv at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm8RAGreedy20runOnMachineFunctionERNS_15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm19MachineFunctionPass13runOnFunctionERNS_8FunctionE.part.0 at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm13FPPassManager13runOnFunctionERNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm13FPPassManager11runOnModuleERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm6legacy15PassManagerImpl3runERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) operator() at /source/src/jitlayers.cpp:1623 addModule at /source/src/jitlayers.cpp:2114 jl_compile_codeinst_now at /source/src/jitlayers.cpp:682 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:876 jl_compile_method_internal at /source/src/gf.c:3648 _jl_invoke at /source/src/gf.c:4108 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/interface.jl:270 unknown function (ip: 0x70c0b4f777f9) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 solve at /home/pkgeval/.julia/packages/Boscia/Kl8FO/src/interface.jl:28 unknown function (ip: 0x70c0ebb68d1d) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 include_string at ./loading.jl:3000 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3060 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_44862.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 include_string at ./loading.jl:3000 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3060 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_44862.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 exec_options at ./client.jl:310 _start at ./client.jl:577 jfptr__start_69940.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x70c0ed43a249) 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: 5032742296 (Pool: 5032738374; Big: 3922); GC: 2522 PkgEval terminated after 2725.99s: test duration exceeded the time limit