Package evaluation to test MathOptSymbolicAD on Julia 1.13.0-DEV.1319 (9cddfda8ef*) started at 2025-10-16T21:35:19.831 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.97s ################################################################################ # Installation # Installing MathOptSymbolicAD... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [309f4015] + MathOptSymbolicAD v0.2.2 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.18.0 [1520ce14] + AbstractTrees v0.4.5 [7d9f7c33] + Accessors v0.1.42 [79e6a3ab] + Adapt v4.4.0 [66dad0bd] + AliasTables v1.1.3 [4fba245c] + ArrayInterface v7.21.0 [6e4b80f9] + BenchmarkTools v1.6.1 [e2ed5e7c] + Bijections v0.2.2 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 ⌅ [861a8166] + Combinatorics v1.0.2 [38540f10] + CommonSolve v0.2.4 [bbf7d656] + CommonSubexpressions v0.3.1 [f70d9fcc] + CommonWorldInvalidations v1.0.0 [34da2185] + Compat v4.18.1 [b152e2b5] + CompositeTypes v0.1.4 [a33af91c] + CompositionsBase v0.1.2 [187b0558] + ConstructionBase v1.6.0 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.19.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [31c24e10] + Distributions v0.25.122 [ffbed154] + DocStringExtensions v0.9.5 [5b8099bc] + DomainSets v0.7.16 [7c1d4256] + DynamicPolynomials v0.6.4 [4e289a0a] + EnumX v1.0.5 [e2ba6199] + ExprTools v0.1.10 [55351af7] + ExproniconLite v0.10.14 [1a297f60] + FillArrays v1.14.0 [1fa38f19] + Format v1.3.7 ⌃ [f6369f11] + ForwardDiff v0.10.39 [069b7b12] + FunctionWrappers v1.1.3 [77dc65aa] + FunctionWrappersWrappers v0.1.3 [46192b85] + GPUArraysCore v0.2.0 [34004b35] + HypergeometricFunctions v0.3.28 [18e54dd8] + IntegerMathUtils v0.1.3 [8197267c] + IntervalSets v0.7.11 [3587e190] + InverseFunctions v0.1.17 [92d709cd] + IrrationalConstants v0.2.6 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.1.0 [0f8b85d8] + JSON3 v1.14.3 [ae98c720] + Jieko v0.2.1 [b964fa9f] + LaTeXStrings v1.4.0 [23fbe1c1] + Latexify v0.16.10 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.45.0 [309f4015] + MathOptSymbolicAD v0.2.2 [e1d29d7a] + Missings v1.2.0 [2e0e35c7] + Moshi v0.3.7 [102ac46a] + MultivariatePolynomials v0.5.13 [d8a4904e] + MutableArithmetics v1.6.6 [77ba4419] + NaNMath v1.1.3 [6fe1bfb0] + OffsetArrays v1.17.0 [bac558e1] + OrderedCollections v1.8.1 [90014a1f] + PDMats v0.11.35 [69de0a69] + Parsers v2.8.3 [d236fae5] + PreallocationTools v0.4.34 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [27ebfcd6] + Primes v0.5.7 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [3cdcf5f2] + RecipesBase v1.3.4 [731186ca] + RecursiveArrayTools v3.37.1 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [79098fc4] + Rmath v0.8.0 [7e49a35a] + RuntimeGeneratedFunctions v0.5.15 [0bca4576] + SciMLBase v2.121.1 [c0aeaf25] + SciMLOperators v1.9.0 [431bcebd] + SciMLPublic v1.0.0 [53ae85a6] + SciMLStructures v1.7.0 [efcf1570] + Setfield v1.1.2 [a2af1166] + SortingAlgorithms v1.2.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.1 [2913bbd2] + StatsBase v0.34.6 [4c63d2b9] + StatsFuns v1.5.0 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.5.1 [2efcf032] + SymbolicIndexingInterface v0.3.46 ⌃ [19f23fe9] + SymbolicLimits v0.2.3 ⌅ [d1185830] + SymbolicUtils v3.32.0 [0c5d862f] + Symbolics v6.56.0 [ed4db957] + TaskLocalValues v0.1.3 [8ea1fca8] + TermInterface v2.0.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 [a7c27f48] + Unityper v0.1.6 [6e34b625] + Bzip2_jll v1.0.9+0 [61579ee1] + Ghostscript_jll v9.55.1+0 [aacddb02] + JpegTurbo_jll v3.1.3+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f50d1b31] + Rmath_jll v0.5.1+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future 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 v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [4607b0f0] + SuiteSparse [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 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 10.04s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ TestEnv ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/activate_set.jl:76 Precompiling package dependencies... Precompilation completed after 316.72s ################################################################################ # Testing # Testing MathOptSymbolicAD Test Could not use exact versions of packages in manifest, re-resolving. Note: if you do not check your manifest file into source control, then you can probably ignore this message. However, if you do check your manifest file into source control, then you probably want to pass the `allow_reresolve = false` kwarg when calling the `Pkg.test` function. Updating `/tmp/jl_9l6PAG/Project.toml` [b6b21f68] + Ipopt v1.11.0 [4076af6c] + JuMP v1.29.1 [c36e90e8] + PowerModels v0.21.5 Updating `/tmp/jl_9l6PAG/Manifest.toml` [a0c0ee7d] + DifferentiationInterface v0.7.9 [b4f34e82] + Distances v0.10.12 [6a86dc24] + FiniteDiff v2.29.0 [2030c09a] + InfrastructureModels v0.7.8 [b6b21f68] + Ipopt v1.11.0 ⌅ [682c06a0] ↓ JSON v1.1.0 ⇒ v0.21.4 [4076af6c] + JuMP v1.29.1 [d3d80556] + LineSearches v7.4.0 [f28f55f0] + Memento v1.4.1 [d41bc354] + NLSolversBase v7.10.0 [2774e3e8] + NLsolve v4.5.1 [d96e819e] + Parameters v0.12.3 [c36e90e8] + PowerModels v0.21.5 [ec057cc2] - StructUtils v2.5.1 [3a884ed6] + UnPack v1.0.2 [ae81ac8f] + ASL_jll v0.1.3+0 [e33a78d0] + Hwloc_jll v2.12.2+0 [9cc047cb] + Ipopt_jll v300.1400.1900+0 [94ce4f54] + Libiconv_jll v1.18.0+0 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.800.100+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+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 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [a4e569a6] + Tar v1.10.0 [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 [458c3c95] + OpenSSL_jll v3.5.4+0 [efcefdf7] + PCRE2_jll v10.46.0+0 [3161d3a3] + Zstd_jll v1.5.7+1 [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. To see why use `status --outdated -m` Test Successfully re-resolved Status `/tmp/jl_9l6PAG/Project.toml` [b6b21f68] Ipopt v1.11.0 [4076af6c] JuMP v1.29.1 [b8f27783] MathOptInterface v1.45.0 [309f4015] MathOptSymbolicAD v0.2.2 [c36e90e8] PowerModels v0.21.5 [276daf66] SpecialFunctions v2.6.1 [37e2e46d] LinearAlgebra v1.13.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_9l6PAG/Manifest.toml` [47edcb42] ADTypes v1.18.0 [1520ce14] AbstractTrees v0.4.5 [7d9f7c33] Accessors v0.1.42 [79e6a3ab] Adapt v4.4.0 [66dad0bd] AliasTables v1.1.3 [4fba245c] ArrayInterface v7.21.0 [6e4b80f9] BenchmarkTools v1.6.1 [e2ed5e7c] Bijections v0.2.2 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 ⌅ [861a8166] Combinatorics v1.0.2 [38540f10] CommonSolve v0.2.4 [bbf7d656] CommonSubexpressions v0.3.1 [f70d9fcc] CommonWorldInvalidations v1.0.0 [34da2185] Compat v4.18.1 [b152e2b5] CompositeTypes v0.1.4 [a33af91c] CompositionsBase v0.1.2 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.7.9 [b4f34e82] Distances v0.10.12 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [5b8099bc] DomainSets v0.7.16 [7c1d4256] DynamicPolynomials v0.6.4 [4e289a0a] EnumX v1.0.5 [e2ba6199] ExprTools v0.1.10 [55351af7] ExproniconLite v0.10.14 [1a297f60] FillArrays v1.14.0 [6a86dc24] FiniteDiff v2.29.0 [1fa38f19] Format v1.3.7 ⌃ [f6369f11] ForwardDiff v0.10.39 [069b7b12] FunctionWrappers v1.1.3 [77dc65aa] FunctionWrappersWrappers v0.1.3 [46192b85] GPUArraysCore v0.2.0 [34004b35] HypergeometricFunctions v0.3.28 [2030c09a] InfrastructureModels v0.7.8 [18e54dd8] IntegerMathUtils v0.1.3 [8197267c] IntervalSets v0.7.11 [3587e190] InverseFunctions v0.1.17 [b6b21f68] Ipopt v1.11.0 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 ⌅ [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [ae98c720] Jieko v0.2.1 [4076af6c] JuMP v1.29.1 [b964fa9f] LaTeXStrings v1.4.0 [23fbe1c1] Latexify v0.16.10 [d3d80556] LineSearches v7.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.45.0 [309f4015] MathOptSymbolicAD v0.2.2 [f28f55f0] Memento v1.4.1 [e1d29d7a] Missings v1.2.0 [2e0e35c7] Moshi v0.3.7 [102ac46a] MultivariatePolynomials v0.5.13 [d8a4904e] MutableArithmetics v1.6.6 [d41bc354] NLSolversBase v7.10.0 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.3 [6fe1bfb0] OffsetArrays v1.17.0 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [c36e90e8] PowerModels v0.21.5 [d236fae5] PreallocationTools v0.4.34 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [27ebfcd6] Primes v0.5.7 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [3cdcf5f2] RecipesBase v1.3.4 [731186ca] RecursiveArrayTools v3.37.1 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.8.0 [7e49a35a] RuntimeGeneratedFunctions v0.5.15 [0bca4576] SciMLBase v2.121.1 [c0aeaf25] SciMLOperators v1.9.0 [431bcebd] SciMLPublic v1.0.0 [53ae85a6] SciMLStructures v1.7.0 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [4c63d2b9] StatsFuns v1.5.0 [856f2bd8] StructTypes v1.11.0 [2efcf032] SymbolicIndexingInterface v0.3.46 ⌃ [19f23fe9] SymbolicLimits v0.2.3 ⌅ [d1185830] SymbolicUtils v3.32.0 [0c5d862f] Symbolics v6.56.0 [ed4db957] TaskLocalValues v0.1.3 [8ea1fca8] TermInterface v2.0.0 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [a7c27f48] Unityper v0.1.6 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [61579ee1] Ghostscript_jll v9.55.1+0 [e33a78d0] Hwloc_jll v2.12.2+0 [9cc047cb] Ipopt_jll v300.1400.1900+0 [aacddb02] JpegTurbo_jll v3.1.3+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f50d1b31] Rmath_jll v0.5.1+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 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [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 v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [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.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.46.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 ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:876 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. [info | PowerModels]: extending matpower format with data: areas 1x3 [info | PowerModels]: removing 1 cost terms from generator 3: [3000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 4: [4000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 1: [1400.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 2: [1500.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 5: [1000.0, 0.0] [ Info: Solving with SparseReverseMode ****************************************************************************** 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.1. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 264 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.36e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 1.59e-14 6.53e-10 -5.7 5.20e-07 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 1.82e-14 2.30e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486880e+02 1.7551890838594751e+04 Dual infeasibility......: 2.3006263789316654e-12 9.2025055157266615e-11 Constraint violation....: 1.3627987627273797e-14 1.8207657603852567e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302143499e-09 1.0023630520857399e-07 Overall NLP error.......: 2.5059076302143499e-09 1.0023630520857399e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 28.979 EXIT: Optimal Solution Found. Timing statistics - 0.0012087821960449219 - 0.00041961669921875 - 0.0018572807312011719 [ Info: Solving with serial MathOptSymbolicAD This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 63 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 5.27e-14 6.53e-10 -5.7 5.20e-07 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 2.45e-14 2.66e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486897e+02 1.7551890838594758e+04 Dual infeasibility......: 2.6614062108703273e-12 1.0645624843481309e-10 Constraint violation....: 2.4522051056408145e-14 2.4522051056408145e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302145744e-09 1.0023630520858297e-07 Overall NLP error.......: 2.5059076302145744e-09 1.0023630520858297e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 5.894 EXIT: Optimal Solution Found. Timing statistics - 0.4118969440460205 - 1.9132018089294434 - 2.686607837677002 [ Info: Solving with threaded MathOptSymbolicAD This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 240 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 5.26e-14 6.53e-10 -5.7 5.20e-07 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 3.52e-14 2.31e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486897e+02 1.7551890838594758e+04 Dual infeasibility......: 2.3070656724744913e-12 9.2282626898979651e-11 Constraint violation....: 2.4411028753945629e-14 3.5166314305001833e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302143495e-09 1.0023630520857397e-07 Overall NLP error.......: 2.5059076302143495e-09 1.0023630520857397e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 1.903 EXIT: Optimal Solution Found. Timing statistics - 0.21633577346801758 - 0.33002543449401855 - 0.23455238342285156 [ Info: Validating solutions Errors = (-3.5235703244040906e-14, 7.349676423018536e-14) Test Summary: | Pass Total Time test_case5_pjm_solution | 2 2 3m18.3s [ Info: Constructing oracles 0.012792 seconds (4.73 k allocations: 231.461 KiB, 96.04% compilation time) [ Info: MOI.initialize 1.459313 seconds (813.99 k allocations: 45.904 MiB, 91.59% compilation time) [ Info: MOI.eval_objective 0.605586 seconds (171.83 k allocations: 9.069 MiB, 99.99% compilation time) 0.000029 seconds (2 allocations: 32 bytes) [ Info: MOI.eval_objective_gradient 1.094356 seconds (264.49 k allocations: 13.472 MiB, 99.99% compilation time) 0.000009 seconds (1 allocation: 16 bytes) [ Info: MOI.eval_constraint 0.047734 seconds (13.61 k allocations: 794.227 KiB, 99.82% compilation time) 0.000005 seconds (20 allocations: 320 bytes) [ Info: MOI.jacobian_structure 0.000013 seconds (6 allocations: 3.008 KiB) [ Info: MOI.eval_constraint_jacobian 0.068254 seconds (17.03 k allocations: 991.977 KiB, 99.87% compilation time) 0.000005 seconds (10 allocations: 160 bytes) [ Info: MOI.hessian_lagrangian_structure 0.000019 seconds (15 allocations: 4.672 KiB) [ Info: MOI.eval_hessian_lagrangian 1.094263 seconds (246.61 k allocations: 12.790 MiB, 99.99% compilation time) 0.000016 seconds (11 allocations: 176 bytes) [ Info: Constructing oracles 0.000028 seconds (12 allocations: 1.719 KiB) [ Info: MOI.initialize 0.000283 seconds (972 allocations: 100.750 KiB) [ Info: MOI.eval_objective 0.000051 seconds 0.000001 seconds [ Info: MOI.eval_objective_gradient 0.000008 seconds 0.000002 seconds [ Info: MOI.eval_constraint 0.000002 seconds 0.000001 seconds [ Info: MOI.jacobian_structure 0.000004 seconds (6 allocations: 3.008 KiB) [ Info: MOI.eval_constraint_jacobian 0.000004 seconds 0.000003 seconds [ Info: MOI.hessian_lagrangian_structure 0.000000 seconds [ Info: MOI.eval_hessian_lagrangian 0.000068 seconds 0.000025 seconds Error = 0.0 Error = 0.0 Error = 0.0 Error = 0.0 Error = 0.0 [ Info: Solving with SparseReverseMode This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 42 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 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.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-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 = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.044 EXIT: Optimal Solution Found. Timing statistics - 2.86102294921875e-6 - 2.6464462280273438e-5 - 0.00015807151794433594 [ Info: Solving with serial MathOptSymbolicAD This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 42 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 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.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-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 = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.004 EXIT: Optimal Solution Found. Timing statistics - 3.337860107421875e-6 - 2.09808349609375e-5 - 0.00012111663818359375 [ Info: Solving with threaded MathOptSymbolicAD This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 42 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 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.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-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 = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. Timing statistics - 4.291534423828125e-6 - 1.9073486328125e-5 - 0.00011873245239257812 [ Info: Validating solutions Errors = (0.0, 0.0) [ Info: Constructing oracles 0.004286 seconds (20.58 k allocations: 909.188 KiB) [ Info: MOI.initialize 2.689397 seconds (4.23 M allocations: 184.989 MiB, 4.67% gc time, 9.36% compilation time) [ Info: MOI.eval_objective 20.518353 seconds (1.85 M allocations: 93.041 MiB, 0.68% gc time, 100.00% compilation time) 0.000041 seconds (2 allocations: 32 bytes) [ Info: MOI.eval_objective_gradient 20.913341 seconds (2.76 M allocations: 135.531 MiB, 0.74% gc time, 100.00% compilation time) 0.000017 seconds (1 allocation: 16 bytes) [ Info: MOI.eval_constraint 0.000105 seconds (200 allocations: 3.125 KiB) 0.000025 seconds (200 allocations: 3.125 KiB) [ Info: MOI.jacobian_structure 0.000042 seconds (8 allocations: 11.422 KiB) [ Info: MOI.eval_constraint_jacobian 0.000036 seconds (100 allocations: 1.562 KiB) 0.000030 seconds (100 allocations: 1.562 KiB) [ Info: MOI.hessian_lagrangian_structure 0.000057 seconds (31 allocations: 50.977 KiB) [ Info: MOI.eval_hessian_lagrangian 17.142515 seconds (2.43 M allocations: 120.767 MiB, 0.22% gc time, 100.00% compilation time) 0.000065 seconds (101 allocations: 1.578 KiB) [ Info: Constructing oracles 0.000074 seconds (17 allocations: 13.445 KiB) [ Info: MOI.initialize 0.001376 seconds (8.41 k allocations: 900.250 KiB) [ Info: MOI.eval_objective 0.000219 seconds 0.000002 seconds [ Info: MOI.eval_objective_gradient 0.000012 seconds 0.000008 seconds [ Info: MOI.eval_constraint 0.000003 seconds 0.000002 seconds [ Info: MOI.jacobian_structure 0.000014 seconds (8 allocations: 11.422 KiB) [ Info: MOI.eval_constraint_jacobian 0.000026 seconds 0.000019 seconds [ Info: MOI.hessian_lagrangian_structure 0.000000 seconds [ Info: MOI.eval_hessian_lagrangian 0.000227 seconds 0.000199 seconds Error = -0.000244140625 Error = 0.0 Error = 0.0 Error = 0.0 Error = 0.0 [ Info: Solving with SparseReverseMode This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 800 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 402 Total number of variables............................: 303 variables with only lower bounds: 0 variables with lower and upper bounds: 202 variables with only upper bounds: 0 Total number of equality constraints.................: 200 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 2.0 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.5 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.0 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 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.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-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 = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.009 EXIT: Optimal Solution Found. Timing statistics - 2.5033950805664062e-5 - 0.00015091896057128906 - 0.0009222030639648438 [ Info: Solving with serial MathOptSymbolicAD This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 800 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 402 Total number of variables............................: 303 variables with only lower bounds: 0 variables with lower and upper bounds: 202 variables with only upper bounds: 0 Total number of equality constraints.................: 200 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 2.0 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.5 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.0 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 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.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-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 = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.008 EXIT: Optimal Solution Found. Timing statistics - 2.2649765014648438e-5 - 0.00014448165893554688 - 0.0009250640869140625 [ Info: Solving with threaded MathOptSymbolicAD This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 800 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 402 Total number of variables............................: 303 variables with only lower bounds: 0 variables with lower and upper bounds: 202 variables with only upper bounds: 0 Total number of equality constraints.................: 200 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 2.0 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.5 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.0 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 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.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-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 = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.009 EXIT: Optimal Solution Found. Timing statistics - 2.193450927734375e-5 - 0.00015306472778320312 - 0.0009527206420898438 [ Info: Validating solutions Errors = (0.0, 0.0) Test Summary: | Pass Total Time test_clnlbeam | 16 16 1m17.9s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 2.4502501e-01 0.00e+00 9.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2159585e-01 0.00e+00 4.38e-01 -1.7 2.43e-02 - 5.35e-01 1.00e+00f 1 2 9.3033792e-05 0.00e+00 1.11e-16 -1.7 4.61e-01 - 1.00e+00 1.00e+00f 1 3 1.8860159e-03 0.00e+00 5.55e-17 -1.7 3.38e-02 - 1.00e+00 1.00e+00f 1 4 1.4999530e-03 0.00e+00 9.71e-17 -2.5 4.70e-03 - 1.00e+00 1.00e+00f 1 5 4.3793932e-04 0.00e+00 6.25e-17 -3.8 1.78e-02 - 1.00e+00 1.00e+00f 1 6 1.1024717e-04 0.00e+00 6.25e-17 -5.7 1.04e-02 - 1.00e+00 1.00e+00f 1 7 2.8016680e-05 0.00e+00 3.12e-17 -5.7 5.21e-03 - 1.00e+00 1.00e+00f 1 8 7.4703892e-06 0.00e+00 7.81e-17 -5.7 2.56e-03 - 1.00e+00 1.00e+00f 1 9 1.8694878e-06 0.00e+00 3.79e-06 -8.6 1.37e-03 - 9.99e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.6864064e-07 0.00e+00 7.35e-17 -8.6 6.83e-04 - 1.00e+00 1.00e+00f 1 11 1.1778532e-07 0.00e+00 3.46e-17 -8.6 3.41e-04 - 1.00e+00 1.00e+00f 1 12 3.0075043e-08 0.00e+00 8.57e-18 -8.6 1.70e-04 - 1.00e+00 1.00e+00f 1 13 8.1576980e-09 0.00e+00 3.26e-17 -8.6 8.31e-05 - 1.00e+00 1.00e+00f 1 14 2.2727905e-09 0.00e+00 6.41e-17 -9.0 4.26e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.2727904632420086e-09 2.2727904632420086e-09 Dual infeasibility......: 6.4130558502517587e-17 6.4130558502517587e-17 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.5466210953947614e-09 4.5466210953947614e-09 Overall NLP error.......: 4.5466210953947614e-09 4.5466210953947614e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 0.109 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_constant_subexpressions | 2 2 5.8s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 2.4502501e-01 0.00e+00 9.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2159585e-01 0.00e+00 4.38e-01 -1.7 2.43e-02 - 5.35e-01 1.00e+00f 1 2 9.3033792e-05 0.00e+00 1.11e-16 -1.7 4.61e-01 - 1.00e+00 1.00e+00f 1 3 1.8860159e-03 0.00e+00 5.55e-17 -1.7 3.38e-02 - 1.00e+00 1.00e+00f 1 4 1.4999530e-03 0.00e+00 9.71e-17 -2.5 4.70e-03 - 1.00e+00 1.00e+00f 1 5 4.3793932e-04 0.00e+00 6.25e-17 -3.8 1.78e-02 - 1.00e+00 1.00e+00f 1 6 1.1024717e-04 0.00e+00 6.25e-17 -5.7 1.04e-02 - 1.00e+00 1.00e+00f 1 7 2.8016680e-05 0.00e+00 3.12e-17 -5.7 5.21e-03 - 1.00e+00 1.00e+00f 1 8 7.4703892e-06 0.00e+00 7.81e-17 -5.7 2.56e-03 - 1.00e+00 1.00e+00f 1 9 1.8694878e-06 0.00e+00 3.79e-06 -8.6 1.37e-03 - 9.99e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.6864064e-07 0.00e+00 7.35e-17 -8.6 6.83e-04 - 1.00e+00 1.00e+00f 1 11 1.1778532e-07 0.00e+00 3.46e-17 -8.6 3.41e-04 - 1.00e+00 1.00e+00f 1 12 3.0075043e-08 0.00e+00 8.57e-18 -8.6 1.70e-04 - 1.00e+00 1.00e+00f 1 13 8.1576981e-09 0.00e+00 3.26e-17 -8.6 8.31e-05 - 1.00e+00 1.00e+00f 1 14 2.2727905e-09 0.00e+00 6.41e-17 -9.0 4.26e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.2727905113484326e-09 2.2727905113484326e-09 Dual infeasibility......: 6.4130558502517587e-17 6.4130558502517587e-17 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.5466210953947614e-09 4.5466210953947614e-09 Overall NLP error.......: 4.5466210953947614e-09 4.5466210953947614e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.006 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_constant_subexpressions_expr | 2 2 0.8s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.1880998e-02 0.00e+00 2.18e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.5963933e-02 0.00e+00 0.00e+00 -1.7 1.73e-02 - 1.00e+00 1.00e+00f 1 2 1.3251897e-02 0.00e+00 6.94e-18 -2.5 1.12e-02 - 1.00e+00 1.00e+00f 1 3 1.0497181e-02 0.00e+00 1.47e-17 -3.8 1.27e-02 - 1.00e+00 1.00e+00f 1 4 1.0013553e-02 0.00e+00 1.58e-17 -5.7 2.39e-03 - 1.00e+00 1.00e+00f 1 5 1.0000010e-02 0.00e+00 7.94e-18 -8.6 6.77e-05 - 1.00e+00 1.00e+00f 1 6 9.9999989e-03 0.00e+00 1.47e-18 -9.0 5.44e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: 9.9999989090969899e-03 9.9999989090969899e-03 Dual infeasibility......: 1.4669405030701686e-18 1.4669405030701686e-18 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 5.4545152006202358e-09 5.4545152006202358e-09 Complementarity.........: 9.0909691382780763e-10 9.0909691382780763e-10 Overall NLP error.......: 9.0909691382780763e-10 9.0909691382780763e-10 Number of objective function evaluations = 7 Number of objective gradient evaluations = 7 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 6 Total seconds in IPOPT = 0.048 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_default_parameter | 3 3 6.9s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 7.8537938e-01 0.00e+00 9.55e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.6300033e-01 0.00e+00 3.31e-01 -1.7 2.62e-02 - 5.88e-01 1.00e+00f 1 2 6.9477235e-01 0.00e+00 5.05e-01 -1.7 1.82e-01 - 1.00e+00 1.00e+00f 1 3 6.9244519e-01 0.00e+00 4.38e-03 -1.7 3.50e-02 - 1.00e+00 1.00e+00f 1 4 6.9220133e-01 0.00e+00 6.43e-04 -3.8 1.51e-02 - 1.00e+00 1.00e+00f 1 5 6.9220063e-01 0.00e+00 1.93e-06 -5.7 8.66e-04 - 1.00e+00 1.00e+00f 1 6 6.9220063e-01 0.00e+00 1.16e-13 -8.6 2.13e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: 6.9220062755534639e-01 6.9220062755534639e-01 Dual infeasibility......: 1.1648783676478265e-13 1.1648783676478265e-13 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5073294875845220e-09 2.5073294875845220e-09 Overall NLP error.......: 2.5073294875845220e-09 2.5073294875845220e-09 Number of objective function evaluations = 7 Number of objective gradient evaluations = 7 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 6 Total seconds in IPOPT = 0.298 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_default_x_to_x | 2 2 1.7s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.0000000e+00 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0000000e+00 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 1.0000000e+00 0.00e+00 0.00e+00 -3.8 0.00e+00 - 1.00e+00 1.00e+00T 0 3 1.0000000e+00 0.00e+00 0.00e+00 -5.7 0.00e+00 - 1.00e+00 1.00e+00T 0 4 1.0000000e+00 0.00e+00 0.00e+00 -8.6 0.00e+00 - 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: -1.0000000000000000e+00 1.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.........: 2.5059035596800808e-09 2.5059035596800808e-09 Overall NLP error.......: 2.5059035596800808e-09 2.5059035596800808e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.139 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_logic_comparison_expr | 1 1 5.1s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.0000000e+00 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0000000e+00 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 1.0000000e+00 0.00e+00 0.00e+00 -3.8 0.00e+00 - 1.00e+00 1.00e+00T 0 3 1.0000000e+00 0.00e+00 0.00e+00 -5.7 0.00e+00 - 1.00e+00 1.00e+00T 0 4 1.0000000e+00 0.00e+00 0.00e+00 -8.6 0.00e+00 - 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: -1.0000000000000000e+00 1.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.........: 2.5059035596800808e-09 2.5059035596800808e-09 Overall NLP error.......: 2.5059035596800808e-09 2.5059035596800808e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.131 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_logic_comparison_or_expr | 1 1 0.7s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 2.4502501e-01 0.00e+00 9.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2159585e-01 0.00e+00 4.38e-01 -1.7 2.43e-02 - 5.35e-01 1.00e+00f 1 2 9.3033792e-05 0.00e+00 1.11e-16 -1.7 4.61e-01 - 1.00e+00 1.00e+00f 1 3 1.8860159e-03 0.00e+00 5.55e-17 -1.7 3.38e-02 - 1.00e+00 1.00e+00f 1 4 1.4999530e-03 0.00e+00 9.71e-17 -2.5 4.70e-03 - 1.00e+00 1.00e+00f 1 5 4.3793932e-04 0.00e+00 6.25e-17 -3.8 1.78e-02 - 1.00e+00 1.00e+00f 1 6 1.1024717e-04 0.00e+00 6.25e-17 -5.7 1.04e-02 - 1.00e+00 1.00e+00f 1 7 2.8016680e-05 0.00e+00 3.12e-17 -5.7 5.21e-03 - 1.00e+00 1.00e+00f 1 8 7.4703892e-06 0.00e+00 7.81e-17 -5.7 2.56e-03 - 1.00e+00 1.00e+00f 1 9 1.8694878e-06 0.00e+00 3.79e-06 -8.6 1.37e-03 - 9.99e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.6864064e-07 0.00e+00 7.35e-17 -8.6 6.83e-04 - 1.00e+00 1.00e+00f 1 11 1.1778532e-07 0.00e+00 3.46e-17 -8.6 3.41e-04 - 1.00e+00 1.00e+00f 1 12 3.0075043e-08 0.00e+00 8.57e-18 -8.6 1.70e-04 - 1.00e+00 1.00e+00f 1 13 8.1576980e-09 0.00e+00 3.26e-17 -8.6 8.31e-05 - 1.00e+00 1.00e+00f 1 14 2.2727905e-09 0.00e+00 6.41e-17 -9.0 4.26e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.2727904632420086e-09 2.2727904632420086e-09 Dual infeasibility......: 6.4130558502517587e-17 6.4130558502517587e-17 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.5466210953947614e-09 4.5466210953947614e-09 Overall NLP error.......: 4.5466210953947614e-09 4.5466210953947614e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_nested_subexpressions | 2 2 0.2s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 2.4502501e-01 0.00e+00 9.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2159585e-01 0.00e+00 4.38e-01 -1.7 2.43e-02 - 5.35e-01 1.00e+00f 1 2 9.3033792e-05 0.00e+00 1.11e-16 -1.7 4.61e-01 - 1.00e+00 1.00e+00f 1 3 1.8860159e-03 0.00e+00 5.55e-17 -1.7 3.38e-02 - 1.00e+00 1.00e+00f 1 4 1.4999530e-03 0.00e+00 9.71e-17 -2.5 4.70e-03 - 1.00e+00 1.00e+00f 1 5 4.3793932e-04 0.00e+00 6.25e-17 -3.8 1.78e-02 - 1.00e+00 1.00e+00f 1 6 1.1024717e-04 0.00e+00 6.25e-17 -5.7 1.04e-02 - 1.00e+00 1.00e+00f 1 7 2.8016680e-05 0.00e+00 3.12e-17 -5.7 5.21e-03 - 1.00e+00 1.00e+00f 1 8 7.4703892e-06 0.00e+00 7.81e-17 -5.7 2.56e-03 - 1.00e+00 1.00e+00f 1 9 1.8694878e-06 0.00e+00 3.79e-06 -8.6 1.37e-03 - 9.99e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.6864064e-07 0.00e+00 7.35e-17 -8.6 6.83e-04 - 1.00e+00 1.00e+00f 1 11 1.1778532e-07 0.00e+00 3.46e-17 -8.6 3.41e-04 - 1.00e+00 1.00e+00f 1 12 3.0075043e-08 0.00e+00 8.57e-18 -8.6 1.70e-04 - 1.00e+00 1.00e+00f 1 13 8.1576981e-09 0.00e+00 3.26e-17 -8.6 8.31e-05 - 1.00e+00 1.00e+00f 1 14 2.2727905e-09 0.00e+00 6.41e-17 -9.0 4.26e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.2727905113484326e-09 2.2727905113484326e-09 Dual infeasibility......: 6.4130558502517587e-17 6.4130558502517587e-17 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.5466210953947614e-09 4.5466210953947614e-09 Overall NLP error.......: 4.5466210953947614e-09 4.5466210953947614e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.008 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_nested_subexpressions_expr | 2 2 0.1s [info | PowerModels]: extending matpower format with data: areas 1x3 [info | PowerModels]: removing 1 cost terms from generator 3: [3000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 4: [4000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 1: [1400.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 2: [1500.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 5: [1000.0, 0.0] This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 63 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 5.27e-14 6.53e-10 -5.7 5.20e-07 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 2.45e-14 2.66e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486897e+02 1.7551890838594758e+04 Dual infeasibility......: 2.6614062108703273e-12 1.0645624843481309e-10 Constraint violation....: 2.4522051056408145e-14 2.4522051056408145e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302145744e-09 1.0023630520858297e-07 Overall NLP error.......: 2.5059076302145744e-09 1.0023630520858297e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 0.014 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...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 63 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 5.27e-14 6.53e-10 -5.7 5.20e-07 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 2.45e-14 2.66e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486897e+02 1.7551890838594758e+04 Dual infeasibility......: 2.6614062108703273e-12 1.0645624843481309e-10 Constraint violation....: 2.4522051056408145e-14 2.4522051056408145e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302145744e-09 1.0023630520858297e-07 Overall NLP error.......: 2.5059076302145744e-09 1.0023630520858297e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 0.014 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_optimizer_case5_pjm | 1 1 0.5s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 22 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 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.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-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 = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_optimizer_clnlbeam | 2 2 1.3s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 22 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 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.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-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 = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 1.857 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_optimizer_clnlbeam_expr | 2 2 4.1s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 2 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 0 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 1.0000000e+00 0.00e+00 1.50e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.8024487e-01 0.00e+00 9.01e-01 -1.0 2.72e-01 - 8.44e-01 1.00e+00f 1 2 7.0052662e-02 0.00e+00 3.51e-01 -1.7 2.13e-01 - 1.00e+00 1.00e+00f 1 3 1.8685826e-02 0.00e+00 1.15e-01 -1.7 1.45e-01 - 1.00e+00 1.00e+00h 1 4 5.0051391e-03 0.00e+00 4.24e-02 -2.5 1.04e-01 - 1.00e+00 1.00e+00h 1 5 1.5721643e-03 0.00e+00 1.30e-02 -2.5 6.69e-02 - 1.00e+00 1.00e+00h 1 6 4.4160278e-04 0.00e+00 6.29e-03 -3.8 5.42e-02 - 1.00e+00 1.00e+00h 1 7 1.3012324e-04 0.00e+00 2.31e-03 -3.8 3.82e-02 - 1.00e+00 1.00e+00h 1 8 5.2832674e-05 0.00e+00 5.55e-04 -3.8 2.15e-02 - 1.00e+00 1.00e+00h 1 9 1.5630227e-05 0.00e+00 4.65e-04 -5.7 2.24e-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 4.3201506e-06 0.00e+00 2.05e-04 -5.7 1.73e-02 - 1.00e+00 1.00e+00h 1 11 1.3080517e-06 0.00e+00 6.93e-05 -5.7 1.18e-02 - 1.00e+00 1.00e+00h 1 12 5.8470874e-07 0.00e+00 1.45e-05 -5.7 6.17e-03 - 1.00e+00 1.00e+00h 1 13 1.7450415e-07 0.00e+00 1.56e-05 -8.6 7.21e-03 - 9.98e-01 1.00e+00h 1 14 4.6552429e-08 0.00e+00 7.35e-06 -8.6 5.75e-03 - 1.00e+00 1.00e+00h 1 15 1.1934456e-08 0.00e+00 2.86e-06 -8.6 4.24e-03 - 1.00e+00 1.00e+00h 1 16 3.1922881e-09 0.00e+00 9.80e-07 -8.6 2.94e-03 - 1.00e+00 1.00e+00h 1 17 1.0945020e-09 0.00e+00 2.59e-07 -8.6 1.76e-03 - 1.00e+00 1.00e+00h 1 18 6.6576204e-10 0.00e+00 3.00e-08 -8.6 6.72e-04 - 1.00e+00 1.00e+00h 1 19 6.2669252e-10 0.00e+00 3.52e-10 -8.6 7.62e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 19 (scaled) (unscaled) Objective...............: 6.2669251831336228e-10 6.2669251831336228e-10 Dual infeasibility......: 3.5235889036493309e-10 3.5235889036493309e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035564989435e-09 2.5059035564989435e-09 Overall NLP error.......: 2.5059035564989435e-09 2.5059035564989435e-09 Number of objective function evaluations = 20 Number of objective gradient evaluations = 20 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 20 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 20 Number of Lagrangian Hessian evaluations = 19 Total seconds in IPOPT = 0.150 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_threaded_objective | 2 2 2.4s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 -2.7118055e-02 0.00e+00 2.41e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8685804e-01 0.00e+00 9.26e-01 -1.0 1.06e-01 - 4.56e-01 1.00e+00f 1 2 3.9327121e-01 0.00e+00 1.35e-01 -1.7 2.05e-01 - 1.00e+00 1.00e+00f 1 3 4.0670875e-01 0.00e+00 6.68e-03 -2.5 4.81e-02 - 9.09e-01 1.00e+00f 1 4 4.0877211e-01 0.00e+00 1.13e-03 -3.8 2.32e-02 - 1.00e+00 1.00e+00f 1 5 4.0884988e-01 0.00e+00 5.26e-05 -3.8 5.06e-03 - 1.00e+00 1.00e+00f 1 6 4.0885036e-01 0.00e+00 3.73e-07 -5.7 4.27e-04 - 1.00e+00 1.00e+00f 1 7 4.0885036e-01 0.00e+00 4.11e-11 -8.6 4.48e-06 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: -4.0885036218644277e-01 4.0885036218644277e-01 Dual infeasibility......: 4.1105109658080353e-11 4.1105109658080353e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.6275883296809451e-09 2.6275883296809451e-09 Overall NLP error.......: 2.6275883296809451e-09 2.6275883296809451e-09 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 7 Total seconds in IPOPT = 0.152 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_user_defined_functions | 1 1 11.4s This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 -2.7118055e-02 0.00e+00 2.41e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8685804e-01 0.00e+00 9.26e-01 -1.0 1.06e-01 - 4.56e-01 1.00e+00f 1 2 3.9327121e-01 0.00e+00 1.35e-01 -1.7 2.05e-01 - 1.00e+00 1.00e+00f 1 3 4.0670875e-01 0.00e+00 6.68e-03 -2.5 4.81e-02 - 9.09e-01 1.00e+00f 1 4 4.0877211e-01 0.00e+00 1.13e-03 -3.8 2.32e-02 - 1.00e+00 1.00e+00f 1 5 4.0884988e-01 0.00e+00 5.26e-05 -3.8 5.06e-03 - 1.00e+00 1.00e+00f 1 6 4.0885036e-01 0.00e+00 3.73e-07 -5.7 4.27e-04 - 1.00e+00 1.00e+00f 1 7 4.0885036e-01 0.00e+00 4.11e-11 -8.6 4.48e-06 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: -4.0885036218644277e-01 4.0885036218644277e-01 Dual infeasibility......: 4.1105109658080353e-11 4.1105109658080353e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.6275883296809451e-09 2.6275883296809451e-09 Overall NLP error.......: 2.6275883296809451e-09 2.6275883296809451e-09 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 7 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_user_defined_functions_expr | 1 1 4.0s Test Summary: | Pass Total Time test_SymbolicAD_DAG | 2 2 3.5s Test Summary: | Pass Total Time test_SymbolicAD_Evaluator | 7 7 11.7s Test Summary: | Pass Total Time test_SymbolicAD_Evaluator_comparison | 13 13 0.4s Test Summary: | Pass Total Time test_SymbolicAD_Evaluator_ifelse | 5 5 0.3s Test Summary: | Pass Total Time test_SymbolicAD_Evaluator_squared | 5 5 0.9s Test Summary: | Pass Total Time test_SymbolicAD_parameters | 1 1 0.1s Test Summary: | Pass Total Time test_SymbolicAD_show | 4 4 0.4s Test Summary: | Pass Total Time test_SymbolicAD_subexpressions | 1 1 0.1s Test Summary: | Pass Total Time test_SymbolicAD_univariate_registered | 1 1 1.1s Test Summary: | Pass Total Time test_derivative | 44 44 12.0s Test Summary: | Pass Total Time test_derivative_error | 1 1 0.1s Test Summary: | Pass Total Time test_gradient_and_hessian | 12 12 4.1s Test Summary: | Pass Total Time test_gradient_and_hessian_filter | 8 8 1.1s Test Summary: | Pass Total Time test_packed_operator_bit_fiddling | 360 360 2.3s Test Summary: | Pass Total Time test_simplify_ScalarAffineFunction | 4 4 0.2s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction | 2 2 0.1s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_addition | 7 7 0.7s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_ifelse | 4 4 0.2s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_multiplication | 8 8 0.7s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_power | 5 5 0.2s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_subtraction | 7 7 0.3s Test Summary: | Pass Total Time test_simplify_ScalarQuadraticFunction | 4 4 0.5s Test Summary: | Pass Total Time test_simplify_VariableIndex | 2 2 0.1s Test Summary: | Pass Total Time test_simplify_VectorAffineFunction | 2 2 1.4s Test Summary: | Pass Total Time test_simplify_VectorNonlinearFunction | 1 1 1.3s Test Summary: | Pass Total Time test_simplify_VectorQuadraticFunction | 3 3 2.6s Test Summary: | Pass Total Time test_simplify_deep | 1 1 4.6s Test Summary: | Pass Total Time test_simplify_shared_false | 1 1 0.2s Test Summary: | Pass Total Time test_simplify_shared_node | 1 1 0.2s Test Summary: | Pass Total Time test_variable | 19 19 1.6s Testing MathOptSymbolicAD tests passed Testing completed after 542.45s PkgEval succeeded after 892.44s