Package evaluation of EAGO on Julia 1.13.0-DEV.868 (f2a8e18a98*) started at 2025-07-15T21:19:01.899 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 10.08s ################################################################################ # Installation # Installing EAGO... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [bb8be931] + EAGO v0.8.3 Updating `~/.julia/environments/v1.13/Manifest.toml` [79e6a3ab] + Adapt v4.3.0 [a9b6321e] + Atomix v1.1.1 [6e4b80f9] + BenchmarkTools v1.6.0 [96374032] + CRlibm v1.0.2 [7057c7e9] + Cassette v0.3.14 [9961bab8] + Cbc v1.2.0 [d360d2e6] + ChainRulesCore v1.25.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.0 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [bb8be931] + EAGO v0.8.3 [90fa49ef] + ErrorfreeArithmetic v0.5.2 [fa42c844] + FastRounding v0.3.1 ⌅ [f6369f11] + ForwardDiff v0.10.38 [46192b85] + GPUArraysCore v0.2.0 [076d061b] + HashArrayMappedTries v0.2.0 ⌅ [d1acc4aa] + IntervalArithmetic v0.20.9 ⌅ [15111844] + IntervalContractors v0.4.7 ⌅ [d2bf35a9] + IntervalRootFinding v0.5.11 [b6b21f68] + Ipopt v1.10.6 [92d709cd] + IrrationalConstants v0.2.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.26.0 [63c18a36] + KernelAbstractions v0.9.37 [b964fa9f] + LaTeXStrings v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 ⌅ [ee0a3090] + MINLPTests v0.5.6 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.42.0 [53c679d3] + McCormick v0.13.10 [d8a4904e] + MutableArithmetics v1.6.4 [872c559c] + NNlib v0.9.30 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 ⌅ [f27b6e38] + Polynomials v3.2.13 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [08abe8d2] + PrettyTables v2.4.0 [3cdcf5f2] + RecipesBase v1.3.4 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [5eaf0fd0] + RoundingEmulator v0.2.1 [7e506255] + ScopedValues v1.3.0 [3cc68bcd] + SetRounding v0.2.1 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [892a3eda] + StringManipulation v0.4.1 [856f2bd8] + StructTypes v1.11.0 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [013be700] + UnsafeAtomics v0.3.0 [ae81ac8f] + ASL_jll v0.1.3+0 [6e34b625] + Bzip2_jll v1.0.9+0 [4e9b3aee] + CRlibm_jll v1.0.1+0 [38041ee0] + Cbc_jll v200.1000.800+0 [3830e938] + Cgl_jll v0.6000.600+0 ⌅ [06985876] + Clp_jll v100.1700.700+1 ⌅ [be027038] + CoinUtils_jll v200.1100.600+0 [e33a78d0] + Hwloc_jll v2.12.1+0 [9cc047cb] + Ipopt_jll v300.1400.1701+0 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.800.0+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] + Osi_jll v0.10800.700+0 [319450e9] + SPRAL_jll v2025.5.20+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.14.1+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.5.20 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.65.0+0 [3f19e933] + p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.82s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 210.96s ################################################################################ # Testing # Testing EAGO Status `/tmp/jl_3vCZIn/Project.toml` [7057c7e9] Cassette v0.3.14 [9961bab8] Cbc v1.2.0 [864edb3b] DataStructures v0.18.22 [ffbed154] DocStringExtensions v0.9.5 [bb8be931] EAGO v0.8.3 [fa42c844] FastRounding v0.3.1 ⌅ [f6369f11] ForwardDiff v0.10.38 ⌅ [d1acc4aa] IntervalArithmetic v0.20.9 ⌅ [15111844] IntervalContractors v0.4.7 [b6b21f68] Ipopt v1.10.6 [4076af6c] JuMP v1.26.0 ⌅ [ee0a3090] MINLPTests v0.5.6 [b8f27783] MathOptInterface v1.42.0 [53c679d3] McCormick v0.13.10 [77ba4419] NaNMath v1.1.3 [08abe8d2] PrettyTables v2.4.0 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [276daf66] SpecialFunctions v2.5.1 [37e2e46d] LinearAlgebra v1.12.0 [de0858da] Printf v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_3vCZIn/Manifest.toml` [79e6a3ab] Adapt v4.3.0 [a9b6321e] Atomix v1.1.1 [6e4b80f9] BenchmarkTools v1.6.0 [96374032] CRlibm v1.0.2 [7057c7e9] Cassette v0.3.14 [9961bab8] Cbc v1.2.0 [d360d2e6] ChainRulesCore v1.25.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.0 [a8cc5b0e] Crayons v4.1.1 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [bb8be931] EAGO v0.8.3 [90fa49ef] ErrorfreeArithmetic v0.5.2 [fa42c844] FastRounding v0.3.1 ⌅ [f6369f11] ForwardDiff v0.10.38 [46192b85] GPUArraysCore v0.2.0 [076d061b] HashArrayMappedTries v0.2.0 ⌅ [d1acc4aa] IntervalArithmetic v0.20.9 ⌅ [15111844] IntervalContractors v0.4.7 ⌅ [d2bf35a9] IntervalRootFinding v0.5.11 [b6b21f68] Ipopt v1.10.6 [92d709cd] IrrationalConstants v0.2.4 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.26.0 [63c18a36] KernelAbstractions v0.9.37 [b964fa9f] LaTeXStrings v1.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 ⌅ [ee0a3090] MINLPTests v0.5.6 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.42.0 [53c679d3] McCormick v0.13.10 [d8a4904e] MutableArithmetics v1.6.4 [872c559c] NNlib v0.9.30 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 ⌅ [f27b6e38] Polynomials v3.2.13 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [08abe8d2] PrettyTables v2.4.0 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [5eaf0fd0] RoundingEmulator v0.2.1 [7e506255] ScopedValues v1.3.0 [3cc68bcd] SetRounding v0.2.1 [276daf66] SpecialFunctions v2.5.1 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [892a3eda] StringManipulation v0.4.1 [856f2bd8] StructTypes v1.11.0 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [013be700] UnsafeAtomics v0.3.0 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [4e9b3aee] CRlibm_jll v1.0.1+0 [38041ee0] Cbc_jll v200.1000.800+0 [3830e938] Cgl_jll v0.6000.600+0 ⌅ [06985876] Clp_jll v100.1700.700+1 ⌅ [be027038] CoinUtils_jll v200.1100.600+0 [e33a78d0] Hwloc_jll v2.12.1+0 [9cc047cb] Ipopt_jll v300.1400.1701+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.0+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] Osi_jll v0.10800.700+0 [319450e9] SPRAL_jll v2025.5.20+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.14.1+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... CHECK REVISED TESTS ┌ Warning: The exclude string "test_conic_linear_VectorAffineFunction" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_conic_linear_VectorAffineFunction$"` to exclude the exactly matching test, or `r"test_conic_linear_VectorAffineFunction.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/ugDMh/src/Test/Test.jl:239 ┌ Warning: The exclude string "test_linear_integration" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_linear_integration$"` to exclude the exactly matching test, or `r"test_linear_integration.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/ugDMh/src/Test/Test.jl:239 Optimal - objective value 0 Optimal objective 0 - 0 iterations time 0.002 Optimal - objective value 0 Optimal objective 0 - 0 iterations time 0.002 Presolve 0 (-9) rows, 0 (-4) columns and 0 (-15) elements Optimal - objective value 2 After Postsolve, objective 2, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 2 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-10) rows, 0 (-7) columns and 0 (-19) elements Optimal - objective value 4 After Postsolve, objective 4, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 4 - 0 iterations time 0.002, Presolve 0.00 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj 0 Primal inf 1.9999998 (2) 0 Obj 0 Primal inf 1.9999998 (2) Primal infeasible - objective value 0 PrimalInfeasible objective 0 - 0 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj 0 Primal inf 0.9999999 (1) Primal infeasible - objective value 0 PrimalInfeasible objective 0 - 0 iterations time 0.002 Presolve 0 (-2) rows, 0 (-3) columns and 0 (-5) elements Optimal - objective value -11 After Postsolve, objective -11, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -11 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-3) rows, 0 (-4) columns and 0 (-5) elements Optimal - objective value -82 After Postsolve, objective -82, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -82 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value 0.5 After Postsolve, objective 0.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0.5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value 0.5 After Postsolve, objective 0.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0.5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-1) columns and 0 (-2) elements Optimal - objective value -6 After Postsolve, objective -6, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -6 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -0.5 After Postsolve, objective -0.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -0.5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -0.5 After Postsolve, objective -0.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -0.5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -0.5 After Postsolve, objective -0.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -0.5 - 0 iterations time 0.002, Presolve 0.00 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/stack_management.jl:255 ****************************************************************************** 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 ****************************************************************************** ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/stack_management.jl:255 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj -5.5 Primal inf 1.0999999 (1) Dual inf 2.1999999 (1) 1 Obj -3.08 Primal inf 1.0999999 (1) Primal infeasible - objective value -3.08 PrimalInfeasible objective -3.08 - 1 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj -5.5 Primal inf 1.0999999 (1) Dual inf 2.1999999 (1) 1 Obj -3.08 Primal inf 1.0999999 (1) Primal infeasible - objective value -3.08 PrimalInfeasible objective -3.08 - 1 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj 5.5 Primal inf 1.0999999 (1) Primal infeasible - objective value 5.5 PrimalInfeasible objective 5.5 - 0 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj 5.5 Primal inf 1.0999999 (1) Primal infeasible - objective value 5.5 PrimalInfeasible objective 5.5 - 0 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj -3.08 Primal inf 1.0999999 (1) Primal infeasible - objective value -3.08 PrimalInfeasible objective -3.08 - 0 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj -3.08 Primal inf 1.0999999 (1) Primal infeasible - objective value -3.08 PrimalInfeasible objective -3.08 - 0 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj 3.08 Primal inf 1.0999999 (1) Dual inf 2.1999999 (1) 1 Obj 5.5 Primal inf 1.0999999 (1) Primal infeasible - objective value 5.5 PrimalInfeasible objective 5.5 - 1 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj 3.08 Primal inf 1.0999999 (1) Dual inf 2.1999999 (1) 1 Obj 5.5 Primal inf 1.0999999 (1) Primal infeasible - objective value 5.5 PrimalInfeasible objective 5.5 - 1 iterations time 0.002 Presolve thinks problem is unbounded Analysis indicates model infeasible or unbounded 0 Obj 0 Dual inf 1.9999998 (2) 1 Obj -1.5e+10 1 Obj -7.5e+10 Dual infeasible - objective value -7.5e+10 DualInfeasible objective -7.5e+10 - 1 iterations time 0.002 Presolve thinks problem is unbounded Analysis indicates model infeasible or unbounded 0 Obj 0 Dual inf 1.9999998 (2) 0 Obj -1e+11 0 Obj -5e+11 0 Obj -2.5e+12 0 Obj -1.25e+13 0 Obj -6.25e+13 Dual infeasible - objective value -6.25e+13 DualInfeasible objective -6.25e+13 - 0 iterations time 0.002 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-4) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-4) rows, 0 (-2) columns and 0 (-4) elements Optimal - objective value -5 After Postsolve, objective -5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-4) rows, 0 (-2) columns and 0 (-4) elements Optimal - objective value -5 After Postsolve, objective -5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-4) rows, 0 (-2) columns and 0 (-4) elements Optimal - objective value -5 After Postsolve, objective -5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-4) rows, 0 (-2) columns and 0 (-4) elements Optimal - objective value -5 After Postsolve, objective -5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -5 - 0 iterations time 0.002, Presolve 0.00 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj 0 Primal inf 0.9999999 (1) Primal infeasible - objective value 0 PrimalInfeasible objective 0 - 0 iterations time 0.002 Presolve determined that the problem was infeasible with tolerance of 1e-08 Analysis indicates model infeasible or unbounded 0 Obj 0 Primal inf 2.3333332 (1) Primal infeasible - objective value 2.3333333e-18 PrimalInfeasible objective 2.333333333e-18 - 1 iterations time 0.002 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-4) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 100 After Postsolve, objective 100, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 100 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 200 After Postsolve, objective 200, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 200 - 0 iterations time 0.002, Presolve 0.00 Optimal - objective value -5 Optimal objective -5 - 0 iterations time 0.002 Presolve 0 (-1) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value -2 After Postsolve, objective -2, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -2 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 100 After Postsolve, objective 100, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 100 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 200 After Postsolve, objective 200, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 200 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 3 (0) rows, 2 (0) columns and 6 (0) elements 0 Obj -30000 Dual inf 1350 (2) 2 Obj -71818.182 Optimal - objective value -71818.182 Optimal objective -71818.18182 - 2 iterations time 0.002 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-4) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value 3 After Postsolve, objective 3, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 3 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 100 After Postsolve, objective 100, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 100 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 200 After Postsolve, objective 200, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 200 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-3) columns and 0 (-2) elements Optimal - objective value -3 After Postsolve, objective -3, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -3 - 0 iterations time 0.002, Presolve 0.00 Presolve 1 (-1) rows, 2 (0) columns and 2 (-2) elements 0 Obj 0 Primal inf 1.999999 (1) Dual inf 0.019998 (2) w.o. free dual inf (0) 1 Obj 2 Optimal - objective value 2 After Postsolve, objective 2, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 2 - 1 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-4) elements Optimal - objective value 1 After Postsolve, objective 1, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 1 - 0 iterations time 0.002, Presolve 0.00 Optimal - objective value -3 Optimal objective -3 - 0 iterations time 0.002 Optimal - objective value -1 Optimal objective -1 - 0 iterations time 0.002 Optimal - objective value -3 Optimal objective -3 - 0 iterations time 0.002 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -1 After Postsolve, objective -1, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -1 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -0.5 After Postsolve, objective -0.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -0.5 - 0 iterations time 0.002, Presolve 0.00 Optimal - objective value -1 Optimal objective -1 - 0 iterations time 0.002 Optimal - objective value -1 Optimal objective -1 - 0 iterations time 0.002 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value -2.5 After Postsolve, objective -2.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -2.5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value -2.5 After Postsolve, objective -2.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -2.5 - 0 iterations time 0.002, Presolve 0.00 Optimal - objective value 1 Optimal objective 1 - 0 iterations time 0.002 Optimal - objective value 6 Optimal objective 6 - 0 iterations time 0.002 Optimal - objective value 2 Optimal objective 2 - 0 iterations time 0.002 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -1 After Postsolve, objective -1, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -1 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -0.5 After Postsolve, objective -0.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -0.5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 0 After Postsolve, objective 0, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 0 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-2) columns and 0 (-2) elements Optimal - objective value 2.5 After Postsolve, objective 2.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 2.5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-1) columns and 0 (-2) elements Optimal - objective value -0.5 After Postsolve, objective -0.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -0.5 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-2) rows, 0 (-1) columns and 0 (-2) elements Optimal - objective value -0.25 After Postsolve, objective -0.25, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -0.25 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -1 After Postsolve, objective -1, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -1 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-1) rows, 0 (-1) columns and 0 (-1) elements Optimal - objective value -2 After Postsolve, objective -2, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -2 - 0 iterations time 0.002, Presolve 0.00 Optimal - objective value -1 Optimal objective -1 - 0 iterations time 0.002 Optimal - objective value -2 Optimal objective -2 - 0 iterations time 0.002 Optimal - objective value -1 Optimal objective -1 - 0 iterations time 0.002 Optimal - objective value 2 Optimal objective 2 - 0 iterations time 0.002 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/stack_management.jl:255 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 87 running 1 of 1 signal (10): User defined signal 1 _ZNK4llvm19MachineRegisterInfo14clearKillFlagsENS_8RegisterE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN12_GLOBAL__N_114MachineCSEImpl15ProcessBlockCSEEPN4llvm17MachineBasicBlockE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN12_GLOBAL__N_114MachineCSEImpl10PerformCSEEPN4llvm15DomTreeNodeBaseINS1_17MachineBasicBlockEEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN12_GLOBAL__N_114MachineCSEImpl3runERN4llvm15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN12_GLOBAL__N_116MachineCSELegacy20runOnMachineFunctionERN4llvm15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm19MachineFunctionPass13runOnFunctionERNS_8FunctionE.part.0 at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm13FPPassManager13runOnFunctionERNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm13FPPassManager11runOnModuleERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm6legacy15PassManagerImpl3runERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm3orc14SimpleCompilerclERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) operator() at /source/src/jitlayers.cpp:1620 addModule at /source/src/jitlayers.cpp:2101 jl_compile_codeinst_now at /source/src/jitlayers.cpp:683 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:883 jl_compile_method_internal at /source/src/gf.c:3305 _jl_invoke at /source/src/gf.c:3785 [inlined] ijl_apply_generic at /source/src/gf.c:3993 relax_all_constraints! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/lower_problem.jl:194 relax_constraints! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/lower_problem.jl:203 [inlined] relax_constraints! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/lower_problem.jl:204 [inlined] relax_problem! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/lower_problem.jl:223 obbt! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/domain_reduction.jl:255 preprocess! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/lower_problem.jl:324 preprocess! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/nonconvex/lower_problem.jl:333 [inlined] macro expansion at ./timing.jl:461 [inlined] global_solve! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/optimize_nonconvex.jl:396 optimize! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/optimize_nonconvex.jl:493 [inlined] optimize! at /home/pkgeval/.julia/packages/EAGO/WUXx0/src/eago_optimizer/optimize/optimize.jl:40 optimize! at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/MathOptInterface.jl:122 optimize! at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Utilities/cachingoptimizer.jl:370 optimize! at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Bridges/bridge_optimizer.jl:367 [inlined] test_nonlinear_expression_hs071 at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Test/test_nonlinear.jl:1219 unknown function (ip: 0x73bfeeb525c6) at (unknown file) _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 macro expansion at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Test/Test.jl:270 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:1858 [inlined] #runtests#2 at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Test/Test.jl:265 runtests at /home/pkgeval/.julia/packages/MathOptInterface/ugDMh/src/Test/Test.jl:223 [inlined] test_runtests at /home/pkgeval/.julia/packages/EAGO/WUXx0/test/moit_tests.jl:43 unknown function (ip: 0x73c049fa7f7f) at (unknown file) _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 macro expansion at /home/pkgeval/.julia/packages/EAGO/WUXx0/test/moit_tests.jl:21 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:1858 [inlined] runtests at /home/pkgeval/.julia/packages/EAGO/WUXx0/test/moit_tests.jl:21 unknown function (ip: 0x73c049f2e22f) at (unknown file) _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 jl_apply at /source/src/julia.h:2345 [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:708 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:899 jl_toplevel_eval_flex at /source/src/toplevel.c:773 jl_toplevel_eval_flex at /source/src/toplevel.c:713 ijl_toplevel_eval at /source/src/toplevel.c:785 ijl_toplevel_eval_in at /source/src/toplevel.c:830 eval at ./boot.jl:489 include_string at ./loading.jl:2848 _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 _include at ./loading.jl:2908 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_72331.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 jl_apply at /source/src/julia.h:2345 [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:708 jl_interpret_toplevel_thunk at /source/src/interpreter.c:899 jl_toplevel_eval_flex at /source/src/toplevel.c:773 jl_toplevel_eval_flex at /source/src/toplevel.c:713 ijl_toplevel_eval at /source/src/toplevel.c:785 ijl_toplevel_eval_in at /source/src/toplevel.c:830 eval at ./boot.jl:489 include_string at ./loading.jl:2848 _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 _include at ./loading.jl:2908 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_72331.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 jl_apply at /source/src/julia.h:2345 [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:708 jl_interpret_toplevel_thunk at /source/src/interpreter.c:899 jl_toplevel_eval_flex at /source/src/toplevel.c:773 jl_toplevel_eval_flex at /source/src/toplevel.c:713 ijl_toplevel_eval at /source/src/toplevel.c:785 ijl_toplevel_eval_in at /source/src/toplevel.c:830 eval at ./boot.jl:489 exec_options at ./client.jl:286 _start at ./client.jl:553 jfptr__start_60077.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 jl_apply at /source/src/julia.h:2345 [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: 0x73c04bba4249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1192 wait_forever at ./task.jl:1129 jfptr_wait_forever_57010.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3793 [inlined] ijl_apply_generic at /source/src/gf.c:3993 jl_apply at /source/src/julia.h:2345 [inlined] start_task at /source/src/task.c:1249 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.13/Profile/src/Profile.jl:1362 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000078184ce9d4b0 Total snapshots: 435. Utilization: 0% ╎435 @Base/task.jl:1129 wait_forever() 434╎ 435 @Base/task.jl:1192 wait() [87] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/EAGO/WUXx0/test/moit_tests.jl:107 PkgEval terminated after 2723.51s: test duration exceeded the time limit