Package evaluation to test Boscia on Julia 1.14.0-DEV.3106 (9d314127b9*) started at 2026-09-03T22:38:07.795 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.67s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.12 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [4c555306] + ArrayLayouts v1.12.2 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.12 [d360d2e6] + ChainRulesCore v1.26.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.9 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.6 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.11 [1a297f60] + FillArrays v1.17.0 [f6369f11] + ForwardDiff v1.4.5 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.8 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.7.1 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.53.0 [3b969827] + MathOptSetDistances v0.2.12 [a3b82374] + MatrixFactorizations v3.1.3 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v2.0.1 ⌅ [69de0a69] + Parsers v2.8.7 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.9.0 [90137ffa] + StaticArrays v1.9.20 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.5 [ec057cc2] + StructUtils v2.8.5 ⌅ [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.12.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.7+0 [4536629a] + OpenBLAS_jll v0.3.34+0 [05823500] + OpenLibm_jll v0.8.8+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.06s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... 2.5 s ✓ Bonobo 16.1 s ✓ Boscia 13.9 s ✓ Boscia → BosciaHiGHSExt 18.4 s ✓ Boscia → BosciaSCIPExt 22.9 s ✓ CombinatorialLinearOracles 5 dependencies successfully precompiled in 74 seconds. 192 already precompiled. Precompilation completed after 99.79s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_HfBvwp/Project.toml` [4c88cf16] Aqua v0.8.16 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.17 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.131 [497a8b3b] DoubleFloats v1.11.2 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.25.1 [b8f27783] MathOptInterface v1.53.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.5 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_HfBvwp/Manifest.toml` [7d9f7c33] Accessors v0.1.45 [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.16 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [4c555306] ArrayLayouts v1.12.2 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.17 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.9 [0002e35e] CombinatorialLinearOracles v0.1.5 [38540f10] CommonSolve v0.2.14 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [a33af91c] CompositionsBase v0.1.2 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.6 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [31c24e10] Distributions v0.25.131 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.11.2 [e2ba6199] ExprTools v0.1.11 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.17.0 [f6369f11] ForwardDiff v1.4.5 [f55ce6ea] FrankWolfe v0.6.4 [a0844989] Gamma v1.2.0 [14197337] GenericLinearAlgebra v0.4.1 [c145ed77] GenericSchur v0.5.8 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.25.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.30 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [3587e190] InverseFunctions v0.1.17 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.7.1 [4076af6c] JuMP v1.31.2 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v1.0.1 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.53.0 [3b969827] MathOptSetDistances v0.2.12 [a3b82374] MatrixFactorizations v3.1.3 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.4 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v2.0.1 [90014a1f] PDMats v0.11.41 ⌅ [69de0a69] Parsers v2.8.7 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.3 [be4d8f0f] Quadmath v1.1.0 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [f2b01f46] Roots v3.0.8 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.10 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.6 [a2af1166] SortingAlgorithms v1.2.3 [276daf66] SpecialFunctions v2.9.0 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.20 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.5 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.13 [4c63d2b9] StatsFuns v2.2.1 [ec057cc2] StructUtils v2.8.5 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.14.0 ⌅ [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.3 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.5+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.15.1+3 [e33a78d0] Hwloc_jll v2.14.0+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.6+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.34+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.2+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.300+0 [e5ac4fe4] SCIP_jll v1000.0.300+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.10+1 [1317d2d5] oneTBB_jll v2022.3.0+0 [0dad84c5] ArgTools v1.2.0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.12.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.7+0 [781609d7] GMP_jll v6.3.0+5 [deac9b47] LibCURL_jll v8.21.0+0 [e37daf67] LibGit2_jll v1.9.7+0 [29816b5a] LibSSH2_jll v1.11.104+0 [3a97d323] MPFR_jll v4.2.2+1 [14a3606d] MozillaCACerts_jll v2026.8.13 [4536629a] OpenBLAS_jll v0.3.34+0 [05823500] OpenLibm_jll v0.8.8+0 [458c3c95] OpenSSL_jll v3.5.8+0 [efcefdf7] PCRE2_jll v10.48.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.70.0+0 [3f19e933] p7zip_jll v17.8.2+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x355a64a8732f9628 ┌ Warning: `disable_sigint` no longer defers Ctrl-C: SIGINT is delivered as a cancellation of the current ^C scope and observed at cancellation points regardless of the sigatomic region this establishes. Shield a region from cancellation by scoping `Base.CANCEL_TOKEN => nothing` over it instead. │ caller = optimize!(model::HiGHS.Optimizer) at MOI_wrapper.jl:2314 └ @ HiGHS ~/.julia/packages/HiGHS/erykA/src/MOI_wrapper.jl:2314 WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:97 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = TIME_LIMIT_REACHED WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:986 Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = TIME_LIMIT_REACHED Callback Tests seed = 0x5306a7fded5de97f LMO Tests seed = 0x09c38a81b004b508 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:254 Indicator Tests seed = 0x79b7b532c39b185c Heuristics Tests seed = 0xb491c7282a90f7e9 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:193 [ Info: Polish solution Sparse Regression Tests seed = 0x99e93998ce3cdcf8 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.150030e+00 2.274620e+00 1.245902e-01 5.794811e-02 2.148700e+01 1.396193e-01 8516 30 11 12 6 0 19 0 2.246303e+00 2.274620e+00 2.831760e-02 1.260631e-02 2.536600e+01 7.490341e-01 4 3 113 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 2.274620e+00 2.274620e+00 0.000000e+00 1.048158e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 2.274620e+00 2.274620e+00 0.000000e+00 2.229588e+00 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 2.2746201823365806 Dual Bound: 2.246302585878618 Dual Gap (relative): 0.012606314321134241 Search Statistics. Total number of nodes processed: 19 Total number of lmo calls: 117 Total time (s): 30.752 LMO calls / sec: 3.804630593132154 Nodes / sec: 0.6178459937565036 LMO calls / node: 6.157894736842105 Total number of global tightenings: 41 Global tightenings / node: 2.16 Total number of local tightenings: 45 Local tightenings / node: 2.37 Total number of potential local tightenings: 45 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.621813e+00 2.564226e+00 9.424127e-01 5.810858e-01 1.950400e+01 1.538146e-01 8778 161 38 80 25 1 100 51 2.176222e+00 2.564226e+00 3.880038e-01 1.782924e-01 2.492200e+01 6.058904e+00 22 14 1124 23 17 0 200 51 2.241802e+00 2.564226e+00 3.224240e-01 1.438236e-01 2.673600e+01 9.388091e+00 24 15 1546 16 9 0 300 51 2.289764e+00 2.564226e+00 2.744621e-01 1.198648e-01 2.852900e+01 1.230327e+01 17 11 1972 24 15 1 400 51 2.332702e+00 2.564226e+00 2.315237e-01 9.925128e-02 3.032600e+01 1.487173e+01 20 13 2418 18 9 1 500 51 2.369256e+00 2.564226e+00 1.949696e-01 8.229146e-02 3.222500e+01 1.709853e+01 24 16 2877 23 8 1 600 51 2.406958e+00 2.564226e+00 1.572684e-01 6.533910e-02 3.414400e+01 1.906631e+01 25 16 3356 30 14 0 700 51 2.443728e+00 2.564226e+00 1.204982e-01 4.930918e-02 3.539300e+01 2.121889e+01 23 15 3846 25 10 0 800 49 2.478292e+00 2.564226e+00 8.593397e-02 3.467468e-02 3.712400e+01 2.286930e+01 32 20 4342 27 8 0 900 41 2.517541e+00 2.564226e+00 4.668511e-02 1.854393e-02 3.913800e+01 2.404313e+01 29 18 4834 31 6 0 947 34 2.540418e+00 2.564226e+00 2.380791e-02 9.371649e-03 4.000500e+01 2.452193e+01 6 3 5064 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.047964e+00 -5.891893e-01 7.637153e+00 0.000000e+00 Inf 1 LD 2 2.564226e+00 2.564226e+00 0.000000e+00 2.176050e-01 9.190966e+00 1 Last 2 2.564226e+00 2.564226e+00 0.000000e+00 4.413610e-01 4.531438e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.564226e+00 2.564226e+00 0.000000e+00 4.446725e-01 4.497692e+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.5642260181783523 Dual Bound: 2.540418110421843 Dual Gap (relative): 0.009371649359150505 Search Statistics. Total number of nodes processed: 981 Total number of lmo calls: 5069 Total time (s): 43.741 LMO calls / sec: 115.8866966918909 Nodes / sec: 22.42747079399191 LMO calls / node: 5.167176350662589 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 Non zero entries: 5th entry: 0.16635247216481383 35th entry: 0.16635247216481383 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.699466e+00 2.564226e+00 8.647602e-01 5.088424e-01 2.580000e-01 1.162791e+01 253 164 38 80 25 1 100 35 2.213938e+00 2.564226e+00 3.502881e-01 1.582195e-01 5.521000e+00 2.445209e+01 16 11 1079 23 17 0 200 26 2.287028e+00 2.564226e+00 2.771976e-01 1.212043e-01 7.696000e+00 2.936590e+01 23 16 1555 16 9 0 300 25 2.380067e+00 2.564226e+00 1.841595e-01 7.737578e-02 1.067700e+01 3.043926e+01 30 19 2225 41 18 1 400 25 2.451423e+00 2.564226e+00 1.128032e-01 4.601540e-02 1.390800e+01 3.055795e+01 34 22 2985 35 17 6 500 20 2.529306e+00 2.564226e+00 3.492011e-02 1.380620e-02 1.728200e+01 3.008911e+01 27 18 3786 27 8 1 510 19 2.540033e+00 2.564226e+00 2.419293e-02 9.524652e-03 1.761400e+01 3.003293e+01 31 19 3867 34 12 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.047964e+00 -5.891893e-01 7.637153e+00 0.000000e+00 Inf 1 LD 2 2.564226e+00 2.564226e+00 0.000000e+00 1.062520e-03 1.882318e+03 1 Last 2 2.564226e+00 2.564226e+00 0.000000e+00 6.758757e-03 2.959124e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.564226e+00 2.564226e+00 0.000000e+00 9.735950e-03 2.054242e+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.5642260181783523 Dual Bound: 2.5400330872733696 Dual Gap (relative): 0.009524651874103281 Search Statistics. Total number of nodes processed: 529 Total number of lmo calls: 3872 Total time (s): 17.636 LMO calls / sec: 219.55091857564074 Nodes / sec: 29.99546382399637 LMO calls / node: 7.319470699432892 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: 5 Poisson Tests seed = 0x1ac6e2244d02386b 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 -4.076146e+02 -3.821425e+02 2.547209e+01 6.665599e-02 2.313800e+01 1.296568e-01 11488 109 46 1769 29 3 * 8 9 -4.074557e+02 -3.836429e+02 2.381277e+01 6.207013e-02 3.997400e+01 4.252764e-01 2243 95 321 1705 31 19 * 25 26 -4.066396e+02 -3.861842e+02 2.045538e+01 5.296793e-02 8.187800e+01 6.228779e-01 1382 90 962 1036 30 25 45 46 -4.061294e+02 -3.861842e+02 1.994520e+01 5.164686e-02 1.200040e+02 7.583081e-01 2021 74 1665 1500 27 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.892448e+02 -7.152049e+02 1.404450e+03 0.000000e+00 Inf 1 LD 2 -3.809577e+02 -4.451218e+02 6.416410e+01 2.142762e-01 9.333746e+00 2 LD 20 -3.934898e+02 -4.207050e+02 2.721517e+01 5.876994e-01 3.403100e+01 4 LD 34 -3.984197e+02 -4.049491e+02 6.529365e+00 6.108378e-01 5.566126e+01 4 LD 65 -3.991087e+02 -4.021632e+02 3.054545e+00 7.340726e-01 8.854710e+01 5 LD 76 -3.991588e+02 -3.998043e+02 6.455707e-01 7.509968e-01 1.011988e+02 5 LD 91 -3.991705e+02 -3.994589e+02 2.884154e-01 7.683930e-01 1.184290e+02 5 LD 118 -3.991728e+02 -3.992628e+02 9.000953e-02 8.017064e-01 1.471860e+02 7 LD 140 -3.991731e+02 -3.991995e+02 2.644803e-02 8.279175e-01 1.690990e+02 8 LD 178 -3.991731e+02 -3.991849e+02 1.175574e-02 8.634001e-01 2.061617e+02 8 LD 195 -3.991731e+02 -3.991768e+02 3.734551e-03 8.802935e-01 2.215170e+02 8 LD 224 -3.991731e+02 -3.991740e+02 8.806491e-04 9.047176e-01 2.475911e+02 8 LD 256 -3.991731e+02 -3.991734e+02 3.018842e-04 9.294539e-01 2.754305e+02 8 LD 286 -3.991731e+02 -3.991732e+02 7.927920e-05 9.520082e-01 3.004176e+02 8 LD 305 -3.991731e+02 -3.991731e+02 3.246873e-05 9.685288e-01 3.149106e+02 8 LD 341 -3.991731e+02 -3.991731e+02 1.479166e-05 1.003660e+00 3.397563e+02 8 LD 359 -3.991731e+02 -3.991731e+02 4.612551e-06 1.023147e+00 3.508783e+02 8 LD 381 -3.991731e+02 -3.991731e+02 1.723173e-06 1.044725e+00 3.646892e+02 8 LD 412 -3.991731e+02 -3.991731e+02 7.865163e-07 1.074967e+00 3.832677e+02 8 Last 412 -3.991731e+02 -3.991731e+02 7.865163e-07 1.082094e+00 3.807433e+02 8 ---------------------------------------------------------------------------------------------------------------- PP 412 -3.991731e+02 -3.991731e+02 7.865163e-07 1.085772e+00 3.794534e+02 8 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -399.17310897239895 Dual Bound: -406.1294151870683 Dual Gap (relative): 0.017426790678803775 Search Statistics. Total number of nodes processed: 91 Total number of lmo calls: 1695 Total time (s): 124.599 LMO calls / sec: 13.603640478655526 Nodes / sec: 0.7303429401520076 LMO calls / node: 18.626373626373628 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -3.726915e+02 -3.702648e+02 2.426639e+00 6.553794e-03 2.463800e+01 1.217631e-01 9625 114 25 76 11 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.958893e+02 -4.000959e+02 2.042066e+02 0.000000e+00 Inf 1 LD 2 -3.702648e+02 -3.702648e+02 0.000000e+00 2.089324e-01 9.572473e+00 1 Last 2 -3.702648e+02 -3.702648e+02 0.000000e+00 4.308894e-01 4.641563e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.702648e+02 -3.702648e+02 0.000000e+00 4.348732e-01 4.599042e+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: -370.26481591785347 Dual Bound: -372.69145531833146 Dual Gap (relative): 0.006553794193117087 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 30 Total time (s): 28.547 LMO calls / sec: 1.0508985182330892 Nodes / sec: 0.10508985182330893 LMO calls / node: 10.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.069201e+02 3.425233e+02 1.356032e+02 6.553410e-01 2.124400e+01 1.412163e-01 9723 144 29 97 14 1 * 12 13 2.482775e+02 3.329346e+02 8.465709e+01 3.409777e-01 2.334600e+01 1.070847e+00 165 63 239 93 8 4 100 45 3.176844e+02 3.329346e+02 1.525017e+01 4.800414e-02 3.172700e+01 4.570240e+00 68 36 1213 26 4 1 141 18 3.296774e+02 3.329346e+02 3.257226e+00 9.880041e-03 3.319500e+01 4.789878e+00 19 12 1432 4 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.329346e+02 3.329346e+02 0.000000e+00 8.351253e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.329346e+02 3.329346e+02 0.000000e+00 2.258409e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 332.9345943786107 Dual Bound: 329.6773683978021 Dual Gap (relative): 0.00988004119493663 Search Statistics. Total number of nodes processed: 159 Total number of lmo calls: 1436 Total time (s): 36.936 LMO calls / sec: 38.8780593458956 Nodes / sec: 4.3047433398310595 LMO calls / node: 9.031446540880504 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.069201e+02 3.425233e+02 1.356032e+02 6.553410e-01 2.560300e+01 1.171738e-01 9831 143 29 97 14 1 * 36 35 2.788365e+02 3.329346e+02 5.409806e+01 1.940135e-01 5.910700e+01 1.201211e+00 117 45 599 48 6 2 100 43 3.138250e+02 3.329346e+02 1.910963e+01 6.089263e-02 8.303000e+01 1.722269e+00 46 24 1213 19 3 1 161 10 3.299817e+02 3.329346e+02 2.952900e+00 8.948678e-03 8.874400e+01 1.926891e+00 9 6 1509 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.329346e+02 3.329346e+02 0.000000e+00 8.966487e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.329346e+02 3.329346e+02 0.000000e+00 2.180825e-01 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 332.9345943786107 Dual Bound: 329.98169442478 Dual Gap (relative): 0.008948678074334254 Search Statistics. Total number of nodes processed: 171 Total number of lmo calls: 1513 Total time (s): 92.313 LMO calls / sec: 16.389890914605743 Nodes / sec: 1.8523934873744758 LMO calls / node: 8.847953216374268 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 = 0x599e5cd36f343c4f 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 -5.216793e+00 3.085664e+01 3.607344e+01 Inf 2.389600e+01 1.255440e-01 11350 117 56 3902 19 22 100 5 3.007857e+01 3.085664e+01 7.780768e-01 2.586815e-02 3.186600e+01 3.295048e+00 22 7 1944 471 7 4 105 2 3.060419e+01 3.085664e+01 2.524539e-01 8.248999e-03 3.199500e+01 3.344273e+00 36 27 2019 80 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 30.856644841446506 Dual Bound: 30.604190902208686 Dual Gap (relative): 0.008248998970255458 Search Statistics. Total number of nodes processed: 107 Total number of lmo calls: 2019 Total time (s): 33.491 LMO calls / sec: 60.284852646979786 Nodes / sec: 3.194888178913738 LMO calls / node: 18.869158878504674 Total number of global tightenings: 12 Global tightenings / node: 0.11 Total number of local tightenings: 343 Local tightenings / node: 3.27 Total number of potential local tightenings: 409 Time Limit Test seed = 0x87dbc3b36df9bead 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 -2.300593e+00 -5.405514e-01 1.760041e+00 3.256012e+00 2.359400e+01 1.271510e-01 11041 46 25 712 11 2 * 9 10 -1.933392e+00 -7.393004e-01 1.194092e+00 1.615165e+00 2.404100e+01 7.903165e-01 48 25 187 950 12 4 * 19 18 -1.578275e+00 -1.216492e+00 3.617837e-01 2.973992e-01 2.458200e+01 1.586527e+00 27 12 356 687 7 9 51 6 -1.220849e+00 -1.216492e+00 4.357279e-03 3.581840e-03 2.601200e+01 2.268184e+00 14 10 770 34 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -1.2164917591675177 Dual Bound: -1.2208490377878598 Dual Gap (relative): 0.0035818398172494763 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 770 Total time (s): 27.966 LMO calls / sec: 27.53343345490953 Nodes / sec: 2.109704641350211 LMO calls / node: 13.05084745762712 Total number of global tightenings: 5 Global tightenings / node: 0.1 Total number of local tightenings: 77 Local tightenings / node: 1.51 Total number of potential local tightenings: 99 Strong Convexity and Sharpness Tests seed = 0x8051598649eadf6a WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.145221e+02 2.146519e+02 1.298226e-01 6.051712e-04 2.240600e+01 1.338927e-01 8722 0 11 12 4 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 214.65188673840157 Dual Bound: 214.52206416752762 Dual Gap (relative): 0.0006051711807722129 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 11 Total time (s): 24.509 LMO calls / sec: 0.4488147211228528 Nodes / sec: 0.12240401485168713 LMO calls / node: 3.6666666666666665 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 16 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 0 2.059293e+02 2.059293e+02 0.000000e+00 0.000000e+00 2.104300e+01 4.752174e-02 7234 0 8 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 205.92927529965883 Dual Bound: 205.92927529965883 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 8 Total time (s): 23.195 LMO calls / sec: 0.34490191851692176 Nodes / sec: 0.04311273981461522 LMO calls / node: 8.0 Total number of global tightenings: 10 Global tightenings / node: 10.0 Total number of local tightenings: 10 Local tightenings / node: 10.0 Total number of potential local tightenings: 20 Branching Strategy Tests seed = 0x443a908cde7823b2 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.402700e+01 1.248595e-01 10051 37 46 3163 25 9 61 4 7.321141e+00 7.382204e+00 6.106274e-02 8.340603e-03 2.542900e+01 2.556137e+00 9 6 978 28 3 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321141423252462 Dual Gap (relative): 0.008340603407452801 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 978 Total time (s): 27.568 LMO calls / sec: 35.475914103308185 Nodes / sec: 2.35780615206036 LMO calls / node: 15.046153846153846 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 85 Local tightenings / node: 1.39 Total number of potential local tightenings: 163 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.490000e-01 1.204819e+01 147 41 46 3163 25 9 100 13 6.622429e+00 7.382204e+00 7.597754e-01 1.147276e-01 1.990000e+00 5.678392e+01 5 3 1248 6 0 0 115 2 7.321773e+00 7.382204e+00 6.043155e-02 8.253678e-03 2.104000e+00 5.560837e+01 7 4 1343 35 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.32177260672484 Dual Gap (relative): 0.008253678019628835 Search Statistics. Total number of nodes processed: 117 Total number of lmo calls: 1343 Total time (s): 2.106 LMO calls / sec: 637.7018043684711 Nodes / sec: 55.55555555555556 LMO calls / node: 11.478632478632479 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 63 Local tightenings / node: 0.55 Total number of potential local tightenings: 156 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.480000e-01 1.209677e+01 139 36 46 3163 25 9 79 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.606000e+00 4.919054e+01 2 1 1127 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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: 79 Total number of lmo calls: 1127 Total time (s): 1.607 LMO calls / sec: 701.30678282514 Nodes / sec: 49.159925326695706 LMO calls / node: 14.265822784810126 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 72 Local tightenings / node: 0.91 Total number of potential local tightenings: 168 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.520000e-01 1.190476e+01 133 33 46 3163 25 9 73 2 7.335122e+00 7.382204e+00 4.708210e-02 6.418721e-03 1.430000e+00 5.244755e+01 12 8 909 33 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.335122056868152 Dual Gap (relative): 0.006418721204706988 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 909 Total time (s): 1.431 LMO calls / sec: 635.2201257861635 Nodes / sec: 52.41090146750524 LMO calls / node: 12.12 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 59 Local tightenings / node: 0.81 Total number of potential local tightenings: 119 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 -9.250197e-03 7.382204e+00 7.391454e+00 Inf 2.250000e-01 1.333333e+01 142 37 46 3163 25 9 95 4 7.324924e+00 7.382204e+00 5.728014e-02 7.819896e-03 1.592000e+00 6.218593e+01 3 2 1181 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.324924018471204 Dual Gap (relative): 0.007819895706499947 Search Statistics. Total number of nodes processed: 99 Total number of lmo calls: 1181 Total time (s): 1.593 LMO calls / sec: 741.368487131199 Nodes / sec: 62.14689265536723 LMO calls / node: 11.929292929292929 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 76 Local tightenings / node: 0.8 Total number of potential local tightenings: 157 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.387474e-03 3.396650e+01 3.397589e+01 Inf 3.300000e-01 9.090909e+00 327 52 64 5398 39 11 * 4 5 4.050753e-01 3.102006e+01 3.061499e+01 7.557851e+01 5.750000e-01 1.565217e+01 80 30 182 711 24 20 * 19 20 5.437344e+00 2.836265e+01 2.292530e+01 4.216269e+00 1.733000e+00 2.250433e+01 62 26 707 494 21 30 100 101 1.300626e+01 2.836265e+01 1.535638e+01 1.180692e+00 6.608000e+00 3.041768e+01 68 31 3234 501 25 19 200 201 1.669715e+01 2.836265e+01 1.166549e+01 6.986518e-01 1.141200e+01 3.513845e+01 43 21 6079 293 18 23 300 297 1.877920e+01 2.836265e+01 9.583446e+00 5.103224e-01 1.626200e+01 3.671135e+01 38 19 8823 275 15 12 400 393 2.048424e+01 2.836265e+01 7.878402e+00 3.846079e-01 2.074700e+01 3.822239e+01 39 19 11527 298 18 22 500 467 2.164467e+01 2.836265e+01 6.717973e+00 3.103754e-01 2.461800e+01 3.928020e+01 17 11 14002 37 0 0 600 539 2.275256e+01 2.836265e+01 5.610089e+00 2.465696e-01 2.874200e+01 3.962842e+01 31 16 16435 187 17 10 700 573 2.371197e+01 2.836265e+01 4.650680e+00 1.961322e-01 3.169200e+01 4.016787e+01 9 6 18519 53 0 0 800 569 2.442884e+01 2.836265e+01 3.933808e+00 1.610313e-01 3.392300e+01 4.035610e+01 6 4 20354 10 0 0 900 525 2.527566e+01 2.836265e+01 3.086984e+00 1.221327e-01 3.565200e+01 3.996971e+01 7 4 21854 25 0 0 1000 471 2.586635e+01 2.836265e+01 2.496292e+00 9.650730e-02 3.733800e+01 3.939686e+01 27 15 23188 147 14 8 1100 395 2.634758e+01 2.836265e+01 2.015068e+00 7.648018e-02 3.883400e+01 3.849719e+01 7 5 24403 17 0 0 1200 309 2.698695e+01 2.836265e+01 1.375691e+00 5.097616e-02 4.019900e+01 3.753825e+01 10 6 25376 23 0 0 1300 215 2.746620e+01 2.836265e+01 8.964413e-01 3.263797e-02 4.140800e+01 3.658713e+01 8 5 26337 20 0 0 1400 121 2.789287e+01 2.836265e+01 4.697781e-01 1.684223e-02 4.243400e+01 3.584390e+01 8 5 27159 12 0 0 1449 72 2.808272e+01 2.836265e+01 2.799226e-01 9.967788e-03 4.294600e+01 3.541657e+01 6 4 27537 9 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404973 Dual Bound: 28.082722399220863 Dual Gap (relative): 0.009967788101337218 Search Statistics. Total number of nodes processed: 1521 Total number of lmo calls: 27537 Total time (s): 42.947 LMO calls / sec: 641.185647425897 Nodes / sec: 35.41574498800847 LMO calls / node: 18.104536489151872 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2367 Local tightenings / node: 1.63 Total number of potential local tightenings: 5140 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.387474e-03 3.396650e+01 3.397589e+01 Inf 1.581000e+00 1.897533e+00 340 61 64 5398 39 11 * 4 5 4.050753e-01 3.102006e+01 3.061499e+01 7.557851e+01 1.828000e+00 4.923414e+00 77 31 182 711 24 20 * 19 20 5.437344e+00 2.836265e+01 2.292530e+01 4.216269e+00 2.947000e+00 1.323380e+01 64 26 707 494 21 30 100 101 1.300626e+01 2.836265e+01 1.535638e+01 1.180692e+00 7.755000e+00 2.591876e+01 60 27 3234 501 25 19 200 197 1.666624e+01 2.836265e+01 1.169641e+01 7.018025e-01 1.290300e+01 3.076804e+01 55 22 6034 528 18 8 300 261 1.834594e+01 2.836265e+01 1.001671e+01 5.459906e-01 1.680200e+01 3.338888e+01 40 22 8409 220 21 14 400 313 1.984829e+01 2.836265e+01 8.514355e+00 4.289717e-01 2.051100e+01 3.476184e+01 18 10 10607 69 0 0 500 349 2.103532e+01 2.836265e+01 7.327321e+00 3.483341e-01 2.372900e+01 3.577900e+01 37 19 12567 236 13 12 600 387 2.187947e+01 2.836265e+01 6.483180e+00 2.963135e-01 2.676800e+01 3.687238e+01 21 11 14521 104 10 6 700 405 2.283284e+01 2.836265e+01 5.529809e+00 2.421867e-01 2.914300e+01 3.791648e+01 9 5 16156 15 0 0 800 421 2.364750e+01 2.836265e+01 4.715149e+00 1.993931e-01 3.165800e+01 3.856845e+01 8 5 17902 11 0 0 900 415 2.432574e+01 2.836265e+01 4.036906e+00 1.659520e-01 3.383900e+01 3.886049e+01 8 5 19416 9 0 0 1000 403 2.516307e+01 2.836265e+01 3.199577e+00 1.271537e-01 3.555900e+01 3.945555e+01 6 4 20885 15 0 0 1100 361 2.578915e+01 2.836265e+01 2.573492e+00 9.978970e-02 3.706800e+01 3.941405e+01 9 6 22117 24 0 0 1200 319 2.638577e+01 2.836265e+01 1.976875e+00 7.492202e-02 3.843800e+01 3.951819e+01 6 4 23245 7 0 0 1300 279 2.677434e+01 2.836265e+01 1.588304e+00 5.932188e-02 3.965300e+01 3.982044e+01 9 5 24202 15 0 0 1400 221 2.729240e+01 2.836265e+01 1.070245e+00 3.921401e-02 4.077200e+01 3.975768e+01 9 5 25134 19 0 0 1500 159 2.767344e+01 2.836265e+01 6.892086e-01 2.490506e-02 4.173100e+01 3.975462e+01 12 7 25994 40 0 0 1600 77 2.801447e+01 2.836265e+01 3.481788e-01 1.242854e-02 4.254500e+01 3.941709e+01 6 4 26723 8 0 0 1613 64 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 4.267900e+01 3.929333e+01 11 6 26831 48 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404973 Dual Bound: 28.083355821757866 Dual Gap (relative): 0.009945008189894616 Search Statistics. Total number of nodes processed: 1677 Total number of lmo calls: 26831 Total time (s): 42.68 LMO calls / sec: 628.6551077788191 Nodes / sec: 39.29240862230553 LMO calls / node: 15.999403697078115 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2152 Local tightenings / node: 1.33 Total number of potential local tightenings: 5367 Number of alternative decisions: 435 Number of stable decisions: 403 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.387474e-03 3.396650e+01 3.397589e+01 Inf 3.660000e-01 8.196721e+00 316 54 64 5398 39 11 * 12 13 1.957007e+00 2.836265e+01 2.640564e+01 1.349287e+01 1.335000e+00 1.872659e+01 45 21 481 379 17 18 100 101 1.009608e+01 2.836265e+01 1.826656e+01 1.809273e+00 5.929000e+00 3.390116e+01 48 21 3123 404 23 28 200 195 1.386634e+01 2.836265e+01 1.449630e+01 1.045431e+00 1.052800e+01 3.751900e+01 47 22 5918 329 18 14 300 285 1.591186e+01 2.836265e+01 1.245079e+01 7.824847e-01 1.511600e+01 3.870071e+01 109 31 8546 690 24 10 400 369 1.758996e+01 2.836265e+01 1.077269e+01 6.124340e-01 1.895900e+01 4.056121e+01 51 24 11015 407 18 16 500 437 1.913121e+01 2.836265e+01 9.231431e+00 4.825324e-01 2.263100e+01 4.140338e+01 37 18 13290 281 13 11 600 489 2.029852e+01 2.836265e+01 8.064125e+00 3.972765e-01 2.669400e+01 4.079568e+01 7 4 15396 10 0 0 700 521 2.141725e+01 2.836265e+01 6.945400e+00 3.242901e-01 2.995700e+01 4.075842e+01 54 25 17302 461 20 7 800 539 2.241027e+01 2.836265e+01 5.952378e+00 2.656094e-01 3.281500e+01 4.080451e+01 35 20 19081 174 21 9 900 555 2.315356e+01 2.836265e+01 5.209088e+00 2.249800e-01 3.584400e+01 4.059257e+01 12 8 20766 15 0 0 1000 547 2.386215e+01 2.836265e+01 4.500494e+00 1.886039e-01 3.824800e+01 4.044656e+01 9 6 22229 13 0 0 1100 537 2.445144e+01 2.836265e+01 3.911205e+00 1.599581e-01 4.045600e+01 4.046371e+01 42 19 23670 361 23 15 1200 515 2.508799e+01 2.836265e+01 3.274656e+00 1.305269e-01 4.240700e+01 4.044144e+01 6 4 24944 6 0 0 1300 473 2.566658e+01 2.836265e+01 2.696069e+00 1.050420e-01 4.413500e+01 4.017220e+01 14 9 26150 33 0 0 1400 431 2.621304e+01 2.836265e+01 2.149607e+00 8.200525e-02 4.575300e+01 4.001923e+01 18 11 27314 85 0 0 1500 373 2.663959e+01 2.836265e+01 1.723058e+00 6.468037e-02 4.724600e+01 3.964357e+01 10 7 28358 35 0 0 1600 297 2.704592e+01 2.836265e+01 1.316722e+00 4.868469e-02 4.837600e+01 3.921366e+01 30 16 29266 160 0 0 1700 229 2.739892e+01 2.836265e+01 9.637287e-01 3.517397e-02 4.955500e+01 3.892645e+01 8 5 30115 15 0 0 1800 139 2.777885e+01 2.836265e+01 5.837959e-01 2.101584e-02 5.063000e+01 3.829745e+01 7 5 30931 7 0 0 1863 82 2.808557e+01 2.836265e+01 2.770795e-01 9.865549e-03 5.119300e+01 3.799348e+01 4 3 31373 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404973 Dual Bound: 28.085565501796893 Dual Gap (relative): 0.009865549034088445 Search Statistics. Total number of nodes processed: 1945 Total number of lmo calls: 31373 Total time (s): 51.193 LMO calls / sec: 612.8376926532925 Nodes / sec: 37.99347567050183 LMO calls / node: 16.130077120822623 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2707 Local tightenings / node: 1.45 Total number of potential local tightenings: 6349 Number of alternative decisions: 645 Number of stable decisions: 327 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.387474e-03 3.396650e+01 3.397589e+01 Inf 3.830000e-01 7.832898e+00 332 62 64 5398 39 11 * 18 19 5.478768e-01 3.102006e+01 3.047219e+01 5.561869e+01 1.873000e+00 1.975440e+01 78 35 634 551 26 14 * 38 39 2.867959e+00 2.836265e+01 2.549469e+01 8.889487e+00 2.731000e+00 2.819480e+01 23 13 1117 109 16 6 100 99 8.030864e+00 2.836265e+01 2.033178e+01 2.531705e+00 5.487000e+00 3.626754e+01 77 33 2826 627 25 5 200 191 1.214657e+01 2.836265e+01 1.621608e+01 1.335034e+00 9.769000e+00 4.002457e+01 57 27 5311 445 18 8 300 275 1.555721e+01 2.836265e+01 1.280543e+01 8.231186e-01 1.406200e+01 4.089034e+01 63 29 7799 495 22 8 400 349 1.753013e+01 2.836265e+01 1.083251e+01 6.179366e-01 1.827200e+01 4.099168e+01 13 8 10234 20 0 0 500 411 1.911495e+01 2.836265e+01 9.247698e+00 4.837940e-01 2.152500e+01 4.232288e+01 37 18 12292 258 15 15 600 459 2.097699e+01 2.836265e+01 7.385655e+00 3.520836e-01 2.500500e+01 4.235153e+01 37 21 14410 239 13 11 700 491 2.223037e+01 2.836265e+01 6.132273e+00 2.758511e-01 2.796300e+01 4.259200e+01 13 8 16282 36 0 0 800 505 2.319128e+01 2.836265e+01 5.171368e+00 2.229877e-01 3.065200e+01 4.257471e+01 18 12 18008 47 0 0 900 493 2.410649e+01 2.836265e+01 4.256157e+00 1.765565e-01 3.317700e+01 4.198692e+01 17 11 19646 58 0 0 1000 465 2.485446e+01 2.836265e+01 3.508185e+00 1.411491e-01 3.520400e+01 4.161459e+01 22 14 21003 78 9 3 1100 413 2.555167e+01 2.836265e+01 2.810974e+00 1.100114e-01 3.702700e+01 4.086207e+01 7 5 22209 9 0 0 1200 349 2.615722e+01 2.836265e+01 2.205420e+00 8.431401e-02 3.890100e+01 3.981903e+01 7 4 23374 10 0 0 1300 273 2.679015e+01 2.836265e+01 1.572494e+00 5.869672e-02 4.045700e+01 3.888079e+01 7 5 24385 8 0 0 1400 185 2.722084e+01 2.836265e+01 1.141805e+00 4.194598e-02 4.167200e+01 3.803513e+01 7 5 25248 11 0 0 1500 89 2.786845e+01 2.836265e+01 4.941981e-01 1.773325e-02 4.280800e+01 3.711923e+01 11 7 26027 34 0 0 1549 40 2.809048e+01 2.836265e+01 2.721662e-01 9.688912e-03 4.329300e+01 3.670339e+01 9 6 26375 14 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404973 Dual Bound: 28.090478837826716 Dual Gap (relative): 0.009688912358865081 Search Statistics. Total number of nodes processed: 1589 Total number of lmo calls: 26375 Total time (s): 43.294 LMO calls / sec: 609.2068184967894 Nodes / sec: 36.7025453873516 LMO calls / node: 16.59848961611076 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1693 Local tightenings / node: 1.09 Total number of potential local tightenings: 3821 Number of alternative decisions: 127 Number of stable decisions: 667 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.387474e-03 3.396650e+01 3.397589e+01 Inf 3.610000e-01 8.310249e+00 358 68 64 5398 39 11 * 4 5 4.050753e-01 3.102006e+01 3.061499e+01 7.557851e+01 6.430000e-01 1.399689e+01 98 49 182 711 24 20 * 19 20 5.437344e+00 2.836265e+01 2.292530e+01 4.216269e+00 1.904000e+00 2.048319e+01 66 30 707 494 21 30 100 101 1.300626e+01 2.836265e+01 1.535638e+01 1.180692e+00 7.123000e+00 2.821845e+01 67 32 3234 501 25 19 200 201 1.669715e+01 2.836265e+01 1.166549e+01 6.986518e-01 1.276900e+01 3.140418e+01 46 23 6079 293 18 23 300 297 1.877920e+01 2.836265e+01 9.583446e+00 5.103224e-01 1.838400e+01 3.247389e+01 46 23 8823 275 15 12 400 393 2.048424e+01 2.836265e+01 7.878402e+00 3.846079e-01 2.383400e+01 3.327180e+01 49 25 11527 298 18 22 500 467 2.164467e+01 2.836265e+01 6.717973e+00 3.103754e-01 2.861800e+01 3.378992e+01 19 13 14002 37 0 0 600 539 2.275256e+01 2.836265e+01 5.610089e+00 2.465696e-01 3.355500e+01 3.394427e+01 37 21 16435 187 17 10 700 573 2.371197e+01 2.836265e+01 4.650680e+00 1.961322e-01 3.754700e+01 3.390417e+01 17 10 18519 53 0 0 800 569 2.442884e+01 2.836265e+01 3.933808e+00 1.610313e-01 4.086700e+01 3.349891e+01 9 6 20354 10 0 0 900 527 2.527232e+01 2.836265e+01 3.090329e+00 1.222812e-01 4.342700e+01 3.285974e+01 28 16 21856 130 15 12 1000 471 2.585363e+01 2.836265e+01 2.509015e+00 9.704690e-02 4.556400e+01 3.228426e+01 13 8 23171 15 0 0 1100 399 2.633104e+01 2.836265e+01 2.031605e+00 7.715629e-02 4.754700e+01 3.152670e+01 18 11 24380 51 0 0 1200 315 2.695409e+01 2.836265e+01 1.408555e+00 5.225755e-02 4.907800e+01 3.086923e+01 13 9 25371 28 0 0 1300 227 2.742574e+01 2.836265e+01 9.369070e-01 3.416160e-02 5.053800e+01 3.021489e+01 28 15 26323 160 11 7 1400 133 2.784550e+01 2.836265e+01 5.171494e-01 1.857210e-02 5.173300e+01 2.963292e+01 15 9 27149 40 0 0 1465 70 2.808272e+01 2.836265e+01 2.799226e-01 9.967788e-03 5.245400e+01 2.926374e+01 6 4 27640 9 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404973 Dual Bound: 28.082722399220863 Dual Gap (relative): 0.009967788101337218 Search Statistics. Total number of nodes processed: 1535 Total number of lmo calls: 27640 Total time (s): 52.455 LMO calls / sec: 526.927842912973 Nodes / sec: 29.26317796206272 LMO calls / node: 18.006514657980457 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2353 Local tightenings / node: 1.61 Total number of potential local tightenings: 5135 Number of alternative decisions: 718 Number of stable decisions: 49 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.387474e-03 3.396650e+01 3.397589e+01 Inf 3.940000e-01 7.614213e+00 391 61 64 5398 39 11 * 4 5 4.050753e-01 3.102006e+01 3.061499e+01 7.557851e+01 6.550000e-01 1.374046e+01 78 34 182 711 24 20 * 19 20 5.437344e+00 2.836265e+01 2.292530e+01 4.216269e+00 1.830000e+00 2.131148e+01 70 32 707 494 21 30 100 101 1.300626e+01 2.836265e+01 1.535638e+01 1.180692e+00 7.131000e+00 2.818679e+01 66 29 3234 501 25 19 200 201 1.669715e+01 2.836265e+01 1.166549e+01 6.986518e-01 1.256500e+01 3.191405e+01 45 23 6079 293 18 23 300 297 1.877920e+01 2.836265e+01 9.583446e+00 5.103224e-01 1.785800e+01 3.343040e+01 39 19 8823 275 15 12 400 393 2.048424e+01 2.836265e+01 7.878402e+00 3.846079e-01 2.210800e+01 3.586937e+01 40 19 11527 298 18 22 500 467 2.164467e+01 2.836265e+01 6.717973e+00 3.103754e-01 2.631600e+01 3.674571e+01 18 11 14002 37 0 0 600 539 2.275256e+01 2.836265e+01 5.610089e+00 2.465696e-01 3.045300e+01 3.740190e+01 30 15 16435 187 17 10 700 573 2.371197e+01 2.836265e+01 4.650680e+00 1.961322e-01 3.382800e+01 3.763155e+01 18 11 18519 53 0 0 800 569 2.442884e+01 2.836265e+01 3.933808e+00 1.610313e-01 3.673900e+01 3.726285e+01 8 5 20354 10 0 0 900 525 2.527566e+01 2.836265e+01 3.086984e+00 1.221327e-01 3.892900e+01 3.660510e+01 9 6 21854 25 0 0 1000 471 2.586635e+01 2.836265e+01 2.496292e+00 9.650730e-02 4.083400e+01 3.602390e+01 33 18 23188 147 14 8 1100 395 2.634758e+01 2.836265e+01 2.015068e+00 7.648018e-02 4.259200e+01 3.510049e+01 9 6 24403 17 0 0 1200 309 2.698695e+01 2.836265e+01 1.375691e+00 5.097616e-02 4.386500e+01 3.440100e+01 9 5 25376 23 0 0 1300 215 2.746620e+01 2.836265e+01 8.964413e-01 3.263797e-02 4.513200e+01 3.356820e+01 9 6 26337 20 0 0 1400 121 2.789287e+01 2.836265e+01 4.697781e-01 1.684223e-02 4.609300e+01 3.299850e+01 5 4 27159 12 0 0 1449 72 2.808272e+01 2.836265e+01 2.799226e-01 9.967788e-03 4.647800e+01 3.272516e+01 4 3 27537 9 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404973 Dual Bound: 28.082722399220863 Dual Gap (relative): 0.009967788101337218 Search Statistics. Total number of nodes processed: 1521 Total number of lmo calls: 27537 Total time (s): 46.479 LMO calls / sec: 592.461111469696 Nodes / sec: 32.72445620602853 LMO calls / node: 18.104536489151872 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2367 Local tightenings / node: 1.63 Total number of potential local tightenings: 5140 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.387474e-03 3.396650e+01 3.397589e+01 Inf 2.358000e+00 1.272265e+00 334 57 64 5398 39 11 * 4 5 4.050753e-01 3.102006e+01 3.061499e+01 7.557851e+01 2.591000e+00 3.473562e+00 67 26 182 711 24 20 * 19 20 5.437344e+00 2.836265e+01 2.292530e+01 4.216269e+00 3.591000e+00 1.086048e+01 63 29 707 494 21 30 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 42 running 1 of 1 signal (10): User defined signal 1 SCIPhashKeyValString at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPhashtableRetrieve at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPparamsetGetReal at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPsetGetRealParam at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPgetRealParam at /home/pkgeval/.julia/artifacts/b4b9fb9a16315161a7cbdcd6bd41d59d13054466/lib/libscip.so (unknown line) SCIPgetRealParam at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:17213:0 [inlined] macro expansion at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/wrapper.jl:16:0 [inlined] get_parameter at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/scip_data.jl:139:0 (pc: 86) get at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/MOI_wrapper.jl:224:0 [inlined] get_tol at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:56:0 [inlined] is_linear_feasible_subroutine at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:254:0 (pc: 55) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:234:0 (pc: 41) is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:229:0 [inlined] is_linear_feasible at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/problem.jl:94:0 [inlined] evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:350:0 (pc: 1231) #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:0 (pc: 370) optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:0 (pc: 5) unknown function (ip: 0x7b6a00f1b8aa) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:0 (pc: 6301) unknown function (ip: 0x7b6a00f18de9) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:0 (pc: 3) #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:0 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:0 (pc: 8) unknown function (ip: 0x7b6a00f0c3fc) at (unknown file) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2533:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:829:21 eval_body at /source/src/interpreter.c:704:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:704:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 ijl_eval_thunk at /source/src/toplevel.c:772:18 jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 ijl_toplevel_eval at /source/src/toplevel.c:786:12 ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 eval at ./boot.jl:618:0 (pc: 1) include_string at ./loading.jl:3291:0 (pc: 140) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 _include at ./loading.jl:3353:0 (pc: 123) include at ./Base.jl:335:0 (pc: 1) IncludeInto at ./Base.jl:336:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2533:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:829:21 eval_body at /source/src/interpreter.c:704:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 eval_body at /source/src/interpreter.c:712:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 ijl_eval_thunk at /source/src/toplevel.c:772:18 jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 ijl_toplevel_eval at /source/src/toplevel.c:786:12 ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 eval at ./boot.jl:618:0 (pc: 1) include_string at ./loading.jl:3291:0 (pc: 140) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 _include at ./loading.jl:3353:0 (pc: 123) include at ./Base.jl:335:0 (pc: 1) IncludeInto at ./Base.jl:336:0 (pc: 2) jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2533:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:829:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:1052:21 ijl_eval_thunk at /source/src/toplevel.c:772:18 jl_toplevel_eval_flex at /source/src/toplevel.c:716:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:601:15 jl_toplevel_eval_flex at /source/src/toplevel.c:688:27 ijl_toplevel_eval at /source/src/toplevel.c:786:12 ijl_toplevel_eval_in at /source/src/toplevel.c:831:13 eval at ./boot.jl:618:0 (pc: 1) __script_entry_eval at ./client.jl:106:0 [inlined] exec_options at ./client.jl:350:0 (pc: 426) _start at ./client.jl:695:0 (pc: 217) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2533:12 [inlined] true_main at /source/src/jlapi.c:989:29 jl_repl_entrypoint at /source/src/jlapi.c:1156:15 main at /source/cli/loader_exe.c:117:15 unknown function (ip: 0x7b6ad6ab1249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 100 101 1.300626e+01 2.836265e+01 1.535638e+01 1.180692e+00 8.937000e+00 2.249077e+01 69 33 3234 501 25 19 200 199 1.683480e+01 2.836265e+01 1.152784e+01 6.847626e-01 1.394800e+01 2.860625e+01 62 29 6092 417 22 16 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:573:34 wait at ./task.jl:1652:0 (pc: 108) wait_forever at ./task.jl:1528:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4590:23 [inlined] ijl_apply_generic at /source/src/gf.c:4838:12 jl_apply at /source/src/julia.h:2533:12 [inlined] start_task at /source/src/task.c:1280:23 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000079d34e798d90 Total snapshots: 345. Utilization: 0% ╎345 @Base/task.jl:1528 wait_forever() 344╎ 345 @Base/task.jl:? wait() 300 287 1.908752e+01 2.836265e+01 9.275128e+00 4.859264e-01 2.180200e+01 2.692414e+01 44 23 8758 243 15 25 [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:573:34 wait at ./task.jl:1652:0 (pc: 108) [42] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:275 wait_safe_interrupt at ./park.jl:231:0 (pc: 6) #wait#428 at ./condition.jl:390:0 (pc: 117) wait at ./condition.jl:325:0 [inlined] _trywait at ./asyncevent.jl:204:0 (pc: 38) #_trywait#727 at ./asyncevent.jl:175:0 [inlined] _trywait at ./asyncevent.jl:175:0 [inlined] profile_printing_listener at ./Base.jl:366:0 (pc: 23) #start_profile_listener##0 at ./Base.jl:386:0 (pc: 2) jfptr_YY.start_profile_listenerYY.YY.0_0.1 at /opt/julia/lib/julia/sys.so (unknown line) start_task at /source/src/task.c:1277:23 unknown function (ip: (nil)) at (unknown file) Allocations: 16905540 (Pool: 16904798; Big: 742); GC: 15 PkgEval terminated after 2731.27s: test duration exceeded the time limit