Package evaluation to test Boscia on Julia 1.14.0-DEV.1299 (6d6224db99*) started at 2025-11-25T18:35:34.441 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.33s ################################################################################ # 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.13.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.17.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 5.46s ################################################################################ # 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... 1579.9 ms ✓ Bonobo 5053.2 ms ✓ SpecialFunctions 4150.6 ms ✓ SpecialFunctions → SpecialFunctionsChainRulesCoreExt 6720.5 ms ✓ ForwardDiff 3713.4 ms ✓ ForwardDiff → ForwardDiffStaticArraysExt 79604.1 ms ✓ MathOptInterface 10702.9 ms ✓ MathOptSetDistances 35818.0 ms ✓ FrankWolfe 13717.9 ms ✓ Boscia 9 dependencies successfully precompiled in 162 seconds. 91 already precompiled. Precompilation completed after 174.04s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_BNdYsn/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_BNdYsn/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.4 [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.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.17.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 = 0x0af67b7584457f2a [ 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 = 0x433dded2bb813265 Indicator Tests Heuristics Tests seed = 0x181422833e76ea59 Sparse Regression Tests seed = 0x3e4be18eb58d4174 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 4.224547e+00 4.490417e+00 2.658701e-01 6.293459e-02 1.915600e+01 1.566089e-01 7831 76 17 21 5 1 35 6 4.447789e+00 4.490417e+00 4.262762e-02 9.584003e-03 2.334700e+01 1.756114e+00 38 28 184 6 6 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.130285e+01 -5.306899e-02 1.135592e+01 0.000000e+00 Inf 1 LD 2 4.490417e+00 4.490417e+00 0.000000e+00 1.857877e+00 1.076498e+00 1 Last 2 4.490417e+00 4.490417e+00 0.000000e+00 2.027842e+00 9.862703e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 4.490417e+00 4.490417e+00 0.000000e+00 2.031842e+00 9.843285e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 4.490416857614951 Dual Bound: 4.447789233725311 Dual Gap (relative): 0.009584002669554673 Search Statistics. Total number of nodes processed: 41 Total number of lmo calls: 189 Total time (s): 27.264 LMO calls / sec: 6.932218309859155 Nodes / sec: 1.5038145539906103 LMO calls / node: 4.609756097560975 Total number of global tightenings: 38 Global tightenings / node: 1.09 Total number of local tightenings: 48 Local tightenings / node: 1.37 Total number of potential local tightenings: 48 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.815734e+00 3.908228e+00 1.092494e+00 3.879960e-01 1.607200e+01 1.866600e-01 7627 292 42 102 23 1 * 3 4 2.859474e+00 3.903663e+00 1.044189e+00 3.651681e-01 1.635500e+01 4.280037e-01 93 72 80 29 15 0 100 51 3.473554e+00 3.903663e+00 4.301090e-01 1.238239e-01 2.343400e+01 6.443629e+00 30 22 1102 23 13 1 200 51 3.596418e+00 3.903663e+00 3.072445e-01 8.543070e-02 2.605300e+01 9.634207e+00 30 22 1541 24 14 2 300 49 3.667683e+00 3.903663e+00 2.359799e-01 6.434031e-02 2.863000e+01 1.219001e+01 24 17 1959 23 11 2 400 49 3.732262e+00 3.903663e+00 1.714012e-01 4.592420e-02 3.127600e+01 1.435606e+01 31 22 2406 20 14 2 500 49 3.782523e+00 3.903663e+00 1.211397e-01 3.202617e-02 3.398400e+01 1.615466e+01 38 28 2863 33 13 3 600 49 3.823586e+00 3.903663e+00 8.007710e-02 2.094293e-02 3.672600e+01 1.767140e+01 32 23 3338 21 9 0 699 44 3.866863e+00 3.903663e+00 3.680034e-02 9.516847e-03 3.921100e+01 1.894876e+01 8 6 3812 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 9.066381e+00 1.095842e+00 7.970539e+00 0.000000e+00 Inf 1 LD 2 3.903663e+00 3.903663e+00 0.000000e+00 1.560007e-01 1.282045e+01 1 Last 2 3.903663e+00 3.903663e+00 0.000000e+00 3.137871e-01 6.373749e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.903663e+00 3.903663e+00 0.000000e+00 3.173010e-01 6.303163e+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.9036629894048644 Dual Bound: 3.8668626484061996 Dual Gap (relative): 0.009516847207860554 Search Statistics. Total number of nodes processed: 743 Total number of lmo calls: 3817 Total time (s): 41.269 LMO calls / sec: 92.49073154183527 Nodes / sec: 18.003828539581768 LMO calls / node: 5.137281292059219 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Non zero entries: 7th entry: 0.15760445702971318 35th entry: 0.15760445702971318 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.948555e+00 3.908228e+00 9.596733e-01 3.254724e-01 3.220000e-01 9.316770e+00 316 258 42 102 23 1 * 3 4 2.985310e+00 3.903663e+00 9.183528e-01 3.076239e-01 6.160000e-01 1.136364e+01 117 66 80 29 15 0 100 25 3.570246e+00 3.903663e+00 3.334171e-01 9.338772e-02 7.536000e+00 1.658705e+01 33 24 1133 23 14 3 200 24 3.751748e+00 3.903663e+00 1.519152e-01 4.049185e-02 1.143500e+01 1.958898e+01 28 20 1818 25 14 1 300 22 3.856020e+00 3.903663e+00 4.764276e-02 1.235542e-02 1.528300e+01 2.106916e+01 38 28 2547 20 5 0 309 21 3.865213e+00 3.903663e+00 3.845032e-02 9.947789e-03 1.564000e+01 2.109974e+01 28 20 2611 32 13 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.066381e+00 1.095842e+00 7.970539e+00 0.000000e+00 Inf 1 LD 2 3.903663e+00 3.903663e+00 0.000000e+00 1.193789e-03 1.675338e+03 1 Last 2 3.903663e+00 3.903663e+00 0.000000e+00 8.329580e-03 2.401081e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.903663e+00 3.903663e+00 0.000000e+00 1.219862e-02 1.639529e+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.9036629894048644 Dual Bound: 3.8652126694528355 Dual Gap (relative): 0.00994778896796694 Search Statistics. Total number of nodes processed: 330 Total number of lmo calls: 2616 Total time (s): 15.67 LMO calls / sec: 166.94320357370773 Nodes / sec: 21.059349074664965 LMO calls / node: 7.927272727272728 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Poisson Tests seed = 0x9ea0f25586d9ff9a Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -3.307605e+03 -3.261006e+03 4.659935e+01 1.428987e-02 1.684100e+01 1.781367e-01 8588 124 42 710 12 7 * 4 5 -3.302108e+03 -3.262397e+03 3.971120e+01 1.217240e-02 1.903700e+01 4.727636e-01 888 101 123 551 11 12 * 17 18 -3.295857e+03 -3.271579e+03 2.427870e+01 7.421097e-03 2.843600e+01 1.230834e+00 516 76 427 304 8 12 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.891821e+03 -3.917783e+03 7.809604e+03 0.000000e+00 Inf 1 LD 2 -3.271663e+03 -3.439792e+03 1.681283e+02 1.689469e-01 1.183804e+01 2 LD 5 -3.272477e+03 -3.355468e+03 8.299169e+01 4.416940e-01 1.132005e+01 2 LD 7 -3.272554e+03 -3.311520e+03 3.896558e+01 4.466368e-01 1.567269e+01 2 LD 13 -3.273087e+03 -3.289151e+03 1.606409e+01 4.588323e-01 2.833279e+01 2 LD 24 -3.273882e+03 -3.279403e+03 5.520917e+00 4.773967e-01 5.027265e+01 2 LD 26 -3.273904e+03 -3.273904e+03 1.079286e-09 4.821240e-01 5.392804e+01 2 Last 26 -3.273904e+03 -3.273904e+03 1.079286e-09 5.170201e-01 5.028818e+01 2 ---------------------------------------------------------------------------------------------------------------- PP 26 -3.273904e+03 -3.273904e+03 1.079286e-09 5.203554e-01 4.996585e+01 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -3273.9042622869374 Dual Bound: -3295.857418110401 Dual Gap (relative): 0.006705497187669264 Search Statistics. Total number of nodes processed: 35 Total number of lmo calls: 440 Total time (s): 30.816 LMO calls / sec: 14.278296988577363 Nodes / sec: 1.1357736240913812 LMO calls / node: 12.571428571428571 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.377799e+03 -2.376012e+03 1.787436e+00 7.522841e-04 1.761600e+01 1.702997e-01 6072 35 6 4 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.228554e+03 -2.408763e+03 1.180209e+03 0.000000e+00 Inf 1 LD 2 -2.376012e+03 -2.376012e+03 0.000000e+00 1.661437e-01 1.203778e+01 1 Last 2 -2.376012e+03 -2.376012e+03 0.000000e+00 3.426381e-01 5.837063e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.376012e+03 -2.376012e+03 0.000000e+00 3.475125e-01 5.755189e+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: -2376.012043401864 Dual Bound: -2377.7994794583155 Dual Gap (relative): 0.0007522840893905273 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 19.9 LMO calls / sec: 0.5527638190954774 Nodes / sec: 0.15075376884422112 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.853027e+02 3.364407e+02 1.511380e+02 8.156272e-01 1.543300e+01 1.943886e-01 7153 175 27 71 9 0 * 7 8 2.200463e+02 3.342799e+02 1.142336e+02 5.191346e-01 1.690300e+01 8.874164e-01 221 119 144 72 4 1 100 73 3.000160e+02 3.342799e+02 3.426392e+01 1.142070e-01 3.021600e+01 5.725443e+00 43 34 1370 5 2 2 200 39 3.251445e+02 3.342799e+02 9.135385e+00 2.809638e-02 3.601600e+01 6.635940e+00 20 15 1991 2 1 0 225 22 3.310173e+02 3.342799e+02 3.262650e+00 9.856435e-03 3.681500e+01 6.709222e+00 12 9 2090 0 1 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 ---------------------------------------------------------------------------------------------------------------- Last 0 3.342799e+02 3.342799e+02 0.000000e+00 1.108229e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.342799e+02 3.342799e+02 0.000000e+00 1.840700e-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: 334.2799190896349 Dual Bound: 331.01726884440956 Dual Gap (relative): 0.009856435154018886 Search Statistics. Total number of nodes processed: 247 Total number of lmo calls: 2094 Total time (s): 38.858 LMO calls / sec: 53.88851716506254 Nodes / sec: 6.3564774306449126 LMO calls / node: 8.477732793522268 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.853027e+02 3.364407e+02 1.511380e+02 8.156272e-01 1.868500e+01 1.605566e-01 7684 171 27 71 10 0 * 8 9 2.153174e+02 3.361653e+02 1.208480e+02 5.612550e-01 2.632300e+01 6.458230e-01 180 100 158 49 4 0 * 21 18 2.388439e+02 3.342799e+02 9.543597e+01 3.995746e-01 3.666700e+01 1.063627e+00 118 66 342 55 4 0 100 71 2.981607e+02 3.342799e+02 3.611917e+01 1.211399e-01 8.289000e+01 2.062975e+00 50 33 1233 15 1 0 200 51 3.208527e+02 3.342799e+02 1.342718e+01 4.184842e-02 1.053680e+02 2.382127e+00 18 13 1758 2 2 0 251 14 3.322073e+02 3.342799e+02 2.072582e+00 6.238820e-03 1.093170e+02 2.424143e+00 7 5 1929 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.342799e+02 3.342799e+02 0.000000e+00 1.290563e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.342799e+02 3.342799e+02 0.000000e+00 1.816697e-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: 334.2799190896349 Dual Bound: 332.20733733907923 Dual Gap (relative): 0.006238819910350838 Search Statistics. Total number of nodes processed: 265 Total number of lmo calls: 1933 Total time (s): 111.382 LMO calls / sec: 17.354689267565675 Nodes / sec: 2.3791995115907416 LMO calls / node: 7.29433962264151 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 = 0xef0d8fa06af63631 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.075694e+01 4.275012e+01 5.350706e+01 Inf 1.535800e+01 1.953379e-01 7617 140 42 5487 18 6 * 2 3 -1.075694e+01 3.620244e+01 4.695938e+01 Inf 1.571500e+01 3.181674e-01 354 68 76 8967 20 21 100 55 2.527168e+01 3.620244e+01 1.093076e+01 4.325299e-01 3.142700e+01 4.932065e+00 304 69 2581 8224 16 4 183 4 3.604449e+01 3.620244e+01 1.579519e-01 4.382139e-03 3.617600e+01 5.169173e+00 77 60 3974 206 14 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 36.202439461406634 Dual Bound: 36.04448751512054 Dual Gap (relative): 0.0043821387728105975 Search Statistics. Total number of nodes processed: 187 Total number of lmo calls: 3974 Total time (s): 36.896 LMO calls / sec: 107.7081526452732 Nodes / sec: 5.068300086730269 LMO calls / node: 21.25133689839572 Total number of global tightenings: 23 Global tightenings / node: 0.13 Total number of local tightenings: 697 Local tightenings / node: 3.81 Total number of potential local tightenings: 858 Time Limit Test seed = 0x26089ca7478e3d32 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -5.538532e+00 -5.372348e+00 1.661830e-01 3.093303e-02 1.752600e+01 1.711743e-01 9748 675 25 9748 4 9 11 4 -5.418839e+00 -5.372348e+00 4.649006e-02 8.653582e-03 2.053400e+01 7.304958e-01 79 62 187 308 5 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -5.372348495963825 Dual Bound: -5.418838554169213 Dual Gap (relative): 0.00865358199311063 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 187 Total time (s): 21.453 LMO calls / sec: 8.716729594928449 Nodes / sec: 0.6992029086841002 LMO calls / node: 12.466666666666667 Total number of global tightenings: 5 Global tightenings / node: 0.45 Total number of local tightenings: 39 Local tightenings / node: 3.55 Total number of potential local tightenings: 68 Strong Convexity and Sharpness Tests seed = 0x908f4f1e3dc5e5ad Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 0 2.169028e+02 2.169028e+02 0.000000e+00 0.000000e+00 1.337700e+01 7.475518e-02 5498 0 4 2 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 216.90276097649897 Dual Bound: 216.90276097649897 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 4 Total time (s): 14.201 LMO calls / sec: 0.2816703049081051 Nodes / sec: 0.07041757622702627 LMO calls / node: 4.0 Total number of global tightenings: 10 Global tightenings / node: 10.0 Total number of local tightenings: 10 Local tightenings / node: 10.0 Total number of potential local tightenings: 20 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.998827e+02 1.998866e+02 3.897392e-03 1.949839e-05 1.381800e+01 2.171081e-01 5396 0 6 4 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 199.88664557302093 Dual Bound: 199.8827481811508 Dual Gap (relative): 1.9498390459430774e-5 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 6 Total time (s): 14.699 LMO calls / sec: 0.4081910334036329 Nodes / sec: 0.20409551670181644 LMO calls / node: 2.0 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 = 0x7eabac685549e316 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.673000e+01 1.793186e-01 8064 54 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.834600e+01 3.543007e+00 11 8 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): 19.222 LMO calls / sec: 49.578607845177395 Nodes / sec: 3.3815419831443134 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.560000e-01 8.426966e+00 227 46 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.918000e+00 4.535975e+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.919 LMO calls / sec: 528.92131318395 Nodes / sec: 45.33611255862428 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.530000e-01 8.498584e+00 220 40 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.594000e+00 3.701380e+01 4 2 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.595 LMO calls / sec: 538.5579937304076 Nodes / sec: 36.990595611285265 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.590000e-01 8.356546e+00 214 39 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.721000e+00 4.357931e+01 12 8 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.722 LMO calls / sec: 523.8095238095239 Nodes / sec: 43.55400696864112 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.860000e-01 7.772021e+00 279 41 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 2.039000e+00 4.757234e+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.04 LMO calls / sec: 575.4901960784314 Nodes / sec: 47.549019607843135 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.680000e-01 6.410256e+00 465 77 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.930000e-01 1.134931e+01 97 41 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.420000e-01 1.167728e+01 146 51 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.066000e+00 2.217075e+01 98 45 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.701000e+00 2.236883e+01 72 32 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.575700e+01 2.544901e+01 48 24 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.170300e+01 2.750772e+01 53 23 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.741000e+01 2.893105e+01 54 26 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.259000e+01 2.967168e+01 21 13 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.825000e+01 2.977778e+01 62 27 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.258800e+01 2.989105e+01 14 9 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.622500e+01 2.961601e+01 7 4 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.913200e+01 2.900350e+01 12 8 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.075800e+01 2.898065e+01 18 8 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.237700e+01 2.854306e+01 10 7 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.387700e+01 2.804536e+01 14 9 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.525300e+01 2.745552e+01 14 9 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.648800e+01 2.696148e+01 11 7 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.716700e+01 2.664124e+01 7 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): 57.168 LMO calls / sec: 481.475650713686 Nodes / sec: 26.640778057654632 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.164000e+00 1.386322e+00 480 76 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.600000e+00 3.461538e+00 99 44 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.745000e+00 4.007286e+00 142 53 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.097700e+01 1.831101e+01 91 39 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.161800e+01 1.867791e+01 68 29 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.845600e+01 2.151062e+01 134 34 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.373700e+01 2.363399e+01 49 24 8396 223 5 6 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.889800e+01 2.467299e+01 29 19 10594 67 10 19 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.292300e+01 2.578744e+01 50 26 12514 245 1 0 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.693100e+01 2.672552e+01 27 16 14423 73 2 2 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 4.041800e+01 2.733930e+01 10 6 16134 16 8 7 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.398700e+01 2.775820e+01 7 5 17857 8 5 1 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.701300e+01 2.797099e+01 11 7 19379 12 5 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.957900e+01 2.829827e+01 18 12 20802 22 9 5 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 5.167800e+01 2.827122e+01 9 7 22010 10 5 1 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 5.370300e+01 2.828520e+01 9 6 23131 12 9 5 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.531500e+01 2.850945e+01 13 8 24076 18 5 4 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.690600e+01 2.848557e+01 14 10 24995 22 9 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.843400e+01 2.839101e+01 14 8 25874 36 9 12 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.960500e+01 2.816878e+01 6 5 26633 8 6 3 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.978000e+01 2.808632e+01 19 13 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): 59.781 LMO calls / sec: 447.2993091450461 Nodes / sec: 28.08584667369231 LMO calls / node: 15.926146515783204 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2233 Local tightenings / node: 1.38 Total number of potential local tightenings: 5463 Number of alternative decisions: 438 Number of stable decisions: 401 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.340000e-01 5.617978e+00 469 77 64 4885 36 6 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.311000e+00 9.916095e+00 110 45 256 696 19 22 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.601000e+00 1.954249e+01 58 26 2096 346 11 15 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.310000e+00 2.158969e+01 74 34 3186 412 13 6 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.612800e+01 2.486359e+01 92 46 6017 417 2 1 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.226900e+01 2.671876e+01 49 27 8679 179 9 3 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.750400e+01 2.781414e+01 18 12 11070 27 9 3 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.237700e+01 2.875498e+01 66 31 13344 339 17 8 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.686200e+01 2.932559e+01 52 21 15506 341 8 3 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.087600e+01 2.957726e+01 51 27 17444 229 10 6 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.486700e+01 2.975461e+01 6 5 19379 9 7 6 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.801700e+01 3.009351e+01 53 27 21026 246 8 7 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.117100e+01 3.007563e+01 39 22 22661 137 4 3 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.402700e+01 3.011457e+01 6 5 24161 6 4 6 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.630000e+01 2.996448e+01 15 10 25390 20 6 3 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.856300e+01 2.989942e+01 34 17 26657 170 13 4 1378 407 2.610969e+01 2.836265e+01 2.252956e+00 8.628813e-02 6.000100e+01 2.974950e+01 6 4 27511 5 5 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.109688846386472 Dual Gap (relative): 0.08628812822219092 Search Statistics. Total number of nodes processed: 1785 Total number of lmo calls: 27511 Total time (s): 60.002 LMO calls / sec: 458.50138328722375 Nodes / sec: 29.749008366387788 LMO calls / node: 15.412324929971989 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2422 Local tightenings / node: 1.76 Total number of potential local tightenings: 5841 Number of alternative decisions: 543 Number of stable decisions: 349 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.130000e-01 5.847953e+00 454 71 64 4885 2 2 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.438000e+00 1.681706e+01 81 35 678 489 23 5 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.042000e+00 2.071006e+01 43 23 968 257 17 12 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.492000e+00 2.682862e+01 15 8 2918 60 2 4 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.210900e+01 3.162937e+01 31 15 5197 153 21 2 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.641200e+01 3.454789e+01 25 14 7469 83 5 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.064600e+01 3.560012e+01 28 13 9610 131 7 3 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.539100e+01 3.595762e+01 46 24 11880 193 7 5 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.958300e+01 3.620322e+01 35 20 13971 113 6 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.366000e+01 3.633393e+01 22 13 15981 55 3 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.700400e+01 3.656361e+01 38 21 17719 139 13 1 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 4.042900e+01 3.643424e+01 16 10 19510 37 9 3 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.388900e+01 3.638725e+01 66 28 21254 396 7 4 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.676400e+01 3.624583e+01 12 7 22747 24 8 3 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.904400e+01 3.606965e+01 5 3 24101 6 4 1 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 5.098100e+01 3.587611e+01 14 9 25317 23 11 5 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.264700e+01 3.542462e+01 7 5 26374 10 5 1 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.410600e+01 3.498688e+01 9 6 27346 16 8 1 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.525600e+01 3.451209e+01 17 10 28188 61 3 1 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.637400e+01 3.407599e+01 7 4 29039 10 7 8 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.740900e+01 3.360100e+01 6 4 29805 14 8 2 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.808500e+01 3.324438e+01 5 4 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): 58.087 LMO calls / sec: 520.9427238452665 Nodes / sec: 33.24323859039028 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.520000e-01 6.637168e+00 448 68 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.600000e-01 1.184211e+01 87 36 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.930000e-01 1.231803e+01 131 47 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.850000e+00 2.271186e+01 85 35 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.442000e+00 2.298242e+01 72 32 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.533400e+01 2.615104e+01 54 28 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.158800e+01 2.765425e+01 56 24 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.771100e+01 2.861679e+01 57 28 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.285800e+01 2.942967e+01 26 17 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.814300e+01 2.986131e+01 57 24 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.242800e+01 3.000377e+01 14 9 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.610900e+01 2.969052e+01 9 6 20396 14 8 12 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.891700e+01 2.917186e+01 61 25 21910 381 1 1 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 5.117400e+01 2.874507e+01 11 7 23162 19 11 10 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 5.320600e+01 2.817351e+01 40 22 24363 145 12 7 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 5.476400e+01 2.766416e+01 11 7 25359 25 10 8 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.620200e+01 2.716985e+01 37 19 26283 172 9 5 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.748300e+01 2.666875e+01 14 10 27090 27 10 9 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.830400e+01 2.632752e+01 8 6 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): 58.305 LMO calls / sec: 473.02975731069375 Nodes / sec: 26.327073149815625 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.780000e-01 6.276151e+00 475 73 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.140000e-01 1.105651e+01 96 42 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.037000e+00 1.060752e+01 220 49 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.069000e+00 2.216341e+01 90 37 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.700000e+00 2.237113e+01 72 31 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.579600e+01 2.538617e+01 55 28 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.243800e+01 2.660665e+01 56 26 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.911300e+01 2.723869e+01 53 25 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.440000e+01 2.811047e+01 21 13 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.981500e+01 2.860731e+01 59 26 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.427700e+01 2.875082e+01 16 10 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.825800e+01 2.836835e+01 8 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.146900e+01 2.768657e+01 43 39 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.376700e+01 2.735879e+01 32 15 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.587400e+01 2.675663e+01 11 7 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.754800e+01 2.625634e+01 12 8 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.917300e+01 2.563669e+01 14 9 26318 33 12 12 1371 154 2.777992e+01 2.836265e+01 5.827234e-01 2.097642e-02 6.000100e+01 2.541624e+01 7 4 26893 11 4 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.779921622530065 Dual Gap (relative): 0.020976423576455003 Search Statistics. Total number of nodes processed: 1525 Total number of lmo calls: 26893 Total time (s): 60.002 LMO calls / sec: 448.201726609113 Nodes / sec: 25.415819472684245 LMO calls / node: 17.634754098360656 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2383 Local tightenings / node: 1.74 Total number of potential local tightenings: 5150 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.371000e+00 8.899436e-01 471 77 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.663000e+00 2.457002e+00 82 33 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.872000e+00 2.840909e+00 206 44 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.243900e+01 1.615886e+01 85 35 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.302700e+01 1.665771e+01 67 29 3485 420 10 10 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.896500e+01 2.103876e+01 70 29 6090 444 9 4 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.492000e+01 2.347512e+01 44 21 8720 225 8 5 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 3.019400e+01 2.474001e+01 66 29 11144 379 18 5 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.456200e+01 2.601123e+01 10 6 13355 21 11 7 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 3.820500e+01 2.646250e+01 56 24 15250 331 10 3 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 4.179400e+01 2.648706e+01 58 26 17024 329 12 3 800 363 2.539631e+01 2.836265e+01 2.966336e+00 1.168019e-01 4.436700e+01 2.621318e+01 23 13 18354 67 15 10 900 301 2.616952e+01 2.836265e+01 2.193126e+00 8.380461e-02 4.650000e+01 2.582796e+01 13 8 19533 32 11 9 1000 225 2.691767e+01 2.836265e+01 1.444975e+00 5.368128e-02 4.828100e+01 2.537230e+01 5 4 20674 8 4 4 1100 137 2.763514e+01 2.836265e+01 7.275008e-01 2.632520e-02 4.940400e+01 2.503846e+01 16 8 21524 68 13 10 1187 52 2.808687e+01 2.836265e+01 2.757701e-01 9.818469e-03 5.035800e+01 2.460384e+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): 50.359 LMO calls / sec: 441.11281002402745 Nodes / sec: 24.603347961635457 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 4.420000e-01 6.787330e+00 438 62 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 9.520000e-01 9.453782e+00 157 44 192 1340 13 25 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 8.281000e+00 2.427243e+01 48 26 3219 200 6 6 * 118 119 1.406031e+01 2.836265e+01 1.430233e+01 1.017213e+00 9.332000e+00 2.539649e+01 31 14 3726 178 10 12 200 199 1.704058e+01 2.836265e+01 1.132207e+01 6.644180e-01 1.434500e+01 2.781457e+01 45 22 6070 226 3 0 300 287 1.921318e+01 2.836265e+01 9.149468e+00 4.762080e-01 1.991600e+01 2.947379e+01 61 31 8686 275 8 3 400 359 2.087523e+01 2.836265e+01 7.487411e+00 3.586743e-01 2.531700e+01 2.997986e+01 30 17 11090 152 12 0 500 397 2.261057e+01 2.836265e+01 5.752072e+00 2.543975e-01 2.995200e+01 2.994792e+01 32 18 13255 124 12 8 600 411 2.379062e+01 2.836265e+01 4.572023e+00 1.921775e-01 3.284100e+01 3.078469e+01 16 9 15181 90 13 10 700 393 2.462769e+01 2.836265e+01 3.734957e+00 1.516568e-01 3.473800e+01 3.146410e+01 4 3 16798 8 6 12 800 359 2.546045e+01 2.836265e+01 2.902200e+00 1.139886e-01 3.637100e+01 3.186605e+01 7 5 18259 20 8 10 900 299 2.628929e+01 2.836265e+01 2.073352e+00 7.886678e-02 3.764700e+01 3.184849e+01 24 11 19506 212 13 1 1000 217 2.696789e+01 2.836265e+01 1.394758e+00 5.171920e-02 3.859500e+01 3.153258e+01 5 3 20487 10 7 4 1100 135 2.755469e+01 2.836265e+01 8.079536e-01 2.932182e-02 3.937500e+01 3.136508e+01 5 4 21358 19 9 4 1199 40 2.811400e+01 2.836265e+01 2.486474e-01 8.844257e-03 4.007000e+01 3.092089e+01 3 2 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): 40.071 LMO calls / sec: 552.4194554665469 Nodes / sec: 30.920116792692973 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 2.980000e-01 1.006711e+01 295 46 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 6.680000e-01 1.347305e+01 117 35 192 1340 13 25 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 5.535000e+00 3.631436e+01 30 17 3215 200 6 6 200 201 1.675948e+01 2.977156e+01 1.301208e+01 7.764012e-01 9.620000e+00 4.168399e+01 57 22 6123 607 11 16 * 220 219 1.746732e+01 2.836265e+01 1.089532e+01 6.237546e-01 1.036000e+01 4.256757e+01 17 9 6667 132 6 1 300 289 1.916299e+01 2.836265e+01 9.199655e+00 4.800741e-01 1.324500e+01 4.462061e+01 28 17 8782 119 14 1 400 369 2.094004e+01 2.836265e+01 7.422603e+00 3.544694e-01 1.681300e+01 4.585737e+01 7 5 11289 16 7 4 500 403 2.263394e+01 2.836265e+01 5.728704e+00 2.531024e-01 1.959900e+01 4.617583e+01 30 14 13362 246 7 3 600 415 2.372403e+01 2.836265e+01 4.638612e+00 1.955238e-01 2.203400e+01 4.615594e+01 9 6 15332 35 8 13 700 399 2.451924e+01 2.836265e+01 3.843403e+00 1.567505e-01 2.395000e+01 4.597077e+01 11 6 16953 87 7 0 800 381 2.538724e+01 2.836265e+01 2.975402e+00 1.172007e-01 2.581800e+01 4.582075e+01 7 5 18530 35 6 14 900 315 2.615751e+01 2.836265e+01 2.205134e+00 8.430215e-02 2.707900e+01 4.494258e+01 23 12 19747 152 13 2 1000 237 2.690654e+01 2.836265e+01 1.456107e+00 5.411720e-02 2.812400e+01 4.405490e+01 8 5 20774 16 8 3 1100 153 2.751278e+01 2.836265e+01 8.498667e-01 3.088989e-02 2.911300e+01 4.310789e+01 4 3 21697 6 3 0 1200 55 2.805099e+01 2.836265e+01 3.116569e-01 1.111037e-02 3.012100e+01 4.173168e+01 11 7 22486 33 14 7 1207 50 2.813525e+01 2.836265e+01 2.273973e-01 8.082294e-03 3.018200e+01 4.171360e+01 5 4 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): 30.183 LMO calls / sec: 746.4798065136004 Nodes / sec: 41.71222211178478 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.270000e-01 5.692600e+00 442 67 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.260000e-01 1.089588e+01 85 36 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.530000e-01 1.154250e+01 124 44 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.777000e+00 2.290076e+01 90 33 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.270000e+00 2.340885e+01 67 26 3485 420 10 10 200 199 1.683575e+01 2.836265e+01 1.152689e+01 6.846676e-01 1.512900e+01 2.637319e+01 52 25 6088 268 9 4 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.017200e+01 2.900059e+01 34 17 8721 225 8 5 400 345 2.074936e+01 2.836265e+01 7.613288e+00 3.669168e-01 2.515900e+01 2.961167e+01 11 7 11151 18 5 3 500 397 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 2.940600e+01 3.050398e+01 11 7 13344 21 11 7 600 403 2.372371e+01 2.836265e+01 4.638934e+00 1.955400e-01 3.272200e+01 3.065216e+01 11 7 15206 26 8 7 700 409 2.456583e+01 2.836265e+01 3.796813e+00 1.545566e-01 3.581600e+01 3.096382e+01 54 13 17024 145 7 1 800 361 2.545401e+01 2.836265e+01 2.908639e+00 1.142704e-01 3.718200e+01 3.122479e+01 5 3 18324 10 11 6 900 297 2.625404e+01 2.836265e+01 2.108608e+00 8.031557e-02 3.894300e+01 3.073723e+01 6 4 19524 7 7 3 1000 221 2.693668e+01 2.836265e+01 1.425964e+00 5.293764e-02 4.051600e+01 3.013624e+01 15 9 20637 44 11 6 1100 129 2.773552e+01 2.836265e+01 6.271248e-01 2.261089e-02 4.155500e+01 2.957526e+01 11 7 21469 24 6 4 1175 56 2.809454e+01 2.836265e+01 2.681003e-01 9.542790e-03 4.221400e+01 2.916094e+01 12 7 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): 42.215 LMO calls / sec: 523.0368352481345 Nodes / sec: 29.160251095582137 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)] 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: 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -7.938193e-03 1.000000e-01 1.079382e-01 Inf 1.779200e+01 1.686151e-01 8136 37 20 36 5 0 19 0 1.000000e-01 1.000000e-01 0.000000e+00 0.000000e+00 2.180400e+01 8.713997e-01 7 6 223 6 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.09999999999999998 Dual Bound: 0.09999999999999998 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 19 Total number of lmo calls: 223 Total time (s): 22.565 LMO calls / sec: 9.882561489031685 Nodes / sec: 0.8420119654331929 LMO calls / node: 11.736842105263158 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 12 Local tightenings / node: 0.63 Total number of potential local tightenings: 12 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hybrid 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -7.938193e-03 1.000000e-01 1.079382e-01 Inf 1.883000e+01 1.593202e-01 8473 35 20 36 5 0 * 12 1 6.664746e-02 1.000000e-01 3.335254e-02 5.004322e-01 1.987800e+01 6.539893e-01 14 11 170 35 2 3 13 0 6.664746e-02 1.000000e-01 3.335254e-02 5.004322e-01 1.989900e+01 6.532992e-01 18 14 178 8 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.09999999999999995 Dual Bound: 0.06664746199758288 Dual Gap (relative): 0.5004322295667714 Search Statistics. Total number of nodes processed: 13 Total number of lmo calls: 178 Total time (s): 20.703 LMO calls / sec: 8.597787760227986 Nodes / sec: 0.6279283195672125 LMO calls / node: 13.692307692307692 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 10 Local tightenings / node: 0.77 Total number of potential local tightenings: 10 [ Info: Polish solution HiGHS Example 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: 6 Number of integer variables: 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 0.000000e+00 7.500000e-01 7.500000e-01 Inf 1.843000e+01 1.627781e-01 9627 1 4 2 1 0 100 27 6.250000e-01 7.500000e-01 1.250000e-01 2.000000e-01 1.858200e+01 6.834571e+00 1 1 326 0 1 0 127 0 7.500000e-01 7.500000e-01 0.000000e+00 0.000000e+00 1.861200e+01 6.823555e+00 1 0 380 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.75 Dual Bound: 0.75 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 127 Total number of lmo calls: 380 Total time (s): 19.425 LMO calls / sec: 19.56241956241956 Nodes / sec: 6.537966537966538 LMO calls / node: 2.9921259842519685 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 Approximate Planted Point Example seed = 0xdce52a6b6d2f24f4 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 -7.308381e-03 5.400000e-01 5.473084e-01 Inf 1.542500e+01 1.944895e-01 7246 6 8 13 2 0 100 5 5.309252e-01 5.400000e-01 9.074826e-03 1.709248e-02 1.606000e+01 6.537983e+00 4 2 531 2 3 0 103 2 5.350000e-01 5.400000e-01 5.000000e-03 9.345794e-03 1.608000e+01 6.529851e+00 7 4 549 6 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 0.5399999999999999 Dual Bound: 0.5349999999999999 Dual Gap (relative): 0.009345794392523374 Search Statistics. Total number of nodes processed: 105 Total number of lmo calls: 549 Total time (s): 16.919 LMO calls / sec: 32.44872628405934 Nodes / sec: 6.206040546131568 LMO calls / node: 5.228571428571429 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: 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 -7.308381e-03 5.400000e-01 5.473084e-01 Inf 1.669500e+01 1.796945e-01 7256 0 8 13 2 0 100 5 5.309252e-01 5.400000e-01 9.074826e-03 1.709248e-02 1.671800e+01 6.280656e+00 0 0 529 2 3 0 103 2 5.350000e-01 5.400000e-01 5.000000e-03 9.345794e-03 1.671900e+01 6.280280e+00 0 0 547 6 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 0.5399999999999999 Dual Bound: 0.5349999999999999 Dual Gap (relative): 0.009345794392523374 Search Statistics. Total number of nodes processed: 105 Total number of lmo calls: 547 Total time (s): 17.554 LMO calls / sec: 31.160988948387836 Nodes / sec: 5.981542668337702 LMO calls / node: 5.20952380952381 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: 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 -7.308381e-03 5.400000e-01 5.473084e-01 Inf 1.477800e+01 2.030045e-01 6419 0 8 13 2 0 100 5 5.309252e-01 5.400000e-01 9.074826e-03 1.709248e-02 1.480100e+01 7.094115e+00 0 0 529 2 3 0 103 2 5.350000e-01 5.400000e-01 5.000000e-03 9.345794e-03 1.480300e+01 7.093157e+00 1 0 547 6 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 0.5399999999999999 Dual Bound: 0.5349999999999999 Dual Gap (relative): 0.009345794392523374 Search Statistics. Total number of nodes processed: 105 Total number of lmo calls: 547 Total time (s): 15.571 LMO calls / sec: 35.12940723139169 Nodes / sec: 6.743304861601696 LMO calls / node: 5.20952380952381 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: 20 Number of integer variables: 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -7.308381e-03 1.950218e-01 2.023302e-01 Inf 1.449500e+01 2.069679e-01 6560 6 8 13 2 0 * 2 3 -7.308381e-03 1.950151e-01 2.023235e-01 Inf 1.450200e+01 3.447800e-01 5 3 12 2 2 0 * 11 2 1.825501e-01 1.950041e-01 1.245401e-02 6.822240e-02 1.456400e+01 8.926119e-01 4 2 64 2 1 0 * 13 2 1.875810e-01 1.950041e-01 7.423153e-03 3.957307e-02 1.457700e+01 1.029018e+00 3 2 75 2 1 0 * 15 0 1.950000e-01 1.950000e-01 0.000000e+00 0.000000e+00 1.459100e+01 1.028031e+00 5 3 87 5 3 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 2.940000e+00 -4.560000e+00 7.500000e+00 0.000000e+00 Inf 1 LD 2 7.765385e-01 -1.161923e+00 1.938462e+00 1.473658e-01 1.357167e+01 2 LD 4 2.245698e-01 -1.368383e-01 3.614081e-01 2.952742e-01 1.354673e+01 3 LD 6 1.965035e-01 1.540701e-01 4.243343e-02 3.803969e-01 1.577300e+01 3 LD 11 1.950682e-01 1.865333e-01 8.534961e-03 3.827550e-01 2.873901e+01 3 LD 18 1.950009e-01 1.940358e-01 9.651199e-04 3.850423e-01 4.674810e+01 3 LD 25 1.950000e-01 1.948895e-01 1.105188e-04 3.879355e-01 6.444370e+01 3 LD 32 1.950000e-01 1.949852e-01 1.478676e-05 3.903228e-01 8.198343e+01 3 LD 39 1.950000e-01 1.949980e-01 1.978697e-06 3.922967e-01 9.941455e+01 3 LD 46 1.950000e-01 1.949997e-01 2.647861e-07 3.941227e-01 1.167149e+02 3 Last 46 1.950000e-01 1.949997e-01 2.647861e-07 3.968057e-01 1.159257e+02 3 ---------------------------------------------------------------------------------------------------------------- PP 46 1.950000e-01 1.949997e-01 2.647861e-07 3.982640e-01 1.155013e+02 3 ---------------------------------------------------------------------------------------------------------------- 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: 0.195 Dual Bound: 0.195 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 101 Total time (s): 16.658 LMO calls / sec: 6.063152839476527 Nodes / sec: 0.9004682434866129 LMO calls / node: 6.733333333333333 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: 20 Number of integer variables: 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ====================================================================================== 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 55 running 1 of 1 signal (10): User defined signal 1 _ZN4llvm14VirtRegAuxInfo16weightCalcHelperERNS_12LiveIntervalEPNS_9SlotIndexES4_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm14VirtRegAuxInfo29calculateSpillWeightsAndHintsEv 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: 0x7f61292a657d) 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: 0x7f6129357f92) 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 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:3003 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3063 include at ./Base.jl:309 jfptr_include_10242.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:3003 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3063 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_76447.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_73111.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: 0x7f616289d249) 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 ============================================================== ====================================================================================== 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_41502.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 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x0000727644395c30 Total snapshots: 420. Utilization: 0% ╎420 @Base/task.jl:1168 wait_forever() 419╎ 420 @Base/task.jl:1246 wait() * 1 0 -4.178307e-03 4.213166e-06 4.182520e-03 Inf 1.705700e+01 5.862696e-02 8569 0 11 26 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- [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_41502.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: 27110366 (Pool: 27109691; Big: 675); GC: 22 [55] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/Kl8FO/examples/approx_planted_point.jl:91 _ZN4llvm12DenseMapBaseINS_8DenseMapINS_5APIntESt10unique_ptrINS_11ConstantIntESt14default_deleteIS4_EENS_12DenseMapInfoIS2_vEENS_6detail12DenseMapPairIS2_S7_EEEES2_S7_S9_SC_E15LookupBucketForIS2_EEbRKT_RPSC_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm11ConstantInt3getERNS_11LLVMContextERKNS_5APIntE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm15ScalarEvolution25proveNoWrapByVaryingStartINS_18SCEVSignExtendExprEEEbPKNS_4SCEVES5_PKNS_4LoopE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm15ScalarEvolution21getSignExtendExprImplEPKNS_4SCEVEPNS_4TypeEj at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm15ScalarEvolution17getSignExtendExprEPKNS_4SCEVEPNS_4TypeEj at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm12SCEVExpander25getAddRecExprPHILiterallyEPKNS_14SCEVAddRecExprEPKNS_4LoopERPNS_4TypeERb at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm12SCEVExpander25expandAddRecExprLiterallyEPKNS_14SCEVAddRecExprE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm12SCEVExpander6expandEPKNS_4SCEVE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm12SCEVExpander13expandCodeForEPKNS_4SCEVEPNS_4TypeE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZNK12_GLOBAL__N_111LSRInstance6ExpandERKNS_6LSRUseERKNS_8LSRFixupERKNS_7FormulaEN4llvm21ilist_iterator_w_bitsINSA_12ilist_detail12node_optionsINSA_11InstructionELb1ELb0EvLb1ENSA_10BasicBlockEEELb0ELb0EEERNSA_15SmallVectorImplINSA_14WeakTrackingVHEEE.constprop.0 at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN12_GLOBAL__N_111LSRInstanceC2EPN4llvm4LoopERNS1_7IVUsersERNS1_15ScalarEvolutionERNS1_13DominatorTreeERNS1_8LoopInfoERKNS1_19TargetTransformInfoERNS1_15AssumptionCacheERNS1_17TargetLibraryInfoEPNS1_16MemorySSAUpdaterE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZL18ReduceLoopStrengthPN4llvm4LoopERNS_7IVUsersERNS_15ScalarEvolutionERNS_13DominatorTreeERNS_8LoopInfoERKNS_19TargetTransformInfoERNS_15AssumptionCacheERNS_17TargetLibraryInfoEPNS_9MemorySSAE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN12_GLOBAL__N_118LoopStrengthReduce9runOnLoopEPN4llvm4LoopERNS1_13LPPassManagerE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm13LPPassManager13runOnFunctionERNS_8FunctionE 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 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: 3990659575 (Pool: 3990655218; Big: 4357); GC: 1829 PkgEval terminated after 2722.56s: test duration exceeded the time limit