Package evaluation of EAGO on Julia 1.10.9 (96dc2d8c45*) started at 2025-06-06T19:46:11.959 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 4.99s ################################################################################ # Installation # Installing EAGO... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [bb8be931] + EAGO v0.8.3 Updating `~/.julia/environments/v1.10/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.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.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.4 [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.34 [b964fa9f] + LaTeXStrings v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 ⌅ [ee0a3090] + MINLPTests v0.5.6 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.40.2 [53c679d3] + McCormick v0.13.9 [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.2.1 [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 [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.24+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.1 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [f43a241f] + Downloads v1.6.0 [7b1f6079] + FileWatching [b77e0a4c] + InteractiveUtils [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [ca575930] + NetworkOptions v1.2.0 [44cfe95a] + Pkg v1.10.0 [de0858da] + Printf [9abbd945] + Profile [3fa0cd96] + REPL [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [6462fe0b] + Sockets [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] + LibCURL_jll v8.4.0+0 [e37daf67] + LibGit2_jll v1.6.4+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.2+1 [14a3606d] + MozillaCACerts_jll v2023.1.10 [4536629a] + OpenBLAS_jll v0.3.23+4 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 [8e850ede] + nghttp2_jll v1.52.0+1 [3f19e933] + p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 9.51s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 86.57s ################################################################################ # Testing # Testing EAGO Status `/tmp/jl_tCy9HS/Project.toml` [7057c7e9] Cassette v0.3.14 [9961bab8] Cbc v1.2.0 [864edb3b] DataStructures v0.18.22 [ffbed154] DocStringExtensions v0.9.4 [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.40.2 [53c679d3] McCormick v0.13.9 [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 [de0858da] Printf [2f01184e] SparseArrays v1.10.0 [8dfed614] Test Status `/tmp/jl_tCy9HS/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.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.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.4 [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.34 [b964fa9f] LaTeXStrings v1.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 ⌅ [ee0a3090] MINLPTests v0.5.6 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.40.2 [53c679d3] McCormick v0.13.9 [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.2.1 [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 [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.24+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.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [b77e0a4c] InteractiveUtils [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [4536629a] OpenBLAS_jll v0.3.23+4 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... 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/pjTDD/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/pjTDD/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 ┌ 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 ┌ 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 ┌ 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 ┌ 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 Optimal - objective value 1 Optimal objective 1 - 0 iterations time 0.002 Optimal - objective value 0 Optimal objective 0 - 0 iterations time 0.002 Optimal - objective value 1 Optimal objective 1 - 0 iterations time 0.002 Optimal - objective value 0 Optimal objective 0 - 0 iterations time 0.002 Optimal - objective value 2 Optimal objective 2 - 0 iterations time 0.002 Optimal - objective value 3 Optimal objective 3 - 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 ┌ 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 ┌ 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 ┌ 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 ┌ 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 ┌ 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 ┌ 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 ┌ 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 Optimal - objective value -3 Optimal objective -3 - 0 iterations time 0.002 Optimal - objective value 3 Optimal objective 3 - 0 iterations time 0.002 Presolve 2 (-4) rows, 3 (-8) columns and 6 (-19) elements 0 Obj 0.2 Primal inf 0.999999 (1) 2 Obj 1.45 Optimal - objective value 1.45 After Postsolve, objective 1.45, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 1.45 - 2 iterations time 0.002, Presolve 0.00 Dual infeasible - objective value 0 DualInfeasible objective 0 - 0 iterations time 0.002 Optimal - objective value 1 Optimal objective 1 - 0 iterations time 0.002 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 thinks problem is unbounded Analysis indicates model infeasible or unbounded 0 Obj 0 Primal inf 1.0999999 (1) Dual inf 0.0219999 (1) w.o. free dual inf (0) 1 Obj -1.8615385 Dual inf 1.6923076 (1) 1 Obj -8.4615385e+10 Dual infeasible - objective value -8.4615385e+10 DualInfeasible objective -8.461538462e+10 - 1 iterations time 0.002 Presolve thinks problem is unbounded Analysis indicates model infeasible or unbounded 0 Obj 0 Primal inf 1.0999999 (1) Dual inf 0.0219999 (1) w.o. free dual inf (0) 1 Obj -1.8615385 Dual inf 1.6923076 (1) 1 Obj -8.4615385e+10 Dual infeasible - objective value -8.4615385e+10 DualInfeasible objective -8.461538462e+10 - 1 iterations time 0.002 Presolve thinks problem is unbounded Analysis indicates model infeasible or unbounded 0 Obj 0 Dual inf 0.0219999 (1) w.o. free dual inf (0) 0 Obj 0 Dual inf 0.0219999 (1) w.o. free dual inf (0) 0 Obj 0 Dual inf 0.0219999 (1) w.o. free dual inf (0) Dual infeasible - objective value 0 DualInfeasible objective 0 - 0 iterations time 0.002 Presolve thinks problem is unbounded Analysis indicates model infeasible or unbounded 0 Obj 0 Dual inf 0.0219999 (1) w.o. free dual inf (0) 0 Obj 0 Dual inf 0.0219999 (1) w.o. free dual inf (0) 0 Obj 0 Dual inf 0.0219999 (1) w.o. free dual inf (0) Dual infeasible - objective value 0 DualInfeasible objective 0 - 0 iterations time 0.002 Optimal - objective value 2 Optimal objective 2 - 0 iterations time 0.002 Test Summary: | Pass Total Time MOI | 3693 3693 27m33.2s 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 23 | 0 | -1.833E+00 | -1.832E+00 | 1.334E-03 | 7.276E-04 | 0.89 | 3599.11 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 15 Lower Bound: 1.8320685101323373 Upper Bound: 1.8334024336163197 Solution: x = 3.2565120003774353 y = 2.0131473323323674 ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 23 | 0 | -4.975E+00 | -4.974E+00 | 1.334E-03 | 2.681E-04 | 0.53 | 3599.47 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 15 Lower Bound: 4.973661163690714 Upper Bound: 4.974995087206215 Solution: x = 3.2565120003774357 y = 2.013147332332369 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 17 | 0 | -3.261E+00 | -3.257E+00 | 4.862E-03 | 1.491E-03 | 0.29 | 3599.71 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 13 Lower Bound: 3.256502483040429 Upper Bound: 3.2613643256740703 Solution: x = 3.2565124830729943 y = 2.0131482333436583 ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 23 | 0 | -3.261E+00 | -3.257E+00 | 4.862E-03 | 1.491E-03 | 0.46 | 3599.54 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 17 Lower Bound: 3.2565023921496734 Upper Bound: 3.2613643356740702 Solution: x = 3.256512483077063 y = 2.0131482333471307 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 23 | 0 | -1.262E+01 | -1.262E+01 | 2.810E-03 | 2.226E-04 | 0.40 | 3599.60 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 13 Lower Bound: 12.618013035979208 Upper Bound: 12.620822855886281 Solution: x = 3.2565126422059785 y = 2.0131485381572967 ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 31 | 0 | -1.262E+01 | -1.262E+01 | 2.810E-03 | 2.226E-04 | 0.89 | 3599.11 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 17 Lower Bound: 12.61801303599034 Upper Bound: 12.620822855885013 Solution: x = 3.2565126422068835 y = 2.0131485381586707 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 17 | 0 | -6.403E+00 | -6.398E+00 | 4.862E-03 | 7.593E-04 | 0.31 | 3599.69 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 13 Lower Bound: 6.398095136598807 Upper Bound: 6.402956979263863 Solution: x = 3.2565124830729943 y = 2.0131482333436583 Test Summary: | Pass Total Time nlp | 35 35 12.9s Test Summary: |Time nlp-cvx | None 0.0s Test Summary: |Time nlp-mi | None 0.0s Test Summary: | Pass Total Time Test Stack Management Functions | 11 11 0.6s Test Summary: | Pass Total Time Test B&B Checks | 11 11 0.1s Test Summary: | Pass Total Time Node Access Functions | 18 18 0.7s Test Summary: | Pass Total Time Duality-Based Bound Tightening | 8 8 0.0s Test Summary: | Pass Total Time MOI Utilities | 2 2 0.0s Test Summary: | Pass Total Time Set/Get Attributes | 10 10 0.1s Test Summary: | Pass Total Time Get Termination Code | 2 2 0.0s Test Summary: | Pass Total Time Add Variable, Get Number/Index | 5 5 0.3s Test Summary: | Pass Total Time Variable Bounds | 21 21 0.9s Test Summary: | Pass Total Time Add Linear Constraint | 21 21 0.3s Test Summary: | Pass Total Time Add Quadratic Constraint | 24 24 0.3s Test Summary: | Pass Total Time Set Objective | 9 9 0.1s Test Summary: | Pass Total Time Empty/Isempty, EAGO Model, Single Storage, Optimize Hook | 6 6 0.2s Presolve 0 (-3) rows, 0 (-2) columns and 0 (-5) 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 (-3) rows, 0 (-3) columns and 0 (-5) 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 (-4) rows, 0 (-4) columns and 0 (-8) elements Optimal - objective value -10 After Postsolve, objective -10, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -10 - 0 iterations time 0.002, Presolve 0.00 Presolve 0 (-3) rows, 0 (-4) columns and 0 (-5) 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 Test Summary: | Pass Total Time LP Problems | 20 20 1.8s Presolve 2 (-2) rows, 2 (-2) columns and 4 (-4) elements 0 Obj 0 Dual inf 1.999999 (1) 2 Obj -2.4285714 Optimal - objective value -2.4285714 After Postsolve, objective -2.4285714, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective -2.428571429 - 2 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 Test Summary: | Pass Total Time NLP Problem #1 | 5 5 2.3s ┌ 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 Test Summary: | Pass Total Time NLP Problem #2 | 3 3 8.4s ┌ 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 Test Summary: | Pass Total Time NLP Problem #3 | 1 1 1.4s ┌ 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 Test Summary: | Pass Total Time NLP Problem #4 | 3 3 0.4s Test Summary: | Pass Total Time NLP Problem #5 | 1 1 5.8s Test Summary: | Pass Total Time NLP Problem #6 | 1 1 1.2s ┌ 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 Test Summary: | Pass Total Time NLP Problem #7 | 1 1 0.2s ┌ 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 Test Summary: | Pass Total Time NLP Problem #8 | 1 1 0.2s Test Summary: | Pass Total Time Register Special Expressions | 56 56 7.4s Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Empty Stack: Infeasible No Solution Found Node Limit Exceeded Best Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Iteration Limit Exceeded Best Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Relative Tolerance Achieved Optimal Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Absolute Tolerance Achieved Optimal Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Time Limit Exceeded Best Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Best Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf ----------------------------------------------------------------------------------------------------------------- ----------------------------- Display Test ----------------------------- Minimize ScalarAffineFunction{Float64}: 0.0 Subject to: ----------------------------- Test Summary: | Pass Total Time Display Testset | 14 14 1.2s Test Summary: | Pass Total Time Test Trace Script | 49 49 4.4s ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 51 | 0 | -1.999E-01 | -1.875E-01 | 1.240E-02 | 6.202E-02 | 3.44 | 3596.56 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 13 Lower Bound: -0.19988424635014404 Upper Bound: -0.18748812501738765 Solution: v[1] = -0.7499993848952848 v[2] = -7.860564102257386e-8 solved LowerProblem : -0.18748812501738765 [-0.7499993848952848, -7.860564102257386e-8] true ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 9 | 0 | -1.004E+00 | -1.000E+00 | 4.449E-03 | 4.429E-03 | 0.57 | 3599.43 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 7 Lower Bound: 0.9999797851758352 Upper Bound: 1.0044286805511826 Solution: v[1] = 0.0005437832539476207 solved LowerLevel1(1) : 0.9999797851758352 [0.0005437832539476207] true ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 51 | 0 | -1.999E-01 | -1.875E-01 | 1.240E-02 | 6.202E-02 | 1.33 | 3598.67 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 13 Lower Bound: -0.19988424635014404 Upper Bound: -0.18748812501738765 Solution: v[1] = -0.7499993848952848 v[2] = -7.860564102257386e-8 solved UpperProblem : -0.18748812501738765 [-0.7499993848952848, -7.860564102257386e-8] true ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 9 | 0 | -1.004E+00 | -1.000E+00 | 4.449E-03 | 4.429E-03 | 0.29 | 3599.71 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 7 Lower Bound: 0.9999797851758352 Upper Bound: 1.0044286805511826 Solution: v[1] = 0.0005437832539476207 solved LowerLevel2(1) : 0.9999797851758352 [0.0005437832539476207] true FINISHED ONE ITERATION | Iteration | Lower Bound | Upper Bound | r | Gap | Ratio | | 1 | -0.187488 | Inf | 5.0 | Inf | NaN | ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 91 | 0 | 1.929E-01 | 1.945E-01 | 1.579E-03 | 8.120E-03 | 14.33 | 3585.67 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 13 Lower Bound: 0.19289868830105728 Upper Bound: 0.19447789460824574 Solution: v[1] = -0.7500004903738665 v[2] = -0.6180339391629595 solved LowerProblem : 0.19447789460824574 [-0.7500004903738665, -0.6180339391629595] true ┌ 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 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 9 | 0 | -4.292E-03 | 1.003E-05 | 4.302E-03 | 1.002E+00 | 0.33 | 3599.67 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 7 Lower Bound: -1.0025340778137816e-5 Upper Bound: 0.004291709215193959 Solution: v[1] = 0.0005441324091978453 solved LowerLevel1(1) : -1.0025340778137816e-5 [0.0005441324091978453] true Test Summary: | Pass Total Time SIP Res | 4 4 28.7s Testing EAGO tests passed Testing completed after 1749.44s PkgEval succeeded after 1874.6s