Package evaluation to load GalacticEvolutionary on Julia 1.14.0-DEV.2373 (cf67ecc88f*) started at 2026-06-13T18:09:04.374 ################################################################################ # Set-up # Set-up completed after 0.12s ################################################################################ # Installation # Installing GalacticEvolutionary... Resolving package versions... Installed StackViews ───────────────────── v0.1.2 Installed DiffResults ──────────────────── v1.1.0 Installed CommonSolve ──────────────────── v0.2.7 Installed Adapt ────────────────────────── v3.7.2 Installed AbstractTrees ────────────────── v0.4.5 Installed SnoopPrecompile ──────────────── v1.0.3 Installed FillArrays ───────────────────── v0.13.11 Installed MacroTools ───────────────────── v0.5.16 Installed OrderedCollections ───────────── v1.8.2 Installed ExprTools ────────────────────── v0.1.10 Installed IteratorInterfaceExtensions ──── v1.0.0 Installed RuntimeGeneratedFunctions ────── v0.5.19 Installed ConstructionBase ─────────────── v1.6.0 Installed ArrayInterfaceStaticArraysCore ─ v0.1.4 Installed ArrayInterface ───────────────── v7.7.1 Installed RecipesBase ──────────────────── v1.3.4 Installed ProgressLogging ──────────────── v0.1.6 Installed FunctionWrappersWrappers ─────── v0.1.3 Installed DataAPI ──────────────────────── v1.16.0 Installed ConsoleProgressMonitor ───────── v0.1.2 Installed Statistics ───────────────────── v1.11.1 Installed Compat ───────────────────────── v4.18.1 Installed DataValueInterfaces ──────────── v1.0.0 Installed LoggingExtras ────────────────── v0.4.9 Installed PrecompileTools ──────────────── v1.3.4 Installed TerminalLoggers ──────────────── v0.1.7 Installed GPUArraysCore ────────────────── v0.1.5 Installed ProgressMeter ────────────────── v1.11.0 Installed StaticArraysCore ─────────────── v1.4.4 Installed OffsetArrays ─────────────────── v1.17.0 Installed Requires ─────────────────────── v1.3.1 Installed FunctionWrappers ─────────────── v1.1.3 Installed LeftChildRightSiblingTrees ───── v0.2.1 Installed ChainRulesCore ───────────────── v1.26.1 Installed SciMLBase ────────────────────── v1.81.0 Installed FiniteDiff ───────────────────── v2.31.0 Installed GalacticOptim ────────────────── v3.4.0 Installed NLSolversBase ────────────────── v8.0.0 Installed Tables ───────────────────────── v1.12.1 Installed Reexport ─────────────────────── v1.2.2 Installed TableTraits ──────────────────── v1.0.1 Installed EnumX ────────────────────────── v1.0.7 Installed Setfield ─────────────────────── v1.1.2 Installed ArrayInterfaceCore ───────────── v0.1.29 Installed GalacticEvolutionary ─────────── v0.1.0 Installed ZygoteRules ──────────────────── v0.2.7 Installed Preferences ──────────────────── v1.5.2 Installed UnPack ───────────────────────── v1.0.2 Installed Evolutionary ─────────────────── v0.11.2 Installed RecursiveArrayTools ──────────── v2.32.3 Installed DocStringExtensions ──────────── v0.8.6 Installed ADTypes ──────────────────────── v1.22.0 Installed DifferentiationInterface ─────── v0.6.52 Updating `~/.julia/environments/v1.14/Project.toml` [e82bed00] + GalacticEvolutionary v0.1.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [47edcb42] + ADTypes v1.22.0 [1520ce14] + AbstractTrees v0.4.5 ⌅ [79e6a3ab] + Adapt v3.7.2 ⌃ [4fba245c] + ArrayInterface v7.7.1 [30b0a656] + ArrayInterfaceCore v0.1.29 [dd5226c6] + ArrayInterfaceStaticArraysCore v0.1.4 [d360d2e6] + ChainRulesCore v1.26.1 [38540f10] + CommonSolve v0.2.7 [34da2185] + Compat v4.18.1 [88cd18e8] + ConsoleProgressMonitor v0.1.2 [187b0558] + ConstructionBase v1.6.0 [9a962f9c] + DataAPI v1.16.0 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 ⌃ [a0c0ee7d] + DifferentiationInterface v0.6.52 ⌅ [ffbed154] + DocStringExtensions v0.8.6 [4e289a0a] + EnumX v1.0.7 [86b6b26d] + Evolutionary v0.11.2 [e2ba6199] + ExprTools v0.1.10 ⌅ [1a297f60] + FillArrays v0.13.11 [6a86dc24] + FiniteDiff v2.31.0 [069b7b12] + FunctionWrappers v1.1.3 ⌅ [77dc65aa] + FunctionWrappersWrappers v0.1.3 ⌅ [46192b85] + GPUArraysCore v0.1.5 [e82bed00] + GalacticEvolutionary v0.1.0 [a75be94c] + GalacticOptim v3.4.0 [82899510] + IteratorInterfaceExtensions v1.0.0 ⌅ [1d6d02ad] + LeftChildRightSiblingTrees v0.2.1 ⌅ [e6f89c97] + LoggingExtras v0.4.9 [1914dd2f] + MacroTools v0.5.16 [d41bc354] + NLSolversBase v8.0.0 [6fe1bfb0] + OffsetArrays v1.17.0 ⌅ [bac558e1] + OrderedCollections v1.8.2 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [33c8b6b6] + ProgressLogging v0.1.6 [92933f4c] + ProgressMeter v1.11.0 [3cdcf5f2] + RecipesBase v1.3.4 ⌅ [731186ca] + RecursiveArrayTools v2.32.3 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [7e49a35a] + RuntimeGeneratedFunctions v0.5.19 ⌅ [0bca4576] + SciMLBase v1.81.0 [efcf1570] + Setfield v1.1.2 [66db9d55] + SnoopPrecompile v1.0.3 [cae243ae] + StackViews v0.1.2 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [5d786b92] + TerminalLoggers v0.1.7 [3a884ed6] + UnPack v1.0.2 [700de1a5] + ZygoteRules v0.2.7 [0dad84c5] + ArgTools v1.2.0 [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 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.14.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [4607b0f0] + SuiteSparse [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.2+0 [deac9b47] + LibCURL_jll v8.20.0+1 [e37daf67] + LibGit2_jll v1.9.4+0 [29816b5a] + LibSSH2_jll v1.11.101+0 [14a3606d] + MozillaCACerts_jll v2026.5.14 [4536629a] + OpenBLAS_jll v0.3.33+0 [458c3c95] + OpenSSL_jll v3.5.7+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.69.0+0 [3f19e933] + p7zip_jll v17.8.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.44s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Project No packages added to or removed from `~/.julia/environments/pkgeval/Project.toml` Manifest No packages added to or removed from `~/.julia/environments/pkgeval/Manifest.toml` Precompiling package dependencies... Precompiling project... 4.0 s ✓ MacroTools 0.6 s ✓ Reexport 1.1 s ✓ Statistics 1.1 s ✓ DataAPI 1.1 s ✓ ConstructionBase 0.7 s ✓ UnPack 0.5 s ✓ DataValueInterfaces 0.9 s ✓ StaticArraysCore 130.0 s ✓ OrderedCollections 39.1 s ✓ FunctionWrappers 1.5 s ✓ ADTypes 63.9 s ✓ AbstractTrees 0.9 s ✓ EnumX 83.9 s ✓ OffsetArrays 0.9 s ✓ ExprTools 0.6 s ✓ CommonSolve 0.5 s ✓ IteratorInterfaceExtensions 1.2 s ✓ Requires 34.1 s ✓ ProgressLogging 51.0 s ✓ ProgressMeter 2.3 s ✓ LoggingExtras 35.1 s ✓ DocStringExtensions 1.4 s ✓ Compat 2.5 s ✓ Preferences 36.1 s ✓ Statistics → SparseArraysExt 0.5 s ✓ ConstructionBase → ConstructionBaseLinearAlgebraExt 0.9 s ✓ DiffResults 31.9 s ✓ FunctionWrappersWrappers 2.1 s ✓ DifferentiationInterface 0.5 s ✓ ADTypes → ADTypesConstructionBaseExt 46.4 s ✓ LeftChildRightSiblingTrees 34.9 s ✓ StackViews 1.0 s ✓ RuntimeGeneratedFunctions 0.5 s ✓ TableTraits 0.9 s ✓ Adapt 34.9 s ✓ ConsoleProgressMonitor 0.6 s ✓ Compat → CompatLinearAlgebraExt 2.5 s ✓ SnoopPrecompile 2.6 s ✓ PrecompileTools 88.6 s ✓ FillArrays 2.8 s ✓ Setfield 34.3 s ✓ DifferentiationInterface → DifferentiationInterfaceSparseArraysExt 71.7 s ✓ TerminalLoggers 130.2 s ✓ Tables 35.7 s ✓ ArrayInterface 1.2 s ✓ GPUArraysCore 33.5 s ✓ OffsetArrays → OffsetArraysAdaptExt 269.6 s ✓ ChainRulesCore 66.4 s ✓ ArrayInterfaceCore 4.2 s ✓ RecipesBase 34.6 s ✓ ArrayInterface → ArrayInterfaceStaticArraysCoreExt 0.6 s ✓ DifferentiationInterface → DifferentiationInterfaceGPUArraysCoreExt 34.8 s ✓ ArrayInterface → ArrayInterfaceGPUArraysCoreExt 50.3 s ✓ ChainRulesCore → ChainRulesCoreSparseArraysExt 36.1 s ✓ ZygoteRules 33.2 s ✓ ADTypes → ADTypesChainRulesCoreExt 33.7 s ✓ DifferentiationInterface → DifferentiationInterfaceChainRulesCoreExt 33.0 s ✓ ArrayInterfaceStaticArraysCore 37.8 s ✓ FiniteDiff 148.7 s ✓ RecursiveArrayTools 34.2 s ✓ FiniteDiff → FiniteDiffSparseArraysExt 35.7 s ✓ DifferentiationInterface → DifferentiationInterfaceFiniteDiffExt ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122 =# - Expected module name Expression:  (escape ReturnCode) Containing expressions:  (module false (escape ReturnCode) (block (primitive (<: T (curly Enum Int32)) 32) (let (= value_name_map Dict{Int32, Symbol}(3 => :DtNaN, 2 => :Terminated, 6 => :Unstable, 5 => :DtLessThanMin, 4 => :MaxIters, 1 => :Success, 13 => :Infeasible, 8 => :ConvergenceFailure, 7 => :InitialFailure, 10 => :ExactSolutionLeft, 14 => :MaxTime, 12 => :FloatingPointLimit, 11 => :ExactSolutionRight, 9 => :Failure, 0 => :Default)) (block (= (call check_valid x) (block (|| (call in x (call keys value_name_map)) (call throw (call ArgumentError (string "invalid value for Enum " (inert ReturnCode) ": " x ".")))))) (global (function (call (escape T) (:: x Integer)) (block (call check_valid x) (return (call (. Base (inert bitcast)) (escape T) (call convert Int32 x)))))) (= (call (. (. Base (inert Enums)) (inert namemap)) (:: (curly (. Base (inert Type)) (escape T)))) (block value_name_map)) (= (call (. (. Base (inert Enums)) (inert instances)) (:: (curly (. Base (inert Type)) (escape T)))) (block (tuple (escape Default) (escape Success) (escape Terminated) (escape DtNaN) (escape MaxIters) (escape DtLessThanMin) (escape Unstable) (escape InitialFailure) (escape ConvergenceFailure) (escape Failure) (escape ExactSolutionLeft) (escape ExactSolutionRight) (escape FloatingPointLimit) (escape Infeasible) (escape MaxTime)))) (= (call (. EnumX (inert symbol_map)) (:: (curly (. Base (inert Type)) (escape T)))) (block Pair{Symbol, Int32}[:Default => 0, :Success => 1, :Terminated => 2, :DtNaN => 3, :MaxIters => 4, :DtLessThanMin => 5, :Unstable => 6, :InitialFailure => 7, :ConvergenceFailure => 8, :Failure => 9, :ExactSolutionLeft => 10, :ExactSolutionRight => 11, :FloatingPointLimit => 12, :Infeasible => 13, :MaxTime => 14])))) (escape (public T Default Success Terminated DtNaN MaxIters DtLessThanMin Unstable InitialFailure ConvergenceFailure Failure ExactSolutionLeft ExactSolutionRight FloatingPointLimit Infeasible MaxTime)) (const (= (escape Default) (call (escape T) 0))) (const (= (escape Success) (call (escape T) 1))) (const (= (escape Terminated) (call (escape T) 2))) (const (= (escape DtNaN) (call (escape T) 3))) (const (= (escape MaxIters) (call (escape T) 4))) (const (= (escape DtLessThanMin) (call (escape T) 5))) (const (= (escape Unstable) (call (escape T) 6))) (const (= (escape InitialFailure) (call (escape T) 7))) (const (= (escape ConvergenceFailure) (call (escape T) 8))) (const (= (escape Failure) (call (escape T) 9))) (const (= (escape ExactSolutionLeft) (call (escape T) 10))) (const (= (escape ExactSolutionRight) (call (escape T) 11))) (const (= (escape FloatingPointLimit) (call (escape T) 12))) (const (= (escape Infeasible) (call (escape T) 13))) (const (= (escape MaxTime) (call (escape T) 14))) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:34 =#) "`ReturnCode.Default`\n\nThe default state of the solver. If this return code is given, then the solving\nprocess is either still in process or the solver library has not been setup\nwith the return code interface and thus the return code is undetermined.\n\n## Common Reasons for Seeing this Return Code\n\n* A common reason for `Default` return codes is that a solver is a non-SciML solver\n which does not fully conform to the interface. Please open an issue if this is seen\n and it will be improved.\n* Another common reason for a `Default` return code is if the solver is probed\n internally before the solving process is done, such as through the callback interface.\n Return codes are set to `Default` to start and are changed to `Success` and other\n return codes upon finishing the solving process or hitting a numerical difficulty.\n\n## Properties\n\n* successful_retcode = false\n" Default) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:57 =#) "`ReturnCode.Success`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, but no extra information about that success is given.\n\n## Common Reasons for Seeing this Return Code\n\n* This is the most common return code and most solvers will give this return code if\n the solving process went as expected without any errors or detected numerical issues.\n\n## Properties\n\n* successful_retcode = true\n" Success) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:74 =#) "`ReturnCode.Terminated`\n\nThe successful termination state of the solver. If this return code is given,\nthen the solving process was successful at terminating the solve, usually\nthrough a callback `affect!` via `terminate!(integrator)`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is if a user calls a callback which\n uses `terminate!(integrator)` to halt the integration at a user-chosen stopping point.\n* Another common reason for this return code is due to implicit `terminate!` statements\n in some library callbacks. For example, `SteadyStateCallback` uses `terminate!`\n internally, so solutions which reach steady state will have a `ReturnCode.Terminated`\n state instead of a `ReturnCode.Success` state. Similarly, problems solved via\n SteadyStateDiffEq.jl will have this `ReturnCode.Terminated` state if a timestepping\n method is used to solve to steady state.\n\n## Properties\n\n* successful_retcode = true\n" Terminated) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:98 =#) "`ReturnCode.DtNaN`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was determined to be `NaN` and thus the solver could not continue.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the automatic `dt`\n selection algorithm is used but the starting derivative has a `NaN` or `Inf`\n derivative term. Double check that the `f(u0,p,t0)` term is well-defind without\n `NaN` or `Inf` values.\n* Another common reason for this return code is because of a user set `dt` which is\n calculated to be a `NaN`. If `solve(prob,alg,dt=x)`, double check that `x` is not\n `NaN`.\n\n## Properties\n\n* successful_retcode = false\n" DtNaN) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:121 =#) "`ReturnCode.MaxIters`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\niterations hit the `maxiters` either set by default or by the user in the\n`solve`/`init` command.\n\n## Note about Nonlinear Optimization\n\nIn nonlinear optimization, many solvers (such as `OptimizationOptimisers.Adam`) do not\nhave an exit criteria other than `iters == maxiters`. In this case, the solvers will\niterate until `maxiters` and exit with a `Success` return code, as that is a successful\nrun of the solver and not considered to be an error state. Solves with early termination\ncritera, such as `Optim.BFGS` exiting when the gradient is sufficiently close to zero,\nwill give `ReturnCode.MaxIters` on exits which require the maximum iteration.\n\n## Common Reasons for Seeing this Return Code\n\n* This commonly occurs in ODE solving if a non-stiff method (e.g. `Tsit5`) is used in\n an algorithm choice for a stiff ODE. It is recommended that in such cases, one tries a\n stiff ODE solver.\n* This commonly occurs in optimization and nonlinear solvers if the tolerance on `solve`\n to too low and cannot be achieved due to floating point error or the condition number\n of the solver matrix. Double check that the chosen tolerance is numerically possible.\n\n## Properties\n\n* successful_retcode = false\n" MaxIters) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:153 =#) "`ReturnCode.DtLessThanMin`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was made to be less than `dtmin`, i.e. `dt < dtmin`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the the integration\n is going unstable. As `f(u,p,t) -> infinity`, the time steps required by the solver\n to accurately handle the dynamics decreases. When it gets sufficiently small, `dtmin`,\n an exit is thrown as the solution is likely unstable. `dtmin` is also chosen to be\n around the value where floating point issues cause `t + dt == t`, and thus a `dt`\n of that size is impossible at floating point precision.\n* Another common reason for this return code is if domain constraints are set, such as\n by using `isoutofdomain`, but the domain constraint is incorrect. For example, if\n one is solving the ODE `f(u,p,t) = -u - 1`, one may think \"but I want a solution with\n `u > 0` and thus I will set `isoutofdomain(u,p,t) = u < 0`. However, the true solution\n of this ODE is not positive, and thus what will occur is that the solver will try to\n decerase `dt` until it can give an accurate solution that is positive. As this is\n impossible, it will continue to shrink the `dt` until `dt < dtmin` and then exit with\n this return code.\n\n## Properties\n\n* successful_retcode = false\n" DtLessThanMin) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:183 =#) "`ReturnCode.Unstable`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `unstable_check`\nfunction, as given by the `unstable_check` common keyword argument (or its default),\ngive a `true` at the current state.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because `u` contains a `NaN`\n or `Inf` value. The default `unstable_check` only checks for these values.\n\n## Properties\n\n* successful_retcode = false\n" Unstable) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:202 =#) "`ReturnCode.InitialFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because the initialization process failed.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the initialization\n process of a DAE solver failed to find consistent initial conditions, which can\n occur if the differentiation index of the DAE solver is too high. Most DAE solvers\n only allow for index-1 DAEs, and so an index-2 DAE will fail during this\n initialization. To solve this kind of problem, use `ModelingToolkit.jl` and its\n `structural_simplify` method to reduce the index of the DAE.\n* Another common reason for this return code is if the initial condition was not\n suitable for the numerical solve. For example, the initial point had a `NaN` or `Inf`.\n Or in optimization, this can occur if the initial point is outside of the bound\n constraints given by the user.\n\n## Properties\n\n* successful_retcode = false\n" InitialFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:227 =#) "`ReturnCode.ConvergenceFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because internal nonlinear solver iterations\nfailed to converge.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because an inappropriate\n nonlinear solver was chosen. If fixed point iteration is used on a stiff problem,\n it will be faster by avoiding the Jacobian but it will make a stiff ODE solver not\n stable for stiff problems!\n\n## Properties\n\n* successful_retcode = false\n" ConvergenceFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:247 =#) "`ReturnCode.Failure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful but no extra information is given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the solver is a wrapped\n solver (i.e. a Fortran code) which does not provide any extra information about its\n exit state. If this is from a Julia-based solver, please open an issue.\n\n## Properties\n\n* successful_retcode = false\n" Failure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:265 =#) "`ReturnCode.ExactSolutionLeft`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the left solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the left for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionLeft) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:284 =#) "`ReturnCode.ExactSolutionRight`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the right solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the right for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionRight) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:303 =#) "`ReturnCode.FloatingPointLimit`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the closest floating point value to the solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a nonlinear solver, such as Falsi,\niterating to convergence is unable to give the exact `f(x)=0` solution due to floating\npoint precision issues, and thus it gives the closest floating point value to the\ntrue solution for `x`.\n\n## Properties\n\n* successful_retcode = true\n" FloatingPointLimit) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:322 =#) "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" Infeasible) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:333 =#) "`ReturnCode.MaxTime`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\ntimer hit `maxtime` either set by default or by the user in the\n`solve`/`init` command.\n\n## Properties\n\n* successful_retcode = false\n" MaxTime)))  Detailed provenance:  (escape ReturnCode)  └─ (escape ReturnCode)  └─ (escape ReturnCode)  ├─ @ /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 =#) "`SciML.ReturnCode`\n\n`SciML.ReturnCode` is the standard return code enum interface for the SciML interface.\nReturn codes are notes given by the solvers to indicate the state of the solution, for\nexample whether it successfully solved the equations, whether it failed to solve the\nequations, and importantly, why it exited.\n\n## Using `SciML.ReturnCode`\n\n`SciML.ReturnCode` use the interface of [EnumX.jl](https://github.com/fredrikekre/EnumX.jl)\nand thus inherits all of the behaviors of being an EnumX. This includes the Enum type itself\nbeing referred to as `SciML.ReturnCode.T`, and each of the constituent enum states being\nreferred to via `getproperty`, i.e. `SciML.ReturnCode.Success`.\n\n## Note About Success Checking\n\nPrevious iterations of the interface suggested using `sol.retcode == :Success`, however,\nthat is now not advised instead should be replaced with `\nSciMLBase.successful_retcode(sol)`. The reason is that there are many different\ncodes that can be interpreted as successful, such as `ReturnCode.Terminated` which means\nsuccessfully used `terminate!(integrator)` to end an integration at a user-specified\ncondition. As such, `successful_retcode` is the most general way to query for if the solver\ndid not error.\n\n## Properties\n\n* `successful_retcode(retcode::ReturnCode.T)`: Determines whether the output enum is\n considered a success state of the solver, i.e. the solver successfully solved the\n equations. `ReturnCode.Success` is the most basic form, simply declaring that it was\n successful, but many more informative success return codes exist as well.\n" (macrocall (. EnumX (inert @enumx)) :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:33 =#) ReturnCode (block (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:34 =#) "`ReturnCode.Default`\n\nThe default state of the solver. If this return code is given, then the solving\nprocess is either still in process or the solver library has not been setup\nwith the return code interface and thus the return code is undetermined.\n\n## Common Reasons for Seeing this Return Code\n\n* A common reason for `Default` return codes is that a solver is a non-SciML solver\n which does not fully conform to the interface. Please open an issue if this is seen\n and it will be improved.\n* Another common reason for a `Default` return code is if the solver is probed\n internally before the solving process is done, such as through the callback interface.\n Return codes are set to `Default` to start and are changed to `Success` and other\n return codes upon finishing the solving process or hitting a numerical difficulty.\n\n## Properties\n\n* successful_retcode = false\n" Default) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:57 =#) "`ReturnCode.Success`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, but no extra information about that success is given.\n\n## Common Reasons for Seeing this Return Code\n\n* This is the most common return code and most solvers will give this return code if\n the solving process went as expected without any errors or detected numerical issues.\n\n## Properties\n\n* successful_retcode = true\n" Success) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:74 =#) "`ReturnCode.Terminated`\n\nThe successful termination state of the solver. If this return code is given,\nthen the solving process was successful at terminating the solve, usually\nthrough a callback `affect!` via `terminate!(integrator)`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is if a user calls a callback which\n uses `terminate!(integrator)` to halt the integration at a user-chosen stopping point.\n* Another common reason for this return code is due to implicit `terminate!` statements\n in some library callbacks. For example, `SteadyStateCallback` uses `terminate!`\n internally, so solutions which reach steady state will have a `ReturnCode.Terminated`\n state instead of a `ReturnCode.Success` state. Similarly, problems solved via\n SteadyStateDiffEq.jl will have this `ReturnCode.Terminated` state if a timestepping\n method is used to solve to steady state.\n\n## Properties\n\n* successful_retcode = true\n" Terminated) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:98 =#) "`ReturnCode.DtNaN`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was determined to be `NaN` and thus the solver could not continue.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the automatic `dt`\n selection algorithm is used but the starting derivative has a `NaN` or `Inf`\n derivative term. Double check that the `f(u0,p,t0)` term is well-defind without\n `NaN` or `Inf` values.\n* Another common reason for this return code is because of a user set `dt` which is\n calculated to be a `NaN`. If `solve(prob,alg,dt=x)`, double check that `x` is not\n `NaN`.\n\n## Properties\n\n* successful_retcode = false\n" DtNaN) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:121 =#) "`ReturnCode.MaxIters`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\niterations hit the `maxiters` either set by default or by the user in the\n`solve`/`init` command.\n\n## Note about Nonlinear Optimization\n\nIn nonlinear optimization, many solvers (such as `OptimizationOptimisers.Adam`) do not\nhave an exit criteria other than `iters == maxiters`. In this case, the solvers will\niterate until `maxiters` and exit with a `Success` return code, as that is a successful\nrun of the solver and not considered to be an error state. Solves with early termination\ncritera, such as `Optim.BFGS` exiting when the gradient is sufficiently close to zero,\nwill give `ReturnCode.MaxIters` on exits which require the maximum iteration.\n\n## Common Reasons for Seeing this Return Code\n\n* This commonly occurs in ODE solving if a non-stiff method (e.g. `Tsit5`) is used in\n an algorithm choice for a stiff ODE. It is recommended that in such cases, one tries a\n stiff ODE solver.\n* This commonly occurs in optimization and nonlinear solvers if the tolerance on `solve`\n to too low and cannot be achieved due to floating point error or the condition number\n of the solver matrix. Double check that the chosen tolerance is numerically possible.\n\n## Properties\n\n* successful_retcode = false\n" MaxIters) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:153 =#) "`ReturnCode.DtLessThanMin`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was made to be less than `dtmin`, i.e. `dt < dtmin`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the the integration\n is going unstable. As `f(u,p,t) -> infinity`, the time steps required by the solver\n to accurately handle the dynamics decreases. When it gets sufficiently small, `dtmin`,\n an exit is thrown as the solution is likely unstable. `dtmin` is also chosen to be\n around the value where floating point issues cause `t + dt == t`, and thus a `dt`\n of that size is impossible at floating point precision.\n* Another common reason for this return code is if domain constraints are set, such as\n by using `isoutofdomain`, but the domain constraint is incorrect. For example, if\n one is solving the ODE `f(u,p,t) = -u - 1`, one may think \"but I want a solution with\n `u > 0` and thus I will set `isoutofdomain(u,p,t) = u < 0`. However, the true solution\n of this ODE is not positive, and thus what will occur is that the solver will try to\n decerase `dt` until it can give an accurate solution that is positive. As this is\n impossible, it will continue to shrink the `dt` until `dt < dtmin` and then exit with\n this return code.\n\n## Properties\n\n* successful_retcode = false\n" DtLessThanMin) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:183 =#) "`ReturnCode.Unstable`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `unstable_check`\nfunction, as given by the `unstable_check` common keyword argument (or its default),\ngive a `true` at the current state.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because `u` contains a `NaN`\n or `Inf` value. The default `unstable_check` only checks for these values.\n\n## Properties\n\n* successful_retcode = false\n" Unstable) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:202 =#) "`ReturnCode.InitialFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because the initialization process failed.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the initialization\n process of a DAE solver failed to find consistent initial conditions, which can\n occur if the differentiation index of the DAE solver is too high. Most DAE solvers\n only allow for index-1 DAEs, and so an index-2 DAE will fail during this\n initialization. To solve this kind of problem, use `ModelingToolkit.jl` and its\n `structural_simplify` method to reduce the index of the DAE.\n* Another common reason for this return code is if the initial condition was not\n suitable for the numerical solve. For example, the initial point had a `NaN` or `Inf`.\n Or in optimization, this can occur if the initial point is outside of the bound\n constraints given by the user.\n\n## Properties\n\n* successful_retcode = false\n" InitialFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:227 =#) "`ReturnCode.ConvergenceFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because internal nonlinear solver iterations\nfailed to converge.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because an inappropriate\n nonlinear solver was chosen. If fixed point iteration is used on a stiff problem,\n it will be faster by avoiding the Jacobian but it will make a stiff ODE solver not\n stable for stiff problems!\n\n## Properties\n\n* successful_retcode = false\n" ConvergenceFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:247 =#) "`ReturnCode.Failure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful but no extra information is given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the solver is a wrapped\n solver (i.e. a Fortran code) which does not provide any extra information about its\n exit state. If this is from a Julia-based solver, please open an issue.\n\n## Properties\n\n* successful_retcode = false\n" Failure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:265 =#) "`ReturnCode.ExactSolutionLeft`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the left solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the left for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionLeft) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:284 =#) "`ReturnCode.ExactSolutionRight`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the right solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the right for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionRight) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:303 =#) "`ReturnCode.FloatingPointLimit`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the closest floating point value to the solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a nonlinear solver, such as Falsi,\niterating to convergence is unable to give the exact `f(x)=0` solution due to floating\npoint precision issues, and thus it gives the closest floating point value to the\ntrue solution for `x`.\n\n## Properties\n\n* successful_retcode = true\n" FloatingPointLimit) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:322 =#) "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" Infeasible) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:333 =#) "`ReturnCode.MaxTime`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\ntimer hit `maxtime` either set by default or by the user in the\n`solve`/`init` command.\n\n## Properties\n\n* successful_retcode = false\n" MaxTime))))  └─ @ /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1  Stacktrace:  [1] lower_step(iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}, mod::Module, world::UInt64; soft_scope::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:81  [2] lower_step(iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}, mod::Module, world::UInt64; soft_scope::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:72  [3] _eval(mod::Module, iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}; soft_scope::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:532  [4] eval(mod::Module, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}; macro_world::UInt64, soft_scope::Nothing, opts::@Kwargs{expr_compat_mode::Bool})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:520 [inlined]  [5] top-level scope  @ ~/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1  [6] macro expansion  @ ~/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 [inlined]  [7] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [8] top-level scope  @ ~/.julia/packages/SciMLBase/QqtZA/src/SciMLBase.jl:623  [9] include(mod::Module, _path::String)  @ Base Base.jl:325  [10] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [11] top-level scope  @ stdin:5  [12] eval(m::Module, e::Any)  @ Core boot.jl:522  [13] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [14] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [15] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [16] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 in expression starting at /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/SciMLBase.jl:1 in expression starting at stdin:5 ✗ SciMLBase 36.9 s ✓ NLSolversBase ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("0bca4576-84f4-4d90-8ffe-ffa030f20462"), "SciMLBase") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207  [12] top-level scope  @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8  [13] macro expansion  @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8 [inlined]  [14] eval(m::Module, e::Any)  @ Core boot.jl:522  [15] _eval(mod::Module, iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}; soft_scope::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:547  [16] eval(mod::Module, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}; macro_world::UInt64, soft_scope::Nothing, opts::@Kwargs{expr_compat_mode::Bool})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:520 [inlined]  [17] top-level scope  @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8  [18] macro expansion  @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8 [inlined]  [19] include(mod::Module, _path::String)  @ Base Base.jl:325  [20] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [21] top-level scope  @ stdin:5  [22] eval(m::Module, e::Any)  @ Core boot.jl:522  [23] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [24] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [25] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [26] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:1 in expression starting at stdin:5 ✗ GalacticOptim 70.0 s ✓ Evolutionary ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("a75be94c-b780-496d-a8a9-0878b188d577"), "GalacticOptim") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207  [12] top-level scope  @ ~/.julia/packages/GalacticEvolutionary/CEwkW/src/GalacticEvolutionary.jl:3  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:522  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [18] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [20] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/GalacticEvolutionary/CEwkW/src/GalacticEvolutionary.jl:1 in expression starting at stdin:5 ✗ GalacticEvolutionary 64 dependencies successfully precompiled in 2139 seconds. 33 already precompiled. Precompilation completed after 2156.14s ################################################################################ # Loading # Loading GalacticEvolutionary... ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122 =# - Expected module name Expression:  (escape ReturnCode) Containing expressions:  (module false (escape ReturnCode) (block (primitive (<: T (curly Enum Int32)) 32) (let (= value_name_map Dict{Int32, Symbol}(3 => :DtNaN, 2 => :Terminated, 6 => :Unstable, 5 => :DtLessThanMin, 4 => :MaxIters, 1 => :Success, 13 => :Infeasible, 8 => :ConvergenceFailure, 7 => :InitialFailure, 10 => :ExactSolutionLeft, 14 => :MaxTime, 12 => :FloatingPointLimit, 11 => :ExactSolutionRight, 9 => :Failure, 0 => :Default)) (block (= (call check_valid x) (block (|| (call in x (call keys value_name_map)) (call throw (call ArgumentError (string "invalid value for Enum " (inert ReturnCode) ": " x ".")))))) (global (function (call (escape T) (:: x Integer)) (block (call check_valid x) (return (call (. Base (inert bitcast)) (escape T) (call convert Int32 x)))))) (= (call (. (. Base (inert Enums)) (inert namemap)) (:: (curly (. Base (inert Type)) (escape T)))) (block value_name_map)) (= (call (. (. Base (inert Enums)) (inert instances)) (:: (curly (. Base (inert Type)) (escape T)))) (block (tuple (escape Default) (escape Success) (escape Terminated) (escape DtNaN) (escape MaxIters) (escape DtLessThanMin) (escape Unstable) (escape InitialFailure) (escape ConvergenceFailure) (escape Failure) (escape ExactSolutionLeft) (escape ExactSolutionRight) (escape FloatingPointLimit) (escape Infeasible) (escape MaxTime)))) (= (call (. EnumX (inert symbol_map)) (:: (curly (. Base (inert Type)) (escape T)))) (block Pair{Symbol, Int32}[:Default => 0, :Success => 1, :Terminated => 2, :DtNaN => 3, :MaxIters => 4, :DtLessThanMin => 5, :Unstable => 6, :InitialFailure => 7, :ConvergenceFailure => 8, :Failure => 9, :ExactSolutionLeft => 10, :ExactSolutionRight => 11, :FloatingPointLimit => 12, :Infeasible => 13, :MaxTime => 14])))) (escape (public T Default Success Terminated DtNaN MaxIters DtLessThanMin Unstable InitialFailure ConvergenceFailure Failure ExactSolutionLeft ExactSolutionRight FloatingPointLimit Infeasible MaxTime)) (const (= (escape Default) (call (escape T) 0))) (const (= (escape Success) (call (escape T) 1))) (const (= (escape Terminated) (call (escape T) 2))) (const (= (escape DtNaN) (call (escape T) 3))) (const (= (escape MaxIters) (call (escape T) 4))) (const (= (escape DtLessThanMin) (call (escape T) 5))) (const (= (escape Unstable) (call (escape T) 6))) (const (= (escape InitialFailure) (call (escape T) 7))) (const (= (escape ConvergenceFailure) (call (escape T) 8))) (const (= (escape Failure) (call (escape T) 9))) (const (= (escape ExactSolutionLeft) (call (escape T) 10))) (const (= (escape ExactSolutionRight) (call (escape T) 11))) (const (= (escape FloatingPointLimit) (call (escape T) 12))) (const (= (escape Infeasible) (call (escape T) 13))) (const (= (escape MaxTime) (call (escape T) 14))) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:34 =#) "`ReturnCode.Default`\n\nThe default state of the solver. If this return code is given, then the solving\nprocess is either still in process or the solver library has not been setup\nwith the return code interface and thus the return code is undetermined.\n\n## Common Reasons for Seeing this Return Code\n\n* A common reason for `Default` return codes is that a solver is a non-SciML solver\n which does not fully conform to the interface. Please open an issue if this is seen\n and it will be improved.\n* Another common reason for a `Default` return code is if the solver is probed\n internally before the solving process is done, such as through the callback interface.\n Return codes are set to `Default` to start and are changed to `Success` and other\n return codes upon finishing the solving process or hitting a numerical difficulty.\n\n## Properties\n\n* successful_retcode = false\n" Default) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:57 =#) "`ReturnCode.Success`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, but no extra information about that success is given.\n\n## Common Reasons for Seeing this Return Code\n\n* This is the most common return code and most solvers will give this return code if\n the solving process went as expected without any errors or detected numerical issues.\n\n## Properties\n\n* successful_retcode = true\n" Success) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:74 =#) "`ReturnCode.Terminated`\n\nThe successful termination state of the solver. If this return code is given,\nthen the solving process was successful at terminating the solve, usually\nthrough a callback `affect!` via `terminate!(integrator)`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is if a user calls a callback which\n uses `terminate!(integrator)` to halt the integration at a user-chosen stopping point.\n* Another common reason for this return code is due to implicit `terminate!` statements\n in some library callbacks. For example, `SteadyStateCallback` uses `terminate!`\n internally, so solutions which reach steady state will have a `ReturnCode.Terminated`\n state instead of a `ReturnCode.Success` state. Similarly, problems solved via\n SteadyStateDiffEq.jl will have this `ReturnCode.Terminated` state if a timestepping\n method is used to solve to steady state.\n\n## Properties\n\n* successful_retcode = true\n" Terminated) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:98 =#) "`ReturnCode.DtNaN`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was determined to be `NaN` and thus the solver could not continue.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the automatic `dt`\n selection algorithm is used but the starting derivative has a `NaN` or `Inf`\n derivative term. Double check that the `f(u0,p,t0)` term is well-defind without\n `NaN` or `Inf` values.\n* Another common reason for this return code is because of a user set `dt` which is\n calculated to be a `NaN`. If `solve(prob,alg,dt=x)`, double check that `x` is not\n `NaN`.\n\n## Properties\n\n* successful_retcode = false\n" DtNaN) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:121 =#) "`ReturnCode.MaxIters`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\niterations hit the `maxiters` either set by default or by the user in the\n`solve`/`init` command.\n\n## Note about Nonlinear Optimization\n\nIn nonlinear optimization, many solvers (such as `OptimizationOptimisers.Adam`) do not\nhave an exit criteria other than `iters == maxiters`. In this case, the solvers will\niterate until `maxiters` and exit with a `Success` return code, as that is a successful\nrun of the solver and not considered to be an error state. Solves with early termination\ncritera, such as `Optim.BFGS` exiting when the gradient is sufficiently close to zero,\nwill give `ReturnCode.MaxIters` on exits which require the maximum iteration.\n\n## Common Reasons for Seeing this Return Code\n\n* This commonly occurs in ODE solving if a non-stiff method (e.g. `Tsit5`) is used in\n an algorithm choice for a stiff ODE. It is recommended that in such cases, one tries a\n stiff ODE solver.\n* This commonly occurs in optimization and nonlinear solvers if the tolerance on `solve`\n to too low and cannot be achieved due to floating point error or the condition number\n of the solver matrix. Double check that the chosen tolerance is numerically possible.\n\n## Properties\n\n* successful_retcode = false\n" MaxIters) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:153 =#) "`ReturnCode.DtLessThanMin`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was made to be less than `dtmin`, i.e. `dt < dtmin`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the the integration\n is going unstable. As `f(u,p,t) -> infinity`, the time steps required by the solver\n to accurately handle the dynamics decreases. When it gets sufficiently small, `dtmin`,\n an exit is thrown as the solution is likely unstable. `dtmin` is also chosen to be\n around the value where floating point issues cause `t + dt == t`, and thus a `dt`\n of that size is impossible at floating point precision.\n* Another common reason for this return code is if domain constraints are set, such as\n by using `isoutofdomain`, but the domain constraint is incorrect. For example, if\n one is solving the ODE `f(u,p,t) = -u - 1`, one may think \"but I want a solution with\n `u > 0` and thus I will set `isoutofdomain(u,p,t) = u < 0`. However, the true solution\n of this ODE is not positive, and thus what will occur is that the solver will try to\n decerase `dt` until it can give an accurate solution that is positive. As this is\n impossible, it will continue to shrink the `dt` until `dt < dtmin` and then exit with\n this return code.\n\n## Properties\n\n* successful_retcode = false\n" DtLessThanMin) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:183 =#) "`ReturnCode.Unstable`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `unstable_check`\nfunction, as given by the `unstable_check` common keyword argument (or its default),\ngive a `true` at the current state.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because `u` contains a `NaN`\n or `Inf` value. The default `unstable_check` only checks for these values.\n\n## Properties\n\n* successful_retcode = false\n" Unstable) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:202 =#) "`ReturnCode.InitialFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because the initialization process failed.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the initialization\n process of a DAE solver failed to find consistent initial conditions, which can\n occur if the differentiation index of the DAE solver is too high. Most DAE solvers\n only allow for index-1 DAEs, and so an index-2 DAE will fail during this\n initialization. To solve this kind of problem, use `ModelingToolkit.jl` and its\n `structural_simplify` method to reduce the index of the DAE.\n* Another common reason for this return code is if the initial condition was not\n suitable for the numerical solve. For example, the initial point had a `NaN` or `Inf`.\n Or in optimization, this can occur if the initial point is outside of the bound\n constraints given by the user.\n\n## Properties\n\n* successful_retcode = false\n" InitialFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:227 =#) "`ReturnCode.ConvergenceFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because internal nonlinear solver iterations\nfailed to converge.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because an inappropriate\n nonlinear solver was chosen. If fixed point iteration is used on a stiff problem,\n it will be faster by avoiding the Jacobian but it will make a stiff ODE solver not\n stable for stiff problems!\n\n## Properties\n\n* successful_retcode = false\n" ConvergenceFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:247 =#) "`ReturnCode.Failure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful but no extra information is given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the solver is a wrapped\n solver (i.e. a Fortran code) which does not provide any extra information about its\n exit state. If this is from a Julia-based solver, please open an issue.\n\n## Properties\n\n* successful_retcode = false\n" Failure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:265 =#) "`ReturnCode.ExactSolutionLeft`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the left solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the left for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionLeft) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:284 =#) "`ReturnCode.ExactSolutionRight`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the right solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the right for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionRight) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:303 =#) "`ReturnCode.FloatingPointLimit`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the closest floating point value to the solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a nonlinear solver, such as Falsi,\niterating to convergence is unable to give the exact `f(x)=0` solution due to floating\npoint precision issues, and thus it gives the closest floating point value to the\ntrue solution for `x`.\n\n## Properties\n\n* successful_retcode = true\n" FloatingPointLimit) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:322 =#) "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" Infeasible) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:333 =#) "`ReturnCode.MaxTime`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\ntimer hit `maxtime` either set by default or by the user in the\n`solve`/`init` command.\n\n## Properties\n\n* successful_retcode = false\n" MaxTime)))  Detailed provenance:  (escape ReturnCode)  └─ (escape ReturnCode)  └─ (escape ReturnCode)  ├─ @ /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 =#) "`SciML.ReturnCode`\n\n`SciML.ReturnCode` is the standard return code enum interface for the SciML interface.\nReturn codes are notes given by the solvers to indicate the state of the solution, for\nexample whether it successfully solved the equations, whether it failed to solve the\nequations, and importantly, why it exited.\n\n## Using `SciML.ReturnCode`\n\n`SciML.ReturnCode` use the interface of [EnumX.jl](https://github.com/fredrikekre/EnumX.jl)\nand thus inherits all of the behaviors of being an EnumX. This includes the Enum type itself\nbeing referred to as `SciML.ReturnCode.T`, and each of the constituent enum states being\nreferred to via `getproperty`, i.e. `SciML.ReturnCode.Success`.\n\n## Note About Success Checking\n\nPrevious iterations of the interface suggested using `sol.retcode == :Success`, however,\nthat is now not advised instead should be replaced with `\nSciMLBase.successful_retcode(sol)`. The reason is that there are many different\ncodes that can be interpreted as successful, such as `ReturnCode.Terminated` which means\nsuccessfully used `terminate!(integrator)` to end an integration at a user-specified\ncondition. As such, `successful_retcode` is the most general way to query for if the solver\ndid not error.\n\n## Properties\n\n* `successful_retcode(retcode::ReturnCode.T)`: Determines whether the output enum is\n considered a success state of the solver, i.e. the solver successfully solved the\n equations. `ReturnCode.Success` is the most basic form, simply declaring that it was\n successful, but many more informative success return codes exist as well.\n" (macrocall (. EnumX (inert @enumx)) :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:33 =#) ReturnCode (block (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:34 =#) "`ReturnCode.Default`\n\nThe default state of the solver. If this return code is given, then the solving\nprocess is either still in process or the solver library has not been setup\nwith the return code interface and thus the return code is undetermined.\n\n## Common Reasons for Seeing this Return Code\n\n* A common reason for `Default` return codes is that a solver is a non-SciML solver\n which does not fully conform to the interface. Please open an issue if this is seen\n and it will be improved.\n* Another common reason for a `Default` return code is if the solver is probed\n internally before the solving process is done, such as through the callback interface.\n Return codes are set to `Default` to start and are changed to `Success` and other\n return codes upon finishing the solving process or hitting a numerical difficulty.\n\n## Properties\n\n* successful_retcode = false\n" Default) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:57 =#) "`ReturnCode.Success`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, but no extra information about that success is given.\n\n## Common Reasons for Seeing this Return Code\n\n* This is the most common return code and most solvers will give this return code if\n the solving process went as expected without any errors or detected numerical issues.\n\n## Properties\n\n* successful_retcode = true\n" Success) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:74 =#) "`ReturnCode.Terminated`\n\nThe successful termination state of the solver. If this return code is given,\nthen the solving process was successful at terminating the solve, usually\nthrough a callback `affect!` via `terminate!(integrator)`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is if a user calls a callback which\n uses `terminate!(integrator)` to halt the integration at a user-chosen stopping point.\n* Another common reason for this return code is due to implicit `terminate!` statements\n in some library callbacks. For example, `SteadyStateCallback` uses `terminate!`\n internally, so solutions which reach steady state will have a `ReturnCode.Terminated`\n state instead of a `ReturnCode.Success` state. Similarly, problems solved via\n SteadyStateDiffEq.jl will have this `ReturnCode.Terminated` state if a timestepping\n method is used to solve to steady state.\n\n## Properties\n\n* successful_retcode = true\n" Terminated) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:98 =#) "`ReturnCode.DtNaN`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was determined to be `NaN` and thus the solver could not continue.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the automatic `dt`\n selection algorithm is used but the starting derivative has a `NaN` or `Inf`\n derivative term. Double check that the `f(u0,p,t0)` term is well-defind without\n `NaN` or `Inf` values.\n* Another common reason for this return code is because of a user set `dt` which is\n calculated to be a `NaN`. If `solve(prob,alg,dt=x)`, double check that `x` is not\n `NaN`.\n\n## Properties\n\n* successful_retcode = false\n" DtNaN) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:121 =#) "`ReturnCode.MaxIters`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\niterations hit the `maxiters` either set by default or by the user in the\n`solve`/`init` command.\n\n## Note about Nonlinear Optimization\n\nIn nonlinear optimization, many solvers (such as `OptimizationOptimisers.Adam`) do not\nhave an exit criteria other than `iters == maxiters`. In this case, the solvers will\niterate until `maxiters` and exit with a `Success` return code, as that is a successful\nrun of the solver and not considered to be an error state. Solves with early termination\ncritera, such as `Optim.BFGS` exiting when the gradient is sufficiently close to zero,\nwill give `ReturnCode.MaxIters` on exits which require the maximum iteration.\n\n## Common Reasons for Seeing this Return Code\n\n* This commonly occurs in ODE solving if a non-stiff method (e.g. `Tsit5`) is used in\n an algorithm choice for a stiff ODE. It is recommended that in such cases, one tries a\n stiff ODE solver.\n* This commonly occurs in optimization and nonlinear solvers if the tolerance on `solve`\n to too low and cannot be achieved due to floating point error or the condition number\n of the solver matrix. Double check that the chosen tolerance is numerically possible.\n\n## Properties\n\n* successful_retcode = false\n" MaxIters) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:153 =#) "`ReturnCode.DtLessThanMin`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was made to be less than `dtmin`, i.e. `dt < dtmin`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the the integration\n is going unstable. As `f(u,p,t) -> infinity`, the time steps required by the solver\n to accurately handle the dynamics decreases. When it gets sufficiently small, `dtmin`,\n an exit is thrown as the solution is likely unstable. `dtmin` is also chosen to be\n around the value where floating point issues cause `t + dt == t`, and thus a `dt`\n of that size is impossible at floating point precision.\n* Another common reason for this return code is if domain constraints are set, such as\n by using `isoutofdomain`, but the domain constraint is incorrect. For example, if\n one is solving the ODE `f(u,p,t) = -u - 1`, one may think \"but I want a solution with\n `u > 0` and thus I will set `isoutofdomain(u,p,t) = u < 0`. However, the true solution\n of this ODE is not positive, and thus what will occur is that the solver will try to\n decerase `dt` until it can give an accurate solution that is positive. As this is\n impossible, it will continue to shrink the `dt` until `dt < dtmin` and then exit with\n this return code.\n\n## Properties\n\n* successful_retcode = false\n" DtLessThanMin) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:183 =#) "`ReturnCode.Unstable`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `unstable_check`\nfunction, as given by the `unstable_check` common keyword argument (or its default),\ngive a `true` at the current state.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because `u` contains a `NaN`\n or `Inf` value. The default `unstable_check` only checks for these values.\n\n## Properties\n\n* successful_retcode = false\n" Unstable) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:202 =#) "`ReturnCode.InitialFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because the initialization process failed.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the initialization\n process of a DAE solver failed to find consistent initial conditions, which can\n occur if the differentiation index of the DAE solver is too high. Most DAE solvers\n only allow for index-1 DAEs, and so an index-2 DAE will fail during this\n initialization. To solve this kind of problem, use `ModelingToolkit.jl` and its\n `structural_simplify` method to reduce the index of the DAE.\n* Another common reason for this return code is if the initial condition was not\n suitable for the numerical solve. For example, the initial point had a `NaN` or `Inf`.\n Or in optimization, this can occur if the initial point is outside of the bound\n constraints given by the user.\n\n## Properties\n\n* successful_retcode = false\n" InitialFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:227 =#) "`ReturnCode.ConvergenceFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because internal nonlinear solver iterations\nfailed to converge.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because an inappropriate\n nonlinear solver was chosen. If fixed point iteration is used on a stiff problem,\n it will be faster by avoiding the Jacobian but it will make a stiff ODE solver not\n stable for stiff problems!\n\n## Properties\n\n* successful_retcode = false\n" ConvergenceFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:247 =#) "`ReturnCode.Failure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful but no extra information is given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the solver is a wrapped\n solver (i.e. a Fortran code) which does not provide any extra information about its\n exit state. If this is from a Julia-based solver, please open an issue.\n\n## Properties\n\n* successful_retcode = false\n" Failure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:265 =#) "`ReturnCode.ExactSolutionLeft`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the left solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the left for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionLeft) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:284 =#) "`ReturnCode.ExactSolutionRight`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the right solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the right for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionRight) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:303 =#) "`ReturnCode.FloatingPointLimit`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the closest floating point value to the solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a nonlinear solver, such as Falsi,\niterating to convergence is unable to give the exact `f(x)=0` solution due to floating\npoint precision issues, and thus it gives the closest floating point value to the\ntrue solution for `x`.\n\n## Properties\n\n* successful_retcode = true\n" FloatingPointLimit) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:322 =#) "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" Infeasible) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:333 =#) "`ReturnCode.MaxTime`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\ntimer hit `maxtime` either set by default or by the user in the\n`solve`/`init` command.\n\n## Properties\n\n* successful_retcode = false\n" MaxTime))))  └─ @ /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1  Stacktrace:  [1] lower_step(iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}, mod::Module, world::UInt64; soft_scope::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:81  [2] lower_step(iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}, mod::Module, world::UInt64; soft_scope::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:72  [3] _eval(mod::Module, iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}; soft_scope::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:532  [4] eval(mod::Module, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}; macro_world::UInt64, soft_scope::Nothing, opts::@Kwargs{expr_compat_mode::Bool})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:520 [inlined]  [5] top-level scope  @ ~/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1  [6] macro expansion  @ ~/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 [inlined]  [7] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [8] top-level scope  @ ~/.julia/packages/SciMLBase/QqtZA/src/SciMLBase.jl:623  [9] include(mod::Module, _path::String)  @ Base Base.jl:325  [10] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [11] top-level scope  @ stdin:5  [12] eval(m::Module, e::Any)  @ Core boot.jl:522  [13] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [14] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [15] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [16] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 in expression starting at /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/SciMLBase.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("0bca4576-84f4-4d90-8ffe-ffa030f20462"), "SciMLBase") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207  [12] top-level scope  @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8  [13] macro expansion  @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8 [inlined]  [14] eval(m::Module, e::Any)  @ Core boot.jl:522  [15] _eval(mod::Module, iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}; soft_scope::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:547  [16] eval(mod::Module, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}; macro_world::UInt64, soft_scope::Nothing, opts::@Kwargs{expr_compat_mode::Bool})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:520 [inlined]  [17] top-level scope  @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8  [18] macro expansion  @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8 [inlined]  [19] include(mod::Module, _path::String)  @ Base Base.jl:325  [20] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [21] top-level scope  @ stdin:5  [22] eval(m::Module, e::Any)  @ Core boot.jl:522  [23] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [24] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [25] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [26] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("a75be94c-b780-496d-a8a9-0878b188d577"), "GalacticOptim") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207  [12] top-level scope  @ ~/.julia/packages/GalacticEvolutionary/CEwkW/src/GalacticEvolutionary.jl:3  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:522  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [18] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [20] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/GalacticEvolutionary/CEwkW/src/GalacticEvolutionary.jl:1 in expression starting at stdin:5 3 dependencies had output during precompilation: ┌ SciMLBase │ ERROR: LoadError: LoweringError: │ #= /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122 =# - Expected module name │ Expression: │ (escape ReturnCode) │ Containing expressions: │ (module false (escape ReturnCode) (block (primitive (<: T (curly Enum Int32)) 32) (let (= value_name_map Dict{Int32, Symbol}(3 => :DtNaN, 2 => :Terminated, 6 => :Unstable, 5 => :DtLessThanMin, 4 => :MaxIters, 1 => :Success, 13 => :Infeasible, 8 => :ConvergenceFailure, 7 => :InitialFailure, 10 => :ExactSolutionLeft, 14 => :MaxTime, 12 => :FloatingPointLimit, 11 => :ExactSolutionRight, 9 => :Failure, 0 => :Default)) (block (= (call check_valid x) (block (|| (call in x (call keys value_name_map)) (call throw (call ArgumentError (string "invalid value for Enum " (inert ReturnCode) ": " x ".")))))) (global (function (call (escape T) (:: x Integer)) (block (call check_valid x) (return (call (. Base (inert bitcast)) (escape T) (call convert Int32 x)))))) (= (call (. (. Base (inert Enums)) (inert namemap)) (:: (curly (. Base (inert Type)) (escape T)))) (block value_name_map)) (= (call (. (. Base (inert Enums)) (inert instances)) (:: (curly (. Base (inert Type)) (escape T)))) (block (tuple (escape Default) (escape Success) (escape Terminated) (escape DtNaN) (escape MaxIters) (escape DtLessThanMin) (escape Unstable) (escape InitialFailure) (escape ConvergenceFailure) (escape Failure) (escape ExactSolutionLeft) (escape ExactSolutionRight) (escape FloatingPointLimit) (escape Infeasible) (escape MaxTime)))) (= (call (. EnumX (inert symbol_map)) (:: (curly (. Base (inert Type)) (escape T)))) (block Pair{Symbol, Int32}[:Default => 0, :Success => 1, :Terminated => 2, :DtNaN => 3, :MaxIters => 4, :DtLessThanMin => 5, :Unstable => 6, :InitialFailure => 7, :ConvergenceFailure => 8, :Failure => 9, :ExactSolutionLeft => 10, :ExactSolutionRight => 11, :FloatingPointLimit => 12, :Infeasible => 13, :MaxTime => 14])))) (escape (public T Default Success Terminated DtNaN MaxIters DtLessThanMin Unstable InitialFailure ConvergenceFailure Failure ExactSolutionLeft ExactSolutionRight FloatingPointLimit Infeasible MaxTime)) (const (= (escape Default) (call (escape T) 0))) (const (= (escape Success) (call (escape T) 1))) (const (= (escape Terminated) (call (escape T) 2))) (const (= (escape DtNaN) (call (escape T) 3))) (const (= (escape MaxIters) (call (escape T) 4))) (const (= (escape DtLessThanMin) (call (escape T) 5))) (const (= (escape Unstable) (call (escape T) 6))) (const (= (escape InitialFailure) (call (escape T) 7))) (const (= (escape ConvergenceFailure) (call (escape T) 8))) (const (= (escape Failure) (call (escape T) 9))) (const (= (escape ExactSolutionLeft) (call (escape T) 10))) (const (= (escape ExactSolutionRight) (call (escape T) 11))) (const (= (escape FloatingPointLimit) (call (escape T) 12))) (const (= (escape Infeasible) (call (escape T) 13))) (const (= (escape MaxTime) (call (escape T) 14))) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:34 =#) "`ReturnCode.Default`\n\nThe default state of the solver. If this return code is given, then the solving\nprocess is either still in process or the solver library has not been setup\nwith the return code interface and thus the return code is undetermined.\n\n## Common Reasons for Seeing this Return Code\n\n* A common reason for `Default` return codes is that a solver is a non-SciML solver\n which does not fully conform to the interface. Please open an issue if this is seen\n and it will be improved.\n* Another common reason for a `Default` return code is if the solver is probed\n internally before the solving process is done, such as through the callback interface.\n Return codes are set to `Default` to start and are changed to `Success` and other\n return codes upon finishing the solving process or hitting a numerical difficulty.\n\n## Properties\n\n* successful_retcode = false\n" Default) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:57 =#) "`ReturnCode.Success`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, but no extra information about that success is given.\n\n## Common Reasons for Seeing this Return Code\n\n* This is the most common return code and most solvers will give this return code if\n the solving process went as expected without any errors or detected numerical issues.\n\n## Properties\n\n* successful_retcode = true\n" Success) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:74 =#) "`ReturnCode.Terminated`\n\nThe successful termination state of the solver. If this return code is given,\nthen the solving process was successful at terminating the solve, usually\nthrough a callback `affect!` via `terminate!(integrator)`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is if a user calls a callback which\n uses `terminate!(integrator)` to halt the integration at a user-chosen stopping point.\n* Another common reason for this return code is due to implicit `terminate!` statements\n in some library callbacks. For example, `SteadyStateCallback` uses `terminate!`\n internally, so solutions which reach steady state will have a `ReturnCode.Terminated`\n state instead of a `ReturnCode.Success` state. Similarly, problems solved via\n SteadyStateDiffEq.jl will have this `ReturnCode.Terminated` state if a timestepping\n method is used to solve to steady state.\n\n## Properties\n\n* successful_retcode = true\n" Terminated) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:98 =#) "`ReturnCode.DtNaN`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was determined to be `NaN` and thus the solver could not continue.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the automatic `dt`\n selection algorithm is used but the starting derivative has a `NaN` or `Inf`\n derivative term. Double check that the `f(u0,p,t0)` term is well-defind without\n `NaN` or `Inf` values.\n* Another common reason for this return code is because of a user set `dt` which is\n calculated to be a `NaN`. If `solve(prob,alg,dt=x)`, double check that `x` is not\n `NaN`.\n\n## Properties\n\n* successful_retcode = false\n" DtNaN) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:121 =#) "`ReturnCode.MaxIters`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\niterations hit the `maxiters` either set by default or by the user in the\n`solve`/`init` command.\n\n## Note about Nonlinear Optimization\n\nIn nonlinear optimization, many solvers (such as `OptimizationOptimisers.Adam`) do not\nhave an exit criteria other than `iters == maxiters`. In this case, the solvers will\niterate until `maxiters` and exit with a `Success` return code, as that is a successful\nrun of the solver and not considered to be an error state. Solves with early termination\ncritera, such as `Optim.BFGS` exiting when the gradient is sufficiently close to zero,\nwill give `ReturnCode.MaxIters` on exits which require the maximum iteration.\n\n## Common Reasons for Seeing this Return Code\n\n* This commonly occurs in ODE solving if a non-stiff method (e.g. `Tsit5`) is used in\n an algorithm choice for a stiff ODE. It is recommended that in such cases, one tries a\n stiff ODE solver.\n* This commonly occurs in optimization and nonlinear solvers if the tolerance on `solve`\n to too low and cannot be achieved due to floating point error or the condition number\n of the solver matrix. Double check that the chosen tolerance is numerically possible.\n\n## Properties\n\n* successful_retcode = false\n" MaxIters) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:153 =#) "`ReturnCode.DtLessThanMin`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was made to be less than `dtmin`, i.e. `dt < dtmin`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the the integration\n is going unstable. As `f(u,p,t) -> infinity`, the time steps required by the solver\n to accurately handle the dynamics decreases. When it gets sufficiently small, `dtmin`,\n an exit is thrown as the solution is likely unstable. `dtmin` is also chosen to be\n around the value where floating point issues cause `t + dt == t`, and thus a `dt`\n of that size is impossible at floating point precision.\n* Another common reason for this return code is if domain constraints are set, such as\n by using `isoutofdomain`, but the domain constraint is incorrect. For example, if\n one is solving the ODE `f(u,p,t) = -u - 1`, one may think \"but I want a solution with\n `u > 0` and thus I will set `isoutofdomain(u,p,t) = u < 0`. However, the true solution\n of this ODE is not positive, and thus what will occur is that the solver will try to\n decerase `dt` until it can give an accurate solution that is positive. As this is\n impossible, it will continue to shrink the `dt` until `dt < dtmin` and then exit with\n this return code.\n\n## Properties\n\n* successful_retcode = false\n" DtLessThanMin) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:183 =#) "`ReturnCode.Unstable`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `unstable_check`\nfunction, as given by the `unstable_check` common keyword argument (or its default),\ngive a `true` at the current state.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because `u` contains a `NaN`\n or `Inf` value. The default `unstable_check` only checks for these values.\n\n## Properties\n\n* successful_retcode = false\n" Unstable) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:202 =#) "`ReturnCode.InitialFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because the initialization process failed.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the initialization\n process of a DAE solver failed to find consistent initial conditions, which can\n occur if the differentiation index of the DAE solver is too high. Most DAE solvers\n only allow for index-1 DAEs, and so an index-2 DAE will fail during this\n initialization. To solve this kind of problem, use `ModelingToolkit.jl` and its\n `structural_simplify` method to reduce the index of the DAE.\n* Another common reason for this return code is if the initial condition was not\n suitable for the numerical solve. For example, the initial point had a `NaN` or `Inf`.\n Or in optimization, this can occur if the initial point is outside of the bound\n constraints given by the user.\n\n## Properties\n\n* successful_retcode = false\n" InitialFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:227 =#) "`ReturnCode.ConvergenceFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because internal nonlinear solver iterations\nfailed to converge.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because an inappropriate\n nonlinear solver was chosen. If fixed point iteration is used on a stiff problem,\n it will be faster by avoiding the Jacobian but it will make a stiff ODE solver not\n stable for stiff problems!\n\n## Properties\n\n* successful_retcode = false\n" ConvergenceFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:247 =#) "`ReturnCode.Failure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful but no extra information is given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the solver is a wrapped\n solver (i.e. a Fortran code) which does not provide any extra information about its\n exit state. If this is from a Julia-based solver, please open an issue.\n\n## Properties\n\n* successful_retcode = false\n" Failure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:265 =#) "`ReturnCode.ExactSolutionLeft`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the left solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the left for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionLeft) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:284 =#) "`ReturnCode.ExactSolutionRight`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the right solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the right for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionRight) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:303 =#) "`ReturnCode.FloatingPointLimit`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the closest floating point value to the solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a nonlinear solver, such as Falsi,\niterating to convergence is unable to give the exact `f(x)=0` solution due to floating\npoint precision issues, and thus it gives the closest floating point value to the\ntrue solution for `x`.\n\n## Properties\n\n* successful_retcode = true\n" FloatingPointLimit) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:322 =#) "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" Infeasible) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:333 =#) "`ReturnCode.MaxTime`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\ntimer hit `maxtime` either set by default or by the user in the\n`solve`/`init` command.\n\n## Properties\n\n* successful_retcode = false\n" MaxTime))) │ │ Detailed provenance: │ (escape ReturnCode) │ └─ (escape ReturnCode) │ └─ (escape ReturnCode) │ ├─ @ /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 =#) "`SciML.ReturnCode`\n\n`SciML.ReturnCode` is the standard return code enum interface for the SciML interface.\nReturn codes are notes given by the solvers to indicate the state of the solution, for\nexample whether it successfully solved the equations, whether it failed to solve the\nequations, and importantly, why it exited.\n\n## Using `SciML.ReturnCode`\n\n`SciML.ReturnCode` use the interface of [EnumX.jl](https://github.com/fredrikekre/EnumX.jl)\nand thus inherits all of the behaviors of being an EnumX. This includes the Enum type itself\nbeing referred to as `SciML.ReturnCode.T`, and each of the constituent enum states being\nreferred to via `getproperty`, i.e. `SciML.ReturnCode.Success`.\n\n## Note About Success Checking\n\nPrevious iterations of the interface suggested using `sol.retcode == :Success`, however,\nthat is now not advised instead should be replaced with `\nSciMLBase.successful_retcode(sol)`. The reason is that there are many different\ncodes that can be interpreted as successful, such as `ReturnCode.Terminated` which means\nsuccessfully used `terminate!(integrator)` to end an integration at a user-specified\ncondition. As such, `successful_retcode` is the most general way to query for if the solver\ndid not error.\n\n## Properties\n\n* `successful_retcode(retcode::ReturnCode.T)`: Determines whether the output enum is\n considered a success state of the solver, i.e. the solver successfully solved the\n equations. `ReturnCode.Success` is the most basic form, simply declaring that it was\n successful, but many more informative success return codes exist as well.\n" (macrocall (. EnumX (inert @enumx)) :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:33 =#) ReturnCode (block (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:34 =#) "`ReturnCode.Default`\n\nThe default state of the solver. If this return code is given, then the solving\nprocess is either still in process or the solver library has not been setup\nwith the return code interface and thus the return code is undetermined.\n\n## Common Reasons for Seeing this Return Code\n\n* A common reason for `Default` return codes is that a solver is a non-SciML solver\n which does not fully conform to the interface. Please open an issue if this is seen\n and it will be improved.\n* Another common reason for a `Default` return code is if the solver is probed\n internally before the solving process is done, such as through the callback interface.\n Return codes are set to `Default` to start and are changed to `Success` and other\n return codes upon finishing the solving process or hitting a numerical difficulty.\n\n## Properties\n\n* successful_retcode = false\n" Default) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:57 =#) "`ReturnCode.Success`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, but no extra information about that success is given.\n\n## Common Reasons for Seeing this Return Code\n\n* This is the most common return code and most solvers will give this return code if\n the solving process went as expected without any errors or detected numerical issues.\n\n## Properties\n\n* successful_retcode = true\n" Success) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:74 =#) "`ReturnCode.Terminated`\n\nThe successful termination state of the solver. If this return code is given,\nthen the solving process was successful at terminating the solve, usually\nthrough a callback `affect!` via `terminate!(integrator)`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is if a user calls a callback which\n uses `terminate!(integrator)` to halt the integration at a user-chosen stopping point.\n* Another common reason for this return code is due to implicit `terminate!` statements\n in some library callbacks. For example, `SteadyStateCallback` uses `terminate!`\n internally, so solutions which reach steady state will have a `ReturnCode.Terminated`\n state instead of a `ReturnCode.Success` state. Similarly, problems solved via\n SteadyStateDiffEq.jl will have this `ReturnCode.Terminated` state if a timestepping\n method is used to solve to steady state.\n\n## Properties\n\n* successful_retcode = true\n" Terminated) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:98 =#) "`ReturnCode.DtNaN`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was determined to be `NaN` and thus the solver could not continue.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the automatic `dt`\n selection algorithm is used but the starting derivative has a `NaN` or `Inf`\n derivative term. Double check that the `f(u0,p,t0)` term is well-defind without\n `NaN` or `Inf` values.\n* Another common reason for this return code is because of a user set `dt` which is\n calculated to be a `NaN`. If `solve(prob,alg,dt=x)`, double check that `x` is not\n `NaN`.\n\n## Properties\n\n* successful_retcode = false\n" DtNaN) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:121 =#) "`ReturnCode.MaxIters`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\niterations hit the `maxiters` either set by default or by the user in the\n`solve`/`init` command.\n\n## Note about Nonlinear Optimization\n\nIn nonlinear optimization, many solvers (such as `OptimizationOptimisers.Adam`) do not\nhave an exit criteria other than `iters == maxiters`. In this case, the solvers will\niterate until `maxiters` and exit with a `Success` return code, as that is a successful\nrun of the solver and not considered to be an error state. Solves with early termination\ncritera, such as `Optim.BFGS` exiting when the gradient is sufficiently close to zero,\nwill give `ReturnCode.MaxIters` on exits which require the maximum iteration.\n\n## Common Reasons for Seeing this Return Code\n\n* This commonly occurs in ODE solving if a non-stiff method (e.g. `Tsit5`) is used in\n an algorithm choice for a stiff ODE. It is recommended that in such cases, one tries a\n stiff ODE solver.\n* This commonly occurs in optimization and nonlinear solvers if the tolerance on `solve`\n to too low and cannot be achieved due to floating point error or the condition number\n of the solver matrix. Double check that the chosen tolerance is numerically possible.\n\n## Properties\n\n* successful_retcode = false\n" MaxIters) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:153 =#) "`ReturnCode.DtLessThanMin`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `dt` of the\nintgration was made to be less than `dtmin`, i.e. `dt < dtmin`.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the the integration\n is going unstable. As `f(u,p,t) -> infinity`, the time steps required by the solver\n to accurately handle the dynamics decreases. When it gets sufficiently small, `dtmin`,\n an exit is thrown as the solution is likely unstable. `dtmin` is also chosen to be\n around the value where floating point issues cause `t + dt == t`, and thus a `dt`\n of that size is impossible at floating point precision.\n* Another common reason for this return code is if domain constraints are set, such as\n by using `isoutofdomain`, but the domain constraint is incorrect. For example, if\n one is solving the ODE `f(u,p,t) = -u - 1`, one may think \"but I want a solution with\n `u > 0` and thus I will set `isoutofdomain(u,p,t) = u < 0`. However, the true solution\n of this ODE is not positive, and thus what will occur is that the solver will try to\n decerase `dt` until it can give an accurate solution that is positive. As this is\n impossible, it will continue to shrink the `dt` until `dt < dtmin` and then exit with\n this return code.\n\n## Properties\n\n* successful_retcode = false\n" DtLessThanMin) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:183 =#) "`ReturnCode.Unstable`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the `unstable_check`\nfunction, as given by the `unstable_check` common keyword argument (or its default),\ngive a `true` at the current state.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because `u` contains a `NaN`\n or `Inf` value. The default `unstable_check` only checks for these values.\n\n## Properties\n\n* successful_retcode = false\n" Unstable) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:202 =#) "`ReturnCode.InitialFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because the initialization process failed.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the initialization\n process of a DAE solver failed to find consistent initial conditions, which can\n occur if the differentiation index of the DAE solver is too high. Most DAE solvers\n only allow for index-1 DAEs, and so an index-2 DAE will fail during this\n initialization. To solve this kind of problem, use `ModelingToolkit.jl` and its\n `structural_simplify` method to reduce the index of the DAE.\n* Another common reason for this return code is if the initial condition was not\n suitable for the numerical solve. For example, the initial point had a `NaN` or `Inf`.\n Or in optimization, this can occur if the initial point is outside of the bound\n constraints given by the user.\n\n## Properties\n\n* successful_retcode = false\n" InitialFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:227 =#) "`ReturnCode.ConvergenceFailure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful because internal nonlinear solver iterations\nfailed to converge.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because an inappropriate\n nonlinear solver was chosen. If fixed point iteration is used on a stiff problem,\n it will be faster by avoiding the Jacobian but it will make a stiff ODE solver not\n stable for stiff problems!\n\n## Properties\n\n* successful_retcode = false\n" ConvergenceFailure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:247 =#) "`ReturnCode.Failure`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful but no extra information is given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for seeing this return code is because the solver is a wrapped\n solver (i.e. a Fortran code) which does not provide any extra information about its\n exit state. If this is from a Julia-based solver, please open an issue.\n\n## Properties\n\n* successful_retcode = false\n" Failure) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:265 =#) "`ReturnCode.ExactSolutionLeft`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the left solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the left for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionLeft) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:284 =#) "`ReturnCode.ExactSolutionRight`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the right solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a bracketing nonlinear solver,\n such as bisection, iterating to convergence is unable to give the exact `f(x)=0`\n solution due to floating point precision issues, and thus it gives the first floating\n point value to the right for `x`.\n\n## Properties\n\n* successful_retcode = true\n" ExactSolutionRight) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:303 =#) "`ReturnCode.FloatingPointLimit`\n\nThe success state of the solver. If this return code is given, then the solving\nprocess was successful, and the closest floating point value to the solution was given.\n\n## Common Reasons for Seeing this Return Code\n\n* The most common reason for this return code is via a nonlinear solver, such as Falsi,\niterating to convergence is unable to give the exact `f(x)=0` solution due to floating\npoint precision issues, and thus it gives the closest floating point value to the\ntrue solution for `x`.\n\n## Properties\n\n* successful_retcode = true\n" FloatingPointLimit) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:322 =#) "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" Infeasible) (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:333 =#) "`ReturnCode.MaxTime`\n\nA failure exit state of the solver. If this return code is given, then the\nsolving process was unsuccessful and exited early because the solver's\ntimer hit `maxtime` either set by default or by the user in the\n`solve`/`init` command.\n\n## Properties\n\n* successful_retcode = false\n" MaxTime)))) │ └─ @ /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 │ │ Stacktrace: │ [1] lower_step(iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}, mod::Module, world::UInt64; soft_scope::Nothing) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:81 │ [2] lower_step(iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}, mod::Module, world::UInt64; soft_scope::Nothing) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:72 │ [3] _eval(mod::Module, iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}; soft_scope::Nothing) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:532 │ [4] eval(mod::Module, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}; macro_world::UInt64, soft_scope::Nothing, opts::@Kwargs{expr_compat_mode::Bool}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:520 [inlined] │ [5] top-level scope │ @ ~/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 │ [6] macro expansion │ @ ~/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 [inlined] │ [7] include(mapexpr::Function, mod::Module, _path::String) │ @ Base Base.jl:326 │ [8] top-level scope │ @ ~/.julia/packages/SciMLBase/QqtZA/src/SciMLBase.jl:623 │ [9] include(mod::Module, _path::String) │ @ Base Base.jl:325 │ [10] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ @ Base loading.jl:3296 │ [11] top-level scope │ @ stdin:5 │ [12] eval(m::Module, e::Any) │ @ Core boot.jl:522 │ [13] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base loading.jl:3132 │ [14] include_string(m::Module, txt::String, fname::String) │ @ Base loading.jl:3142 [inlined] │ [15] exec_options(opts::Base.JLOptions) │ @ Base client.jl:353 │ [16] _start() │ @ Base client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/retcodes.jl:1 │ in expression starting at /home/pkgeval/.julia/packages/SciMLBase/QqtZA/src/SciMLBase.jl:1 │ in expression starting at stdin:5 └ ┌ GalacticEvolutionary │ [Output was shown above] └ ┌ GalacticOptim │ ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("0bca4576-84f4-4d90-8ffe-ffa030f20462"), "SciMLBase") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) │ Stacktrace: │ [1] error(s::String) │ @ Base error.jl:56 │ [2] __require_prelocked(pkg::Base.PkgId, env::String) │ @ Base loading.jl:2837 │ [3] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base loading.jl:2685 │ [4] macro expansion │ @ loading.jl:2599 [inlined] │ [5] macro expansion │ @ lock.jl:376 [inlined] │ [6] __require(into::Module, mod::Symbol) │ @ Base loading.jl:2563 │ [7] require(into::Module, mod::Symbol) │ @ Base loading.jl:2539 [inlined] │ [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String) │ @ Base module.jl:36 [inlined] │ [9] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base module.jl:60 │ [10] _eval_using(to::Module, path::Expr, flags::UInt8) │ @ Base module.jl:137 [inlined] │ [11] eval_using(to::Module, path::Expr) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207 │ [12] top-level scope │ @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8 │ [13] macro expansion │ @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8 [inlined] │ [14] eval(m::Module, e::Any) │ @ Core boot.jl:522 │ [15] _eval(mod::Module, iter::Base.JuliaLowering.LoweringIterator{Dict{Symbol, Dict{Int64, Any}}}; soft_scope::Nothing) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:547 │ [16] eval(mod::Module, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}; macro_world::UInt64, soft_scope::Nothing, opts::@Kwargs{expr_compat_mode::Bool}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/eval.jl:520 [inlined] │ [17] top-level scope │ @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8 │ [18] macro expansion │ @ ~/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:8 [inlined] │ [19] include(mod::Module, _path::String) │ @ Base Base.jl:325 │ [20] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ @ Base loading.jl:3296 │ [21] top-level scope │ @ stdin:5 │ [22] eval(m::Module, e::Any) │ @ Core boot.jl:522 │ [23] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base loading.jl:3132 │ [24] include_string(m::Module, txt::String, fname::String) │ @ Base loading.jl:3142 [inlined] │ [25] exec_options(opts::Base.JLOptions) │ @ Base client.jl:353 │ [26] _start() │ @ Base client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/GalacticOptim/nEQ5J/src/GalacticOptim.jl:1 │ in expression starting at stdin:5 └ ERROR: The following 3 packages failed to precompile: SciMLBase Failed to precompile SciMLBase [0bca4576-84f4-4d90-8ffe-ffa030f20462] to "/home/pkgeval/.julia/compiled/v1.14/SciMLBase/jl_weaxY9" (ProcessExited(1)). GalacticEvolutionary Failed to precompile GalacticEvolutionary [e82bed00-89d9-4bf2-a298-ae594e22fac7] to "/home/pkgeval/.julia/compiled/v1.14/GalacticEvolutionary/jl_Wejkpa" (ProcessExited(1)). GalacticOptim Failed to precompile GalacticOptim [a75be94c-b780-496d-a8a9-0878b188d577] to "/home/pkgeval/.julia/compiled/v1.14/GalacticOptim/jl_d1SnuK" (ProcessExited(1)). Loading failed after 134.95s ERROR: LoadError: failed process: Process(`/opt/julia/bin/julia -C native -J/opt/julia/lib/julia/sys.so -g1 --check-bounds=yes --inline=yes --check-bounds=yes --pkgimages=existing -e 'using GalacticEvolutionary'`, ProcessExited(1)) [1] Stacktrace: [1] pipeline_error(proc::Base.Process) @ Base process.jl:612 [inlined] [2] run(::Cmd; wait::Bool) @ Base process.jl:525 [3] run(::Cmd) @ Base process.jl:522 [4] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:197 [5] include(mod::Module, _path::String) @ Base Base.jl:325 [6] exec_options(opts::Base.JLOptions) @ Base client.jl:355 [7] _start() @ Base client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:188 PkgEval failed after 2324.55s: package fails to precompile