Package evaluation of HiGHS on Julia 1.10.9 (96dc2d8c45*) started at 2025-06-06T15:50:14.807 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 4.86s ################################################################################ # Installation # Installing HiGHS... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [87dc4568] + HiGHS v1.18.0 Updating `~/.julia/environments/v1.10/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.4 [f6369f11] + ForwardDiff v1.0.1 [87dc4568] + HiGHS v1.18.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.40.2 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [276daf66] + SpecialFunctions v2.5.1 [1e83bf80] + StaticArraysCore v1.4.3 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [8fd58aa0] + HiGHS_jll v1.11.0+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [b77e0a4c] + InteractiveUtils [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [de0858da] + Printf [9abbd945] + Profile [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [4536629a] + OpenBLAS_jll v0.3.23+4 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.38s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 9.5s ################################################################################ # Testing # Testing HiGHS Status `/tmp/jl_wVJZ8B/Project.toml` [87dc4568] HiGHS v1.18.0 [b8f27783] MathOptInterface v1.40.2 ⌅ [aea7be01] PrecompileTools v1.2.1 [8fd58aa0] HiGHS_jll v1.11.0+0 [2f01184e] SparseArrays v1.10.0 [8dfed614] Test Status `/tmp/jl_wVJZ8B/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.4 [f6369f11] ForwardDiff v1.0.1 [87dc4568] HiGHS v1.18.0 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.40.2 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [276daf66] SpecialFunctions v2.5.1 [1e83bf80] StaticArraysCore v1.4.3 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [b77e0a4c] InteractiveUtils [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [de0858da] Printf [9abbd945] Profile [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [4536629a] OpenBLAS_jll v0.3.23+4 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Test Summary: | Pass Total Time C_wrapper.jl | 5 5 6.5s Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1 rows; 30 cols; 30 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [1e-01, 1e+00] Cost [2e-02, 1e+00] Bound [1e+00, 1e+00] RHS [1e+01, 1e+01] Presolve is switched off Solving MIP model with: 1 rows 30 cols (30 binary, 0 integer, 0 implied int., 0 continuous, 0 domain fixed) 30 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% inf 0.9949310311 Large 0 0 0 0 0.0s S 0 0 0 0.00% 16.755064 14.29233629 17.23% 0 0 0 0 0.0s 0 0 0 0.00% 14.41684008 14.29233629 0.87% 0 0 0 1 0.0s 1 0 1 100.00% 14.29233629 14.29233629 0.00% 2 1 0 3 0.0s Solving report Status Optimal Primal bound 14.2923362923 Dual bound 14.2923362923 Gap 0% (tolerance: 0.01%) P-D integral 0.0108300212436 Solution status feasible 14.2923362923 (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 3 (total) 0 (strong br.) 2 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1 rows; 30 cols; 30 nonzeros; 30 integer variables (30 binary) Coefficient ranges: Matrix [1e-01, 1e+00] Cost [2e-02, 1e+00] Bound [1e+00, 1e+00] RHS [1e+01, 1e+01] Presolve is switched off Solving MIP model with: 1 rows 30 cols (30 binary, 0 integer, 0 implied int., 0 continuous, 0 domain fixed) 30 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round; I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time J 0 0 0 0.00% inf 0.9949310311 Large 0 0 0 0 0.0s S 0 0 0 0.00% 16.755064 14.29233629 17.23% 0 0 0 0 0.0s 0 0 0 0.00% 14.41684008 14.29233629 0.87% 0 0 0 1 0.0s 1 0 1 100.00% 14.29233629 14.29233629 0.00% 2 1 0 3 0.0s Solving report Status Optimal Primal bound 14.2923362923 Dual bound 14.2923362923 Gap 0% (tolerance: 0.01%) P-D integral 0.00958992474387 Solution status feasible 14.2923362923 (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 3 (total) 0 (strong br.) 2 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 rows; 30 cols; 30 nonzeros Coefficient ranges: Matrix [1e-01, 1e+00] Cost [2e-02, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.6755064005e+04 Ph1: 1(15798.4); Du: 30(16.7551) 0s 1 -8.6933954287e+03 Ph1: 0(0); Du: 29(8.6934) 0s 1 9.1184115098e+00 Pr: 0(0); Du: 29(8.6934) 0s WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 29 / 0.728 (relative 29 / 0.376) dual infeasibilities (tolerance = 1e-07) 1 / 0.109 P-D objective error (tolerance = 1e-07) Model status : Unbounded Simplex iterations: 1 Objective value : 9.1184115098e+00 P-D objective error : 1.0883973092e-01 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 rows; 30 cols; 30 nonzeros Coefficient ranges: Matrix [5e-02, 1e+00] Cost [5e-03, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Not presolved: solving the LP IPX model has 1 rows, 30 columns and 30 nonzeros Input Number of variables: 30 Number of free variables: 30 Number of constraints: 1 Number of equality constraints: 0 Number of matrix entries: 30 Matrix range: [5e-02, 1e+00] RHS range: [1e+01, 1e+01] Objective range: [5e-03, 1e+00] Bounds range: [0e+00, 0e+00] Preprocessing Dualized model: no Number of dense columns: 0 Range of scaling factors: [1.00e+00, 1.60e+01] Scaled cost norm: 14.1904 Scaled bounds norm: 10 IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time 0 1.71e+00 1.27e+01 -1.96479913e+01 -1.96479913e+01 9.21e+00 0s 1 1.71e-06 1.26e+01 -1.45200922e+02 -2.08277216e+01 1.20e+00 0s 2 1.71e-12 1.27e+01 -3.34339774e+02 -2.04033702e+01 9.20e-04 0s 3 2.13e-12 1.26e+01 -2.44952729e+05 -2.08103424e+01 3.74e-07 0s 4 5.66e-21 1.26e+01 -5.99582407e+08 -2.08103431e+01 2.08e-30 0s Constructing starting basis... Summary Runtime: 0.00s Status interior point solve: dual infeas Status crossover: not run WARNING: Ipx: IPM dual infeasible WARNING: Ipx: Crossover not run WARNING: Unwelcome IPX status of Primal infeasible or unbounded: basis is not valid; solution is valid; run_crossover is "on" WARNING: IPX solution is imprecise, so clean up with simplex Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -4.8024246238e+04 Ph1: 1(27807.6); Du: 30(48.0242) 0s 1 -3.6998470056e+04 Ph1: 0(0); Du: 29(36.9985) 0s 1 4.2533910041e+00 Pr: 0(0); Du: 29(36.9985) 0s Using EKK primal simplex solver Iteration Objective Infeasibilities num(sum) 1 4.2533919952e+00 Pr: 0(0); Du: 29(9.68293) 0s 1 4.2533910041e+00 Pr: 0(0); Du: 29(9.68293) 0s WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 29 / 0.88 (relative 29 / 0.459) dual infeasibilities (tolerance = 1e-07) 1 / 0.476 P-D objective error (tolerance = 1e-07) Model status : Unbounded Simplex iterations: 1 IPM iterations: 4 Objective value : 4.2533910041e+00 P-D objective error : 4.7616878962e-01 HiGHS run time : 0.00 Solving linear system to compute primal ray Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 3 rows; 3 cols; 3 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Not presolved: solving the LP IPX model has 3 rows, 3 columns and 3 nonzeros Input Number of variables: 3 Number of free variables: 3 Number of constraints: 3 Number of equality constraints: 3 Number of matrix entries: 3 Matrix range: [1e+00, 1e+00] RHS range: [1e+00, 3e+00] Objective range: [1e+00, 1e+00] Bounds range: [0e+00, 0e+00] Preprocessing Dualized model: no Number of dense columns: 0 Range of scaling factors: [1.00e+00, 1.00e+00] Scaled cost norm: 1 Scaled bounds norm: 3 IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time Summary Runtime: 0.01s Status interior point solve: unknown Status crossover: not run WARNING: Ipx: Stopped WARNING: Ipx: IPM user interrupt WARNING: Ipx: Crossover not run WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 0 / 0 (relative 0 / 0) dual infeasibilities (tolerance = 1e-07) num/max 3 / 3 (relative 3 / 0.75) primal residual errors (tolerance = 1e-07) num/max 3 / 1 (relative 3 / 0.5) dual residual errors (tolerance = 1e-07) 0 / 0 P-D objective error (tolerance = 1e-07) Model status : Interrupted by user Objective value : 0.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.01 Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 3 rows; 3 cols; 3 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Not presolved: solving the LP IPX model has 3 rows, 3 columns and 3 nonzeros Input Number of variables: 3 Number of free variables: 3 Number of constraints: 3 Number of equality constraints: 3 Number of matrix entries: 3 Matrix range: [1e+00, 1e+00] RHS range: [1e+00, 3e+00] Objective range: [1e+00, 1e+00] Bounds range: [0e+00, 0e+00] Preprocessing Dualized model: no Number of dense columns: 0 Range of scaling factors: [1.00e+00, 1.00e+00] Scaled cost norm: 1 Scaled bounds norm: 3 IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 3 rows; 3 cols; 3 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Not presolved: solving the LP IPX model has 3 rows, 3 columns and 3 nonzeros Input Number of variables: 3 Number of free variables: 3 Number of constraints: 3 Number of equality constraints: 3 Number of matrix entries: 3 Matrix range: [1e+00, 1e+00] RHS range: [1e+00, 3e+00] Objective range: [1e+00, 1e+00] Bounds range: [0e+00, 0e+00] Preprocessing Dualized model: no Number of dense columns: 0 Range of scaling factors: [1.00e+00, 1.00e+00] Scaled cost norm: 1 Scaled bounds norm: 3 IPX version 1.0 Interior point solve Iter P.res D.res P.obj D.obj mu Time Summary Runtime: 0.01s Status interior point solve: unknown Status crossover: not run WARNING: Ipx: Stopped WARNING: Ipx: IPM user interrupt WARNING: Ipx: Crossover not run WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 0 / 0 (relative 0 / 0) dual infeasibilities (tolerance = 1e-07) num/max 3 / 3 (relative 3 / 0.75) primal residual errors (tolerance = 1e-07) num/max 3 / 1 (relative 3 / 0.5) dual residual errors (tolerance = 1e-07) 0 / 0 P-D objective error (tolerance = 1e-07) Model status : Interrupted by user Objective value : 0.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.01 Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 4 rows; 4 cols; 8 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [5e-01, 2e+00] RHS [1e+00, 4e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-4); columns 0(-4); elements 0(-8) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 6.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Model has either no columns or no rows, so ignoring user constraint matrix data and initialising empty matrix Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms ERROR: Set supplied to Highs::deleteRows not ordered Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms QP has 1 rows; 2 cols; 2 matrix nonzeros; 3 Hessian nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Iteration Objective NullspaceDim 0 1.0000001 1 0.00s 1 -0.12499997 1 0.00s Model status : Optimal QP ASM iterations: 1 Objective value : -1.2500000000e-01 P-D objective error : 5.0000002018e-08 HiGHS run time : 0.00 Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 0 rows; 1 cols; 0 nonzeros Coefficient ranges: Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] Solving LP without presolve, or with basis, or unconstrained Solving an unconstrained LP with 1 columns WARNING: LP solution KKT conditions num/max 0 / 0 (relative 0 / 0) primal infeasibilities (tolerance = 1e-07) num/max 1 / 1 (relative 1 / 0.5) dual infeasibilities (tolerance = 1e-07) 1 / 0.5 P-D objective error (tolerance = 1e-07) Model status : Unbounded Objective value : 0.0000000000e+00 P-D objective error : 5.0000000000e-01 HiGHS run time : 0.00 WARNING: checkOptionValue: Value -1 for option "time_limit" is below lower bound of 0 Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Writing the model to /tmp/jl_RCKTUS/test.mps.gz WARNING: There are empty or excessively-long column names: using constructed names with prefix "c" Model has 1 zero columns with no costs: 1 have finite upper bounds or nonzero lower bounds and are written in MPS file Running HiGHS 1.10.0 (git hash: 6eca8325a): Copyright (c) 2025 HiGHS under MIT licence terms Writing the model to /tmp/jl_5cSbOy/model.mps Writing the model to /tmp/jl_5cSbOy/model.lp Test Summary: | Pass Total Time MOI_wrapper.jl | 6617 6617 35m34.2s Test Summary: |Time runtests.jl | None 0.0s Testing HiGHS tests passed Testing completed after 2143.49s PkgEval succeeded after 2178.0s