Package evaluation of BilevelJuMP on Julia 1.11.4 (a71dd056e0*) started at 2025-04-08T12:56:58.015 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.92s ################################################################################ # Installation # Installing BilevelJuMP... Resolving package versions... Updating `~/.julia/environments/v1.11/Project.toml` [485130c0] + BilevelJuMP v0.6.2 Updating `~/.julia/environments/v1.11/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.0 [485130c0] + BilevelJuMP v0.6.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.4 [191a621a] + Dualization v0.5.9 [f6369f11] + ForwardDiff v1.0.1 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.2 [4076af6c] + JuMP v1.25.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.38.1 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.0 [69de0a69] + Parsers v2.8.1 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [189a3867] + Reexport v1.2.2 [276daf66] + SpecialFunctions v2.5.0 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.11.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.11.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [4536629a] + OpenBLAS_jll v0.3.27+1 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.7.0+0 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.51s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 57.65s ################################################################################ # Testing # Testing BilevelJuMP Status `/tmp/jl_ULpF3V/Project.toml` [485130c0] BilevelJuMP v0.6.2 [191a621a] Dualization v0.5.9 ⌅ [b6b21f68] Ipopt v1.0.2 [4076af6c] JuMP v1.25.0 [b8f27783] MathOptInterface v1.38.1 [014a38d5] QuadraticToBinary v0.4.0 ⌅ [118347d2] MibS_jll v1.1.3+0 [44cfe95a] Pkg v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_ULpF3V/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.0 [485130c0] BilevelJuMP v0.6.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.4 [191a621a] Dualization v0.5.9 [f6369f11] ForwardDiff v1.0.1 ⌅ [b6b21f68] Ipopt v1.0.2 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.2 [4076af6c] JuMP v1.25.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.38.1 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.0 [69de0a69] Parsers v2.8.1 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [014a38d5] QuadraticToBinary v0.4.0 [189a3867] Reexport v1.2.2 [276daf66] SpecialFunctions v2.5.0 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [6a88e26e] ALPS_jll v100.500.702+0 [ae81ac8f] ASL_jll v0.1.3+0 [7196b6e2] BiCePS_jll v0.9400.400+0 [6e34b625] Bzip2_jll v1.0.9+0 [33c101cd] CHiPPS_BLIS_jll v0.9400.802+0 ⌃ [38041ee0] Cbc_jll v200.1000.501+0 ⌅ [3830e938] Cgl_jll v0.6000.300+0 ⌅ [06985876] Clp_jll v100.1700.601+0 ⌅ [be027038] CoinUtils_jll v200.1100.400+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.400+0 ⌅ [d00139f3] METIS_jll v5.1.1+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v5.4.1+0 ⌅ [118347d2] MibS_jll v1.1.3+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] Osi_jll v0.10800.600+0 ⌃ [fad677ff] SYMPHONY_jll v500.600.1700+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.11.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.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.1.1+0 [deac9b47] LibCURL_jll v8.6.0+0 [e37daf67] LibGit2_jll v1.7.2+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.6+0 [14a3606d] MozillaCACerts_jll v2023.12.12 [4536629a] OpenBLAS_jll v0.3.27+1 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.7.0+0 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.59.0+0 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... Precompiling Ipopt... 1385.7 ms ✓ METIS_jll 1446.4 ms ✓ MUMPS_seq_jll 1488.6 ms ✓ Ipopt_jll 5862.5 ms ✓ Ipopt 4 dependencies successfully precompiled in 11 seconds. 66 already precompiled. Resolving package versions... Installed SCIP ─ v0.11.14 Updating `/tmp/jl_ULpF3V/Project.toml` ⌃ [82193955] + SCIP v0.11.14 Updating `/tmp/jl_ULpF3V/Manifest.toml` ⌃ [82193955] + SCIP v0.11.14 [68e3532b] + Ncurses_jll v6.5.1+0 [05236dd9] + Readline_jll v8.2.13+0 ⌅ [fc9abe76] + SCIP_PaPILO_jll v800.0.301+0 ⌅ [e5ac4fe4] + SCIP_jll v800.0.301+0 [508c9074] + bliss_jll v0.77.0+1 ⌅ [28df3c45] + boost_jll v1.76.0+1 ⌅ [1317d2d5] + oneTBB_jll v2021.12.0+0 [781609d7] + GMP_jll v6.3.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Building SCIP → `~/.julia/scratchspaces/44cfe95a-1eb2-52ea-b672-e2afdf69b78f/3d6a6516d6940a93b732e8ec7127652a0ead89c6/build.log` Precompiling SCIP... 1577.6 ms ✓ SCIP_PaPILO_jll 1553.6 ms ✓ SCIP_jll 15324.1 ms ✓ SCIP 3 dependencies successfully precompiled in 19 seconds. 75 already precompiled. Precompiling QuadraticToBinary... 5615.8 ms ✓ QuadraticToBinary 1 dependency successfully precompiled in 6 seconds. 50 already precompiled. Precompiling MibS_jll... 1412.4 ms ✓ CoinUtils_jll 1417.7 ms ✓ Osi_jll 1511.8 ms ✓ Clp_jll 1452.1 ms ✓ Cgl_jll 1497.4 ms ✓ ALPS_jll 1495.6 ms ✓ SYMPHONY_jll 1566.1 ms ✓ Cbc_jll 1519.3 ms ✓ BiCePS_jll 1478.5 ms ✓ CHiPPS_BLIS_jll 1559.7 ms ✓ MibS_jll 10 dependencies successfully precompiled in 15 seconds. 30 already precompiled. mps_filename = "/tmp/jl_KqYdjh/model.mps" NAME ROWS N OBJ L u1 L u2 L c3_1 L c4 L c5 G u3 G u4 G c3 COLUMNS MARKER 'MARKER' 'INTORG' y u2 1 y c3_1 1 y c4 1 y c5 -7 y u3 1 y c3 1 y OBJ 1 z u4 1 z OBJ 1 x u1 1 x c3_1 1 x c4 2 x c5 2 x c3 4 x OBJ 3 MARKER 'MARKER' 'INTEND' RHS rhs u1 5 rhs u2 8 rhs c3_1 8 rhs c4 13 rhs c5 0 rhs u3 0 rhs u4 0 rhs c3 8 RANGES BOUNDS FR bounds y FR bounds z FR bounds x ENDATA aux_filename = "/tmp/jl_KqYdjh/model.aux" N 1 M 4 LC 2 LR 7 LR 2 LR 3 LR 4 LO -1.0 OS 1 ┌ Warning: mibs() is deprecated, use the non-do-block form │ caller = ip:0x0 └ @ Core :-1 mps_filename = "/tmp/jl_WMYpk4/model.mps" NAME ROWS N OBJ L u1 L u2 L c3_1 L c4 L c5 G u3 G u4 G c3 COLUMNS MARKER 'MARKER' 'INTORG' y u2 1 y c3_1 1 y c4 1 y c5 -7 y u3 1 y c3 1 y OBJ 1 z u4 1 z OBJ 1 x u1 1 x c3_1 1 x c4 2 x c5 2 x c3 4 x OBJ 3 MARKER 'MARKER' 'INTEND' RHS rhs u1 5 rhs u2 8 rhs c3_1 8 rhs c4 13 rhs c5 0 rhs u3 0 rhs u4 0 rhs c3 8 RANGES BOUNDS FR bounds y FR bounds z FR bounds x ENDATA aux_filename = "/tmp/jl_WMYpk4/model.aux" N 1 M 4 LC 2 LR 7 LR 2 LR 3 LR 4 LO -1.0 OS 1 ======================================================== ======================================================== Welcome to MibS (Mixed Integer Bilevel Solver) Copyright (C) 2007-2019 Lehigh University, Scott DeNegre, Ted Ralphs and Sahar Tahernejad. All Rights Reserved. This software is licensed under the Eclipse Public License. Please see accompanying file for terms. Version: 1.1.3 Build Date: Jun 18 2021 ======================================================== ======================================================== == Welcome to the Abstract Library for Parallel Search (ALPS) == Copyright 2000-2019 Lehigh University and others == All Rights Reserved. == Distributed under the Eclipse Public License 1.0 == Version: 1.5 == Build Date: Dec 4 2021 Alps0030I Data file: /tmp/jl_WMYpk4/model.mps Coin0001I At line 1 NAME Coin0001I At line 2 ROWS Coin0001I At line 12 COLUMNS Coin0001I At line 30 RHS Coin0001I At line 39 RANGES Coin0001I At line 40 BOUNDS Coin0001I At line 44 ENDATA Coin0002I Problem no_name has 8 rows, 3 columns and 12 elements LL Data File: /tmp/jl_WMYpk4/model.aux Number of LL Variables: 1 ======================================= Analyzing problem structure ======================================= Number of UL Variables: 2 Number of LL Variables: 1 Number of UL Rows: 4 Number of LL Rows: 4 Number of integer UL Variables: 2 Number of integer LL Variables: 1 This instance is a pure integer problem. Coefficient matrix of lower level variables in upper level problem is non-negative. ======================================= Setting parameters ======================================= Default branching strategy is MibSBranchingStrategyFractional. Pure integer cut generator is on. solveSecondLevelWhenXYVarsInt is set. solveSecondLevelWhenLVarsFixed is set. computeBestUBWhenLVarsFixed is set. Linking solution pool will be used. == Bcps Version: 0.94.4 == Blis Version: Trunk (unstable) Blis0043I Objective coefficients are multiples of 1 Alps0250I Starting search ... Nodes Done Upper Bound Lower Bound Gap Time Nodes Left 0 6.13333 0 1 4 8 6.25 24.14% 0 1 Alps0208I Search completed. Alps0260I Best solution found had quality 8 Alps0264I Number of nodes processed: 5 Alps0267I Number of nodes branched: 2 Alps0268I Number of nodes pruned before processing: 0 Alps0270I Number of nodes left: 0 Alps0272I Tree depth: 2 Alps0274I Search CPU time: 0.00 seconds Alps0278I Search wall-clock time: 0.01 seconds Blis0040I Checking feasibility took 0.0033 seconds Blis0053I Called MIBS cut generator 6 times, generated 4 cuts, CPU time 0.0001 seconds, current strategy 3 Blis0063I Called Rounding heuristic 12 times, found 0 solutions, CPU time 0.0000 seconds, current strategy 2 Blis0058I Relative optimality gap is 0.00% ============================================ Optimal solution: Cost = 8 x[0] = 8 Number of problems (VF) solved = 4 Number of problems (UB) solved = 0 Time for solving problem (VF) = 0.00251722 Time for solving problem (UB) = 0 ============================================ ****************************************************************************** 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 ****************************************************************************** nlp: Test Failed at /home/pkgeval/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:27 Expression: termination_status(model) in [MOI.OPTIMAL, MOI.LOCALLY_SOLVED] Evaluated: MathOptInterface.TIME_LIMIT in MathOptInterface.TerminationStatusCode[MathOptInterface.OPTIMAL, MathOptInterface.LOCALLY_SOLVED] Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:679 [inlined] [2] jump_nlp_01(optimizer::Ipopt.Optimizer; mode::BilevelJuMP.ProductMode{Float64}, config::Config) @ Main ~/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:27 [3] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [5] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [7] top-level scope @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:88 nlp: Test Failed at /home/pkgeval/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:29 Expression: ≈(objective_value(model), 2, atol = atol) Evaluated: -0.0 ≈ 2 (atol=1.0e-6) Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:679 [inlined] [2] jump_nlp_01(optimizer::Ipopt.Optimizer; mode::BilevelJuMP.ProductMode{Float64}, config::Config) @ Main ~/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:29 [3] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [5] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [7] top-level scope @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:88 nlp: Test Failed at /home/pkgeval/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:32 Expression: ≈(value(y), 0, atol = atol) Evaluated: 0.00999999 ≈ 0 (atol=1.0e-6) Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:679 [inlined] [2] jump_nlp_01(optimizer::Ipopt.Optimizer; mode::BilevelJuMP.ProductMode{Float64}, config::Config) @ Main ~/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:32 [3] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [5] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [7] top-level scope @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:88 nlp: Test Failed at /home/pkgeval/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:64 Expression: termination_status(model) in [MOI.OPTIMAL, MOI.LOCALLY_SOLVED] Evaluated: MathOptInterface.TIME_LIMIT in MathOptInterface.TerminationStatusCode[MathOptInterface.OPTIMAL, MathOptInterface.LOCALLY_SOLVED] Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:679 [inlined] [2] jump_nlp_02(optimizer::Ipopt.Optimizer; mode::BilevelJuMP.ProductMode{Float64}, config::Config) @ Main ~/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:64 [3] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:94 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [5] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [7] top-level scope @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:88 nlp: Test Failed at /home/pkgeval/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:66 Expression: ≈(objective_value(model), 2, atol = atol) Evaluated: -0.0 ≈ 2 (atol=1.0e-6) Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:679 [inlined] [2] jump_nlp_02(optimizer::Ipopt.Optimizer; mode::BilevelJuMP.ProductMode{Float64}, config::Config) @ Main ~/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:66 [3] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:94 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [5] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [7] top-level scope @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:88 nlp: Test Failed at /home/pkgeval/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:68 Expression: ≈(value(x), 2, atol = atol) Evaluated: 1.9826535369682172 ≈ 2 (atol=1.0e-6) Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:679 [inlined] [2] jump_nlp_02(optimizer::Ipopt.Optimizer; mode::BilevelJuMP.ProductMode{Float64}, config::Config) @ Main ~/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:68 [3] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:94 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [5] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [7] top-level scope @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:88 nlp: Test Failed at /home/pkgeval/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:69 Expression: ≈(value(y), 0, atol = atol) Evaluated: 0.05225845634955855 ≈ 0 (atol=1.0e-6) Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:679 [inlined] [2] jump_nlp_02(optimizer::Ipopt.Optimizer; mode::BilevelJuMP.ProductMode{Float64}, config::Config) @ Main ~/.julia/packages/BilevelJuMP/0Me8v/test/jump_nlp.jl:69 [3] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:94 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [5] macro expansion @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:93 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.11/Test/src/Test.jl:1704 [inlined] [7] top-level scope @ ~/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:88 x c2 : x + 2 y ≤ 4 An Abstract JuMP Model Minimization problem with: Variables: 3 Upper objective function type: GenericAffExpr{Float64, BilevelVariableRef} Lower objective function type: BilevelVariableRef Upper Constraints: 0 Lower Constraints: 5 Bilevel Model Solution method: BilevelJuMP.NoMode{Float64} No solver attached Names registered in the model: c0, c1, c2, c3, c4, x, y, z An Abstract JuMP Model Minimization problem with: Variables: 2 Upper objective function type: GenericAffExpr{Float64, BilevelVariableRef} Upper Constraints: 0 Bilevel Model Solution method: BilevelJuMP.NoMode{Float64} No solver attached Names registered in the model: c0, c1, c2, c3, c4, x, y, z An Abstract JuMP Model Minimization problem with: Variables: 3 Lower objective function type: BilevelVariableRef Lower Constraints: 5Bilevel Model Solution method: BilevelJuMP.NoMode{Float64} No solver attached Names registered in the model: c0, c1, c2, c3, c4, x, y, z An Abstract JuMP Model Minimization problem with: Variables: 2 Upper objective function type: GenericAffExpr{Float64, BilevelVariableRef} Lower objective function type: BilevelVariableRef Upper Constraints: 0 Lower Constraint: 1 Bilevel Model Solution method: BilevelJuMP.SOS1Mode{Float64}() Solver name: SCIP Names registered in the model: c1, x, y An Abstract JuMP Model Minimization problem with: Variables: 2 Upper objective function type: GenericAffExpr{Float64, BilevelVariableRef} Upper Constraints: 0 Bilevel Model Solution method: BilevelJuMP.SOS1Mode{Float64}() Solver name: SCIP Names registered in the model: c1, x, y An Abstract JuMP Model Minimization problem with: Variables: 2 Lower objective function type: BilevelVariableRef Lower Constraint: 1Bilevel Model Solution method: BilevelJuMP.SOS1Mode{Float64}() Solver name: SCIP Names registered in the model: c1, x, y WARNING: ignore partial solution (0) because unknown rate is too large (0.857143 > 0.85) This is Ipopt version 3.14.4, running with linear solver MUMPS 5.4.1. Number of nonzeros in equality constraint Jacobian...: 8 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 5 Total number of variables............................: 5 variables with only lower bounds: 5 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 2 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.1969988e-01 1.20e+01 1.05e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.8742209e-01 1.18e+01 1.19e+01 -1.0 3.00e+00 - 3.40e-03 1.10e-02h 1 2 2.6470500e+00 3.29e+00 2.26e+01 -1.0 3.78e+00 - 1.10e-01 7.22e-01f 1 3 1.2509015e+01 1.49e-01 4.84e+00 -1.0 5.43e+00 - 1.00e+00 9.55e-01f 1 4 1.2260713e+01 8.25e-02 6.65e+00 -1.0 3.94e-01 - 1.00e+00 4.46e-01h 1 5 1.2099553e+01 2.50e-02 7.65e+00 -1.0 2.90e-01 - 1.00e+00 6.97e-01h 1 6 1.2034016e+01 1.01e-02 2.25e+01 -1.0 1.27e-02 - 1.00e+00 5.98e-01h 1 7 1.2016707e+01 4.27e-03 6.37e+01 -1.0 5.07e-02 - 1.00e+00 5.75e-01h 1 8 1.2005753e+01 1.74e-03 1.44e+02 -1.0 2.52e-02 - 1.00e+00 5.92e-01h 1 9 1.2002286e+01 7.21e-04 3.57e+02 -1.0 3.77e-02 - 1.00e+00 5.86e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.2001574e+01 5.09e-04 1.46e+03 -1.0 3.13e-02 - 1.00e+00 2.94e-01f 2 11 1.1999974e+01 1.01e-04 7.68e+02 -1.0 3.77e-04 - 1.00e+00 8.02e-01h 1 12 1.1999887e+01 7.72e-05 9.91e+03 -1.0 4.36e-03 - 1.00e+00 2.36e-01f 2 13 1.1998624e+01 1.30e-05 4.44e+03 -1.0 3.75e-02 - 1.00e+00 8.32e-01h 1 14 1.1999013e+01 1.02e-05 7.58e+04 -1.0 4.68e-02 - 1.00e+00 2.13e-01f 2 15 1.1999373e+01 1.56e-06 2.90e+04 -1.0 1.41e-02 - 1.00e+00 8.47e-01h 1 16 1.1999455e+01 1.24e-06 5.95e+05 -1.0 1.43e-02 - 1.00e+00 2.06e-01f 2 17 1.1998912e+01 1.15e-07 1.37e+05 -1.0 1.82e-02 - 1.00e+00 9.07e-01h 1 18 1.1999445e+01 8.80e-08 3.94e+06 -1.0 6.94e-02 - 1.00e+00 2.35e-01f 2 19 1.1999918e+01 0.00e+00 6.83e+04 -1.0 5.66e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.1999432e+01 0.00e+00 1.33e+04 -1.0 2.55e-02 - 1.00e+00 1.00e+00f 1 21 1.1999975e+01 1.78e-15 5.76e+04 -1.7 3.27e-02 - 1.00e+00 1.00e+00f 1 22 1.1999977e+01 1.78e-15 1.69e+00 -1.7 2.96e-04 - 1.00e+00 1.00e+00f 1 23 1.2000000e+01 0.00e+00 1.72e+03 -5.7 8.29e-03 - 9.99e-01 1.00e+00f 1 24 1.2000000e+01 0.00e+00 7.84e-03 -5.7 1.92e-05 - 1.00e+00 1.00e+00h 1 25 1.2000000e+01 0.00e+00 1.03e-10 -5.7 1.78e-09 - 1.00e+00 1.00e+00h 1 26 1.2000000e+01 1.78e-15 6.58e-01 -8.6 7.68e-07 - 9.97e-01 1.00e+00h 1 27 1.2000000e+01 1.78e-15 3.67e-09 -8.6 1.48e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 27 (scaled) (unscaled) Objective...............: -1.2000000039919598e+01 1.2000000039919598e+01 Dual infeasibility......: 3.6692447296609563e-09 3.6692447296609563e-09 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Variable bound violation: 9.9798999839112497e-09 9.9798999839112497e-09 Complementarity.........: 4.9647134113008966e-09 4.9647134113008966e-09 Overall NLP error.......: 4.9647134113008966e-09 4.9647134113008966e-09 Number of objective function evaluations = 33 Number of objective gradient evaluations = 28 Number of equality constraint evaluations = 33 Number of inequality constraint evaluations = 33 Number of equality constraint Jacobian evaluations = 28 Number of inequality constraint Jacobian evaluations = 28 Number of Lagrangian Hessian evaluations = 27 Total seconds in IPOPT = 0.018 EXIT: Optimal Solution Found. This is Ipopt version 3.14.4, running with linear solver MUMPS 5.4.1. Number of nonzeros in equality constraint Jacobian...: 8 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 5 Total number of variables............................: 5 variables with only lower bounds: 5 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 2 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.1969988e-01 1.20e+01 1.05e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.8742209e-01 1.18e+01 1.19e+01 -1.0 3.00e+00 - 3.40e-03 1.10e-02h 1 2 2.6470500e+00 3.29e+00 2.26e+01 -1.0 3.78e+00 - 1.10e-01 7.22e-01f 1 3 1.2509015e+01 1.49e-01 4.84e+00 -1.0 5.43e+00 - 1.00e+00 9.55e-01f 1 4 1.2260713e+01 8.25e-02 6.65e+00 -1.0 3.94e-01 - 1.00e+00 4.46e-01h 1 5 1.2099553e+01 2.50e-02 7.65e+00 -1.0 2.90e-01 - 1.00e+00 6.97e-01h 1 6 1.2034016e+01 1.01e-02 2.25e+01 -1.0 1.27e-02 - 1.00e+00 5.98e-01h 1 7 1.2016707e+01 4.27e-03 6.37e+01 -1.0 5.07e-02 - 1.00e+00 5.75e-01h 1 8 1.2005753e+01 1.74e-03 1.44e+02 -1.0 2.52e-02 - 1.00e+00 5.92e-01h 1 9 1.2002286e+01 7.21e-04 3.57e+02 -1.0 3.77e-02 - 1.00e+00 5.86e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.2001574e+01 5.09e-04 1.46e+03 -1.0 3.13e-02 - 1.00e+00 2.94e-01f 2 11 1.1999974e+01 1.01e-04 7.68e+02 -1.0 3.77e-04 - 1.00e+00 8.02e-01h 1 12 1.1999887e+01 7.72e-05 9.91e+03 -1.0 4.36e-03 - 1.00e+00 2.36e-01f 2 13 1.1998624e+01 1.30e-05 4.44e+03 -1.0 3.75e-02 - 1.00e+00 8.32e-01h 1 14 1.1999013e+01 1.02e-05 7.58e+04 -1.0 4.68e-02 - 1.00e+00 2.13e-01f 2 15 1.1999373e+01 1.56e-06 2.90e+04 -1.0 1.41e-02 - 1.00e+00 8.47e-01h 1 16 1.1999455e+01 1.24e-06 5.95e+05 -1.0 1.43e-02 - 1.00e+00 2.06e-01f 2 17 1.1998912e+01 1.15e-07 1.37e+05 -1.0 1.82e-02 - 1.00e+00 9.07e-01h 1 18 1.1999445e+01 8.80e-08 3.94e+06 -1.0 6.94e-02 - 1.00e+00 2.35e-01f 2 19 1.1999918e+01 0.00e+00 6.83e+04 -1.0 5.66e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.1999432e+01 0.00e+00 1.33e+04 -1.0 2.55e-02 - 1.00e+00 1.00e+00f 1 21 1.1999975e+01 1.78e-15 5.76e+04 -1.7 3.27e-02 - 1.00e+00 1.00e+00f 1 22 1.1999977e+01 1.78e-15 1.69e+00 -1.7 2.96e-04 - 1.00e+00 1.00e+00f 1 23 1.2000000e+01 0.00e+00 1.72e+03 -5.7 8.29e-03 - 9.99e-01 1.00e+00f 1 24 1.2000000e+01 0.00e+00 7.84e-03 -5.7 1.92e-05 - 1.00e+00 1.00e+00h 1 25 1.2000000e+01 0.00e+00 1.03e-10 -5.7 1.78e-09 - 1.00e+00 1.00e+00h 1 26 1.2000000e+01 1.78e-15 6.58e-01 -8.6 7.68e-07 - 9.97e-01 1.00e+00h 1 27 1.2000000e+01 1.78e-15 3.67e-09 -8.6 1.48e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 27 (scaled) (unscaled) Objective...............: -1.2000000039919598e+01 1.2000000039919598e+01 Dual infeasibility......: 3.6692447296609563e-09 3.6692447296609563e-09 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Variable bound violation: 9.9798999839112497e-09 9.9798999839112497e-09 Complementarity.........: 4.9647134113008966e-09 4.9647134113008966e-09 Overall NLP error.......: 4.9647134113008966e-09 4.9647134113008966e-09 Number of objective function evaluations = 33 Number of objective gradient evaluations = 28 Number of equality constraint evaluations = 33 Number of inequality constraint evaluations = 33 Number of equality constraint Jacobian evaluations = 28 Number of inequality constraint Jacobian evaluations = 28 Number of Lagrangian Hessian evaluations = 27 Total seconds in IPOPT = 0.017 EXIT: Optimal Solution Found. This is Ipopt version 3.14.4, running with linear solver MUMPS 5.4.1. Number of nonzeros in equality constraint Jacobian...: 10 Number of nonzeros in inequality constraint Jacobian.: 50 Number of nonzeros in Lagrangian Hessian.............: 19 Total number of variables............................: 10 variables with only lower bounds: 0 variables with lower and upper bounds: 10 variables with only upper bounds: 0 Total number of equality constraints.................: 2 Total number of inequality constraints...............: 16 inequality constraints with only lower bounds: 6 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 10 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.1960000e+01 1.02e+00 1.37e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1946394e+01 9.78e-01 1.33e+00 -1.0 4.40e-01 - 2.83e-02 4.13e-02h 1 2 1.1888209e+01 8.42e-01 1.27e+01 -1.0 1.03e+00 - 7.95e-01 1.39e-01f 1 3 1.2152405e+01 6.54e-01 1.01e+01 -1.0 2.43e+00 - 1.85e-01 2.23e-01h 1 4 1.2122603e+01 5.90e-01 2.05e+02 -1.0 6.87e-01 - 1.00e+00 9.81e-02h 1 5 1.2068199e+01 1.42e-01 1.48e+02 -1.0 5.83e-01 - 5.32e-01 7.59e-01h 1 6 1.2113180e+01 1.05e-01 1.39e+02 -1.0 3.09e-01 - 1.00e+00 2.63e-01h 1 7 1.2093616e+01 4.32e-02 1.06e+02 -1.0 1.18e-01 - 1.00e+00 5.88e-01h 1 8 1.2104097e+01 9.89e-03 1.19e+02 -1.0 4.18e-02 - 1.00e+00 7.71e-01h 1 9 1.2103148e+01 4.86e-03 9.39e+02 -1.0 3.47e-02 - 1.00e+00 5.09e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.2102474e+01 1.89e-03 1.74e+03 -1.0 3.14e-02 - 1.00e+00 6.12e-01h 1 11 1.2104005e+01 7.55e-04 4.08e+03 -1.0 2.48e-02 - 1.00e+00 6.00e-01h 1 12 1.2102547e+01 2.76e-04 7.96e+03 -1.0 1.93e-02 - 1.00e+00 6.34e-01h 1 13 1.2103095e+01 8.25e-05 1.17e+04 -1.0 7.21e-03 - 1.00e+00 7.02e-01h 1 14 1.2102680e+01 4.56e-05 5.16e+04 -1.0 4.69e-02 - 1.00e+00 4.47e-01f 2 15 1.2102102e+01 0.00e+00 2.07e+02 -1.0 1.28e-01 - 1.00e+00 1.00e+00h 1 16 1.2102403e+01 0.00e+00 3.67e+02 -1.0 1.95e-02 - 1.00e+00 1.00e+00f 1 17 1.2018494e+01 1.11e-16 1.60e+05 -1.7 1.26e-01 - 7.80e-01 1.00e+00f 1 18 1.2019960e+01 1.17e-06 1.17e+04 -1.7 7.20e-01 - 1.00e+00 9.59e-01h 1 19 1.2020056e+01 1.53e-14 2.32e+05 -1.7 9.11e-02 - 4.14e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.2020047e+01 1.49e-14 9.93e+04 -1.7 1.26e+00 - 5.93e-01 1.94e-01f 2 21 1.2020049e+01 4.55e-15 1.41e+02 -1.7 9.08e-02 - 1.00e+00 1.00e+00h 1 22 1.2002757e+01 2.80e-14 1.71e+05 -2.5 2.66e-01 - 9.09e-01 1.00e+00f 1 23 1.2002812e+01 0.00e+00 1.79e+02 -2.5 1.79e+00 - 1.00e+00 1.00e+00h 1 24 1.2002813e+01 0.00e+00 6.66e+01 -2.5 3.71e-01 - 1.00e+00 1.00e+00h 1 25 1.2002812e+01 1.30e-10 1.11e+02 -2.5 1.30e+00 - 1.00e+00 1.00e+00H 1 26 1.2002811e+01 1.69e-09 2.65e+01 -2.5 1.84e+00 - 1.00e+00 1.00e+00H 1 27 1.2002812e+01 4.26e-14 7.39e+00 -2.5 4.65e-01 - 1.00e+00 1.00e+00h 1 28 1.2002812e+01 6.66e-16 9.61e-03 -2.5 1.39e-02 - 1.00e+00 1.00e+00h 1 29 1.1999988e+01 2.88e-13 5.74e+02 -5.7 5.94e-03 - 9.98e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 1.1999972e+01 0.00e+00 7.46e-06 -5.7 3.86e-05 - 1.00e+00 1.00e+00h 1 31 1.1999970e+01 0.00e+00 2.27e-02 -8.6 2.80e-06 - 1.00e+00 1.00e+00h 1 32 1.1999970e+01 2.22e-16 9.41e-11 -8.6 8.93e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 32 (scaled) (unscaled) Objective...............: 1.1999969855176861e+01 1.1999969855176861e+01 Dual infeasibility......: 9.4145136131373874e-11 9.4145136131373874e-11 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Variable bound violation: 5.8747048115037614e-08 5.8747048115037614e-08 Complementarity.........: 2.5120465593890818e-09 2.5120465593890818e-09 Overall NLP error.......: 2.5120465593890818e-09 2.5120465593890818e-09 Number of objective function evaluations = 39 Number of objective gradient evaluations = 33 Number of equality constraint evaluations = 39 Number of inequality constraint evaluations = 39 Number of equality constraint Jacobian evaluations = 33 Number of inequality constraint Jacobian evaluations = 33 Number of Lagrangian Hessian evaluations = 32 Total seconds in IPOPT = 0.028 EXIT: Optimal Solution Found. primal_status(model) = MathOptInterface.FEASIBLE_POINT termination_status(model) = MathOptInterface.LOCALLY_SOLVED value.(y) = [3.6007224982512422, 1.6007325661079703] This is Ipopt version 3.14.4, running with linear solver MUMPS 5.4.1. Number of nonzeros in equality constraint Jacobian...: 10 Number of nonzeros in inequality constraint Jacobian.: 75 Number of nonzeros in Lagrangian Hessian.............: 30 Total number of variables............................: 10 variables with only lower bounds: 0 variables with lower and upper bounds: 10 variables with only upper bounds: 0 Total number of equality constraints.................: 2 Total number of inequality constraints...............: 11 inequality constraints with only lower bounds: 6 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 5 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.1960000e+01 1.02e+00 1.38e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1912907e+01 9.43e-01 1.27e+00 -1.0 8.13e-01 - 8.21e-02 7.52e-02h 1 2 1.1854223e+01 8.63e-01 1.46e+00 -1.0 8.94e-01 - 6.47e-02 8.54e-02h 1 3 1.1740263e+01 7.33e-01 4.18e+00 -1.0 1.48e+00 - 5.16e-01 1.50e-01f 1 4 1.1580526e+01 6.71e-01 2.50e+01 -1.0 2.53e+00 - 5.11e-01 8.46e-02h 1 5 1.2131479e+01 4.62e-01 3.45e+01 -1.0 2.34e+00 - 7.12e-01 3.12e-01h 1 6 1.2021450e+01 2.05e-01 8.17e+01 -1.0 4.62e-01 - 1.00e+00 5.57e-01h 1 7 1.2103221e+01 9.45e-02 6.52e+01 -1.0 3.57e+00 - 1.00e+00 5.38e-01f 1 8 1.2096849e+01 3.36e-02 1.91e+02 -1.0 2.17e+00 - 1.00e+00 6.44e-01h 1 9 1.2101990e+01 1.94e-02 8.92e+02 -1.0 1.28e-01 - 1.00e+00 4.22e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.2101497e+01 4.14e-03 6.89e+02 -1.0 7.19e-01 - 1.00e+00 7.87e-01h 1 11 1.2102168e+01 2.55e-03 6.33e+03 -1.0 1.12e+00 - 1.00e+00 3.84e-01h 1 12 1.2101007e+01 5.80e-04 5.01e+03 -1.0 1.13e-01 - 1.00e+00 7.73e-01h 1 13 1.2101473e+01 3.63e-04 4.54e+04 -1.0 9.36e-01 - 1.00e+00 3.74e-01h 1 14 1.2100718e+01 7.29e-05 3.01e+04 -1.0 2.51e-01 - 1.00e+00 7.99e-01h 1 15 1.2100875e+01 4.43e-05 2.81e+05 -1.0 1.40e+00 - 1.00e+00 3.93e-01h 1 16 1.2100663e+01 3.93e-05 7.59e+05 -1.0 7.88e-01 - 1.00e+00 1.14e-01f 4 17 1.2098285e+01 4.61e-08 9.02e+03 -1.0 1.91e-01 - 1.00e+00 1.00e+00h 1 18 1.2097719e+01 5.21e-08 7.98e+05 -1.0 3.76e+00 - 1.00e+00 3.82e-01f 2 19 1.2095356e+01 0.00e+00 1.37e+05 -1.0 4.12e+00 - 1.00e+00 1.00e+00H 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.2095284e+01 0.00e+00 2.40e+02 -1.0 1.37e+00 - 1.00e+00 1.00e+00H 1 21 1.2007090e+01 1.11e-16 6.24e+04 -2.5 2.25e-01 - 1.00e+00 1.00e+00f 1 22 1.2002823e+01 0.00e+00 7.89e+00 -2.5 5.66e-02 - 1.00e+00 1.00e+00h 1 23 1.2002824e+01 2.22e-16 3.47e-02 -2.5 1.25e-02 - 1.00e+00 1.00e+00h 1 24 1.2000005e+01 2.22e-16 5.37e+01 -5.7 7.22e-03 - 1.00e+00 1.00e+00f 1 25 1.2000001e+01 8.88e-16 6.24e-06 -5.7 6.35e-06 - 1.00e+00 1.00e+00h 1 26 1.1999999e+01 1.44e-14 6.92e+01 -8.6 5.35e-06 - 7.50e-01 1.00e+00h 1 27 1.1999997e+01 0.00e+00 4.92e+00 -8.6 4.10e-06 - 9.29e-01 1.00e+00f 1 28 1.1999997e+01 1.11e-16 3.98e-10 -8.6 3.92e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 28 (scaled) (unscaled) Objective...............: 1.1999996505059851e+01 1.1999996505059851e+01 Dual infeasibility......: 3.9833212607268209e-10 3.9833212607268209e-10 Constraint violation....: 1.1102230246251565e-16 1.1102230246251565e-16 Variable bound violation: 5.8747048115037614e-08 5.8747048115037614e-08 Complementarity.........: 2.5445002209027185e-09 2.5445002209027185e-09 Overall NLP error.......: 2.5445002209027185e-09 2.5445002209027185e-09 Number of objective function evaluations = 41 Number of objective gradient evaluations = 29 Number of equality constraint evaluations = 41 Number of inequality constraint evaluations = 41 Number of equality constraint Jacobian evaluations = 29 Number of inequality constraint Jacobian evaluations = 29 Number of Lagrangian Hessian evaluations = 28 Total seconds in IPOPT = 0.027 EXIT: Optimal Solution Found. primal_status(model) = MathOptInterface.FEASIBLE_POINT termination_status(model) = MathOptInterface.LOCALLY_SOLVED value.(y) = [4.142983861297104, 2.1429850458595032] This is Ipopt version 3.14.4, running with linear solver MUMPS 5.4.1. Number of nonzeros in equality constraint Jacobian...: 10 Number of nonzeros in inequality constraint Jacobian.: 39 Number of nonzeros in Lagrangian Hessian.............: 10 Total number of variables............................: 10 variables with only lower bounds: 0 variables with lower and upper bounds: 10 variables with only upper bounds: 0 Total number of equality constraints.................: 2 Total number of inequality constraints...............: 11 inequality constraints with only lower bounds: 6 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 5 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.1960000e+01 1.94e+00 1.38e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1913993e+01 1.79e+00 1.27e+00 -1.0 2.04e+00 - 8.22e-02 7.51e-02h 1 2 1.1972401e+01 1.52e+00 2.29e+00 -1.0 2.00e+00 - 8.88e-02 1.30e-01h 1 3 1.1801670e+01 1.11e+00 3.72e+00 -1.0 1.74e+00 - 4.86e-01 2.41e-01f 1 4 1.1463299e+01 5.71e-01 4.45e+00 -1.0 1.65e+00 - 2.30e-01 3.23e-01f 1 5 1.1004547e+01 2.41e-01 1.06e+01 -1.0 1.44e+00 - 7.36e-01 4.27e-01f 1 6 1.2066270e+01 4.99e-02 1.86e+00 -1.0 2.32e+00 - 7.77e-01 7.93e-01h 1 7 1.1948411e+01 3.35e-02 7.93e+01 -1.0 2.87e+00 - 7.54e-01 3.29e-01h 1 8 1.2101670e+01 1.22e-02 1.27e+02 -1.0 8.53e+00 - 1.00e+00 6.36e-01h 1 9 1.2097276e+01 3.52e-03 2.21e+02 -1.0 9.47e-02 - 1.00e+00 7.12e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.2110108e+01 2.05e-03 1.15e+03 -1.0 6.65e-02 - 1.00e+00 4.17e-01h 1 11 1.2111417e+01 5.15e-04 9.19e+02 -1.0 1.56e-02 - 1.00e+00 7.49e-01h 1 12 1.2112302e+01 3.11e-04 5.58e+03 -1.0 4.30e-03 - 1.00e+00 3.97e-01h 1 13 1.2113371e+01 7.19e-05 4.05e+03 -1.0 5.26e-03 - 1.00e+00 7.69e-01h 1 14 1.2111909e+01 4.33e-05 2.81e+04 -1.0 9.50e-03 - 1.00e+00 3.98e-01h 1 15 1.2110864e+01 6.56e-06 1.36e+04 -1.0 2.86e-03 - 1.00e+00 8.48e-01h 1 16 1.2106363e+01 3.67e-06 1.59e+05 -1.0 2.59e-02 - 1.00e+00 4.41e-01f 1 17 1.2104332e+01 2.75e-06 4.28e+05 -1.0 2.05e-02 - 1.00e+00 2.50e-01f 3 18 1.2097054e+01 3.44e-09 3.32e+02 -1.0 1.84e-02 - 1.00e+00 1.00e+00h 1 19 1.2059104e+01 2.47e-10 2.50e+05 -1.7 1.92e-01 - 1.00e+00 5.00e-01f 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.2019670e+01 0.00e+00 4.18e+02 -1.7 1.14e-01 - 1.00e+00 1.00e+00h 1 21 1.2019771e+01 2.22e-16 8.47e+00 -1.7 1.31e-02 - 1.00e+00 1.00e+00h 1 22 1.2000363e+01 2.22e-16 1.11e+02 -3.8 4.96e-02 - 1.00e+00 1.00e+00f 1 23 1.2000145e+01 0.00e+00 1.16e-03 -3.8 6.69e-04 - 1.00e+00 1.00e+00h 1 24 1.1999996e+01 0.00e+00 3.65e+02 -5.7 3.81e-04 - 9.84e-01 1.00e+00f 1 25 1.1999972e+01 2.22e-16 9.95e-06 -5.7 3.20e-05 - 1.00e+00 1.00e+00h 1 26 1.1999970e+01 0.00e+00 7.11e+00 -8.6 6.08e-06 - 9.74e-01 1.00e+00h 1 27 1.1999970e+01 2.22e-16 1.25e-09 -8.6 3.84e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 27 (scaled) (unscaled) Objective...............: 1.1999969505094981e+01 1.1999969505094981e+01 Dual infeasibility......: 1.2492166970211652e-09 1.2492166970211652e-09 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Variable bound violation: 5.8747048115037614e-08 5.8747048115037614e-08 Complementarity.........: 2.5669867270787068e-09 2.5669867270787068e-09 Overall NLP error.......: 2.5669867270787068e-09 2.5669867270787068e-09 Number of objective function evaluations = 35 Number of objective gradient evaluations = 28 Number of equality constraint evaluations = 35 Number of inequality constraint evaluations = 35 Number of equality constraint Jacobian evaluations = 28 Number of inequality constraint Jacobian evaluations = 28 Number of Lagrangian Hessian evaluations = 27 Total seconds in IPOPT = 0.023 EXIT: Optimal Solution Found. primal_status(model) = MathOptInterface.FEASIBLE_POINT termination_status(model) = MathOptInterface.LOCALLY_SOLVED value.(y) = [4.142978156777045, 2.1429883413277344] presolving: (round 1, fast) 2 del vars, 6 del conss, 4 add conss, 231 chg bounds, 0 chg sides, 4 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 2, fast) 7 del vars, 12 del conss, 6 add conss, 248 chg bounds, 23 chg sides, 43 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 3, fast) 8 del vars, 14 del conss, 6 add conss, 248 chg bounds, 25 chg sides, 43 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 4, fast) 8 del vars, 14 del conss, 6 add conss, 280 chg bounds, 25 chg sides, 43 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 5, fast) 8 del vars, 35 del conss, 6 add conss, 280 chg bounds, 35 chg sides, 63 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 6, fast) 8 del vars, 35 del conss, 6 add conss, 281 chg bounds, 35 chg sides, 63 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 7, fast) 8 del vars, 35 del conss, 6 add conss, 281 chg bounds, 35 chg sides, 64 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (0.0s) running MILP presolver (0.0s) MILP presolver (6 rounds): 2 aggregations, 0 fixings, 11 bound changes (round 8, medium) 10 del vars, 35 del conss, 6 add conss, 292 chg bounds, 35 chg sides, 64 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 9, fast) 10 del vars, 49 del conss, 6 add conss, 292 chg bounds, 36 chg sides, 65 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 10, exhaustive) 10 del vars, 52 del conss, 6 add conss, 292 chg bounds, 37 chg sides, 65 chg coeffs, 0 upgd conss, 4 impls, 0 clqs (round 11, exhaustive) 10 del vars, 52 del conss, 6 add conss, 292 chg bounds, 37 chg sides, 65 chg coeffs, 92 upgd conss, 4 impls, 0 clqs (round 12, exhaustive) 10 del vars, 52 del conss, 6 add conss, 292 chg bounds, 37 chg sides, 65 chg coeffs, 93 upgd conss, 93 impls, 0 clqs (0.0s) probing cycle finished: starting next cycle (round 13, exhaustive) 10 del vars, 52 del conss, 6 add conss, 339 chg bounds, 37 chg sides, 65 chg coeffs, 93 upgd conss, 216 impls, 25 clqs (round 14, fast) 10 del vars, 72 del conss, 9 add conss, 339 chg bounds, 116 chg sides, 151 chg coeffs, 93 upgd conss, 216 impls, 25 clqs (round 15, fast) 10 del vars, 72 del conss, 9 add conss, 339 chg bounds, 118 chg sides, 151 chg coeffs, 93 upgd conss, 216 impls, 25 clqs (round 16, fast) 10 del vars, 72 del conss, 9 add conss, 340 chg bounds, 118 chg sides, 151 chg coeffs, 93 upgd conss, 216 impls, 25 clqs (round 17, exhaustive) 10 del vars, 75 del conss, 9 add conss, 340 chg bounds, 118 chg sides, 151 chg coeffs, 93 upgd conss, 216 impls, 25 clqs (0.0s) probing cycle finished: starting next cycle (round 18, exhaustive) 10 del vars, 75 del conss, 9 add conss, 341 chg bounds, 118 chg sides, 151 chg coeffs, 93 upgd conss, 226 impls, 26 clqs (round 19, fast) 10 del vars, 75 del conss, 12 add conss, 341 chg bounds, 119 chg sides, 152 chg coeffs, 93 upgd conss, 226 impls, 26 clqs (round 20, fast) 10 del vars, 75 del conss, 12 add conss, 341 chg bounds, 121 chg sides, 152 chg coeffs, 93 upgd conss, 226 impls, 26 clqs (round 21, exhaustive) 10 del vars, 78 del conss, 12 add conss, 341 chg bounds, 121 chg sides, 152 chg coeffs, 93 upgd conss, 226 impls, 26 clqs (0.0s) probing: 36/43 (83.7%) - 0 fixings, 0 aggregations, 159 implications, 48 bound changes (0.0s) probing aborted: 50/50 successive totally useless probings (round 22, exhaustive) 10 del vars, 78 del conss, 12 add conss, 341 chg bounds, 121 chg sides, 212 chg coeffs, 93 upgd conss, 226 impls, 26 clqs (round 23, fast) 10 del vars, 108 del conss, 33 add conss, 354 chg bounds, 121 chg sides, 212 chg coeffs, 93 upgd conss, 226 impls, 26 clqs (round 24, fast) 10 del vars, 108 del conss, 33 add conss, 354 chg bounds, 123 chg sides, 212 chg coeffs, 93 upgd conss, 226 impls, 26 clqs (round 25, exhaustive) 10 del vars, 111 del conss, 33 add conss, 354 chg bounds, 123 chg sides, 212 chg coeffs, 93 upgd conss, 226 impls, 26 clqs (round 26, exhaustive) 10 del vars, 111 del conss, 33 add conss, 354 chg bounds, 123 chg sides, 212 chg coeffs, 102 upgd conss, 226 impls, 26 clqs (0.0s) probing: 41/43 (95.3%) - 0 fixings, 0 aggregations, 159 implications, 48 bound changes (0.0s) probing aborted: 50/50 successive totally useless probings (0.0s) symmetry computation started: requiring (bin +, int -, cont +), (fixed: bin -, int +, cont -) (0.0s) no symmetry present presolving (27 rounds: 27 fast, 12 medium, 11 exhaustive): 10 deleted vars, 111 deleted constraints, 33 added constraints, 354 tightened bounds, 0 added holes, 123 changed sides, 212 changed coefficients 235 implications, 26 cliques presolved problem has 121 variables (43 bin, 0 int, 0 impl, 78 cont) and 219 constraints 64 constraints of type 155 constraints of type Presolving Time: 0.02 time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl. 0.0s| 1 | 0 | 46 | - | 2339k | 0 | 121 | 219 | 219 | 0 | 0 | 0 | 0 | 6.500000e+00 | -- | Inf | unknown 0.0s| 1 | 0 | 323 | - | 2419k | 0 | 121 | 219 | 223 | 4 | 1 | 0 | 0 | 6.500000e+00 | -- | Inf | unknown 0.0s| 1 | 0 | 331 | - | 2455k | 0 | 121 | 219 | 225 | 6 | 2 | 0 | 0 | 6.500000e+00 | -- | Inf | unknown 0.0s| 1 | 0 | 334 | - | 2502k | 0 | 121 | 219 | 227 | 8 | 3 | 0 | 0 | 6.500000e+00 | -- | Inf | unknown 0.0s| 1 | 0 | 372 | - | 2806k | 0 | 121 | 220 | 235 | 16 | 4 | 1 | 0 | 6.500000e+00 | -- | Inf | unknown 0.1s| 1 | 0 | 393 | - | 3021k | 0 | 121 | 220 | 242 | 23 | 5 | 1 | 0 | 7.294118e+00 | -- | Inf | unknown 0.1s| 1 | 0 | 404 | - | 3047k | 0 | 121 | 220 | 244 | 25 | 6 | 1 | 0 | 9.415385e+00 | -- | Inf | unknown 0.1s| 1 | 0 | 417 | - | 3109k | 0 | 121 | 220 | 249 | 30 | 7 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 435 | - | 3174k | 0 | 121 | 220 | 253 | 34 | 8 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 444 | - | 3208k | 0 | 121 | 220 | 256 | 37 | 9 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 464 | - | 3368k | 0 | 121 | 220 | 260 | 41 | 10 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 472 | - | 3397k | 0 | 121 | 220 | 264 | 45 | 11 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 473 | - | 3440k | 0 | 121 | 220 | 265 | 46 | 12 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 479 | - | 3534k | 0 | 121 | 220 | 267 | 48 | 13 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 502 | - | 3563k | 0 | 121 | 220 | 272 | 53 | 14 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl. 0.1s| 1 | 0 | 514 | - | 3593k | 0 | 121 | 220 | 254 | 55 | 15 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 527 | - | 3618k | 0 | 121 | 220 | 257 | 58 | 16 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.1s| 1 | 0 | 551 | - | 3646k | 0 | 121 | 220 | 260 | 61 | 17 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown 0.2s| 1 | 0 | 552 | - | 3646k | 0 | 121 | 220 | 261 | 62 | 18 | 1 | 0 | 1.200000e+01 | -- | Inf | unknown L 0.2s| 1 | 0 | 641 | - | rens| 0 | 121 | 222 | 261 | 62 | 18 | 3 | 0 | 1.200000e+01 | 1.204297e+01 | 0.36%| unknown 0.2s| 1 | 0 | 641 | - | 3674k | 0 | 121 | 223 | 262 | 62 | 18 | 3 | 0 | 1.200000e+01 | 1.204297e+01 | 0.36%| unknown 0.2s| 1 | 0 | 646 | - | 3702k | 0 | 121 | 223 | 263 | 63 | 19 | 3 | 0 | 1.200000e+01 | 1.204297e+01 | 0.36%| unknown 0.2s| 1 | 0 | 652 | - | 3706k | 0 | 121 | 223 | 264 | 64 | 20 | 3 | 0 | 1.200000e+01 | 1.204297e+01 | 0.36%| unknown 0.2s| 1 | 2 | 653 | - | 3707k | 0 | 121 | 223 | 264 | 64 | 20 | 3 | 13 | 1.200000e+01 | 1.204297e+01 | 0.36%| unknown * 0.2s| 10 | 0 | 741 | 19.8 | LP | 9 | 121 | 223 | 240 | 64 | 1 | 3 | 13 | 1.200000e+01 | 1.200000e+01 | 0.00%| 99.93% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.22 Solving Nodes : 10 Primal Bound : +1.20000000000000e+01 (2 solutions) Dual Bound : +1.20000000000000e+01 Gap : 0.00 % primal_status(model) = MathOptInterface.FEASIBLE_POINT termination_status(model) = MathOptInterface.OPTIMAL value.(y) = [2.2003910068426196, 0.20039100684261973] 15.579903 seconds (7.04 M allocations: 353.550 MiB, 0.48% gc time, 98.29% compilation time) 1.060485 seconds (397.71 k allocations: 19.676 MiB, 86.41% compilation time) 0.880172 seconds (317.06 k allocations: 15.829 MiB, 6.52% gc time, 83.59% compilation time) Test Summary: | Pass Fail Total Time BilevelJuMP tests | 1521 7 1528 9m24.5s MibS | 67 67 1m49.6s nlp | 19 7 26 1m08.7s Unit | 154 154 37.5s Simple LP | 18 18 27.4s Simple BLP JuMP | 783 783 2m24.4s JuMP quad | 8 8 1.8s Princeton Handbook Linear | 106 106 20.4s Sum aggregation_group | 10 10 1.8s Princeton Handbook Quadratic | 178 178 11.0s Ferris educational | 20 20 1.7s Bard Efficient Point Example | 2 2 1.7s SemiRandom | 2 2 2.2s DNE | 4 4 0.4s DNE - modifications | 28 28 1.8s equilibrium | 42 42 37.7s Lower QP | 4 4 0.5s Fruits | 19 19 1m04.0s Bilevel Conic JuMP NLP | 45 45 14.3s Bilevel Conic JuMP MIP | 12 12 17.6s ERROR: LoadError: Some tests did not pass: 1521 passed, 7 failed, 0 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/BilevelJuMP/0Me8v/test/runtests.jl:87 Testing failed after 731.28s ERROR: LoadError: Package BilevelJuMP errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.11/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{Pkg.Types.PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:2124 [3] test @ /opt/julia/share/julia/stdlib/v1.11/Pkg/src/Operations.jl:2007 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{Pkg.Types.PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.11/Pkg/src/API.jl:481 [5] test(pkgs::Vector{Pkg.Types.PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.11/Pkg/src/API.jl:159 [6] test @ /opt/julia/share/julia/stdlib/v1.11/Pkg/src/API.jl:147 [inlined] [7] #test#74 @ /opt/julia/share/julia/stdlib/v1.11/Pkg/src/API.jl:146 [inlined] [8] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 821.86s: package has test failures