Package evaluation of Juniper on Julia 1.10.8 (92f03a4775*) started at 2025-02-25T08:18:39.441 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 3.84s ################################################################################ # Installation # Installing Juniper... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [2ddba703] + Juniper v0.9.2 Updating `~/.julia/environments/v1.10/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [864edb3b] + DataStructures v0.18.20 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.3 [f6369f11] + ForwardDiff v0.10.38 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.1 [2ddba703] + Juniper v0.9.2 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.37.0 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.2 [bac558e1] + OrderedCollections v1.8.0 [69de0a69] + Parsers v2.8.1 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [276daf66] + SpecialFunctions v2.5.0 [1e83bf80] + StaticArraysCore v1.4.3 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [8ba89e20] + Distributed [b77e0a4c] + InteractiveUtils [76f85450] + LibGit2 [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [ca575930] + NetworkOptions v1.2.0 [de0858da] + Printf [9abbd945] + Profile [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [6462fe0b] + Sockets [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [e37daf67] + LibGit2_jll v1.6.4+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.2+1 [4536629a] + OpenBLAS_jll v0.3.23+4 [05823500] + OpenLibm_jll v0.8.1+4 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Installation completed after 4.95s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 20.34s ################################################################################ # Testing # Testing Juniper Status `/tmp/jl_9PPgkZ/Project.toml` [60bf3e95] GLPK v1.2.1 [87dc4568] HiGHS v1.13.0 [b6b21f68] Ipopt v1.7.2 [682c06a0] JSON v0.21.4 [4076af6c] JuMP v1.24.0 [2ddba703] Juniper v0.9.2 [b8f27783] MathOptInterface v1.37.0 [d8a4904e] MutableArithmetics v1.6.4 ⌅ [c946c3f1] SCS v1.3.1 [8ba89e20] Distributed [37e2e46d] LinearAlgebra [9a3f8284] Random [10745b16] Statistics v1.10.0 [8dfed614] Test Status `/tmp/jl_9PPgkZ/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [864edb3b] DataStructures v0.18.20 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.3 [f6369f11] ForwardDiff v0.10.38 [60bf3e95] GLPK v1.2.1 [87dc4568] HiGHS v1.13.0 [b6b21f68] Ipopt v1.7.2 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.1 [4076af6c] JuMP v1.24.0 [2ddba703] Juniper v0.9.2 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.37.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.2 [bac558e1] OrderedCollections v1.8.0 [69de0a69] Parsers v2.8.1 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [ae029012] Requires v1.3.0 ⌅ [c946c3f1] SCS v1.3.1 [276daf66] SpecialFunctions v2.5.0 [1e83bf80] StaticArraysCore v1.4.3 [856f2bd8] StructTypes v1.11.0 [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.9.0+0 [e33a78d0] Hwloc_jll v2.12.0+0 ⌅ [1d5cc7b8] IntelOpenMP_jll v2023.2.0+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [856f044c] MKL_jll v2022.2.0+0 [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 ⌅ [656ef2d0] OpenBLAS32_jll v0.3.24+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 v2024.5.8+0 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [8ba89e20] Distributed [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [b77e0a4c] InteractiveUtils [4af54fe1] LazyArtifacts [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [781609d7] GMP_jll v6.2.1+6 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [4536629a] OpenBLAS_jll v0.3.23+4 [05823500] OpenLibm_jll v0.8.1+4 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Workers:4 ┌ Error: The option branch doesn't exist. └ @ Juniper ~/.julia/packages/Juniper/HBPrQ/src/MOI_wrapper/MOI_wrapper.jl:91 ┌ Error: The option branch doesn't exist. └ @ Juniper ~/.julia/packages/Juniper/HBPrQ/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(Ipopt.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(Ipopt.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/HBPrQ/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. ================================== 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/HBPrQ/src/fpump.jl:372 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/HBPrQ/src/BnBTree.jl:759 ================================== BATCH.MOD RESTART ================================== Solution by Juniper obj: 285506.5005447486 ================================== BATCH.MOD RESTART 2 LEVELS ================================== Solution by Juniper obj: 285506.5005468936 ================================== cvxnonsep_nsig20r.MOD RESTART ================================== Solution by Juniper obj: 80.9492780572405 ================================== cvxnonsep_nsig20r.MOD NO RESTART ================================== Solution by Juniper obj: 80.9492780572405 ================================== 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/HBPrQ/src/BnBTree.jl:767 ================================== Bruteforce best_obj_stop reachable ================================== ================================== Sum 1/x = 2 ================================== ================================== Sum 1/x = 2 don't allow almost ================================== ================================== 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/HBPrQ/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/HBPrQ/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/HBPrQ/src/fpump.jl:405 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/HBPrQ/src/fpump.jl:372 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/HBPrQ/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/HBPrQ/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/HBPrQ/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/HBPrQ/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/HBPrQ/src/fpump.jl:372 ================================== FP: Integer Test ================================== ================================== FP: Integer Test 2 ================================== ================================== FP: Infeasible cos ================================== ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/HBPrQ/src/fpump.jl:372 Status: LOCALLY_INFEASIBLE ================================== FP: tspn05 ================================== ================================== FP: FLay02H ================================== ================================== FP: FLay02H short feasibility_pump_time_limit ================================== ================================== FP: Issue 195: FPump without objective ================================== ================================== FP: Issue 263: FPump with ScalarNonlinearFunction ================================== WARNING: Method definition batch_problem() in module Main at /home/pkgeval/.julia/packages/Juniper/HBPrQ/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/HBPrQ/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/HBPrQ/src/fpump.jl:372 ================================== nous1 no restart ================================== ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/HBPrQ/src/fpump.jl:372 ================================== 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/jN9gE/src/Test/Test.jl:242 ┌ 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/jN9gE/src/Test/Test.jl:242 ┌ 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/jN9gE/src/Test/Test.jl:242 ┌ 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/jN9gE/src/Test/Test.jl:242 A Juniper MathOptInterface model with backend 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: 27.203950881958008 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.17, running with linear solver MUMPS 5.7.3. 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.001 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. 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.004 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. 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.006 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. 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.005 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. 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.004 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. 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.004 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. 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.003 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. 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.012 EXIT: Converged to a point of local infeasibility. Problem may be infeasible. Test Summary: | Pass Total Time Juniper | 6330 6330 18m32.4s Time for all tests: 1112.7715368270874 Testing Juniper tests passed Testing completed after 1170.7s PkgEval succeeded after 1281.17s