Package evaluation to test ParametricOptInterface on Julia 1.14.0-DEV.1741 (f7ebeb5678*) started at 2026-02-19T16:48:22.935 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 12.45s ################################################################################ # Installation # Installing ParametricOptInterface... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [0ce4ce61] + ParametricOptInterface v0.14.3 Updating `~/.julia/environments/v1.14/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.3 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [276daf66] + SpecialFunctions v2.7.1 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.6.3 [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.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 5.49s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 1356.2 ms ✓ IntelOpenMP_jll 1368.1 ms ✓ HiGHS_jll 1363.4 ms ✓ ASL_jll 1387.5 ms ✓ MUMPS_seq_jll 1373.3 ms ✓ SCS_GPU_jll 1387.2 ms ✓ SCS_jll 1416.8 ms ✓ SPRAL_jll 75840.3 ms ✓ MathOptInterface 5016.2 ms ✓ MKL_jll 1350.2 ms ✓ Ipopt_jll 64186.7 ms ✓ JuMP 6181.0 ms ✓ MathOptIIS 6583.3 ms ✓ ParametricOptInterface 1335.6 ms ✓ SCS_MKL_jll 1345.5 ms ✓ Ipopt 32971.1 ms ✓ HiGHS 6737.9 ms ✓ SCS 47078.5 ms ✓ Ipopt → IpoptMathOptInterfaceExt 18 dependencies successfully precompiled in 260 seconds. 71 already precompiled. Precompilation completed after 282.64s ################################################################################ # Testing # Testing ParametricOptInterface Status `/tmp/jl_h9gdjA/Project.toml` [87dc4568] HiGHS v1.21.1 [b6b21f68] Ipopt v1.14.0 [4076af6c] JuMP v1.29.4 [b8f27783] MathOptInterface v1.49.0 [0ce4ce61] ParametricOptInterface v0.14.3 ⌅ [c946c3f1] SCS v1.3.1 [37e2e46d] LinearAlgebra v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_h9gdjA/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.21.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.2 [b8f27783] MathOptInterface v1.49.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [0ce4ce61] ParametricOptInterface v0.14.3 [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.7.1 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [ec057cc2] StructUtils v2.6.3 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.13.1+0 [e33a78d0] Hwloc_jll v2.13.0+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.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.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.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.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... 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. Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -6.9999930107e+00 Ph1: 2(6); Du: 2(6.99999) 0.0s 2 9.3333333333e+00 Pr: 0(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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -6.9999930107e+00 Ph1: 2(6); Du: 2(6.99999) 0.3s 2 9.3333333333e+00 Pr: 0(0) 0.3s Model status : Optimal Simplex iterations: 2 Objective value : 9.3333333333e+00 P-D objective error : 9.0323229122e-17 HiGHS run time : 0.25 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 1.5000013589e+00 Pr: 1(2) 0.0s 1 3.5000000000e+00 Pr: 0(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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 1.5000013589e+00 Pr: 1(2) 0.0s 1 3.5000000000e+00 Pr: 0(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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -6.9999930107e+00 Ph1: 2(6); Du: 2(6.99999) 0.0s 2 9.3333333333e+00 Pr: 0(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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000927e+00 Ph1: 2(4); Du: 1(1) 0.0s 1 6.0000000000e+00 Pr: 0(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 ****************************************************************************** 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 ****************************************************************************** ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 3, constraints m: 5 cones: z: primal zero / dual free vars: 1 l: linear vars: 1 q: soc vars: 3, qsize: 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): 7, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.63e+01 1.00e+00 2.32e+01 -1.14e+01 1.00e-01 2.59e-04 100| 2.92e-06 2.13e-07 1.94e-07 2.50e-01 1.00e-01 4.48e-04 ------------------------------------------------------------------ status: solved timings: total: 4.50e-04s = setup: 1.76e-04s + solve: 2.75e-04s lin-sys: 3.27e-05s, cones: 2.19e-05s, accel: 9.05e-05s ------------------------------------------------------------------ objective = 0.250000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.3 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 3, constraints m: 5 cones: z: primal zero / dual free vars: 1 l: linear vars: 1 q: soc vars: 3, qsize: 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): 7, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.63e+01 1.00e+00 2.34e+01 -1.13e+01 1.00e-01 1.48e-04 50| 5.34e-07 1.11e-08 2.01e-08 1.22e-08 1.00e-01 1.96e-04 ------------------------------------------------------------------ status: solved timings: total: 1.98e-04s = setup: 1.26e-04s + solve: 7.19e-05s lin-sys: 1.46e-05s, cones: 1.10e-05s, accel: 3.49e-06s ------------------------------------------------------------------ objective = 0.000000 ------------------------------------------------------------------ Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+00 Pr: 1(1) 0.0s 1 -2.0000000000e+00 Pr: 0(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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 8(8000); Du: 1(1) 0.0s 2 8.0000000000e+00 Pr: 0(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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 7(7000); Du: 1(1) 0.0s 1 7.0000000000e+00 Pr: 0(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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 6(6000); Du: 1(1) 0.0s 2 6.0000000000e+00 Pr: 0(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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 5(5000); Du: 1(1) 0.0s 2 5.0000000000e+00 Pr: 0(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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 4(4000); Du: 1(1) 0.0s 2 4.0000000000e+00 Pr: 0(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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 3(3000); Du: 1(1) 0.0s 2 3.0000000000e+00 Pr: 0(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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000000e+03 Ph1: 2(2000); Du: 1(1) 0.0s 2 2.0000000000e+00 Pr: 0(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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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.24 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 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. Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -6.9999930107e+00 Ph1: 2(6); Du: 2(6.99999) 0.0s 2 9.3333333333e+00 Pr: 0(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 dual simplex solver Iteration Objective Infeasibilities num(sum) 0 -1.0000000927e+00 Ph1: 2(4); Du: 1(1) 0.0s 1 6.0000000000e+00 Pr: 0(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 ------------------------------------------------------------------ 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.53e-04 25| 4.18e-08 3.11e-12 3.11e-12 -1.55e-12 1.00e-01 3.01e-04 ------------------------------------------------------------------ status: solved timings: total: 3.02e-04s = setup: 1.31e-04s + solve: 1.71e-04s lin-sys: 6.57e-06s, cones: 1.27e-04s, accel: 1.66e-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.52e-04 25| 1.25e-07 9.33e-12 2.80e-11 -1.40e-11 1.00e-01 2.01e-04 ------------------------------------------------------------------ status: solved timings: total: 2.02e-04s = setup: 1.10e-04s + solve: 9.29e-05s lin-sys: 6.84e-06s, cones: 5.01e-05s, accel: 1.74e-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| 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.84e-04 ------------------------------------------------------------------ status: solved timings: total: 1.85e-04s = setup: 8.96e-05s + solve: 9.56e-05s lin-sys: 7.02e-06s, cones: 5.44e-05s, accel: 1.72e-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.97e-04 50| 3.09e-05 6.16e-06 8.11e-06 -3.00e+00 1.00e-01 2.88e-04 ------------------------------------------------------------------ status: solved timings: total: 2.89e-04s = setup: 1.54e-04s + solve: 1.34e-04s lin-sys: 1.13e-05s, cones: 8.22e-05s, accel: 3.35e-06s ------------------------------------------------------------------ objective = -2.999977 ------------------------------------------------------------------ ------------------------------------------------------------------ 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.30e-04 50| 2.64e-04 6.43e-06 1.43e-04 5.62e-01 1.00e-01 2.26e-04 ------------------------------------------------------------------ status: solved timings: total: 2.27e-04s = setup: 7.87e-05s + solve: 1.49e-04s lin-sys: 1.15e-05s, cones: 8.94e-05s, accel: 3.09e-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.40e-04 25| 5.79e-07 1.27e-07 6.01e-08 5.59e-02 1.00e-01 1.94e-04 ------------------------------------------------------------------ status: solved timings: total: 1.96e-04s = setup: 9.64e-05s + solve: 9.92e-05s lin-sys: 6.60e-06s, cones: 5.81e-05s, accel: 1.69e-06s ------------------------------------------------------------------ objective = 0.055935 ------------------------------------------------------------------ ------------------------------------------------------------------ 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.33e-04 25| 4.18e-08 3.11e-12 3.11e-12 -1.55e-12 1.00e-01 1.79e-04 ------------------------------------------------------------------ status: solved timings: total: 1.80e-04s = setup: 8.96e-05s + solve: 9.08e-05s lin-sys: 6.78e-06s, cones: 4.99e-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.27e+01 1.27e-05 1.15e-04 5.73e-05 1.00e-01 1.66e-04 25| 3.76e-07 2.80e-11 2.52e-10 -1.26e-10 1.00e-01 2.10e-04 ------------------------------------------------------------------ status: solved timings: total: 2.12e-04s = setup: 1.22e-04s + solve: 9.00e-05s lin-sys: 6.26e-06s, cones: 4.84e-05s, accel: 1.64e-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): 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.31e-04 25| 5.71e-05 3.15e-06 1.69e-05 7.50e-01 1.00e-01 1.86e-04 ------------------------------------------------------------------ status: solved timings: total: 1.87e-04s = setup: 8.79e-05s + solve: 9.93e-05s lin-sys: 6.66e-06s, cones: 5.92e-05s, accel: 1.72e-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 1.36e-04 25| 7.19e-06 1.80e-08 8.02e-07 9.72e-02 1.00e-01 2.10e-04 ------------------------------------------------------------------ status: solved timings: total: 2.11e-04s = setup: 9.24e-05s + solve: 1.19e-04s lin-sys: 2.65e-05s, cones: 5.82e-05s, accel: 1.75e-06s ------------------------------------------------------------------ objective = 0.097180 ------------------------------------------------------------------ ------------------------------------------------------------------ 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.69e-04 25| 4.18e-08 3.11e-12 3.11e-12 -1.55e-12 1.00e-01 2.11e-04 ------------------------------------------------------------------ status: solved timings: total: 2.12e-04s = setup: 1.25e-04s + solve: 8.65e-05s lin-sys: 6.41e-06s, cones: 4.81e-05s, accel: 1.63e-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 2.30e-04 25| 4.18e-08 3.11e-12 1.04e-12 -5.18e-13 1.00e-01 2.76e-04 ------------------------------------------------------------------ status: solved timings: total: 2.77e-04s = setup: 1.82e-04s + solve: 9.46e-05s lin-sys: 7.00e-06s, cones: 5.21e-05s, accel: 1.74e-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): 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.64e-04 25| 1.11e-05 5.49e-07 2.33e-06 8.04e-01 1.00e-01 2.18e-04 ------------------------------------------------------------------ status: solved timings: total: 2.20e-04s = setup: 1.21e-04s + solve: 9.83e-05s lin-sys: 6.61e-06s, cones: 5.76e-05s, accel: 1.65e-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 1.25e-04 25| 3.48e-06 8.69e-08 5.32e-07 4.17e-01 1.00e-01 1.77e-04 ------------------------------------------------------------------ status: solved timings: total: 1.78e-04s = setup: 8.43e-05s + solve: 9.40e-05s lin-sys: 6.20e-06s, cones: 5.64e-05s, accel: 1.77e-06s ------------------------------------------------------------------ objective = 0.416889 ------------------------------------------------------------------ ------------------------------------------------------------------ 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.40e-04 25| 4.20e-08 1.96e-17 3.72e-17 1.86e-17 1.00e-01 2.01e-04 ------------------------------------------------------------------ status: solved timings: total: 2.02e-04s = setup: 9.25e-05s + solve: 1.10e-04s lin-sys: 6.94e-06s, cones: 6.53e-05s, accel: 1.77e-06s ------------------------------------------------------------------ objective = 0.000000 ------------------------------------------------------------------ Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline Test Summary: | Pass Total Time test_JuMP.jl | 374 374 8m20.8s Running HiGHS 1.13.1 (git hash: 1d267d97c): Copyright (c) 2026 under Apache 2.0 license terms Using BLAS: blastrampoline 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 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 130 running 1 of 1 signal (10): User defined signal 1 unknown function (ip: 0x755be62cbacc) at /lib/x86_64-linux-gnu/libc.so.6 malloc at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) operator new at /workspace/srcdir/gcc-14.2.0/libstdc++-v3/libsupc++/new_op.cc:50 _ZN4llvm4UsernwEmNS0_28IntrusiveOperandsAllocMarkerE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZNK4llvm8CallInst9cloneImplEv at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZNK4llvm11Instruction5cloneEv at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm15CloneBasicBlockEPKNS_10BasicBlockERNS_8ValueMapIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS6_NS_3sys10SmartMutexILb0EEEEEEERKNS_5TwineEPNS_8FunctionEPNS_14ClonedCodeInfoE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm21CloneFunctionBodyIntoERNS_8FunctionERKS0_RNS_8ValueMapIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS7_NS_3sys10SmartMutexILb0EEEEEEENS_10RemapFlagsERNS_15SmallVectorImplIPNS_10ReturnInstEEEPKcPNS_14ClonedCodeInfoEPNS_20ValueMapTypeRemapperEPNS_17ValueMaterializerEPKNS_11SmallPtrSetIPKNS_8MetadataELj16EEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm17CloneFunctionIntoEPNS_8FunctionEPKS0_RNS_8ValueMapIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS7_NS_3sys10SmartMutexILb0EEEEEEENS_23CloneFunctionChangeTypeERNS_15SmallVectorImplIPNS_10ReturnInstEEEPKcPNS_14ClonedCodeInfoEPNS_20ValueMapTypeRemapperEPNS_17ValueMaterializerE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) removeAddrspaces at /source/src/llvm-remove-addrspaces.cpp:357 run at /source/src/llvm-remove-addrspaces.cpp:430 run at /source/src/llvm-remove-addrspaces.cpp:456 run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_6ModuleENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/src/pipeline.cpp:787 operator() at /source/src/jitlayers.cpp:1520 withModuleDo<(anonymous namespace)::sizedOptimizerT::operator()(llvm::orc::ThreadSafeModule) [with long unsigned int N = 4]:: > at /source/usr/include/llvm/ExecutionEngine/Orc/ThreadSafeModule.h:136 [inlined] operator() at /source/src/jitlayers.cpp:1480 [inlined] operator() at /source/src/jitlayers.cpp:1656 [inlined] addModule at /source/src/jitlayers.cpp:2129 jl_compile_codeinst_now at /source/src/jitlayers.cpp:688 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:882 jl_compile_method_internal at /source/src/gf.c:3652 _jl_invoke at /source/src/gf.c:4112 [inlined] ijl_apply_generic at /source/src/gf.c:4317 macro expansion at /home/pkgeval/.julia/packages/MathOptInterface/Q3V1z/src/Test/Test.jl:270 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:2244 [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 [inlined] test_moi_highs at /home/pkgeval/.julia/packages/ParametricOptInterface/csXJO/test/test_MathOptInterface.jl:316 unknown function (ip: 0x755bbfbdcb7f) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 macro expansion at /home/pkgeval/.julia/packages/ParametricOptInterface/csXJO/test/test_MathOptInterface.jl:22 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:2244 [inlined] runtests at /home/pkgeval/.julia/packages/ParametricOptInterface/csXJO/test/test_MathOptInterface.jl:22 unknown function (ip: 0x755bbfcd469f) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [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:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:765 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_61113.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 macro expansion at /home/pkgeval/.julia/packages/ParametricOptInterface/csXJO/test/runtests.jl:9 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:2325 [inlined] top-level scope at /home/pkgeval/.julia/packages/ParametricOptInterface/csXJO/test/runtests.jl:2349 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_invoke at /source/src/gf.c:4127 ijl_eval_thunk at /source/src/toplevel.c:757 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:324 IncludeInto at ./Base.jl:325 jfptr_IncludeInto_61113.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [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:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:765 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_32581.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x755be625b249) 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. Disabling --trace-compile ============================================================== ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_70078.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000072e02bf52590 Total snapshots: 418. Utilization: 0% ╎418 @Base/task.jl:1168 wait_forever() 417╎ 418 @Base/task.jl:1246 wait() [130] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/ParametricOptInterface/csXJO/test/test_MathOptInterface.jl:2444 unknown function (ip: 0x755be62cba51) at /lib/x86_64-linux-gnu/libc.so.6 unknown function (ip: 0x755be62cc3f1) at /lib/x86_64-linux-gnu/libc.so.6 realloc at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) _ZN4llvm15SmallVectorBaseIjE8grow_podEPvmm at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) PkgEval terminated after 2723.29s: test duration exceeded the time limit