Package evaluation to test Boscia on Julia 1.14.0-DEV.1299 (6d6224db99*) started at 2025-11-27T17:00:12.429 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.24s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Installed Boscia ─ v0.2.3 Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.3 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.3 [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 6.43s ################################################################################ # 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... 2953.7 ms ✓ BlockDiagonals 1743.9 ms ✓ Bonobo 82287.1 ms ✓ MathOptInterface 1235.3 ms ✓ BlockDiagonals → ChainRulesCoreExt 37417.7 ms ✓ FrankWolfe 10814.7 ms ✓ MathOptSetDistances 13047.7 ms ✓ Boscia 7 dependencies successfully precompiled in 151 seconds. 93 already precompiled. Precompilation completed after 163.51s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_flXkFw/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.3 [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 [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_flXkFw/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.3 [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 = 0x977a67a979e52cd7 [ 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 = 0x18305c7e2d30629c Indicator Tests Heuristics Tests seed = 0xe09d15fffb867cdd [ Info: Polish solution Sparse Regression Tests seed = 0x35385a067c5a0bf9 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.551948e+00 2.677879e+00 1.259311e-01 4.934703e-02 1.909700e+01 1.570927e-01 7788 61 13 13 3 1 * 3 4 2.586078e+00 2.667945e+00 8.186679e-02 3.165673e-02 2.248200e+01 3.113602e-01 36 27 29 10 5 0 19 8 2.642648e+00 2.667945e+00 2.529719e-02 9.572669e-03 2.282600e+01 1.182862e+00 8 6 87 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 7.435372e+00 2.005840e-02 7.415314e+00 0.000000e+00 Inf 1 LD 2 2.667945e+00 2.667945e+00 0.000000e+00 2.041683e+00 9.795842e-01 1 Last 2 2.667945e+00 2.667945e+00 0.000000e+00 2.203796e+00 9.075249e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.667945e+00 2.667945e+00 0.000000e+00 2.208424e+00 9.056231e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.6679452366788263 Dual Bound: 2.6426480428330668 Dual Gap (relative): 0.00957266856415717 Search Statistics. Total number of nodes processed: 27 Total number of lmo calls: 92 Total time (s): 27.025 LMO calls / sec: 3.404255319148936 Nodes / sec: 0.9990749306197966 LMO calls / node: 3.4074074074074074 Total number of global tightenings: 42 Global tightenings / node: 2.21 Total number of local tightenings: 48 Local tightenings / node: 2.53 Total number of potential local tightenings: 48 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.640481e+00 3.193115e+00 1.552634e+00 9.464506e-01 1.677300e+01 1.788589e-01 7991 312 43 110 28 1 * 3 4 1.665414e+00 3.188651e+00 1.523237e+00 9.146294e-01 1.727100e+01 4.053037e-01 152 116 97 48 20 0 100 61 2.521297e+00 3.188651e+00 6.673547e-01 2.646871e-01 2.608700e+01 6.171656e+00 25 18 1370 24 15 0 200 61 2.618989e+00 3.188651e+00 5.696624e-01 2.175123e-01 2.843700e+01 9.178183e+00 32 23 1767 23 7 0 300 61 2.689669e+00 3.188651e+00 4.989827e-01 1.855183e-01 3.074600e+01 1.174136e+01 27 19 2179 25 15 0 400 61 2.741306e+00 3.188651e+00 4.473450e-01 1.631868e-01 3.309600e+01 1.392918e+01 28 20 2598 26 15 2 500 61 2.799567e+00 3.188651e+00 3.890849e-01 1.389804e-01 3.557700e+01 1.576861e+01 36 25 3034 29 10 1 600 61 2.849893e+00 3.188651e+00 3.387581e-01 1.188670e-01 3.801200e+01 1.738925e+01 32 22 3489 30 11 0 700 61 2.899671e+00 3.188651e+00 2.889808e-01 9.965986e-02 4.040700e+01 1.883337e+01 30 21 3946 37 15 8 800 61 2.942030e+00 3.188651e+00 2.466209e-01 8.382678e-02 4.279800e+01 2.011776e+01 31 22 4416 33 15 6 900 61 2.993594e+00 3.188651e+00 1.950571e-01 6.515816e-02 4.529900e+01 2.121460e+01 27 19 4906 27 7 1 1000 55 3.049000e+00 3.188651e+00 1.396514e-01 4.580236e-02 4.765400e+01 2.213875e+01 35 24 5403 42 9 2 1100 31 3.127211e+00 3.188651e+00 6.144079e-02 1.964715e-02 4.996600e+01 2.263539e+01 13 9 5862 2 2 0 1119 16 3.157871e+00 3.188651e+00 3.078074e-02 9.747309e-03 5.031600e+01 2.255744e+01 7 5 5935 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 ---------------------------------------------------------------------------------------------------------------- I 1 7.892022e+00 8.398189e-02 7.808041e+00 0.000000e+00 Inf 1 LD 2 3.188651e+00 3.188651e+00 0.000000e+00 1.605806e-01 1.245480e+01 1 Last 2 3.188651e+00 3.188651e+00 0.000000e+00 3.248017e-01 6.157604e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.188651e+00 3.188651e+00 0.000000e+00 3.286631e-01 6.085259e+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.1886513866565434 Dual Bound: 3.1578706448097327 Dual Gap (relative): 0.009747309281778789 Search Statistics. Total number of nodes processed: 1135 Total number of lmo calls: 5940 Total time (s): 52.349 LMO calls / sec: 113.46921622189537 Nodes / sec: 21.68140747674263 LMO calls / node: 5.233480176211454 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: 15 Non zero entries: 6th entry: 0.1627096120604246 34th entry: 0.1627096120604246 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.798903e+00 3.193115e+00 1.394212e+00 7.750345e-01 4.250000e-01 7.058824e+00 420 299 43 110 28 1 * 3 4 1.822852e+00 3.188651e+00 1.365799e+00 7.492651e-01 7.880000e-01 8.883249e+00 135 103 97 48 20 0 100 29 2.600339e+00 3.188651e+00 5.883125e-01 2.262445e-01 9.067000e+00 1.422742e+01 21 16 1332 15 14 0 200 30 2.766359e+00 3.188651e+00 4.222922e-01 1.526527e-01 1.290400e+01 1.782393e+01 28 20 1971 23 9 0 300 30 2.890883e+00 3.188651e+00 2.977679e-01 1.030024e-01 1.653500e+01 1.995767e+01 27 20 2638 19 5 0 400 30 2.993668e+00 3.188651e+00 1.949836e-01 6.513201e-02 2.055700e+01 2.091745e+01 27 20 3372 29 11 2 500 24 3.105517e+00 3.188651e+00 8.313481e-02 2.677004e-02 2.442900e+01 2.144992e+01 33 24 4153 19 8 3 533 14 3.160259e+00 3.188651e+00 2.839210e-02 8.984103e-03 2.573400e+01 2.125593e+01 34 24 4417 51 12 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.892022e+00 8.398189e-02 7.808041e+00 0.000000e+00 Inf 1 LD 2 3.188651e+00 3.188651e+00 0.000000e+00 1.100600e-03 1.817191e+03 1 Last 2 3.188651e+00 3.188651e+00 0.000000e+00 8.026754e-03 2.491667e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.188651e+00 3.188651e+00 0.000000e+00 1.149128e-02 1.740450e+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.1886513866565434 Dual Bound: 3.1602592912979315 Dual Gap (relative): 0.00898410311989024 Search Statistics. Total number of nodes processed: 547 Total number of lmo calls: 4422 Total time (s): 25.759 LMO calls / sec: 171.66815481967467 Nodes / sec: 21.235296401257813 LMO calls / node: 8.084095063985375 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: 11 Poisson Tests seed = 0xa4c9906ff399edcf 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 -6.118749e+02 -5.933219e+02 1.855299e+01 3.126969e-02 1.888700e+01 1.588394e-01 9880 164 47 1407 9 3 * 3 4 -6.112786e+02 -5.960803e+02 1.519832e+01 2.549711e-02 2.250000e+01 3.111111e-01 1853 115 114 1278 17 9 * 5 6 -6.110125e+02 -5.997844e+02 1.122814e+01 1.872029e-02 2.628900e+01 4.184260e-01 1956 116 176 1306 18 6 * 18 19 -6.096616e+02 -6.009158e+02 8.745865e+00 1.455423e-02 5.408800e+01 6.840704e-01 2675 104 589 1666 12 14 * 28 29 -6.093903e+02 -6.022955e+02 7.094761e+00 1.177953e-02 7.293500e+01 7.815178e-01 1236 102 909 741 13 11 55 56 -6.084951e+02 -6.022955e+02 6.199569e+00 1.029323e-02 1.200050e+02 9.249615e-01 1713 81 1754 1114 9 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.093575e+02 -9.353097e+02 1.844667e+03 0.000000e+00 Inf 1 LD 2 -5.860148e+02 -6.493209e+02 6.330611e+01 1.731661e-01 1.154961e+01 2 LD 27 -5.977413e+02 -6.158568e+02 1.811555e+01 5.403514e-01 4.996749e+01 3 LD 30 -6.038648e+02 -6.094771e+02 5.612347e+00 5.489706e-01 5.464774e+01 4 LD 37 -6.039628e+02 -6.064347e+02 2.471941e+00 5.611553e-01 6.593540e+01 4 LD 43 -6.039810e+02 -6.051907e+02 1.209694e+00 5.699028e-01 7.545146e+01 4 LD 56 -6.039957e+02 -6.042643e+02 2.685503e-01 5.887811e-01 9.511175e+01 5 LD 104 -6.039982e+02 -6.041084e+02 1.102015e-01 6.345141e-01 1.639050e+02 5 LD 151 -6.039984e+02 -6.040503e+02 5.191681e-02 6.795371e-01 2.222101e+02 6 LD 200 -6.039985e+02 -6.040238e+02 2.528753e-02 7.298147e-01 2.740422e+02 7 LD 246 -6.039985e+02 -6.040084e+02 9.960612e-03 7.872322e-01 3.124872e+02 8 LD 282 -6.039985e+02 -6.040029e+02 4.432900e-03 8.258062e-01 3.414845e+02 8 LD 317 -6.039985e+02 -6.040004e+02 1.879084e-03 8.628844e-01 3.673725e+02 8 LD 354 -6.039985e+02 -6.039993e+02 8.135598e-04 8.981117e-01 3.941603e+02 8 LD 389 -6.039985e+02 -6.039988e+02 3.499363e-04 9.315993e-01 4.175615e+02 8 LD 416 -6.039985e+02 -6.039986e+02 1.598988e-04 9.590208e-01 4.337758e+02 8 LD 444 -6.039985e+02 -6.039986e+02 7.262679e-05 9.858549e-01 4.503706e+02 8 LD 475 -6.039985e+02 -6.039985e+02 3.236514e-05 1.014746e+00 4.680974e+02 8 P 1000 -6.039985e+02 -6.039985e+02 3.236514e-05 1.511236e+00 6.617101e+02 8 P 2000 -6.039985e+02 -6.039985e+02 3.236514e-05 2.385001e+00 8.385741e+02 8 P 3000 -6.039985e+02 -6.039985e+02 3.236514e-05 3.200136e+00 9.374602e+02 8 P 4000 -6.039985e+02 -6.039985e+02 3.236514e-05 3.845218e+00 1.040253e+03 8 P 5000 -6.039985e+02 -6.039985e+02 3.236514e-05 4.511619e+00 1.108250e+03 8 P 6000 -6.039985e+02 -6.039985e+02 3.236514e-05 5.247802e+00 1.143336e+03 8 P 7000 -6.039985e+02 -6.039985e+02 3.236514e-05 5.975946e+00 1.171363e+03 8 P 8000 -6.039985e+02 -6.039985e+02 3.236514e-05 6.700511e+00 1.193939e+03 8 P 9000 -6.039985e+02 -6.039985e+02 3.236514e-05 7.312368e+00 1.230792e+03 8 P 10000 -6.039985e+02 -6.039985e+02 3.236514e-05 7.887712e+00 1.267795e+03 8 Last 10001 -6.039985e+02 -6.039985e+02 1.274302e-05 7.892317e+00 1.267182e+03 8 ---------------------------------------------------------------------------------------------------------------- PP 10001 -6.039985e+02 -6.039985e+02 1.274302e-05 7.895525e+00 1.266667e+03 8 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -603.9984866962341 Dual Bound: -608.4950916353895 Dual Gap (relative): 0.007444728816707901 Search Statistics. Total number of nodes processed: 111 Total number of lmo calls: 1783 Total time (s): 129.807 LMO calls / sec: 13.73577696118083 Nodes / sec: 0.855115671728027 LMO calls / node: 16.063063063063062 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 -5.195037e+02 -5.176748e+02 1.828852e+00 3.532820e-03 1.941500e+01 1.545197e-01 7637 142 22 65 8 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 -2.698436e+02 -5.485210e+02 2.786774e+02 0.000000e+00 Inf 1 LD 2 -5.176748e+02 -5.176748e+02 0.000000e+00 1.602918e-01 1.247724e+01 1 Last 2 -5.176748e+02 -5.176748e+02 0.000000e+00 3.311850e-01 6.038922e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -5.176748e+02 -5.176748e+02 0.000000e+00 3.361947e-01 5.948933e+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: -517.6748489066712 Dual Bound: -519.5037007796737 Dual Gap (relative): 0.003532819639325941 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 27 Total time (s): 21.617 LMO calls / sec: 1.2490169773789146 Nodes / sec: 0.13877966415321275 LMO calls / node: 9.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.756963e+02 3.401703e+02 1.644740e+02 9.361266e-01 1.510400e+01 1.986229e-01 7162 164 25 52 5 0 * 4 5 1.934229e+02 3.399392e+02 1.465163e+02 7.574921e-01 1.581000e+01 5.692600e-01 219 100 82 47 7 2 * 11 12 2.122672e+02 3.368484e+02 1.245812e+02 5.869072e-01 1.720200e+01 1.337054e+00 221 116 200 69 6 0 100 101 2.679900e+02 3.368484e+02 6.885839e+01 2.569439e-01 3.139500e+01 6.402293e+00 155 79 1514 44 2 0 200 199 2.886898e+02 3.368484e+02 4.815858e+01 1.668177e-01 4.313100e+01 9.250887e+00 123 66 2713 42 2 0 300 277 3.007464e+02 3.368484e+02 3.610199e+01 1.200413e-01 5.269100e+01 1.095064e+01 165 86 3713 42 2 0 400 331 3.100417e+02 3.368484e+02 2.680674e+01 8.646171e-02 5.996000e+01 1.219146e+01 70 42 4518 20 1 0 500 331 3.158467e+02 3.368484e+02 2.100169e+01 6.649329e-02 6.448600e+01 1.288652e+01 51 28 5072 15 2 1 * 594 303 3.208346e+02 3.367359e+02 1.590126e+01 4.956217e-02 6.822800e+01 1.323504e+01 15 9 5533 2 2 0 600 303 3.210173e+02 3.367359e+02 1.571860e+01 4.896498e-02 6.853100e+01 1.326407e+01 135 57 5563 30 2 0 * 606 277 3.211770e+02 3.355891e+02 1.441211e+01 4.487281e-02 6.872100e+01 1.322740e+01 19 13 5587 2 2 0 700 213 3.262029e+02 3.355891e+02 9.386251e+00 2.877428e-02 7.134400e+01 1.316158e+01 12 9 5922 0 1 0 800 123 3.301918e+02 3.355891e+02 5.397321e+00 1.634602e-02 7.368500e+01 1.287915e+01 8 6 6238 0 1 0 849 74 3.325334e+02 3.355891e+02 3.055715e+00 9.189197e-03 7.462700e+01 1.271658e+01 19 13 6373 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.368484e+02 3.181680e+02 1.868044e+01 0.000000e+00 Inf 1 LD 2 3.355891e+02 3.355891e+02 3.181981e-09 1.834798e-01 1.090038e+01 2 Last 2 3.355891e+02 3.355891e+02 3.181981e-09 3.644853e-01 5.487190e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.355891e+02 3.355891e+02 3.181981e-09 3.697525e-01 5.409023e+00 2 ---------------------------------------------------------------------------------------------------------------- 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: 335.5891332684844 Dual Bound: 332.5334183374143 Dual Gap (relative): 0.009189196521504293 Search Statistics. Total number of nodes processed: 949 Total number of lmo calls: 6378 Total time (s): 76.926 LMO calls / sec: 82.91084938772326 Nodes / sec: 12.33653121181395 LMO calls / node: 6.720758693361433 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.756963e+02 3.401703e+02 1.644740e+02 9.361266e-01 2.002600e+01 1.498053e-01 8038 174 25 52 10 0 * 5 6 1.943079e+02 3.400474e+02 1.457395e+02 7.500440e-01 2.472000e+01 4.449838e-01 181 103 105 51 5 2 * 9 10 2.126715e+02 3.380225e+02 1.253511e+02 5.894118e-01 2.906200e+01 6.537747e-01 204 116 179 49 6 1 * 15 16 2.283719e+02 3.371136e+02 1.087417e+02 4.761606e-01 3.527400e+01 8.788343e-01 366 125 278 150 8 0 * 37 38 2.465523e+02 3.368484e+02 9.029609e+01 3.662350e-01 5.467100e+01 1.371842e+00 143 85 624 36 4 0 100 101 2.725635e+02 3.368484e+02 6.428495e+01 2.358532e-01 1.020970e+02 1.968716e+00 314 124 1482 116 4 1 200 193 2.925291e+02 3.368484e+02 4.431935e+01 1.515041e-01 1.616940e+02 2.430517e+00 96 56 2599 28 3 0 300 259 3.059523e+02 3.368484e+02 3.089617e+01 1.009836e-01 2.047220e+02 2.730532e+00 50 23 3458 19 1 1 400 313 3.128009e+02 3.368484e+02 2.404749e+01 7.687795e-02 2.401240e+02 2.969299e+00 19 14 4091 2 2 1 * 448 305 3.167466e+02 3.357744e+02 1.902786e+01 6.007283e-02 2.520680e+02 3.019027e+00 13 7 4372 2 2 1 500 289 3.207246e+02 3.357744e+02 1.504982e+01 4.692444e-02 2.629120e+02 3.031433e+00 23 16 4601 7 1 0 600 219 3.258712e+02 3.357744e+02 9.903192e+00 3.038989e-02 2.731740e+02 3.027374e+00 31 23 4986 6 3 0 * 629 192 3.268322e+02 3.355891e+02 8.756945e+00 2.679340e-02 2.742750e+02 3.022514e+00 13 9 5081 2 2 2 700 137 3.295021e+02 3.355891e+02 6.087055e+00 1.847349e-02 2.798500e+02 3.019475e+00 19 13 5295 2 2 0 759 78 3.325029e+02 3.355891e+02 3.086262e+00 9.281910e-03 2.808710e+02 3.008499e+00 9 7 5461 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 3.368484e+02 3.181680e+02 1.868044e+01 0.000000e+00 Inf 1 LD 2 3.355891e+02 3.355891e+02 3.181981e-09 1.552898e-01 1.287915e+01 2 Last 2 3.355891e+02 3.355891e+02 3.181981e-09 3.109346e-01 6.432220e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.355891e+02 3.355891e+02 3.181981e-09 3.155138e-01 6.338867e+00 2 ---------------------------------------------------------------------------------------------------------------- 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: 335.5891332684844 Dual Bound: 332.5028715453412 Dual Gap (relative): 0.009281909984113754 Search Statistics. Total number of nodes processed: 845 Total number of lmo calls: 5466 Total time (s): 282.876 LMO calls / sec: 19.32295422729394 Nodes / sec: 2.987174592400911 LMO calls / node: 6.468639053254438 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 = 0x709b008cc8311cc6 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.363380e+01 5.172529e+01 6.535909e+01 Inf 1.864400e+01 1.609097e-01 9230 158 49 10001 21 13 * 3 4 -1.037936e+01 4.905567e+01 5.943503e+01 Inf 1.940100e+01 3.608061e-01 445 125 108 8061 17 8 * 10 11 -6.751584e+00 3.062490e+01 3.737648e+01 Inf 2.154800e+01 9.745684e-01 204 56 341 3971 17 23 100 61 1.887635e+01 3.062490e+01 1.174855e+01 6.223950e-01 4.532700e+01 3.551967e+00 394 136 2847 7400 19 13 187 20 2.920912e+01 3.062490e+01 1.415776e+00 4.847032e-02 6.000300e+01 3.449828e+00 76 50 4838 429 12 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 30.62489863766729 Dual Bound: 29.209123083710075 Dual Gap (relative): 0.04847032038242847 Search Statistics. Total number of nodes processed: 207 Total number of lmo calls: 4838 Total time (s): 60.724 LMO calls / sec: 79.67195836901391 Nodes / sec: 3.408866346090508 LMO calls / node: 23.3719806763285 Total number of global tightenings: 24 Global tightenings / node: 0.13 Total number of local tightenings: 726 Local tightenings / node: 3.88 Total number of potential local tightenings: 888 Time Limit Test seed = 0x8f05f3cd8befcda5 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 -4.859982e+00 -3.264666e+00 1.595316e+00 4.886612e-01 1.376600e+01 2.179282e-01 7066 67 27 1179 10 1 * 2 3 -4.859982e+00 -3.843410e+00 1.016571e+00 2.644972e-01 1.381800e+01 3.618469e-01 50 34 46 798 9 10 55 6 -3.880024e+00 -3.843410e+00 3.661370e-02 9.526357e-03 1.915100e+01 3.185212e+00 6 5 829 6 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -3.8434103055439977 Dual Bound: -3.8800240042859726 Dual Gap (relative): 0.009526357019223488 Search Statistics. Total number of nodes processed: 61 Total number of lmo calls: 829 Total time (s): 19.992 LMO calls / sec: 41.46658663465386 Nodes / sec: 3.051220488195278 LMO calls / node: 13.59016393442623 Total number of global tightenings: 5 Global tightenings / node: 0.09 Total number of local tightenings: 88 Local tightenings / node: 1.6 Total number of potential local tightenings: 110 Strong Convexity and Sharpness Tests seed = 0x5e9e301f488402da 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.130603e+02 2.130603e+02 0.000000e+00 0.000000e+00 1.349300e+01 7.411250e-02 5494 0 6 4 1 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 213.06030167559376 Dual Bound: 213.06030167559376 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 6 Total time (s): 14.311 LMO calls / sec: 0.4192579134931172 Nodes / sec: 0.06987631891551953 LMO calls / node: 6.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 2.117641e+02 2.120560e+02 2.919326e-01 1.378575e-03 1.020400e+01 2.940024e-01 4066 0 8 6 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 212.0559940311485 Dual Bound: 211.76406138737127 Dual Gap (relative): 0.0013785750134589422 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 8 Total time (s): 10.825 LMO calls / sec: 0.7390300230946882 Nodes / sec: 0.2771362586605081 LMO calls / node: 2.6666666666666665 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: 17 Branching Strategy Tests seed = 0x9e23172eabc6dfd8 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.166500e+01 2.571796e-01 5493 36 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.257500e+01 5.168986e+00 7 5 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): 13.192 LMO calls / sec: 72.24075197089145 Nodes / sec: 4.927228623408126 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 2.710000e-01 1.107011e+01 182 31 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.294000e+00 6.723338e+01 3 2 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.295 LMO calls / sec: 783.7837837837839 Nodes / sec: 67.18146718146718 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.000000e-01 1.000000e+01 197 29 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.154000e+00 5.112652e+01 2 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.155 LMO calls / sec: 743.7229437229437 Nodes / sec: 51.082251082251084 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 2.910000e-01 1.030928e+01 174 47 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.620000e+00 4.629630e+01 11 7 902 27 10 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.621 LMO calls / sec: 556.4466378778532 Nodes / sec: 46.267735965453426 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.260000e-01 9.202454e+00 226 46 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.841000e+00 5.268876e+01 4 2 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): 1.841 LMO calls / sec: 637.6969038565996 Nodes / sec: 52.688756110809344 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.580000e-01 6.550218e+00 455 72 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.770000e-01 1.158301e+01 91 36 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.320000e-01 1.180258e+01 130 45 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.151000e+00 2.196481e+01 93 40 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.721000e+00 2.232281e+01 68 29 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.585700e+01 2.528852e+01 56 26 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.066800e+01 2.888523e+01 39 17 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.626200e+01 3.019572e+01 53 26 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.128500e+01 3.090938e+01 21 13 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.663500e+01 3.109049e+01 60 27 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.131100e+01 3.081504e+01 18 11 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.497600e+01 3.043846e+01 26 24 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.788400e+01 2.975942e+01 10 6 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.072100e+01 2.900179e+01 42 20 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.291800e+01 2.825126e+01 10 6 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.445300e+01 2.774870e+01 10 6 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.578000e+01 2.719613e+01 13 9 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.692700e+01 2.675356e+01 10 6 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.748700e+01 2.649295e+01 6 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.488 LMO calls / sec: 478.795574728639 Nodes / sec: 26.49248538825494 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.086000e+00 1.438159e+00 492 80 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.433000e+00 3.699137e+00 84 36 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.583000e+00 4.258614e+00 146 58 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.113300e+01 1.805443e+01 88 38 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.176800e+01 1.843984e+01 66 29 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.855700e+01 2.139354e+01 106 34 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.400700e+01 2.336818e+01 47 24 8396 223 5 6 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.899600e+01 2.458960e+01 25 16 10594 67 10 19 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.328100e+01 2.551005e+01 50 25 12514 245 1 0 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.727300e+01 2.648029e+01 27 16 14423 73 2 2 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 4.072200e+01 2.713521e+01 9 6 16134 16 8 7 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.433400e+01 2.754094e+01 7 5 17857 8 5 1 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.749200e+01 2.768887e+01 9 7 19379 12 5 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 5.024900e+01 2.792095e+01 8 6 20802 22 9 5 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 5.220900e+01 2.798368e+01 10 7 22010 10 5 1 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 5.414800e+01 2.805274e+01 9 6 23131 12 9 5 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.578200e+01 2.827077e+01 12 8 24076 18 5 4 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.736500e+01 2.825765e+01 15 10 24995 22 9 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.889500e+01 2.816877e+01 15 9 25874 36 9 12 1591 90 2.798628e+01 2.836265e+01 3.763610e-01 1.344805e-02 6.000300e+01 2.801527e+01 2 2 26574 1 6 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 27.986284000416873 Dual Gap (relative): 0.013448052802669235 Search Statistics. Total number of nodes processed: 1681 Total number of lmo calls: 26574 Total time (s): 60.004 LMO calls / sec: 442.8704753016466 Nodes / sec: 28.01479901339911 LMO calls / node: 15.80844735276621 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2222 Local tightenings / node: 1.4 Total number of potential local tightenings: 5452 Number of alternative decisions: 438 Number of stable decisions: 402 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 73 64 4885 36 6 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.285000e+00 1.011673e+01 102 40 256 696 19 22 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.748000e+00 1.911678e+01 143 32 2096 346 11 15 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.581000e+00 2.097902e+01 80 37 3186 412 13 6 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.671100e+01 2.399617e+01 96 49 6017 417 2 1 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.288300e+01 2.600184e+01 55 31 8679 179 9 3 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.829600e+01 2.703562e+01 22 14 11070 27 9 3 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.337100e+01 2.789847e+01 71 34 13344 339 17 8 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.812700e+01 2.835261e+01 52 21 15506 341 8 3 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.231800e+01 2.856940e+01 50 26 17444 229 10 6 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.636300e+01 2.879451e+01 7 5 19379 9 7 6 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.958100e+01 2.914423e+01 50 24 21026 246 8 7 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.300100e+01 2.903719e+01 45 24 22661 137 4 3 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.590900e+01 2.910086e+01 7 5 24161 6 4 6 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.827400e+01 2.894945e+01 13 9 25390 20 6 3 1270 461 2.549821e+01 2.836265e+01 2.864438e+00 1.123388e-01 6.000300e+01 2.884856e+01 46 22 26286 225 13 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 25.49820682137755 Dual Gap (relative): 0.11233880970899872 Search Statistics. Total number of nodes processed: 1731 Total number of lmo calls: 26286 Total time (s): 60.004 LMO calls / sec: 438.07079528031466 Nodes / sec: 28.848076794880342 LMO calls / node: 15.185441941074524 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2322 Local tightenings / node: 1.83 Total number of potential local tightenings: 5695 Number of alternative decisions: 543 Number of stable decisions: 322 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.280000e-01 5.681818e+00 474 74 64 4885 2 2 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.584000e+00 1.586687e+01 82 35 678 489 23 5 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.289000e+00 1.915476e+01 76 39 968 257 17 12 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.870000e+00 2.554003e+01 14 8 2918 60 2 4 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.270300e+01 3.015036e+01 33 17 5197 153 21 2 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.728500e+01 3.280301e+01 24 14 7469 83 5 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.161800e+01 3.399944e+01 28 14 9610 131 7 3 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.643900e+01 3.453232e+01 41 20 11880 193 7 5 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 3.057900e+01 3.502404e+01 36 19 13971 113 6 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.472700e+01 3.521755e+01 22 13 15981 55 3 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.808900e+01 3.552207e+01 40 23 17719 139 13 1 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 4.159000e+01 3.541717e+01 17 11 19510 37 9 3 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.507300e+01 3.543141e+01 64 26 21254 396 7 4 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.793800e+01 3.535817e+01 10 7 22747 24 8 3 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.991500e+01 3.544025e+01 3 2 24101 6 4 1 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 5.143700e+01 3.555806e+01 14 9 25317 23 11 5 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.312400e+01 3.510654e+01 7 4 26374 10 5 1 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.467600e+01 3.462214e+01 9 7 27346 16 8 1 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.592500e+01 3.409924e+01 17 10 28188 61 3 1 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.707900e+01 3.365511e+01 6 3 29039 10 7 8 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.824700e+01 3.311759e+01 8 5 29805 14 8 2 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.894400e+01 3.275991e+01 6 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.945 LMO calls / sec: 513.3599117821698 Nodes / sec: 32.75935193824752 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.740000e-01 6.329114e+00 470 74 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.870000e-01 1.143583e+01 87 37 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.210000e-01 1.194354e+01 132 47 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.230000e+00 2.442284e+01 91 38 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.840000e+00 2.454751e+01 78 34 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.422800e+01 2.818386e+01 33 16 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.810700e+01 3.297067e+01 34 14 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.182500e+01 3.633448e+01 36 17 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.512400e+01 3.848909e+01 12 7 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 2.873900e+01 3.963256e+01 41 19 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.150000e+01 4.041270e+01 10 6 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 3.379500e+01 4.050895e+01 5 3 20396 14 8 12 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 3.556300e+01 4.012597e+01 37 15 21910 381 1 1 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 3.689900e+01 3.986558e+01 7 5 23162 19 11 10 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 3.811500e+01 3.932835e+01 21 12 24363 145 12 7 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 3.905100e+01 3.879542e+01 6 4 25359 25 10 8 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 3.993000e+01 3.824192e+01 23 11 26283 172 9 5 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 4.072000e+01 3.764735e+01 9 6 27090 27 10 9 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 4.115800e+01 3.729530e+01 4 3 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): 41.159 LMO calls / sec: 670.0843071989116 Nodes / sec: 37.29439490755363 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 3.130000e-01 9.584665e+00 312 47 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 5.180000e-01 1.737452e+01 58 24 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 6.060000e-01 1.815182e+01 86 30 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 5.658000e+00 3.552492e+01 58 24 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 6.056000e+00 3.583223e+01 47 19 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 9.733000e+00 4.120004e+01 34 16 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.358300e+01 4.395200e+01 34 14 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 1.739100e+01 4.559830e+01 33 16 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.060500e+01 4.693036e+01 13 8 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 2.433400e+01 4.680694e+01 61 26 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 2.844800e+01 4.474831e+01 22 15 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 3.223600e+01 4.246805e+01 7 4 20396 14 8 12 ====================================================================================== 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 49 running 1 of 1 signal (10): User defined signal 1 + at ./float.jl:492 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1046 [inlined] macro expansion at ./simdloop.jl:77 [inlined] dot at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/generic.jl:1045 unknown function (ip: 0x7b14a2b5adc1) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 f at /home/pkgeval/.julia/packages/Boscia/gDHaL/test/branching_strategy_test.jl:45 find_best_solution at /home/pkgeval/.julia/packages/Boscia/gDHaL/ext/BosciaSCIPExt.jl:30 unknown function (ip: 0x7b14a1e09712) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 find_best_solution at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:591 unknown function (ip: 0x7b14a1e089d1) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #process_FW_callback_logic#36 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/callbacks.jl:97 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/callbacks.jl:59 [inlined] #32 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/callbacks.jl:24 unknown function (ip: 0x7b14a1e11cc6) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #blended_pairwise_conditional_gradient#356 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:261 unknown function (ip: 0x7b14a1ff586a) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:76 #solve_frank_wolfe#6 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/frank_wolfe_variants.jl:158 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/frank_wolfe_variants.jl:138 unknown function (ip: 0x7b14a1fea657) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/node.jl:353 #optimize!#12 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/custom_bonobo.jl:35 optimize! at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/custom_bonobo.jl:29 unknown function (ip: 0x7b14a1fe7387) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/interface.jl:270 unknown function (ip: 0x7b14a1fc543d) 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/gDHaL/src/interface.jl:28 #solve#145 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7b14a1fbd248) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 include_string at ./loading.jl: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_54631.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_54631.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_65414.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: 0x7b14da9c9249) 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 ============================================================== 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 3.548900e+01 4.015329e+01 9 5 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 3.776700e+01 3.894935e+01 30 13 23185 174 5 4 ====================================================================================== 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 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.387800e+01 3.407174e+01 24 20 24396 13 7 5 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_38735.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 0x0000719c64932a40 Total snapshots: 425. Utilization: 0% ╎425 @Base/task.jl:1168 wait_forever() 424╎ 425 @Base/task.jl:1246 wait() 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.725500e+01 3.197545e+01 11 7 25388 20 10 1 ┌ 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 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.304500e+01 2.859836e+01 17 10 26318 33 12 12 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007b14c09fc010 Total snapshots: 111. Utilization: 100% ╎106 @Base/client.jl:577 _start() ╎ 106 @Base/client.jl:310 exec_options(opts::Base.JLOptions) ╎ 106 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ 106 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ 106 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _path::St… ╎ 106 @Base/loading.jl:3063 _include(mapexpr::Function, mod::Module, _pa… ╎ ╎ 106 @Base/loading.jl:3003 include_string(mapexpr::typeof(identity), m… ╎ ╎ 106 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 106 @Base/Base.jl:311 (::Base.IncludeInto)(fname::String) ╎ ╎ 106 @Base/Base.jl:310 include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 106 @Base/loading.jl:3063 _include(mapexpr::Function, mod::Module… ╎ ╎ ╎ 106 @Base/loading.jl:3003 include_string(mapexpr::typeof(identit… ╎ ╎ ╎ 106 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ ╎ 106 @Boscia/…oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 106 @Boscia/…oracle.jl:834 #solve#145 ╎ ╎ ╎ 106 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Na… ╎ ╎ ╎ ╎ 106 @Boscia/…rface.jl:270 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 106 @Boscia/…onobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 105 @Boscia/…onobo.jl:35 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 5 @Boscia/…node.jl:341 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 5 @Boscia/…blem.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…cle.jl:229 is_linear_feasible 1╎ ╎ ╎ ╎ ╎ 5 @Boscia/…cle.jl:234 is_linear_feasible(o::SCIP.Op… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…le.jl:247 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…pper.jl:394 get(o::SCIP.Optimizer, ::Mat… ╎ ╎ ╎ ╎ ╎ 2 @Base/…ray.jl:1345 push! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ray.jl:1348 _push! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1205 _growend! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1181 _growend_internal!(a::Vec… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1101 array_new_memory 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:588 GenericMemory ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ray.jl:1349 _push! 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1044 __safe_setindex! ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:396 get(o::SCIP.Optimizer, ::Mat… ╎ ╎ ╎ ╎ ╎ 1 @Base/sort.jl:1734 sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/sort.jl:1741 #sort!#24 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1594 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:561 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:686 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:747 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:802 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:731 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:780 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1380 _sort!(v::Vector{Ma… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1123 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1165 _sort!(v::Vector{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:845 _sort!(v::Vector{… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:120 lt ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:118 lt ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:484 isless 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @Base/int.jl:83 < ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:249 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:47 get ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…able.jl:39 is_valid ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/set.jl:92 in ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:550 haskey ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:244 ht_keyindex(h::Dict{SCIP.… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ 100 @Boscia/…node.jl:353 evaluate_node!(tree::BnBTree{Bo… ╎ ╎ ╎ ╎ 100 @Boscia/…ants.jl:138 kwcall(::@NamedTuple{epsilon::… ╎ ╎ ╎ ╎ ╎ 100 @Boscia/…nts.jl:158 #solve_frank_wolfe#6 ╎ ╎ ╎ ╎ ╎ 100 @FrankWolfe/…jl:76 kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:206 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64}, … ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:438 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:453 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:50 (::var"#grad!#build_examples… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:270 mul!(C::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:73 mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:76 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:81 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:706 gemv! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:678 gemv!(trans::Char, … ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:467 perform_line_search(line_sea… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…st.jl:45 (::var"#f#build_examples##0"… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1042 dot(x::Vector{Float64},… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…als.jl:965 getindex ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1045 dot(x::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 17 @FrankWolfe/…l:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 17 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 17 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:81 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ing.jl:402 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:340 current_logger_for_env(std… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:536 current_logstate ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…es.jl:213 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:1002 get(dict::Base.Persist… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…mt.jl:93 HashState 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ ╎ 15 @Boscia/…s.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 15 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:828 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #sol_values##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:478 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:243 ht_keyindex(h::Dic… ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:864 collect_to_with_first!(… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 none:? #sol_values##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ct.jl:478 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:238 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:244 ht_keyindex(h::D… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 2 @Base/…ng.jl:46 hash 2╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 2 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:479 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:395 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:385 checkbounds 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:381 checkbounds ╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 9 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 8 @LinearAlgebra/…:1045 dot(x::Vector{Float… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:0 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:75 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @LinearAlgebra/…:1046 macro expansion 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ls.jl:965 getindex 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:988 dot 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:494 * 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:35 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…s.jl:119 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:45 (::var"#f#build_examples##0… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float64… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:492 + ╎ ╎ ╎ ╎ ╎ 63 @FrankWolfe/…l:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 63 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 53 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 53 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 53 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 51 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 51 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 51 @SCIP/…er.jl:16 macro expansion 51╎ ╎ ╎ ╎ ╎ ╎ ╎ 51 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:364 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:893 materialize ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:918 copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:946 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:993 copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:994 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:615 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:619 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:671 _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…st.jl:698 _broadcast_getin… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…ts.jl:92 get(o::SCIP.Opti… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 @Base/…ct.jl:478 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/…ct.jl:244 ht_keyindex(h:… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 @Base/…ct.jl:129 hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +5 1 @Base/…ng.jl:40 hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +6 1 @Base/…ng.jl:46 hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +7 1 @Base/…ls.jl:897 objectid ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:118 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…em.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/….jl:234 is_linear_feasible(o::SCIP… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:238 ht_keyindex(h::Dict{SCIP.… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:249 is_linear_feasible_subrou… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:47 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @MathOptInterface/…:115 throw_if_not_val… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…le.jl:39 is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/set.jl:92 in ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:550 haskey 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:238 ht_keyindex(h::Dict… ╎ ╎ ╎ ╎ ╎ 8 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 8 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 8 @Boscia/…t.jl:49 free_model 8╎ ╎ ╎ ╎ ╎ ╎ 8 @SCIP/…IP.jl:18686 SCIPfreeTransform 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:340 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 4 @FrankWolfe/…l:356 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 4 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:81 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…ing.jl:402 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:340 current_logger_for_env(std… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:536 current_logstate ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…es.jl:213 get 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:997 get(dict::Base.Persiste… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:341 current_logger_for_env(std… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ng.jl:566 env_override_minlevel(gro… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:165 get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:59 access_env(onError::Retu… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:55 _getenv ╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…ks.jl:97 process_FW_callback_logic(t… 1╎ ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:30 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/….jl:45 (::var"#f#build_examples##… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1045 dot(x::Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…op.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1046 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:965 getindex ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:411 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:24 (::Boscia.var"#32#33"{Bool, B… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:97 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:591 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:28 find_best_solution(tree::B… ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…ce.jl:25 sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:828 collect ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:48 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:? #sol_values##0 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18076 SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:427 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:44 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @Base/…math.jl:27 - ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…math.jl:13 _broadcast_preserving_zero_d ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:3544 map ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:838 collect ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:416 iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:425 _zip_iterate_all ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rs.jl:433 _zip_iterate_some ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1245 iterate 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1252 _iterate_abstract… 1╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:483 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…mo.jl:116 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:24 compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…:358 _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimiz… ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…er.jl:16 macro expansion 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 @SCIP/…IP.jl:18664 SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:130 compute_extreme_point(tlmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…e.jl:455 free_model ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…t.jl:49 free_model 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:18686 SCIPfreeTransform ╎ ╎ ╎ ╎ 1 @Boscia/…onobo.jl:97 optimize!(tree::BnBTree{Boscia.F… ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:232 callback ╎ ╎ ╎ ╎ 1 @Boscia/…acks.jl:295 (::Boscia.var"#callback#build_… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:838 collect(itr::Base.Generator{Dat… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:864 collect_to_with_first! ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:886 collect_to! ╎ ╎ ╎ ╎ ╎ 1 @Base/…ator.jl:45 iterate ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:410 iterate ╎ ╎ ╎ ╎ ╎ ╎ 1 @DataStructures/…:318 dequeue_pair!(pq::DataS… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:679 delete!(h::Dict{Int64, Int… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:646 _delete! 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:87 + 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.437400e+01 2.800971e+01 10 6 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.492800e+01 2.772721e+01 6 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): 54.929 LMO calls / sec: 501.1014218354603 Nodes / sec: 27.726701742249084 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: [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_38735.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: 27658458 (Pool: 27657785; Big: 673); GC: 22 [49] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/gDHaL/test/branching_strategy_test.jl:275 _ZN4llvm19SmallPtrSetImplBase14insert_imp_bigEPKv at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm21FindFunctionBackedgesERKNS_8FunctionERNS_15SmallVectorImplISt4pairIPKNS_10BasicBlockES7_EEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZL22iterativelySimplifyCFGRN4llvm8FunctionERKNS_19TargetTransformInfoEPNS_14DomTreeUpdaterERKNS_18SimplifyCFGOptionsE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZL23simplifyFunctionCFGImplRN4llvm8FunctionERKNS_19TargetTransformInfoEPNS_13DominatorTreeERKNS_18SimplifyCFGOptionsE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZL19simplifyFunctionCFGRN4llvm8FunctionERKNS_19TargetTransformInfoEPNS_13DominatorTreeERKNS_18SimplifyCFGOptionsE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm15SimplifyCFGPass3runERNS_8FunctionERNS_15AnalysisManagerIS1_JEEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_8FunctionENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm27ModuleToFunctionPassAdaptor3runERNS_6ModuleERNS_15AnalysisManagerIS1_JEEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_6ModuleENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/src/pipeline.cpp:787 operator() at /source/src/jitlayers.cpp:1508 withModuleDo<(anonymous namespace)::sizedOptimizerT::operator()(llvm::orc::ThreadSafeModule) [with long unsigned int N = 4]:: > at /source/usr/include/llvm/ExecutionEngine/Orc/ThreadSafeModule.h:136 [inlined] operator() at /source/src/jitlayers.cpp:1469 [inlined] operator() at /source/src/jitlayers.cpp:1644 [inlined] addModule at /source/src/jitlayers.cpp:2101 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 print at ./strings/io.jl:46 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 println at ./coreio.jl:6 unknown function (ip: 0x7b14a1e7a6e6) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/interface.jl:63 unknown function (ip: 0x7b14a1fc543d) 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/gDHaL/src/interface.jl:28 #solve#145 at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:834 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/gDHaL/src/MOI_bounded_oracle.jl:832 unknown function (ip: 0x7b14a1fbd248) 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:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_54631.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_54631.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_65414.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: 0x7b14da9c9249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) Allocations: 5203598590 (Pool: 5203594665; Big: 3925); GC: 2577 PkgEval terminated after 2728.35s: test duration exceeded the time limit