Package evaluation to test Boscia on Julia 1.14.0-DEV.2457 (6e8868916a*) started at 2026-06-28T19:42:06.484 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 13.62s ################################################################################ # 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 [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.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.5 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.4.1 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.1 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.1 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 [d9ec5142] + NamedTupleTools v0.14.3 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.6 [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.8.0 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.2 [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.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.5+2 [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 4.97s ################################################################################ # 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:457 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. 2.0 s ? GenericLinearAlgebra 13.1 s ✓ LEMONGraphs 1.9 s ✓ Ipopt_jll 13.0 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:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ 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/KuIQF/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base Base.jl:325  [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:3303  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core boot.jl:522  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [17] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [19] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/KuIQF/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 28.0 s ✓ GraphsMatching 5.5 s ✓ SCIP_PaPILO_jll 2.1 s ✓ SCIP_jll 15.1 s ✓ Boscia 25.9 s ✓ SCIP 13.1 s ✓ Boscia → BosciaHiGHSExt 25.0 s ✓ CombinatorialLinearOracles 17.8 s ✓ Boscia → BosciaSCIPExt 11 dependencies successfully precompiled in 167 seconds. 180 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:457 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 195.96s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_7M7g2E/Project.toml` [4c88cf16] Aqua v0.8.16 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.129 [497a8b3b] DoubleFloats v1.9.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.1 [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.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_7M7g2E/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 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [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 [38540f10] CommonSolve v0.2.9 [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.5 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [31c24e10] Distributions v0.25.129 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.9.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.4.1 [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 [3587e190] InverseFunctions v0.1.17 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.1 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v1.0.1 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.1 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.4 [d9ec5142] NamedTupleTools v0.14.3 ⌅ [bac558e1] OrderedCollections v1.8.2 [90014a1f] PDMats v0.11.40 [69de0a69] Parsers v2.8.6 [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.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [f2b01f46] Roots v3.0.0 [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.8.0 [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.12 [4c63d2b9] StatsFuns v2.2.0 [ec057cc2] StructUtils v2.8.2 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.13.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.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.14.0+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.5+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+1 [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.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.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.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.5+2 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.4+0 [29816b5a] LibSSH2_jll v1.11.101+0 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.7+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 = 0x1563c54c5f886bcc 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 = 0x088e9183fd997e13 LMO Tests seed = 0x677f685ec334df03 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 = 0x29c684a2cd6d269c Heuristics Tests seed = 0x2d5b8846e01e74af 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 Sparse Regression Tests seed = 0xaf00e6ebf16e4164 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 3.016749e+00 3.206231e+00 1.894818e-01 6.280994e-02 2.810200e+01 1.067540e-01 12458 49 14 23 8 0 * 3 2 3.058110e+00 3.114537e+00 5.642758e-02 1.845179e-02 3.314500e+01 2.111932e-01 30 17 31 10 6 2 7 2 3.087629e+00 3.114537e+00 2.690840e-02 8.714908e-03 3.320400e+01 3.312854e-01 8 4 41 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 5.681078e+00 1.682878e+00 3.998199e+00 0.000000e+00 Inf 1 LD 2 3.114537e+00 3.114537e+00 0.000000e+00 2.670169e+00 7.490164e-01 1 Last 2 3.114537e+00 3.114537e+00 0.000000e+00 2.861063e+00 6.990409e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.114537e+00 3.114537e+00 0.000000e+00 2.865194e+00 6.980331e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.1145371954745573 Dual Bound: 3.0876287943133276 Dual Gap (relative): 0.008714908090891156 Search Statistics. Total number of nodes processed: 11 Total number of lmo calls: 46 Total time (s): 39.469 LMO calls / sec: 1.1654716359674682 Nodes / sec: 0.2786997390356989 LMO calls / node: 4.181818181818182 Total number of global tightenings: 42 Global tightenings / node: 6.0 Total number of local tightenings: 44 Local tightenings / node: 6.29 Total number of potential local tightenings: 44 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.054621e+00 3.105284e+00 1.050663e+00 5.113659e-01 2.627800e+01 1.141639e-01 12303 180 36 78 23 1 * 3 4 2.074282e+00 3.068527e+00 9.942449e-01 4.793200e-01 2.653000e+01 2.638522e-01 86 58 76 34 14 0 100 57 2.669474e+00 3.068527e+00 3.990531e-01 1.494875e-01 3.333300e+01 4.710047e+00 30 20 1167 21 16 0 200 57 2.757681e+00 3.068527e+00 3.108457e-01 1.127199e-01 3.573400e+01 7.192030e+00 28 18 1604 18 10 0 300 57 2.814089e+00 3.068527e+00 2.544377e-01 9.041565e-02 3.807600e+01 9.375985e+00 31 20 2038 22 11 0 400 55 2.863772e+00 3.068527e+00 2.047554e-01 7.149852e-02 4.056200e+01 1.121740e+01 32 20 2482 19 6 0 500 55 2.917031e+00 3.068527e+00 1.514965e-01 5.193516e-02 4.305200e+01 1.289139e+01 48 16 2938 25 12 3 600 55 2.967877e+00 3.068527e+00 1.006501e-01 3.391316e-02 4.538400e+01 1.443240e+01 27 17 3398 18 6 0 700 51 3.021778e+00 3.068527e+00 4.674903e-02 1.547070e-02 4.766700e+01 1.575513e+01 32 20 3867 25 9 3 731 48 3.040415e+00 3.068527e+00 2.811227e-02 9.246195e-03 4.837100e+01 1.610469e+01 6 4 4012 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 8.205391e+00 7.940824e-01 7.411309e+00 0.000000e+00 Inf 1 LD 2 3.068527e+00 3.068527e+00 0.000000e+00 1.711740e-01 1.168402e+01 1 Last 2 3.068527e+00 3.068527e+00 0.000000e+00 3.532812e-01 5.661213e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.068527e+00 3.068527e+00 0.000000e+00 3.572417e-01 5.598451e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.0685271534478087 Dual Bound: 3.0404148847808345 Dual Gap (relative): 0.009246194921519924 Search Statistics. Total number of nodes processed: 779 Total number of lmo calls: 4017 Total time (s): 51.663 LMO calls / sec: 77.75390511584693 Nodes / sec: 15.07848944118615 LMO calls / node: 5.156611039794608 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Non zero entries: 2th entry: 0.1695032390804989 32th entry: 0.1695032390804989 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.184606e+00 3.105284e+00 9.206779e-01 4.214388e-01 2.420000e-01 1.239669e+01 235 175 36 78 23 1 * 3 4 2.204471e+00 3.068527e+00 8.640558e-01 3.919560e-01 4.820000e-01 1.452282e+01 84 57 76 34 14 0 100 27 2.774263e+00 3.068527e+00 2.942643e-01 1.060694e-01 7.334000e+00 1.731661e+01 41 26 1218 25 13 2 200 26 2.899588e+00 3.068527e+00 1.689396e-01 5.826333e-02 1.104600e+01 2.045989e+01 29 19 1907 23 14 5 300 25 3.016124e+00 3.068527e+00 5.240341e-02 1.737442e-02 1.470300e+01 2.210433e+01 20 13 2620 17 8 0 320 23 3.038329e+00 3.068527e+00 3.019802e-02 9.939022e-03 1.541700e+01 2.224817e+01 34 22 2767 34 15 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 8.205391e+00 7.940824e-01 7.411309e+00 0.000000e+00 Inf 1 LD 2 3.068527e+00 3.068527e+00 0.000000e+00 1.141979e-03 1.751346e+03 1 Last 2 3.068527e+00 3.068527e+00 0.000000e+00 7.914745e-03 2.526929e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.068527e+00 3.068527e+00 0.000000e+00 1.144219e-02 1.747917e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.0685271534478087 Dual Bound: 3.0383291339864202 Dual Gap (relative): 0.009939021787862505 Search Statistics. Total number of nodes processed: 343 Total number of lmo calls: 2772 Total time (s): 15.44 LMO calls / sec: 179.5336787564767 Nodes / sec: 22.21502590673575 LMO calls / node: 8.081632653061224 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Poisson Tests seed = 0xd9c30bfaab8675b8 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 -5.141245e+02 -4.843395e+02 2.978503e+01 6.149619e-02 3.310000e+01 9.063444e-02 19259 149 51 3087 32 6 * 3 4 -5.140348e+02 -4.907101e+02 2.332472e+01 4.753259e-02 4.050400e+01 1.728224e-01 2298 117 125 1080 32 11 * 5 6 -5.137672e+02 -4.917137e+02 2.205355e+01 4.485039e-02 4.799900e+01 2.291714e-01 1785 104 203 864 30 12 * 7 8 -5.132902e+02 -4.939058e+02 1.938436e+01 3.924707e-02 5.191600e+01 2.889283e-01 2093 95 277 1065 28 10 28 29 -5.126402e+02 -4.939058e+02 1.873438e+01 3.793108e-02 1.200060e+02 4.749763e-01 2112 84 1054 1236 29 25 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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 8.193017e+02 -8.452511e+02 1.664553e+03 0.000000e+00 Inf 1 LD 2 -4.829225e+02 -5.628943e+02 7.997188e+01 1.792761e-01 1.115598e+01 2 LD 11 -4.938227e+02 -5.301119e+02 3.628911e+01 4.696835e-01 2.342003e+01 3 LD 35 -4.990608e+02 -5.170035e+02 1.794264e+01 5.082249e-01 6.886716e+01 3 LD 42 -5.032142e+02 -5.074116e+02 4.197411e+00 5.230666e-01 8.029571e+01 4 LD 96 -5.037933e+02 -5.048584e+02 1.065084e+00 6.004315e-01 1.598850e+02 6 LD 147 -5.038598e+02 -5.041822e+02 3.224298e-01 6.628573e-01 2.217672e+02 6 LD 250 -5.038619e+02 -5.039874e+02 1.254338e-01 7.920512e-01 3.156362e+02 7 LD 277 -5.038621e+02 -5.039208e+02 5.874142e-02 8.293937e-01 3.339789e+02 7 LD 348 -5.038621e+02 -5.038866e+02 2.450887e-02 9.275729e-01 3.751727e+02 9 LD 407 -5.038621e+02 -5.038679e+02 5.735671e-03 1.006282e+00 4.044590e+02 11 LD 471 -5.038621e+02 -5.038635e+02 1.392850e-03 1.080694e+00 4.358311e+02 11 LD 533 -5.038621e+02 -5.038627e+02 5.098981e-04 1.146317e+00 4.649673e+02 11 LD 548 -5.038621e+02 -5.038624e+02 2.027194e-04 1.164461e+00 4.706040e+02 11 LD 607 -5.038621e+02 -5.038622e+02 9.542943e-05 1.222886e+00 4.963668e+02 11 LD 644 -5.038621e+02 -5.038622e+02 3.605625e-05 1.260898e+00 5.107471e+02 11 LD 695 -5.038621e+02 -5.038622e+02 1.523602e-05 1.310583e+00 5.302983e+02 11 LD 724 -5.038621e+02 -5.038622e+02 4.277371e-06 1.340159e+00 5.402346e+02 11 P 1000 -5.038621e+02 -5.038622e+02 4.277371e-06 1.660373e+00 6.022743e+02 11 P 2000 -5.038621e+02 -5.038622e+02 4.277371e-06 2.599870e+00 7.692692e+02 11 P 3000 -5.038621e+02 -5.038622e+02 4.277371e-06 3.452490e+00 8.689381e+02 11 P 4000 -5.038621e+02 -5.038622e+02 4.277371e-06 4.317598e+00 9.264411e+02 11 P 5000 -5.038621e+02 -5.038622e+02 4.277371e-06 5.176293e+00 9.659423e+02 11 P 6000 -5.038621e+02 -5.038622e+02 4.277371e-06 6.055771e+00 9.907905e+02 11 P 7000 -5.038621e+02 -5.038622e+02 4.277371e-06 6.926026e+00 1.010681e+03 11 P 8000 -5.038621e+02 -5.038622e+02 4.277371e-06 7.789781e+00 1.026986e+03 11 P 9000 -5.038621e+02 -5.038622e+02 4.277371e-06 8.652668e+00 1.040142e+03 11 P 10000 -5.038621e+02 -5.038622e+02 4.277371e-06 9.499700e+00 1.052665e+03 11 Last 10001 -5.038621e+02 -5.038622e+02 4.277371e-06 9.504893e+00 1.052195e+03 11 ---------------------------------------------------------------------------------------------------------------- PP 10001 -5.038621e+02 -5.038622e+02 6.938430e-06 9.508721e+00 1.051771e+03 11 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -503.86214877158613 Dual Bound: -512.6401859992375 Dual Gap (relative): 0.017421505562686457 Search Statistics. Total number of nodes processed: 57 Total number of lmo calls: 1086 Total time (s): 132.671 LMO calls / sec: 8.1856622773628 Nodes / sec: 0.42963420792788176 LMO calls / node: 19.05263157894737 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 [ Info: Polish solution Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -4.694939e+02 -4.682456e+02 1.248317e+00 2.665944e-03 2.769900e+01 1.083072e-01 10481 82 18 56 8 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.630861e+02 -5.012935e+02 2.382074e+02 0.000000e+00 Inf 1 LD 2 -4.682456e+02 -4.682456e+02 0.000000e+00 2.545847e-01 7.855932e+00 1 Last 2 -4.682456e+02 -4.682456e+02 0.000000e+00 4.307976e-01 4.642551e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -4.682456e+02 -4.682456e+02 0.000000e+00 4.347457e-01 4.600391e+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: -468.24557712440264 Dual Bound: -469.49389376879486 Dual Gap (relative): 0.0026659443364279085 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 23 Total time (s): 30.948 LMO calls / sec: 0.7431821119296885 Nodes / sec: 0.09693679720822024 LMO calls / node: 7.666666666666667 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.709880e+02 3.788267e+02 2.078388e+02 1.215517e+00 2.295000e+01 1.307190e-01 11300 126 25 56 12 0 * 2 3 1.709880e+02 3.268116e+02 1.558236e+02 9.113134e-01 2.312500e+01 2.162162e-01 169 98 45 46 10 0 * 3 4 1.872197e+02 3.267335e+02 1.395138e+02 7.451878e-01 2.331800e+01 3.001973e-01 186 89 63 70 12 2 * 4 5 1.872197e+02 3.266623e+02 1.394426e+02 7.448074e-01 2.349400e+01 3.830765e-01 171 84 81 62 11 1 * 7 8 2.025023e+02 3.258707e+02 1.233684e+02 6.092198e-01 2.407800e+01 6.229753e-01 176 94 137 59 11 1 100 101 2.667851e+02 3.258707e+02 5.908563e+01 2.214728e-01 3.651800e+01 5.504135e+00 80 43 1493 29 4 0 200 173 2.889383e+02 3.258707e+02 3.693238e+01 1.278210e-01 4.483800e+01 8.318837e+00 52 28 2541 16 3 0 300 197 3.009625e+02 3.258707e+02 2.490819e+01 8.276175e-02 4.939500e+01 1.006175e+01 20 11 3212 5 0 0 400 171 3.117785e+02 3.258707e+02 1.409215e+01 4.519922e-02 5.205400e+01 1.096938e+01 70 35 3668 34 3 0 500 103 3.189532e+02 3.258707e+02 6.917467e+00 2.168803e-02 5.375000e+01 1.121860e+01 13 8 3996 2 2 0 581 42 3.228890e+02 3.258707e+02 2.981698e+00 9.234438e-03 5.520600e+01 1.128501e+01 5 3 4259 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.258707e+02 3.258707e+02 0.000000e+00 1.059578e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.258707e+02 3.258707e+02 0.000000e+00 1.783515e-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: 325.8706923325953 Dual Bound: 322.88899406599927 Dual Gap (relative): 0.009234437597419504 Search Statistics. Total number of nodes processed: 623 Total number of lmo calls: 4263 Total time (s): 58.039 LMO calls / sec: 73.45061079618877 Nodes / sec: 10.7341615120867 LMO calls / node: 6.842696629213483 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.709880e+02 3.788267e+02 2.078388e+02 1.215517e+00 2.695400e+01 1.113007e-01 11010 129 25 56 12 0 * 2 3 1.709880e+02 3.669696e+02 1.959816e+02 1.146172e+00 2.814300e+01 1.776641e-01 255 104 48 117 12 3 * 3 4 1.812955e+02 3.265844e+02 1.452889e+02 8.013926e-01 2.922900e+01 2.394882e-01 124 71 63 38 10 1 * 4 5 1.812955e+02 3.258707e+02 1.445752e+02 7.974559e-01 3.020000e+01 2.980132e-01 120 70 79 36 10 1 100 89 2.691067e+02 3.258707e+02 5.676399e+01 2.109349e-01 1.030250e+02 1.834506e+00 64 33 1364 18 4 0 200 149 2.939583e+02 3.258707e+02 3.191235e+01 1.085608e-01 1.504840e+02 2.319183e+00 47 23 2201 14 4 1 300 189 3.047699e+02 3.258707e+02 2.110080e+01 6.923519e-02 1.823340e+02 2.681891e+00 49 25 2687 14 3 0 400 121 3.140333e+02 3.258707e+02 1.183742e+01 3.769480e-02 1.923810e+02 2.708168e+00 20 11 3057 2 0 0 500 37 3.208706e+02 3.258707e+02 5.000065e+00 1.558281e-02 1.979210e+02 2.713204e+00 16 9 3347 2 0 0 517 24 3.227916e+02 3.258707e+02 3.079050e+00 9.538817e-03 1.993610e+02 2.713670e+00 54 34 3405 9 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.258707e+02 3.258707e+02 0.000000e+00 9.948125e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.258707e+02 3.258707e+02 0.000000e+00 1.961252e-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: 325.8706923325953 Dual Bound: 322.7916418347098 Dual Gap (relative): 0.009538817301416213 Search Statistics. Total number of nodes processed: 541 Total number of lmo calls: 3409 Total time (s): 202.834 LMO calls / sec: 16.806846978317246 Nodes / sec: 2.6672056952976324 LMO calls / node: 6.3012939001848425 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 = 0xfabc3b115f092fe8 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.197793e+01 3.842503e+01 5.040295e+01 Inf 3.083000e+01 9.730782e-02 15796 221 62 10001 21 29 100 67 2.378013e+01 3.842503e+01 1.464489e+01 6.158456e-01 5.614900e+01 2.974229e+00 402 21 2513 10001 11 18 116 69 2.614022e+01 3.842503e+01 1.228481e+01 4.699580e-01 6.000300e+01 3.083179e+00 178 60 2921 2978 17 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 38.42502528397985 Dual Bound: 26.140219129044745 Dual Gap (relative): 0.4699580403014026 Search Statistics. Total number of nodes processed: 185 Total number of lmo calls: 2921 Total time (s): 61.426 LMO calls / sec: 47.55315338781623 Nodes / sec: 3.0117539803991793 LMO calls / node: 15.78918918918919 Total number of global tightenings: 10 Global tightenings / node: 0.09 Total number of local tightenings: 569 Local tightenings / node: 4.91 Total number of potential local tightenings: 761 Time Limit Test seed = 0x0b29eec45e991f6a Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -5.163857e+00 -4.485313e+00 6.785435e-01 1.512812e-01 3.006900e+01 9.977053e-02 16538 963 34 4715 11 12 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -4.4853133931741915 Dual Bound: -5.163856875582374 Dual Gap (relative): 0.15128117545605588 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 34 Total time (s): 31.537 LMO calls / sec: 1.0780987411611758 Nodes / sec: 0.0951263595142214 LMO calls / node: 11.333333333333334 Total number of global tightenings: 4 Global tightenings / node: 4.0 Total number of local tightenings: 4 Local tightenings / node: 4.0 Total number of potential local tightenings: 5 Strong Convexity and Sharpness Tests seed = 0xfc4158cbb422c059 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 0 2.005510e+02 2.005510e+02 0.000000e+00 0.000000e+00 2.386100e+01 4.190939e-02 9717 0 4 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 200.55096239378906 Dual Bound: 200.55096239378906 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 1 Total number of lmo calls: 4 Total time (s): 25.34 LMO calls / sec: 0.15785319652722968 Nodes / sec: 0.03946329913180742 LMO calls / node: 4.0 Total number of global tightenings: 10 Global tightenings / node: 10.0 Total number of local tightenings: 10 Local tightenings / node: 10.0 Total number of potential local tightenings: 20 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 ====================================================================================== 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:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2406:12 [inlined] start_task at /source/src/task.c:1276: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 0x000078289e209f00 Total snapshots: 299. Utilization: 0% ╎299 @Base/task.jl:1170 wait_forever() 298╎ 299 @Base/task.jl:1248 wait() [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:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4326:23 [inlined] ijl_apply_generic at /source/src/gf.c:4564:12 jl_apply at /source/src/julia.h:2406:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) Allocations: 18699263 (Pool: 18698524; Big: 739); GC: 17 PkgEval terminated after 2722.12s: test duration exceeded the time limit