Package evaluation to test ParametricOptInterface on Julia 1.10.10 (95f30e51f4*) started at 2026-02-02T18:00:45.901 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.10` Set-up completed after 5.67s ################################################################################ # Installation # Installing ParametricOptInterface... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [0ce4ce61] + ParametricOptInterface v0.14.2 Updating `~/.julia/environments/v1.10/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.2 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.49.0 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [0ce4ce61] + ParametricOptInterface v0.14.2 [69de0a69] + Parsers v2.8.3 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.5.1 [276daf66] + SpecialFunctions v2.6.1 [1e83bf80] + StaticArraysCore v1.4.4 [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 [2a0f44e3] + Base64 [ade2ca70] + Dates [b77e0a4c] + InteractiveUtils [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [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 9.98s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 2165.3 ms ✓ SCS_jll 1008.1 ms ✓ SCS_GPU_jll 984.6 ms ✓ SCS_MKL_jll 4990.5 ms ✓ ParametricOptInterface 4400.0 ms ✓ SCS 5 dependencies successfully precompiled in 17 seconds. 56 already precompiled. Precompilation completed after 29.88s ################################################################################ # Testing # Testing ParametricOptInterface Status `/tmp/jl_XEi4cj/Project.toml` [87dc4568] HiGHS v1.20.1 [b6b21f68] Ipopt v1.14.0 [4076af6c] JuMP v1.29.4 [0ce4ce61] ParametricOptInterface v0.14.2 ⌅ [c946c3f1] SCS v1.3.1 [37e2e46d] LinearAlgebra [8dfed614] Test Status `/tmp/jl_XEi4cj/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.2 [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 [4076af6c] JuMP v1.29.4 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.49.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [0ce4ce61] ParametricOptInterface v0.14.2 [69de0a69] Parsers v2.8.3 ⌅ [aea7be01] PrecompileTools v1.2.1 [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 [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.24+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.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [b77e0a4c] InteractiveUtils [4af54fe1] LazyArtifacts [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [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 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... 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 14.7s Test Summary: | Pass Total Time test_abstract_optimizer_attributes | 2 2 5.5s 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 23.2s Test Summary: | Pass Total Time test_basic_special_cases_of_getters | 2 2 6.0s Test Summary: | Pass Total Time test_basic_tests | 30 30 4.7s Test Summary: | Pass Total Time test_compute_conflict! | 18 18 18.1s Test Summary: | Pass Total Time test_constrained_variable_HiGHS | 9 9 1.0s Test Summary: | Pass Total Time test_constrained_variable_no_free | 7 7 0.5s Test Summary: | Pass Total Time test_constrained_variables | 6 6 1.7s Test Summary: | Pass Total Time test_constraint_attribute_error | 1 1 1.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 [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 2.1s Test Summary: | Pass Total Time test_duals_not_available | 1 1 0.5s Test Summary: | Pass Total Time test_duals_without_parameters | 3 3 0.8s Test Summary: | Pass Total Time test_error_modify_quadratic_objective | 2 2 0.9s Test Summary: | Pass Total Time test_get_constraint_function_vector | 1 1 6.8s Test Summary: | Pass Total Time test_get_constraint_set | 1 1 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 [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 6.1s 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 2.8s Test Summary: | Pass Total Time test_getters | 26 26 4.3s Test Summary: | Pass Total Time test_issue_185 | 2 2 4.7s Test Summary: | Pass Total Time test_issue_185_vector | 2 2 2.2s 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.1s Test Summary: | Pass Total Time test_jump_constraintfunction_getter | 6 6 5.3s 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.7s 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.8s 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.5s 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 1.3s 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.5s ****************************************************************************** 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 9.5s Test Summary: | Pass Total Time test_jump_direct_rsoc_constraints | 7 7 32.1s Test Summary: | Pass Total Time test_jump_direct_soc_parameters | 6 6 3.0s Test Summary: | Pass Total Time test_jump_direct_vector_parameter_affine_nonnegatives | 4 4 0.8s Test Summary: | Pass Total Time test_jump_direct_vector_parameter_affine_nonpositives | 4 4 2.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 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.2s 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 2.8s 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.2s Test Summary: | Pass Total Time test_jump_dual_delete_constraint_3 | 60 60 1.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 [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.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 [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.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 [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.7s 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.25 Test Summary: | Pass Total Time test_jump_dual_multiple_parameters_1 | 6 6 1.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 [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.25 Test Summary: | Pass Total Time test_jump_dual_multiple_parameters_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 [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.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 [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.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 [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.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_EqualTo | 6 6 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_GreaterThan | 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_LessThan | 6 6 0.4s 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 5.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, 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.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| 1.41e+00 1.41e-06 1.41e-06 7.07e-07 1.00e-01 3.32e-04 25| 4.18e-08 3.11e-12 3.11e-12 -1.55e-12 1.00e-01 3.76e-04 ------------------------------------------------------------------ status: solved timings: total: 3.78e-04s = setup: 1.90e-04s + solve: 1.87e-04s lin-sys: 6.86e-06s, cones: 1.41e-04s, accel: 1.99e-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.31e-04 25| 1.25e-07 9.33e-12 2.80e-11 -1.40e-11 1.00e-01 1.74e-04 ------------------------------------------------------------------ status: solved timings: total: 1.76e-04s = setup: 8.69e-05s + solve: 8.88e-05s lin-sys: 7.30e-06s, cones: 4.62e-05s, accel: 1.81e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_p | 3 3 10.0s ------------------------------------------------------------------ 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.31e-04 25| 7.91e-06 1.96e-07 4.61e-06 6.34e-01 1.00e-01 1.80e-04 ------------------------------------------------------------------ status: solved timings: total: 1.81e-04s = setup: 8.73e-05s + solve: 9.38e-05s lin-sys: 7.15e-06s, cones: 5.36e-05s, accel: 1.80e-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.36e-04 50| 3.09e-05 6.16e-06 8.11e-06 -3.00e+00 1.00e-01 2.33e-04 ------------------------------------------------------------------ status: solved timings: total: 2.34e-04s = setup: 9.09e-05s + solve: 1.43e-04s lin-sys: 1.27e-05s, cones: 8.41e-05s, accel: 3.45e-06s ------------------------------------------------------------------ objective = -2.999977 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_p_v_pp | 3 3 4.0s ------------------------------------------------------------------ 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.37e-04 50| 2.64e-04 6.43e-06 1.43e-04 5.62e-01 1.00e-01 2.39e-04 ------------------------------------------------------------------ status: solved timings: total: 2.40e-04s = setup: 8.50e-05s + solve: 1.55e-04s lin-sys: 1.32e-05s, cones: 9.04e-05s, accel: 3.32e-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.33e-04 25| 5.79e-07 1.27e-07 6.01e-08 5.59e-02 1.00e-01 1.84e-04 ------------------------------------------------------------------ status: solved timings: total: 1.85e-04s = setup: 8.71e-05s + solve: 9.77e-05s lin-sys: 7.49e-06s, cones: 5.64e-05s, accel: 1.75e-06s ------------------------------------------------------------------ objective = 0.055935 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_p_v_pv | 3 3 2.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 1.67e-04 25| 4.18e-08 3.11e-12 3.11e-12 -1.55e-12 1.00e-01 2.10e-04 ------------------------------------------------------------------ status: solved timings: total: 2.12e-04s = setup: 1.21e-04s + solve: 9.12e-05s lin-sys: 7.16e-06s, cones: 4.73e-05s, accel: 1.78e-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.87e-05 25| 3.76e-07 2.80e-11 2.52e-10 -1.26e-10 1.00e-01 9.58e-05 ------------------------------------------------------------------ status: solved timings: total: 9.71e-05s = setup: 3.90e-05s + solve: 5.82e-05s lin-sys: 5.01e-06s, cones: 2.71e-05s, accel: 1.39e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_pp | 3 3 0.2s ------------------------------------------------------------------ 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.37e-04 25| 5.71e-05 3.15e-06 1.69e-05 7.50e-01 1.00e-01 1.88e-04 ------------------------------------------------------------------ status: solved timings: total: 1.89e-04s = setup: 9.32e-05s + solve: 9.56e-05s lin-sys: 7.39e-06s, cones: 5.38e-05s, accel: 2.03e-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.55e-05 25| 7.19e-06 1.80e-08 8.02e-07 9.72e-02 1.00e-01 1.03e-04 ------------------------------------------------------------------ status: solved timings: total: 1.04e-04s = setup: 3.75e-05s + solve: 6.62e-05s lin-sys: 5.44e-06s, cones: 3.50e-05s, accel: 1.91e-06s ------------------------------------------------------------------ objective = 0.097180 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_pp_v_pv | 3 3 0.7s ------------------------------------------------------------------ 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 1.90e-04 ------------------------------------------------------------------ status: solved timings: total: 1.91e-04s = setup: 9.99e-05s + solve: 9.10e-05s lin-sys: 7.12e-06s, cones: 4.98e-05s, accel: 1.81e-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 1.69e-04 25| 4.18e-08 3.11e-12 1.04e-12 -5.18e-13 1.00e-01 2.14e-04 ------------------------------------------------------------------ status: solved timings: total: 2.15e-04s = setup: 1.22e-04s + solve: 9.28e-05s lin-sys: 7.80e-06s, cones: 4.77e-05s, accel: 2.00e-06s ------------------------------------------------------------------ objective = -0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_with_parameter_pv | 5 5 0.7s ------------------------------------------------------------------ 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.62e-04 25| 1.11e-05 5.49e-07 2.33e-06 8.04e-01 1.00e-01 2.31e-04 ------------------------------------------------------------------ status: solved timings: total: 2.32e-04s = setup: 1.13e-04s + solve: 1.19e-04s lin-sys: 6.98e-06s, cones: 7.62e-05s, accel: 1.82e-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 9.16e-05 25| 3.48e-06 8.69e-08 5.32e-07 4.17e-01 1.00e-01 1.36e-04 ------------------------------------------------------------------ status: solved timings: total: 1.37e-04s = setup: 6.53e-05s + solve: 7.14e-05s lin-sys: 5.48e-06s, cones: 3.83e-05s, accel: 1.46e-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.39e-04 25| 4.20e-08 1.96e-17 3.72e-17 1.86e-17 1.00e-01 1.91e-04 ------------------------------------------------------------------ status: solved timings: total: 1.93e-04s = setup: 9.59e-05s + solve: 9.67e-05s lin-sys: 7.15e-06s, cones: 5.51e-05s, accel: 1.84e-06s ------------------------------------------------------------------ objective = 0.000000 ------------------------------------------------------------------ Test Summary: | Pass Total Time test_jump_psd_cone_without_parameter_v_and_vv | 9 9 8.3s Test Summary: | Pass Total Time test_jump_quadratic_interval | 6 6 2.9s 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 15.1s Test Summary: | Pass Total Time test_jump_sdp_matrix_parameter | 2 2 13.3s Test Summary: | Pass Total Time test_jump_sdp_scalar_parameter | 2 2 2.9s Test Summary: | Pass Total Time test_jump_set_variable_start_value | 3 3 0.2s Test Summary: | Pass Total Time test_list_of_parametric_constraint_types_present_conflict | 1 1 1.0s Test Summary: | Pass Total Time test_modification_multiple | 6 6 0.8s Test Summary: | Pass Total Time test_moi_ListOfConstraintTypesPresent | 2 2 1.5s 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. 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. Test Summary: | Pass Total Time test_moi_highs | 6480 6480 26m44.8s 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(); 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(); ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 24 running 1 of 1 signal (10): User defined signal 1 _ZN4llvm12DenseMapBaseINS_8DenseMapIPNS_12MachineInstrEjNS_12DenseMapInfoIS3_vEENS_6detail12DenseMapPairIS3_jEEEES3_jS5_S8_E11try_emplaceIJjEEESt4pairINS_16DenseMapIteratorIS3_jS5_S8_Lb0EEEbEOS3_DpOT_ at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN12_GLOBAL__N_125TwoAddressInstructionPass20runOnMachineFunctionERN4llvm15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm19MachineFunctionPass13runOnFunctionERNS_8FunctionE.part.66 at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm13FPPassManager13runOnFunctionERNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm13FPPassManager11runOnModuleERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm6legacy15PassManagerImpl3runERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc14SimpleCompilerclERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) operator() at /source/src/jitlayers.cpp:1311 _ZN4llvm3orc14IRCompileLayer4emitESt10unique_ptrINS0_29MaterializationResponsibilityESt14default_deleteIS3_EENS0_16ThreadSafeModuleE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16IRTransformLayer4emitESt10unique_ptrINS0_29MaterializationResponsibilityESt14default_deleteIS3_EENS0_16ThreadSafeModuleE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) emit at /source/src/jitlayers.cpp:724 _ZN4llvm3orc31BasicIRLayerMaterializationUnit11materializeESt10unique_ptrINS0_29MaterializationResponsibilityESt14default_deleteIS3_EE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc19MaterializationTask3runEv at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm6detail18UniqueFunctionBaseIvJSt10unique_ptrINS_3orc4TaskESt14default_deleteIS4_EEEE8CallImplIPFvS7_EEEvPvRS7_ at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession12dispatchTaskESt10unique_ptrINS0_4TaskESt14default_deleteIS3_EE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession22dispatchOutstandingMUsEv at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession17OL_completeLookupESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EESt10shared_ptrINS0_23AsynchronousSymbolQueryEESt8functionIFvRKNS_8DenseMapIPNS0_8JITDylibENS_8DenseSetINS0_15SymbolStringPtrENS_12DenseMapInfoISF_vEEEENSG_ISD_vEENS_6detail12DenseMapPairISD_SI_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc25InProgressFullLookupState8completeESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession19OL_applyQueryPhase1ESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EENS_5ErrorE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession6lookupENS0_10LookupKindERKSt6vectorISt4pairIPNS0_8JITDylibENS0_19JITDylibLookupFlagsEESaIS8_EENS0_15SymbolLookupSetENS0_11SymbolStateENS_15unique_functionIFvNS_8ExpectedINS_8DenseMapINS0_15SymbolStringPtrENS_18JITEvaluatedSymbolENS_12DenseMapInfoISI_vEENS_6detail12DenseMapPairISI_SJ_EEEEEEEEESt8functionIFvRKNSH_IS6_NS_8DenseSetISI_SL_EENSK_IS6_vEENSN_IS6_SV_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession6lookupERKSt6vectorISt4pairIPNS0_8JITDylibENS0_19JITDylibLookupFlagsEESaIS7_EENS0_15SymbolLookupSetENS0_10LookupKindENS0_11SymbolStateESt8functionIFvRKNS_8DenseMapIS5_NS_8DenseSetINS0_15SymbolStringPtrENS_12DenseMapInfoISI_vEEEENSJ_IS5_vEENS_6detail12DenseMapPairIS5_SL_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) addModule at /source/src/jitlayers.cpp:1604 jl_add_to_ee at /source/src/jitlayers.cpp:2015 jl_add_to_ee at /source/src/jitlayers.cpp:1994 jl_add_to_ee at /source/src/jitlayers.cpp:1994 jl_add_to_ee at /source/src/jitlayers.cpp:1994 jl_add_to_ee at /source/src/jitlayers.cpp:1994 jl_add_to_ee at /source/src/jitlayers.cpp:1994 jl_add_to_ee at /source/src/jitlayers.cpp:1994 _jl_compile_codeinst at /source/src/jitlayers.cpp:276 jl_generate_fptr_impl at /source/src/jitlayers.cpp:528 jl_compile_method_internal at /source/src/gf.c:2481 [inlined] jl_compile_method_internal at /source/src/gf.c:2368 _jl_invoke at /source/src/gf.c:2887 [inlined] ijl_apply_generic at /source/src/gf.c:3077 macro expansion at /home/pkgeval/.julia/packages/MathOptInterface/Q3V1z/src/Test/Test.jl:270 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.10/Test/src/Test.jl:1577 [inlined] #runtests#2 at /home/pkgeval/.julia/packages/MathOptInterface/Q3V1z/src/Test/Test.jl:265 runtests at /home/pkgeval/.julia/packages/MathOptInterface/Q3V1z/src/Test/Test.jl:223 unknown function (ip: 0x73ea74d31750) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 test_moi_ipopt at /home/pkgeval/.julia/packages/ParametricOptInterface/qeWEl/test/moi_tests.jl:259 unknown function (ip: 0x73ea74d2d292) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 macro expansion at /home/pkgeval/.julia/packages/ParametricOptInterface/qeWEl/test/runtests.jl:30 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.10/Test/src/Test.jl:1577 [inlined] top-level scope at /home/pkgeval/.julia/packages/ParametricOptInterface/qeWEl/test/runtests.jl:30 _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_invoke at /source/src/gf.c:2902 jl_toplevel_eval_flex at /source/src/toplevel.c:925 jl_toplevel_eval_flex at /source/src/toplevel.c:877 ijl_toplevel_eval_in at /source/src/toplevel.c:985 eval at ./boot.jl:385 [inlined] include_string at ./loading.jl:2146 _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 _include at ./loading.jl:2206 include at ./client.jl:494 unknown function (ip: 0x73eabb27f125) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] do_call at /source/src/interpreter.c:126 eval_value at /source/src/interpreter.c:223 eval_stmt_value at /source/src/interpreter.c:174 [inlined] eval_body at /source/src/interpreter.c:635 jl_interpret_toplevel_thunk at /source/src/interpreter.c:775 jl_toplevel_eval_flex at /source/src/toplevel.c:934 jl_toplevel_eval_flex at /source/src/toplevel.c:877 ijl_toplevel_eval_in at /source/src/toplevel.c:985 eval at ./boot.jl:385 [inlined] exec_options at ./client.jl:296 _start at ./client.jl:557 jfptr__start_83083.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] true_main at /source/src/jlapi.c:582 jl_repl_entrypoint at /source/src/jlapi.c:731 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x73eabc360249) __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) unknown function (ip: (nil)) ============================================================== 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_wait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/epoll.c:236 uv_run at /workspace/srcdir/libuv/src/unix/core.c:400 ijl_task_get_next at /source/src/partr.c:478 poptask at ./task.jl:999 wait at ./task.jl:1008 #wait#647 at ./condition.jl:130 wait at ./condition.jl:125 [inlined] wait at ./process.jl:661 jfptr_wait_74801.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 subprocess_handler at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:2048 #130 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1992 withenv at ./env.jl:257 #117 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1840 with_temp_env at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1721 #115 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1810 #mktempdir#24 at ./file.jl:766 unknown function (ip: 0x7f867d6dac90) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 mktempdir at ./file.jl:762 mktempdir at ./file.jl:762 [inlined] #sandbox#114 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1768 sandbox at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1759 unknown function (ip: 0x7f867d6d363d) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 #test#127 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1971 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1915 [inlined] #test#146 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:444 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:423 unknown function (ip: 0x7f867d6d3130) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 #test#77 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:159 unknown function (ip: 0x7f867d6d29f0) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:148 #test#75 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:147 [inlined] test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:147 [inlined] #test#74 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:146 [inlined] test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:146 unknown function (ip: 0x7f867d6cf0e9) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] do_call at /source/src/interpreter.c:126 eval_value at /source/src/interpreter.c:223 eval_stmt_value at /source/src/interpreter.c:174 [inlined] eval_body at /source/src/interpreter.c:635 eval_body at /source/src/interpreter.c:544 eval_body at /source/src/interpreter.c:544 jl_interpret_toplevel_thunk at /source/src/interpreter.c:775 jl_toplevel_eval_flex at /source/src/toplevel.c:934 jl_toplevel_eval_flex at /source/src/toplevel.c:877 ijl_toplevel_eval_in at /source/src/toplevel.c:985 eval at ./boot.jl:385 [inlined] include_string at ./loading.jl:2146 _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 _include at ./loading.jl:2206 include at ./Base.jl:495 jfptr_include_46644.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 exec_options at ./client.jl:323 _start at ./client.jl:557 jfptr__start_83083.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] true_main at /source/src/jlapi.c:582 jl_repl_entrypoint at /source/src/jlapi.c:731 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7f867e4c0249) __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) unknown function (ip: (nil)) ============================================================== 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.10/Profile/src/Profile.jl:1225 Overhead ╎ [+additional indent] Count File:Line; Function ========================================================= Thread 1 Task 0x00007f86717fc010 Total snapshots: 1. Utilization: 0% ╎1 @Base/client.jl:557; _start() ╎ 1 @Base/client.jl:323; exec_options(opts::Base.JLOptions) ╎ 1 @Base/Base.jl:495; include(mod::Module, _path::String) ╎ 1 @Base/loading.jl:2206; _include(mapexpr::Function, mod::Module, _path::S… ╎ 1 @Base/loading.jl:2146; include_string(mapexpr::typeof(identity), mod::M… ╎ 1 @Base/boot.jl:385; eval ╎ ╎ 1 @Pkg/src/API.jl:146; kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(… ╎ ╎ 1 @Pkg/src/API.jl:146; #test#74 ╎ ╎ 1 @Pkg/src/API.jl:147; test ╎ ╎ 1 @Pkg/src/API.jl:147; #test#75 ╎ ╎ 1 @Pkg/src/API.jl:148; kwcall(::@NamedTuple{julia_args::Cmd}, ::typ… ╎ ╎ ╎ 1 @Pkg/src/API.jl:159; test(pkgs::Vector{Pkg.Types.PackageSpec}; i… ╎ ╎ ╎ 1 @Pkg/src/API.jl:423; kwcall(::@NamedTuple{julia_args::Cmd, io::… ╎ ╎ ╎ 1 @Pkg/src/API.jl:444; test(ctx::Pkg.Types.Context, pkgs::Vector… ╎ ╎ ╎ 1 …/src/Operations.jl:1915; test ╎ ╎ ╎ 1 …src/Operations.jl:1971; test(ctx::Pkg.Types.Context, pkgs::… ╎ ╎ ╎ ╎ 1 …src/Operations.jl:1759; kwcall(::@NamedTuple{preferences::… ╎ ╎ ╎ ╎ 1 …src/Operations.jl:1768; sandbox(fn::Function, ctx::Pkg.Ty… ╎ ╎ ╎ ╎ 1 @Base/file.jl:762; mktempdir ╎ ╎ ╎ ╎ 1 @Base/file.jl:762; mktempdir(fn::Function, parent::Strin… ╎ ╎ ╎ ╎ 1 @Base/file.jl:766; mktempdir(fn::Pkg.Operations.var"#11… ╎ ╎ ╎ ╎ ╎ 1 …c/Operations.jl:1810; (::Pkg.Operations.var"#115#120"… ╎ ╎ ╎ ╎ ╎ 1 …c/Operations.jl:1721; with_temp_env(fn::Pkg.Operatio… ╎ ╎ ╎ ╎ ╎ 1 …/Operations.jl:1840; (::Pkg.Operations.var"#117#122… ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:257; withenv(::Pkg.Operations.var"#130… ╎ ╎ ╎ ╎ ╎ 1 …Operations.jl:1992; (::Pkg.Operations.var"#130#13… ╎ ╎ ╎ ╎ ╎ ╎ 1 …Operations.jl:2048; subprocess_handler(cmd::Cmd,… ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/process.jl:661; wait(x::Base.Process) ╎ ╎ ╎ ╎ ╎ ╎ 1 …/condition.jl:125; wait ╎ ╎ ╎ ╎ ╎ ╎ 1 …condition.jl:130; wait(c::Base.GenericConditi… ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/task.jl:1008; wait() ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/task.jl:999; poptask(W::Base.IntrusiveL… [1] signal (15): Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_wait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/epoll.c:236 uv_run at /workspace/srcdir/libuv/src/unix/core.c:400 ijl_task_get_next at /source/src/partr.c:478 poptask at ./task.jl:999 wait at ./task.jl:1008 #wait#647 at ./condition.jl:130 wait at ./condition.jl:125 [inlined] _trywait at ./asyncevent.jl:142 wait at ./asyncevent.jl:159 [inlined] profile_printing_listener at ./Base.jl:572 #1058 at ./Base.jl:608 jfptr_YY.1058_85302.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] start_task at /source/src/task.c:1256 unknown function (ip: (nil)) Allocations: 16681201 (Pool: 16635311; Big: 45890); GC: 12 [24] signal (15): Terminated in expression starting at /home/pkgeval/.julia/packages/ParametricOptInterface/qeWEl/test/runtests.jl:27 PkgEval terminated after 2722.4s: test duration exceeded the time limit