Package evaluation to load EpithelialDynamics1D on Julia 1.14.0-DEV.2593 (15c2b67521*) started at 2026-07-04T12:30:09.998 ################################################################################ # Set-up # Set-up completed after 0.12s ################################################################################ # Installation # Installing EpithelialDynamics1D... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [ace8a2d7] + EpithelialDynamics1D v1.8.3 Updating `~/.julia/environments/v1.14/Manifest.toml` ⌅ [47edcb42] + ADTypes v0.2.7 [7d9f7c33] + Accessors v0.1.45 ⌅ [79e6a3ab] + Adapt v3.7.2 [66dad0bd] + AliasTables v1.1.3 ⌃ [4fba245c] + ArrayInterface v7.7.1 [62783981] + BitTwiddlingConvenienceFunctions v0.1.6 ⌃ [2a0fbf3d] + CPUSummary v0.2.6 [d360d2e6] + ChainRulesCore v1.26.1 [fb6a15b2] + CloseOpenIntervals v0.1.13 [38540f10] + CommonSolve v0.2.9 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [a33af91c] + CompositionsBase v0.1.2 [187b0558] + ConstructionBase v1.6.0 [adafc99b] + CpuId v0.3.1 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 ⌅ [82cc6244] + DataInterpolations v4.8.0 ⌅ [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 ⌅ [2b5f629d] + DiffEqBase v6.130.0 ⌅ [459566f4] + DiffEqCallbacks v2.36.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.5 [4e289a0a] + EnumX v1.0.7 [ace8a2d7] + EpithelialDynamics1D v1.8.3 [e2ba6199] + ExprTools v0.1.10 ⌅ [7034ab61] + FastBroadcast v0.2.8 [1a297f60] + FillArrays v1.16.0 ⌅ [64ca27bc] + FindFirstFunctions v1.8.0 [6a86dc24] + FiniteDiff v2.31.1 ⌃ [cfdabe9e] + FiniteVolumeMethod1D v1.1.3 ⌅ [f6369f11] + ForwardDiff v0.10.39 [069b7b12] + FunctionWrappers v1.1.3 ⌅ [77dc65aa] + FunctionWrappersWrappers v0.1.3 ⌅ [d9f16b24] + Functors v0.4.12 ⌅ [46192b85] + GPUArraysCore v0.1.5 [615f187c] + IfElse v0.1.1 [3587e190] + InverseFunctions v0.1.17 [92d709cd] + IrrationalConstants v0.2.6 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.8.0 [b964fa9f] + LaTeXStrings v1.4.0 [10f19ff3] + LayoutPointers v0.1.17 ⌃ [d3d80556] + LineSearches v7.5.1 ⌅ [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [d125e4d3] + ManualMemory v0.1.8 [e1d29d7a] + Missings v1.2.0 [a903a81a] + MovingBoundaryProblems1D v1.0.3 [46d2c3a1] + MuladdMacro v0.2.6 ⌅ [d41bc354] + NLSolversBase v7.8.3 [2774e3e8] + NLsolve v4.5.1 [77ba4419] + NaNMath v1.1.4 ⌅ [bac558e1] + OrderedCollections v1.8.2 ⌅ [d96e819e] + Parameters v0.12.3 [f517fe37] + Polyester v0.7.19 [1d0040c9] + PolyesterWeave v0.2.2 ⌅ [d236fae5] + PreallocationTools v0.4.24 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 ⌅ [08abe8d2] + PrettyTables v2.4.0 [43287f4e] + PtrArrays v1.4.0 [3cdcf5f2] + RecipesBase v1.3.4 ⌅ [731186ca] + RecursiveArrayTools v2.38.10 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [7e49a35a] + RuntimeGeneratedFunctions v0.5.21 [94e857df] + SIMDTypes v0.1.0 ⌅ [0bca4576] + SciMLBase v1.98.1 ⌅ [c0aeaf25] + SciMLOperators v0.3.12 [431bcebd] + SciMLPublic v1.2.1 [efcf1570] + Setfield v1.1.2 [a2af1166] + SortingAlgorithms v1.2.3 [276daf66] + SpecialFunctions v2.8.0 ⌅ [aedffcd0] + Static v0.8.10 [0d7ed370] + StaticArrayInterface v1.10.0 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.8.0 [2913bbd2] + StatsBase v0.34.12 [7792a7ef] + StrideArraysCore v0.5.9 [892a3eda] + StringManipulation v0.4.4 ⌅ [2efcf032] + SymbolicIndexingInterface v0.2.2 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.13.0 [8290d209] + ThreadingUtilities v0.5.6 [410a4b4d] + Tricks v0.1.13 [781d530d] + TruncatedStacktraces v1.4.0 [3a884ed6] + UnPack v1.0.2 [700de1a5] + ZygoteRules v0.2.7 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.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 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.5+2 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 16.3s ################################################################################ # 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... 43.7 s ✓ FiniteDiff 78.9 s ✓ CPUSummary 76.3 s ✓ StaticArrayInterface ERROR: LoadError: Creating a new global in closed module `IrrationalConstants` (`#kw_body#_#48`) breaks incremental compilation because the side effects will not be permanent. Stacktrace:  [1] top-level scope  @ ~/.julia/packages/StatsBase/2Znv8/src/scalarstats.jl:527  [2] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [3] top-level scope  @ ~/.julia/packages/StatsBase/2Znv8/src/StatsBase.jl:251  [4] include(mod::Module, _path::String)  @ Base Base.jl:325  [5] 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:3303  [6] top-level scope  @ stdin:5  [7] eval(m::Module, e::Any)  @ Core boot.jl:522  [8] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [9] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [10] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [11] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/StatsBase/2Znv8/src/scalarstats.jl:527 in expression starting at /home/pkgeval/.julia/packages/StatsBase/2Znv8/src/StatsBase.jl:1 in expression starting at stdin:5 ✗ StatsBase 138.2 s ✓ RecursiveArrayTools ERROR: LoadError: MethodError: no method matching chunk_mode_gradient_expr(::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) The function `chunk_mode_gradient_expr` exists, but no method is defined for this combination of argument types.  Closest candidates are:  chunk_mode_gradient_expr(!Matched::Expr)  @ ForwardDiff ~/.julia/packages/ForwardDiff/X74OO/src/gradient.jl:107  Stacktrace:  [1] top-level scope  @ ~/.julia/packages/ForwardDiff/X74OO/src/gradient.jl:152  [2] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [3] top-level scope  @ ~/.julia/packages/ForwardDiff/X74OO/src/ForwardDiff.jl:28  [4] include(mod::Module, _path::String)  @ Base Base.jl:325  [5] 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:3303  [6] top-level scope  @ stdin:5  [7] eval(m::Module, e::Any)  @ Core boot.jl:522  [8] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [9] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [10] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [11] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/ForwardDiff/X74OO/src/gradient.jl:151 in expression starting at /home/pkgeval/.julia/packages/ForwardDiff/X74OO/src/ForwardDiff.jl:1 in expression starting at stdin:5 ✗ ForwardDiff 42.4 s ✓ FiniteDiff → FiniteDiffSparseArraysExt 112.6 s ✓ PolyesterWeave 99.5 s ✓ CloseOpenIntervals 44.8 s ✓ LayoutPointers ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:1 =# Core.@doc "`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" #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =# EnumX.@enumx(ReturnCode, begin │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:34 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:34 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:57 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:57 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:74 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:74 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:98 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:98 =# Core.@doc "`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\nintegration 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-defined 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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:121 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:121 =# Core.@doc "`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\ncriteria, 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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:153 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:153 =# Core.@doc "`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\nintegration 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 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 decrease `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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:183 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:183 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:202 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:202 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:227 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:227 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:247 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:247 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:265 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:265 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:284 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:284 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:303 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:303 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:322 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:322 =# Core.@doc "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" Infeasible │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:333 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:333 =# Core.@doc "`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 │ end)) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:1 =#) :: Value | │ "`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" :: Value | │ [macrocall] | │ [.] | │ EnumX :: Identifier | │ [inert] | │ @enumx :: Identifier | │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =#) :: Value | │ ReturnCode :: Identifier | │ [block] | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:34 =#) :: Value | │ "`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" :: Value | │ Default :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:57 =#) :: Value | │ "`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" :: Value | │ Success :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:74 =#) :: Value | │ "`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" :: Value | │ Terminated :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:98 =#) :: Value | │ "`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\nintegration 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-defined 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" :: Value | │ DtNaN :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:121 =#) :: Value | │ "`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\ncriteria, 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" :: Value | │ MaxIters :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:153 =#) :: Value | │ "`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\nintegration 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 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 decrease `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" :: Value | │ DtLessThanMin :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:183 =#) :: Value | │ "`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" :: Value | │ Unstable :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:202 =#) :: Value | │ "`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" :: Value | │ InitialFailure :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:227 =#) :: Value | │ "`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" :: Value | │ ConvergenceFailure :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:247 =#) :: Value | │ "`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" :: Value | │ Failure :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:265 =#) :: Value | │ "`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" :: Value | │ ExactSolutionLeft :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:284 =#) :: Value | │ "`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" :: Value | │ ExactSolutionRight :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:303 =#) :: Value | │ "`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" :: Value | │ FloatingPointLimit :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:322 =#) :: Value | │ "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" :: Value | │ Infeasible :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:333 =#) :: Value | │ "`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" :: Value | │ MaxTime :: Identifier | │ │ st1 = nothing │ file = "/home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl" │ line = 1 └ mod = SciMLBase ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122 =# - `escape` node in outer context Expression:  (escape ReturnCode) Containing expressions:  (toplevel (hygienic-scope (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/szsYq/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/szsYq/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/szsYq/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/szsYq/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\nintegration 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-defined 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/szsYq/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\ncriteria, 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/szsYq/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\nintegration 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 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 decrease `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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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))) EnumX :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =#)) (hygienic-scope (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:1 =#) SciMLBase nothing "`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" (escape ReturnCode) true) EnumX :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =#)) (hygienic-scope nothing EnumX :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =#)))  Detailed provenance:  (escape ReturnCode)  └─ @ /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122  Stacktrace:  [1] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing, slcache::Nothing, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:314  [2] mapchildren(f::Base.JuliaLowering.var"#apply_expansion_layer##0#apply_expansion_layer##1"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}}, ctx::Base.JuliaSyntax.SyntaxGraph{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:840  [3] _in_tuple(x::Base.JuliaSyntax.Kind, itr::NTuple{4, Base.JuliaSyntax.Kind}, result::Bool)  @ Base operators.jl:1417 [inlined]  [4] _in_tuple(x::Base.JuliaSyntax.Kind, itr::NTuple{4, Base.JuliaSyntax.Kind})  @ Base operators.jl:1415 [inlined]  [5] in(x::Base.JuliaSyntax.Kind, itr::NTuple{4, Base.JuliaSyntax.Kind})  @ Base operators.jl:1409 [inlined]  [6] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing, slcache::Nothing, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:341  [7] (::Base.JuliaLowering.var"#apply_expansion_layer##2#apply_expansion_layer##3"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Bool})(c::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:343 [inlined]  [8] mapchildren(f::Base.JuliaLowering.var"#apply_expansion_layer##2#apply_expansion_layer##3"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Bool}, ctx::Base.JuliaSyntax.SyntaxGraph{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:839  [9] getproperty(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, name::Symbol)  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:227 [inlined]  [10] is_leaf(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:304 [inlined]  [11] setattr(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, name::Symbol, val::Base.JuliaSyntax.SyntaxContext)  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:293 [inlined]  [12] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing, slcache::Nothing, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:309  [13] (::Base.JuliaLowering.var"#apply_expansion_layer##2#apply_expansion_layer##3"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Bool})(c::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:343 [inlined]  [14] mapchildren(f::Base.JuliaLowering.var"#apply_expansion_layer##2#apply_expansion_layer##3"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Bool}, ctx::Base.JuliaSyntax.SyntaxGraph{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:839  [15] getproperty(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, name::Symbol)  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:227 [inlined]  [16] is_leaf(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:304 [inlined]  [17] setattr(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, name::Symbol, val::Base.JuliaSyntax.SyntaxContext)  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:293 [inlined]  [18] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing, slcache::Nothing, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:309  [19] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:297 [inlined]  [20] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Base.JuliaSyntax.ScopeLayer, slcache::Dict{Base.JuliaSyntax.ScopeLayer, Bool}, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:319  [21] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Base.JuliaSyntax.ScopeLayer)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:297  [22] expand_macro(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:272  [23] expand_forms_1(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:358  [24] expand_forms_1(mod::Module, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, expr_compat_mode::Bool, world::UInt64, recursive::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:408  [25] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:29  [26] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [27] top-level scope  @ ~/.julia/packages/SciMLBase/szsYq/src/SciMLBase.jl:674  [28] include(mod::Module, _path::String)  @ Base Base.jl:325  [29] 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:3303  [30] top-level scope  @ stdin:5  [31] eval(m::Module, e::Any)  @ Core boot.jl:522  [32] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [33] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [34] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [35] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:1 in expression starting at /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/SciMLBase.jl:1 in expression starting at stdin:5 ✗ SciMLBase ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("f6369f11-7733-5829-9624-2563aa707210"), "ForwardDiff") 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:130  [12] top-level scope  @ ~/.julia/packages/PreallocationTools/7dIFh/src/PreallocationTools.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:3303  [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/PreallocationTools/7dIFh/src/PreallocationTools.jl:1 in expression starting at stdin:5 ✗ PreallocationTools ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("f6369f11-7733-5829-9624-2563aa707210"), "ForwardDiff") 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:130  [12] top-level scope  @ ~/.julia/packages/DataInterpolations/KPLsY/src/DataInterpolations.jl:20  [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:3303  [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/DataInterpolations/KPLsY/src/DataInterpolations.jl:1 in expression starting at stdin:5 ✗ DataInterpolations ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("f6369f11-7733-5829-9624-2563aa707210"), "ForwardDiff") 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:130  [12] top-level scope  @ ~/.julia/packages/NLSolversBase/kavn7/src/NLSolversBase.jl:5  [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:3303  [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/NLSolversBase/kavn7/src/NLSolversBase.jl:3 in expression starting at stdin:5 ✗ NLSolversBase 406.0 s ✓ StrideArraysCore 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:130  [12] top-level scope  @ ~/.julia/packages/FiniteVolumeMethod1D/XeBhH/src/FiniteVolumeMethod1D.jl:4  [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:3303  [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/FiniteVolumeMethod1D/XeBhH/src/FiniteVolumeMethod1D.jl:1 in expression starting at stdin:5 ✗ FiniteVolumeMethod1D 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:130  [12] top-level scope  @ ~/.julia/packages/MovingBoundaryProblems1D/sqOPO/src/MovingBoundaryProblems1D.jl:4  [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:3303  [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/MovingBoundaryProblems1D/sqOPO/src/MovingBoundaryProblems1D.jl:1 in expression starting at stdin:5 ✗ MovingBoundaryProblems1D ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("82cc6244-b520-54b8-b5a6-8a565e85f1d0"), "DataInterpolations") 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_import(::Bool, ::Module, ::Expr, ::Expr, ::Vararg{Expr})  @ Base module.jl:101  [11] eval_import(::Bool, ::Module, ::Expr, ::Expr, ::Vararg{Expr})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:118  [12] top-level scope  @ ~/.julia/packages/DataInterpolations/KPLsY/ext/DataInterpolationsChainRulesCoreExt.jl:4  [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:3303  [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/DataInterpolations/KPLsY/ext/DataInterpolationsChainRulesCoreExt.jl:1 in expression starting at stdin:5 ✗ DataInterpolations → DataInterpolationsChainRulesCoreExt ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("d41bc354-129a-5804-8e4c-c37616107c6c"), "NLSolversBase") 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_import(::Bool, ::Module, ::Expr, ::Expr, ::Vararg{Expr})  @ Base module.jl:101  [11] eval_import(::Bool, ::Module, ::Expr, ::Expr, ::Vararg{Expr})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:118  [12] top-level scope  @ ~/.julia/packages/LineSearches/2BCHN/src/LineSearches.jl:6  [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:3303  [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/LineSearches/2BCHN/src/LineSearches.jl:1 in expression starting at stdin:5 ✗ LineSearches 100.3 s ✓ Polyester ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("d41bc354-129a-5804-8e4c-c37616107c6c"), "NLSolversBase") 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:130  [12] top-level scope  @ ~/.julia/packages/NLsolve/gJL1I/src/NLsolve.jl:6  [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:3303  [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/NLsolve/gJL1I/src/NLsolve.jl:3 in expression starting at stdin:5 ✗ NLsolve 85.0 s ✓ FastBroadcast ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("f6369f11-7733-5829-9624-2563aa707210"), "ForwardDiff") 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:130  [12] top-level scope  @ none:1  [13] eval(m::Module, e::Any)  @ Core boot.jl:522  [14] recompile_invalidations(__module__::Module, expr::Any)  @ PrecompileTools ~/.julia/packages/PrecompileTools/QUxvR/src/invalidations.jl:21  [15] top-level scope  @ ~/.julia/packages/DiffEqBase/s433k/src/DiffEqBase.jl:12  [16] include(mod::Module, _path::String)  @ Base Base.jl:325  [17] 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:3303  [18] top-level scope  @ stdin:5  [19] eval(m::Module, e::Any)  @ Core boot.jl:522  [20] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [21] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [22] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [23] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/DiffEqBase/s433k/src/DiffEqBase.jl:1 in expression starting at stdin:5 ✗ DiffEqBase ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2b5f629d-d688-5b77-993f-72d75c75574e"), "DiffEqBase") 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:130  [12] top-level scope  @ ~/.julia/packages/DiffEqCallbacks/uVI0B/src/DiffEqCallbacks.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:3303  [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/DiffEqCallbacks/uVI0B/src/DiffEqCallbacks.jl:1 in expression starting at stdin:5 ✗ DiffEqCallbacks 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:130  [12] top-level scope  @ ~/.julia/packages/EpithelialDynamics1D/L1Pzd/src/EpithelialDynamics1D.jl:4  [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:3303  [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/EpithelialDynamics1D/L1Pzd/src/EpithelialDynamics1D.jl:1 in expression starting at stdin:5 ✗ EpithelialDynamics1D 11 dependencies successfully precompiled in 2093 seconds. 107 already precompiled. Precompilation completed after 2120.2s ################################################################################ # Loading # Loading EpithelialDynamics1D... ERROR: LoadError: Creating a new global in closed module `IrrationalConstants` (`#kw_body#_#48`) breaks incremental compilation because the side effects will not be permanent. Stacktrace:  [1] top-level scope  @ ~/.julia/packages/StatsBase/2Znv8/src/scalarstats.jl:527  [2] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [3] top-level scope  @ ~/.julia/packages/StatsBase/2Znv8/src/StatsBase.jl:251  [4] include(mod::Module, _path::String)  @ Base Base.jl:325  [5] 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:3303  [6] top-level scope  @ stdin:5  [7] eval(m::Module, e::Any)  @ Core boot.jl:522  [8] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [9] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [10] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [11] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/StatsBase/2Znv8/src/scalarstats.jl:527 in expression starting at /home/pkgeval/.julia/packages/StatsBase/2Znv8/src/StatsBase.jl:1 in expression starting at stdin:5 ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:1 =# Core.@doc "`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" #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =# EnumX.@enumx(ReturnCode, begin │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:34 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:34 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:57 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:57 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:74 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:74 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:98 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:98 =# Core.@doc "`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\nintegration 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-defined 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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:121 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:121 =# Core.@doc "`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\ncriteria, 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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:153 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:153 =# Core.@doc "`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\nintegration 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 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 decrease `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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:183 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:183 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:202 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:202 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:227 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:227 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:247 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:247 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:265 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:265 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:284 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:284 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:303 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:303 =# Core.@doc "`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 │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:322 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:322 =# Core.@doc "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" Infeasible │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:333 =# │ #= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:333 =# Core.@doc "`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 │ end)) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:1 =#) :: Value | │ "`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" :: Value | │ [macrocall] | │ [.] | │ EnumX :: Identifier | │ [inert] | │ @enumx :: Identifier | │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =#) :: Value | │ ReturnCode :: Identifier | │ [block] | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:34 =#) :: Value | │ "`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" :: Value | │ Default :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:57 =#) :: Value | │ "`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" :: Value | │ Success :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:74 =#) :: Value | │ "`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" :: Value | │ Terminated :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:98 =#) :: Value | │ "`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\nintegration 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-defined 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" :: Value | │ DtNaN :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:121 =#) :: Value | │ "`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\ncriteria, 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" :: Value | │ MaxIters :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:153 =#) :: Value | │ "`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\nintegration 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 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 decrease `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" :: Value | │ DtLessThanMin :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:183 =#) :: Value | │ "`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" :: Value | │ Unstable :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:202 =#) :: Value | │ "`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" :: Value | │ InitialFailure :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:227 =#) :: Value | │ "`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" :: Value | │ ConvergenceFailure :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:247 =#) :: Value | │ "`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" :: Value | │ Failure :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:265 =#) :: Value | │ "`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" :: Value | │ ExactSolutionLeft :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:284 =#) :: Value | │ "`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" :: Value | │ ExactSolutionRight :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:303 =#) :: Value | │ "`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" :: Value | │ FloatingPointLimit :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:322 =#) :: Value | │ "`ReturnCode.Infeasible`\n\nThe optimization problem was proven to be infeasible by the solver.\n\n## Properties\n\n* successful_retcode = false\n" :: Value | │ Infeasible :: Identifier | │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:333 =#) :: Value | │ "`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" :: Value | │ MaxTime :: Identifier | │ │ st1 = nothing │ file = "/home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl" │ line = 1 └ mod = SciMLBase ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122 =# - `escape` node in outer context Expression:  (escape ReturnCode) Containing expressions:  (toplevel (hygienic-scope (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/szsYq/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/szsYq/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/szsYq/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/szsYq/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\nintegration 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-defined 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/szsYq/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\ncriteria, 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/szsYq/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\nintegration 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 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 decrease `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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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/szsYq/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))) EnumX :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =#)) (hygienic-scope (macrocall @doc :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:1 =#) SciMLBase nothing "`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" (escape ReturnCode) true) EnumX :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =#)) (hygienic-scope nothing EnumX :(#= /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:33 =#)))  Detailed provenance:  (escape ReturnCode)  └─ @ /home/pkgeval/.julia/packages/EnumX/CGSQY/src/EnumX.jl:122  Stacktrace:  [1] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing, slcache::Nothing, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:314  [2] mapchildren(f::Base.JuliaLowering.var"#apply_expansion_layer##0#apply_expansion_layer##1"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}}, ctx::Base.JuliaSyntax.SyntaxGraph{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:840  [3] _in_tuple(x::Base.JuliaSyntax.Kind, itr::NTuple{4, Base.JuliaSyntax.Kind}, result::Bool)  @ Base operators.jl:1417 [inlined]  [4] _in_tuple(x::Base.JuliaSyntax.Kind, itr::NTuple{4, Base.JuliaSyntax.Kind})  @ Base operators.jl:1415 [inlined]  [5] in(x::Base.JuliaSyntax.Kind, itr::NTuple{4, Base.JuliaSyntax.Kind})  @ Base operators.jl:1409 [inlined]  [6] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing, slcache::Nothing, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:341  [7] (::Base.JuliaLowering.var"#apply_expansion_layer##2#apply_expansion_layer##3"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Bool})(c::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:343 [inlined]  [8] mapchildren(f::Base.JuliaLowering.var"#apply_expansion_layer##2#apply_expansion_layer##3"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Bool}, ctx::Base.JuliaSyntax.SyntaxGraph{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:839  [9] getproperty(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, name::Symbol)  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:227 [inlined]  [10] is_leaf(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:304 [inlined]  [11] setattr(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, name::Symbol, val::Base.JuliaSyntax.SyntaxContext)  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:293 [inlined]  [12] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing, slcache::Nothing, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:309  [13] (::Base.JuliaLowering.var"#apply_expansion_layer##2#apply_expansion_layer##3"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Bool})(c::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:343 [inlined]  [14] mapchildren(f::Base.JuliaLowering.var"#apply_expansion_layer##2#apply_expansion_layer##3"{Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, Base.JuliaSyntax.SyntaxContext, Nothing, Nothing, Bool}, ctx::Base.JuliaSyntax.SyntaxGraph{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:839  [15] getproperty(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, name::Symbol)  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:227 [inlined]  [16] is_leaf(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:304 [inlined]  [17] setattr(ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, name::Symbol, val::Base.JuliaSyntax.SyntaxContext)  @ Base.JuliaSyntax /source/usr/share/julia/JuliaSyntax/src/porcelain/syntax_graph.jl:293 [inlined]  [18] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing, slcache::Nothing, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:309  [19] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:297 [inlined]  [20] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Base.JuliaSyntax.ScopeLayer, slcache::Dict{Base.JuliaSyntax.ScopeLayer, Bool}, absorb_esc::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:319  [21] apply_expansion_layer(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, sc_in::Base.JuliaSyntax.SyntaxContext, lstack::Base.JuliaSyntax.ScopeLayer)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:297  [22] expand_macro(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:272  [23] expand_forms_1(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:358  [24] expand_forms_1(mod::Module, st::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, expr_compat_mode::Bool, world::UInt64, recursive::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/macro_expansion.jl:408  [25] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:29  [26] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [27] top-level scope  @ ~/.julia/packages/SciMLBase/szsYq/src/SciMLBase.jl:674  [28] include(mod::Module, _path::String)  @ Base Base.jl:325  [29] 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:3303  [30] top-level scope  @ stdin:5  [31] eval(m::Module, e::Any)  @ Core boot.jl:522  [32] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [33] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [34] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [35] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/retcodes.jl:1 in expression starting at /home/pkgeval/.julia/packages/SciMLBase/szsYq/src/SciMLBase.jl:1 in expression starting at stdin:5 ERROR: LoadError: ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ======================================================================================  cmd: /opt/julia/bin/julia 95 running 1 of 1  signal (10): User defined signal 1 _ZN12_GLOBAL__N_117ScheduleDAGRRList19ReleasePredecessorsEPN4llvm5SUnitE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN12_GLOBAL__N_117ScheduleDAGRRList8ScheduleEv at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm16SelectionDAGISel17CodeGenAndEmitDAGEv at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm16SelectionDAGISel20SelectAllBasicBlocksERKNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm16SelectionDAGISel20runOnMachineFunctionERNS_15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm22SelectionDAGISelLegacy20runOnMachineFunctionERNS_15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm19MachineFunctionPass13runOnFunctionERNS_8FunctionE.part.0 at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm13FPPassManager13runOnFunctionERNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm13FPPassManager11runOnModuleERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm6legacy15PassManagerImpl3runERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) operator() at /source/src/jitlayers.cpp:1388:23 compileModule at /source/src/jitlayers.cpp:2368:79 materialize at /source/src/jitlayers.cpp:877:36 _ZN4llvm3orc19MaterializationTask3runEv at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) dispatch at /source/src/julia-task-dispatcher.h:361:11 _ZN4llvm3orc16ExecutionSession22dispatchOutstandingMUsEv at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm3orc16ExecutionSession17OL_completeLookupESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EESt10shared_ptrINS0_23AsynchronousSymbolQueryEESt8functionIFvRKNS_8DenseMapIPNS0_8JITDylibENS_8DenseSetINS0_15SymbolStringPtrENS_12DenseMapInfoISF_vEEEENSG_ISD_vEENS_6detail12DenseMapPairISD_SI_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm3orc25InProgressFullLookupState8completeESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm3orc16ExecutionSession19OL_applyQueryPhase1ESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EENS_5ErrorE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm3orc16ExecutionSession6lookupENS0_10LookupKindERKSt6vectorISt4pairIPNS0_8JITDylibENS0_19JITDylibLookupFlagsEESaIS8_EENS0_15SymbolLookupSetENS0_11SymbolStateENS_15unique_functionIFvNS_8ExpectedINS_8DenseMapINS0_15SymbolStringPtrENS0_17ExecutorSymbolDefENS_12DenseMapInfoISI_vEENS_6detail12DenseMapPairISI_SJ_EEEEEEEEESt8functionIFvRKNSH_IS6_NS_8DenseSetISI_SL_EENSK_IS6_vEENSN_IS6_SV_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) publishCIs at /source/src/jitlayers.cpp:2059:14 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:511:39 jl_compile_method_very_internal at /source/src/gf.c:3927:27 _jl_invoke at /source/src/gf.c:4337:16 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 #showerror#855 at ./errorshow.jl:117:0 (pc: 15) showerror at ./errorshow.jl:115:0 (pc: 5) unknown function (ip: 0x7a1015a921bf) at (unknown file) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 #showerror#855 at ./errorshow.jl:117:0 (pc: 15) showerror at ./errorshow.jl:115:0 (pc: 5) unknown function (ip: 0x7a1015a921bf) at (unknown file) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 #showerror#855 at ./errorshow.jl:117:0 (pc: 15) showerror at ./errorshow.jl:115:0 (pc: 5) unknown function (ip: 0x7a1015a921bf) at (unknown file) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 show_exception_stack at ./errorshow.jl:1331:0 (pc: 95) display_error at ./client.jl:121:0 (pc: 12) unknown function (ip: 0x7a1015a86326) at (unknown file) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 display_error at ./client.jl:124:0 (pc: 2) jfptr_display_error_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] jl_f_invokelatest at /source/src/builtins.c:933:23 exec_options at ./client.jl:358:0 (pc: 823) _start at ./client.jl:596:0 (pc: 295) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] true_main at /source/src/jlapi.c:985:29 jl_repl_entrypoint at /source/src/jlapi.c:1152:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x7a1040824249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file)   ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ==============================================================  MethodError: no method matching ┌ Error: Profile printing listener crashed │ exception = │ This interactive function requires a stdlib to be loaded, and package code should instead use it directly from that stdlib. │ Stacktrace: │ [1] error(s::String) │ @ Base error.jl:56 │ [2] require_stdlib(package_uuidkey::Base.PkgId, ext::Nothing, from::Module) │ @ Base loading.jl:3024 │ [3] require_stdlib(package_uuidkey::Base.PkgId) │ @ Base loading.jl:3020 [inlined] │ [4] macro expansion │ @ some.jl:157 [inlined] │ [5] profile_printing_listener(cond::Base.AsyncCondition) │ @ Base Base.jl:357 │ [6] (::Base.var"#start_profile_listener##0#start_profile_listener##1"{Base.AsyncCondition})() │ @ Base Base.jl:376 └ @ Base Base.jl:367 chunk_mode_gradient_expr(::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) The function `chunk_mode_gradient_expr` exists, but no method is defined for this combination of argument types.  Closest candidates are:  chunk_mode_gradient_expr(!Matched::Expr)  @ ForwardDiff ~/.julia/packages/ForwardDiff/X74OO/src/gradient.jl:107  Stacktrace:  [1] top-level scope  @ ~/.julia/packages/ForwardDiff/X74OO/src/gradient.jl:152  [2] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [3] top-level scope  @ ~/.julia/packages/ForwardDiff/X74OO/src/ForwardDiff.jl:28  [4] include(mod::Module, _path::String)  @ Base Base.jl:325  [5] 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:3303  [6] top-level scope  @ stdin:5  [7] eval(m::Module, e::Any)  @ Core boot.jl:522  [8] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [9] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [10] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [11] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/ForwardDiff/X74OO/src/gradient.jl:151 in expression starting at /home/pkgeval/.julia/packages/ForwardDiff/X74OO/src/ForwardDiff.jl:1 in expression starting at stdin:5 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 86 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007d0bcd2660e0 Total snapshots: 347. Utilization: 0% ╎347 @Base/task.jl:1170 wait_forever() 346╎ 347 @Base/task.jl:1248 wait() ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007948f9123940 Total snapshots: 354. Utilization: 0% ╎354 @Base/task.jl:1170 wait_forever() 353╎ 354 @Base/task.jl:1248 wait() [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:188 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) [86] signal 15: Terminated in expression starting at none:1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) Allocations: 15002357 (Pool: 15001677; Big: 680); GC: 13 start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) Allocations: 2178518 (Pool: 2178463; Big: 55); GC: 4 val already in a list atexit hook threw an error: ErrorException("schedule: Task not runnable") error at ./error.jl:56:0 (pc: 6) #schedule#625 at ./task.jl:1053:0 (pc: 71) schedule at ./task.jl:1045:0 [inlined] uv_writecb_task at ./stream.jl:1198:0 (pc: 11) jlcapi_uv_writecb_task_512.1 at /opt/julia/lib/julia/sys.so (unknown line) uv__write_callbacks at /workspace/srcdir/libuv/src/unix/stream.c:926:0 uv__stream_io at /workspace/srcdir/libuv/src/unix/stream.c:1227:0 uv__run_pending at /workspace/srcdir/libuv/src/unix/core.c:824:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:420:0 ijl_process_events at /source/src/jl_uv.c:397:21 process_events at ./libuv.jl:133:0 [inlined] wait at ./task.jl:1235:0 (pc: 15) uv_write at ./stream.jl:1079:0 (pc: 11) unsafe_write at ./stream.jl:1152:0 (pc: 55) write at ./strings/io.jl:237:0 [inlined] print at ./strings/io.jl:239:0 (pc: 5) jfptr_print_129.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 showerror at ./errorshow.jl:164:0 (pc: 2) unknown function (ip: 0x7d0bc8d22616) at (unknown file) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 _atexit at ./initdefs.jl:544:0 (pc: 211) jfptr__atexit_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] ijl_atexit_hook at /source/src/init.c:264:17 jl_exit_thread0_cb at /source/src/signals-unix.c:678:5 jl_fake_signal_return at /opt/julia/bin/../lib/julia/libjulia-internal.so.1.14 (unknown line) epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276:19 PkgEval terminated after 2732.85s: test duration exceeded the time limit