Package evaluation to test Boscia on Julia 1.14.0-DEV.2116 (f310e68148*) started at 2026-05-06T23:13:20.022 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.95s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.11 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.11 [d360d2e6] + ChainRulesCore v1.26.1 [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.19.4 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.3 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.5.2 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.7.1 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.4 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.2 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.1 [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.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.1+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+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.52s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:448 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 3.5 s ? GenericLinearAlgebra 1.4 s ✓ Bonobo 16.6 s ✓ LEMONGraphs 13.6 s ✓ MathOptSetDistances ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14197337-ba66-59df-a3e3-ca00e7dcff7a"), "GenericLinearAlgebra") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] String(s::Symbol)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base ./module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [13] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3271  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [17] materialize(bc::Base.Broadcast.Broadcasted{Base.Broadcast.DefaultArrayStyle{1}, Nothing, Type{Symbol}, Tuple{Vector{SubString{String}}}})  @ Base.Broadcast ./loading.jl:3123 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:350  [19] _start()  @ Base ./client.jl:593 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 30.0 s ✓ GraphsMatching 16.7 s ✓ Boscia 14.5 s ✓ Boscia → BosciaHiGHSExt 20.3 s ✓ Boscia → BosciaSCIPExt 27.3 s ✓ CombinatorialLinearOracles 8 dependencies successfully precompiled in 150 seconds. 168 already precompiled. 1 dependency failed but may be precompilable after restarting julia 1 dependency had output during precompilation: ┌ GenericLinearAlgebra │ WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:448 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ Precompilation completed after 180.96s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_Al69eW/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.11 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.125 [497a8b3b] DoubleFloats v1.7.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_Al69eW/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.11 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.4 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.125 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.7.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.3 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.4.0 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.23.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.5.2 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.7.1 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.4 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.3 [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.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.2 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.8.1 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.3 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.14.0+0 [e33a78d0] Hwloc_jll v2.13.0+1 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.4+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.33+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+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.9+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.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.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [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.1+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.19.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.3.19 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.6+0 [efcefdf7] PCRE2_jll v10.47.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.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0xaf82ac525c39a57c WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/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 = OPT_TREE_EMPTY WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/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 = OPT_TREE_EMPTY Callback Tests seed = 0xce0bbe4bf6e473ee LMO Tests seed = 0xbf975d962bc0932e WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/LMO_test.jl:254 Indicator Tests seed = 0x91361ba162fcc814 Heuristics Tests seed = 0x865af5f0e07dd915 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/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/4nmmg/test/heuristics.jl:193 [ Info: Polish solution Sparse Regression Tests seed = 0xdf5fbb4345b980a7 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.205617e+00 2.244105e+00 3.848812e-02 1.745004e-02 2.216600e+01 1.353424e-01 7790 15 4 2 2 0 5 0 2.213493e+00 2.244105e+00 3.061178e-02 1.382962e-02 2.585300e+01 1.934012e-01 4 3 16 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.244105e+00 2.244105e+00 0.000000e+00 2.466033e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 2.244105e+00 2.244105e+00 0.000000e+00 2.346284e+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.244105112340941 Dual Bound: 2.213493335853795 Dual Gap (relative): 0.013829622159371883 Search Statistics. Total number of nodes processed: 5 Total number of lmo calls: 20 Total time (s): 30.82 LMO calls / sec: 0.6489292667099286 Nodes / sec: 0.16223231667748214 LMO calls / node: 4.0 Total number of global tightenings: 48 Global tightenings / node: 9.6 Total number of local tightenings: 48 Local tightenings / node: 9.6 Total number of potential local tightenings: 48 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 9.898830e-01 2.714421e+00 1.724538e+00 1.742164e+00 2.009000e+01 1.493280e-01 9652 226 49 110 35 1 * 2 3 9.898830e-01 2.709702e+00 1.719819e+00 1.737396e+00 2.024000e+01 2.470356e-01 135 94 73 114 45 4 * 3 4 1.007300e+00 2.693584e+00 1.686284e+00 1.674063e+00 2.037600e+01 3.435414e-01 130 86 103 50 22 0 100 61 1.920136e+00 2.693584e+00 7.734483e-01 4.028091e-01 2.707900e+01 5.945567e+00 27 18 1378 28 19 1 200 61 1.999977e+00 2.693584e+00 6.936074e-01 3.468077e-01 2.906400e+01 8.980182e+00 32 20 1772 25 18 2 300 61 2.048809e+00 2.693584e+00 6.447756e-01 3.147076e-01 3.118700e+01 1.157534e+01 25 15 2187 25 16 4 400 61 2.090910e+00 2.693584e+00 6.026738e-01 2.882351e-01 3.314600e+01 1.390816e+01 24 15 2626 27 13 3 500 61 2.139016e+00 2.693584e+00 5.545682e-01 2.592633e-01 3.505700e+01 1.600251e+01 21 13 3086 23 9 2 600 61 2.184569e+00 2.693584e+00 5.090152e-01 2.330049e-01 3.708000e+01 1.782632e+01 16 10 3565 13 5 0 700 61 2.226274e+00 2.693584e+00 4.673100e-01 2.099068e-01 3.931800e+01 1.935500e+01 17 11 4096 9 4 0 800 61 2.263666e+00 2.693584e+00 4.299180e-01 1.899211e-01 4.181200e+01 2.059217e+01 43 26 4671 57 18 9 900 61 2.304647e+00 2.693584e+00 3.889375e-01 1.687623e-01 4.442000e+01 2.163440e+01 31 18 5266 41 14 9 1000 61 2.359084e+00 2.693584e+00 3.345001e-01 1.417924e-01 4.679200e+01 2.267482e+01 31 19 5844 49 10 5 1100 61 2.446047e+00 2.693584e+00 2.475370e-01 1.011988e-01 4.885200e+01 2.376566e+01 31 18 6371 35 8 5 1200 17 2.631986e+00 2.693584e+00 6.159791e-02 2.340359e-02 5.054300e+01 2.407851e+01 10 6 6841 2 0 0 1209 8 2.669235e+00 2.693584e+00 2.434880e-02 9.122014e-03 5.064400e+01 2.403049e+01 4 3 6872 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 6.633636e+00 -5.511905e-01 7.184827e+00 0.000000e+00 Inf 1 LD 2 2.693584e+00 2.693584e+00 0.000000e+00 1.623725e-01 1.231736e+01 1 Last 2 2.693584e+00 2.693584e+00 0.000000e+00 3.226662e-01 6.198356e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.693584e+00 2.693584e+00 0.000000e+00 3.261089e-01 6.132922e+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.6935841438495105 Dual Bound: 2.669235342262936 Dual Gap (relative): 0.009122013784641477 Search Statistics. Total number of nodes processed: 1217 Total number of lmo calls: 6877 Total time (s): 53.427 LMO calls / sec: 128.71768955771427 Nodes / sec: 22.77874482939338 LMO calls / node: 5.650780608052588 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: 17 Non zero entries: 20th entry: 0.16300693422683507 29th entry: 0.16300693422683507 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.117959e+00 2.714421e+00 1.596463e+00 1.428016e+00 3.250000e-01 9.230769e+00 319 234 49 110 35 1 * 2 3 1.117959e+00 2.709702e+00 1.591743e+00 1.423794e+00 4.980000e-01 1.004016e+01 156 108 73 114 45 4 * 3 4 1.134294e+00 2.693584e+00 1.559290e+00 1.374679e+00 6.120000e-01 1.143791e+01 109 74 103 50 22 0 100 40 1.982016e+00 2.693584e+00 7.115681e-01 3.590123e-01 7.673000e+00 1.824580e+01 25 16 1347 19 18 0 200 30 2.081211e+00 2.693584e+00 6.123733e-01 2.942389e-01 1.008700e+01 2.280163e+01 21 14 1803 24 15 0 300 30 2.186730e+00 2.693584e+00 5.068538e-01 2.317861e-01 1.331900e+01 2.477663e+01 25 15 2448 30 11 2 400 30 2.282930e+00 2.693584e+00 4.106546e-01 1.798806e-01 1.656800e+01 2.595365e+01 25 15 3192 20 7 2 500 30 2.367305e+00 2.693584e+00 3.262794e-01 1.378274e-01 2.029900e+01 2.610966e+01 23 15 4033 18 5 0 600 29 2.532595e+00 2.693584e+00 1.609894e-01 6.356697e-02 2.387500e+01 2.634555e+01 22 13 4825 12 4 0 639 7 2.671298e+00 2.693584e+00 2.228633e-02 8.342885e-03 2.499100e+01 2.584931e+01 15 10 5097 15 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 6.633636e+00 -5.511905e-01 7.184827e+00 0.000000e+00 Inf 1 LD 2 2.693584e+00 2.693584e+00 0.000000e+00 1.671985e-03 1.196183e+03 1 Last 2 2.693584e+00 2.693584e+00 0.000000e+00 7.373712e-03 2.712338e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.693584e+00 2.693584e+00 0.000000e+00 1.057755e-02 1.890797e+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.6935841438495105 Dual Bound: 2.6712978126423974 Dual Gap (relative): 0.0083428852828161 Search Statistics. Total number of nodes processed: 646 Total number of lmo calls: 5102 Total time (s): 25.014 LMO calls / sec: 203.96577916366834 Nodes / sec: 25.825537698888624 LMO calls / node: 7.897832817337461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 16 Poisson Tests seed = 0x4601e888df84b224 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.840299e+02 -3.611345e+02 2.289544e+01 6.339865e-02 2.644800e+01 1.134301e-01 15693 138 54 3574 35 7 * 6 7 -3.838860e+02 -3.673817e+02 1.650430e+01 4.492410e-02 4.162800e+01 3.122898e-01 2990 108 248 1730 35 30 * 34 35 -3.827796e+02 -3.705067e+02 1.227290e+01 3.312464e-02 1.187620e+02 5.809939e-01 2450 77 1247 1496 29 21 35 36 -3.827182e+02 -3.705067e+02 1.221144e+01 3.295875e-02 1.200060e+02 5.916371e-01 1240 70 1276 690 23 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.558859e+02 -6.818481e+02 1.337734e+03 0.000000e+00 Inf 1 LD 2 -3.581838e+02 -4.143017e+02 5.611786e+01 1.603677e-01 1.247134e+01 2 LD 19 -3.685285e+02 -3.953219e+02 2.679340e+01 4.559149e-01 4.167444e+01 3 LD 44 -3.757109e+02 -3.813344e+02 5.623522e+00 5.014644e-01 8.774302e+01 4 LD 88 -3.762288e+02 -3.774991e+02 1.270273e+00 6.075794e-01 1.448370e+02 5 LD 128 -3.763631e+02 -3.766682e+02 3.051526e-01 6.789024e-01 1.885396e+02 7 LD 190 -3.763686e+02 -3.764112e+02 4.260738e-02 7.560247e-01 2.513146e+02 7 LD 275 -3.763690e+02 -3.763874e+02 1.839116e-02 8.552408e-01 3.215469e+02 8 LD 296 -3.763690e+02 -3.763772e+02 8.257599e-03 8.829050e-01 3.352569e+02 8 LD 327 -3.763690e+02 -3.763727e+02 3.737311e-03 9.217239e-01 3.547700e+02 8 LD 389 -3.763690e+02 -3.763706e+02 1.615855e-03 9.943014e-01 3.912295e+02 8 LD 458 -3.763690e+02 -3.763698e+02 7.812479e-04 1.108778e+00 4.130673e+02 8 LD 570 -3.763690e+02 -3.763691e+02 1.191515e-04 1.189739e+00 4.790968e+02 9 LD 699 -3.763690e+02 -3.763690e+02 3.897578e-05 1.298851e+00 5.381678e+02 9 LD 796 -3.763690e+02 -3.763690e+02 1.203889e-05 1.389141e+00 5.730158e+02 9 LD 875 -3.763690e+02 -3.763690e+02 4.426796e-06 1.466047e+00 5.968431e+02 9 LD 965 -3.763690e+02 -3.763690e+02 1.517148e-06 1.552187e+00 6.217034e+02 9 P 1000 -3.763690e+02 -3.763690e+02 1.517148e-06 1.621491e+00 6.167162e+02 9 LD 1005 -3.763690e+02 -3.763690e+02 6.219800e-07 1.684508e+00 5.966134e+02 9 Last 1005 -3.763690e+02 -3.763690e+02 6.219800e-07 1.689912e+00 5.947054e+02 9 ---------------------------------------------------------------------------------------------------------------- PP 1005 -3.763690e+02 -3.763690e+02 6.219800e-07 1.692316e+00 5.938607e+02 9 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Time limit reached Primal Objective: -376.3689761670837 Dual Bound: -382.71817011528407 Dual Gap (relative): 0.016869599648887453 Search Statistics. Total number of nodes processed: 71 Total number of lmo calls: 1306 Total time (s): 124.506 LMO calls / sec: 10.489454323486418 Nodes / sec: 0.5702536423947441 LMO calls / node: 18.3943661971831 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.520577e+02 -3.479446e+02 4.113090e+00 1.182111e-02 2.593200e+01 1.156872e-01 10365 118 24 50 11 1 * 4 5 -3.514947e+02 -3.481636e+02 3.331083e+00 9.567581e-03 2.855300e+01 3.152033e-01 257 98 76 76 13 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.857266e+02 -3.793264e+02 1.935998e+02 0.000000e+00 Inf 1 LD 2 -3.481636e+02 -3.481636e+02 0.000000e+00 1.630192e-01 1.226850e+01 1 Last 2 -3.481636e+02 -3.481636e+02 0.000000e+00 3.342342e-01 5.983828e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -3.481636e+02 -3.481636e+02 0.000000e+00 3.385716e-01 5.907170e+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: -348.16360474377166 Dual Bound: -351.49468813850615 Dual Gap (relative): 0.009567580727416862 Search Statistics. Total number of nodes processed: 9 Total number of lmo calls: 81 Total time (s): 31.707 LMO calls / sec: 2.5546409310246947 Nodes / sec: 0.2838489923360772 LMO calls / node: 9.0 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.722894e+02 3.352336e+02 1.629442e+02 9.457585e-01 2.205000e+01 1.360544e-01 10481 129 25 57 12 1 * 2 3 1.722894e+02 3.311825e+02 1.588931e+02 9.222451e-01 2.225100e+01 2.247090e-01 196 98 45 54 12 0 * 3 4 1.887075e+02 3.280324e+02 1.393249e+02 7.383114e-01 2.242700e+01 3.121238e-01 169 88 63 47 11 3 * 17 18 2.235245e+02 3.275627e+02 1.040382e+02 4.654445e-01 2.493000e+01 1.403931e+00 169 78 298 53 7 1 100 95 2.672372e+02 3.275627e+02 6.032552e+01 2.257377e-01 3.693000e+01 5.280260e+00 88 44 1467 25 5 0 200 165 2.929619e+02 3.275627e+02 3.460086e+01 1.181070e-01 4.677600e+01 7.803147e+00 87 42 2527 25 5 0 300 153 3.063255e+02 3.275627e+02 2.123717e+01 6.932875e-02 5.254200e+01 8.621674e+00 19 11 3246 2 0 0 400 115 3.168033e+02 3.275627e+02 1.075938e+01 3.396234e-02 5.559100e+01 9.264090e+00 17 11 3683 2 0 0 487 44 3.243232e+02 3.275627e+02 3.239524e+00 9.988568e-03 5.730200e+01 9.266692e+00 16 9 3967 3 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.275627e+02 3.275627e+02 0.000000e+00 1.006666e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.275627e+02 3.275627e+02 0.000000e+00 1.677768e-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: 327.5627095706129 Dual Bound: 324.3231855133611 Dual Gap (relative): 0.009988567583054714 Search Statistics. Total number of nodes processed: 531 Total number of lmo calls: 3971 Total time (s): 60.257 LMO calls / sec: 65.9010571385897 Nodes / sec: 8.812254177937833 LMO calls / node: 7.47834274952919 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.722894e+02 3.352336e+02 1.629442e+02 9.457585e-01 2.260900e+01 1.326905e-01 8762 83 25 57 12 1 * 3 4 1.845647e+02 3.317241e+02 1.471594e+02 7.973325e-01 2.484600e+01 2.817355e-01 205 99 67 68 13 3 * 5 6 1.972657e+02 3.314390e+02 1.341732e+02 6.801649e-01 2.694800e+01 4.081936e-01 187 86 100 62 11 2 * 8 9 2.006135e+02 3.291302e+02 1.285167e+02 6.406182e-01 3.010700e+01 5.646527e-01 155 81 151 41 11 0 * 20 19 2.196118e+02 3.278426e+02 1.082308e+02 4.928280e-01 4.070600e+01 9.580897e-01 153 75 340 46 9 1 * 57 52 2.549970e+02 3.275830e+02 7.258595e+01 2.846541e-01 6.833300e+01 1.595130e+00 96 48 849 31 5 1 * 92 81 2.673494e+02 3.275627e+02 6.021328e+01 2.252231e-01 8.980400e+01 1.926418e+00 69 35 1269 21 5 1 100 87 2.691933e+02 3.275627e+02 5.836939e+01 2.168308e-01 9.396900e+01 1.990018e+00 66 30 1348 26 5 2 200 141 2.967293e+02 3.275627e+02 3.083344e+01 1.039110e-01 1.346050e+02 2.533338e+00 35 19 2145 6 0 0 300 151 3.085288e+02 3.275627e+02 1.903394e+01 6.169260e-02 1.589670e+02 2.837067e+00 14 9 2593 2 0 0 400 75 3.184083e+02 3.275627e+02 9.154385e+00 2.875046e-02 1.656900e+02 2.866799e+00 6 3 2902 0 0 0 447 32 3.244730e+02 3.275627e+02 3.089663e+00 9.522095e-03 1.671760e+02 2.865244e+00 5 3 3031 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 3.275627e+02 3.275627e+02 0.000000e+00 1.032685e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.275627e+02 3.275627e+02 0.000000e+00 1.835750e-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: 327.5627095706129 Dual Bound: 324.473046448368 Dual Gap (relative): 0.009522094842896522 Search Statistics. Total number of nodes processed: 479 Total number of lmo calls: 3035 Total time (s): 170.059 LMO calls / sec: 17.84674730534697 Nodes / sec: 2.816669508817528 LMO calls / node: 6.336116910229645 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 = 0xab0d2e429b916e2c Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.509008e+01 4.160949e+01 5.669957e+01 Inf 2.514300e+01 1.193175e-01 12360 126 49 10001 23 14 * 4 5 -1.135715e+01 2.472097e+01 3.607812e+01 Inf 2.670900e+01 3.369651e-01 467 57 140 10001 21 29 100 53 1.583683e+01 2.472097e+01 8.884134e+00 5.609792e-01 4.862000e+01 3.146853e+00 85 48 2574 657 0 0 158 29 2.214561e+01 2.472097e+01 2.575359e+00 1.162921e-01 6.000400e+01 3.116459e+00 201 44 3898 4138 24 8 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 24.720968479883254 Dual Bound: 22.14560970632666 Dual Gap (relative): 0.11629206906960227 Search Statistics. Total number of nodes processed: 187 Total number of lmo calls: 3898 Total time (s): 61.133 LMO calls / sec: 63.762615935746645 Nodes / sec: 3.0589043560760962 LMO calls / node: 20.844919786096256 Total number of global tightenings: 18 Global tightenings / node: 0.11 Total number of local tightenings: 629 Local tightenings / node: 3.98 Total number of potential local tightenings: 793 Time Limit Test seed = 0xbf345d50048de797 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 -1.348946e+01 -2.681776e-01 1.322128e+01 4.930046e+01 2.368200e+01 1.266785e-01 12710 1070 35 8278 9 14 * 3 4 -1.341784e+01 -9.554279e+00 3.863562e+00 4.043803e-01 2.618000e+01 2.673797e-01 2151 2098 74 1701 13 12 * 6 7 -1.335475e+01 -1.270608e+01 6.486761e-01 5.105243e-02 2.792800e+01 4.654827e-01 637 426 144 10001 10 24 9 10 -1.334427e+01 -1.270608e+01 6.381869e-01 5.022690e-02 3.009300e+01 6.313761e-01 755 620 221 5253 7 10 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -12.706078183560658 Dual Bound: -13.344265051824177 Dual Gap (relative): 0.050226896060596896 Search Statistics. Total number of nodes processed: 19 Total number of lmo calls: 221 Total time (s): 31.223 LMO calls / sec: 7.078115491784902 Nodes / sec: 0.6085257662620505 LMO calls / node: 11.631578947368421 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 7 Local tightenings / node: 0.78 Total number of potential local tightenings: 58 Strong Convexity and Sharpness Tests seed = 0x5a5007cd295215f5 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/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.126147e+02 2.130227e+02 4.079239e-01 1.918606e-03 1.841900e+01 1.628753e-01 7726 0 12 14 3 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 213.02267246858645 Dual Bound: 212.61474852287895 Dual Gap (relative): 0.001918606063509273 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 12 Total time (s): 19.567 LMO calls / sec: 0.6132774569428119 Nodes / sec: 0.15331936423570297 LMO calls / node: 4.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: 17 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:135 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457:34 wait at ./task.jl:1246:50 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 jl_apply at /source/src/julia.h:2327:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000073ba414cc6a0 Total snapshots: 473. Utilization: 0% ╎473 @Base/task.jl:1168 wait_forever() 472╎ 473 @Base/task.jl:1246 wait() WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:135 [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 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457:34 wait at ./task.jl:1246:50 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 jl_apply at /source/src/julia.h:2327:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) Allocations: 20844504 (Pool: 20843763; Big: 741); GC: 16 [48] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:135 typeenv_has at /source/src/jltypes.c:41:12 [inlined] has_free_typevars at /source/src/jltypes.c:122:21 has_free_typevars at /source/src/jltypes.c:145:21 has_free_typevars at /source/src/jltypes.c:130:60 has_free_typevars at /source/src/jltypes.c:151:17 has_free_typevars at /source/src/jltypes.c:130:60 subtype_tuple_tail at /source/src/subtype.c:1383:44 [inlined] subtype_tuple at /source/src/subtype.c:1467:15 [inlined] subtype at /source/src/subtype.c:1637:20 exists_subtype at /source/src/subtype.c:1880:13 [inlined] forall_exists_subtype at /source/src/subtype.c:1909:15 ijl_types_equal at /source/src/subtype.c:2480:23 [inlined] ijl_types_equal at /source/src/subtype.c:2410:18 jl_specializations_get_linfo_ at /source/src/gf.c:198:21 #specialize_method#6 at ./runtime_internals.jl:1796:40 [inlined] specialize_method at ./runtime_internals.jl:1783:4 [inlined] #specialize_method#7 at ./runtime_internals.jl:1800:10 [inlined] specialize_method at ./runtime_internals.jl:1799:4 [inlined] #analyze_method!#205 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:903:89 analyze_method! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:870:29 [inlined] #handle_call_result!#208 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1385:24 handle_call_result! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1374:29 [inlined] #handle_any_call_result!#206 at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1281:23 handle_any_call_result! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1270:31 [inlined] compute_inlining_cases at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1334:141 handle_call! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1366:8 [inlined] assemble_inline_todo! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:1613:145 ssa_inlining_pass! at ./../usr/share/julia/Compiler/src/ssair/inlining.jl:76:4 [inlined] run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1035:79 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1048:2 [inlined] optimize at ./../usr/share/julia/Compiler/src/optimize.jl:1021:3 jfptr_optimize_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 finish_nocycle at ./../usr/share/julia/Compiler/src/typeinfer.jl:278:23 jfptr_finish_nocycle_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4875:187 typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1537:141 typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1723:2 [inlined] typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1732:19 jfptr_typeinf_ext_toplevel_3.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 jl_apply at /source/src/julia.h:2327:12 [inlined] jl_type_infer at /source/src/gf.c:463:35 jl_compile_method_internal at /source/src/gf.c:3638:24 _jl_invoke at /source/src/gf.c:4103:16 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 solve at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/interface.jl:28:17 #solve#122 at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/managed_blmo.jl:311:13 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/4nmmg/src/managed_blmo.jl:299:17 unknown function (ip: 0x7898a9bcb891) at (unknown file) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 macro expansion at /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:231:96 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:2246:122 [inlined] macro expansion at /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:201:138 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:2246:153 [inlined] top-level scope at /home/pkgeval/.julia/packages/Boscia/4nmmg/test/strong_convexity_and_sharpness.jl:137:1342 jl_invoke_oneshot at /source/src/gf.c:4146:23 ijl_eval_thunk at /source/src/toplevel.c:760:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:145 _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 _include at ./loading.jl:3173:45 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 jl_apply at /source/src/julia.h:2327:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:693:13 eval_body at /source/src/interpreter.c:550:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 eval_body at /source/src/interpreter.c:558:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:145 _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 _include at ./loading.jl:3173:45 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 jl_apply at /source/src/julia.h:2327:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:693:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 exec_options at ./client.jl:318:410 _start at ./client.jl:593:36 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4111:23 [inlined] ijl_apply_generic at /source/src/gf.c:4337:12 jl_apply at /source/src/julia.h:2327:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x7898ea44d249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) Allocations: 4442949457 (Pool: 4442945556; Big: 3901); GC: 1659 PkgEval terminated after 2727.2s: test duration exceeded the time limit