Package evaluation to test LiftAndLearn on Julia 1.14.0-DEV.1601 (79ea5eb99c*) started at 2026-01-24T17:27:12.048 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 9.59s ################################################################################ # Installation # Installing LiftAndLearn... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [192fc49d] + LiftAndLearn v1.1.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [66dad0bd] + AliasTables v1.1.3 [6e4b80f9] + BenchmarkTools v1.6.3 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.1.0 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.19.3 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [1a297f60] + FillArrays v1.16.0 [26cc04aa] + FiniteDifferences v0.12.33 [f6369f11] + ForwardDiff v1.3.1 [b6b21f68] + Ipopt v1.14.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.29.4 [2c470bb0] + Kronecker v0.5.5 [192fc49d] + LiftAndLearn v1.1.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.48.0 [e1d29d7a] + Missings v1.2.0 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [356022a1] + NamedDims v1.2.3 [bac558e1] + OrderedCollections v1.8.1 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [43287f4e] + PtrArrays v1.3.0 [708f8203] + Richardson v1.4.2 [c946c3f1] + SCS v2.6.0 [a2af1166] + SortingAlgorithms v1.2.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.16 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.8.0 [2913bbd2] + StatsBase v0.34.10 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.2 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 ⌅ [dd29a912] + UniqueKronecker v0.1.0 [ae81ac8f] + ASL_jll v0.1.3+0 [6e34b625] + Bzip2_jll v1.0.9+0 [e33a78d0] + Hwloc_jll v2.12.2+0 [9cc047cb] + Ipopt_jll v300.1400.1901+0 [1d63c593] + LLVMOpenMP_jll v18.1.8+0 [94ce4f54] + Libiconv_jll v1.18.0+0 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.800.200+0 [656ef2d0] + OpenBLAS32_jll v0.3.30+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] + SCS_jll v300.200.1100+0 [319450e9] + SPRAL_jll v2025.9.18+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 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.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.14.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 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.18.0+0 [e37daf67] + LibGit2_jll v1.9.2+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.12.2 [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.68.0+1 [3f19e933] + p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.19s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 3374.9 ms ✓ UniqueKronecker 50058.3 ms ✓ SCS 20880.4 ms ✓ LiftAndLearn 3 dependencies successfully precompiled in 78 seconds. 111 already precompiled. Precompilation completed after 92.86s ################################################################################ # Testing # Testing LiftAndLearn Status `/tmp/jl_CojApw/Project.toml` [192fc49d] LiftAndLearn v1.1.0 [37e2e46d] LinearAlgebra v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_CojApw/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [6e4b80f9] BenchmarkTools v1.6.3 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.1.0 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.3 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [1a297f60] FillArrays v1.16.0 [26cc04aa] FiniteDifferences v0.12.33 [f6369f11] ForwardDiff v1.3.1 [b6b21f68] Ipopt v1.14.0 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.29.4 [2c470bb0] Kronecker v0.5.5 [192fc49d] LiftAndLearn v1.1.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.48.0 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [356022a1] NamedDims v1.2.3 [bac558e1] OrderedCollections v1.8.1 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [43287f4e] PtrArrays v1.3.0 [708f8203] Richardson v1.4.2 [c946c3f1] SCS v2.6.0 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [90137ffa] StaticArrays v1.9.16 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.2 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 ⌅ [dd29a912] UniqueKronecker v0.1.0 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [e33a78d0] Hwloc_jll v2.12.2+0 [9cc047cb] Ipopt_jll v300.1400.1901+0 [1d63c593] LLVMOpenMP_jll v18.1.8+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.200+0 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f4f2fc5b] SCS_jll v300.200.1100+0 [319450e9] SPRAL_jll v2025.9.18+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 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.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.14.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 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.12.2 [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.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... running test file utilities/matrix_dimensions.jl running test file utilities/analysis.jl running test file intrusive/pod.jl running test file LnL/lifting.jl running test file LnL/opinf.jl running test file LnL/lnl.jl running test file LnL/epopinf.jl [ Info: Initialize optimization model. [ Info: Add constraints [ Info: Set objective [ Info: Setup done. [ Info: Optimize model. ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit https://github.com/coin-or/Ipopt ****************************************************************************** This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 240246 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40044 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.3241475e+01 4.44e-16 1.98e-14 -1.0 1.77e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 2.3241474538694550e+01 2.3241474538694550e+01 Dual infeasibility......: 1.9763417369187547e-14 1.9763417369187547e-14 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.9763417369187547e-14 1.9763417369187547e-14 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 2.104 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Hard Equality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 2.2070631980895996 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 46.48294907738869 └ objective_value = 23.24147453869455 [ Info: Initialize optimization model. [ Info: Add constraints [ Info: Set objective [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 280288 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40052 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40044 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.7660426e+00 5.27e-16 1.33e-14 -1.0 1.82e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 2.7660425522166663e+00 2.7660425522166663e+00 Dual infeasibility......: 1.3323865523660105e-14 1.3323865523660105e-14 Constraint violation....: 5.2735593669694936e-16 5.2735593669694936e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.3323865523660105e-14 1.3323865523660105e-14 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.808 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Hard Equality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 0.8299381732940674 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 5.532085104433333 └ objective_value = 2.7660425522166663 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 240240 Number of nonzeros in inequality constraint Jacobian.: 12 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 8 inequality constraints with only lower bounds: 4 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 4 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 6.10e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0817841e-01 1.52e+00 8.86e+00 -1.0 1.79e+00 - 4.83e-01 7.70e-02h 1 2 1.3291507e+01 4.06e-01 8.00e+00 -1.0 1.63e+00 - 1.00e+00 7.33e-01h 1 3 1.5992436e+01 2.79e-01 6.50e+01 -1.0 4.36e-01 - 1.00e+00 3.13e-01h 1 4 2.3233392e+01 4.44e-16 1.00e-06 -1.0 2.98e-01 - 1.00e+00 1.00e+00h 1 5 2.3227123e+01 6.66e-16 7.17e+00 -2.5 1.21e-04 - 9.27e-01 1.00e+00f 1 6 2.3192178e+01 5.55e-16 2.83e-08 -2.5 6.63e-04 - 1.00e+00 1.00e+00f 1 7 2.3184852e+01 4.44e-16 4.21e-01 -3.8 4.15e-04 - 7.95e-01 1.00e+00f 1 8 2.3183204e+01 5.55e-16 1.50e-09 -3.8 3.04e-04 - 1.00e+00 1.00e+00f 1 9 2.3182642e+01 4.44e-16 6.74e-04 -5.7 3.49e-05 - 9.93e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.3182636e+01 5.55e-16 1.84e-11 -5.7 9.73e-07 - 1.00e+00 1.00e+00f 1 11 2.3182629e+01 5.55e-16 3.52e-13 -8.6 5.60e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 2.3182628997916481e+01 2.3182628997916481e+01 Dual infeasibility......: 3.5171865420124959e-13 3.5171865420124959e-13 Constraint violation....: 5.5511151231257827e-16 5.5511151231257827e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.0232441975378796e-09 3.0232441975378796e-09 Overall NLP error.......: 3.0232441975378796e-09 3.0232441975378796e-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 = 1 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 3.252 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Soft Inequality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 3.2619709968566895 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 46.36525856384156 └ objective_value = 23.18262899791648 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 280280 Number of nonzeros in inequality constraint Jacobian.: 14 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40052 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 8 inequality constraints with only lower bounds: 4 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 4 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 3.32e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9891055e-01 1.20e+00 9.12e+00 -1.0 1.83e+00 -4.0 1.00e+00 2.76e-01h 1 2 1.8059936e+00 3.21e-01 5.19e+00 -1.0 1.32e+00 -4.5 1.00e+00 7.31e-01h 1 3 2.3535034e+00 1.25e-01 1.49e+01 -1.0 3.56e-01 -5.0 1.00e+00 6.10e-01h 1 4 2.7702603e+00 6.66e-16 1.01e-06 -1.0 1.38e-01 -5.4 1.00e+00 1.00e+00h 1 5 2.7700138e+00 5.55e-16 2.09e+00 -2.5 4.29e-05 -5.9 9.74e-01 1.00e+00f 1 6 2.7652879e+00 5.55e-16 6.57e+00 -2.5 3.22e-03 -6.4 1.00e+00 2.63e-01f 2 7 2.7638365e+00 8.88e-16 2.83e-08 -2.5 2.34e-04 -6.9 1.00e+00 1.00e+00f 1 8 2.7610739e+00 7.77e-16 5.30e-01 -3.8 4.76e-04 -7.3 8.02e-01 1.00e+00f 1 9 2.7600131e+00 7.77e-16 1.51e-09 -3.8 3.91e-04 -7.8 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.7595997e+00 6.66e-16 1.48e-02 -5.7 2.99e-04 -8.3 9.01e-01 1.00e+00f 1 11 2.7595645e+00 5.55e-16 1.98e-11 -5.7 7.71e-04 -8.8 1.00e+00 1.00e+00f 1 12 2.7595587e+00 6.66e-16 5.12e-05 -8.6 5.71e-05 -9.2 9.72e-01 1.00e+00f 1 13 2.7595586e+00 6.66e-16 2.56e-14 -8.6 2.75e-06 -9.7 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 2.7595585983998832e+00 2.7595585983998832e+00 Dual infeasibility......: 2.5576045281137483e-14 2.5576045281137483e-14 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5358681013538106e-09 2.5358681013538106e-09 Overall NLP error.......: 2.5358681013538106e-09 2.5358681013538106e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 15 Number of inequality constraint evaluations = 15 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 5.707 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Soft Inequality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 5.718935966491699 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 5.519117241500899 └ objective_value = 2.759558598399883 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 240240 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40048 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.3241472e+01 4.44e-16 1.13e-08 -1.0 1.77e+00 - 1.00e+00 1.00e+00h 1 2 2.3241472e+01 4.44e-16 1.11e-08 -9.0 5.08e-15 - 1.00e+00 1.00e+00h 1 3 2.3241472e+01 4.44e-16 1.11e-08 -9.0 1.33e-15 - 1.00e+00 1.00e+00 0 4 2.3241472e+01 4.44e-16 3.85e-09 -9.0 5.34e-16 - 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 2.3241471531659467e+01 2.3241471531659467e+01 Dual infeasibility......: 3.8484593289922486e-09 3.8484593289922486e-09 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 3.8484593289922486e-09 3.8484593289922486e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.739 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Penalty │ EP Weight = 1.0e8 │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 1.7497718334197998 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 46.48294305779432 └ objective_value = 23.241471531659467 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 280280 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40053 Total number of variables............................: 40052 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.7660425e+00 4.44e-16 1.82e-04 -1.0 1.82e+00 -4.0 1.00e+00 1.00e+00h 1 2 2.7660425e+00 6.66e-16 3.93e-08 -5.7 1.20e-04 -4.5 1.00e+00 1.00e+00h 1 3 2.7660425e+00 6.66e-16 2.66e-08 -8.6 1.67e-04 -5.0 1.00e+00 1.00e+00h 1 4 2.7660425e+00 6.66e-16 1.30e-08 -8.6 5.04e-04 -5.4 1.00e+00 1.00e+00h 1 5 2.7660425e+00 4.58e-16 3.88e-08 -9.0 3.02e-03 -5.9 1.00e+00 1.00e+00H 1 6 2.7660425e+00 6.66e-16 1.29e-08 -9.0 4.53e-03 -6.4 1.00e+00 5.00e-01h 2 7 2.7660425e+00 4.44e-16 2.45e-08 -9.0 6.61e-11 -6.9 1.00e+00 1.00e+00H 1 8 2.7660425e+00 4.58e-16 3.89e-08 -9.0 8.92e-02 -7.3 1.00e+00 1.00e+00H 1 9 2.7660424e+00 6.66e-16 1.14e-08 -9.0 2.31e-01 -7.8 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.7660424e+00 6.66e-16 7.11e-08 -9.0 2.28e-01 -7.4 1.00e+00 1.00e+00H 1 11 2.7660424e+00 6.66e-16 3.39e-08 -9.0 2.05e-01 -7.4 1.00e+00 3.12e-02h 6 12 2.7660425e+00 6.66e-16 6.37e-08 -9.0 3.62e-02 -7.0 1.00e+00 9.31e-10h 31 13 2.7660425e+00 5.55e-16 2.33e-08 -9.0 2.31e-01 -7.5 1.00e+00 1.00e+00h 1 14 2.7660425e+00 6.66e-16 7.48e-09 -9.0 4.35e-02 -7.1 1.00e+00 5.00e-01h 2 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.7660424653480566e+00 2.7660424653480566e+00 Dual infeasibility......: 7.4791008941588188e-09 7.4791008941588188e-09 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 7.4791008941588188e-09 7.4791008941588188e-09 Number of objective function evaluations = 63 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 63 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 10.832 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Penalty │ EP Weight = 1.0e8 │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 10.902855157852173 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 5.532084949350208 └ objective_value = 2.7660424653480566 [ Info: Initialize optimization model. [ Info: Add constraints [ Info: Set objective [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 240246 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40044 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.3241475e+01 4.44e-16 1.98e-14 -1.0 1.77e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 2.3241474538694550e+01 2.3241474538694550e+01 Dual infeasibility......: 1.9763417369187547e-14 1.9763417369187547e-14 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.9763417369187547e-14 1.9763417369187547e-14 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.709 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Hard Equality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 0.7180240154266357 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 46.48294907738869 └ objective_value = 23.24147453869455 [ Info: Initialize optimization model. [ Info: Set objective [ Info: Add constraints [ Info: Setup done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 240240 Number of nonzeros in inequality constraint Jacobian.: 12 Number of nonzeros in Lagrangian Hessian.............: 40040 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 8 inequality constraints with only lower bounds: 4 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 4 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 6.10e-16 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0817841e-01 1.52e+00 8.86e+00 -1.0 1.79e+00 - 4.83e-01 7.70e-02h 1 2 1.3291507e+01 4.06e-01 8.00e+00 -1.0 1.63e+00 - 1.00e+00 7.33e-01h 1 3 1.5992436e+01 2.79e-01 6.50e+01 -1.0 4.36e-01 - 1.00e+00 3.13e-01h 1 4 2.3233392e+01 4.44e-16 1.00e-06 -1.0 2.98e-01 - 1.00e+00 1.00e+00h 1 5 2.3227123e+01 6.66e-16 7.17e+00 -2.5 1.21e-04 - 9.27e-01 1.00e+00f 1 6 2.3192178e+01 5.55e-16 2.83e-08 -2.5 6.63e-04 - 1.00e+00 1.00e+00f 1 7 2.3184852e+01 4.44e-16 4.21e-01 -3.8 4.15e-04 - 7.95e-01 1.00e+00f 1 8 2.3183204e+01 5.55e-16 1.50e-09 -3.8 3.04e-04 - 1.00e+00 1.00e+00f 1 9 2.3182642e+01 4.44e-16 6.74e-04 -5.7 3.49e-05 - 9.93e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.3182636e+01 5.55e-16 1.84e-11 -5.7 9.73e-07 - 1.00e+00 1.00e+00f 1 11 2.3182629e+01 5.55e-16 3.52e-13 -8.6 5.60e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 2.3182628997916481e+01 2.3182628997916481e+01 Dual infeasibility......: 3.5171865420124959e-13 3.5171865420124959e-13 Constraint violation....: 5.5511151231257827e-16 5.5511151231257827e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.0232441975378796e-09 3.0232441975378796e-09 Overall NLP error.......: 3.0232441975378796e-09 3.0232441975378796e-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 = 1 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 3.182 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Soft Inequality Constraint │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 3.1902499198913574 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 46.36525856384156 └ objective_value = 23.18262899791648 [ Info: Initialize optimization model. [ Info: Set penalty [ Info: Set objective [ Info: Setup Done. [ Info: Optimize model. This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.2. Number of nonzeros in equality constraint Jacobian...: 240240 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 40048 Total number of variables............................: 40050 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 40040 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.65e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.3241472e+01 4.44e-16 1.13e-08 -1.0 1.77e+00 - 1.00e+00 1.00e+00h 1 2 2.3241472e+01 4.44e-16 1.11e-08 -9.0 5.08e-15 - 1.00e+00 1.00e+00h 1 3 2.3241472e+01 4.44e-16 1.11e-08 -9.0 1.33e-15 - 1.00e+00 1.00e+00 0 4 2.3241472e+01 4.44e-16 3.85e-09 -9.0 5.34e-16 - 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 2.3241471531659467e+01 2.3241471531659467e+01 Dual infeasibility......: 3.8484593289922486e-09 3.8484593289922486e-09 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 3.8484593289922486e-09 3.8484593289922486e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 1 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.788 EXIT: Optimal Solution Found. ┌ Info: [EP-OpInf Results] │ Constraint = Energy-Preserving Penalty │ EP Weight = 1.0e8 │ Linear Regulation = 0 │ Quadratic Regulation = 0 │ Warm Start = false │ order = 2 │ solve time = 1.7993788719177246 │ termination_status = LOCALLY_SOLVED │ primal_status = FEASIBLE_POINT │ dual_state = FEASIBLE_POINT │ dual objective value = 46.48294305779432 └ objective_value = 23.241471531659467 Test Summary: | Pass Total Time LiftAndLearn | 80 80 2m54.0s Testing LiftAndLearn tests passed Testing completed after 214.23s PkgEval succeeded after 340.26s