Package evaluation to test Juniper on Julia 1.14.0-DEV.30 (073666df8b*) started at 2025-11-04T17:10:04.415 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.3s ################################################################################ # Installation # Installing Juniper... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [2ddba703] + Juniper v0.9.4 Updating `~/.julia/environments/v1.14/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.3 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [864edb3b] + DataStructures v0.19.2 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.2.2 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.2.0 [0f8b85d8] + JSON3 v1.14.3 [2ddba703] + Juniper v0.9.4 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.46.0 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [276daf66] + SpecialFunctions v2.6.1 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.5.1 [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 [8ba89e20] + Distributed v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.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 v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings 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.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 5.02s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Error: Failed to use TestEnv.jl; test dependencies will not be precompiled │ exception = │ UndefVarError: `project_rel_path` not defined in `TestEnv` │ Suggestion: this global was defined as `Pkg.Operations.project_rel_path` but not assigned a value. │ Stacktrace: │ [1] get_test_dir(ctx::Pkg.Types.Context, pkgspec::PackageSpec) │ @ TestEnv ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/common.jl:75 │ [2] test_dir_has_project_file │ @ ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/common.jl:52 [inlined] │ [3] maybe_gen_project_override! │ @ ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/common.jl:83 [inlined] │ [4] activate(pkg::String; allow_reresolve::Bool) │ @ TestEnv ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/activate_set.jl:12 │ [5] activate(pkg::String) │ @ TestEnv ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/activate_set.jl:9 │ [6] top-level scope │ @ /PkgEval.jl/scripts/precompile.jl:24 │ [7] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [8] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:344 │ [9] _start() │ @ Base ./client.jl:577 └ @ Main /PkgEval.jl/scripts/precompile.jl:26 Precompiling package dependencies... Precompiling packages... 78883.5 ms ✓ MathOptInterface 10768.6 ms ✓ Juniper 2 dependencies successfully precompiled in 92 seconds. 52 already precompiled. Precompilation completed after 104.86s ################################################################################ # Testing # Testing Juniper Status `/tmp/jl_v50aD6/Project.toml` [60bf3e95] GLPK v1.2.1 [87dc4568] HiGHS v1.20.0 [b6b21f68] Ipopt v1.12.1 [682c06a0] JSON v1.2.0 [4076af6c] JuMP v1.29.2 [2ddba703] Juniper v0.9.4 [b8f27783] MathOptInterface v1.46.0 [d8a4904e] MutableArithmetics v1.6.7 ⌅ [c946c3f1] SCS v1.3.1 [10745b16] Statistics v1.11.1 [8ba89e20] Distributed v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_v50aD6/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.3 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [864edb3b] DataStructures v0.19.2 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.2.2 [60bf3e95] GLPK v1.2.1 [87dc4568] HiGHS v1.20.0 [b6b21f68] Ipopt v1.12.1 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.2.0 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.2 [2ddba703] Juniper v0.9.4 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.46.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [ae029012] Requires v1.3.1 ⌅ [c946c3f1] SCS v1.3.1 [276daf66] SpecialFunctions v2.6.1 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.5.1 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [e8aa6df9] GLPK_jll v5.0.1+1 [8fd58aa0] HiGHS_jll v1.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+0 ⌅ [1d5cc7b8] IntelOpenMP_jll v2023.2.0+0 [9cc047cb] Ipopt_jll v300.1400.1900+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [856f044c] MKL_jll v2022.2.0+0 [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [af6e375f] SCS_GPU_jll v3.2.3+1 ⌅ [3f2553a9] SCS_MKL_jll v3.2.3+1 ⌅ [f4f2fc5b] SCS_jll v3.2.3+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.9.9 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.67.1+0 [3f19e933] p7zip_jll v17.6.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Workers:4 ┌ Error: The option branch doesn't exist. └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/MOI_wrapper/MOI_wrapper.jl:91 ┌ Error: The option branch doesn't exist. └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/MOI_wrapper/MOI_wrapper.jl:91 typeof(m): Model typeof(jp): Juniper.JuniperProblem #Variables: 5 #IntBinVar: 5 Obj Sense: Max nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("print_level") => 0, MathOptInterface.RawOptimizerAttribute("sb") => "yes"]) log_levels : Symbol[] silent : false atol : 1.0e-6 num_resolve_root_relaxation : 3 branch_strategy : StrongPseudoCost gain_mu : 0.833 strong_branching_perc : 100.0 strong_branching_nsteps : 1 strong_branching_time_limit : 100.0 strong_restart : true reliability_branching_threshold : 5 reliability_branching_perc : 25.0 incumbent_constr : false obj_epsilon : 0.0 time_limit : Inf mip_gap : 0.0001 best_obj_stop : NaN solution_limit : 0 all_solutions : false list_of_solutions : false processors : 2 traverse_strategy : BFS feasibility_pump : false feasibility_pump_time_limit : 60.0 feasibility_pump_tolerance_counter : 5 tabu_list_length : 30 num_resolve_nlp_feasibility_pump : 1 mip_solver : NA allow_almost_solved : true allow_almost_solved_integral : true registered_functions : NA seed : 1 force_parallel : false debug : false debug_write : false debug_file_path : debug.json fixed_gain_mu : false nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("print_level") => 0, MathOptInterface.RawOptimizerAttribute("sb") => "yes"]) feasibility_pump : false log_levels : Symbol[] gain_mu : 0.833 processors : 2 ================================== No objective and start value ================================== ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 0 2 0.0 0.0 0% 0.0 0 - ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 0 2 0.0 0.0 0% 0.0 0 - ================================== Bruteforce ================================== ================================== Bruteforce full strong w/o restart ================================== ================================== Bruteforce approx time limit ================================== ┌ Error: The option strong_branching_approx_time_limit doesn't exist. └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/MOI_wrapper/MOI_wrapper.jl:91 ================================== Bruteforce time reliable ================================== [ Info: Breaking out of strong branching as the time limit of 0.02 seconds got reached. [ Info: Breaking out of strong branching as the time limit of 0.02 seconds got reached. [ Info: Breaking out of strong branching as the time limit of 0.02 seconds got reached. [ Info: Breaking out of strong branching as the time limit of 0.02 seconds got reached. [ Info: Breaking out of strong branching as the time limit of 0.02 seconds got reached. ================================== Bruteforce PseudoCost ================================== Status: LOCALLY_SOLVED ================================== Bruteforce Reliability ================================== Status: LOCALLY_SOLVED ================================== no integer ================================== Create variables/constr/obj before solve Status: LOCALLY_SOLVED ================================== Infeasible cos ================================== Status: LOCALLY_INFEASIBLE ================================== Infeasible int reliable ================================== Status: LOCALLY_INFEASIBLE ================================== Infeasible sin with different bounds ================================== ================================== Infeasible relaxation ================================== Status: LOCALLY_INFEASIBLE ================================== Infeasible relaxation 2 ================================== Status: LOCALLY_INFEASIBLE ================================== Infeasible integer ================================== Status: LOCALLY_INFEASIBLE ================================== Infeasible in strong ================================== Status: LOCALLY_INFEASIBLE ================================== One Integer small Reliable ================================== Obj: -12.162277767531409 x: 3.0000000299966656 y: 3.1622776775414123 ================================== One Integer small Strong ================================== Obj: -12.162277764833632 x: 3.0000000296969698 y: 3.1622776757427227 ================================== One Integer small MostInfeasible ================================== Obj: -12.162277767531409 x: 3.0000000299966656 y: 3.1622776775414123 ================================== One Integer small PseudoCost ================================== Obj: -12.162277764833632 x: 3.0000000296969698 y: 3.1622776757427227 ================================== Three Integers Small Strong ================================== Obj: -12.00000010483995 ================================== Three Integers Small MostInfeasible ================================== Obj: -12.00000010483995 ================================== Three Integers Small PseudoCost ================================== Obj: -12.00000010483995 ================================== KNAPSACK ================================== ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:381 Obj: 65.0 ================================== KNAPSACK Reliable no restart ================================== Obj: 65.0 ================================== INTEGER AT ROOT ================================== ================================== KNAPSACK with epsilon ================================== Obj: 65.0 ================================== KNAPSACK with epsilon too strong ================================== ┌ Warning: Maybe only infeasible because of obj_epsilon. └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/BnBTree.jl:759 ================================== BATCH.MOD RESTART ================================== Solution by Juniper obj: 285506.49992118403 ================================== BATCH.MOD RESTART 2 LEVELS ================================== Solution by Juniper obj: 285506.49992118403 ================================== cvxnonsep_nsig20r.MOD RESTART ================================== Solution by Juniper obj: 80.94927805724046 ================================== cvxnonsep_nsig20r.MOD NO RESTART ================================== Solution by Juniper obj: 80.94927805724046 ================================== Knapsack solution limit and table print test ================================== ONodes CLevel Incumbent BestBound Gap Time ======================================================================================== ================================== Bruteforce obj_epsilon ================================== ================================== Bruteforce best_obj_stop not reachable ================================== ┌ Warning: best_obj_gap couldn't be reached. └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/BnBTree.jl:767 ================================== Bruteforce best_obj_stop reachable ================================== ================================== Sum 1/x = 2 ================================== ================================== Sum 1/x = 2 don't allow almost ================================== ================================== Integer fractional objective w/ HiGHS ================================== ================================== Nested variable reference ================================== ================================== KNAPSACK 50% ================================== Obj: 65.00000064818181 ================================== FLay02H time limit ================================== WARNING: Method definition batch_problem() in module Main at /home/pkgeval/.julia/packages/Juniper/93Umc/test/basic/gamsworld.jl:1 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition cvxnonsep_nsig20r_problem() in module Main at /home/pkgeval/.julia/packages/Juniper/93Umc/test/basic/gamsworld.jl:186 overwritten on the same line (check for duplicate calls to `include`). ================================== BATCH.MOD reliable ================================== ┌ Warning: NLP couldn't be solved to optimality └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:414 Solution by Juniper obj: 285506.5005468936 bound: 285506.5005468936 ================================== Knapsack solution limit and table print test ================================== MIPobj NLPobj Time ============================================= - 0.122 0.0 ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:381 p ONodes CLevel Incumbent BestBound Gap Time =========================================================================================== ================================== KNAPSACK Reliable incumbent_constr ================================== Obj: 65.00000064818181 ================================== BATCH.MOD reliable more processors than available ================================== ┌ Warning: Julia was started with less processors than you defined in your options. Start julia with: `julia -p 4` └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/MOI_wrapper/MOI_wrapper.jl:289 Solution by Juniper obj: 285506.5005468936 bound: 285506.5005468936 ================================== BATCH.MOD NO RESTART ================================== Solution by Juniper obj: 285506.50126568106 bound: 285506.50126568106 ================================== KNAPSACK 100% ================================== Obj: 65.00000064818181 bb: 75.22094145830847 ================================== Bruteforce ================================== ================================== Bruteforce fake parallel vs sequential ================================== ================================== Bruteforce PseudoCost ================================== Status: LOCALLY_SOLVED ================================== Infeasible cos ================================== Status: LOCALLY_INFEASIBLE ================================== Infeasible relaxation ================================== Status: LOCALLY_INFEASIBLE ================================== Infeasible integer ================================== Status: LOCALLY_INFEASIBLE ================================== Infeasible in strong ================================== Status: LOCALLY_INFEASIBLE WARNING: Method definition get_FLay02H() in module Main at /home/pkgeval/.julia/packages/Juniper/93Umc/test/POD_experiment/FLay02H.jl:1 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition batch_problem() in module Main at /home/pkgeval/.julia/packages/Juniper/93Umc/test/basic/gamsworld.jl:1 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition cvxnonsep_nsig20r_problem() in module Main at /home/pkgeval/.julia/packages/Juniper/93Umc/test/basic/gamsworld.jl:186 overwritten on the same line (check for duplicate calls to `include`). ================================== fp No objective and start value ================================== ================================== FP: no linear ================================== ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:381 ================================== FP: Integer Test ================================== ================================== FP: Integer Test 2 ================================== ================================== FP: Infeasible cos ================================== ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:381 Status: LOCALLY_INFEASIBLE ================================== FP: tspn05 ================================== ================================== FP: FLay02H ================================== ================================== FP: FLay02H short feasibility_pump_time_limit ================================== ================================== FP: Issue 195: FPump without objective ================================== ┌ Warning: Real objective wasn't solved to optimality └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:489 ================================== FP: Issue 263: FPump with ScalarNonlinearFunction ================================== ┌ Warning: Real objective wasn't solved to optimality └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:489 WARNING: Method definition batch_problem() in module Main at /home/pkgeval/.julia/packages/Juniper/93Umc/test/basic/gamsworld.jl:1 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition cvxnonsep_nsig20r_problem() in module Main at /home/pkgeval/.julia/packages/Juniper/93Umc/test/basic/gamsworld.jl:186 overwritten on the same line (check for duplicate calls to `include`). ================================== full strong branching ================================== obj: 285506.5013305741 ================================== break strong branching time limit ================================== [ Info: Breaking out of strong branching as the time limit of 0.01 seconds got reached. Best bound: 285506.49998922425 Objective: 285506.49998922425 ================================== nous1 restart ================================== ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:381 ================================== nous1 no restart ================================== ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/93Umc/src/fpump.jl:381 ================================== reliability ================================== Solution by Juniper obj: 285506.5000541546 best_bound_val: 285506.5000541546 gap_val: 0.0 ┌ Warning: The exclude string "test_conic_linear_VectorOfVariables" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_conic_linear_VectorOfVariables$"` to exclude the exactly matching test, or `r"test_conic_linear_VectorOfVariables.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/tVdNJ/src/Test/Test.jl:239 ┌ Warning: The exclude string "test_conic_linear_INFEASIBLE" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_conic_linear_INFEASIBLE$"` to exclude the exactly matching test, or `r"test_conic_linear_INFEASIBLE.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/tVdNJ/src/Test/Test.jl:239 ┌ Warning: The exclude string "test_linear_INFEASIBLE" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_linear_INFEASIBLE$"` to exclude the exactly matching test, or `r"test_linear_INFEASIBLE.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/tVdNJ/src/Test/Test.jl:239 ┌ Warning: The exclude string "test_linear_DUAL_INFEASIBLE" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_linear_DUAL_INFEASIBLE$"` to exclude the exactly matching test, or `r"test_linear_DUAL_INFEASIBLE.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/tVdNJ/src/Test/Test.jl:239 A Juniper MathOptInterface model with backend test_vector_nonlinear_oracle: Error During Test at /home/pkgeval/.julia/packages/MathOptInterface/tVdNJ/src/Test/test_nonlinear.jl:2289 Test threw exception Expression: ≈(MOI.get(model, MOI.ConstraintDual(), c), zeros(T, 5), config) Fallback getter for variable constraint dual does not support other variable-wise constraints on the variable. Please report this issue to the solver wrapper package. Stacktrace: [1] error(::String, ::String, ::String) @ Base ./error.jl:54 [2] _variable_dual(::Type{Float64}, model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, ::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}, vi::MathOptInterface.VariableIndex, ::Type{MathOptInterface.VariableIndex}, ::Type{MathOptInterface.EqualTo{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:357 [3] _variable_dual(::Type{Float64}, model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}, vi::MathOptInterface.VariableIndex) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:408 [4] #_variable_dual##4 @ ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:420 [inlined] [5] iterate @ ./generator.jl:48 [inlined] [6] _collect(c::Vector{MathOptInterface.VariableIndex}, itr::Base.Generator{Vector{MathOptInterface.VariableIndex}, MathOptInterface.Utilities.var"#_variable_dual##4#_variable_dual##5"{Float64, MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, MathOptInterface.ConstraintDual, MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}}}, ::Base.EltypeUnknown, isz::Base.HasShape{1}) @ Base ./array.jl:848 [7] collect_similar @ ./array.jl:763 [inlined] [8] map @ ./abstractarray.jl:3390 [inlined] [9] _variable_dual @ ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:420 [inlined] [10] get_fallback(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}, ::Type{Float64}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:448 [11] get_fallback @ ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:446 [inlined] [12] _get_fallback(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, index::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/cachingoptimizer.jl:1011 [13] get(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, index::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/cachingoptimizer.jl:949 [14] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:750 [inlined] [15] test_vector_nonlinear_oracle(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, config::MathOptInterface.Test.Config{Float64}) @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/tVdNJ/src/Test/test_nonlinear.jl:2289 caused by: MathOptInterface.GetAttributeNotAllowed{MathOptInterface.ConstraintDual}: ## Cause Getting attribute MathOptInterface.ConstraintDual(1) cannot be performed because: MathOptInterface.Utilities.Model{Float64} does not support getting the attribute MathOptInterface.ConstraintDual(1). ## Fixing this error An `MOI.NotAllowedError` error occurs when you have tried to do something that is not implemented by the solver. The most common way to fix this error is to wrap the optimizer in a `MOI.Utilities.CachingOptimizer`. For example, if you are using `JuMP.Model` or `JuMP.set_optimizer`, do: ```julia model = JuMP.Model(optimizer; with_cache_type = Float64) model = JuMP.GenericModel{T}(optimizer; with_cache_type = T) JuMP.set_optimizer(model, optimizer; with_cache_type = Float64) ``` Similarly, if you are using `MOI.instantiate`, do: ```julia model = MOI.instantiate(optimizer; with_cache_type = Float64) ``` Stacktrace: [1] get_fallback(model::MathOptInterface.Utilities.Model{Float64}, attr::MathOptInterface.ConstraintDual, ::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface ~/.julia/packages/MathOptInterface/tVdNJ/src/attributes.jl:477 [2] get(model::MathOptInterface.Utilities.Model{Float64}, attr::MathOptInterface.ConstraintDual, args::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface ~/.julia/packages/MathOptInterface/tVdNJ/src/attributes.jl:432 [3] get(uf::MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}, attr::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/universalfallback.jl:381 [4] get(model::Juniper.Optimizer, attr::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ Juniper ~/.julia/packages/Juniper/93Umc/src/MOI_wrapper/MOI_wrapper.jl:472 [5] _get_fallback(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, index::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/cachingoptimizer.jl:1004 [6] get(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, index::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/cachingoptimizer.jl:949 [7] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:750 [inlined] [8] test_vector_nonlinear_oracle(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, config::MathOptInterface.Test.Config{Float64}) @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/tVdNJ/src/Test/test_nonlinear.jl:2289 test_vector_nonlinear_oracle_no_hessian: Error During Test at /home/pkgeval/.julia/packages/MathOptInterface/tVdNJ/src/Test/test_nonlinear.jl:2361 Test threw exception Expression: ≈(MOI.get(model, MOI.ConstraintDual(), c), zeros(T, 5), config) Fallback getter for variable constraint dual does not support other variable-wise constraints on the variable. Please report this issue to the solver wrapper package. Stacktrace: [1] error(::String, ::String, ::String) @ Base ./error.jl:54 [2] _variable_dual(::Type{Float64}, model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, ::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}, vi::MathOptInterface.VariableIndex, ::Type{MathOptInterface.VariableIndex}, ::Type{MathOptInterface.EqualTo{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:357 [3] _variable_dual(::Type{Float64}, model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}, vi::MathOptInterface.VariableIndex) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:408 [4] #_variable_dual##4 @ ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:420 [inlined] [5] iterate @ ./generator.jl:48 [inlined] [6] _collect(c::Vector{MathOptInterface.VariableIndex}, itr::Base.Generator{Vector{MathOptInterface.VariableIndex}, MathOptInterface.Utilities.var"#_variable_dual##4#_variable_dual##5"{Float64, MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, MathOptInterface.ConstraintDual, MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}}}, ::Base.EltypeUnknown, isz::Base.HasShape{1}) @ Base ./array.jl:848 [7] collect_similar @ ./array.jl:763 [inlined] [8] map @ ./abstractarray.jl:3390 [inlined] [9] _variable_dual @ ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:420 [inlined] [10] get_fallback(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}, ::Type{Float64}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:448 [11] get_fallback @ ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/results.jl:446 [inlined] [12] _get_fallback(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, index::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/cachingoptimizer.jl:1011 [13] get(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, index::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/cachingoptimizer.jl:949 [14] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:750 [inlined] [15] test_vector_nonlinear_oracle_no_hessian(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, config::MathOptInterface.Test.Config{Float64}) @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/tVdNJ/src/Test/test_nonlinear.jl:2361 caused by: MathOptInterface.GetAttributeNotAllowed{MathOptInterface.ConstraintDual}: ## Cause Getting attribute MathOptInterface.ConstraintDual(1) cannot be performed because: MathOptInterface.Utilities.Model{Float64} does not support getting the attribute MathOptInterface.ConstraintDual(1). ## Fixing this error An `MOI.NotAllowedError` error occurs when you have tried to do something that is not implemented by the solver. The most common way to fix this error is to wrap the optimizer in a `MOI.Utilities.CachingOptimizer`. For example, if you are using `JuMP.Model` or `JuMP.set_optimizer`, do: ```julia model = JuMP.Model(optimizer; with_cache_type = Float64) model = JuMP.GenericModel{T}(optimizer; with_cache_type = T) JuMP.set_optimizer(model, optimizer; with_cache_type = Float64) ``` Similarly, if you are using `MOI.instantiate`, do: ```julia model = MOI.instantiate(optimizer; with_cache_type = Float64) ``` Stacktrace: [1] get_fallback(model::MathOptInterface.Utilities.Model{Float64}, attr::MathOptInterface.ConstraintDual, ::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface ~/.julia/packages/MathOptInterface/tVdNJ/src/attributes.jl:477 [2] get(model::MathOptInterface.Utilities.Model{Float64}, attr::MathOptInterface.ConstraintDual, args::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface ~/.julia/packages/MathOptInterface/tVdNJ/src/attributes.jl:432 [3] get(uf::MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}, attr::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/universalfallback.jl:381 [4] get(model::Juniper.Optimizer, attr::MathOptInterface.ConstraintDual, ci::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ Juniper ~/.julia/packages/Juniper/93Umc/src/MOI_wrapper/MOI_wrapper.jl:472 [5] _get_fallback(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, index::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/cachingoptimizer.jl:1004 [6] get(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, attr::MathOptInterface.ConstraintDual, index::MathOptInterface.ConstraintIndex{MathOptInterface.VectorOfVariables, MathOptInterface.VectorNonlinearOracle{Float64}}) @ MathOptInterface.Utilities ~/.julia/packages/MathOptInterface/tVdNJ/src/Utilities/cachingoptimizer.jl:949 [7] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:750 [inlined] [8] test_vector_nonlinear_oracle_no_hessian(model::MathOptInterface.Utilities.CachingOptimizer{Juniper.Optimizer, MathOptInterface.Utilities.UniversalFallback{MathOptInterface.Utilities.Model{Float64}}}, config::MathOptInterface.Test.Config{Float64}) @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/tVdNJ/src/Test/test_nonlinear.jl:2361 atol : 0.1 nl_solver : MathOptInterface.OptimizerWithAttributes(SCS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.Silent() => true]) feasibility_pump : false log_levels : [:Options, :Table, :Info] #Variables: 2 #IntBinVar: 2 Obj Sense: Max Incumbent using start values: -3.922488917927899e-5 Status of relaxation: OPTIMAL Time for relaxation: 33.340641021728516 Relaxation Obj: 58.30936124486548 ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 1 2 58.0 58.31 0.53% 0.6 0 - #branches: 1 Obj: 58.00010243829919 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 3 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 3 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+01 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 0.0000000e+00 1.00e-01 9.79e+02 -1.0 1.00e+01 - 1.00e-03 9.90e-01f 1 2 0.0000000e+00 0.00e+00 0.00e+00 -1.0 1.00e+02 - 9.91e-07 1.00e+00f 1 Number of Iterations....: 2 (scaled) (unscaled) Objective...............: -0.0000000000000000e+00 0.0000000000000000e+00 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 0.0000000000000000e+00 0.0000000000000000e+00 Number of objective function evaluations = 3 Number of objective gradient evaluations = 3 Number of equality constraint evaluations = 3 Number of inequality constraint evaluations = 3 Number of equality constraint Jacobian evaluations = 3 Number of inequality constraint Jacobian evaluations = 3 Number of Lagrangian Hessian evaluations = 2 Total seconds in IPOPT = 0.002 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 5 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 5 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.9999920e-02 1.00e+01 2.50e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1830589e+00 1.00e-01 9.79e+02 -1.0 1.00e+01 - 1.00e-03 9.90e-01f 1 2 7.4677283e+01 7.03e+01 1.73e+04 -1.0 1.82e+02 - 6.03e-05 5.36e-02f 1 3 6.7106029e+01 3.70e+01 1.00e+04 -1.0 2.01e+00 4.0 4.86e-02 5.00e-01h 1 4 5.8070393e+01 1.84e+00 1.01e+03 -1.0 1.20e+00 - 7.24e-01 1.00e+00h 1 5 5.7378111e+01 0.00e+00 1.14e+01 -1.0 8.81e-02 - 1.00e+00 1.00e+00h 1 6 5.7797270e+01 0.00e+00 5.14e-01 -1.0 3.26e-01 - 1.00e+00 1.00e+00f 1 7 5.8687208e+01 1.30e+00 3.90e-03 -1.7 9.15e-01 - 9.58e-01 1.00e+00f 1 8 5.8290855e+01 0.00e+00 2.36e-04 -1.7 5.14e-02 - 1.00e+00 1.00e+00h 1 9 5.8309424e+01 0.00e+00 6.01e-06 -3.8 6.83e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.8309517e+01 0.00e+00 1.34e-09 -5.7 4.16e-04 - 1.00e+00 1.00e+00h 1 11 5.8309519e+01 0.00e+00 5.68e-14 -8.6 6.31e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: -5.8309518948863101e+01 5.8309518948863101e+01 Dual infeasibility......: 5.6843418860808015e-14 5.6843418860808015e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5068774659757560e-09 2.5068774659757560e-09 Overall NLP error.......: 2.5068774659757560e-09 2.5068774659757560e-09 Number of objective function evaluations = 12 Number of objective gradient evaluations = 12 Number of equality constraint evaluations = 12 Number of inequality constraint evaluations = 12 Number of equality constraint Jacobian evaluations = 12 Number of inequality constraint Jacobian evaluations = 12 Number of Lagrangian Hessian evaluations = 11 Total seconds in IPOPT = 0.007 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 5 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 5 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 5.7724646e+01 1.00e+01 2.50e+00 -5.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5237260e+01 1.78e-15 1.21e+05 -5.0 1.00e+01 - 1.66e-04 1.00e+00H 1 2 3.5238102e+01 0.00e+00 2.13e+00 -5.0 2.13e-04 4.0 1.00e+00 1.00e+00h 1 3 3.9327906e+01 0.00e+00 1.93e+00 -5.0 9.09e+01 - 4.01e-01 9.32e-02f 1 4 3.9337634e+01 0.00e+00 3.67e+00 -5.0 6.98e+01 - 1.00e+00 2.73e-04f 1 5 6.4999737e+01 2.50e+01 2.50e+00 -5.0 6.98e+01 - 6.84e-01 7.21e-01f 1 6 6.4999993e+01 2.50e+01 4.35e+00 -5.0 3.78e+01 - 1.00e+00 9.07e-05h 1 7 6.4999993e+01 2.50e+01 4.20e+00 -5.0 2.65e+01 - 1.00e+00 5.58e-02h 1 8r 6.4999993e+01 2.50e+01 9.99e+02 1.4 0.00e+00 - 0.00e+00 2.96e-07R 2 9r 6.4999580e+01 2.50e+01 9.99e+02 1.4 4.96e+04 - 8.40e-05 8.22e-06f 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10r 5.8416939e+01 4.30e-01 1.00e+03 0.7 1.90e+05 - 4.72e-05 1.32e-04f 1 11 5.8860070e+01 1.98e+00 4.99e+00 -5.0 8.91e+02 - 1.74e-01 1.73e-03f 1 12 5.8304794e+01 1.24e-02 1.51e-01 -5.0 1.12e-01 - 9.35e-01 1.00e+00h 1 13 5.8301231e+01 0.00e+00 5.76e-06 -5.0 7.79e-04 - 1.00e+00 1.00e+00h 1 14 5.8301270e+01 0.00e+00 3.19e-09 -7.5 2.72e-04 - 1.00e+00 1.00e+00h 1 15 5.8301270e+01 0.00e+00 2.66e-14 -9.0 7.94e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: -5.8301270195952675e+01 5.8301270195952675e+01 Dual infeasibility......: 2.6645352591003757e-14 2.6645352591003757e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 4.1968173825068789e-08 4.1968173825068789e-08 Complementarity.........: 9.0959321517060250e-10 9.0959321517060250e-10 Overall NLP error.......: 9.0959321517060250e-10 9.0959321517060250e-10 Number of objective function evaluations = 32 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 32 Number of inequality constraint evaluations = 32 Number of equality constraint Jacobian evaluations = 17 Number of inequality constraint Jacobian evaluations = 17 Number of Lagrangian Hessian evaluations = 15 Total seconds in IPOPT = 0.010 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 5 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 5 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0994646e+01 1.00e+01 2.50e+00 -5.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.8286812e+01 8.80e+00 1.19e+02 -5.0 1.00e+01 - 1.00e-03 1.20e-01h 1 2 6.7999924e+01 1.28e+01 8.31e+01 -5.0 1.40e+01 - 3.40e-02 3.02e-01f 1 3r 6.7999924e+01 1.28e+01 9.99e+02 1.1 0.00e+00 - 0.00e+00 2.46e-07R 2 4r 6.8374910e+01 1.28e+01 1.00e+03 1.1 8.41e+05 - 9.81e-06 1.49e-07f 6 5r 6.8192782e+01 4.90e+00 9.99e+02 1.1 1.26e+04 - 5.93e-04 1.02e-03f 1 6 6.7339762e+01 4.35e+00 4.92e+00 -5.0 3.94e+00 - 5.27e-01 1.11e-01h 1 7 6.1905298e+01 1.37e+00 1.42e+00 -5.0 3.09e+00 - 1.00e+00 6.85e-01h 1 8 6.0496190e+01 8.75e-01 8.86e-01 -5.0 9.76e-01 - 6.54e-01 3.62e-01h 1 9 5.8005456e+01 1.75e-02 9.12e-04 -5.0 6.22e-01 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.7999980e+01 0.00e+00 8.60e-08 -5.0 1.09e-03 - 1.00e+00 1.00e+00h 1 11 5.8000000e+01 0.00e+00 6.71e-12 -7.5 3.19e-05 - 1.00e+00 1.00e+00h 1 12 5.8000000e+01 0.00e+00 9.10e-15 -9.0 9.83e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: -5.8000000046306816e+01 5.8000000046306816e+01 Dual infeasibility......: 9.1038288019262836e-15 9.1038288019262836e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 5.8787875900634390e-08 5.8787875900634390e-08 Complementarity.........: 9.0909273116370423e-10 9.0909273116370423e-10 Overall NLP error.......: 9.0909273116370423e-10 9.0909273116370423e-10 Number of objective function evaluations = 21 Number of objective gradient evaluations = 12 Number of equality constraint evaluations = 21 Number of inequality constraint evaluations = 21 Number of equality constraint Jacobian evaluations = 14 Number of inequality constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 12 Total seconds in IPOPT = 0.007 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 5 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 5 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 5.5034873e+01 1.00e+01 2.50e+00 -5.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.2218051e+01 8.88e-16 8.80e+04 -5.0 1.00e+01 - 2.27e-04 1.00e+00H 1 2 4.2218555e+01 0.00e+00 1.41e+00 -5.0 1.41e-04 4.0 1.00e+00 1.00e+00h 1 3 4.7802421e+01 0.00e+00 1.26e+00 -5.0 1.26e+02 - 3.78e-01 1.10e-01f 1 4 4.7804174e+01 0.00e+00 4.81e+00 -5.0 2.82e+01 - 1.00e+00 1.14e-04h 1 5 6.2868991e+01 2.21e+01 3.00e+00 -5.0 2.70e+01 - 5.18e-01 1.00e+00f 1 6 6.3480221e+01 2.53e+01 3.00e+00 -5.0 5.15e+05 - 1.00e+00 6.04e-06f 1 7 5.8639518e+01 2.60e+00 7.17e-01 -5.0 1.61e+00 - 5.74e-01 1.00e+00h 1 8 5.8010954e+01 4.39e-02 1.12e-02 -5.0 2.10e-01 - 1.00e+00 1.00e+00h 1 9 5.7999983e+01 0.00e+00 7.91e-06 -5.0 3.65e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.8000000e+01 0.00e+00 2.62e-11 -7.5 3.99e-05 - 1.00e+00 1.00e+00h 1 11 5.8000000e+01 0.00e+00 9.10e-15 -9.0 1.23e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: -5.8000000080681822e+01 5.8000000080681822e+01 Dual infeasibility......: 9.1038288019262836e-15 9.1038288019262836e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 7.9090908045031938e-08 7.9090908045031938e-08 Complementarity.........: 9.0909136942459405e-10 9.0909136942459405e-10 Overall NLP error.......: 9.0909136942459405e-10 9.0909136942459405e-10 Number of objective function evaluations = 13 Number of objective gradient evaluations = 12 Number of equality constraint evaluations = 13 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 12 Number of inequality constraint Jacobian evaluations = 12 Number of Lagrangian Hessian evaluations = 11 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 5 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 5 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0484872e+01 1.00e+01 2.50e+00 -5.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.9713983e+01 9.21e+00 7.81e+01 -5.0 1.00e+01 - 1.00e-03 7.91e-02h 1 2 6.9049546e+01 4.53e+01 7.88e+02 -5.0 9.21e+00 - 2.10e-02 1.00e+00f 1 3 6.9049433e+01 4.53e+01 7.88e+02 -5.0 1.40e+00 2.0 4.17e-01 1.05e-05h 1 4 6.0490604e+01 7.66e+00 1.28e+02 -5.0 2.85e+00 1.5 1.23e-02 1.00e+00h 1 5 6.0490504e+01 7.66e+00 1.28e+02 -5.0 3.30e-01 1.0 9.59e-01 4.42e-05h 1 6 5.8159579e+01 2.42e-01 2.88e+00 -5.0 7.77e-01 0.6 1.00e+00 1.00e+00h 1 7 5.8279480e+01 5.94e-01 2.83e+00 -5.0 1.91e+01 - 5.15e-01 1.89e-02f 1 8 5.8279455e+01 5.94e-01 2.83e+00 -5.0 6.61e-02 - 9.87e-01 1.93e-04h 1 9 5.8078223e+01 4.47e-03 1.05e-02 -5.0 6.71e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.8076677e+01 0.00e+00 1.19e-06 -5.0 5.11e-04 - 1.00e+00 1.00e+00h 1 11 5.8076697e+01 0.00e+00 7.52e-11 -7.5 2.90e-05 - 1.00e+00 1.00e+00h 1 12 5.8076697e+01 0.00e+00 9.10e-15 -9.0 8.94e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: -5.8076696939725295e+01 5.8076696939725295e+01 Dual infeasibility......: 9.1038288019262836e-15 9.1038288019262836e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 8.9238756828535770e-08 8.9238756828535770e-08 Complementarity.........: 9.0909564649013313e-10 9.0909564649013313e-10 Overall NLP error.......: 9.0909564649013313e-10 9.0909564649013313e-10 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 13 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 13 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 12 Total seconds in IPOPT = 0.006 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 5 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 5 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 5.6930000e+01 1.00e+01 2.50e+00 -5.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.6837145e+01 9.21e+00 7.81e+01 -5.0 1.00e+01 - 1.00e-03 7.91e-02h 1 2 5.7000003e+01 8.55e+00 7.25e+01 -5.0 9.21e+00 - 2.79e-02 7.15e-02h 1 3 5.7067567e+01 8.50e+00 7.21e+01 -5.0 1.00e+01 - 7.81e-07 5.78e-03h 1 4 5.7969343e+01 5.27e-01 1.92e+02 -5.0 8.50e+00 - 1.76e-01 1.00e+00h 1 5 5.7825932e+01 6.81e-04 5.50e-01 -5.0 2.87e-02 - 9.66e-01 1.00e+00h 1 6 5.7825731e+01 0.00e+00 2.59e-06 -5.0 8.07e-05 - 1.00e+00 1.00e+00h 1 7 5.7825757e+01 0.00e+00 6.48e-11 -7.5 6.09e-05 - 1.00e+00 1.00e+00h 1 8 5.7825757e+01 0.00e+00 9.10e-15 -9.0 1.13e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -5.7825756983180788e+01 5.7825756983180788e+01 Dual infeasibility......: 9.1038288019262836e-15 9.1038288019262836e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 3.8888400055725469e-08 3.8888400055725469e-08 Complementarity.........: 9.0909280186639158e-10 9.0909280186639158e-10 Overall NLP error.......: 9.0909280186639158e-10 9.0909280186639158e-10 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 9 Number of inequality constraint evaluations = 9 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total seconds in IPOPT = 0.004 EXIT: Optimal Solution Found. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 5 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 5 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0199999e+01 1.00e+01 2.50e+00 -5.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 6.0074095e+01 9.21e+00 7.81e+01 -5.0 1.00e+01 - 1.00e-03 7.91e-02h 1 2 6.0001319e+01 8.78e+00 7.45e+01 -5.0 9.21e+00 - 8.89e-02 4.64e-02h 1 3 6.0000180e+01 8.78e+00 8.03e+03 -5.0 8.78e+00 - 8.69e-01 5.05e-04h 1 4 5.9999999e+01 8.78e+00 1.43e+07 -5.0 8.78e+00 - 1.43e-01 8.03e-05h 1 5r 5.9999999e+01 8.78e+00 1.00e+03 0.9 0.00e+00 - 0.00e+00 4.15e-10R 2 6r 6.0001060e+01 2.12e+00 9.31e+02 0.9 4.78e+02 - 9.98e-01 1.51e-02f 1 7 6.0000108e+01 2.12e+00 1.18e+03 -5.0 1.94e+00 - 8.44e-01 7.17e-04h 1 8 5.9999999e+01 2.12e+00 8.06e+06 -5.0 2.12e+00 - 8.46e-01 1.24e-04h 1 9r 5.9999999e+01 2.12e+00 1.00e+03 0.3 0.00e+00 - 0.00e+00 8.59e-08R 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10r 6.0000019e+01 1.55e+00 2.30e+02 0.3 1.63e+03 - 1.00e+00 1.15e-03f 1 11r 6.0000019e+01 1.55e+00 9.99e+02 0.2 0.00e+00 - 0.00e+00 2.98e-07R 6 12r 6.0014836e+01 3.44e-01 9.97e+02 0.2 1.30e+03 - 3.29e-03 1.20e-03f 1 13 6.0004318e+01 3.42e-01 4.97e+00 -5.0 3.03e-01 - 7.67e-01 6.11e-03h 1 14 6.0000021e+01 3.41e-01 3.30e+01 -5.0 5.95e-01 - 8.94e-01 2.44e-03h 1 15 5.9999999e+01 3.41e-01 1.03e+05 -5.0 5.62e+00 - 1.00e+00 2.74e-04h 1 16 5.9999999e+01 3.41e-01 2.21e+09 -5.0 5.88e+00 - 1.00e+00 4.64e-05h 1 17r 5.9999999e+01 3.41e-01 1.00e+03 -0.5 0.00e+00 - 0.00e+00 2.32e-10R 2 18r 6.0000056e+01 3.40e-01 9.79e+02 -0.5 2.08e-01 - 6.40e-01 2.07e-02f 2 19r 6.0000071e+01 2.95e-01 9.45e+02 -0.5 6.73e+01 - 1.90e-01 5.05e-03f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 6.0000012e+01 2.95e-01 2.32e+04 -5.0 2.99e-01 - 7.98e-01 3.45e-05h 1 21r 6.0000012e+01 2.95e-01 1.00e+03 -0.5 0.00e+00 - 0.00e+00 2.69e-07R 6 22r 6.0000034e+01 2.97e-01 9.90e+02 -0.5 3.53e+00 - 1.00e+00 9.42e-03f 1 23r 6.0003513e+01 2.94e-01 2.31e-01 -0.5 6.07e-03 - 1.00e+00 1.00e+00f 1 24r 6.0000012e+01 2.96e-01 4.28e-04 -2.9 6.07e-03 - 1.00e+00 1.00e+00f 1 25r 6.0000000e+01 2.96e-01 2.84e-06 -4.3 2.79e-05 - 1.00e+00 1.00e+00f 1 26r 5.9999999e+01 2.96e-01 6.09e-07 -6.5 9.41e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 26 (scaled) (unscaled) Objective...............: -5.9999999400010807e+01 5.9999999400010807e+01 Dual infeasibility......: 4.9999999999999494e+00 4.9999999999999494e+00 Constraint violation....: 2.9563003754132744e-01 2.9563003754132744e-01 Variable bound violation: 8.9998961172454983e-08 8.9998961172454983e-08 Complementarity.........: 9.0925959992956629e-10 9.0925959992956629e-10 Overall NLP error.......: 1.4410244996103068e+00 4.9999999999999494e+00 Number of objective function evaluations = 49 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 49 Number of inequality constraint evaluations = 49 Number of equality constraint Jacobian evaluations = 33 Number of inequality constraint Jacobian evaluations = 33 Number of Lagrangian Hessian evaluations = 27 Total seconds in IPOPT = 0.015 EXIT: Converged to a point of local infeasibility. Problem may be infeasible. Test Summary: | Pass Error Total Time Juniper | 7238 2 7240 38m29.0s Function testing | 76 76 5m58.3s basic tests | 117 117 1m40.6s User limit testing | 6 6 9.3s parallel tests | 28 28 2m16.4s fp tests | 29 29 38.5s POD instances | 10 10 25.7s test_SolverName | 1 1 0.0s test_runtests | 6959 2 6961 26m00.3s test_DualObjectiveValue_Max_ScalarAffine_LessThan | 0 1.6s test_DualObjectiveValue_Max_VariableIndex_LessThan | 0 0.2s test_DualObjectiveValue_Min_ScalarAffine_GreaterThan | 0 0.2s test_DualObjectiveValue_Min_VariableIndex_GreaterThan | 0 0.2s test_HermitianPSDCone_basic | 0 5.2s test_HermitianPSDCone_min_t | 0 0.7s test_NormNuclearCone_VectorAffineFunction_with_transform | 0 5.9s test_NormNuclearCone_VectorAffineFunction_without_transform | 0 0.1s test_NormNuclearCone_VectorOfVariables_with_transform | 0 3.1s test_NormNuclearCone_VectorOfVariables_without_transform | 0 0.1s test_NormSpectralCone_VectorAffineFunction_with_transform | 0 4.9s test_NormSpectralCone_VectorAffineFunction_without_transform | 0 0.1s test_NormSpectralCone_VectorOfVariables_with_transform | 0 2.5s test_NormSpectralCone_VectorOfVariables_without_transform | 0 0.0s test_add_constrained_PositiveSemidefiniteConeTriangle | 34 34 18.3s test_add_constrained_PositiveSemidefiniteConeTriangle_VariableName | 1 1 0.1s test_add_constrained_PositiveSemidefiniteConeTriangle_VariablePrimalStart | 2 2 1.1s test_add_constrained_variables_vector | 6 6 0.5s test_add_parameter | 7 7 1.1s test_attribute_AbsoluteGapTolerance | 0 0.1s test_attribute_NodeLimit | 0 0.1s test_attribute_NumberThreads | 4 4 0.2s test_attribute_ObjectiveLimit | 0 0.1s test_attribute_RawStatusString | 1 1 0.1s test_attribute_RelativeGapTolerance | 0 0.1s test_attribute_Silent | 4 4 0.3s test_attribute_SolutionLimit | 0 0.1s test_attribute_SolveTimeSec | 2 2 0.2s test_attribute_SolverName | 1 1 0.1s test_attribute_SolverVersion | 1 1 0.1s test_attribute_TimeLimitSec | 4 4 0.2s test_attribute_after_empty | 4 4 0.1s test_attribute_unsupported_constraint | 0 0.8s test_basic_ScalarAffineFunction_EqualTo | 28 28 4.9s test_basic_ScalarAffineFunction_GreaterThan | 28 28 3.3s test_basic_ScalarAffineFunction_Integer | 28 28 5.1s test_basic_ScalarAffineFunction_Interval | 28 28 3.5s test_basic_ScalarAffineFunction_LessThan | 28 28 3.1s test_basic_ScalarAffineFunction_Semicontinuous | 28 28 5.0s test_basic_ScalarAffineFunction_Semiinteger | 28 28 4.8s test_basic_ScalarAffineFunction_ZeroOne | 28 28 4.2s test_basic_ScalarNonlinearFunction_EqualTo | 27 27 8.0s test_basic_ScalarNonlinearFunction_GreaterThan | 27 27 3.4s test_basic_ScalarNonlinearFunction_Integer | 27 27 4.7s test_basic_ScalarNonlinearFunction_Interval | 27 27 4.9s test_basic_ScalarNonlinearFunction_LessThan | 27 27 4.7s test_basic_ScalarNonlinearFunction_Semicontinuous | 27 27 4.5s test_basic_ScalarNonlinearFunction_Semiinteger | 27 27 4.7s test_basic_ScalarNonlinearFunction_ZeroOne | 27 27 4.7s test_basic_ScalarQuadraticFunction_EqualTo | 28 28 5.7s test_basic_ScalarQuadraticFunction_GreaterThan | 28 28 4.7s test_basic_ScalarQuadraticFunction_Integer | 28 28 5.1s test_basic_ScalarQuadraticFunction_Interval | 28 28 4.5s test_basic_ScalarQuadraticFunction_LessThan | 28 28 4.6s test_basic_ScalarQuadraticFunction_Semicontinuous | 28 28 4.7s test_basic_ScalarQuadraticFunction_Semiinteger | 28 28 4.7s test_basic_ScalarQuadraticFunction_ZeroOne | 28 28 4.9s test_basic_VariableIndex_EqualTo | 22 22 1.9s test_basic_VariableIndex_GreaterThan | 22 22 1.7s test_basic_VariableIndex_Integer | 22 22 1.9s test_basic_VariableIndex_Interval | 22 22 2.1s test_basic_VariableIndex_LessThan | 22 22 1.6s test_basic_VariableIndex_Semicontinuous | 22 22 2.3s test_basic_VariableIndex_Semiinteger | 22 22 2.2s test_basic_VariableIndex_ZeroOne | 22 22 1.9s test_basic_VectorAffineFunction_AllDifferent | 28 28 7.6s test_basic_VectorAffineFunction_BinPacking | 28 28 6.7s test_basic_VectorAffineFunction_Circuit | 28 28 6.4s test_basic_VectorAffineFunction_Complements | 28 28 6.1s test_basic_VectorAffineFunction_CountAtLeast | 28 28 7.0s test_basic_VectorAffineFunction_CountBelongs | 28 28 6.3s test_basic_VectorAffineFunction_CountDistinct | 28 28 6.2s test_basic_VectorAffineFunction_CountGreaterThan | 28 28 6.4s test_basic_VectorAffineFunction_Cumulative | 28 28 6.3s test_basic_VectorAffineFunction_DualExponentialCone | 28 28 6.1s test_basic_VectorAffineFunction_DualPowerCone | 28 28 6.2s test_basic_VectorAffineFunction_ExponentialCone | 28 28 5.9s test_basic_VectorAffineFunction_GeometricMeanCone | 28 28 5.3s test_basic_VectorAffineFunction_HermitianPositiveSemidefiniteConeTriangle | 28 28 4.1s test_basic_VectorAffineFunction_HyperRectangle | 28 28 6.4s test_basic_VectorAffineFunction_Indicator_GreaterThan | 28 28 5.9s test_basic_VectorAffineFunction_Indicator_LessThan | 28 28 5.8s test_basic_VectorAffineFunction_LogDetConeSquare | 28 28 6.0s test_basic_VectorAffineFunction_LogDetConeTriangle | 28 28 5.9s test_basic_VectorAffineFunction_Nonnegatives | 28 28 6.0s test_basic_VectorAffineFunction_Nonpositives | 28 28 5.5s test_basic_VectorAffineFunction_NormCone | 28 28 5.6s test_basic_VectorAffineFunction_NormInfinityCone | 28 28 5.7s test_basic_VectorAffineFunction_NormNuclearCone | 28 28 4.0s test_basic_VectorAffineFunction_NormOneCone | 28 28 4.0s test_basic_VectorAffineFunction_NormSpectralCone | 28 28 4.0s test_basic_VectorAffineFunction_Path | 28 28 6.1s test_basic_VectorAffineFunction_PositiveSemidefiniteConeSquare | 28 28 5.6s test_basic_VectorAffineFunction_PositiveSemidefiniteConeTriangle | 28 28 6.0s test_basic_VectorAffineFunction_PowerCone | 28 28 6.1s test_basic_VectorAffineFunction_RelativeEntropyCone | 28 28 6.3s test_basic_VectorAffineFunction_RootDetConeSquare | 28 28 6.2s test_basic_VectorAffineFunction_RootDetConeTriangle | 28 28 6.3s test_basic_VectorAffineFunction_RotatedSecondOrderCone | 28 28 6.1s test_basic_VectorAffineFunction_SOS1 | 28 28 6.3s test_basic_VectorAffineFunction_SOS2 | 28 28 6.4s test_basic_VectorAffineFunction_ScaledPositiveSemidefiniteConeTriangle | 28 28 6.1s test_basic_VectorAffineFunction_SecondOrderCone | 28 28 6.0s test_basic_VectorAffineFunction_Table | 28 28 6.6s test_basic_VectorAffineFunction_VectorNonlinearOracle | 28 28 7.6s test_basic_VectorAffineFunction_Zeros | 28 28 6.4s test_basic_VectorNonlinearFunction_AllDifferent | 27 27 12.6s test_basic_VectorNonlinearFunction_BinPacking | 27 27 6.2s test_basic_VectorNonlinearFunction_Circuit | 27 27 5.8s test_basic_VectorNonlinearFunction_Complements | 27 27 5.6s test_basic_VectorNonlinearFunction_CountAtLeast | 27 27 6.5s test_basic_VectorNonlinearFunction_CountBelongs | 27 27 6.1s test_basic_VectorNonlinearFunction_CountDistinct | 27 27 5.5s test_basic_VectorNonlinearFunction_CountGreaterThan | 27 27 5.7s test_basic_VectorNonlinearFunction_Cumulative | 27 27 5.9s test_basic_VectorNonlinearFunction_DualExponentialCone | 27 27 5.8s test_basic_VectorNonlinearFunction_DualPowerCone | 27 27 5.8s test_basic_VectorNonlinearFunction_ExponentialCone | 27 27 5.8s test_basic_VectorNonlinearFunction_GeometricMeanCone | 27 27 5.9s test_basic_VectorNonlinearFunction_HermitianPositiveSemidefiniteConeTriangle | 27 27 5.7s test_basic_VectorNonlinearFunction_HyperRectangle | 27 27 6.1s test_basic_VectorNonlinearFunction_LogDetConeSquare | 27 27 5.9s test_basic_VectorNonlinearFunction_LogDetConeTriangle | 27 27 6.0s test_basic_VectorNonlinearFunction_Nonnegatives | 27 27 5.8s test_basic_VectorNonlinearFunction_Nonpositives | 27 27 5.8s test_basic_VectorNonlinearFunction_NormCone | 27 27 5.9s test_basic_VectorNonlinearFunction_NormInfinityCone | 27 27 5.7s test_basic_VectorNonlinearFunction_NormNuclearCone | 27 27 5.8s test_basic_VectorNonlinearFunction_NormOneCone | 27 27 5.8s test_basic_VectorNonlinearFunction_NormSpectralCone | 27 27 5.8s test_basic_VectorNonlinearFunction_Path | 27 27 6.1s test_basic_VectorNonlinearFunction_PositiveSemidefiniteConeSquare | 27 27 6.9s test_basic_VectorNonlinearFunction_PositiveSemidefiniteConeTriangle | 27 27 5.7s test_basic_VectorNonlinearFunction_PowerCone | 27 27 5.7s test_basic_VectorNonlinearFunction_RelativeEntropyCone | 27 27 5.7s test_basic_VectorNonlinearFunction_RootDetConeSquare | 27 27 5.9s test_basic_VectorNonlinearFunction_RootDetConeTriangle | 27 27 5.8s test_basic_VectorNonlinearFunction_RotatedSecondOrderCone | 27 27 5.7s test_basic_VectorNonlinearFunction_SOS1 | 27 27 6.2s test_basic_VectorNonlinearFunction_SOS2 | 27 27 6.2s test_basic_VectorNonlinearFunction_ScaledPositiveSemidefiniteConeTriangle | 27 27 5.7s test_basic_VectorNonlinearFunction_SecondOrderCone | 27 27 5.9s test_basic_VectorNonlinearFunction_Table | 27 27 5.9s test_basic_VectorNonlinearFunction_VectorNonlinearOracle | 27 27 6.7s test_basic_VectorNonlinearFunction_Zeros | 27 27 5.8s test_basic_VectorOfVariables_AllDifferent | 24 24 4.3s test_basic_VectorOfVariables_BinPacking | 24 24 4.4s test_basic_VectorOfVariables_Circuit | 24 24 4.1s test_basic_VectorOfVariables_Complements | 24 24 3.9s test_basic_VectorOfVariables_CountAtLeast | 24 24 4.6s test_basic_VectorOfVariables_CountBelongs | 24 24 4.3s test_basic_VectorOfVariables_CountDistinct | 24 24 4.2s test_basic_VectorOfVariables_CountGreaterThan | 24 24 4.0s test_basic_VectorOfVariables_Cumulative | 24 24 3.9s test_basic_VectorOfVariables_DualExponentialCone | 24 24 4.1s test_basic_VectorOfVariables_DualPowerCone | 24 24 3.9s test_basic_VectorOfVariables_ExponentialCone | 24 24 3.9s test_basic_VectorOfVariables_GeometricMeanCone | 24 24 4.2s test_basic_VectorOfVariables_HermitianPositiveSemidefiniteConeTriangle | 24 24 4.0s test_basic_VectorOfVariables_HyperRectangle | 24 24 4.4s test_basic_VectorOfVariables_LogDetConeSquare | 24 24 4.2s test_basic_VectorOfVariables_LogDetConeTriangle | 24 24 4.1s test_basic_VectorOfVariables_Nonnegatives | 24 24 2.6s test_basic_VectorOfVariables_Nonpositives | 24 24 4.3s test_basic_VectorOfVariables_NormCone | 24 24 4.1s test_basic_VectorOfVariables_NormInfinityCone | 24 24 4.4s test_basic_VectorOfVariables_NormNuclearCone | 24 24 2.4s test_basic_VectorOfVariables_NormOneCone | 24 24 4.1s test_basic_VectorOfVariables_NormSpectralCone | 24 24 2.4s test_basic_VectorOfVariables_Path | 24 24 4.5s test_basic_VectorOfVariables_PositiveSemidefiniteConeSquare | 24 24 4.2s test_basic_VectorOfVariables_PositiveSemidefiniteConeTriangle | 24 24 2.5s test_basic_VectorOfVariables_PowerCone | 24 24 4.3s test_basic_VectorOfVariables_RelativeEntropyCone | 24 24 4.2s test_basic_VectorOfVariables_RootDetConeSquare | 24 24 4.3s test_basic_VectorOfVariables_RootDetConeTriangle | 24 24 4.1s test_basic_VectorOfVariables_RotatedSecondOrderCone | 24 24 4.3s test_basic_VectorOfVariables_SOS1 | 24 24 4.3s test_basic_VectorOfVariables_SOS2 | 24 24 4.3s test_basic_VectorOfVariables_ScaledPositiveSemidefiniteConeTriangle | 24 24 4.2s test_basic_VectorOfVariables_SecondOrderCone | 24 24 4.2s test_basic_VectorOfVariables_Table | 24 24 4.5s test_basic_VectorOfVariables_VectorNonlinearOracle | 24 24 4.9s test_basic_VectorOfVariables_Zeros | 24 24 4.2s test_basic_VectorQuadraticFunction_AllDifferent | 28 28 10.3s test_basic_VectorQuadraticFunction_BinPacking | 28 28 6.6s test_basic_VectorQuadraticFunction_Circuit | 28 28 6.3s test_basic_VectorQuadraticFunction_Complements | 28 28 6.2s test_basic_VectorQuadraticFunction_CountAtLeast | 28 28 6.4s test_basic_VectorQuadraticFunction_CountBelongs | 28 28 6.6s test_basic_VectorQuadraticFunction_CountDistinct | 28 28 6.3s test_basic_VectorQuadraticFunction_CountGreaterThan | 28 28 6.0s test_basic_VectorQuadraticFunction_Cumulative | 28 28 6.2s test_basic_VectorQuadraticFunction_DualExponentialCone | 28 28 6.0s test_basic_VectorQuadraticFunction_DualPowerCone | 28 28 5.9s test_basic_VectorQuadraticFunction_ExponentialCone | 28 28 5.7s test_basic_VectorQuadraticFunction_GeometricMeanCone | 28 28 5.6s test_basic_VectorQuadraticFunction_HermitianPositiveSemidefiniteConeTriangle | 28 28 5.5s test_basic_VectorQuadraticFunction_HyperRectangle | 28 28 5.8s test_basic_VectorQuadraticFunction_LogDetConeSquare | 28 28 5.7s test_basic_VectorQuadraticFunction_LogDetConeTriangle | 28 28 6.0s test_basic_VectorQuadraticFunction_Nonnegatives | 28 28 5.9s test_basic_VectorQuadraticFunction_Nonpositives | 28 28 6.4s test_basic_VectorQuadraticFunction_NormCone | 28 28 6.2s test_basic_VectorQuadraticFunction_NormInfinityCone | 28 28 6.3s test_basic_VectorQuadraticFunction_NormNuclearCone | 28 28 6.2s test_basic_VectorQuadraticFunction_NormOneCone | 28 28 5.7s test_basic_VectorQuadraticFunction_NormSpectralCone | 28 28 5.9s test_basic_VectorQuadraticFunction_Path | 28 28 6.5s test_basic_VectorQuadraticFunction_PositiveSemidefiniteConeSquare | 28 28 6.0s test_basic_VectorQuadraticFunction_PositiveSemidefiniteConeTriangle | 28 28 5.9s test_basic_VectorQuadraticFunction_PowerCone | 28 28 6.2s test_basic_VectorQuadraticFunction_RelativeEntropyCone | 28 28 5.9s test_basic_VectorQuadraticFunction_RootDetConeSquare | 28 28 6.1s test_basic_VectorQuadraticFunction_RootDetConeTriangle | 28 28 5.9s test_basic_VectorQuadraticFunction_RotatedSecondOrderCone | 28 28 6.1s test_basic_VectorQuadraticFunction_SOS1 | 28 28 6.1s test_basic_VectorQuadraticFunction_SOS2 | 28 28 6.5s test_basic_VectorQuadraticFunction_ScaledPositiveSemidefiniteConeTriangle | 28 28 6.0s test_basic_VectorQuadraticFunction_SecondOrderCone | 28 28 6.1s test_basic_VectorQuadraticFunction_Table | 28 28 6.3s test_basic_VectorQuadraticFunction_VectorNonlinearOracle | 28 28 6.8s test_basic_VectorQuadraticFunction_Zeros | 28 28 6.2s test_conic_DualExponentialCone_VectorAffineFunction | 2 2 5.4s test_conic_DualExponentialCone_VectorOfVariables | 2 2 1.7s test_conic_DualPowerCone_VectorAffineFunction | 2 2 3.6s test_conic_DualPowerCone_VectorOfVariables | 2 2 1.8s test_conic_Exponential_VectorAffineFunction | 2 2 3.0s test_conic_Exponential_VectorOfVariables | 2 2 1.9s test_conic_Exponential_hard | 3 3 2.0s test_conic_Exponential_hard_2 | 2 2 5.2s test_conic_GeometricMeanCone_VectorAffineFunction | 3 3 4.9s test_conic_GeometricMeanCone_VectorAffineFunction_2 | 4 4 2.2s test_conic_GeometricMeanCone_VectorAffineFunction_3 | 4 4 1.1s test_conic_GeometricMeanCone_VectorOfVariables | 3 3 1.7s test_conic_GeometricMeanCone_VectorOfVariables_2 | 4 4 0.1s test_conic_GeometricMeanCone_VectorOfVariables_3 | 4 4 0.1s test_conic_HermitianPositiveSemidefiniteConeTriangle_1 | 0 4.9s test_conic_HermitianPositiveSemidefiniteConeTriangle_2 | 0 1.0s test_conic_LogDetConeSquare | 3 3 3.2s test_conic_LogDetConeSquare_VectorAffineFunction | 6 6 3.5s test_conic_LogDetConeSquare_VectorOfVariables | 6 6 1.6s test_conic_LogDetConeTriangle | 3 3 2.1s test_conic_LogDetConeTriangle_VectorAffineFunction | 6 6 2.4s test_conic_LogDetConeTriangle_VectorOfVariables | 6 6 1.6s test_conic_NormCone | 0 2.2s test_conic_NormInfinityCone_3 | 13 13 3.4s test_conic_NormInfinityCone_VectorAffineFunction | 15 15 3.5s test_conic_NormInfinityCone_VectorOfVariables | 15 15 2.6s test_conic_NormNuclearCone | 2 2 1.2s test_conic_NormNuclearCone_2 | 2 2 0.7s test_conic_NormOneCone | 13 13 2.5s test_conic_NormOneCone_VectorAffineFunction | 15 15 2.0s test_conic_NormOneCone_VectorOfVariables | 15 15 2.6s test_conic_NormSpectralCone | 2 2 1.0s test_conic_NormSpectralCone_2 | 2 2 0.7s test_conic_PositiveSemidefiniteConeSquare_3 | 1 1 2.4s test_conic_PositiveSemidefiniteConeSquare_VectorAffineFunction | 4 4 1.9s test_conic_PositiveSemidefiniteConeSquare_VectorAffineFunction_2 | 6 6 5.9s test_conic_PositiveSemidefiniteConeSquare_VectorOfVariables | 4 4 1.7s test_conic_PositiveSemidefiniteConeSquare_VectorOfVariables_2 | 6 6 0.4s test_conic_PositiveSemidefiniteConeTriangle | 6 6 5.7s test_conic_PositiveSemidefiniteConeTriangle_3 | 1 1 0.6s test_conic_PositiveSemidefiniteConeTriangle_4 | 1 1 3.4s test_conic_PositiveSemidefiniteConeTriangle_VectorAffineFunction | 4 4 1.3s test_conic_PositiveSemidefiniteConeTriangle_VectorAffineFunction_2 | 6 6 3.0s test_conic_PositiveSemidefiniteConeTriangle_VectorOfVariables | 4 4 0.1s test_conic_PositiveSemidefiniteConeTriangle_VectorOfVariables_2 | 6 6 0.3s test_conic_PowerCone_VectorAffineFunction | 2 2 2.7s test_conic_PowerCone_VectorOfVariables | 2 2 1.8s test_conic_RelativeEntropyCone | 2 2 1.9s test_conic_RootDetConeSquare | 3 3 3.4s test_conic_RootDetConeSquare_VectorAffineFunction | 5 5 2.4s test_conic_RootDetConeSquare_VectorOfVariables | 5 5 1.9s test_conic_RootDetConeTriangle | 3 3 2.3s test_conic_RootDetConeTriangle_VectorAffineFunction | 5 5 2.2s test_conic_RootDetConeTriangle_VectorOfVariables | 5 5 1.8s test_conic_RotatedSecondOrderCone_INFEASIBLE | 8 8 4.2s test_conic_RotatedSecondOrderCone_INFEASIBLE_2 | 11 11 8.1s test_conic_RotatedSecondOrderCone_VectorAffineFunction | 3 3 2.5s test_conic_RotatedSecondOrderCone_VectorOfVariables | 5 5 0.1s test_conic_RotatedSecondOrderCone_out_of_order | 1 1 1.3s test_conic_ScaledPositiveSemidefiniteConeTriangle_VectorAffineFunction | 4 4 2.5s test_conic_SecondOrderCone_INFEASIBLE | 4 4 0.9s test_conic_SecondOrderCone_Nonnegatives | 4 4 1.6s test_conic_SecondOrderCone_Nonpositives | 4 4 0.1s test_conic_SecondOrderCone_VectorAffineFunction | 6 6 1.7s test_conic_SecondOrderCone_VectorOfVariables | 6 6 0.1s test_conic_SecondOrderCone_negative_initial_bound | 0 1.1s test_conic_SecondOrderCone_negative_post_bound | 0 0.3s test_conic_SecondOrderCone_negative_post_bound_2 | 0 0.3s test_conic_SecondOrderCone_negative_post_bound_3 | 0 0.4s test_conic_SecondOrderCone_no_initial_bound | 0 0.3s test_conic_SecondOrderCone_nonnegative_initial_bound | 0 0.3s test_conic_SecondOrderCone_nonnegative_post_bound | 0 0.3s test_conic_SecondOrderCone_out_of_order | 3 3 1.6s test_conic_empty_matrix | 0 0.3s test_conic_linear_VectorAffineFunction | 13 13 1.8s test_conic_linear_VectorAffineFunction_2 | 18 18 4.2s test_constraint_ConstraintDualStart | 3 3 0.8s test_constraint_ConstraintPrimalStart | 3 3 0.6s test_constraint_Indicator_ACTIVATE_ON_ONE | 2 2 0.7s test_constraint_Indicator_ACTIVATE_ON_ZERO | 2 2 1.5s test_constraint_Indicator_ConstraintName | 1 1 0.1s test_constraint_PrimalStart_DualStart_SecondOrderCone | 0 1.7s test_constraint_ScalarAffineFunction_EqualTo | 6 6 0.6s test_constraint_ScalarAffineFunction_GreaterThan | 6 6 0.6s test_constraint_ScalarAffineFunction_Interval | 6 6 0.9s test_constraint_ScalarAffineFunction_LessThan | 6 6 0.5s test_constraint_ScalarAffineFunction_duplicate | 6 6 0.2s test_constraint_VectorAffineFunction_duplicate | 6 6 0.7s test_constraint_ZeroOne_bounds | 4 4 0.4s test_constraint_ZeroOne_bounds_2 | 4 4 0.1s test_constraint_get_ConstraintIndex | 7 7 0.8s test_constraint_qcp_duplicate_diagonal | 7 7 1.3s test_constraint_qcp_duplicate_off_diagonal | 7 7 0.8s test_cpsat_AllDifferent | 0 4.3s test_cpsat_BinPacking | 0 2.9s test_cpsat_Circuit | 0 1.9s test_cpsat_CountAtLeast | 0 2.6s test_cpsat_CountBelongs | 0 2.0s test_cpsat_CountDistinct | 0 1.8s test_cpsat_CountGreaterThan | 0 2.1s test_cpsat_Cumulative | 0 3.5s test_cpsat_Path | 0 3.0s test_cpsat_ReifiedAllDifferent | 0 4.2s test_cpsat_Table | 0 1.9s test_infeasible_MAX_SENSE | 0 0.2s test_infeasible_MAX_SENSE_offset | 0 0.1s test_infeasible_MIN_SENSE | 0 0.1s test_infeasible_MIN_SENSE_offset | 0 0.1s test_infeasible_affine_MAX_SENSE | 0 0.3s test_infeasible_affine_MAX_SENSE_offset | 0 0.1s test_infeasible_affine_MIN_SENSE | 0 0.1s test_infeasible_affine_MIN_SENSE_offset | 0 0.1s test_linear_FEASIBILITY_SENSE | 9 9 0.9s test_linear_HyperRectangle_VectorAffineFunction | 2 2 2.5s test_linear_HyperRectangle_VectorOfVariables | 2 2 2.3s test_linear_Indicator_ON_ONE | 1 1 2.5s test_linear_Indicator_ON_ZERO | 3 3 3.1s test_linear_Indicator_constant_term | 1 1 0.6s test_linear_Indicator_integration | 1 1 0.6s test_linear_Interval_inactive | 7 7 1.1s test_linear_LessThan_and_GreaterThan | 16 16 1.3s test_linear_SOS1_integration | 9 9 3.7s test_linear_SOS2_integration | 21 21 4.2s test_linear_Semicontinuous_integration | 6 6 7.8s test_linear_Semiinteger_integration | 6 6 2.0s test_linear_VariablePrimalStart_partial | 5 5 0.5s test_linear_VectorAffineFunction | 16 16 1.5s test_linear_add_constraints | 8 8 1.3s test_linear_complex_Zeros | 5 5 7.2s test_linear_complex_Zeros_duplicate | 5 5 0.5s test_linear_inactive_bounds | 20 20 2.6s test_linear_integer_integration | 21 21 2.1s test_linear_integer_knapsack | 13 13 1.1s test_linear_integer_solve_twice | 19 19 1.0s test_linear_integration | 86 86 52.5s test_linear_integration_2 | 13 13 1.4s test_linear_integration_Interval | 20 20 2.9s test_linear_integration_delete_variables | 22 22 1m05.1s test_linear_integration_modification | 22 22 3.1s test_linear_modify_GreaterThan_and_LessThan_constraints | 28 28 1.6s test_linear_open_intervals | 1 1 0.2s test_linear_transform | 10 10 0.7s test_linear_variable_open_intervals | 1 1 0.1s test_model_ListOfConstraintAttributesSet | 2 2 0.3s test_model_ListOfConstraintsWithAttributeSet | 1 1 0.7s test_model_ListOfVariablesWithAttributeSet | 1 1 0.1s test_model_LowerBoundAlreadySet | 4 4 0.3s test_model_ModelFilter_AbstractConstraintAttribute | 2 2 2.3s test_model_ModelFilter_AbstractModelAttribute | 1 1 1.5s test_model_ModelFilter_AbstractVariableAttribute | 2 2 1.0s test_model_ModelFilter_ListOfConstraintIndices | 10 10 1.6s test_model_ModelFilter_ListOfConstraintTypesPresent | 3 3 1.8s test_model_Name | 7 7 0.2s test_model_Name_VariableName_ConstraintName | 72 72 7.9s test_model_ScalarAffineFunction_ConstraintName | 5 5 0.2s test_model_ScalarFunctionConstantNotZero | 2 2 0.2s test_model_UpperBoundAlreadySet | 4 4 0.2s test_model_VariableIndex_ConstraintName | 1 1 0.0s test_model_VariableName | 6 6 0.3s test_model_VariablePrimalStart | 3 3 0.3s test_model_add_constrained_variable_tuple | 6 6 0.3s test_model_default_DualStatus | 1 1 0.0s test_model_default_ObjectiveSense | 1 1 0.0s test_model_default_PrimalStatus | 1 1 0.1s test_model_default_TerminationStatus | 1 1 0.0s test_model_delete | 64 64 6.2s test_model_duplicate_ScalarAffineFunction_ConstraintName | 6 6 0.7s test_model_duplicate_VariableName | 6 6 0.2s test_model_empty | 3 3 0.0s test_model_is_valid | 9 9 0.9s test_model_ordered_indices | 12 12 0.6s test_model_show | 1 1 0.5s test_modification_affine_deletion_edge_cases | 24 24 1.3s test_modification_coef_scalar_objective | 8 8 0.1s test_modification_coef_scalaraffine_lessthan | 12 12 0.2s test_modification_const_scalar_objective | 8 8 0.3s test_modification_const_vectoraffine_nonpos | 14 14 0.5s test_modification_const_vectoraffine_zeros | 14 14 0.9s test_modification_constraint_scalarquadraticcoefficientchange | 3 3 1.4s test_modification_delete_variable_with_single_variable_obj | 6 6 0.5s test_modification_delete_variables_in_a_batch | 8 8 0.5s test_modification_func_scalaraffine_lessthan | 11 11 0.6s test_modification_func_vectoraffine_nonneg | 15 15 0.9s test_modification_incorrect | 2 2 0.4s test_modification_incorrect_VariableIndex | 3 3 0.3s test_modification_mathoptinterface_issue_2452 | 3 3 0.3s test_modification_multirow_vectoraffine_nonpos | 12 12 0.8s test_modification_objective_scalarquadraticcoefficientchange | 5 5 0.8s test_modification_set_function_single_variable | 1 1 0.1s test_modification_set_scalaraffine_lessthan | 13 13 0.2s test_modification_set_singlevariable_lessthan | 13 13 0.7s test_modification_transform_singlevariable_lessthan | 14 14 0.2s test_multiobjective_vector_affine_function | 2 2 0.5s test_multiobjective_vector_affine_function_delete | 3 3 0.2s test_multiobjective_vector_affine_function_delete_vector | 3 3 0.1s test_multiobjective_vector_affine_function_modify | 3 3 0.4s test_multiobjective_vector_nonlinear | 2 2 1.1s test_multiobjective_vector_nonlinear_delete | 3 3 0.4s test_multiobjective_vector_nonlinear_delete_vector | 3 3 0.3s test_multiobjective_vector_nonlinear_modify | 3 3 0.6s test_multiobjective_vector_of_variables | 2 2 0.4s test_multiobjective_vector_of_variables_delete | 3 3 0.1s test_multiobjective_vector_of_variables_delete_all | 4 4 0.2s test_multiobjective_vector_of_variables_delete_vector | 4 4 0.1s test_multiobjective_vector_quadratic_function | 2 2 1.5s test_multiobjective_vector_quadratic_function_delete | 3 3 0.4s test_multiobjective_vector_quadratic_function_delete_vector | 3 3 0.2s test_multiobjective_vector_quadratic_function_modify | 3 3 0.6s test_nonlinear_Feasibility_internal | 9 9 0.5s test_nonlinear_HS071_internal | 11 11 1.3s test_nonlinear_InvalidEvaluator_internal | 3 3 0.1s test_nonlinear_constraint_log | 6 6 0.4s test_nonlinear_constraint_scalar_affine_function | 1 1 1.2s test_nonlinear_constraint_uminus | 2 2 0.2s test_nonlinear_duals | 0 7.7s test_nonlinear_expression_hs071 | 2 2 3.2s test_nonlinear_expression_hs071_epigraph | 2 2 0.4s test_nonlinear_expression_hs109 | 2 2 0.5s test_nonlinear_expression_hs110 | 2 2 0.3s test_nonlinear_expression_multivariate_function | 4 4 0.7s test_nonlinear_expression_overrides_objective | 6 6 0.9s test_nonlinear_expression_quartic | 2 2 0.3s test_nonlinear_expression_univariate_function | 2 2 0.8s test_nonlinear_hs071 | 14 14 1.8s test_nonlinear_hs071_NLPBlockDual | 0 1.2s test_nonlinear_hs071_hessian_vector_product | 14 14 0.1s test_nonlinear_hs071_no_hessian | 14 14 0.1s test_nonlinear_invalid | 1 1 0.1s test_nonlinear_mixed_complementarity | 1 1 2.0s test_nonlinear_objective | 6 6 0.6s test_nonlinear_objective_and_moi_objective_test | 6 6 0.5s test_nonlinear_qp_complementarity_constraint | 1 1 4.1s test_nonlinear_quadratic_1 | 4 4 0.2s test_nonlinear_quadratic_2 | 4 4 0.3s test_nonlinear_quadratic_3 | 4 4 0.2s test_nonlinear_quadratic_4 | 4 4 0.3s test_nonlinear_vector_complements | 0 2.2s test_nonlinear_with_scalar_quadratic_function_with_off_diag | 8 8 0.5s test_nonlinear_without_objective | 6 6 0.4s test_objective_FEASIBILITY_SENSE_clears_objective | 2 2 0.1s test_objective_ObjectiveFunction_VariableIndex | 8 8 0.1s test_objective_ObjectiveFunction_blank | 2 2 0.1s test_objective_ObjectiveFunction_constant | 6 6 0.1s test_objective_ObjectiveFunction_duplicate_terms | 7 7 0.2s test_objective_ObjectiveSense_FEASIBILITY_SENSE | 1 1 0.0s test_objective_ObjectiveSense_MAX_SENSE | 1 1 0.0s test_objective_ObjectiveSense_MIN_SENSE | 1 1 0.0s test_objective_ObjectiveSense_in_ListOfModelAttributesSet | 2 2 0.1s test_objective_ScalarAffineFunction_in_ListOfModelAttributesSet | 2 2 0.1s test_objective_ScalarQuadraticFunction_in_ListOfModelAttributesSet | 2 2 0.1s test_objective_VariableIndex_in_ListOfModelAttributesSet | 2 2 0.1s test_objective_get_ObjectiveFunction_ScalarAffineFunction | 5 5 0.1s test_objective_qp_ObjectiveFunction_edge_cases | 21 21 1.0s test_objective_qp_ObjectiveFunction_zero_ofdiag | 7 7 0.4s test_objective_set_via_modify | 2 2 0.3s test_quadratic_Integer_SecondOrderCone | 8 8 0.7s test_quadratic_SecondOrderCone_basic | 14 14 1.3s test_quadratic_constraint_GreaterThan | 14 14 1.9s test_quadratic_constraint_LessThan | 14 14 0.0s test_quadratic_constraint_basic | 10 10 0.4s test_quadratic_constraint_integration | 12 12 1.0s test_quadratic_constraint_minimize | 10 10 0.6s test_quadratic_duplicate_terms | 18 18 1.9s test_quadratic_integration | 12 12 1.1s test_quadratic_nonconvex_constraint_basic | 15 15 1.3s test_quadratic_nonconvex_constraint_integration | 15 15 0.8s test_quadratic_nonhomogeneous | 15 15 1.7s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_EqualTo_lower | 0 0.3s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_EqualTo_upper | 0 0.3s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_GreaterThan | 0 0.3s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_Interval_lower | 0 0.3s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_Interval_upper | 0 0.3s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_LessThan | 0 0.3s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_VariableIndex_LessThan | 0 0.3s test_solve_DualStatus_INFEASIBILITY_CERTIFICATE_VariableIndex_LessThan_max | 0 0.3s test_solve_ObjectiveBound_MAX_SENSE_IP | 5 5 0.2s test_solve_ObjectiveBound_MAX_SENSE_LP | 5 5 0.1s test_solve_ObjectiveBound_MIN_SENSE_IP | 5 5 0.2s test_solve_ObjectiveBound_MIN_SENSE_LP | 5 5 0.1s test_solve_SOS2_add_and_delete | 1 1 2.3s test_solve_VariableIndex_ConstraintDual_MAX_SENSE | 0 0.2s test_solve_VariableIndex_ConstraintDual_MIN_SENSE | 0 0.2s test_solve_conflict_EqualTo | 0 0.5s test_solve_conflict_NOT_IN_CONFLICT | 0 0.3s test_solve_conflict_affine_affine | 0 0.3s test_solve_conflict_bound_bound | 0 0.1s test_solve_conflict_feasible | 0 0.1s test_solve_conflict_invalid_interval | 0 0.1s test_solve_conflict_two_affine | 0 0.2s test_solve_conflict_zeroone | 0 0.1s test_solve_conflict_zeroone_2 | 0 0.3s test_solve_optimize_twice | 0 0.2s test_unbounded_MAX_SENSE | 0 0.2s test_unbounded_MAX_SENSE_offset | 0 0.2s test_unbounded_MIN_SENSE | 0 0.2s test_unbounded_MIN_SENSE_offset | 0 0.2s test_variable_VariableName | 4 4 0.3s test_variable_add_variable | 3 3 0.2s test_variable_add_variables | 2 2 0.1s test_variable_delete | 3 3 0.2s test_variable_delete_Nonnegatives | 13 13 0.7s test_variable_delete_Nonnegatives_row | 12 12 0.5s test_variable_delete_SecondOrderCone | 10 10 0.5s test_variable_delete_variables | 9 9 0.6s test_variable_get_VariableIndex | 2 2 0.1s test_variable_solve_Integer_with_lower_bound | 4 4 0.1s test_variable_solve_Integer_with_upper_bound | 4 4 0.1s test_variable_solve_ZeroOne_with_0_upper_bound | 4 4 0.1s test_variable_solve_ZeroOne_with_1_lower_bound | 4 4 0.1s test_variable_solve_ZeroOne_with_bounds_then_delete | 8 8 0.2s test_variable_solve_ZeroOne_with_upper_bound | 4 4 0.1s test_variable_solve_with_lowerbound | 7 7 0.7s test_variable_solve_with_upperbound | 9 9 0.2s test_vector_nonlinear_oracle | 39 1 40 7.4s test_vector_nonlinear_oracle_no_hessian | 7 1 8 1.4s test_simple_conic_model | 6 6 37.8s test_simple_conic_model_ipopt | 6 6 10.0s RNG of the outermost testset: Random.Xoshiro(0x0a3ba0738e05acdb, 0x06e7d47584d505f5, 0xbb448f243726e952, 0x850e2ed18c68aa83, 0x6aad31440723f6e9) ERROR: LoadError: Some tests did not pass: 7238 passed, 0 failed, 2 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Juniper/93Umc/test/runtests.jl:86 Testing failed after 2313.39s ERROR: LoadError: Package Juniper errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{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.14/Pkg/src/Operations.jl:2946 [3] test @ /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:2795 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{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.14/Pkg/src/API.jl:572 [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:548 [6] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:172 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:161 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [9] test @ /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [12] include(mod::Module, _path::String) @ Base ./Base.jl:309 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [14] _start() @ Base ./client.jl:577 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 2692.9s: package tests unexpectedly errored