Package evaluation of CbaOPF on Julia 1.13.0-DEV.582 (c0a1728d50*) started at 2025-05-14T14:41:15.474 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.46s ################################################################################ # Installation # Installing CbaOPF... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [b09c5755] + CbaOPF v0.3.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.14.0 [79e6a3ab] + Adapt v4.3.0 [4fba245c] + ArrayInterface v7.19.0 [6e4b80f9] + BenchmarkTools v1.6.0 [b09c5755] + CbaOPF v0.3.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [187b0558] + ConstructionBase v1.5.8 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 ⌅ [a0c0ee7d] + DifferentiationInterface v0.6.54 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.4 [6a86dc24] + FiniteDiff v2.27.0 [4dc3fedf] + FlexPlan v0.4.0 [f6369f11] + ForwardDiff v1.0.1 [87dc4568] + HiGHS v1.17.0 [2030c09a] + InfrastructureModels v0.7.8 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.2 [4076af6c] + JuMP v1.25.0 [d3d80556] + LineSearches v7.3.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.40.0 [f28f55f0] + Memento v1.4.1 [d8a4904e] + MutableArithmetics v1.6.4 [d41bc354] + NLSolversBase v7.9.1 [2774e3e8] + NLsolve v4.5.1 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.0 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [c36e90e8] + PowerModels v0.21.3 [ff45984e] + PowerModelsACDC v0.8.0 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.0 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [6e34b625] + Bzip2_jll v1.0.9+0 [8fd58aa0] + HiGHS_jll v1.10.0+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.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.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.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.12.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.21s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 179.41s ################################################################################ # Testing # Testing CbaOPF Status `/tmp/jl_Uco1Zr/Project.toml` [b09c5755] CbaOPF v0.3.0 [9961bab8] Cbc v1.2.0 [4dc3fedf] FlexPlan v0.4.0 [87dc4568] HiGHS v1.17.0 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.3 [4076af6c] JuMP v1.25.0 [2ddba703] Juniper v0.9.3 [f28f55f0] Memento v1.4.1 [c36e90e8] PowerModels v0.21.3 [ff45984e] PowerModelsACDC v0.8.0 [c946c3f1] SCS v2.1.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_Uco1Zr/Manifest.toml` [47edcb42] ADTypes v1.14.0 [79e6a3ab] Adapt v4.3.0 [4fba245c] ArrayInterface v7.19.0 [6e4b80f9] BenchmarkTools v1.6.0 [b09c5755] CbaOPF v0.3.0 [9961bab8] Cbc v1.2.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [187b0558] ConstructionBase v1.5.8 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 ⌅ [a0c0ee7d] DifferentiationInterface v0.6.54 [b4f34e82] Distances v0.10.12 [ffbed154] DocStringExtensions v0.9.4 [6a86dc24] FiniteDiff v2.27.0 [4dc3fedf] FlexPlan v0.4.0 [f6369f11] ForwardDiff v1.0.1 [87dc4568] HiGHS v1.17.0 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.3 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.2 [4076af6c] JuMP v1.25.0 [2ddba703] Juniper v0.9.3 [d3d80556] LineSearches v7.3.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.40.0 [f28f55f0] Memento v1.4.1 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.9.1 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.0 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [c36e90e8] PowerModels v0.21.3 [ff45984e] PowerModelsACDC v0.8.0 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [c946c3f1] SCS v2.1.0 [efcf1570] Setfield v1.1.2 [276daf66] SpecialFunctions v2.5.1 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [38041ee0] Cbc_jll v200.1000.800+0 [3830e938] Cgl_jll v0.6000.600+0 ⌅ [06985876] Clp_jll v100.1700.700+1 ⌅ [be027038] CoinUtils_jll v200.1100.600+0 [8fd58aa0] HiGHS_jll v1.10.0+0 [e33a78d0] Hwloc_jll v2.12.0+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [1d63c593] LLVMOpenMP_jll v18.1.8+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] Osi_jll v0.10800.700+0 [f4f2fc5b] SCS_jll v3.2.7+0 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.12.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.2.25 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.12.0+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 119 rows; 128 cols; 320 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [1e+03, 1e+06] Bound [4e-01, 6e+00] RHS [1e-02, 4e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0843394150e-01 Ph1: 33(46732.9); Du: 3(0.000108434) 0s 78 3.4021711179e+04 Pr: 0(0); Du: 0(1.81899e-12) 0s Model status : Optimal Simplex iterations: 78 Objective value : 3.4021711179e+04 Relative P-D gap : 2.0530770110e-14 HiGHS run time : 0.16 Nodal CBA OPF: Test Failed at /home/pkgeval/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:15 Expression: isapprox((((resultOPF["solution"])["gen"])["3"])["pg"], 2.9, atol = 0.1) Evaluated: isapprox(0.9552319850280088, 2.9; atol = 0.1) Stacktrace: [1] top-level scope @ ~/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:14 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:15 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] Nodal CBA OPF: Test Failed at /home/pkgeval/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:16 Expression: isapprox((((resultOPF["solution"])["branch"])["2"])["pt"], -1.37, atol = 0.01) Evaluated: isapprox(-1.2016541353383452, -1.37; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:14 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:16 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] Nodal CBA OPF: Test Failed at /home/pkgeval/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:17 Expression: isapprox((((resultOPF["solution"])["convdc"])["4"])["ptf_to"], -0.99, atol = 0.01) Evaluated: isapprox(0.9779072059887967, -0.99; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:14 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:17 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 157 rows; 151 cols; 391 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e+03, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.5815880473e-03 Pr: 85(4862.3); Du: 4(0.000121874) 0s 102 5.7080822231e+03 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 102 Objective value : 5.7080822231e+03 Relative P-D gap : 2.3995782950e-13 HiGHS run time : 0.00 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 143 rows; 151 cols; 377 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e+03, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.5781299485e-03 Pr: 78(4858.11); Du: 4(8.83865e-05) 0s 107 6.2096283796e+01 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 107 Objective value : 6.2096283796e+01 Relative P-D gap : 4.8969737094e-12 HiGHS run time : 0.00 Redispatch OPF: Test Failed at /home/pkgeval/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:36 Expression: isapprox(resultRD_no_control["objective"] - resultRD_with_control["objective"], 1822.9, atol = 0.1) Evaluated: isapprox(5645.985939277149, 1822.9; atol = 0.1) Stacktrace: [1] top-level scope @ ~/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:29 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/CbaOPF/9FbJ5/test/cbaopf.jl:36 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 158 rows; 164 cols; 382 nonzeros; 12 integer variables (12 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [2e+02, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.011 from [lower, value, upper] = [ 0; 3.0110464; 0] WARNING: Row 122 has infeasibility of 14.8 from [lower, value, upper] = [ 14.8; 0; inf] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 74 14.8 112.1 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 158 rows; 164 cols; 382 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [2e+02, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 1e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 73 rows, 91 cols, 227 nonzeros 0s 50 rows, 76 cols, 175 nonzeros 0s 37 rows, 65 cols, 140 nonzeros 0s 26 rows, 52 cols, 103 nonzeros 0s 25 rows, 51 cols, 101 nonzeros 0s Solving MIP model with: 25 rows 51 cols (1 binary, 0 integer, 0 implied int., 50 continuous) 101 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1000 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 1000 1000 0.00% 0 0 0 30 0.0s 1 0 1 100.00% 1000 1000 0.00% 0 0 0 30 0.0s Solving report Status Optimal Primal bound 1000 Dual bound 1000 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 1000 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 30 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit https://github.com/coin-or/Ipopt ****************************************************************************** This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 919 Number of nonzeros in inequality constraint Jacobian.: 102 Number of nonzeros in Lagrangian Hessian.............: 1417 Total number of variables............................: 268 variables with only lower bounds: 0 variables with lower and upper bounds: 254 variables with only upper bounds: 0 Total number of equality constraints.................: 210 Total number of inequality constraints...............: 53 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 15 inequality constraints with only upper bounds: 36 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0761139e+04 4.30e+00 6.14e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.2519560e+04 4.20e+00 6.08e+01 -1.0 7.42e+00 - 8.93e-03 2.23e-02f 1 2 3.1837490e+05 2.13e+00 1.27e+02 -1.0 2.12e+00 2.0 1.30e-02 4.93e-01h 1 3 3.5203474e+05 2.06e+00 1.32e+02 -1.0 1.07e+00 2.4 2.27e-01 3.40e-02h 1 4 2.3098389e+05 1.87e+00 1.30e+02 -1.0 1.18e+00 1.9 6.07e-01 9.36e-02f 1 5 4.0271735e+05 1.32e+00 1.59e+02 -1.0 9.68e-01 2.4 2.89e-01 2.94e-01h 1 6 4.0068846e+05 1.23e+00 1.53e+02 -1.0 9.01e-01 1.9 1.62e-01 6.73e-02h 1 7 8.3108596e+05 6.44e-01 1.51e+02 -1.0 7.05e-01 2.3 7.07e-01 4.76e-01h 1 8 8.5732075e+05 6.15e-01 1.54e+02 -1.0 4.18e-01 2.7 1.89e-01 4.49e-02h 1 9 1.0707412e+06 2.55e-01 1.15e+02 -1.0 4.72e-01 2.3 1.00e+00 5.86e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 9.6592564e+05 1.98e-01 9.42e+01 -1.0 3.75e-01 1.8 1.00e+00 2.24e-01f 1 11 1.1159294e+05 7.77e-02 4.35e+01 -1.0 7.25e-01 1.3 1.00e+00 6.07e-01f 1 12 9.9215372e+04 7.50e-02 5.12e+01 -1.0 2.70e-01 1.7 1.00e+00 3.49e-02f 1 13 1.0344940e+05 1.19e-03 1.73e+01 -1.0 7.86e-02 2.2 1.00e+00 1.00e+00f 1 14 9.9089291e+04 2.55e-04 1.21e+01 -1.0 1.84e-02 1.7 7.02e-01 9.67e-01f 1 15 1.0023507e+05 8.92e-05 1.57e+00 -1.0 4.04e-02 1.2 1.00e+00 1.00e+00f 1 16 9.9311554e+04 2.51e-05 1.61e+00 -1.0 3.66e-02 1.6 1.00e+00 1.00e+00f 1 17 9.8299966e+04 3.94e-05 6.31e-01 -1.0 4.32e-02 1.2 1.00e+00 1.00e+00f 1 18 9.1881518e+04 7.81e-05 2.69e-01 -1.7 4.82e-02 0.7 8.91e-01 1.00e+00f 1 19 8.6231243e+04 6.93e-05 3.20e-01 -1.7 1.97e-01 0.2 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 7.3637538e+04 4.99e-03 2.61e-01 -1.7 3.98e-01 -0.3 6.15e-01 1.00e+00f 1 21 5.8933475e+04 2.30e-03 2.00e-01 -1.7 1.10e+00 -0.7 1.00e+00 4.80e-01f 1 22 5.1986884e+04 1.78e-03 1.56e-01 -2.5 8.85e-01 -1.2 5.71e-01 2.80e-01f 1 23 4.7295384e+04 5.00e-02 9.82e-02 -2.5 2.46e+00 -1.7 4.08e-01 3.55e-01f 1 24 4.1949330e+04 3.34e-02 5.16e-02 -2.5 9.95e-01 -1.3 9.61e-01 9.88e-01h 1 25 3.6822981e+04 4.42e-02 4.71e-02 -2.5 9.57e+00 - 1.38e-01 1.97e-01f 1 26 3.1413526e+04 3.72e-02 3.87e-02 -2.5 1.40e+01 - 2.17e-01 2.50e-01h 1 27 2.7515953e+04 3.02e-02 1.43e-01 -2.5 1.75e+01 - 1.00e+00 2.05e-01h 1 28 2.6613928e+04 2.53e-02 9.60e-02 -2.5 8.39e+00 - 3.99e-01 2.18e-01h 1 29 2.5854896e+04 5.96e-02 2.51e-02 -2.5 4.35e+00 - 8.29e-01 8.91e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 2.6022701e+04 1.13e-02 1.25e-02 -2.5 2.28e+00 - 6.89e-01 1.00e+00h 1 31 2.6000555e+04 6.14e-04 1.79e-03 -2.5 4.37e-01 - 1.00e+00 1.00e+00h 1 32 2.5174621e+04 5.03e-03 3.00e-03 -3.8 1.45e+00 - 7.61e-01 6.78e-01h 1 33 2.4929285e+04 7.12e-03 1.92e-02 -3.8 4.72e-01 - 8.90e-01 6.51e-01h 1 34 2.4784905e+04 1.65e-02 2.64e-03 -3.8 6.52e-01 - 1.00e+00 1.00e+00h 1 35 2.4789563e+04 4.92e-04 3.69e-05 -3.8 2.70e-01 - 1.00e+00 1.00e+00h 1 36 2.4789052e+04 3.65e-05 2.54e-06 -3.8 6.18e-03 - 1.00e+00 1.00e+00h 1 37 2.4744667e+04 9.23e-04 4.73e-03 -5.7 4.58e-01 - 8.62e-01 5.96e-01h 1 38 2.4728900e+04 1.07e-03 1.44e-02 -5.7 2.67e-01 - 9.99e-01 5.08e-01h 1 39 2.4718280e+04 1.11e-03 4.72e-03 -5.7 2.65e-01 - 1.00e+00 8.02e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 2.4716317e+04 2.10e-04 3.63e-05 -5.7 1.87e-01 - 1.00e+00 1.00e+00h 1 41 2.4716420e+04 4.04e-07 1.17e-05 -5.7 2.53e-02 - 1.00e+00 1.00e+00h 1 42 2.4716414e+04 9.86e-09 4.97e-08 -5.7 9.60e-04 - 1.00e+00 1.00e+00h 1 43 2.4715764e+04 6.76e-06 4.34e-03 -8.6 4.95e-02 - 9.81e-01 8.29e-01h 1 44 2.4715673e+04 1.40e-06 6.60e-03 -8.6 1.41e-02 - 1.00e+00 8.34e-01h 1 45 2.4715656e+04 1.19e-07 3.67e-04 -8.6 2.48e-03 - 1.00e+00 9.85e-01f 1 46 2.4715656e+04 2.65e-12 1.08e-08 -8.6 4.56e-04 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 46 (scaled) (unscaled) Objective...............: 2.4715656336444920e+00 2.4715656336444918e+04 Dual infeasibility......: 1.0823750293803935e-08 1.0823750293803936e-04 Constraint violation....: 2.6523228058294990e-12 2.6523228058294990e-12 Variable bound violation: 4.6545995502356163e-08 4.6545995502356163e-08 Complementarity.........: 4.5096143043599654e-09 4.5096143043599653e-05 Overall NLP error.......: 1.0823750293803935e-08 1.0823750293803936e-04 Number of objective function evaluations = 47 Number of objective gradient evaluations = 47 Number of equality constraint evaluations = 47 Number of inequality constraint evaluations = 47 Number of equality constraint Jacobian evaluations = 47 Number of inequality constraint Jacobian evaluations = 47 Number of Lagrangian Hessian evaluations = 46 Total seconds in IPOPT = 30.624 EXIT: Optimal Solution Found. PSTs not yet defined for SOC formulations This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 716 Number of nonzeros in inequality constraint Jacobian.: 418 Number of nonzeros in Lagrangian Hessian.............: 206 Total number of variables............................: 310 variables with only lower bounds: 0 variables with lower and upper bounds: 310 variables with only upper bounds: 0 Total number of equality constraints.................: 194 Total number of inequality constraints...............: 152 inequality constraints with only lower bounds: 45 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 107 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0761139e+04 5.06e+01 6.29e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5890565e+03 4.99e+01 6.23e+01 -1.0 5.38e+00 - 1.07e-02 1.40e-02f 1 2 3.3071950e+04 4.27e+01 6.52e+01 -1.0 4.40e+00 - 2.27e-02 1.45e-01f 1 3 5.9275446e+03 4.06e+01 6.00e+01 -1.0 3.36e+00 - 7.04e-02 4.86e-02h 1 4 4.8183627e+04 8.29e+00 6.64e+01 -1.0 2.98e+00 - 1.92e-01 7.96e-01f 1 5 2.2722521e+04 5.64e+00 3.04e+01 -1.0 7.08e-01 - 5.24e-01 3.19e-01f 1 6 3.2857826e+04 7.79e-01 4.58e+01 -1.0 9.68e-01 - 2.91e-01 8.62e-01h 1 7 3.1354319e+04 2.27e-01 5.17e+01 -1.0 6.91e-01 - 2.88e-01 7.09e-01h 1 8 3.2364205e+04 1.72e-01 3.90e+01 -1.0 2.02e+00 - 2.53e-01 2.43e-01h 1 9 3.5342307e+04 8.97e-02 2.67e+01 -1.0 2.36e+00 - 3.56e-01 4.79e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.1894105e+04 5.68e-14 2.11e+01 -1.0 2.19e+00 - 7.34e-01 1.00e+00h 1 11 3.9579132e+04 5.68e-14 7.96e-01 -1.0 1.99e+00 - 1.00e+00 1.00e+00h 1 12 1.7531758e+04 5.68e-14 8.39e+00 -1.7 3.50e+00 - 8.98e-01 1.00e+00f 1 13 1.4102169e+04 5.68e-14 1.12e-02 -1.7 3.58e+00 - 1.00e+00 1.00e+00h 1 14 1.3599280e+04 3.66e-14 4.28e-04 -1.7 9.65e-01 - 1.00e+00 1.00e+00h 1 15 7.2727521e+03 5.68e-14 8.87e-01 -3.8 4.15e+00 - 7.54e-01 8.00e-01f 1 16 3.6546366e+03 2.97e-03 2.42e-01 -3.8 3.48e+00 - 7.01e-01 9.73e-01h 1 17 3.2153974e+03 5.68e-14 3.86e-03 -3.8 6.43e-01 - 1.00e+00 1.00e+00h 1 18 3.2367220e+03 5.68e-14 3.56e-03 -3.8 2.79e-01 - 1.00e+00 1.00e+00h 1 19 3.2363174e+03 5.68e-14 2.39e-06 -3.8 1.12e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 3.1369097e+03 7.28e-04 4.20e-03 -5.7 1.03e-01 - 9.17e-01 9.42e-01h 1 21 3.1242081e+03 3.87e-05 7.68e-02 -5.7 8.52e-01 - 8.39e-01 6.21e-01h 1 22 3.1164463e+03 1.11e-05 2.20e-02 -5.7 1.87e-01 - 1.00e+00 9.81e-01h 1 23 3.1159197e+03 1.26e-06 2.65e-02 -5.7 1.52e-01 - 1.00e+00 6.35e-01h 1 24 3.1154519e+03 5.68e-14 1.34e-04 -5.7 4.42e-02 - 1.00e+00 1.00e+00h 1 25 3.1152665e+03 5.68e-14 2.98e-06 -5.7 1.48e-02 - 1.00e+00 1.00e+00h 1 26 3.1152693e+03 1.14e-13 2.32e-07 -5.7 1.25e-03 - 1.00e+00 1.00e+00h 1 27 3.1141821e+03 5.68e-14 4.87e-02 -8.6 9.01e-02 - 9.12e-01 4.87e-01h 1 28 3.1137687e+03 1.14e-13 2.82e-01 -8.6 8.83e-02 - 7.21e-01 4.40e-01h 1 29 3.1133502e+03 5.68e-14 2.46e-01 -8.6 1.23e-01 - 7.60e-01 7.79e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 3.1132338e+03 2.05e-06 8.31e-01 -8.6 1.33e-01 - 9.15e-01 8.43e-01f 1 31 3.1132099e+03 9.20e-07 1.68e-01 -8.6 3.34e-02 - 1.00e+00 8.17e-01h 1 32 3.1132018e+03 3.65e-07 1.28e-03 -8.6 6.73e-03 - 1.00e+00 1.00e+00f 1 33 3.1132004e+03 5.68e-14 2.18e-02 -8.6 1.66e-03 - 1.00e+00 7.26e-01h 1 34 3.1131993e+03 5.68e-14 4.28e-05 -8.6 9.62e-04 - 1.00e+00 1.00e+00f 1 35 3.1131989e+03 5.68e-14 9.16e-03 -8.6 5.02e-04 - 1.00e+00 7.88e-01h 1 36 3.1131986e+03 1.14e-13 3.59e-05 -8.6 2.62e-04 - 1.00e+00 1.00e+00f 1 37 3.1131984e+03 5.68e-14 1.31e-02 -8.6 1.68e-04 - 1.00e+00 8.81e-01h 1 38 3.1131983e+03 5.68e-14 1.20e-05 -8.6 5.43e-05 - 1.00e+00 1.00e+00f 1 39 3.1131983e+03 5.68e-14 2.77e-06 -8.6 4.37e-05 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 3.1131983e+03 4.31e-14 5.27e-08 -8.6 5.82e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 40 (scaled) (unscaled) Objective...............: 3.1131982681945997e-01 3.1131982681945997e+03 Dual infeasibility......: 5.2699748460603376e-08 5.2699748460603376e-04 Constraint violation....: 2.7860447282535010e-14 4.3100939484119749e-14 Variable bound violation: 1.7637169946738140e-08 1.7637169946738140e-08 Complementarity.........: 2.5059036076667861e-09 2.5059036076667859e-05 Overall NLP error.......: 5.2699748460603376e-08 5.2699748460603376e-04 Number of objective function evaluations = 41 Number of objective gradient evaluations = 41 Number of equality constraint evaluations = 41 Number of inequality constraint evaluations = 41 Number of equality constraint Jacobian evaluations = 41 Number of inequality constraint Jacobian evaluations = 41 Number of Lagrangian Hessian evaluations = 40 Total seconds in IPOPT = 0.059 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 998 Number of nonzeros in inequality constraint Jacobian.: 1297 Number of nonzeros in Lagrangian Hessian.............: 113 Total number of variables............................: 299 variables with only lower bounds: 0 variables with lower and upper bounds: 285 variables with only upper bounds: 0 Total number of equality constraints.................: 203 Total number of inequality constraints...............: 495 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 15 inequality constraints with only upper bounds: 478 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0761139e+04 5.01e+01 6.21e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0030006e+03 4.94e+01 6.15e+01 -1.0 4.21e+00 - 1.03e-02 1.48e-02f 1 2 1.9811016e+04 4.47e+01 6.00e+01 -1.0 3.51e+00 - 4.84e-02 9.51e-02f 1 3 9.7337831e+03 4.10e+01 5.62e+01 -1.0 4.39e+00 - 6.99e-02 8.28e-02f 1 4 4.4471393e+04 2.10e+01 6.03e+01 -1.0 3.61e+00 - 1.26e-01 4.87e-01h 1 5 4.3709872e+04 1.42e+01 1.49e+01 -1.0 1.53e+00 - 6.63e-01 3.23e-01h 1 6 6.5032336e+04 6.07e-01 3.39e+00 -1.0 1.11e+00 - 8.85e-01 9.57e-01h 1 7 6.8972896e+04 2.75e-01 5.59e+00 -1.0 2.16e+00 - 4.23e-01 5.47e-01h 1 8 8.3684657e+04 8.24e-02 3.97e+01 -1.0 4.18e+00 - 3.05e-01 7.00e-01f 1 9 7.9586871e+04 1.42e-14 9.94e-03 -1.0 4.30e+00 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.8793748e+04 2.84e-14 1.19e+01 -1.7 1.58e+00 - 7.29e-01 1.00e+00f 1 11 5.3027493e+04 5.68e-14 5.08e+00 -1.7 2.14e+00 - 5.96e-01 1.00e+00h 1 12 4.8488447e+04 2.84e-14 4.96e-03 -1.7 1.22e+00 - 1.00e+00 1.00e+00h 1 13 4.8876851e+04 2.84e-14 2.98e-04 -1.7 3.38e-01 - 1.00e+00 1.00e+00h 1 14 4.0709611e+04 2.84e-14 9.72e-01 -3.8 4.45e+00 - 3.69e-01 4.70e-01f 1 15 2.9428713e+04 2.84e-14 1.45e+00 -3.8 4.50e+00 - 4.28e-01 7.09e-01h 1 16 2.8655306e+04 1.42e-14 6.17e+00 -3.8 2.46e+00 - 4.93e-01 1.48e-01h 1 17 2.6677133e+04 2.84e-14 5.51e+00 -3.8 2.14e+00 - 6.62e-01 4.62e-01h 1 18 2.5290919e+04 2.84e-14 5.82e+00 -3.8 2.25e+00 - 8.84e-01 5.45e-01h 1 19 2.4859819e+04 2.19e-02 4.12e+00 -3.8 1.99e+00 - 9.52e-01 5.70e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 2.4630591e+04 2.84e-14 7.97e-02 -3.8 1.74e+00 - 1.00e+00 9.88e-01h 1 21 2.4648346e+04 2.84e-14 3.18e-04 -3.8 7.75e-01 - 1.00e+00 1.00e+00h 1 22 2.4646620e+04 2.84e-14 1.86e-05 -3.8 8.66e-02 - 1.00e+00 1.00e+00h 1 23 2.4568446e+04 2.84e-14 2.92e-01 -5.7 2.30e+00 - 7.54e-01 6.46e-01h 1 24 2.4534723e+04 9.00e-07 9.14e-02 -5.7 5.36e+00 - 7.55e-01 7.36e-01h 1 25 2.4523299e+04 8.41e-02 3.03e-02 -5.7 5.58e+00 - 7.93e-01 7.36e-01h 1 26 2.4521905e+04 3.43e-01 6.27e-01 -5.7 1.21e+00 - 1.00e+00 4.34e-01h 1 27 2.4520652e+04 2.84e-14 2.32e-05 -5.7 1.08e-01 - 1.00e+00 1.00e+00h 1 28 2.4520681e+04 2.84e-14 3.03e-06 -5.7 3.88e-02 - 1.00e+00 1.00e+00h 1 29 2.4520681e+04 2.84e-14 5.30e-09 -5.7 2.21e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 2.4519498e+04 9.54e-05 1.47e-01 -8.6 8.80e-02 - 9.56e-01 7.67e-01h 1 31 2.4519216e+04 1.66e-06 4.08e-02 -8.6 2.52e-02 -4.0 9.33e-01 8.49e-01h 1 32 2.4519175e+04 4.03e-07 1.76e-02 -8.6 3.18e-02 -4.5 1.00e+00 6.98e-01h 1 33 2.4519169e+04 3.53e-07 1.74e-02 -8.6 3.05e-01 - 3.31e-01 9.08e-02h 1 34 2.4519156e+04 2.84e-14 2.68e-04 -8.6 6.66e-03 - 1.00e+00 9.96e-01f 1 35 2.4519156e+04 2.84e-14 1.08e-08 -8.6 9.75e-04 -5.0 1.00e+00 1.00e+00f 1 Number of Iterations....: 35 (scaled) (unscaled) Objective...............: 2.4519155760097200e+00 2.4519155760097197e+04 Dual infeasibility......: 1.0838241013388449e-08 1.0838241013388449e-04 Constraint violation....: 1.8371792975813153e-14 2.8421709430404007e-14 Variable bound violation: 4.6907539186236136e-08 4.6907539186236136e-08 Complementarity.........: 3.6653591493627400e-09 3.6653591493627396e-05 Overall NLP error.......: 1.0838241013388449e-08 1.0838241013388449e-04 Number of objective function evaluations = 36 Number of objective gradient evaluations = 36 Number of equality constraint evaluations = 36 Number of inequality constraint evaluations = 36 Number of equality constraint Jacobian evaluations = 36 Number of inequality constraint Jacobian evaluations = 36 Number of Lagrangian Hessian evaluations = 35 Total seconds in IPOPT = 0.134 EXIT: Optimal Solution Found. [warn | InfrastructureModels]: Matlab parser skipping the following line: ]; Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 6796 rows; 13104 cols; 20773 nonzeros; 720 integer variables (720 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.7 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 6796 rows; 13104 cols; 20773 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2692 rows, 2664 cols, 9061 nonzeros 0s 2335 rows, 1789 cols, 8378 nonzeros 0s 2160 rows, 1649 cols, 7905 nonzeros 0s Solving MIP model with: 2160 rows 1649 cols (697 binary, 0 integer, 0 implied int., 952 continuous) 7905 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0006 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0006 36.1506245 100.00% 0 0 0 661 0.1s 1 0 1 100.00% 36.1506245 36.1506245 0.00% 0 0 0 661 0.2s Solving report Status Optimal Primal bound 36.1506245026 Dual bound 36.1506245026 Gap 0% (tolerance: 0.01%) P-D integral 0.000437490831398 Solution status feasible 36.1506245026 (objective) 0 (bound viol.) 4.88498130835e-15 (int. viol.) 0 (row viol.) Timing 0.16 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 661 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 12124 rows; 13104 cols; 36085 nonzeros; 720 integer variables (720 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 1848 5 1790 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 12124 rows; 13104 cols; 36085 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 6484 rows, 5928 cols, 23077 nonzeros 0s 4903 rows, 4405 cols, 19120 nonzeros 0s 4170 rows, 3720 cols, 17529 nonzeros 0s 2970 rows, 1923 cols, 13885 nonzeros 0s 2970 rows, 1923 cols, 13885 nonzeros 0s Solving MIP model with: 2970 rows 1923 cols (697 binary, 0 integer, 0 implied int., 1226 continuous) 13885 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0006 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1092 0.3s 96.6% inactive integer columns, restarting Model after restart has 938 rows, 1048 cols (15 bin., 0 int., 0 impl., 1033 cont.), and 3217 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1092 0.4s 0 0 0 0.00% 1.330837351 1.331336304 0.04% 0 0 0 1559 0.4s L 0 0 0 0.00% 1.33097375 1.331336304 0.03% 24 4 0 1565 0.5s L 0 0 0 0.00% 1.33097375 1.331336304 0.03% 24 4 0 1592 0.6s 40.0% inactive integer columns, restarting Model after restart has 899 rows, 1041 cols (8 bin., 0 int., 0 impl., 1033 cont.), and 3021 nonzeros 0 0 0 0.00% 1.33097375 1.331336304 0.03% 3 0 0 1632 0.6s 0 0 0 0.00% 1.33097375 1.331336304 0.03% 3 3 0 1664 0.6s 50.0% inactive integer columns, restarting Model after restart has 869 rows, 1037 cols (4 bin., 0 int., 0 impl., 1033 cont.), and 2891 nonzeros 0 0 0 0.00% 1.33102973 1.331336304 0.02% 3 0 0 1694 0.8s 0 0 0 0.00% 1.33102973 1.331336304 0.02% 3 3 0 1712 0.8s 1 0 1 100.00% 1.331336304 1.331336304 0.00% 54 7 0 1723 0.9s Solving report Status Optimal Primal bound 1.33133630422 Dual bound 1.33133630422 Gap 0% (tolerance: 0.01%) P-D integral 0.000156260358888 Solution status feasible 1.33133630422 (objective) 0 (bound viol.) 2.6645352591e-15 (int. viol.) 0 (row viol.) Timing 0.87 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1723 (total) 0 (strong br.) 18 (separation) 96 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 6796 rows; 13104 cols; 20773 nonzeros; 240 integer variables (240 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.7 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 6796 rows; 13104 cols; 20773 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2692 rows, 2664 cols, 9061 nonzeros 0s 2335 rows, 1789 cols, 8378 nonzeros 0s 2148 rows, 1640 cols, 7856 nonzeros 0s Solving MIP model with: 2148 rows 1640 cols (240 binary, 0 integer, 6 implied int., 1394 continuous) 7856 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0006 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0006 36.1506245 100.00% 0 0 0 662 0.1s 1 0 1 100.00% 36.1506245 36.1506245 0.00% 0 0 0 662 0.1s Solving report Status Optimal Primal bound 36.1506245026 Dual bound 36.1506245026 Gap 0% (tolerance: 0.01%) P-D integral 8.91670686336e-05 Solution status feasible 36.1506245026 (objective) 0 (bound viol.) 4.4408920985e-15 (int. viol.) 0 (row viol.) Timing 0.13 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 662 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 12124 rows; 13104 cols; 36085 nonzeros; 240 integer variables (240 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 1848 5 1790 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 12124 rows; 13104 cols; 36085 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 6484 rows, 5928 cols, 23077 nonzeros 0s 4903 rows, 4405 cols, 19120 nonzeros 0s 4170 rows, 3720 cols, 17529 nonzeros 0s 2970 rows, 1923 cols, 13885 nonzeros 0s 2872 rows, 1874 cols, 13205 nonzeros 0s Solving MIP model with: 2872 rows 1874 cols (240 binary, 0 integer, 6 implied int., 1628 continuous) 13205 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0006 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 1.330766951 1.332417969 0.12% 0 0 0 1123 0.2s 25.8% inactive integer columns, restarting Model after restart has 2345 rows, 1504 cols (176 bin., 0 int., 8 impl., 1320 cont.), and 10363 nonzeros 0 0 0 0.00% 1.330766951 1.332417969 0.12% 0 0 0 1123 0.3s R 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1297 0.4s 64.2% inactive integer columns, restarting Model after restart has 1470 rows, 1177 cols (61 bin., 0 int., 0 impl., 1116 cont.), and 5531 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1297 0.4s 21.3% inactive integer columns, restarting Model after restart has 1346 rows, 1140 cols (46 bin., 0 int., 0 impl., 1094 cont.), and 4914 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1665 0.5s 15.2% inactive integer columns, restarting Model after restart has 1267 rows, 1118 cols (38 bin., 0 int., 0 impl., 1080 cont.), and 4552 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1716 0.5s 18.4% inactive integer columns, restarting Model after restart has 1181 rows, 1097 cols (31 bin., 0 int., 0 impl., 1066 cont.), and 4197 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1752 0.6s 19.4% inactive integer columns, restarting Model after restart has 1097 rows, 1078 cols (24 bin., 0 int., 0 impl., 1054 cont.), and 3848 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1794 0.7s 20.8% inactive integer columns, restarting Model after restart has 996 rows, 1059 cols (15 bin., 0 int., 0 impl., 1044 cont.), and 3419 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1830 0.8s 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1868 0.8s L 0 0 0 0.00% 1.33097375 1.331336304 0.03% 21 4 0 1876 0.9s 46.7% inactive integer columns, restarting Model after restart has 911 rows, 1046 cols (8 bin., 0 int., 0 impl., 1038 cont.), and 3074 nonzeros 0 0 0 0.00% 1.33097375 1.331336304 0.03% 1 0 0 1992 1.0s 0 0 0 0.00% 1.33097375 1.331336304 0.03% 1 1 0 2046 1.0s 37.5% inactive integer columns, restarting Model after restart has 886 rows, 1039 cols (5 bin., 0 int., 0 impl., 1034 cont.), and 2951 nonzeros 0 0 0 0.00% 1.33102973 1.331336304 0.02% 2 0 0 2097 1.2s 20.0% inactive integer columns, restarting Model after restart has 871 rows, 1038 cols (4 bin., 0 int., 0 impl., 1034 cont.), and 2896 nonzeros 0 0 0 0.00% 1.33102973 1.331336304 0.02% 2 0 0 2113 1.2s 0 0 0 0.00% 1.33102973 1.331336304 0.02% 2 2 0 2134 1.2s 1 0 1 100.00% 1.331336304 1.331336304 0.00% 53 6 0 2145 1.3s Solving report Status Optimal Primal bound 1.33133630422 Dual bound 1.33133630422 Gap 0% (tolerance: 0.01%) P-D integral 0.000478367340977 Solution status feasible 1.33133630422 (objective) 0 (bound viol.) 1.98729921408e-14 (int. viol.) 0 (row viol.) Timing 1.32 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 2145 (total) 0 (strong br.) 21 (separation) 165 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 7132 rows; 15384 cols; 22045 nonzeros; 720 integer variables (720 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 7132 rows; 15384 cols; 22045 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2668 rows, 2448 cols, 9325 nonzeros 0s 2302 rows, 1516 cols, 8893 nonzeros 0s 2060 rows, 1325 cols, 8247 nonzeros 0s Solving MIP model with: 2060 rows 1325 cols (697 binary, 0 integer, 0 implied int., 628 continuous) 8247 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0003 inf inf 0 0 0 0 0.0s T 0 0 0 0.00% 0.0003 161.57221 100.00% 0 0 0 563 0.1s 1 0 1 100.00% 161.57221 161.57221 0.00% 0 0 0 563 0.1s Solving report Status Optimal Primal bound 161.572209983 Dual bound 161.572209983 Gap 0% (tolerance: 0.01%) P-D integral 8.34463477458e-05 Solution status feasible 161.572209983 (objective) 0 (bound viol.) 8.21565038223e-15 (int. viol.) 0 (row viol.) Timing 0.11 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 563 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 12868 rows; 15384 cols; 38557 nonzeros; 720 integer variables (720 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 1968 5 1884 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 12868 rows; 15384 cols; 38557 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 6700 rows, 5976 cols, 24157 nonzeros 0s 5038 rows, 4372 cols, 19979 nonzeros 0s 4250 rows, 3632 cols, 18254 nonzeros 0s 2923 rows, 1684 cols, 14273 nonzeros 0s 2923 rows, 1684 cols, 14273 nonzeros 0s Solving MIP model with: 2923 rows 1684 cols (697 binary, 0 integer, 0 implied int., 987 continuous) 14273 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0003 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 948 0.3s 79.1% inactive integer columns, restarting Model after restart has 1505 rows, 1067 cols (106 bin., 0 int., 0 impl., 961 cont.), and 5613 nonzeros 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 948 0.3s R 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1289 0.4s 83.0% inactive integer columns, restarting Model after restart has 993 rows, 969 cols (15 bin., 0 int., 0 impl., 954 cont.), and 3321 nonzeros 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1289 0.4s 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1610 0.5s 20.0% inactive integer columns, restarting Model after restart has 969 rows, 964 cols (11 bin., 0 int., 0 impl., 953 cont.), and 3185 nonzeros 0 0 0 0.00% 1.422129654 1.422531576 0.03% 2 0 0 1720 0.7s 0 0 0 0.00% 1.422129654 1.422531576 0.03% 2 2 0 1751 0.7s 27.3% inactive integer columns, restarting Model after restart has 935 rows, 960 cols (7 bin., 0 int., 0 impl., 953 cont.), and 3059 nonzeros 0 0 0 0.00% 1.422209654 1.422531576 0.02% 5 0 0 1833 0.9s 14.3% inactive integer columns, restarting Model after restart has 920 rows, 959 cols (6 bin., 0 int., 0 impl., 953 cont.), and 2996 nonzeros 0 0 0 0.00% 1.422209654 1.422531576 0.02% 2 0 0 1886 0.9s 0 0 0 0.00% 1.422209654 1.422531576 0.02% 2 2 0 1894 0.9s 1 0 1 100.00% 1.422389415 1.422531576 0.01% 52 6 0 1911 1.0s Solving report Status Optimal Primal bound 1.42253157607 Dual bound 1.42238941537 Gap 0.00999% (tolerance: 0.01%) P-D integral 0.000297077264809 Solution status feasible 1.42253157607 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 1.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1911 (total) 0 (strong br.) 32 (separation) 177 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 7132 rows; 15384 cols; 22045 nonzeros; 240 integer variables (240 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 7132 rows; 15384 cols; 22045 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2668 rows, 2448 cols, 9325 nonzeros 0s 2302 rows, 1516 cols, 8893 nonzeros 0s 2028 rows, 1296 cols, 8229 nonzeros 0s Solving MIP model with: 2028 rows 1296 cols (240 binary, 0 integer, 6 implied int., 1050 continuous) 8229 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0003 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0003 161.57221 100.00% 0 0 0 542 0.1s 1 0 1 100.00% 161.57221 161.57221 0.00% 0 0 0 542 0.1s Solving report Status Optimal Primal bound 161.572209983 Dual bound 161.572209983 Gap 0% (tolerance: 0.01%) P-D integral 7.4386458562e-05 Solution status feasible 161.572209983 (objective) 0 (bound viol.) 8.21565038223e-15 (int. viol.) 0 (row viol.) Timing 0.12 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 542 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 12868 rows; 15384 cols; 38557 nonzeros; 240 integer variables (240 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 1968 5 1884 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 12868 rows; 15384 cols; 38557 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 6700 rows, 5976 cols, 24157 nonzeros 0s 5038 rows, 4372 cols, 19979 nonzeros 0s 4227 rows, 3609 cols, 18208 nonzeros 0s 2923 rows, 1684 cols, 14273 nonzeros 0s 2871 rows, 1655 cols, 13988 nonzeros 0s Solving MIP model with: 2871 rows 1655 cols (240 binary, 0 integer, 6 implied int., 1409 continuous) 13988 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0003 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 953 0.2s 41.2% inactive integer columns, restarting Model after restart has 2234 rows, 1328 cols (141 bin., 0 int., 0 impl., 1187 cont.), and 9512 nonzeros 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 953 0.2s R 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1034 0.3s 56.7% inactive integer columns, restarting Model after restart has 1539 rows, 1093 cols (59 bin., 0 int., 0 impl., 1034 cont.), and 5802 nonzeros 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1034 0.3s 22.0% inactive integer columns, restarting Model after restart has 1420 rows, 1057 cols (45 bin., 0 int., 0 impl., 1012 cont.), and 5171 nonzeros 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1311 0.4s 17.8% inactive integer columns, restarting Model after restart has 1316 rows, 1032 cols (36 bin., 0 int., 0 impl., 996 cont.), and 4703 nonzeros 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1370 0.5s 16.7% inactive integer columns, restarting Model after restart has 1241 rows, 1014 cols (30 bin., 0 int., 0 impl., 984 cont.), and 4374 nonzeros 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1423 0.5s 20.0% inactive integer columns, restarting Model after restart has 1149 rows, 995 cols (23 bin., 0 int., 0 impl., 972 cont.), and 3974 nonzeros 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1475 0.6s 21.7% inactive integer columns, restarting Model after restart has 1036 rows, 975 cols (14 bin., 0 int., 0 impl., 961 cont.), and 3470 nonzeros 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1533 0.7s 0 0 0 0.00% 1.421932129 1.422531576 0.04% 0 0 0 1573 0.7s 35.7% inactive integer columns, restarting Model after restart has 973 rows, 966 cols (9 bin., 0 int., 0 impl., 957 cont.), and 3197 nonzeros 0 0 0 0.00% 1.422129654 1.422531576 0.03% 3 0 0 1759 0.9s 0 0 0 0.00% 1.422129654 1.422531576 0.03% 3 3 0 1827 0.9s 22.2% inactive integer columns, restarting Model after restart has 935 rows, 960 cols (7 bin., 0 int., 0 impl., 953 cont.), and 3059 nonzeros 0 0 0 0.00% 1.422209654 1.422531576 0.02% 6 0 0 1920 1.1s 14.3% inactive integer columns, restarting Model after restart has 920 rows, 959 cols (6 bin., 0 int., 0 impl., 953 cont.), and 2996 nonzeros 0 0 0 0.00% 1.422209654 1.422531576 0.02% 3 0 0 1971 1.1s 0 0 0 0.00% 1.422209654 1.422531576 0.02% 3 3 0 1980 1.2s 1 0 1 100.00% 1.422389415 1.422531576 0.01% 50 7 0 1999 1.2s Solving report Status Optimal Primal bound 1.42253157607 Dual bound 1.42238941537 Gap 0.00999% (tolerance: 0.01%) P-D integral 0.000433139866354 Solution status feasible 1.42253157607 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 1.23 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1999 (total) 0 (strong br.) 36 (separation) 262 (heuristics) [warn | InfrastructureModels]: Matlab parser skipping the following line: ]; Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 13098 rows; 31032 cols; 40773 nonzeros; 1080 integer variables (1080 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 432 5 950.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 13098 rows; 31032 cols; 40773 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model 1632 rows, 3240 cols, 4488 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.04 Presolving model 4218 rows, 4728 cols, 13893 nonzeros 0s 3583 rows, 2788 cols, 12683 nonzeros 0s 3274 rows, 2536 cols, 11744 nonzeros 0s Solving MIP model with: 3274 rows 2536 cols (1047 binary, 0 integer, 0 implied int., 1489 continuous) 11744 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0009 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0009 136.4116433 100.00% 0 0 0 1052 0.3s 1 0 1 100.00% 136.4116433 136.4116433 0.00% 0 0 0 1052 0.3s Solving report Status Optimal Primal bound 136.411643313 Dual bound 136.411643313 Gap 0% (tolerance: 0.01%) P-D integral 0.000141858118625 Solution status feasible 136.411643313 (objective) 0 (bound viol.) 8.21565038223e-15 (int. viol.) 0 (row viol.) Timing 0.26 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1052 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 26778 rows; 31032 cols; 80733 nonzeros; 1080 integer variables (1080 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 5040 5 7009 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 26778 rows; 31032 cols; 80733 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.07 Presolving model 15378 rows, 15240 cols, 53853 nonzeros 0s 11647 rows, 11716 cols, 44193 nonzeros 0s 6775 rows, 5388 cols, 31116 nonzeros 0s 5690 rows, 4159 cols, 29872 nonzeros 0s 5687 rows, 4159 cols, 29854 nonzeros 0s Solving MIP model with: 5687 rows 4159 cols (1044 binary, 0 integer, 0 implied int., 3115 continuous) 29854 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0009 inf inf 0 0 0 0 0.5s R 0 0 0 0.00% 1.435621297 1.873680274 23.38% 0 0 0 2997 1.1s C 0 0 0 0.00% 1.446847093 1.59507983 9.29% 1266 125 0 3286 2.1s 0 0 0 0.00% 1.462173184 1.59507983 8.33% 5577 222 0 4723 7.2s L 0 0 0 0.00% 1.462173184 1.50031353 2.54% 5577 222 0 4723 17.6s 8.5% inactive integer columns, restarting Model after restart has 5355 rows, 3822 cols (918 bin., 0 int., 0 impl., 2904 cont.), and 28731 nonzeros 0 0 0 0.00% 1.462173708 1.50031353 2.54% 128 0 0 16755 17.9s 0 0 0 0.00% 1.462173708 1.50031353 2.54% 128 40 0 18582 18.2s 1 0 1 100.00% 1.50031353 1.50031353 0.00% 1110 119 44 22154 21.0s Solving report Status Optimal Primal bound 1.50031352982 Dual bound 1.50031352982 Gap 0% (tolerance: 0.01%) P-D integral 1.62039745405 Solution status feasible 1.50031352982 (objective) 0 (bound viol.) 1.06581410364e-14 (int. viol.) 0 (row viol.) Timing 21.05 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 7 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 22154 (total) 2277 (strong br.) 2397 (separation) 12018 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 13098 rows; 31032 cols; 40773 nonzeros; 360 integer variables (360 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 432 5 950.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 13098 rows; 31032 cols; 40773 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model 1584 rows, 3216 cols, 4392 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.04 Presolving model 4218 rows, 4728 cols, 13893 nonzeros 0s 3583 rows, 2788 cols, 12683 nonzeros 0s 3227 rows, 2492 cols, 11607 nonzeros 0s Solving MIP model with: 3227 rows 2492 cols (360 binary, 0 integer, 6 implied int., 2126 continuous) 11607 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0009 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0009 136.4116433 100.00% 0 0 0 1052 0.2s 1 0 1 100.00% 136.4116433 136.4116433 0.00% 0 0 0 1052 0.2s Solving report Status Optimal Primal bound 136.411643313 Dual bound 136.411643313 Gap 0% (tolerance: 0.01%) P-D integral 0.00360367304709 Solution status feasible 136.411643313 (objective) 0 (bound viol.) 5.77315972805e-15 (int. viol.) 0 (row viol.) Timing 0.22 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1052 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 26778 rows; 31032 cols; 80733 nonzeros; 360 integer variables (360 binary) Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 5040 5 7009 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 26778 rows; 31032 cols; 80733 nonzeros Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.06 Presolving model 15378 rows, 15240 cols, 53853 nonzeros 0s 11647 rows, 11716 cols, 44193 nonzeros 0s 6775 rows, 5388 cols, 31116 nonzeros 0s 5690 rows, 4159 cols, 29872 nonzeros 0s 5687 rows, 4159 cols, 29854 nonzeros 0s Solving MIP model with: 5687 rows 4159 cols (360 binary, 0 integer, 6 implied int., 3793 continuous) 29854 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0009 inf inf 0 0 0 0 0.3s R 0 0 0 0.00% 1.435621297 2.229088816 35.60% 0 0 0 2997 0.9s C 0 0 0 0.00% 1.447169511 1.59507983 9.27% 942 126 0 3305 1.7s L 0 0 0 0.00% 1.462803378 1.50031353 2.50% 2808 264 0 5116 10.2s 0 0 0 0.00% 1.462803378 1.50031353 2.50% 2598 153 0 24619 21.6s 1 0 0 100.00% 1.500167904 1.50031353 0.01% 2297 153 79 26306 22.2s Solving report Status Optimal Primal bound 1.50031352982 Dual bound 1.50016790376 Gap 0.00971% (tolerance: 0.01%) P-D integral 1.31187310103 Solution status feasible 1.50031352982 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 22.25 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 6 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 26306 (total) 1036 (strong br.) 2121 (separation) 19501 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 278 rows; 641 cols; 828 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e-06, 1e+00] Bound [1e+00, 1e+06] RHS [3e-03, 4e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3 from [lower, value, upper] = [ 0; 3; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 11 4 24.01 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 278 rows; 641 cols; 828 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e-06, 1e+00] Bound [1e+00, 1e+06] RHS [3e-03, 4e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 148 rows, 130 cols, 410 nonzeros 0s 50 rows, 74 cols, 201 nonzeros 0s 43 rows, 41 cols, 180 nonzeros 0s 40 rows, 38 cols, 172 nonzeros 0s Solving MIP model with: 40 rows 38 cols (10 binary, 0 integer, 0 implied int., 28 continuous) 172 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s S 0 0 0 0.00% 0 0.2958207129 100.00% 0 0 0 0 0.0s R 0 0 0 0.00% 0.1533869228 0.2931109878 47.67% 0 0 0 28 0.0s S 0 0 0 0.00% 0.1533869228 0.2927046208 47.60% 11 1 0 28 0.0s S 0 0 0 0.00% 0.2117175275 0.2125861645 0.41% 42 5 0 42 0.0s C 0 0 0 0.00% 0.2121858156 0.2125223424 0.16% 42 5 0 44 0.0s 1 0 1 100.00% 0.2125223424 0.2125223424 0.00% 44 6 0 49 0.0s Solving report Status Optimal Primal bound 0.212522342447 Dual bound 0.212522342447 Gap 0% (tolerance: 0.01%) P-D integral 0.00367621356398 Solution status feasible 0.212522342447 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 49 (total) 0 (strong br.) 17 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 517 rows; 641 cols; 1516 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [5e-02, 2e+02] Cost [2e-06, 1e+00] Bound [1e+00, 1e+06] RHS [3e-03, 4e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3 from [lower, value, upper] = [ 0; 3; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 82 4 80.1 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 517 rows; 641 cols; 1516 nonzeros Coefficient ranges: Matrix [5e-02, 2e+02] Cost [2e-06, 1e+00] Bound [1e+00, 1e+06] RHS [3e-03, 4e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 316 rows, 277 cols, 1028 nonzeros 0s 218 rows, 191 cols, 839 nonzeros 0s 185 rows, 160 cols, 766 nonzeros 0s 130 rows, 79 cols, 602 nonzeros 0s 130 rows, 79 cols, 602 nonzeros 0s Solving MIP model with: 130 rows 79 cols (10 binary, 0 integer, 0 implied int., 69 continuous) 602 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s S 0 0 0 0.00% 0 0.130823071 100.00% 0 0 0 0 0.0s S 0 0 0 0.00% 0.1186733998 0.1308194454 9.28% 0 0 0 64 0.0s R 0 0 0 0.00% 0.1300902786 0.1308176161 0.56% 0 0 0 66 0.0s 70.0% inactive integer columns, restarting Model after restart has 72 rows, 58 cols (1 bin., 0 int., 0 impl., 57 cont.), and 251 nonzeros 0 0 0 0.00% 0.1300902786 0.1308176161 0.56% 0 0 0 66 0.0s 1 0 1 100.00% 0.1308176161 0.1308176161 0.00% 0 0 0 72 0.0s Solving report Status Optimal Primal bound 0.130817616142 Dual bound 0.130817616142 Gap 0% (tolerance: 0.01%) P-D integral 0.000159698420591 Solution status feasible 0.130817616142 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 72 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Test Summary: | Pass Fail Total Time CbaOPF | 30 4 34 4m43.0s Nodal CBA OPF | 1 3 4 5.5s Redispatch OPF | 1 1 5.6s Inertia redispatch OPF | 3 3 1.7s Nodal AC - CBA OPF | 4 4 0.0s Nodal SOC - CBA OPF | 4 4 0.0s Nodal LPACC - CBA OPF | 4 4 0.0s 2 Grids HVDC | 4 4 23.6s 2 Grids ACDC | 4 4 6.7s 3 Grids HVDC | 4 4 51.9s 2 Grids HVDC | 2 2 0.5s RNG of the outermost testset: Random.Xoshiro(0x21f3330ad52e485a, 0xfe31ce4920b9b2a4, 0x893d76a026b7e0c2, 0x83f50ce9315b49fc, 0x666f49675271c9f4) ERROR: LoadError: Some tests did not pass: 30 passed, 4 failed, 0 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/CbaOPF/9FbJ5/test/runtests.jl:20 Testing failed after 332.59s ERROR: LoadError: Package CbaOPF errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2418 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2273 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:498 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:151 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:309 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:331 [12] _start() @ Base ./client.jl:564 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 556.81s: package has test failures