Package evaluation of NonconvexPavito on Julia 1.13.0-DEV.1265 (cd62cf9a08*) started at 2025-10-06T03:59:46.563 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 11.39s ################################################################################ # Installation # Installing NonconvexPavito... Resolving package versions... Installed VertexSafeGraphs ──────────── v0.2.0 Installed Bzip2_jll ─────────────────── v1.0.9+0 Installed CommonWorldInvalidations ──── v1.0.0 Installed DifferentiableFlatten ─────── v0.1.1 Installed MUMPS_seq_jll ─────────────── v500.800.100+0 Installed OrderedCollections ────────── v1.8.1 Installed SymbolicUtils ─────────────── v2.1.3 Installed NLPModels ─────────────────── v0.21.5 Installed Ipopt_jll ─────────────────── v300.1400.1900+0 Installed Xorg_libpciaccess_jll ─────── v0.18.1+0 Installed AbstractDifferentiation ───── v0.4.4 Installed NaNMath ───────────────────── v1.1.3 Installed StaticArrayInterface ──────── v1.8.0 Installed QuadGK ────────────────────── v2.11.2 Installed PreallocationTools ────────── v0.4.34 Installed ChainRules ────────────────── v1.72.6 Installed OpenSpecFun_jll ───────────── v0.5.6+0 Installed EnumX ─────────────────────── v1.0.5 Installed ScopedValues ──────────────── v1.5.0 Installed InverseFunctions ──────────── v0.1.17 Installed PackageExtensionCompat ────── v1.0.2 Installed Reexport ──────────────────── v1.2.2 Installed Tables ────────────────────── v1.12.1 Installed Jieko ─────────────────────── v0.2.1 Installed Missings ──────────────────── v1.2.0 Installed Static ────────────────────── v1.3.0 Installed TableTraits ───────────────── v1.0.1 Installed Preferences ───────────────── v1.5.0 Installed IterativeSolvers ──────────── v0.9.4 Installed LaTeXStrings ──────────────── v1.4.0 Installed RecursiveArrayTools ───────── v3.36.0 Installed SortingAlgorithms ─────────── v1.2.2 Installed Format ────────────────────── v1.3.7 Installed UnPack ────────────────────── v1.0.2 Installed ADTypes ───────────────────── v1.18.0 Installed CRlibm ────────────────────── v1.0.2 Installed SetRounding ───────────────── v0.2.1 Installed Inflate ───────────────────── v0.1.5 Installed MacroTools ────────────────── v0.5.16 Installed DataStructures ────────────── v0.18.22 Installed DiffResults ───────────────── v1.1.0 Installed TermInterface ─────────────── v0.4.1 Installed AbstractTrees ─────────────── v0.4.5 Installed ArnoldiMethod ─────────────── v0.4.0 Installed FillArrays ────────────────── v1.14.0 Installed CodecZlib ─────────────────── v0.7.8 Installed ExprTools ─────────────────── v0.1.10 Installed ArrayInterface ────────────── v7.20.0 Installed StatsBase ─────────────────── v0.34.6 Installed Zygote ────────────────────── v0.6.77 Installed CEnum ─────────────────────── v0.5.0 Installed NonconvexUtils ────────────── v0.4.3 Installed GPUArraysCore ─────────────── v0.2.0 Installed DataValueInterfaces ───────── v1.0.0 Installed RealDot ───────────────────── v0.1.0 Installed IrrationalConstants ───────── v0.2.4 Installed SparseDiffTools ───────────── v2.23.1 Installed CommonSubexpressions ──────── v0.3.1 Installed Hwloc_jll ─────────────────── v2.12.2+0 Installed SPRAL_jll ─────────────────── v2025.5.20+0 Installed SimpleTraits ──────────────── v0.9.5 Installed RoundingEmulator ──────────── v0.2.1 Installed CompositeTypes ────────────── v0.1.4 Installed Setfield ──────────────────── v1.1.2 Installed BenchmarkTools ────────────── v1.6.0 Installed CRlibm_jll ────────────────── v1.0.1+0 Installed PDMats ────────────────────── v0.11.35 Installed CompositionsBase ──────────── v0.1.2 Installed CommonSolve ───────────────── v0.2.4 Installed DocStringExtensions ───────── v0.9.5 Installed ForwardDiff ───────────────── v0.10.39 Installed Moshi ─────────────────────── v0.3.7 Installed Rmath_jll ─────────────────── v0.5.1+0 Installed Ghostscript_jll ───────────── v9.55.1+0 Installed Unityper ──────────────────── v0.1.6 Installed LabelledArrays ────────────── v1.16.1 Installed AliasTables ───────────────── v1.1.3 Installed Cgl_jll ───────────────────── v0.6000.900+0 Installed SparseInverseSubset ───────── v0.1.2 Installed Clp_jll ───────────────────── v100.1700.1000+1 Installed DynamicPolynomials ────────── v0.5.7 Installed HashArrayMappedTries ──────── v0.2.0 Installed Combinatorics ─────────────── v1.0.3 Installed Bijections ────────────────── v0.1.10 Installed IteratorInterfaceExtensions ─ v1.0.0 Installed MathOptInterface ──────────── v1.45.0 Installed RecipesBase ───────────────── v1.3.4 Installed FunctionWrappersWrappers ──── v0.1.3 Installed DataAPI ───────────────────── v1.16.0 Installed CoinUtils_jll ─────────────── v200.1100.1200+0 Installed DomainSets ────────────────── v0.7.16 Installed SciMLOperators ────────────── v0.3.13 Installed GPUArrays ─────────────────── v11.2.5 Installed StaticArraysCore ──────────── v1.4.3 Installed SciMLStructures ───────────── v1.7.0 Installed MultivariatePolynomials ───── v0.5.9 Installed Latexify ──────────────────── v0.16.10 Installed StaticArrays ──────────────── v1.9.15 Installed AbstractFFTs ──────────────── v1.5.0 Installed SciMLPublic ───────────────── v1.0.0 Installed Symbolics ─────────────────── v5.36.0 Installed Requires ──────────────────── v1.3.1 Installed FunctionWrappers ──────────── v1.1.3 Installed DiffRules ─────────────────── v1.15.1 Installed LogExpFunctions ───────────── v0.3.29 Installed OpenBLAS32_jll ────────────── v0.3.29+0 Installed JSON ──────────────────────── v0.21.4 Installed LLVM ──────────────────────── v9.4.2 Installed Distributions ─────────────── v0.25.122 Installed NonconvexPavito ───────────── v0.1.5 Installed Parsers ───────────────────── v2.8.3 Installed SciMLBase ─────────────────── v2.87.0 Installed Rmath ─────────────────────── v0.8.0 Installed FiniteDiff ────────────────── v2.28.1 Installed FastClosures ──────────────── v0.3.2 Installed StatsFuns ─────────────────── v1.5.0 Installed UnsafeAtomics ─────────────── v0.3.0 Installed NonconvexCore ─────────────── v1.4.3 Installed JuMP ──────────────────────── v1.29.1 Installed JLLWrappers ───────────────── v1.7.1 Installed IRTools ───────────────────── v0.4.15 Installed MutableArithmetics ────────── v1.6.6 Installed ZygoteRules ───────────────── v0.2.7 Installed SymbolicLimits ────────────── v0.2.1 Installed JpegTurbo_jll ─────────────── v3.1.3+0 Installed LLVMExtra_jll ─────────────── v0.0.37+2 Installed StructTypes ───────────────── v1.11.0 Installed ErrorfreeArithmetic ───────── v0.5.2 Installed Accessors ─────────────────── v0.1.42 Installed SolverCore ────────────────── v0.3.8 Installed Graphs ────────────────────── v1.13.1 Installed Adapt ─────────────────────── v4.4.0 Installed RuntimeGeneratedFunctions ─── v0.5.15 Installed Cbc_jll ───────────────────── v200.1000.1200+0 Installed HypergeometricFunctions ───── v0.3.28 Installed ConstructionBase ──────────── v1.5.6 Installed LinearMaps ────────────────── v3.11.4 Installed SymbolicIndexingInterface ─── v0.3.45 Installed Compat ────────────────────── v4.18.1 Installed TranscodingStreams ────────── v0.11.3 Installed LambertW ──────────────────── v0.4.6 Installed NonconvexIpopt ────────────── v0.4.3 Installed StatsAPI ──────────────────── v1.7.1 Installed StructArrays ──────────────── v0.7.1 Installed Atomix ────────────────────── v1.1.2 Installed Statistics ────────────────── v1.11.1 Installed ExproniconLite ────────────── v0.10.14 Installed PrecompileTools ───────────── v1.3.3 Installed TimerOutputs ──────────────── v0.5.29 Installed ASL_jll ───────────────────── v0.1.3+0 Installed CodecBzip2 ────────────────── v0.8.5 Installed Pavito ────────────────────── v0.3.9 Installed JSON3 ─────────────────────── v1.14.3 Installed Cbc ───────────────────────── v1.3.0 Installed LinearOperators ───────────── v2.11.0 Installed KernelAbstractions ────────── v0.9.38 Installed ChainRulesCore ────────────── v1.26.0 Installed NamedTupleTools ───────────── v0.14.3 Installed FastRounding ──────────────── v0.3.1 Installed XML2_jll ──────────────────── v2.13.9+0 Installed Parameters ────────────────── v0.12.3 Installed IfElse ────────────────────── v0.1.1 Installed PtrArrays ─────────────────── v1.3.0 Installed IntervalSets ──────────────── v0.7.11 Installed SpecialFunctions ──────────── v2.6.1 Installed Ipopt ─────────────────────── v1.11.0 Installed IntervalArithmetic ────────── v0.20.9 Installed Libiconv_jll ──────────────── v1.18.0+0 Installed Osi_jll ───────────────────── v0.10800.1100+0 Installed METIS_jll ─────────────────── v5.1.2+1 Installing 22 artifacts Installed artifact OpenSpecFun 194.9 KiB Installed artifact Cgl 656.0 KiB Installed artifact CoinUtils 811.6 KiB Installed artifact SPRAL 691.8 KiB Installed artifact METIS 1.1 MiB Installed artifact Clp 1.4 MiB Installed artifact Xorg_libpciaccess 24.8 KiB Installed artifact Cbc 1.1 MiB Installed artifact JpegTurbo 1.4 MiB Installed artifact Osi 443.6 KiB Installed artifact ASL 276.3 KiB Installed artifact CRlibm 169.5 KiB Installed artifact LLVMExtra 3.2 MiB Installed artifact Bzip2 503.5 KiB Installed artifact Rmath 121.9 KiB Installed artifact XML2 2.5 MiB Installed artifact Hwloc 3.5 MiB Installed artifact Ipopt 1.3 MiB Installed artifact Libiconv 1.9 MiB Installed artifact MUMPS_seq 8.6 MiB Installed artifact OpenBLAS32 10.0 MiB Installed artifact Ghostscript 31.4 MiB Updating `~/.julia/environments/v1.13/Project.toml` [75d5b151] + NonconvexPavito v0.1.5 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.18.0 ⌅ [c29ec348] + AbstractDifferentiation v0.4.4 [621f4979] + AbstractFFTs v1.5.0 [1520ce14] + AbstractTrees v0.4.5 [7d9f7c33] + Accessors v0.1.42 [79e6a3ab] + Adapt v4.4.0 [66dad0bd] + AliasTables v1.1.3 [ec485272] + ArnoldiMethod v0.4.0 [4fba245c] + ArrayInterface v7.20.0 [a9b6321e] + Atomix v1.1.2 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [e2ed5e7c] + Bijections v0.1.10 [fa961155] + CEnum v0.5.0 [96374032] + CRlibm v1.0.2 [9961bab8] + Cbc v1.3.0 [082447d4] + ChainRules v1.72.6 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.3 [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.5.6 [9a962f9c] + DataAPI v1.16.0 ⌅ [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [c78775a3] + DifferentiableFlatten v0.1.1 [31c24e10] + Distributions v0.25.122 [ffbed154] + DocStringExtensions v0.9.5 [5b8099bc] + DomainSets v0.7.16 ⌅ [7c1d4256] + DynamicPolynomials v0.5.7 [4e289a0a] + EnumX v1.0.5 [90fa49ef] + ErrorfreeArithmetic v0.5.2 [e2ba6199] + ExprTools v0.1.10 [55351af7] + ExproniconLite v0.10.14 [9aa1b823] + FastClosures v0.3.2 [fa42c844] + FastRounding v0.3.1 [1a297f60] + FillArrays v1.14.0 [6a86dc24] + FiniteDiff v2.28.1 [1fa38f19] + Format v1.3.7 ⌅ [f6369f11] + ForwardDiff v0.10.39 [069b7b12] + FunctionWrappers v1.1.3 [77dc65aa] + FunctionWrappersWrappers v0.1.3 [0c68f7d7] + GPUArrays v11.2.5 [46192b85] + GPUArraysCore v0.2.0 [86223c79] + Graphs v1.13.1 [076d061b] + HashArrayMappedTries v0.2.0 [34004b35] + HypergeometricFunctions v0.3.28 [7869d1d1] + IRTools v0.4.15 [615f187c] + IfElse v0.1.1 [d25df0c9] + Inflate v0.1.5 ⌅ [d1acc4aa] + IntervalArithmetic v0.20.9 [8197267c] + IntervalSets v0.7.11 [3587e190] + InverseFunctions v0.1.17 [b6b21f68] + Ipopt v1.11.0 [92d709cd] + IrrationalConstants v0.2.4 [42fd0dbc] + IterativeSolvers v0.9.4 [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 [63c18a36] + KernelAbstractions v0.9.38 [929cbde3] + LLVM v9.4.2 [b964fa9f] + LaTeXStrings v1.4.0 [2ee39098] + LabelledArrays v1.16.1 ⌅ [984bce1d] + LambertW v0.4.6 [23fbe1c1] + Latexify v0.16.10 [7a12625a] + LinearMaps v3.11.4 [5c8ed15e] + LinearOperators v2.11.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.45.0 [e1d29d7a] + Missings v1.2.0 [2e0e35c7] + Moshi v0.3.7 ⌃ [102ac46a] + MultivariatePolynomials v0.5.9 [d8a4904e] + MutableArithmetics v1.6.6 [a4795742] + NLPModels v0.21.5 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [035190e5] + NonconvexCore v1.4.3 [bf347577] + NonconvexIpopt v0.4.3 [75d5b151] + NonconvexPavito v0.1.5 [c48e48a2] + NonconvexUtils v0.4.3 [bac558e1] + OrderedCollections v1.8.1 [90014a1f] + PDMats v0.11.35 [65ce6f38] + PackageExtensionCompat v1.0.2 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [cd433a01] + Pavito v0.3.9 [d236fae5] + PreallocationTools v0.4.34 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [c1ae055f] + RealDot v0.1.0 [3cdcf5f2] + RecipesBase v1.3.4 ⌃ [731186ca] + RecursiveArrayTools v3.36.0 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [79098fc4] + Rmath v0.8.0 [5eaf0fd0] + RoundingEmulator v0.2.1 [7e49a35a] + RuntimeGeneratedFunctions v0.5.15 ⌃ [0bca4576] + SciMLBase v2.87.0 ⌅ [c0aeaf25] + SciMLOperators v0.3.13 [431bcebd] + SciMLPublic v1.0.0 [53ae85a6] + SciMLStructures v1.7.0 [7e506255] + ScopedValues v1.5.0 [3cc68bcd] + SetRounding v0.2.1 [efcf1570] + Setfield v1.1.2 [699a6c99] + SimpleTraits v0.9.5 [ff4d7338] + SolverCore v0.3.8 [a2af1166] + SortingAlgorithms v1.2.2 ⌃ [47a9eef4] + SparseDiffTools v2.23.1 [dc90abb0] + SparseInverseSubset v0.1.2 [276daf66] + SpecialFunctions v2.6.1 [aedffcd0] + Static v1.3.0 [0d7ed370] + StaticArrayInterface v1.8.0 [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 [09ab397b] + StructArrays v0.7.1 [856f2bd8] + StructTypes v1.11.0 [2efcf032] + SymbolicIndexingInterface v0.3.45 ⌃ [19f23fe9] + SymbolicLimits v0.2.1 ⌅ [d1185830] + SymbolicUtils v2.1.3 ⌅ [0c5d862f] + Symbolics v5.36.0 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 ⌅ [8ea1fca8] + TermInterface v0.4.1 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [a7c27f48] + Unityper v0.1.6 [013be700] + UnsafeAtomics v0.3.0 [19fa3120] + VertexSafeGraphs v0.2.0 ⌅ [e88e6eb3] + Zygote v0.6.77 [700de1a5] + ZygoteRules v0.2.7 [ae81ac8f] + ASL_jll v0.1.3+0 [6e34b625] + Bzip2_jll v1.0.9+0 [4e9b3aee] + CRlibm_jll v1.0.1+0 [38041ee0] + Cbc_jll v200.1000.1200+0 [3830e938] + Cgl_jll v0.6000.900+0 [06985876] + Clp_jll v100.1700.1000+1 [be027038] + CoinUtils_jll v200.1100.1200+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 [dad2f222] + LLVMExtra_jll v0.0.37+2 [94ce4f54] + Libiconv_jll v1.18.0+0 ⌅ [d00139f3] + METIS_jll v5.1.2+1 [d7ed1dd3] + MUMPS_seq_jll v500.800.100+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [7da25872] + Osi_jll v0.10800.1100+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 [4af54fe1] + LazyArtifacts v1.11.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 [1a1011a3] + SharedArrays 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.13.1+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. To see why use `status --outdated -m` Installation completed after 25.15s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling packages... 5024.9 ms ✓ TestEnv 1 dependency successfully precompiled in 6 seconds. 27 already precompiled. Precompiling package dependencies... Precompilation completed after 1075.01s ################################################################################ # Testing # Testing NonconvexPavito Status `/tmp/jl_8z3Om8/Project.toml` [9961bab8] Cbc v1.3.0 [b6b21f68] Ipopt v1.11.0 [4076af6c] JuMP v1.29.1 [b8f27783] MathOptInterface v1.45.0 [035190e5] NonconvexCore v1.4.3 [bf347577] NonconvexIpopt v0.4.3 [75d5b151] NonconvexPavito v0.1.5 [d96e819e] Parameters v0.12.3 [cd433a01] Pavito v0.3.9 [189a3867] Reexport v1.2.2 [37e2e46d] LinearAlgebra v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_8z3Om8/Manifest.toml` [47edcb42] ADTypes v1.18.0 ⌅ [c29ec348] AbstractDifferentiation v0.4.4 [621f4979] AbstractFFTs v1.5.0 [1520ce14] AbstractTrees v0.4.5 [7d9f7c33] Accessors v0.1.42 [79e6a3ab] Adapt v4.4.0 [66dad0bd] AliasTables v1.1.3 [ec485272] ArnoldiMethod v0.4.0 [4fba245c] ArrayInterface v7.20.0 [a9b6321e] Atomix v1.1.2 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [e2ed5e7c] Bijections v0.1.10 [fa961155] CEnum v0.5.0 [96374032] CRlibm v1.0.2 [9961bab8] Cbc v1.3.0 [082447d4] ChainRules v1.72.6 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.3 [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.5.6 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [c78775a3] DifferentiableFlatten v0.1.1 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [5b8099bc] DomainSets v0.7.16 ⌅ [7c1d4256] DynamicPolynomials v0.5.7 [4e289a0a] EnumX v1.0.5 [90fa49ef] ErrorfreeArithmetic v0.5.2 [e2ba6199] ExprTools v0.1.10 [55351af7] ExproniconLite v0.10.14 [9aa1b823] FastClosures v0.3.2 [fa42c844] FastRounding v0.3.1 [1a297f60] FillArrays v1.14.0 [6a86dc24] FiniteDiff v2.28.1 [1fa38f19] Format v1.3.7 ⌅ [f6369f11] ForwardDiff v0.10.39 [069b7b12] FunctionWrappers v1.1.3 [77dc65aa] FunctionWrappersWrappers v0.1.3 [0c68f7d7] GPUArrays v11.2.5 [46192b85] GPUArraysCore v0.2.0 [86223c79] Graphs v1.13.1 [076d061b] HashArrayMappedTries v0.2.0 [34004b35] HypergeometricFunctions v0.3.28 [7869d1d1] IRTools v0.4.15 [615f187c] IfElse v0.1.1 [d25df0c9] Inflate v0.1.5 ⌅ [d1acc4aa] IntervalArithmetic v0.20.9 [8197267c] IntervalSets v0.7.11 [3587e190] InverseFunctions v0.1.17 [b6b21f68] Ipopt v1.11.0 [92d709cd] IrrationalConstants v0.2.4 [42fd0dbc] IterativeSolvers v0.9.4 [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 [63c18a36] KernelAbstractions v0.9.38 [929cbde3] LLVM v9.4.2 [b964fa9f] LaTeXStrings v1.4.0 [2ee39098] LabelledArrays v1.16.1 ⌅ [984bce1d] LambertW v0.4.6 [23fbe1c1] Latexify v0.16.10 [7a12625a] LinearMaps v3.11.4 [5c8ed15e] LinearOperators v2.11.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.45.0 [e1d29d7a] Missings v1.2.0 [2e0e35c7] Moshi v0.3.7 ⌃ [102ac46a] MultivariatePolynomials v0.5.9 [d8a4904e] MutableArithmetics v1.6.6 [a4795742] NLPModels v0.21.5 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [035190e5] NonconvexCore v1.4.3 [bf347577] NonconvexIpopt v0.4.3 [75d5b151] NonconvexPavito v0.1.5 [c48e48a2] NonconvexUtils v0.4.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [65ce6f38] PackageExtensionCompat v1.0.2 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [cd433a01] Pavito v0.3.9 [d236fae5] PreallocationTools v0.4.34 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [c1ae055f] RealDot v0.1.0 [3cdcf5f2] RecipesBase v1.3.4 ⌃ [731186ca] RecursiveArrayTools v3.36.0 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.8.0 [5eaf0fd0] RoundingEmulator v0.2.1 [7e49a35a] RuntimeGeneratedFunctions v0.5.15 ⌃ [0bca4576] SciMLBase v2.87.0 ⌅ [c0aeaf25] SciMLOperators v0.3.13 [431bcebd] SciMLPublic v1.0.0 [53ae85a6] SciMLStructures v1.7.0 [7e506255] ScopedValues v1.5.0 [3cc68bcd] SetRounding v0.2.1 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [ff4d7338] SolverCore v0.3.8 [a2af1166] SortingAlgorithms v1.2.2 ⌃ [47a9eef4] SparseDiffTools v2.23.1 [dc90abb0] SparseInverseSubset v0.1.2 [276daf66] SpecialFunctions v2.6.1 [aedffcd0] Static v1.3.0 [0d7ed370] StaticArrayInterface v1.8.0 [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 [09ab397b] StructArrays v0.7.1 [856f2bd8] StructTypes v1.11.0 [2efcf032] SymbolicIndexingInterface v0.3.45 ⌃ [19f23fe9] SymbolicLimits v0.2.1 ⌅ [d1185830] SymbolicUtils v2.1.3 ⌅ [0c5d862f] Symbolics v5.36.0 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 ⌅ [8ea1fca8] TermInterface v0.4.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [a7c27f48] Unityper v0.1.6 [013be700] UnsafeAtomics v0.3.0 [19fa3120] VertexSafeGraphs v0.2.0 ⌅ [e88e6eb3] Zygote v0.6.77 [700de1a5] ZygoteRules v0.2.7 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [4e9b3aee] CRlibm_jll v1.0.1+0 [38041ee0] Cbc_jll v200.1000.1200+0 [3830e938] Cgl_jll v0.6000.900+0 [06985876] Clp_jll v100.1700.1000+1 [be027038] CoinUtils_jll v200.1100.1200+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 [dad2f222] LLVMExtra_jll v0.0.37+2 [94ce4f54] Libiconv_jll v1.18.0+0 ⌅ [d00139f3] METIS_jll v5.1.2+1 [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [7da25872] Osi_jll v0.10800.1100+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 [4af54fe1] LazyArtifacts v1.11.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 [1a1011a3] SharedArrays 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.13.1+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... ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ exception = │ 1-element ExceptionStack: │ LoadError: UndefVarError: `ForwardDiff` not defined in `PreallocationTools` │ Suggestion: check for spelling errors or missing imports. │ Hint: ForwardDiff is loaded but not imported in the active module Main. │ Stacktrace: │ [1] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:62 │ [2] _eval_using(to::Module, path::Expr) │ @ Base ./module.jl:137 │ [3] top-level scope │ @ ~/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:5 │ [4] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [5] __require_prelocked(pkg::Base.PkgId, env::Nothing) │ @ Base ./loading.jl:2777 │ [6] _require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ @ Base ./loading.jl:2536 │ [7] _require_prelocked │ @ ./loading.jl:2530 [inlined] │ [8] run_extension_callbacks(extid::Base.ExtensionId) │ @ Base ./loading.jl:1582 │ [9] run_extension_callbacks(pkgid::Base.PkgId) │ @ Base ./loading.jl:1619 │ [10] run_package_callbacks(modkey::Base.PkgId) │ @ Base ./loading.jl:1435 │ [11] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:2544 │ [12] macro expansion │ @ ./loading.jl:2464 [inlined] │ [13] macro expansion │ @ ./lock.jl:376 [inlined] │ [14] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:2428 │ [15] require │ @ ./loading.jl:2404 [inlined] │ [16] eval_import_path │ @ ./module.jl:36 [inlined] │ [17] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:60 │ [18] _eval_import(::Bool, ::Module, ::Expr, ::Expr, ::Vararg{Expr}) │ @ Base ./module.jl:101 │ [19] top-level scope │ @ ~/.julia/packages/NonconvexUtils/i3gzf/src/NonconvexUtils.jl:18 │ [20] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [21] __require_prelocked(pkg::Base.PkgId, env::String) │ @ Base ./loading.jl:2777 │ [22] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:2536 │ [23] macro expansion │ @ ./loading.jl:2464 [inlined] │ [24] macro expansion │ @ ./lock.jl:376 [inlined] │ [25] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:2428 │ [26] require │ @ ./loading.jl:2404 [inlined] │ [27] eval_import_path │ @ ./module.jl:36 [inlined] │ [28] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:60 │ [29] _eval_using(to::Module, path::Expr) │ @ Base ./module.jl:137 │ [30] top-level scope │ @ ~/.julia/packages/NonconvexIpopt/yAEgT/src/NonconvexIpopt.jl:5 │ [31] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [32] __require_prelocked(pkg::Base.PkgId, env::String) │ @ Base ./loading.jl:2777 │ [33] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:2536 │ [34] macro expansion │ @ ./loading.jl:2464 [inlined] │ [35] macro expansion │ @ ./lock.jl:376 [inlined] │ [36] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:2428 │ [37] require │ @ ./loading.jl:2404 [inlined] │ [38] eval_import_path │ @ ./module.jl:36 [inlined] │ [39] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:60 │ [40] _eval_using(to::Module, path::Expr) │ @ Base ./module.jl:137 │ [41] top-level scope │ @ ~/.julia/packages/NonconvexPavito/n1FgD/src/NonconvexPavito.jl:8 │ [42] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [43] __require_prelocked(pkg::Base.PkgId, env::String) │ @ Base ./loading.jl:2777 │ [44] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:2536 │ [45] macro expansion │ @ ./loading.jl:2464 [inlined] │ [46] macro expansion │ @ ./lock.jl:376 [inlined] │ [47] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:2428 │ [48] require │ @ ./loading.jl:2404 [inlined] │ [49] eval_import_path │ @ ./module.jl:36 [inlined] │ [50] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:60 │ [51] _eval_using(to::Module, path::Expr) │ @ Base ./module.jl:137 │ [52] top-level scope │ @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:1 │ [53] include(mapexpr::Function, mod::Module, _path::String) │ @ Base ./Base.jl:310 │ [54] top-level scope │ @ none:6 │ [55] eval(m::Module, e::Any) │ @ Core ./boot.jl:489 │ [56] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:310 │ [57] _start() │ @ Base ./client.jl:577 │ in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 └ @ Base loading.jl:1592 WARNING: Constructor for type "Workspace" was extended in `NonconvexIpopt` without explicit qualification or import. NOTE: Assumed "Workspace" refers to `NonconvexCore.Workspace`. This behavior is deprecated and may differ in future versions. NOTE: This behavior may have differed in Julia versions prior to 1.12. Hint: If you intended to create a new generic function of the same name, use `function Workspace end`. Hint: To silence the warning, qualify `Workspace` as `NonconvexCore.Workspace` in the method signature or explicitly `import NonconvexCore: Workspace`. MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... ****************************************************************************** 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...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.97e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4839416e+00 3.30e+00 1.57e-01 -5.4 3.51e-01 - 9.52e-01 1.00e+00h 1 2 1.3048472e+00 8.02e-01 3.19e-01 -6.7 4.99e-01 - 9.30e-01 1.00e+00h 1 3 1.0533955e+00 9.73e-02 4.48e-01 -2.6 6.61e-01 - 1.00e+00 1.00e+00h 1 4 5.8982897e-01 0.00e+00 8.25e-01 -3.6 9.23e-01 - 1.00e+00 1.00e+00h 1 5 4.0024267e-01 3.68e-01 1.10e+00 -1.7 1.63e+00 - 1.00e+00 3.42e-01h 1 6 5.9531365e-01 4.06e-03 1.04e+00 -2.0 2.70e-01 - 8.80e-01 1.00e+00h 1 7 5.5076681e-01 0.00e+00 2.84e-01 -2.7 2.49e-01 - 1.00e+00 1.00e+00h 1 8 5.4546369e-01 2.21e-04 5.12e-03 -3.4 2.70e-02 - 1.00e+00 9.67e-01h 1 9 5.4435008e-01 0.00e+00 1.90e-02 -5.4 2.07e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433135e-01 0.00e+00 1.11e-04 -7.1 2.84e-05 - 1.00e+00 9.76e-01h 1 11 5.4433104e-01 0.00e+00 8.90e-07 -11.0 5.32e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 1.23e-10 -11.0 1.98e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623084e-01 5.4433104478623084e-01 Dual infeasibility......: 1.2290779505264027e-10 1.2290779505264027e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000026449328530e-11 1.0000026449328530e-11 Overall NLP error.......: 1.2290779505264027e-10 1.2290779505264027e-10 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 8.171 EXIT: Optimal Solution Found. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +9.525794e-01 | >1000 | 5.501e+01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (1 integer (0 of which binary)) and 6 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 0.952579 Cbc0012I Integer solution of 0.95257935 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.68633046 to 0.95257935 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 0.9525793512948707, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.68633 to 0.952579 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.95257935 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 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.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 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...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 0.00e+00 5.58e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4917336e+00 0.00e+00 2.77e-02 -5.5 1.20e-01 - 9.75e-01 1.00e+00f 1 2 1.3932842e+00 0.00e+00 1.03e-01 -2.4 2.84e-01 - 9.99e-01 1.00e+00f 1 3 1.2638096e+00 0.00e+00 1.27e-01 -3.8 3.44e-01 - 1.00e+00 1.00e+00f 1 4 1.0998287e+00 0.00e+00 1.49e-01 -4.6 3.88e-01 - 1.00e+00 1.00e+00f 1 5 1.0010476e+00 0.00e+00 1.61e-01 -5.3 4.40e-01 - 1.00e+00 4.72e-01f 1 6 1.0000105e+00 0.00e+00 2.09e-02 -6.1 6.22e-02 - 1.00e+00 3.34e-02f 1 7 1.0000001e+00 0.00e+00 9.58e-06 -6.7 2.35e-05 - 1.00e+00 8.82e-01f 1 8 1.0000000e+00 0.00e+00 8.73e-08 -11.0 2.10e-07 - 1.00e+00 1.00e+00f 1 9 1.0000000e+00 0.00e+00 5.04e-12 -11.0 1.21e-11 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 9 (scaled) (unscaled) Objective...............: 9.9999999500999992e-01 9.9999999500999992e-01 Dual infeasibility......: 5.0438542231745487e-12 5.0438542231745487e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000003171940096e-11 1.0000003171940096e-11 Overall NLP error.......: 1.0000003171940096e-11 1.0000003171940096e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 10 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 10 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.017 EXIT: Optimal Solution Found. 2 | +1.000000e+00 | +1.190724e+00 | -1.907e-01 | 5.872e+01 Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 2 Total time 59.20180 sec MIP total time 30.68624 sec NLP total time 14.45396 sec Simple constraints: Error During Test at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:8 Got exception outside of a @test UndefVarError: `PavitoIpoptCbcResult` not defined in `NonconvexPavito` Suggestion: define the const at top-level before running function that uses it (stricter Julia v1.12+ rule). Note: the binding state changed since the error occurred (was: 11, now: 0). Stacktrace: [1] #s27#1 @ ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:30 [inlined] [2] var"#s27#1"(T::Any, ::Any, ::Any) @ ConstructionBase ./none:0 [3] (::Core.GeneratedFunctionStub)(::UInt64, ::Method, ::Any, ::Vararg{Any}) @ Base ./expr.jl:1828 [4] setproperties_object(obj::NonconvexPavito.PavitoIpoptCbcResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#6#7"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#8#9"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#6#7"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#8#9"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:219 [5] setproperties(obj::NonconvexPavito.PavitoIpoptCbcResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#6#7"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#8#9"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#6#7"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#8#9"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:133 [6] set @ ~/.julia/packages/Setfield/ZezIj/src/lens.jl:122 [inlined] [7] macro expansion @ ~/.julia/packages/Setfield/ZezIj/src/sugar.jl:198 [inlined] [8] optimize(::Model{Vector{Any}}, ::PavitoIpoptCbcAlg, ::Vector{Float64}; kwargs::@Kwargs{options::PavitoIpoptCbcOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:244 [9] kwcall(::@NamedTuple{options::PavitoIpoptCbcOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}, ::typeof(optimize), ::Model{Vector{Any}}, ::PavitoIpoptCbcAlg, ::Vector{Float64}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 [10] top-level scope @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:2057 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2033 [inlined] [12] macro expansion @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:9 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [14] macro expansion @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:17 [inlined] [15] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [16] top-level scope @ none:6 [17] eval(m::Module, e::Any) @ Core ./boot.jl:489 [18] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [19] _start() @ Base ./client.jl:577 MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.648148 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (1 integer (0 of which binary)) and 10 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 1.19072 Cbc0012I Integer solution of 1.1907242 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.79175426 to 1.1907242 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.791754 to 1.19072 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 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.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.97e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4839416e+00 3.30e+00 1.57e-01 -5.4 3.51e-01 - 9.52e-01 1.00e+00h 1 2 1.3048472e+00 8.02e-01 3.19e-01 -6.7 4.99e-01 - 9.30e-01 1.00e+00h 1 3 1.0533955e+00 9.73e-02 4.48e-01 -2.6 6.61e-01 - 1.00e+00 1.00e+00h 1 4 5.8982897e-01 0.00e+00 8.25e-01 -3.6 9.23e-01 - 1.00e+00 1.00e+00h 1 5 4.0024267e-01 3.68e-01 1.10e+00 -1.7 1.63e+00 - 1.00e+00 3.42e-01h 1 6 5.9531365e-01 4.06e-03 1.04e+00 -2.0 2.70e-01 - 8.80e-01 1.00e+00h 1 7 5.5076681e-01 0.00e+00 2.84e-01 -2.7 2.49e-01 - 1.00e+00 1.00e+00h 1 8 5.4546369e-01 2.21e-04 5.12e-03 -3.4 2.70e-02 - 1.00e+00 9.67e-01h 1 9 5.4435008e-01 0.00e+00 1.90e-02 -5.4 2.07e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433135e-01 0.00e+00 1.11e-04 -7.1 2.84e-05 - 1.00e+00 9.76e-01h 1 11 5.4433104e-01 0.00e+00 8.90e-07 -11.0 5.32e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 1.23e-10 -11.0 1.98e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623084e-01 5.4433104478623084e-01 Dual infeasibility......: 1.2290779505264027e-10 1.2290779505264027e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000026449328530e-11 1.0000026449328530e-11 Overall NLP error.......: 1.2290779505264027e-10 1.2290779505264027e-10 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.271 EXIT: Optimal Solution Found. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +9.525794e-01 | >1000 | 5.222e-01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (1 integer (0 of which binary)) and 6 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 0.952579 Cbc0012I Integer solution of 0.95257935 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.68633046 to 0.95257935 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 0.9525793512948707, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.68633 to 0.952579 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.95257935 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 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.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 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...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 0.00e+00 5.58e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4917336e+00 0.00e+00 2.77e-02 -5.5 1.20e-01 - 9.75e-01 1.00e+00f 1 2 1.3932842e+00 0.00e+00 1.03e-01 -2.4 2.84e-01 - 9.99e-01 1.00e+00f 1 3 1.2638096e+00 0.00e+00 1.27e-01 -3.8 3.44e-01 - 1.00e+00 1.00e+00f 1 4 1.0998287e+00 0.00e+00 1.49e-01 -4.6 3.88e-01 - 1.00e+00 1.00e+00f 1 5 1.0010476e+00 0.00e+00 1.61e-01 -5.3 4.40e-01 - 1.00e+00 4.72e-01f 1 6 1.0000105e+00 0.00e+00 2.09e-02 -6.1 6.22e-02 - 1.00e+00 3.34e-02f 1 7 1.0000001e+00 0.00e+00 9.58e-06 -6.7 2.35e-05 - 1.00e+00 8.82e-01f 1 8 1.0000000e+00 0.00e+00 8.73e-08 -11.0 2.10e-07 - 1.00e+00 1.00e+00f 1 9 1.0000000e+00 0.00e+00 5.04e-12 -11.0 1.21e-11 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 9 (scaled) (unscaled) Objective...............: 9.9999999500999992e-01 9.9999999500999992e-01 Dual infeasibility......: 5.0438542231745487e-12 5.0438542231745487e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000003171940096e-11 1.0000003171940096e-11 Overall NLP error.......: 1.0000003171940096e-11 1.0000003171940096e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 10 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 10 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.012 EXIT: Optimal Solution Found. 2 | +1.000000e+00 | +1.190724e+00 | -1.907e-01 | 5.481e-01 Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 2 Total time 0.54837 sec MIP total time 0.02601 sec NLP total time 0.30132 sec Block constraints: Error During Test at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:26 Got exception outside of a @test UndefVarError: `PavitoIpoptCbcResult` not defined in `NonconvexPavito` Suggestion: define the const at top-level before running function that uses it (stricter Julia v1.12+ rule). Note: the binding state changed since the error occurred (was: 11, now: 0). Stacktrace: [1] #s27#1 @ ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:30 [inlined] [2] var"#s27#1"(T::Any, ::Any, ::Any) @ ConstructionBase ./none:0 [3] (::Core.GeneratedFunctionStub)(::UInt64, ::Method, ::Any, ::Vararg{Any}) @ Base ./expr.jl:1828 [4] setproperties_object(obj::NonconvexPavito.PavitoIpoptCbcResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#10#11"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#10#11"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:219 [5] setproperties(obj::NonconvexPavito.PavitoIpoptCbcResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#10#11"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#10#11"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:133 [6] set @ ~/.julia/packages/Setfield/ZezIj/src/lens.jl:122 [inlined] [7] macro expansion @ ~/.julia/packages/Setfield/ZezIj/src/sugar.jl:198 [inlined] [8] optimize(::Model{Vector{Any}}, ::PavitoIpoptCbcAlg, ::Vector{Float64}; kwargs::@Kwargs{options::PavitoIpoptCbcOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:244 [9] kwcall(::@NamedTuple{options::PavitoIpoptCbcOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}, ::typeof(optimize), ::Model{Vector{Any}}, ::PavitoIpoptCbcAlg, ::Vector{Float64}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 [10] top-level scope @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:2057 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2033 [inlined] [12] macro expansion @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:27 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [14] macro expansion @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:34 [inlined] [15] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [16] top-level scope @ none:6 [17] eval(m::Module, e::Any) @ Core ./boot.jl:489 [18] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [19] _start() @ Base ./client.jl:577 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.648148 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (1 integer (0 of which binary)) and 10 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 1.19072 Cbc0012I Integer solution of 1.1907242 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.79175426 to 1.1907242 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.791754 to 1.19072 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... 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.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 2 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.72e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4803481e+00 3.30e+00 1.65e-01 -5.8 3.52e-01 - 1.00e+00 1.00e+00h 1 2 1.2685150e+00 8.40e-01 3.48e-01 -6.8 5.82e-01 - 1.00e+00 1.00e+00h 1 3 9.5252729e-01 4.30e-02 5.03e-01 -2.6 7.84e-01 - 9.95e-01 1.00e+00h 1 4 5.1212396e-01 5.54e-02 9.50e-01 -4.2 1.18e+00 - 1.00e+00 6.85e-01h 1 5 3.9391736e-01 4.69e-01 1.13e+00 -2.2 2.27e+00 - 1.00e+00 2.07e-01h 1 6 5.1846953e-01 6.49e-02 5.53e-01 -1.9 8.69e-01 - 1.00e+00 4.80e-01h 1 7 5.4557200e-01 6.15e-03 2.98e-01 -2.1 4.21e-01 - 1.00e+00 9.90e-01h 1 8 5.4591049e-01 0.00e+00 9.06e-03 -3.9 5.29e-03 - 1.00e+00 1.00e+00h 1 9 5.4435013e-01 0.00e+00 3.03e-03 -5.4 2.19e-03 - 1.00e+00 9.98e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433113e-01 0.00e+00 1.60e-05 -7.2 2.40e-05 - 1.00e+00 9.98e-01h 1 11 5.4433104e-01 0.00e+00 6.93e-08 -11.0 1.61e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 4.71e-12 -11.0 5.58e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623073e-01 5.4433104478623073e-01 Dual infeasibility......: 4.7062354013860386e-12 4.7062354013860386e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000274257271e-11 1.0000000274257271e-11 Overall NLP error.......: 1.0000000274257271e-11 1.0000000274257271e-11 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.222 EXIT: Optimal Solution Found. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +9.525794e-01 | >1000 | 4.735e-01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 1 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 2 rows, 2 columns (1 integer (0 of which binary)) and 4 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 0.680414 Cbc0012I Integer solution of 0.95257935 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.68633046 to 0.95257935 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 0.9525793512948706, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.68633 to 0.952579 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.95257935 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 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.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 1 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 0.00e+00 8.91e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4897129e+00 0.00e+00 4.50e-02 -5.7 1.26e-01 - 1.00e+00 1.00e+00f 1 2 1.3859678e+00 0.00e+00 1.08e-01 -6.9 2.98e-01 - 1.00e+00 1.00e+00f 1 3 1.2535760e+00 0.00e+00 1.29e-01 -7.8 3.49e-01 - 1.00e+00 1.00e+00f 1 4 1.0859133e+00 0.00e+00 1.51e-01 -8.5 3.92e-01 - 1.00e+00 1.00e+00f 1 5 1.0008956e+00 0.00e+00 1.61e-01 -9.2 4.45e-01 - 1.00e+00 3.98e-01f 1 6 1.0000090e+00 0.00e+00 1.81e-02 -10.0 5.39e-02 - 1.00e+00 3.29e-02f 1 7 1.0000001e+00 0.00e+00 8.11e-06 -7.0 1.99e-05 - 1.00e+00 8.92e-01f 1 8 1.0000000e+00 0.00e+00 7.47e-08 -11.0 1.79e-07 - 1.00e+00 1.00e+00f 1 9 1.0000000e+00 0.00e+00 3.63e-12 -11.0 8.72e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 9 (scaled) (unscaled) Objective...............: 9.9999999500999992e-01 9.9999999500999992e-01 Dual infeasibility......: 3.6348701826227625e-12 3.6348701826227625e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000001954100218e-11 1.0000001954100218e-11 Overall NLP error.......: 1.0000001954100218e-11 1.0000001954100218e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 10 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 10 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.014 EXIT: Optimal Solution Found. 2 | +1.000000e+00 | +1.190724e+00 | -1.907e-01 | 5.004e-01 Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 2 Total time 0.50062 sec MIP total time 0.01729 sec NLP total time 0.25629 sec Infinite bounds: Error During Test at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:43 Got exception outside of a @test UndefVarError: `PavitoIpoptCbcResult` not defined in `NonconvexPavito` Suggestion: define the const at top-level before running function that uses it (stricter Julia v1.12+ rule). Note: the binding state changed since the error occurred (was: 11, now: 0). Stacktrace: [1] #s27#1 @ ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:30 [inlined] [2] var"#s27#1"(T::Any, ::Any, ::Any) @ ConstructionBase ./none:0 [3] (::Core.GeneratedFunctionStub)(::UInt64, ::Method, ::Any, ::Vararg{Any}) @ Base ./expr.jl:1828 [4] setproperties_object(obj::NonconvexPavito.PavitoIpoptCbcResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#12#13"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#14#15"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#12#13"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#14#15"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:219 [5] setproperties(obj::NonconvexPavito.PavitoIpoptCbcResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#12#13"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#14#15"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#12#13"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#14#15"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:133 [6] set @ ~/.julia/packages/Setfield/ZezIj/src/lens.jl:122 [inlined] [7] macro expansion @ ~/.julia/packages/Setfield/ZezIj/src/sugar.jl:198 [inlined] [8] optimize(::Model{Vector{Any}}, ::PavitoIpoptCbcAlg, ::Vector{Float64}; kwargs::@Kwargs{options::PavitoIpoptCbcOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:244 [9] kwcall(::@NamedTuple{options::PavitoIpoptCbcOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}, ::typeof(optimize), ::Model{Vector{Any}}, ::PavitoIpoptCbcAlg, ::Vector{Float64}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 [10] top-level scope @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:2057 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2033 [inlined] [12] macro expansion @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:44 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [14] macro expansion @ ~/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:52 [inlined] [15] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [16] top-level scope @ none:6 [17] eval(m::Module, e::Any) @ Core ./boot.jl:489 [18] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [19] _start() @ Base ./client.jl:577 Test Summary: | Error Total Time First order - true | 3 3 4m00.3s Simple constraints | 1 1 3m44.8s Block constraints | 1 1 7.4s Infinite bounds | 1 1 8.1s RNG of the outermost testset: Random.Xoshiro(0x75e911c26c1fe582, 0x14de195ec3565e12, 0x053dec007ec78867, 0xc39245c1fbb39672, 0x27b8e22f11f1c6d9) Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.648148 - 0.00 seconds Cgl0003I 0 fixed, 1 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (1 integer (0 of which binary)) and 10 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 1.19072 Cbc0012I Integer solution of 1.1907242 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.79175426 to 1.1907242 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.791754 to 1.19072 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 ERROR: LoadError: Some tests did not pass: 0 passed, 0 failed, 3 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:6 Testing failed after 418.64s ERROR: LoadError: Package NonconvexPavito errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2673 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2522 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:538 [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:515 [6] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:168 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:157 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [9] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [12] include(mod::Module, _path::String) @ Base ./Base.jl:309 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [14] _start() @ Base ./client.jl:577 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1562.33s: package tests unexpectedly errored