Package evaluation to test ParametricOptInterface on Julia 1.12.4 (0f21d93eaa*) started at 2026-01-26T22:19:38.615 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.12` Set-up completed after 7.92s ################################################################################ # Installation # Installing ParametricOptInterface... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [0ce4ce61] + ParametricOptInterface v0.14.1 Updating `~/.julia/environments/v1.12/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.3 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.3.1 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.48.0 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [0ce4ce61] + ParametricOptInterface v0.14.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [276daf66] + SpecialFunctions v2.6.1 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.2 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [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 [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.7+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 5.3s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 1892.9 ms ✓ SCS_jll 1227.2 ms ✓ SCS_GPU_jll 1238.4 ms ✓ SCS_MKL_jll 7092.1 ms ✓ ParametricOptInterface 6205.5 ms ✓ SCS 5 dependencies successfully precompiled in 20 seconds. 86 already precompiled. Precompilation completed after 37.22s ################################################################################ # Testing # Testing ParametricOptInterface Status `/tmp/jl_6EJoYS/Project.toml` [87dc4568] HiGHS v1.20.1 [b6b21f68] Ipopt v1.14.0 [4076af6c] JuMP v1.29.4 [0ce4ce61] ParametricOptInterface v0.14.1 ⌅ [c946c3f1] SCS v1.3.1 [37e2e46d] LinearAlgebra v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_6EJoYS/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.3 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.3.1 [87dc4568] HiGHS v1.20.1 [b6b21f68] Ipopt v1.14.0 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.4 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.48.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [0ce4ce61] ParametricOptInterface v0.14.1 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [ae029012] Requires v1.3.1 ⌅ [c946c3f1] SCS v1.3.1 [276daf66] SpecialFunctions v2.6.1 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.2 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [1d5cc7b8] IntelOpenMP_jll v2023.2.0+0 [9cc047cb] Ipopt_jll v300.1400.1901+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [856f044c] MKL_jll v2022.2.0+0 [d7ed1dd3] MUMPS_seq_jll v500.800.200+0 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [af6e375f] SCS_GPU_jll v3.2.3+1 ⌅ [3f2553a9] SCS_MKL_jll v3.2.3+1 ⌅ [f4f2fc5b] SCS_jll v3.2.3+0 [319450e9] SPRAL_jll v2025.9.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [4af54fe1] LazyArtifacts v1.11.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.12.1 [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 [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.15.0+0 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.11.4 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 6880.3 ms ✓ MathOptIIS 35722.0 ms ✓ HiGHS 2 dependencies successfully precompiled in 43 seconds. 55 already precompiled. Precompiling packages... 1336.6 ms ✓ Ipopt 1 dependency successfully precompiled in 1 seconds. 39 already precompiled. Precompiling packages... 53125.8 ms ✓ Ipopt → IpoptMathOptInterfaceExt 1 dependency successfully precompiled in 54 seconds. 77 already precompiled. MOI.ListOfConstraintAttributesSet is not supported for VectorQuadraticFunction in ParametricOptInterface, an empty list will be returned. This message can be suppressed by setting `POI._WarnIfQuadraticOfAffineFunctionAmbiguous` to false. Test Summary: | Pass Total Time test_ListOfConstraintAttributesSet | 2 2 19.8s Test Summary: | Pass Total Time test_abstract_optimizer_attributes | 2 2 8.1s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 0 rows; 1 col; 0 nonzeros Solving unconstrained LP Solving an unconstrained LP with 1 columns Model status : Optimal Objective value : 1.5000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_affine_parametric_objective | 3 3 34.0s Test Summary: | Pass Total Time test_basic_special_cases_of_getters | 2 2 9.3s Test Summary: | Pass Total Time test_basic_tests | 30 30 8.3s Test Summary: | Pass Total Time test_compute_conflict! | 18 18 23.1s Test Summary: | Pass Total Time test_constrained_variable_HiGHS | 9 9 1.3s Test Summary: | Pass Total Time test_constrained_variable_no_free | 7 7 0.9s Test Summary: | Pass Total Time test_constrained_variables | 6 6 3.3s Test Summary: | Pass Total Time test_constraint_attribute_error | 1 1 2.3s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [0e+00, 0e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 0.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_copy_model | 1 1 3.1s Test Summary: | Pass Total Time test_duals_not_available | 1 1 0.6s Test Summary: | Pass Total Time test_duals_without_parameters | 3 3 1.2s Test Summary: | Pass Total Time test_error_modify_quadratic_objective | 2 2 1.5s Test Summary: | Pass Total Time test_get_constraint_function_vector | 1 1 9.6s Test Summary: | Pass Total Time test_get_constraint_set | 1 1 0.6s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [3e+00, 3e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 1.3333333333e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_get_duals_from_multiplicative_parameters_1 | 3 3 8.5s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [3e+00, 3e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [8e+01, 8e+01] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 2.6666666667e+01 P-D objective error : 6.5387368321e-17 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_get_duals_from_multiplicative_parameters_2 | 3 3 0.3s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [3e+00, 3e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [2e+01, 2e+01] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 5.3333333333e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_get_duals_from_multiplicative_parameters_3 | 2 2 0.5s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [2e+00, 2e+00] Cost [0e+00, 0e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 0.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_get_quadratic_constraint | 1 1 3.5s Test Summary: | Pass Total Time test_getters | 26 26 6.0s Test Summary: | Pass Total Time test_issue_185 | 2 2 5.0s Test Summary: | Pass Total Time test_issue_185_vector | 2 2 2.4s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 2 rows; 2 cols; 4 nonzeros Coefficient ranges: Matrix [1e+00, 2e+00] Cost [3e+00, 4e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Presolving model 2 rows, 2 cols, 4 nonzeros 0s 2 rows, 2 cols, 4 nonzeros 0s Presolve reductions: rows 2(-0); columns 2(-0); nonzeros 4(-0) - Not reduced Problem not reduced by presolve: solving the LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.9999930107e+00 Ph1: 2(6); Du: 2(6.99999) 0s 2 9.3333333333e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 9.3333333333e+00 P-D objective error : 9.0323229122e-17 HiGHS run time : 0.00 LP has 2 rows; 2 cols; 4 nonzeros Coefficient ranges: Matrix [1e+00, 2e+00] Cost [3e+00, 4e+00] Bound [0e+00, 0e+00] RHS [2e+00, 4e+00] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : 6.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_affine_parameters | 6 6 2.7s Test Summary: | Pass Total Time test_jump_constraintfunction_getter | 6 6 7.8s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 2 rows; 2 cols; 4 nonzeros Coefficient ranges: Matrix [1e+00, 2e+00] Cost [3e+00, 4e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Presolving model 2 rows, 2 cols, 4 nonzeros 0s 2 rows, 2 cols, 4 nonzeros 0s Presolve reductions: rows 2(-0); columns 2(-0); nonzeros 4(-0) - Not reduced Problem not reduced by presolve: solving the LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.9999930107e+00 Ph1: 2(6); Du: 2(6.99999) 0s 2 9.3333333333e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 9.3333333333e+00 P-D objective error : 9.0323229122e-17 HiGHS run time : 0.00 LP has 2 rows; 2 cols; 4 nonzeros Coefficient ranges: Matrix [1e+00, 2e+00] Cost [3e+00, 4e+00] Bound [0e+00, 0e+00] RHS [2e+00, 4e+00] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : 6.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_direct_affine_parameters | 6 6 1.0s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Test Summary: | Pass Total Time test_jump_direct_get_parameter_value | 1 1 0.3s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 0 rows; 2 cols; 0 nonzeros Solving unconstrained LP Solving an unconstrained LP with 2 columns Model status : Optimal Objective value : -2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 0 rows; 2 cols; 0 nonzeros Solving unconstrained LP Solving an unconstrained LP with 2 columns Model status : Optimal Objective value : 3.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_direct_interpret_parameteric_bounds | 6 6 2.6s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 2 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [2e+00, 2e+00] Cost [1e+00, 1e+00] Bound [1e+00, 1e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-2); columns 0(-2); nonzeros 0(-2) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 2 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [2e+00, 2e+00] Cost [1e+00, 1e+00] Bound [1e+00, 4e+00] RHS [1e+00, 4e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 1.5000013589e+00 Pr: 1(2) 0s 1 3.5000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 1 Objective value : 3.5000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_direct_interpret_parameteric_bounds_both | 2 2 0.9s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 2 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [2e+00, 2e+00] Cost [1e+00, 1e+00] Bound [1e+00, 1e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-2); columns 0(-2); nonzeros 0(-2) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 2 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [2e+00, 2e+00] Cost [1e+00, 1e+00] Bound [1e+00, 4e+00] RHS [1e+00, 4e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 1.5000013589e+00 Pr: 1(2) 0s 1 3.5000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 1 Objective value : 3.5000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_direct_interpret_parameteric_bounds_change | 3 3 0.8s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms Test Summary: | Pass Total Time test_jump_direct_interpret_parameteric_bounds_invalid | 1 1 0.6s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 2 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-2); columns 0(-2); nonzeros 0(-2) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 2 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 4e+00] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : 3.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_direct_interpret_parameteric_bounds_no_interpretation | 6 6 0.7s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 2 rows; 2 cols; 4 nonzeros Coefficient ranges: Matrix [1e+00, 2e+00] Cost [3e+00, 4e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Presolving model 2 rows, 2 cols, 4 nonzeros 0s 2 rows, 2 cols, 4 nonzeros 0s Presolve reductions: rows 2(-0); columns 2(-0); nonzeros 4(-0) - Not reduced Problem not reduced by presolve: solving the LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.9999930107e+00 Ph1: 2(6); Du: 2(6.99999) 0s 2 9.3333333333e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 9.3333333333e+00 P-D objective error : 9.0323229122e-17 HiGHS run time : 0.00 LP has 2 rows; 2 cols; 4 nonzeros Coefficient ranges: Matrix [1e+00, 3e+00] Cost [3e+00, 4e+00] Bound [0e+00, 0e+00] RHS [2e+00, 4e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000927e+00 Ph1: 2(4); Du: 1(1) 0s 1 6.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 1 Objective value : 6.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_direct_parameter_times_variable | 6 6 0.6s ****************************************************************************** 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 ****************************************************************************** Test Summary: | Pass Total Time test_jump_direct_qp_objective | 19 19 13.7s Test Summary: | Pass Total Time test_jump_direct_rsoc_constraints | 7 7 49.4s Test Summary: | Pass Total Time test_jump_direct_soc_parameters | 6 6 4.3s Test Summary: | Pass Total Time test_jump_direct_vector_parameter_affine_nonnegatives | 4 4 1.7s Test Summary: | Pass Total Time test_jump_direct_vector_parameter_affine_nonpositives | 4 4 3.2s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 2 rows; 1 col; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 2e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+00 Pr: 1(1) 0s 1 -2.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 1 Objective value : -2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_add_after_solve | 7 7 0.7s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_add_ctr_alaternative | 3 3 0.3s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 6 cols; 1 nonzero Coefficient ranges: Matrix [3e+00, 3e+00] Cost [5e+00, 5e+00] Bound [0e+00, 0e+00] RHS [3e+01, 3e+01] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-6); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -4.3333333333e+01 P-D objective error : 8.1050502178e-17 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_basic | 4 4 3.5s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 2 rows; 1 col; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [5e-01, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-2); columns 0(-1); nonzeros 0(-2) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [5e-01, 5e-01] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : -5.0000000000e-01 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_delete_constraint | 7 7 1.3s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 9 rows; 1 col; 9 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 9e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-9); columns 0(-1); nonzeros 0(-9) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 9.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 8 rows; 1 col; 8 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 8e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 8(8000); Du: 1(1) 0s 2 8.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 8.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 7 rows; 1 col; 7 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 7e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 7(7000); Du: 1(1) 0s 1 7.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 1 Objective value : 7.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 6 rows; 1 col; 6 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 6e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 6(6000); Du: 1(1) 0s 2 6.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 6.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 5 rows; 1 col; 5 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 5e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 5(5000); Du: 1(1) 0s 2 5.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 5.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 4 rows; 1 col; 4 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 4e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 4(4000); Du: 1(1) 0s 2 4.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 4.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 3 rows; 1 col; 3 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 3e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 3(3000); Du: 1(1) 0s 2 3.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 3.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 2 rows; 1 col; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 2e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 2(2000); Du: 1(1) 0s 2 2.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_delete_constraint_2 | 60 60 2.4s Test Summary: | Pass Total Time test_jump_dual_delete_constraint_3 | 60 60 2.3s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [5e+00, 5e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_mixing_params_and_vars_1 | 3 3 1.8s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [5e+00, 5e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+01, 1e+01] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_mixing_params_and_vars_2 | 3 3 0.7s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [5e+00, 5e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [2e+01, 2e+01] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 4.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_mixing_params_and_vars_3 | 3 3 0.8s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 8 rows; 6 cols; 12 nonzeros Coefficient ranges: Matrix [3e+00, 3e+00] Cost [5e+00, 5e+00] Bound [0e+00, 0e+00] RHS [3e+01, 1e+02] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-8); columns 0(-6); nonzeros 0(-12) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -4.3333333333e+01 P-D objective error : 8.1050502178e-17 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_multiple_parameters_1 | 6 6 2.0s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [2e+01, 2e+01] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 2.0000000000e+01 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_multiple_parameters_2 | 3 3 0.8s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [3e+00, 3e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve 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 Test Summary: | Pass Total Time test_jump_dual_multiplicative_fail | 1 1 0.4s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [3e+00, 3e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -5.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_objective_max | 1 1 0.4s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [3e+00, 3e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 7.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_dual_objective_min | 1 1 0.4s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : 2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_duals_EqualTo | 6 6 0.5s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : 2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_duals_GreaterThan | 6 6 0.6s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-1); nonzeros 0(-1) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : -1.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 row; 1 col; 1 nonzero Coefficient ranges: Matrix [1e+00, 1e+00] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : 2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_duals_LessThan | 6 6 0.5s MOI.ListOfConstraintAttributesSet is not supported for ScalarQuadraticFunction in ParametricOptInterface, an empty list will be returned. This message can be suppressed by setting `POI._WarnIfQuadraticOfAffineFunctionAmbiguous` to false. Test Summary: | Pass Total Time test_jump_errors | 5 5 0.5s Test Summary: | Pass Total Time test_jump_get_parameter_value | 1 1 0.2s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 0 rows; 2 cols; 0 nonzeros Solving unconstrained LP Solving an unconstrained LP with 2 columns Model status : Optimal Objective value : -2.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 0 rows; 2 cols; 0 nonzeros Solving unconstrained LP Solving an unconstrained LP with 2 columns Model status : Optimal Objective value : 3.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_interpret_parameteric_bounds | 6 6 1.2s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 0 rows; 2 cols; 0 nonzeros Solving unconstrained LP Solving an unconstrained LP with 2 columns Model status : Optimal Objective value : -4.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 0 rows; 2 cols; 0 nonzeros Solving unconstrained LP Solving an unconstrained LP with 2 columns Model status : Optimal Objective value : 1.1000000000e+01 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_interpret_parameteric_bounds_expression | 6 6 0.9s Test Summary: | Pass Total Time test_jump_nlp | 1 1 9.4s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 2 rows; 2 cols; 4 nonzeros Coefficient ranges: Matrix [1e+00, 2e+00] Cost [3e+00, 4e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Presolving model 2 rows, 2 cols, 4 nonzeros 0s 2 rows, 2 cols, 4 nonzeros 0s Presolve reductions: rows 2(-0); columns 2(-0); nonzeros 4(-0) - Not reduced Problem not reduced by presolve: solving the LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.9999930107e+00 Ph1: 2(6); Du: 2(6.99999) 0s 2 9.3333333333e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 2 Objective value : 9.3333333333e+00 P-D objective error : 9.0323229122e-17 HiGHS run time : 0.00 LP has 2 rows; 2 cols; 4 nonzeros Coefficient ranges: Matrix [1e+00, 3e+00] Cost [3e+00, 4e+00] Bound [0e+00, 0e+00] RHS [2e+00, 4e+00] Solving LP with useful basis so presolve not used Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0000000927e+00 Ph1: 2(4); Du: 1(1) 0s 1 6.0000000000e+00 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 1 Objective value : 6.0000000000e+00 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_parameter_times_variable | 7 7 0.8s ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.41e+00 1.41e-06 1.41e-06 7.07e-07 1.00e-01 2.51e-04 25| 4.18e-08 3.11e-12 3.11e-12 -1.55e-12 1.00e-01 2.98e-04 ------------------------------------------------------------------ status: solved timings: total: 2.99e-04s = setup: 1.40e-04s + solve: 1.60e-04s lin-sys: 7.92e-06s, cones: 1.11e-04s, accel: 2.09e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 4.24e+00 4.24e-06 1.27e-05 6.36e-06 1.00e-01 1.17e-04 25| 1.25e-07 9.33e-12 2.80e-11 -1.40e-11 1.00e-01 1.64e-04 ------------------------------------------------------------------ status: solved timings: total: 1.66e-04s = setup: 7.45e-05s + solve: 9.12e-05s lin-sys: 7.44e-06s, cones: 4.59e-05s, accel: 2.60e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_p | 3 3 14.6s ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 3.51e+00 7.81e-01 5.06e-01 3.90e-01 1.00e-01 1.16e-04 25| 7.91e-06 1.96e-07 4.61e-06 6.34e-01 1.00e-01 1.71e-04 ------------------------------------------------------------------ status: solved timings: total: 1.72e-04s = setup: 7.43e-05s + solve: 9.78e-05s lin-sys: 7.86e-06s, cones: 5.41e-05s, accel: 2.11e-06s ------------------------------------------------------------------ objective = 0.633972 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 2.70e+01 1.00e+00 6.43e-01 3.21e-01 1.00e-01 1.23e-04 50| 3.09e-05 6.16e-06 8.11e-06 -3.00e+00 1.00e-01 2.25e-04 ------------------------------------------------------------------ status: solved timings: total: 2.26e-04s = setup: 7.90e-05s + solve: 1.47e-04s lin-sys: 1.25e-05s, cones: 8.72e-05s, accel: 3.76e-06s ------------------------------------------------------------------ objective = -2.999977 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_p_v_pp | 3 3 5.3s ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 2, nnz(P): 1 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 2.63e+00 2.09e-01 8.72e-02 2.28e-01 1.00e-01 1.18e-04 50| 2.64e-04 6.43e-06 1.43e-04 5.62e-01 1.00e-01 2.19e-04 ------------------------------------------------------------------ status: solved timings: total: 2.20e-04s = setup: 7.42e-05s + solve: 1.46e-04s lin-sys: 1.25e-05s, cones: 8.60e-05s, accel: 3.63e-06s ------------------------------------------------------------------ objective = 0.562433 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 2, nnz(P): 1 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 3.79e+00 2.33e-01 7.79e-02 5.94e-02 1.00e-01 1.38e-04 25| 5.79e-07 1.27e-07 6.01e-08 5.59e-02 1.00e-01 1.93e-04 ------------------------------------------------------------------ status: solved timings: total: 1.94e-04s = setup: 9.51e-05s + solve: 9.90e-05s lin-sys: 7.62e-06s, cones: 5.45e-05s, accel: 2.06e-06s ------------------------------------------------------------------ objective = 0.055935 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_p_v_pv | 3 3 4.9s ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.41e+00 1.41e-06 1.41e-06 7.07e-07 1.00e-01 1.51e-04 25| 4.18e-08 3.11e-12 3.11e-12 -1.55e-12 1.00e-01 2.15e-04 ------------------------------------------------------------------ status: solved timings: total: 2.16e-04s = setup: 1.06e-04s + solve: 1.10e-04s lin-sys: 2.14e-05s, cones: 4.97e-05s, accel: 2.16e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.27e+01 1.27e-05 1.15e-04 5.73e-05 1.00e-01 5.48e-05 25| 3.76e-07 2.80e-11 2.52e-10 -1.26e-10 1.00e-01 9.87e-05 ------------------------------------------------------------------ status: solved timings: total: 9.99e-05s = setup: 3.65e-05s + solve: 6.34e-05s lin-sys: 5.60e-06s, cones: 2.99e-05s, accel: 1.51e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_pp | 3 3 0.3s ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 2, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 5.40e+00 6.62e-01 1.96e+00 1.07e-01 1.00e-01 1.20e-04 25| 5.71e-05 3.15e-06 1.69e-05 7.50e-01 1.00e-01 1.78e-04 ------------------------------------------------------------------ status: solved timings: total: 1.79e-04s = setup: 7.68e-05s + solve: 1.02e-04s lin-sys: 7.63e-06s, cones: 5.76e-05s, accel: 1.93e-06s ------------------------------------------------------------------ objective = 0.749994 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 2, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 9.56e+00 8.06e-01 7.91e-01 -2.21e-01 1.00e-01 5.83e-05 25| 7.19e-06 1.80e-08 8.02e-07 9.72e-02 1.00e-01 1.07e-04 ------------------------------------------------------------------ status: solved timings: total: 1.08e-04s = setup: 3.84e-05s + solve: 7.01e-05s lin-sys: 5.27e-06s, cones: 3.78e-05s, accel: 1.60e-06s ------------------------------------------------------------------ objective = 0.097180 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_pp_v_pv | 3 3 1.9s ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.41e+00 1.41e-06 1.41e-06 7.07e-07 1.00e-01 1.19e-04 25| 4.18e-08 3.11e-12 3.11e-12 -1.55e-12 1.00e-01 1.67e-04 ------------------------------------------------------------------ status: solved timings: total: 1.69e-04s = setup: 7.46e-05s + solve: 9.42e-05s lin-sys: 7.50e-06s, cones: 4.79e-05s, accel: 1.92e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 1, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.41e+00 1.41e-06 4.71e-07 2.36e-07 1.00e-01 5.16e-05 25| 4.18e-08 3.11e-12 1.04e-12 -5.18e-13 1.00e-01 9.39e-05 ------------------------------------------------------------------ status: solved timings: total: 9.52e-05s = setup: 3.45e-05s + solve: 6.07e-05s lin-sys: 5.35e-06s, cones: 2.87e-05s, accel: 1.90e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_pv | 5 5 1.1s ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 3, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 6.20e+00 9.68e-01 2.61e+00 1.11e-01 1.00e-01 1.52e-04 25| 1.11e-05 5.49e-07 2.33e-06 8.04e-01 1.00e-01 2.07e-04 ------------------------------------------------------------------ status: solved timings: total: 2.09e-04s = setup: 1.09e-04s + solve: 9.97e-05s lin-sys: 7.19e-06s, cones: 5.48e-05s, accel: 1.86e-06s ------------------------------------------------------------------ objective = 0.803847 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 3, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 8.04e+00 1.21e+00 1.49e+00 -2.04e-02 1.00e-01 5.56e-05 25| 3.48e-06 8.69e-08 5.32e-07 4.17e-01 1.00e-01 1.08e-04 ------------------------------------------------------------------ status: solved timings: total: 1.09e-04s = setup: 3.76e-05s + solve: 7.14e-05s lin-sys: 5.83e-06s, cones: 3.83e-05s, accel: 1.62e-06s ------------------------------------------------------------------ objective = 0.416889 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_pv_v_pv | 5 5 0.3s ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 1, constraints m: 3 cones: s: psd vars: 3, ssize: 1 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 lin-sys: sparse-direct-amd-qdldl nnz(A): 3, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.41e+00 2.00e-06 1.00e-06 5.00e-07 1.00e-01 1.50e-04 25| 4.20e-08 1.96e-17 3.72e-17 1.86e-17 1.00e-01 2.08e-04 ------------------------------------------------------------------ status: solved timings: total: 2.09e-04s = setup: 1.05e-04s + solve: 1.04e-04s lin-sys: 7.61e-06s, cones: 5.80e-05s, accel: 2.02e-06s ------------------------------------------------------------------ objective = 0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_without_parameter_v_and_vv | 9 9 11.3s Test Summary: | Pass Total Time test_jump_quadratic_interval | 6 6 3.7s Running HiGHS 1.12.0 (git hash: 755a8e027a): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 row; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+01] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve reductions: rows 0(-1); columns 0(-2); nonzeros 0(-2) - Reduced to empty Performed postsolve Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 4.0000000000e-01 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 row; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : 2.0000000000e-01 P-D objective error : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 row; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [0e+00, 0e+00] RHS [6e+00, 6e+00] Solving LP with useful basis so presolve not used Model status : Optimal Objective value : 3.0000000000e-01 P-D objective error : 3.4694469520e-17 HiGHS run time : 0.00 Test Summary: | Pass Total Time test_jump_quadratic_interval_cached | 6 6 19.8s Test Summary: | Pass Total Time test_jump_sdp_matrix_parameter | 2 2 10.3s Test Summary: | Pass Total Time test_jump_sdp_scalar_parameter | 2 2 2.3s Test Summary: | Pass Total Time test_jump_set_variable_start_value | 3 3 0.4s Test Summary: | Pass Total Time test_list_of_parametric_constraint_types_present_conflict | 1 1 1.8s Test Summary: | Pass Total Time test_modification_multiple | 6 6 1.5s Test Summary: | Pass Total Time test_moi_ListOfConstraintTypesPresent | 2 2 1.9s Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: INFEASIBLE_POINT Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: INFEASIBLE_POINT Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: INFEASIBLE_POINT Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: NO_SOLUTION Starting bound analysis. Complete bound analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: OPTIMAL Original model primal status: FEASIBLE_POINT Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: NO_SOLUTION Starting bound analysis. Complete bound analysis found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: INFEASIBLE_POINT Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 0 infeasibilities. Starting elastic filter solver. Complete elastic filter solver found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: NO_SOLUTION Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 0 infeasibilities. Starting elastic filter solver. Complete elastic filter solver found 1 infeasibilities. Starting MathOptIIS IIS search. Original model termination status: INFEASIBLE Original model primal status: NO_SOLUTION Starting bound analysis. Complete bound analysis found 0 infeasibilities. Starting range analysis. Complete range analysis found 0 infeasibilities. Starting elastic filter solver. Complete elastic filter solver found 1 infeasibilities. ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 31 running 1 of 1 signal (10): User defined signal 1 _ZN12_GLOBAL__N_110MachineCSE10PerformCSEEPN4llvm15DomTreeNodeBaseINS1_17MachineBasicBlockEEE at /opt/julia/bin/../lib/julia/libLLVM.so.18.1jl (unknown line) _ZN12_GLOBAL__N_110MachineCSE20runOnMachineFunctionERN4llvm15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.18.1jl (unknown line) _ZN4llvm19MachineFunctionPass13runOnFunctionERNS_8FunctionE.part.0 at /opt/julia/bin/../lib/julia/libLLVM.so.18.1jl (unknown line) _ZN4llvm13FPPassManager13runOnFunctionERNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.18.1jl (unknown line) _ZN4llvm13FPPassManager11runOnModuleERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.18.1jl (unknown line) _ZN4llvm6legacy15PassManagerImpl3runERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.18.1jl (unknown line) _ZN4llvm3orc14SimpleCompilerclERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.18.1jl (unknown line) operator() at /source/src/jitlayers.cpp:1561 addModule at /source/src/jitlayers.cpp:2044 jl_compile_codeinst_now at /source/src/jitlayers.cpp:626 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:824 jl_compile_method_internal at /source/src/gf.c:3524 _jl_invoke at /source/src/gf.c:4002 [inlined] ijl_apply_generic at /source/src/gf.c:4210 macro expansion at /home/pkgeval/.julia/packages/MathOptInterface/03Qtw/src/Test/Test.jl:270 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] #runtests#2 at /home/pkgeval/.julia/packages/MathOptInterface/03Qtw/src/Test/Test.jl:265 runtests at /home/pkgeval/.julia/packages/MathOptInterface/03Qtw/src/Test/Test.jl:223 [inlined] test_moi_highs at /home/pkgeval/.julia/packages/ParametricOptInterface/ziNSs/test/moi_tests.jl:239 unknown function (ip: 0x7f9d3222bd1f) at (unknown file) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 macro expansion at /home/pkgeval/.julia/packages/ParametricOptInterface/ziNSs/test/runtests.jl:30 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] top-level scope at /home/pkgeval/.julia/packages/ParametricOptInterface/ziNSs/test/runtests.jl:30 _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_invoke at /source/src/gf.c:4017 jl_toplevel_eval_flex at /source/src/toplevel.c:1024 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2870 _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 _include at ./loading.jl:2930 include at ./Base.jl:307 IncludeInto at ./Base.jl:308 jfptr_IncludeInto_58627.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 jl_apply at /source/src/julia.h:2391 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 exec_options at ./client.jl:283 _start at ./client.jl:550 jfptr__start_39366.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 jl_apply at /source/src/julia.h:2391 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1139 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7f9d5f669249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 poptask at ./task.jl:1216 wait at ./task.jl:1228 #wait#398 at ./condition.jl:141 wait at ./process.jl:685 wait at ./process.jl:686 jfptr_wait_37520.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 subprocess_handler at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2553 unknown function (ip: 0x7f51f537f523) at (unknown file) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 #205 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2493 withenv at ./env.jl:265 #190 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2308 with_temp_env at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2161 #186 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2275 #mktempdir#21 at ./file.jl:936 unknown function (ip: 0x7f51f537240c) at (unknown file) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 mktempdir at ./file.jl:932 mktempdir at ./file.jl:932 #sandbox#182 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2222 [inlined] sandbox at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2212 unknown function (ip: 0x7f51f536af01) at (unknown file) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 #test#193 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2478 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2384 [inlined] #test#170 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:538 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:515 unknown function (ip: 0x7f51f536a451) at (unknown file) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 #test#84 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:169 unknown function (ip: 0x7f51f5368f50) at (unknown file) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:158 #test#82 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:157 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:157 [inlined] #test#81 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:156 [inlined] test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:156 unknown function (ip: 0x7f51f53602cf) at (unknown file) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 jl_apply at /source/src/julia.h:2391 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:689 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2870 _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 _include at ./loading.jl:2930 include at ./Base.jl:306 exec_options at ./client.jl:317 _start at ./client.jl:550 jfptr__start_39366.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 jl_apply at /source/src/julia.h:2391 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1139 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7f520f966249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.12/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007f51f53fc010 Total snapshots: 358. Utilization: 0% ╎358 @Base/client.jl:550 _start() ╎ 358 @Base/client.jl:317 exec_options(opts::Base.JLOptions) ╎ 358 @Base/Base.jl:306 include(mod::Module, _path::String) ╎ 358 @Base/loading.jl:2930 _include(mapexpr::Function, mod::Module, _pat… ╎ 358 @Base/loading.jl:2870 include_string(mapexpr::typeof(identity), mo… ╎ 358 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 358 @Pkg/src/API.jl:156 kwcall(::@NamedTuple{julia_args::Cmd}, ::typ… ╎ ╎ 358 @Pkg/src/API.jl:156 #test#81 ╎ ╎ 358 @Pkg/src/API.jl:157 test ╎ ╎ 358 @Pkg/src/API.jl:157 test(pkgs::Vector{String}; kwargs::Base.P… ╎ ╎ 358 @Pkg/src/API.jl:158 kwcall(::@NamedTuple{julia_args::Cmd}, :… ╎ ╎ ╎ 358 @Pkg/src/API.jl:169 test(pkgs::Vector{PackageSpec}; io::IOC… ╎ ╎ ╎ 358 @Pkg/src/API.jl:515 kwcall(::@NamedTuple{julia_args::Cmd, … ╎ ╎ ╎ 358 @Pkg/src/API.jl:538 test(ctx::Pkg.Types.Context, pkgs::Ve… ╎ ╎ ╎ 358 @Pkg/…erations.jl:2384 test ╎ ╎ ╎ 358 @Pkg/…erations.jl:2478 test(ctx::Pkg.Types.Context, pkg… ╎ ╎ ╎ ╎ 358 @Pkg/…rations.jl:2212 kwcall(::@NamedTuple{preferences… ╎ ╎ ╎ ╎ 358 @Pkg/…rations.jl:2222 #sandbox#182 ╎ ╎ ╎ ╎ 358 @Base/file.jl:932 mktempdir(fn::Function) ╎ ╎ ╎ ╎ 358 @Base/file.jl:932 mktempdir(fn::Function, parent::S… ╎ ╎ ╎ ╎ 358 @Base/file.jl:936 mktempdir(fn::Pkg.Operations.var… ╎ ╎ ╎ ╎ ╎ 358 @Pkg/…tions.jl:2275 (::Pkg.Operations.var"#186#18… ╎ ╎ ╎ ╎ ╎ 358 @Pkg/…tions.jl:2161 with_temp_env(fn::Pkg.Operat… ╎ ╎ ╎ ╎ ╎ 358 @Pkg/…tions.jl:2308 (::Pkg.Operations.var"#190#… ╎ ╎ ╎ ╎ ╎ 358 @Base/env.jl:265 withenv(::Pkg.Operations.var"… ╎ ╎ ╎ ╎ ╎ 358 @Pkg/…ions.jl:2493 (::Pkg.Operations.var"#205… ╎ ╎ ╎ ╎ ╎ ╎ 358 @Pkg/…ons.jl:2553 subprocess_handler(cmd::Cm… ╎ ╎ ╎ ╎ ╎ ╎ 358 @Base/…ss.jl:686 wait(x::Base.Process) ╎ ╎ ╎ ╎ ╎ ╎ 358 @Base/…ss.jl:685 wait(x::Base.Process, syn… ╎ ╎ ╎ ╎ ╎ ╎ 358 @Base/…on.jl:141 wait(c::Base.GenericCond… ╎ ╎ ╎ ╎ ╎ ╎ 358 @Base/…sk.jl:1228 wait() 357╎ ╎ ╎ ╎ ╎ ╎ ╎ 358 @Base/…sk.jl:1216 poptask(W::Base.Intru… HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); [31] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/ParametricOptInterface/ziNSs/test/runtests.jl:27 gc_page_data at /source/src/gc-stock.h:332 [inlined] jl_gc_small_alloc_inner at /source/src/gc-stock.c:738 ijl_gc_small_alloc at /source/src/gc-stock.c:775 Array at ./boot.jl:648 [inlined] getindex at ./array.jl:405 [inlined] GenericDomTree at ./../usr/share/julia/Compiler/src/ssair/domtree.jl:238 [inlined] construct_domtree at ./../usr/share/julia/Compiler/src/ssair/domtree.jl:242 CFGTransformState! at ./../usr/share/julia/Compiler/src/ssair/ir.jl:707 jfptr_CFGTransformStateNOT._33872.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_invoke at /source/src/gf.c:4017 tojlinvoke84392.1 at /opt/julia/lib/julia/sys.so (unknown line) j_CFGTransformStateNOT._81995.1 at /opt/julia/lib/julia/sys.so (unknown line) IncrementalCompact at ./../usr/share/julia/Compiler/src/ssair/ir.jl:807 [inlined] adce_pass! at ./../usr/share/julia/Compiler/src/ssair/passes.jl:2105 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1013 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1027 [inlined] optimize at ./../usr/share/julia/Compiler/src/optimize.jl:1002 jfptr_optimize_81947.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 finish_nocycle at ./../usr/share/julia/Compiler/src/typeinfer.jl:202 jfptr_finish_nocycle_81800.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4010 [inlined] ijl_apply_generic at /source/src/gf.c:4210 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4508 typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1254 PkgEval terminated after 2731.07s: test duration exceeded the time limit