Package evaluation to test Boscia on Julia 1.11.7 (58327cce5e*) started at 2025-10-28T23:21:16.698 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.39s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.11/Project.toml` [36b166db] + Boscia v0.2.1 Updating `~/.julia/environments/v1.11/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.1 [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.14.0 [f6369f11] + ForwardDiff v1.2.2 [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.2.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.2.1 [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.5.1 [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.6.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.11.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.2.0 [44cfe95a] + Pkg v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.11.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] + LibCURL_jll v8.6.0+0 [e37daf67] + LibGit2_jll v1.7.2+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.6+0 [14a3606d] + MozillaCACerts_jll v2023.12.12 [4536629a] + OpenBLAS_jll v0.3.27+1 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.7.0+0 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 [8e850ede] + nghttp2_jll v1.59.0+0 [3f19e933] + p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.2s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 259.46s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_EJIOK3/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.1 [31c24e10] Distributions v0.25.122 [497a8b3b] DoubleFloats v1.5.0 [f55ce6ea] FrankWolfe v0.6.1 [87dc4568] HiGHS v1.20.0 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.46.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_EJIOK3/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.1 [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 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [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 [1a297f60] FillArrays v1.14.0 [f6369f11] ForwardDiff v1.2.2 [f55ce6ea] FrankWolfe v0.6.1 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [87dc4568] HiGHS v1.20.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.2.0 [0f8b85d8] JSON3 v1.14.3 [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 ⌅ [aea7be01] PrecompileTools v1.2.1 [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 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.7 [4c63d2b9] StatsFuns v1.5.2 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.5.1 [fd094767] Suppressor v0.2.8 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [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 [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.200+0 [e5ac4fe4] SCIP_jll v900.200.200+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 [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.6.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.11.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [781609d7] GMP_jll v6.3.0+0 [deac9b47] LibCURL_jll v8.6.0+0 [e37daf67] LibGit2_jll v1.7.2+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.6+0 [14a3606d] MozillaCACerts_jll v2023.12.12 [4536629a] OpenBLAS_jll v0.3.27+1 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.7.0+0 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.59.0+0 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling Distributions... 4092.5 ms ✓ StatsBase 1629.5 ms ✓ PDMats → StatsBaseExt 9287.0 ms ✓ Distributions 3 dependencies successfully precompiled in 17 seconds. 44 already precompiled. Precompiling DistributionsTestExt... 3899.1 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 5 seconds. 49 already precompiled. Precompiling DistributionsChainRulesCoreExt... 3939.7 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 5 seconds. 52 already precompiled. Interface Tests seed = 0xc5700356680b5e74 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution LMO Tests seed = 0xc7a9e7ffea15d2c0 Indicator Tests Heuristics Tests seed = 0x0eccf4e8331c6f95 Sparse Regression Tests seed = 0x37775eb0ac3bcd8a 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.334426e+00 2.364411e+00 2.998492e-02 1.284467e-02 2.444700e+01 1.227144e-01 5965 37 9 8 3 1 3 4 2.350645e+00 2.364411e+00 1.376565e-02 5.856115e-03 2.713100e+01 2.580074e-01 28 21 21 4 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.104345e+00 -8.579155e-02 7.190137e+00 0.000000e+00 Inf 1 LD 2 2.364411e+00 2.364411e+00 0.000000e+00 4.895922e+00 4.085032e-01 1 Last 2 2.364411e+00 2.364411e+00 0.000000e+00 5.017585e+00 3.985981e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.364411e+00 2.364411e+00 0.000000e+00 5.022573e+00 3.982023e-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.3644105845650474 Dual Bound: 2.35064493844818 Dual Gap (relative): 0.005856114588686033 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 26 Total time (s): 34.155 LMO calls / sec: 0.7612355438442395 Nodes / sec: 0.20494803103498754 LMO calls / node: 3.7142857142857144 Total number of global tightenings: 44 Global tightenings / node: 14.67 Total number of local tightenings: 46 Local tightenings / node: 15.33 Total number of potential local tightenings: 46 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.278855e+00 2.866857e+00 1.588001e+00 1.241736e+00 1.544100e+01 1.942879e-01 6263 285 41 104 26 1 100 69 2.174265e+00 2.866857e+00 6.925916e-01 3.185406e-01 2.553800e+01 6.617589e+00 31 23 1443 19 16 0 200 69 2.293980e+00 2.866857e+00 5.728762e-01 2.497302e-01 2.818700e+01 9.543407e+00 35 25 1849 22 16 0 300 69 2.355971e+00 2.866857e+00 5.108859e-01 2.168473e-01 3.072300e+01 1.201055e+01 30 21 2252 25 14 6 400 69 2.407346e+00 2.866857e+00 4.595107e-01 1.908786e-01 3.326300e+01 1.409975e+01 34 24 2667 29 13 0 500 69 2.452305e+00 2.866857e+00 4.145516e-01 1.690457e-01 3.573000e+01 1.592499e+01 34 24 3084 30 11 1 600 69 2.493034e+00 2.866857e+00 3.738225e-01 1.499468e-01 3.826300e+01 1.748425e+01 27 20 3517 19 8 2 700 69 2.537010e+00 2.866857e+00 3.298469e-01 1.300140e-01 4.078200e+01 1.885636e+01 35 24 3951 42 13 8 800 69 2.582589e+00 2.866857e+00 2.842673e-01 1.100707e-01 4.336100e+01 2.004105e+01 34 24 4402 22 5 0 900 69 2.637387e+00 2.866857e+00 2.294691e-01 8.700622e-02 4.594300e+01 2.109135e+01 33 24 4866 22 7 4 1000 69 2.694642e+00 2.866857e+00 1.722149e-01 6.391013e-02 4.869400e+01 2.195342e+01 38 25 5365 41 11 5 1100 43 2.775056e+00 2.866857e+00 9.180047e-02 3.308058e-02 5.112800e+01 2.235566e+01 37 25 5822 31 6 3 1151 6 2.839878e+00 2.866857e+00 2.697849e-02 9.499875e-03 5.222400e+01 2.215456e+01 15 10 6021 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.103955e+00 -2.094518e-01 7.313406e+00 0.000000e+00 Inf 1 LD 2 2.866857e+00 2.866857e+00 0.000000e+00 1.127655e-01 1.773592e+01 1 Last 2 2.866857e+00 2.866857e+00 0.000000e+00 2.291834e-01 8.726637e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.866857e+00 2.866857e+00 0.000000e+00 2.336985e-01 8.558035e+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: 2.866856590576762 Dual Bound: 2.8398781031462486 Dual Gap (relative): 0.009499875153311858 Search Statistics. Total number of nodes processed: 1157 Total number of lmo calls: 6026 Total time (s): 54.27 LMO calls / sec: 111.03740556476875 Nodes / sec: 21.319329279528283 LMO calls / node: 5.208297320656871 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 Non zero entries: 7th entry: 0.16761123073720466 50th entry: 0.16761123073720466 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.428253e+00 2.866857e+00 1.438603e+00 1.007247e+00 3.300000e-01 9.090909e+00 323 260 41 104 26 1 100 33 2.295760e+00 2.866857e+00 5.710968e-01 2.487616e-01 9.845000e+00 1.350940e+01 34 24 1443 29 16 0 200 34 2.444722e+00 2.866857e+00 4.221343e-01 1.726717e-01 1.375200e+01 1.701571e+01 28 20 2074 21 8 0 300 34 2.547105e+00 2.866857e+00 3.197517e-01 1.255353e-01 1.751100e+01 1.907373e+01 23 16 2707 10 3 0 400 34 2.652582e+00 2.866857e+00 2.142746e-01 8.077962e-02 2.156800e+01 2.012240e+01 38 26 3414 30 11 4 500 33 2.771730e+00 2.866857e+00 9.512685e-02 3.432039e-02 2.558000e+01 2.083659e+01 35 24 4156 26 6 5 538 15 2.838883e+00 2.866857e+00 2.797367e-02 9.853761e-03 2.697000e+01 2.050426e+01 35 25 4422 18 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.103955e+00 -2.094518e-01 7.313406e+00 0.000000e+00 Inf 1 LD 2 2.866857e+00 2.866857e+00 0.000000e+00 1.169739e-03 1.709783e+03 1 Last 2 2.866857e+00 2.866857e+00 0.000000e+00 9.887014e-03 2.022855e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.866857e+00 2.866857e+00 0.000000e+00 1.418750e-02 1.409691e+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: 2.866856590576762 Dual Bound: 2.8388829174458152 Dual Gap (relative): 0.009853760772957524 Search Statistics. Total number of nodes processed: 553 Total number of lmo calls: 4427 Total time (s): 27.002 LMO calls / sec: 163.950818457892 Nodes / sec: 20.479964447077997 LMO calls / node: 8.005424954792044 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: 8 Poisson Tests seed = 0xbc8fb67195a10302 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -3.276712e+01 -1.418026e+01 1.858687e+01 1.310757e+00 1.514800e+01 1.980459e-01 6349 81 26 166 8 1 * 2 3 -3.276712e+01 -1.701916e+01 1.574796e+01 9.253079e-01 1.601100e+01 3.122853e-01 858 87 49 239 13 2 * 4 5 -3.276511e+01 -1.845612e+01 1.430899e+01 7.752976e-01 1.669700e+01 5.390190e-01 291 80 97 178 13 1 100 101 -3.274268e+01 -1.845612e+01 1.428656e+01 7.740824e-01 1.167920e+02 1.721008e+00 915 90 3069 814 30 6 103 104 -3.274168e+01 -1.845612e+01 1.428556e+01 7.740283e-01 1.200050e+02 1.724928e+00 619 62 3159 495 16 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.210980e+02 1.164620e+02 4.636058e+00 0.000000e+00 Inf 1 LD 4 -2.933724e+01 -3.066459e+01 1.327356e+00 2.209220e-01 1.810594e+01 2 LD 46 -3.141134e+01 -3.171357e+01 3.022250e-01 3.897941e-01 1.180110e+02 4 LD 51 -3.144026e+01 -3.156001e+01 1.197515e-01 4.011157e-01 1.271454e+02 5 LD 62 -3.144654e+01 -3.150536e+01 5.881398e-02 4.167057e-01 1.487861e+02 6 LD 69 -3.144885e+01 -3.147812e+01 2.926706e-02 4.326670e-01 1.594760e+02 8 LD 85 -3.144941e+01 -3.146149e+01 1.208448e-02 4.538244e-01 1.872971e+02 10 LD 122 -3.144957e+01 -3.145507e+01 5.497572e-03 4.891458e-01 2.494144e+02 11 LD 148 -3.144959e+01 -3.145210e+01 2.505761e-03 5.163081e-01 2.866506e+02 12 LD 189 -3.144960e+01 -3.145056e+01 9.593759e-04 5.556311e-01 3.401538e+02 13 LD 211 -3.144960e+01 -3.144999e+01 3.867998e-04 5.770592e-01 3.656470e+02 13 LD 239 -3.144960e+01 -3.144977e+01 1.717197e-04 6.056161e-01 3.946395e+02 14 LD 278 -3.144960e+01 -3.144967e+01 7.529325e-05 6.335747e-01 4.387801e+02 14 LD 314 -3.144960e+01 -3.144963e+01 2.993663e-05 6.626235e-01 4.738739e+02 15 LD 339 -3.144960e+01 -3.144961e+01 1.252636e-05 6.804638e-01 4.981896e+02 15 LD 374 -3.144960e+01 -3.144961e+01 5.771205e-06 7.087433e-01 5.276946e+02 16 LD 396 -3.144960e+01 -3.144960e+01 2.229707e-06 7.254575e-01 5.458624e+02 16 LD 440 -3.144960e+01 -3.144960e+01 7.763255e-07 7.587534e-01 5.798985e+02 17 LD 487 -3.144960e+01 -3.144960e+01 2.690880e-07 7.903524e-01 6.161809e+02 17 LD 531 -3.144960e+01 -3.144960e+01 8.458132e-08 8.541641e-01 6.216604e+02 17 Last 531 -3.144960e+01 -3.144960e+01 8.458132e-08 8.621084e-01 6.159318e+02 17 ---------------------------------------------------------------------------------------------------------------- PP 531 -3.144960e+01 -3.144960e+01 8.458133e-08 8.659193e-01 6.132211e+02 17 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -31.44959962698059 Dual Bound: -32.74168227766545 Dual Gap (relative): 0.04108423210502117 Search Statistics. Total number of nodes processed: 207 Total number of lmo calls: 3198 Total time (s): 122.871 LMO calls / sec: 26.02729692116122 Nodes / sec: 1.6846937031520863 LMO calls / node: 15.44927536231884 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 [ Info: Polish solution Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -3.272471e+01 -2.603240e+01 6.692308e+00 2.570761e-01 1.940300e+01 1.546153e-01 6784 273 36 237 18 1 * 2 3 -3.272471e+01 -2.636176e+01 6.362954e+00 2.413707e-01 2.092300e+01 2.389715e-01 334 148 56 163 20 3 * 3 4 -3.267986e+01 -2.783612e+01 4.843737e+00 1.740090e-01 2.246000e+01 3.116652e-01 498 228 87 248 18 3 * 9 10 -3.253199e+01 -2.820127e+01 4.330719e+00 1.535647e-01 3.086800e+01 6.155242e-01 414 194 235 200 7 3 * 10 11 -3.253199e+01 -2.839876e+01 4.133222e+00 1.455423e-01 3.210500e+01 6.541037e-01 188 96 249 92 19 9 * 17 18 -3.220057e+01 -2.887857e+01 3.322000e+00 1.150334e-01 4.119400e+01 8.496383e-01 419 183 423 238 14 6 * 27 28 -3.154287e+01 -2.921485e+01 2.328015e+00 7.968602e-02 5.329400e+01 1.032011e+00 427 154 660 261 12 10 * 33 34 -3.148468e+01 -2.926314e+01 2.221545e+00 7.591614e-02 6.034900e+01 1.110209e+00 346 126 789 212 12 6 100 95 -3.081490e+01 -2.926314e+01 1.551756e+00 5.302765e-02 1.313830e+02 1.484210e+00 188 86 2171 104 14 4 * 143 114 -3.065572e+01 -2.936984e+01 1.285881e+00 4.378237e-02 1.643340e+02 1.563888e+00 532 107 2823 422 10 2 200 131 -3.046516e+01 -2.936984e+01 1.095324e+00 3.729418e-02 2.008850e+02 1.647709e+00 23 17 3604 3 13 5 300 133 -3.026534e+01 -2.936984e+01 8.955008e-01 3.049049e-02 2.497540e+02 1.733706e+00 138 71 4649 68 3 2 400 133 -3.010597e+01 -2.936984e+01 7.361247e-01 2.506397e-02 2.986950e+02 1.784429e+00 122 79 5664 43 12 2 500 133 -3.001933e+01 -2.936984e+01 6.494853e-01 2.211402e-02 3.431360e+02 1.844750e+00 141 82 6618 54 13 11 600 133 -2.994368e+01 -2.936984e+01 5.738436e-01 1.953853e-02 3.868250e+02 1.894914e+00 174 87 7580 83 8 1 700 133 -2.986989e+01 -2.936984e+01 5.000515e-01 1.702602e-02 4.309100e+02 1.933118e+00 219 109 8536 108 9 6 800 131 -2.980507e+01 -2.936984e+01 4.352326e-01 1.481903e-02 4.732140e+02 1.967397e+00 180 93 9497 84 13 4 900 129 -2.974476e+01 -2.936984e+01 3.749197e-01 1.276547e-02 5.132860e+02 2.004730e+00 110 65 10417 50 5 2 1000 127 -2.969086e+01 -2.936984e+01 3.210167e-01 1.093015e-02 5.557190e+02 2.028003e+00 294 102 11366 190 9 4 1051 124 -2.966104e+01 -2.936984e+01 2.912019e-01 9.914997e-03 5.762310e+02 2.039113e+00 45 24 11875 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -6.631147e+00 -7.318666e+00 6.875185e-01 0.000000e+00 Inf 1 LD 2 -2.936984e+01 -2.936984e+01 0.000000e+00 1.133927e-01 1.763782e+01 1 Last 2 -2.936984e+01 -2.936984e+01 0.000000e+00 2.329473e-01 8.585633e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.936984e+01 -2.936984e+01 0.000000e+00 2.383305e-01 8.391708e+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: -29.369840597151793 Dual Bound: -29.66104246640348 Dual Gap (relative): 0.009914996585985101 Search Statistics. Total number of nodes processed: 1175 Total number of lmo calls: 11880 Total time (s): 578.429 LMO calls / sec: 20.538389326952835 Nodes / sec: 2.0313642642398637 LMO calls / node: 10.11063829787234 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 WARNING: redefinition of constant Main.groups. This may fail, cause incorrect answers, or produce other errors. Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.070140e+02 3.631012e+02 1.560872e+02 7.539932e-01 1.546000e+01 1.940492e-01 6546 124 19 33 7 0 * 5 6 2.278423e+02 3.543979e+02 1.265556e+02 5.554528e-01 1.612500e+01 6.821705e-01 141 98 80 35 4 0 * 34 35 2.706573e+02 3.515911e+02 8.093385e+01 2.990271e-01 1.986600e+01 3.473271e+00 83 57 445 20 1 1 100 91 3.053729e+02 3.515911e+02 4.621817e+01 1.513499e-01 2.622600e+01 7.282849e+00 58 40 1108 15 2 1 200 121 3.308412e+02 3.515911e+02 2.074994e+01 6.271874e-02 3.232800e+01 9.929473e+00 27 19 1803 6 3 0 * 295 82 3.421726e+02 3.509129e+02 8.740278e+00 2.554348e-02 3.606300e+01 1.050939e+01 18 13 2267 2 2 0 300 77 3.427854e+02 3.509129e+02 8.127436e+00 2.370998e-02 3.621600e+01 1.046499e+01 33 23 2287 6 2 1 355 26 3.478309e+02 3.509129e+02 3.081948e+00 8.860476e-03 3.778100e+01 1.013737e+01 31 21 2495 6 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.543979e+02 3.534992e+02 8.987234e-01 0.000000e+00 Inf 1 LD 2 3.509129e+02 3.509129e+02 2.048317e-11 1.227070e-01 1.629899e+01 2 Last 2 3.509129e+02 3.509129e+02 2.048317e-11 2.501609e-01 7.994855e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.509129e+02 3.509129e+02 4.961542e-11 2.550958e-01 7.840191e+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: 350.91285312860305 Dual Bound: 347.8309055777263 Dual Gap (relative): 0.008860476459841364 Search Statistics. Total number of nodes processed: 383 Total number of lmo calls: 2500 Total time (s): 40.02 LMO calls / sec: 62.4687656171914 Nodes / sec: 9.570214892553722 LMO calls / node: 6.527415143603133 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.070140e+02 3.631012e+02 1.560872e+02 7.539932e-01 1.826600e+01 1.642396e-01 6522 124 19 33 5 0 * 2 3 2.070140e+02 3.543979e+02 1.473839e+02 7.119514e-01 1.921800e+01 2.601728e-01 140 94 33 37 6 0 * 8 9 2.387950e+02 3.515911e+02 1.127961e+02 4.723553e-01 2.441100e+01 6.964074e-01 151 92 116 48 8 2 100 87 3.093944e+02 3.515911e+02 4.219666e+01 1.363847e-01 7.776100e+01 2.404804e+00 50 35 1045 12 3 0 200 123 3.316359e+02 3.515911e+02 1.995519e+01 6.017200e-02 1.109900e+02 2.910172e+00 16 11 1702 2 2 1 * 206 123 3.319325e+02 3.515634e+02 1.963090e+01 5.914124e-02 1.126250e+02 2.921199e+00 16 12 1733 2 2 1 * 287 78 3.413469e+02 3.509129e+02 9.565938e+00 2.802409e-02 1.235330e+02 3.019436e+00 13 9 2099 2 2 0 300 65 3.422065e+02 3.509129e+02 8.706327e+00 2.544173e-02 1.238520e+02 3.011659e+00 20 15 2142 2 2 0 343 26 3.479929e+02 3.509129e+02 2.919924e+00 8.390756e-03 1.256080e+02 3.001401e+00 28 20 2293 4 2 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.543979e+02 3.534992e+02 8.987234e-01 0.000000e+00 Inf 1 LD 2 3.509129e+02 3.509129e+02 2.048317e-11 1.213195e-01 1.648539e+01 2 Last 2 3.509129e+02 3.509129e+02 2.048317e-11 2.504039e-01 7.987096e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.509129e+02 3.509129e+02 4.961542e-11 2.554514e-01 7.829278e+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: 350.91285312860305 Dual Bound: 347.9929293950005 Dual Gap (relative): 0.008390755923342931 Search Statistics. Total number of nodes processed: 377 Total number of lmo calls: 2298 Total time (s): 127.889 LMO calls / sec: 17.96870723830822 Nodes / sec: 2.947868855022715 LMO calls / node: 6.095490716180372 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 = 0xc94134d3e355bd2f 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 -4.300705e+01 6.137866e+01 1.043857e+02 Inf 1.884600e+01 1.591850e-01 8802 215 45 10001 19 11 * 3 4 -3.606703e+01 3.224707e+01 6.831410e+01 Inf 1.995800e+01 3.507365e-01 440 152 133 6366 19 4 ┌ Error: Unexpected termination: TIME_LIMIT └ @ FrankWolfe ~/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:361 89 90 -9.675216e+00 3.224707e+01 4.192228e+01 Inf 6.004400e+01 2.981147e+00 293 153 3097 1915 15 12 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 32.24706765486421 Dual Bound: -9.675216467653684 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 179 Total number of lmo calls: 3097 Total time (s): 60.944 LMO calls / sec: 50.817143607245995 Nodes / sec: 2.937122604358099 LMO calls / node: 17.30167597765363 Total number of global tightenings: 9 Global tightenings / node: 0.1 Total number of local tightenings: 524 Local tightenings / node: 5.89 Total number of potential local tightenings: 905 Time Limit Test seed = 0xc2b0ff10cb642493 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 -6.517840e+00 -5.902250e+00 6.155898e-01 1.042975e-01 1.761200e+01 1.703384e-01 9049 381 22 10001 11 2 * 13 14 -6.268147e+00 -5.911447e+00 3.566996e-01 6.034048e-02 2.396700e+01 1.126549e+00 720 518 296 8323 9 5 22 23 -6.218987e+00 -5.911447e+00 3.075394e-01 5.202438e-02 3.005300e+01 1.497355e+00 678 529 503 4953 7 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -5.911447493159248 Dual Bound: -6.2189868630713505 Dual Gap (relative): 0.0520243764776713 Search Statistics. Total number of nodes processed: 45 Total number of lmo calls: 503 Total time (s): 30.99 LMO calls / sec: 16.23104227170055 Nodes / sec: 1.4520813165537272 LMO calls / node: 11.177777777777777 Total number of global tightenings: 4 Global tightenings / node: 0.18 Total number of local tightenings: 50 Local tightenings / node: 2.27 Total number of potential local tightenings: 78 Strong Convexity and Sharpness Tests seed = 0x3936a72f2d845b9e Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.960627e+02 1.961815e+02 1.187767e-01 6.058100e-04 1.352000e+01 2.218935e-01 4449 0 8 6 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 196.18145027893098 Dual Bound: 196.06267354842663 Dual Gap (relative): 0.000605810011435009 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 8 Total time (s): 14.535 LMO calls / sec: 0.5503955968352253 Nodes / sec: 0.20639834881320948 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 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.762113e+02 1.762279e+02 1.658378e-02 9.411304e-05 1.282100e+01 2.339911e-01 4061 1000 6 4 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 176.22790567303863 Dual Bound: 176.21132188967943 Dual Gap (relative): 9.411304098604911e-5 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 6 Total time (s): 13.708 LMO calls / sec: 0.43770061278085787 Nodes / sec: 0.21885030639042893 LMO calls / node: 2.0 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 Branching Strategy Tests seed = 0xafaf3ea162f74425 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.101800e+01 2.722817e-01 4741 47 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.224800e+01 5.306989e+00 13 9 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.121 LMO calls / sec: 72.63165917231917 Nodes / sec: 4.953890709549577 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.750000e-01 1.090909e+01 180 36 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.424000e+00 6.109551e+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.425 LMO calls / sec: 712.280701754386 Nodes / sec: 61.05263157894737 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 2.680000e-01 1.119403e+01 169 33 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.186000e+00 4.974705e+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.186 LMO calls / sec: 724.283305227656 Nodes / sec: 49.747048903878586 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.710000e-01 1.107011e+01 175 31 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.233000e+00 6.082725e+01 9 6 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.234 LMO calls / sec: 730.9562398703404 Nodes / sec: 60.777957860615885 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 2.330000e-01 1.287554e+01 160 31 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.454000e+00 6.671252e+01 3 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.455 LMO calls / sec: 806.8728522336769 Nodes / sec: 66.66666666666666 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.540000e-01 6.607930e+00 451 64 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.390000e-01 1.217862e+01 67 31 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.390000e-01 1.311085e+01 98 38 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 6.265000e+00 3.208300e+01 64 28 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 6.676000e+00 3.250449e+01 45 19 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.112200e+01 3.605467e+01 37 20 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.551100e+01 3.848881e+01 39 17 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.154900e+01 3.679985e+01 78 33 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.733900e+01 3.537072e+01 14 9 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.326900e+01 3.423608e+01 71 33 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.842700e+01 3.312775e+01 19 13 18546 31 10 2 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 146 running 1 of 1 signal (10): User defined signal 1 consLockCountsols at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) unknown function (ip: (nil)) ============================================================== Profile collected. A report will print at the next yield point ============================================================== 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.306800e+01 3.178694e+01 8 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.593300e+01 3.102345e+01 12 8 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.867000e+01 3.022396e+01 39 18 23185 174 5 4 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== 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:522 poptask at ./task.jl:1012 wait at ./task.jl:1021 #wait#733 at ./condition.jl:130 wait at ./condition.jl:125 [inlined] wait at ./process.jl:694 wait at ./process.jl:687 unknown function (ip: 0x74eb2f563972) _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 subprocess_handler at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:2146 #131 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:2086 withenv at ./env.jl:265 #118 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:1935 with_temp_env at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:1793 #116 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:1902 #mktempdir#28 at ./file.jl:819 unknown function (ip: 0x74eb2f55c0cd) _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 mktempdir at ./file.jl:815 mktempdir at ./file.jl:815 [inlined] #sandbox#115 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:1849 [inlined] sandbox at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:1841 unknown function (ip: 0x74eb2f55064a) _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 #test#128 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:2067 test at /source/usr/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:2011 [inlined] #test#146 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/API.jl:481 test at /source/usr/share/julia/stdlib/v1.11/Pkg/src/API.jl:460 unknown function (ip: 0x74eb2f55034d) _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 #test#77 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/API.jl:159 unknown function (ip: 0x74eb2f54fd1d) _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 test at /source/usr/share/julia/stdlib/v1.11/Pkg/src/API.jl:148 #test#75 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/API.jl:147 [inlined] test at /source/usr/share/julia/stdlib/v1.11/Pkg/src/API.jl:147 [inlined] #test#74 at /source/usr/share/julia/stdlib/v1.11/Pkg/src/API.jl:146 [inlined] test at /source/usr/share/julia/stdlib/v1.11/Pkg/src/API.jl:146 unknown function (ip: 0x74eb2f54c1b6) _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 jl_apply at /source/src/julia.h:2157 [inlined] do_call at /source/src/interpreter.c:126 eval_value at /source/src/interpreter.c:223 eval_stmt_value at /source/src/interpreter.c:174 [inlined] eval_body at /source/src/interpreter.c:670 eval_body at /source/src/interpreter.c:539 eval_body at /source/src/interpreter.c:539 jl_interpret_toplevel_thunk at /source/src/interpreter.c:824 jl_toplevel_eval_flex at /source/src/toplevel.c:943 jl_toplevel_eval_flex at /source/src/toplevel.c:886 ijl_toplevel_eval_in at /source/src/toplevel.c:994 eval at ./boot.jl:430 [inlined] include_string at ./loading.jl:2775 _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 _include at ./loading.jl:2835 include at ./Base.jl:562 jfptr_include_47022.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 exec_options at ./client.jl:316 _start at ./client.jl:524 jfptr__start_73678.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2951 [inlined] ijl_apply_generic at /source/src/gf.c:3128 jl_apply at /source/src/julia.h:2157 [inlined] true_main at /source/src/jlapi.c:900 jl_repl_entrypoint at /source/src/jlapi.c:1059 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x74eb30a22249) __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) unknown function (ip: (nil)) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ┌ 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.11/Profile/src/Profile.jl:1240 ┌ 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.11/Profile/src/Profile.jl:1240 Overhead ╎ [+additional indent] Count File:Line; Function ========================================================= Thread 1 Task 0x000074eb23bfc010 Total snapshots: 32. Utilization: 0% ╎32 @Base/client.jl:524; _start() ╎ 32 @Base/client.jl:316; exec_options(opts::Base.JLOptions) ╎ 32 @Base/Base.jl:562; include(mod::Module, _path::String) ╎ 32 @Base/loading.jl:2835; _include(mapexpr::Function, mod::Module, _path:… ╎ 32 @Base/loading.jl:2775; include_string(mapexpr::typeof(identity), mod:… ╎ 32 @Base/boot.jl:430; eval ╎ ╎ 32 @Pkg/src/API.jl:146; kwcall(::@NamedTuple{julia_args::Cmd}, ::typeo… ╎ ╎ 32 @Pkg/src/API.jl:146; #test#74 ╎ ╎ 32 @Pkg/src/API.jl:147; test ╎ ╎ 32 @Pkg/src/API.jl:147; #test#75 ╎ ╎ 32 @Pkg/src/API.jl:148; kwcall(::@NamedTuple{julia_args::Cmd}, ::t… ╎ ╎ ╎ 32 @Pkg/src/API.jl:159; test(pkgs::Vector{Pkg.Types.PackageSpec};… ╎ ╎ ╎ 32 @Pkg/src/API.jl:460; kwcall(::@NamedTuple{julia_args::Cmd, io… ╎ ╎ ╎ 32 @Pkg/src/API.jl:481; test(ctx::Pkg.Types.Context, pkgs::Vect… ╎ ╎ ╎ 32 …src/Operations.jl:2011; test ╎ ╎ ╎ 32 …src/Operations.jl:2067; test(ctx::Pkg.Types.Context, pkgs… ╎ ╎ ╎ ╎ 32 …rc/Operations.jl:1841; kwcall(::@NamedTuple{preferences:… ╎ ╎ ╎ ╎ 32 …rc/Operations.jl:1849; #sandbox#115 ╎ ╎ ╎ ╎ 32 @Base/file.jl:815; mktempdir ╎ ╎ ╎ ╎ 32 @Base/file.jl:815; mktempdir(fn::Function, parent::Str… ╎ ╎ ╎ ╎ 32 @Base/file.jl:819; mktempdir(fn::Pkg.Operations.var"#… ╎ ╎ ╎ ╎ ╎ 32 …/Operations.jl:1902; (::Pkg.Operations.var"#116#121… ╎ ╎ ╎ ╎ ╎ 32 …/Operations.jl:1793; with_temp_env(fn::Pkg.Operati… ╎ ╎ ╎ ╎ ╎ 32 …Operations.jl:1935; (::Pkg.Operations.var"#118#12… ╎ ╎ ╎ ╎ ╎ 32 @Base/env.jl:265; withenv(::Pkg.Operations.var"#1… ╎ ╎ ╎ ╎ ╎ 32 …Operations.jl:2086; (::Pkg.Operations.var"#131#… ╎ ╎ ╎ ╎ ╎ ╎ 32 …perations.jl:2146; subprocess_handler(cmd::Cmd… ╎ ╎ ╎ ╎ ╎ ╎ 32 …e/process.jl:687; wait(x::Base.Process) ╎ ╎ ╎ ╎ ╎ ╎ 32 …e/process.jl:694; wait(x::Base.Process, sync… ╎ ╎ ╎ ╎ ╎ ╎ 32 …ondition.jl:125; wait ╎ ╎ ╎ ╎ ╎ ╎ 32 …ondition.jl:130; wait(c::Base.GenericCondi… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 32 …ase/task.jl:1021; wait() 31╎ ╎ ╎ ╎ ╎ ╎ ╎ 32 …ase/task.jl:1012; poptask(W::Base.Intrus… 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.910100e+01 2.529568e+01 8 6 24396 13 7 5 Overhead ╎ [+additional indent] Count File:Line; Function ========================================================= Thread 1 Task 0x000075a28fffc010 Total snapshots: 274. Utilization: 100% ╎256 @Base/client.jl:524; _start() ╎ 256 @Base/client.jl:289; exec_options(opts::Base.JLOptions) ╎ 256 @Base/boot.jl:430; eval ╎ 256 @Base/sysimg.jl:38; include(fname::String) ╎ 256 @Base/loading.jl:2835; _include(mapexpr::Function, mod::Module, _pat… ╎ 256 @Base/loading.jl:2775; include_string(mapexpr::typeof(identity), mo… ╎ ╎ 256 @Base/boot.jl:430; eval ╎ ╎ 256 …cia/test/runtests.jl:17; top-level scope ╎ ╎ 256 @Test/src/Test.jl:1709; macro expansion ╎ ╎ 256 …ia/test/runtests.jl:30; macro expansion ╎ ╎ 256 @Base/sysimg.jl:38; include ╎ ╎ ╎ 256 @Base/loading.jl:2835; _include(mapexpr::Function, mod::Modul… ╎ ╎ ╎ 256 @Base/loading.jl:2775; include_string(mapexpr::typeof(identi… ╎ ╎ ╎ 256 @Base/boot.jl:430; eval ╎ ╎ ╎ 256 …/src/interface.jl:28; kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 256 …/src/interface.jl:264; solve(f::var"#f#155"{Vector{Float… ╎ ╎ ╎ ╎ 256 …/custom_bonobo.jl:29; kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 251 …custom_bonobo.jl:35; optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 6 …cia/src/node.jl:336; evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 6 …rc/utilities.jl:30; check_feasibility ╎ ╎ ╎ ╎ 6 …unded_oracle.jl:473; check_feasibility(blmo::Boscia… ╎ ╎ ╎ ╎ ╎ 6 …MOI_wrapper.jl:427; optimize!(o::SCIP.Optimizer) ╎ ╎ ╎ ╎ ╎ 6 …src/wrapper.jl:16; macro expansion 6╎ ╎ ╎ ╎ ╎ 6 …rc/LibSCIP.jl:18664; SCIPsolve ╎ ╎ ╎ ╎ 2 …cia/src/node.jl:352; evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 2 …/src/problem.jl:94; is_linear_feasible ╎ ╎ ╎ ╎ 2 …unded_oracle.jl:228; is_linear_feasible ╎ ╎ ╎ ╎ ╎ 2 …nded_oracle.jl:233; is_linear_feasible(o::SCIP.Opt… ╎ ╎ ╎ ╎ ╎ 1 …nded_oracle.jl:249; is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 …/functions.jl:131; eval_variables(value_fn::Bosc… ╎ ╎ ╎ ╎ ╎ 1 …ded_oracle.jl:231; valvar 1╎ ╎ ╎ ╎ ╎ 1 …essentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ 1 …nded_oracle.jl:254; is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ 243 …cia/src/node.jl:364; evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 243 …lfe_variants.jl:138; kwcall(::@NamedTuple{epsilon::F… ╎ ╎ ╎ ╎ 243 …lfe_variants.jl:158; #solve_frank_wolfe#6 ╎ ╎ ╎ ╎ ╎ 243 …ded_pairwise.jl:76; kwcall(::@NamedTuple{line_sear… ╎ ╎ ╎ ╎ ╎ 4 …ed_pairwise.jl:166; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 4 …acking_lmo.jl:104; compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 …acking_lmo.jl:106; compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ 1 …ded_oracle.jl:454; free_model ╎ ╎ ╎ ╎ ╎ ╎ 1 …ciaSCIPExt.jl:49; free_model 1╎ ╎ ╎ ╎ ╎ ╎ 1 …/LibSCIP.jl:18686; SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 3 …acking_lmo.jl:112; compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ 3 …ded_oracle.jl:54; compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 3 …ded_oracle.jl:56; #compute_extreme_point#117 ╎ ╎ ╎ ╎ ╎ ╎ 3 …oi_oracle.jl:24; compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 3 …oi_oracle.jl:43; compute_extreme_point(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 …i_oracle.jl:358; _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 3 …_wrapper.jl:427; optimize!(o::SCIP.Optimi… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …/wrapper.jl:16; macro expansion 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …/LibSCIP.jl:18664; SCIPsolve ╎ ╎ ╎ ╎ ╎ 1 …ed_pairwise.jl:168; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 …/src/matmul.jl:18; dot ╎ ╎ ╎ ╎ ╎ 1 …a/src/blas.jl:398; dot 1╎ ╎ ╎ ╎ ╎ 1 …a/src/blas.jl:348; dot ╎ ╎ ╎ ╎ ╎ 1 …ed_pairwise.jl:181; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Base/float.jl:1060; eps ╎ ╎ ╎ ╎ ╎ 1 @Base/float.jl:97; reinterpret 1╎ ╎ ╎ ╎ ╎ 1 …essentials.jl:730; reinterpret ╎ ╎ ╎ ╎ ╎ 1 …ed_pairwise.jl:184; blended_pairwise_conditional_… 1╎ ╎ ╎ ╎ ╎ 1 @Base/Base.jl:161; time_ns ╎ ╎ ╎ ╎ ╎ 3 …ed_pairwise.jl:206; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 3 …rategy_test.jl:45; (::var"#f#155"{Vector{Float64… ╎ ╎ ╎ ╎ ╎ 3 …rc/generic.jl:941; dot(x::Vector{Float64}, A::M… ╎ ╎ ╎ ╎ ╎ 3 …e/simdloop.jl:77; macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 3 …c/generic.jl:942; macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 …ssentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/float.jl:491; + ╎ ╎ ╎ ╎ ╎ 1 …ed_pairwise.jl:208; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 …rategy_test.jl:50; (::var"#grad!#156"{Vector{Flo… ╎ ╎ ╎ ╎ ╎ 1 …src/matmul.jl:253; mul!(C::Vector{Float64}, A::… ╎ ╎ ╎ ╎ ╎ 1 …src/matmul.jl:70; mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …src/matmul.jl:73; _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …rc/matmul.jl:79; generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …c/matmul.jl:450; gemv! 1╎ ╎ ╎ ╎ ╎ ╎ 1 …src/blas.jl:670; gemv!(trans::Char, alpha:… ╎ ╎ ╎ ╎ ╎ 2 …ed_pairwise.jl:211; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 …active_set.jl:355; active_set_argminmax ╎ ╎ ╎ ╎ ╎ 2 …active_set.jl:361; active_set_argminmax(active_… ╎ ╎ ╎ ╎ ╎ 2 …src/matmul.jl:18; dot ╎ ╎ ╎ ╎ ╎ ╎ 2 …/src/blas.jl:398; dot 2╎ ╎ ╎ ╎ ╎ ╎ 2 …/src/blas.jl:348; dot 1╎ ╎ ╎ ╎ ╎ 2 …ed_pairwise.jl:227; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 …e/src/utils.jl:9; muladd_memory_mode(memory_mode… ╎ ╎ ╎ ╎ ╎ 1 …/broadcast.jl:880; materialize! ╎ ╎ ╎ ╎ ╎ 1 …/broadcast.jl:883; materialize! ╎ ╎ ╎ ╎ ╎ ╎ 1 …broadcast.jl:925; copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 …broadcast.jl:972; copyto! ╎ ╎ ╎ ╎ ╎ ╎ 1 …/simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:973; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:610; getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:650; _broadcast_getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:674; _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:675; _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:644; _broadcast_getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:917; getindex ╎ ╎ ╎ ╎ ╎ 8 …ed_pairwise.jl:230; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 5 …linesearch.jl:438; perform_line_search(line_sear… 1╎ ╎ ╎ ╎ ╎ 5 …ategy_test.jl:45; (::var"#f#155"{Vector{Float64… ╎ ╎ ╎ ╎ ╎ 4 …rc/generic.jl:941; dot(x::Vector{Float64}, A::… ╎ ╎ ╎ ╎ ╎ ╎ 4 …e/simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 4 …c/generic.jl:942; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 …se/array.jl:930; getindex 2╎ ╎ ╎ ╎ ╎ ╎ 2 …sentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 …se/float.jl:491; + ╎ ╎ ╎ ╎ ╎ 2 …linesearch.jl:453; perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 …ategy_test.jl:50; (::var"#grad!#156"{Vector{Flo… ╎ ╎ ╎ ╎ ╎ 1 …src/matmul.jl:253; mul!(C::Vector{Float64}, A:… ╎ ╎ ╎ ╎ ╎ ╎ 1 …src/matmul.jl:70; mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …rc/matmul.jl:73; _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …rc/matmul.jl:79; generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …c/matmul.jl:450; gemv! 1╎ ╎ ╎ ╎ ╎ ╎ 1 …src/blas.jl:0; gemv!(trans::Char, alpha::… 1╎ ╎ ╎ ╎ ╎ 1 …ategy_test.jl:52; (::var"#grad!#156"{Vector{Flo… ╎ ╎ ╎ ╎ ╎ 1 …linesearch.jl:467; perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 …ategy_test.jl:45; (::var"#f#155"{Vector{Float64… ╎ ╎ ╎ ╎ ╎ 1 …rc/generic.jl:941; dot(x::Vector{Float64}, A::… ╎ ╎ ╎ ╎ ╎ ╎ 1 …e/simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 …c/generic.jl:942; macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:917; getindex 3╎ ╎ ╎ ╎ ╎ 3 …ed_pairwise.jl:245; blended_pairwise_conditional_… 1╎ ╎ ╎ ╎ ╎ 53 …ed_pairwise.jl:261; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 52 …c/callbacks.jl:24; (::Boscia.var"#25#27"{Bool, B… ╎ ╎ ╎ ╎ ╎ 52 …/callbacks.jl:59; process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ 47 …/callbacks.jl:97; process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 47 …ed_oracle.jl:592; find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 18 …iaSCIPExt.jl:28; find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 18 …nvenience.jl:25; sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/array.jl:791; collect(itr::Base.Generat… ╎ ╎ ╎ ╎ ╎ ╎ 1 …enerator.jl:48; iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:0; #107 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/LibSCIP.jl:18076; SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ 17 …se/array.jl:801; collect(itr::Base.Generat… ╎ ╎ ╎ ╎ ╎ ╎ 17 …se/array.jl:827; collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 14 …se/array.jl:849; collect_to!(dest::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 14 …enerator.jl:48; iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 14 none:0; #107 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …/LibSCIP.jl:18076; SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 11 …_wrapper.jl:128; var ╎ ╎ ╎ ╎ ╎ ╎ ╎ 11 …cip_data.jl:181; var 2╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 11 …ase/dict.jl:476; getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:236; ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 …ase/dict.jl:242; ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 …ase/dict.jl:128; hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 …/hashing.jl:28; hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 8 …/hashing.jl:37; hash 8╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 8 …flection.jl:741; objectid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …se/array.jl:853; collect_to!(dest::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/array.jl:986; setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:513; < 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …se/array.jl:987; setindex! 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/Base.jl:49; getproperty ╎ ╎ ╎ ╎ ╎ ╎ 29 …iaSCIPExt.jl:30; find_best_solution(tree::Bn… 1╎ ╎ ╎ ╎ ╎ ╎ 2 …tegy_test.jl:44; (::var"#f#155"{Vector{Floa… ╎ ╎ ╎ ╎ ╎ ╎ 1 …arraymath.jl:8; -(A::Vector{Float64}, B::V… ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:861; broadcast_preserving_zer… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:872; materialize ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:897; copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:925; copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:972; copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:973; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:610; getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:650; _broadcast_getin… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:674; _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:675; _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 …roadcast.jl:644; _broadcast_get… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 …sentials.jl:917; getindex 5╎ ╎ ╎ ╎ ╎ ╎ 27 …tegy_test.jl:45; (::var"#f#155"{Vector{Floa… ╎ ╎ ╎ ╎ ╎ ╎ 1 …/generic.jl:938; dot(x::Vector{Float64}, A… 1╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:916; getindex ╎ ╎ ╎ ╎ ╎ ╎ 21 …/generic.jl:941; dot(x::Vector{Float64}, A… 1╎ ╎ ╎ ╎ ╎ ╎ 1 …simdloop.jl:75; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 20 …simdloop.jl:77; macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 20 …/generic.jl:942; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/array.jl:930; getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:917; getindex 2╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …sentials.jl:917; getindex 16╎ ╎ ╎ ╎ ╎ ╎ ╎ 16 …se/float.jl:491; + 1╎ ╎ ╎ ╎ ╎ 1 …/callbacks.jl:118; process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ 4 …/callbacks.jl:119; process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 4 …ategy_test.jl:45; (::var"#f#155"{Vector{Float… ╎ ╎ ╎ ╎ ╎ ╎ 3 …c/generic.jl:941; dot(x::Vector{Float64}, A:… ╎ ╎ ╎ ╎ ╎ ╎ 3 …/simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 3 …/generic.jl:942; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/array.jl:930; getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 …se/float.jl:491; + ╎ ╎ ╎ ╎ ╎ ╎ 1 …c/generic.jl:944; dot(x::Vector{Float64}, A:… ╎ ╎ ╎ ╎ ╎ ╎ 1 …/generic.jl:884; dot 1╎ ╎ ╎ ╎ ╎ ╎ 1 …se/float.jl:493; * ╎ ╎ ╎ ╎ ╎ 1 …ed_pairwise.jl:282; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 …active_set.jl:480; storage_find_argmin_vertex ╎ ╎ ╎ ╎ ╎ 1 …src/matmul.jl:18; dot ╎ ╎ ╎ ╎ ╎ 1 …a/src/blas.jl:398; dot 1╎ ╎ ╎ ╎ ╎ ╎ 1 …/src/blas.jl:348; dot ╎ ╎ ╎ ╎ ╎ 136 …ed_pairwise.jl:291; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 136 …acking_lmo.jl:104; compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 …acking_lmo.jl:110; compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ 1 …OI_wrapper.jl:261; set ╎ ╎ ╎ ╎ ╎ ╎ 1 …I_wrapper.jl:228; set ╎ ╎ ╎ ╎ ╎ ╎ 1 …scip_data.jl:156; set_parameter(scipd::SCIP.… 1╎ ╎ ╎ ╎ ╎ ╎ 1 …/LibSCIP.jl:14618; SCIPgetParam ╎ ╎ ╎ ╎ ╎ 99 …acking_lmo.jl:112; compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ 99 …ded_oracle.jl:54; compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 99 …ded_oracle.jl:56; #compute_extreme_point#117 ╎ ╎ ╎ ╎ ╎ ╎ 99 …oi_oracle.jl:24; compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 1 …oi_oracle.jl:29; compute_extreme_point(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 …variable.jl:18; get ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:1690; sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:1697; #sort!#32 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:554; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:679; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:740; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:795; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:724; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:773; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:1363; _sort!(v::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:1106; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:1141; _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 …ase/sort.jl:1106; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 …ase/sort.jl:1148; _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 …ase/sort.jl:827; _sort!(v::Vect… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 …sentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 …oi_oracle.jl:32; compute_extreme_point(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 97 …oi_oracle.jl:43; compute_extreme_point(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 95 …i_oracle.jl:358; _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 95 …_wrapper.jl:427; optimize!(o::SCIP.Optimi… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 95 …/wrapper.jl:16; macro expansion 95╎ ╎ ╎ ╎ ╎ ╎ ╎ 95 …/LibSCIP.jl:18664; SCIPsolve ╎ ╎ ╎ ╎ ╎ ╎ 2 …i_oracle.jl:364; _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 2 …roadcast.jl:872; materialize ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …roadcast.jl:897; copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …roadcast.jl:925; copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …roadcast.jl:972; copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …roadcast.jl:973; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …roadcast.jl:610; getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …roadcast.jl:651; _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …roadcast.jl:678; _broadcast_getin… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …/results.jl:92; get(o::SCIP.Opti… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …_wrapper.jl:128; var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 2 …cip_data.jl:181; var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 …ase/dict.jl:476; getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 …ase/dict.jl:249; ht_keyindex(h:… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 …ase/dict.jl:477; getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 …sentials.jl:399; getindex ╎ ╎ ╎ ╎ ╎ 15 …acking_lmo.jl:114; compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ 15 …rc/problem.jl:94; is_linear_feasible ╎ ╎ ╎ ╎ ╎ ╎ 15 …ed_oracle.jl:228; is_linear_feasible 4╎ ╎ ╎ ╎ ╎ ╎ 15 …ed_oracle.jl:233; is_linear_feasible(o::SCIP… ╎ ╎ ╎ ╎ ╎ ╎ 3 …d_oracle.jl:246; is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 3 …_wrapper.jl:396; get(o::SCIP.Optimizer, ::… ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:1690; sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:1697; #sort!#32 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:554; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:679; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:740; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:795; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:724; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:773; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:1363; _sort!(v::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …ase/sort.jl:1106; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …ase/sort.jl:1141; _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 2 …ase/sort.jl:1106; _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 …ase/sort.jl:1116; _sort!(v::Vec… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 @Base/int.jl:86; - ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 …ase/sort.jl:1147; _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 …se/array.jl:2201; reverse!(v::V… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 …sentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/sort.jl:1146; _sort!(v::Vec… ╎ ╎ ╎ ╎ ╎ ╎ 2 …d_oracle.jl:248; is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 2 …variable.jl:47; get ╎ ╎ ╎ ╎ ╎ ╎ 2 …dextypes.jl:115; throw_if_not_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …variable.jl:32; is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:548; haskey ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:242; ht_keyindex(h::Dict{S… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:128; hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:28; hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:37; hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …flection.jl:741; objectid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …variable.jl:35; is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:503; get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:242; ht_keyindex(h::Dict{T… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:128; hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:28; hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/tuple.jl:583; hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:33; hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:32; _jl_type_hash(T::… 1╎ ╎ ╎ ╎ ╎ ╎ 1 …d_oracle.jl:249; is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 1 …d_oracle.jl:250; is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 1 …variable.jl:428; get(o::SCIP.Optimizer, ::… ╎ ╎ ╎ ╎ ╎ ╎ 1 …variable.jl:32; is_valid ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:548; haskey 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:236; ht_keyindex(h::Dict{SC… ╎ ╎ ╎ ╎ ╎ ╎ 3 …d_oracle.jl:253; is_linear_feasible_subrout… ╎ ╎ ╎ ╎ ╎ ╎ 3 …aSCIPExt.jl:56; get_tol ╎ ╎ ╎ ╎ ╎ ╎ 3 …_wrapper.jl:224; get ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …cip_data.jl:114; get_parameter(scipd::SC… 3╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 …/LibSCIP.jl:14618; SCIPgetParam 1╎ ╎ ╎ ╎ ╎ ╎ 1 …variable.jl:423; get(o::SCIP.Optimizer, ::M… ╎ ╎ ╎ ╎ ╎ 21 …acking_lmo.jl:126; compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ 21 …ded_oracle.jl:454; free_model ╎ ╎ ╎ ╎ ╎ ╎ 21 …ciaSCIPExt.jl:49; free_model 21╎ ╎ ╎ ╎ ╎ ╎ 21 …/LibSCIP.jl:18686; SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 2 …ed_pairwise.jl:327; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 …linesearch.jl:453; perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 …ategy_test.jl:50; (::var"#grad!#156"{Vector{Flo… ╎ ╎ ╎ ╎ ╎ 1 …src/matmul.jl:253; mul!(C::Vector{Float64}, A:… ╎ ╎ ╎ ╎ ╎ ╎ 1 …src/matmul.jl:70; mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …rc/matmul.jl:73; _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …rc/matmul.jl:79; generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 …c/matmul.jl:450; gemv! 1╎ ╎ ╎ ╎ ╎ ╎ 1 …src/blas.jl:670; gemv!(trans::Char, alpha… ╎ ╎ ╎ ╎ ╎ 1 …linesearch.jl:467; perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 …ategy_test.jl:45; (::var"#f#155"{Vector{Float64… ╎ ╎ ╎ ╎ ╎ 1 …rc/generic.jl:941; dot(x::Vector{Float64}, A::… 1╎ ╎ ╎ ╎ ╎ ╎ 1 …e/simdloop.jl:75; macro expansion 1╎ ╎ ╎ ╎ ╎ 1 …ed_pairwise.jl:340; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 5 …ed_pairwise.jl:356; blended_pairwise_conditional_… 1╎ ╎ ╎ ╎ ╎ 5 …c/callbacks.jl:24; (::Boscia.var"#25#27"{Bool, B… ╎ ╎ ╎ ╎ ╎ 4 …/callbacks.jl:59; process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ 4 …/callbacks.jl:97; process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 4 …ed_oracle.jl:592; find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 …iaSCIPExt.jl:28; find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 …nvenience.jl:25; sol_values ╎ ╎ ╎ ╎ ╎ ╎ 2 …se/array.jl:801; collect(itr::Base.Generat… ╎ ╎ ╎ ╎ ╎ ╎ 2 …se/array.jl:827; collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …se/array.jl:849; collect_to!(dest::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …enerator.jl:48; iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 none:0; #107 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/LibSCIP.jl:18076; SCIPgetSolVal ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …_wrapper.jl:128; var ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …cip_data.jl:181; var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:476; getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:242; ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:128; hashindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:28; hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:37; hash 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 …flection.jl:741; objectid ╎ ╎ ╎ ╎ ╎ ╎ 2 …iaSCIPExt.jl:30; find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 …tegy_test.jl:45; (::var"#f#155"{Vector{Floa… ╎ ╎ ╎ ╎ ╎ ╎ 2 …/generic.jl:941; dot(x::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 2 …simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …/generic.jl:942; macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/float.jl:491; + 1╎ ╎ ╎ ╎ ╎ 1 …ed_pairwise.jl:395; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 5 …ed_pairwise.jl:411; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 5 …c/callbacks.jl:24; (::Boscia.var"#25#27"{Bool, B… ╎ ╎ ╎ ╎ ╎ 5 …/callbacks.jl:59; process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ 3 …/callbacks.jl:97; process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 3 …ed_oracle.jl:592; find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 …iaSCIPExt.jl:28; find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 1 …nvenience.jl:25; sol_values ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/array.jl:801; collect(itr::Base.Generat… ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/array.jl:827; collect_to_with_first! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/array.jl:849; collect_to!(dest::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …enerator.jl:48; iterate ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 none:0; #107 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …_wrapper.jl:128; var 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/Base.jl:49; getproperty ╎ ╎ ╎ ╎ ╎ ╎ 2 …iaSCIPExt.jl:30; find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 2 …tegy_test.jl:45; (::var"#f#155"{Vector{Floa… ╎ ╎ ╎ ╎ ╎ ╎ 2 …/generic.jl:941; dot(x::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 2 …simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 2 …/generic.jl:942; macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …sentials.jl:917; getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/float.jl:491; + 1╎ ╎ ╎ ╎ ╎ 1 …/callbacks.jl:120; process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ 1 …/callbacks.jl:144; process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 …onversions.jl:70; now() ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/libc.jl:214; Base.Libc.TmStruct(t::Int6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/libc.jl:211; TmStruct ╎ ╎ ╎ ╎ ╎ 2 …ed_pairwise.jl:427; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 …rategy_test.jl:45; (::var"#f#155"{Vector{Float64… ╎ ╎ ╎ ╎ ╎ 2 …rc/generic.jl:941; dot(x::Vector{Float64}, A::M… ╎ ╎ ╎ ╎ ╎ 2 …e/simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 …c/generic.jl:942; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 2 …ase/array.jl:930; getindex 2╎ ╎ ╎ ╎ ╎ ╎ 2 …sentials.jl:917; getindex ╎ ╎ ╎ ╎ ╎ 10 …ed_pairwise.jl:483; blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 10 …acking_lmo.jl:104; compute_extreme_point ╎ ╎ ╎ ╎ ╎ 8 …acking_lmo.jl:112; compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ 8 …ded_oracle.jl:54; compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 8 …ded_oracle.jl:56; #compute_extreme_point#117 ╎ ╎ ╎ ╎ ╎ ╎ 8 …oi_oracle.jl:24; compute_extreme_point ╎ ╎ ╎ ╎ ╎ ╎ 8 …oi_oracle.jl:43; compute_extreme_point(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 7 …i_oracle.jl:358; _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 7 …_wrapper.jl:427; optimize!(o::SCIP.Optimi… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 7 …/wrapper.jl:16; macro expansion 7╎ ╎ ╎ ╎ ╎ ╎ ╎ 7 …/LibSCIP.jl:18664; SCIPsolve ╎ ╎ ╎ ╎ ╎ ╎ 1 …i_oracle.jl:364; _optimize_and_return(lmo:… ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:872; materialize ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:897; copy ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:925; copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:972; copyto! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …simdloop.jl:77; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:973; macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:610; getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:651; _broadcast_getind… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …roadcast.jl:678; _broadcast_getin… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/results.jl:89; get(o::SCIP.Opti… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/results.jl:63; assert_solved(o… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 1 …/results.jl:53; assert_stage ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 1 …/LibSCIP.jl:10588; SCIPgetStage ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +3 1 …_wrapper.jl:87; unsafe_convert 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +4 1 …ase/Base.jl:49; getproperty ╎ ╎ ╎ ╎ ╎ 2 …acking_lmo.jl:126; compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ 2 …ded_oracle.jl:454; free_model ╎ ╎ ╎ ╎ ╎ ╎ 2 …ciaSCIPExt.jl:49; free_model 2╎ ╎ ╎ ╎ ╎ ╎ 2 …/LibSCIP.jl:18686; SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 …ed_pairwise.jl:484; blended_pairwise_conditional_… 1╎ ╎ ╎ ╎ ╎ 1 …rategy_test.jl:45; (::var"#f#155"{Vector{Float64… ╎ ╎ ╎ ╎ 2 …custom_bonobo.jl:48; optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 2 …rc/callbacks.jl:232; callback 1╎ ╎ ╎ ╎ 2 …rc/callbacks.jl:295; (::Boscia.var"#callback#35"{Bos… ╎ ╎ ╎ ╎ 1 @Base/array.jl:801; collect(itr::Base.Generator{Data… ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:827; collect_to_with_first! ╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:849; collect_to! ╎ ╎ ╎ ╎ ╎ 1 …e/generator.jl:45; iterate ╎ ╎ ╎ ╎ ╎ 1 …orityqueue.jl:410; iterate ╎ ╎ ╎ ╎ ╎ 1 …orityqueue.jl:318; dequeue_pair!(pq::DataStruc… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:675; delete!(h::Dict{Int64, Int6… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/dict.jl:242; ht_keyindex ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/dict.jl:128; hashindex ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:28; hash ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:87; hash ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:78; hash_uint64 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …/hashing.jl:45; hash_64_64 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:536; << 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/int.jl:529; << ╎ ╎ ╎ ╎ 3 …custom_bonobo.jl:84; optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Base/array.jl:791; collect(itr::Base.Generator{DataSt… ╎ ╎ ╎ ╎ 1 …se/generator.jl:45; iterate ╎ ╎ ╎ ╎ 1 …riorityqueue.jl:399; iterate ╎ ╎ ╎ ╎ ╎ 1 …iorityqueue.jl:401; iterate(pq::DataStructures.Pri… 1╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:350; copy ╎ ╎ ╎ ╎ 2 @Base/array.jl:801; collect(itr::Base.Generator{DataSt… ╎ ╎ ╎ ╎ 2 @Base/array.jl:827; collect_to_with_first! ╎ ╎ ╎ ╎ 2 @Base/array.jl:849; collect_to! ╎ ╎ ╎ ╎ ╎ 2 …se/generator.jl:45; iterate ╎ ╎ ╎ ╎ ╎ 2 …iorityqueue.jl:410; iterate ╎ ╎ ╎ ╎ ╎ 2 …orityqueue.jl:316; dequeue_pair!(pq::DataStructu… 1╎ ╎ ╎ ╎ ╎ 1 @Base/float.jl:0; percolate_down!(pq::DataStruct… ╎ ╎ ╎ ╎ ╎ 1 …orityqueue.jl:134; percolate_down!(pq::DataStru… 1╎ ╎ ╎ ╎ ╎ 1 @Base/array.jl:987; setindex! 1161 344 2.672361e+01 2.836265e+01 1.639037e+00 6.133292e-02 6.000200e+01 2.508250e+01 6 4 24997 8 6 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.723607992511358 Dual Gap (relative): 0.06133292455692805 Search Statistics. Total number of nodes processed: 1505 Total number of lmo calls: 24997 Total time (s): 60.003 LMO calls / sec: 416.5958368748229 Nodes / sec: 25.082079229371864 LMO calls / node: 16.609302325581396 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2266 Local tightenings / node: 1.95 Total number of potential local tightenings: 4996 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.454000e+00 1.222494e+00 548 89 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.853000e+00 3.154574e+00 115 52 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.018000e+00 3.644798e+00 163 61 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.194100e+01 1.683276e+01 94 40 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.261600e+01 1.720038e+01 86 40 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.987400e+01 1.997585e+01 104 38 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.563100e+01 2.188756e+01 51 25 8396 223 5 6 [146] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/Xc4sO/test/branching_strategy_test.jl:133 PkgEval terminated after 2751.72s: test duration exceeded the time limit