Package evaluation to load MultistartOptimization on Julia 1.14.0-DEV.2309 (6e1a27e459*) started at 2026-06-06T04:16:48.952 ################################################################################ # Set-up # Set-up completed after 0.13s ################################################################################ # Installation # Installing MultistartOptimization... Resolving package versions... Installed DelimitedFiles ───────── v1.9.1 Installed DocStringExtensions ──── v0.9.5 Installed ArgCheck ─────────────── v2.5.0 Installed MultistartOptimization ─ v0.3.1 Installed Sobol ────────────────── v1.5.0 Updating `~/.julia/environments/v1.14/Project.toml` [3933049c] + MultistartOptimization v0.3.1 Updating `~/.julia/environments/v1.14/Manifest.toml` [dce04be8] + ArgCheck v2.5.0 [8bb1440f] + DelimitedFiles v1.9.1 [ffbed154] + DocStringExtensions v0.9.5 [3933049c] + MultistartOptimization v0.3.1 [ed01d8cd] + Sobol v1.5.0 [a63ad114] + Mmap v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 Installation completed after 9.43s ################################################################################ # 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... 0.8 s ✓ ArgCheck 1.1 s ✓ DocStringExtensions 0.9 s ✓ DelimitedFiles 22.2 s ✓ Sobol ┌ Info: JuliaLowering threw given input: │ code = │ :(struct MinimizationProblem{F, T <: AbstractVector} │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:8 =# │ "The function to be minimized." │ objective::F │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:10 =# │ "Lower bounds (a vector of real numbers)." │ lower_bounds::T │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:12 =# │ "Upper bounds (a vector of real numbers)." │ upper_bounds::T │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =# │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =# @doc "$(SIGNATURES)\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n" function MinimizationProblem(objective::F, lower_bounds::T, upper_bounds::T) where {F, T} │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:26 =# │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =# │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =# @argcheck all(lower_bounds .< upper_bounds) │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:28 =# │ new{F, T}(objective, lower_bounds, upper_bounds) │ end │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ [struct] │ │ false :: Value │ │ [curly] │ │ MinimizationProblem :: Identifier │ │ F :: Identifier │ │ [<:] │ │ T :: Identifier │ │ AbstractVector :: Identifier │ │ [block] │ │ "The function to be minimized." :: Value │ │ [::] │ │ objective :: Identifier │ │ F :: Identifier │ │ "Lower bounds (a vector of real numbers)." :: Value │ │ [::] │ │ lower_bounds :: Identifier │ │ T :: Identifier │ │ "Upper bounds (a vector of real numbers)." :: Value │ │ [::] │ │ upper_bounds :: Identifier │ │ T :: Identifier │ │ [macrocall] │ │ @doc :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =#) :: Value │ │ [string] │ │ SIGNATURES :: Identifier │ │ "\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n" :: Value │ │ [function] │ │ [where] │ │ [call] │ │ MinimizationProblem :: Identifier │ │ [::] │ │ objective :: Identifier │ │ F :: Identifier │ │ [::] │ │ lower_bounds :: Identifier │ │ T :: Identifier │ │ [::] │ │ upper_bounds :: Identifier │ │ T :: Identifier │ │ F :: Identifier │ │ T :: Identifier │ │ [block] │ │ [macrocall] │ │ @argcheck :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =#) :: Value │ │ [call] │ │ all :: Identifier │ │ [call] │ │ .< :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ [call] │ │ [curly] │ │ new :: Identifier │ │ F :: Identifier │ │ T :: Identifier │ │ objective :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ [struct] │ │ false :: Value │ │ [curly] │ │ MinimizationProblem :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractVector :: Identifier │ scope_layer=1 │ [block] │ │ "The function to be minimized." :: Value │ │ [::] │ │ objective :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ "Lower bounds (a vector of real numbers)." :: Value │ │ [::] │ │ lower_bounds :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ "Upper bounds (a vector of real numbers)." :: Value │ │ [::] │ │ upper_bounds :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [call] │ │ MinimizationProblem :: Identifier │ scope_layer=1 │ [::] │ │ objective :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ [::] │ │ lower_bounds :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ upper_bounds :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [meta] │ │ begin_optional :: Identifier │ scope_layer=1 │ ArgCheck.LabelArgCheck() :: Value │ macro_source=58 │ [block] │ │ [=] │ │ #1###calle#1038 :: Identifier │ scope_layer=1 │ all :: Identifier │ scope_layer=1 │ [=] │ │ #2###arg#1037 :: Identifier │ scope_layer=1 │ [call] │ │ .< :: Identifier │ scope_layer=1 │ lower_bounds :: Identifier │ scope_layer=1 │ upper_bounds :: Identifier │ scope_layer=1 │ [if] │ │ [call] │ │ #1###calle#1038 :: Identifier │ scope_layer=1 │ #2###arg#1037 :: Identifier │ scope_layer=1 │ [block] │ │ nothing :: Identifier │ mod,scope_layer=1 │ [block] │ │ [call] │ │ throw_check_error :: Identifier │ mod,scope_layer=1 │ [call] │ │ CallErrorInfo :: Identifier │ mod,scope_layer=1 │ [inert] │ │ [call] │ │ all :: Identifier │ │ [call] │ │ .< :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ ArgCheck.ArgCheckFlavor() :: Value │ macro_source=58 │ [inert] │ │ Any[:all, :(lower_bounds .< upper_bounds)] :: Value │ │ [vect] │ │ #1###calle#1038 :: Identifier │ scope_layer=1 │ #2###arg#1037 :: Identifier │ scope_layer=1 │ [tuple] │ macro_source=58 │ [meta] │ │ end_optional :: Identifier │ scope_layer=1 │ ArgCheck.LabelArgCheck() :: Value │ macro_source=58 │ [call] │ │ [curly] │ │ new :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ objective :: Identifier │ scope_layer=1 │ lower_bounds :: Identifier │ scope_layer=1 │ upper_bounds :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=58 │ MultistartOptimization :: Value │ macro_source=58 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=58 │ MultistartOptimization :: Value │ │ [inert] │ jl_source=L65 │ MinimizationProblem :: Identifier │ │ [call] │ │ Base.Docs.docstr :: Value │ macro_source=58 │ [call] │ │ Core.svec :: Value │ macro_source=58 │ [call] │ │ DocStringExtensions.interpolation :: Value │ macro_source=58 │ SIGNATURES :: Identifier │ scope_layer=1 │ [inert] │ │ [function] │ │ [where] │ │ [call] │ │ MinimizationProblem :: Identifier │ │ [::] │ │ objective :: Identifier │ │ F :: Identifier │ │ [::] │ │ lower_bounds :: Identifier │ │ T :: Identifier │ │ [::] │ │ upper_bounds :: Identifier │ │ T :: Identifier │ │ F :: Identifier │ │ T :: Identifier │ │ [block] │ │ [macrocall] │ │ @argcheck :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =#) :: Value │ │ [call] │ │ all :: Identifier │ │ [call] │ │ .< :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ [call] │ │ [curly] │ │ new :: Identifier │ │ F :: Identifier │ │ T :: Identifier │ │ objective :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ "\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n" :: Value │ macro_source=58 │ [call] │ macro_source=58 │ Dict{Symbol, Any} :: Value │ macro_source=58 │ :path => "/home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl" :: Value │ macro_source=58 │ :linenumber => 14 :: Value │ macro_source=58 │ :module => MultistartOptimization :: Value │ macro_source=58 │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl" │ line = 7 └ mod = MultistartOptimization ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =# - assignment syntax in structure fields is reserved Expression:  (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (meta :begin_optional ArgCheck.LabelArgCheck()) (= #1###calle#1038 all) (= #2###arg#1037 (dotcall < lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple))))) (meta :end_optional ArgCheck.LabelArgCheck()) (call (curly new F T) objective lower_bounds upper_bounds)))) Containing expressions:  (block "The function to be minimized." (:: objective F) "Lower bounds (a vector of real numbers)." (:: lower_bounds T) "Upper bounds (a vector of real numbers)." (:: upper_bounds T) (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (meta :begin_optional ArgCheck.LabelArgCheck()) (= #1###calle#1038 all) (= #2###arg#1037 (dotcall < lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple))))) (meta :end_optional ArgCheck.LabelArgCheck()) (call (curly new F T) objective lower_bounds upper_bounds)))) (call Base.Docs.doc! MultistartOptimization (call Base.Docs.Binding MultistartOptimization :MinimizationProblem) (call Base.Docs.docstr (call Core.svec (call DocStringExtensions.interpolation SIGNATURES (inert (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (macrocall @argcheck :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =#) (call all (call .< lower_bounds upper_bounds))) (call (curly new F T) objective lower_bounds upper_bounds))))) "\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n") (call Dict{Symbol, Any} :path => "/home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl" :linenumber => 14 :module => MultistartOptimization)) (where (where (curly Union (curly Tuple F T T) (curly Tuple T) (curly Tuple F)) (<: T Any)) (<: F Any))) val)  Detailed provenance:  (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (meta :begin_optional ArgCheck.LabelArgCheck()) (= #1###calle#1038 all) (= #2###arg#1037 (dotcall < lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple))))) (meta :end_optional ArgCheck.LabelArgCheck()) (call (curly new F T) objective lower_bounds upper_bounds))))  └─ (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (block (meta :begin_optional ArgCheck.LabelArgCheck()) (block (= #1###calle#1038 all) (= #2###arg#1037 (dotcall < lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple)))))) (meta :end_optional ArgCheck.LabelArgCheck())) (call (curly new F T) objective lower_bounds upper_bounds))))  └─ (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (block (meta begin_optional ArgCheck.LabelArgCheck()) (block (= #1###calle#1038 all) (= #2###arg#1037 (call .< lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple)))))) (meta end_optional ArgCheck.LabelArgCheck())) (call (curly new F T) objective lower_bounds upper_bounds))))  └─ (= val (escape (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (block (meta begin_optional ArgCheck.LabelArgCheck()) (block (= #1###calle#1038 all) (= #2###arg#1037 (call .< lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple)))))) (meta end_optional ArgCheck.LabelArgCheck())) (call (curly new F T) objective lower_bounds upper_bounds)))))  ├─ @ /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =#) (string SIGNATURES "\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n") (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (macrocall @argcheck :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =#) (call all (call .< lower_bounds upper_bounds))) (call (curly new F T) objective lower_bounds upper_bounds))))  └─ @ /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14  Stacktrace:  [1] _collect_struct_fields(ctx::Base.JuliaLowering.DesugaringContext{Dict{Symbol, Dict{Int64, Any}}}, field_names::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, field_types::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, field_attrs::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, field_docs::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, inner_defs::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, exs::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, SubArray{Int64, 1, Vector{Int64}, Tuple{UnitRange{Int64}}, true}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3166  [2] expand_struct_def(ctx::Base.JuliaLowering.DesugaringContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, docs::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3736  [3] expand_forms_2(ctx::Base.JuliaLowering.DesugaringContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, docs::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:4317  [4] expand_forms_2(ctx::Base.JuliaLowering.DesugaringContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:4133 [inlined]  [5] expand_forms_2(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:4450  [6] 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:30  [7] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:327  [8] top-level scope  @ ~/.julia/packages/MultistartOptimization/7t00L/src/MultistartOptimization.jl:10  [9] include(mod::Module, _path::String)  @ Base Base.jl:326  [10] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [11] top-level scope  @ stdin:5  [12] eval(m::Module, e::Any)  @ Core boot.jl:521  [13] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [14] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [15] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [16] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:7 in expression starting at /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/MultistartOptimization.jl:1 in expression starting at stdin:5 ✗ MultistartOptimization 4 dependencies successfully precompiled in 50 seconds. 1 already precompiled. Precompilation completed after 71.7s ################################################################################ # Loading # Loading MultistartOptimization... ┌ Info: JuliaLowering threw given input: │ code = │ :(struct MinimizationProblem{F, T <: AbstractVector} │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:8 =# │ "The function to be minimized." │ objective::F │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:10 =# │ "Lower bounds (a vector of real numbers)." │ lower_bounds::T │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:12 =# │ "Upper bounds (a vector of real numbers)." │ upper_bounds::T │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =# │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =# @doc "$(SIGNATURES)\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n" function MinimizationProblem(objective::F, lower_bounds::T, upper_bounds::T) where {F, T} │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:26 =# │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =# │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =# @argcheck all(lower_bounds .< upper_bounds) │ #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:28 =# │ new{F, T}(objective, lower_bounds, upper_bounds) │ end │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ [struct] │ │ false :: Value │ │ [curly] │ │ MinimizationProblem :: Identifier │ │ F :: Identifier │ │ [<:] │ │ T :: Identifier │ │ AbstractVector :: Identifier │ │ [block] │ │ "The function to be minimized." :: Value │ │ [::] │ │ objective :: Identifier │ │ F :: Identifier │ │ "Lower bounds (a vector of real numbers)." :: Value │ │ [::] │ │ lower_bounds :: Identifier │ │ T :: Identifier │ │ "Upper bounds (a vector of real numbers)." :: Value │ │ [::] │ │ upper_bounds :: Identifier │ │ T :: Identifier │ │ [macrocall] │ │ @doc :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =#) :: Value │ │ [string] │ │ SIGNATURES :: Identifier │ │ "\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n" :: Value │ │ [function] │ │ [where] │ │ [call] │ │ MinimizationProblem :: Identifier │ │ [::] │ │ objective :: Identifier │ │ F :: Identifier │ │ [::] │ │ lower_bounds :: Identifier │ │ T :: Identifier │ │ [::] │ │ upper_bounds :: Identifier │ │ T :: Identifier │ │ F :: Identifier │ │ T :: Identifier │ │ [block] │ │ [macrocall] │ │ @argcheck :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =#) :: Value │ │ [call] │ │ all :: Identifier │ │ [call] │ │ .< :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ [call] │ │ [curly] │ │ new :: Identifier │ │ F :: Identifier │ │ T :: Identifier │ │ objective :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ [struct] │ │ false :: Value │ │ [curly] │ │ MinimizationProblem :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractVector :: Identifier │ scope_layer=1 │ [block] │ │ "The function to be minimized." :: Value │ │ [::] │ │ objective :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ "Lower bounds (a vector of real numbers)." :: Value │ │ [::] │ │ lower_bounds :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ "Upper bounds (a vector of real numbers)." :: Value │ │ [::] │ │ upper_bounds :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [call] │ │ MinimizationProblem :: Identifier │ scope_layer=1 │ [::] │ │ objective :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ [::] │ │ lower_bounds :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ upper_bounds :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [meta] │ │ begin_optional :: Identifier │ scope_layer=1 │ ArgCheck.LabelArgCheck() :: Value │ macro_source=58 │ [block] │ │ [=] │ │ #1###calle#1038 :: Identifier │ scope_layer=1 │ all :: Identifier │ scope_layer=1 │ [=] │ │ #2###arg#1037 :: Identifier │ scope_layer=1 │ [call] │ │ .< :: Identifier │ scope_layer=1 │ lower_bounds :: Identifier │ scope_layer=1 │ upper_bounds :: Identifier │ scope_layer=1 │ [if] │ │ [call] │ │ #1###calle#1038 :: Identifier │ scope_layer=1 │ #2###arg#1037 :: Identifier │ scope_layer=1 │ [block] │ │ nothing :: Identifier │ mod,scope_layer=1 │ [block] │ │ [call] │ │ throw_check_error :: Identifier │ mod,scope_layer=1 │ [call] │ │ CallErrorInfo :: Identifier │ mod,scope_layer=1 │ [inert] │ │ [call] │ │ all :: Identifier │ │ [call] │ │ .< :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ ArgCheck.ArgCheckFlavor() :: Value │ macro_source=58 │ [inert] │ │ Any[:all, :(lower_bounds .< upper_bounds)] :: Value │ │ [vect] │ │ #1###calle#1038 :: Identifier │ scope_layer=1 │ #2###arg#1037 :: Identifier │ scope_layer=1 │ [tuple] │ macro_source=58 │ [meta] │ │ end_optional :: Identifier │ scope_layer=1 │ ArgCheck.LabelArgCheck() :: Value │ macro_source=58 │ [call] │ │ [curly] │ │ new :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ objective :: Identifier │ scope_layer=1 │ lower_bounds :: Identifier │ scope_layer=1 │ upper_bounds :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=58 │ MultistartOptimization :: Value │ macro_source=58 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=58 │ MultistartOptimization :: Value │ │ [inert] │ jl_source=L65 │ MinimizationProblem :: Identifier │ │ [call] │ │ Base.Docs.docstr :: Value │ macro_source=58 │ [call] │ │ Core.svec :: Value │ macro_source=58 │ [call] │ │ DocStringExtensions.interpolation :: Value │ macro_source=58 │ SIGNATURES :: Identifier │ scope_layer=1 │ [inert] │ │ [function] │ │ [where] │ │ [call] │ │ MinimizationProblem :: Identifier │ │ [::] │ │ objective :: Identifier │ │ F :: Identifier │ │ [::] │ │ lower_bounds :: Identifier │ │ T :: Identifier │ │ [::] │ │ upper_bounds :: Identifier │ │ T :: Identifier │ │ F :: Identifier │ │ T :: Identifier │ │ [block] │ │ [macrocall] │ │ @argcheck :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =#) :: Value │ │ [call] │ │ all :: Identifier │ │ [call] │ │ .< :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ [call] │ │ [curly] │ │ new :: Identifier │ │ F :: Identifier │ │ T :: Identifier │ │ objective :: Identifier │ │ lower_bounds :: Identifier │ │ upper_bounds :: Identifier │ │ "\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n" :: Value │ macro_source=58 │ [call] │ macro_source=58 │ Dict{Symbol, Any} :: Value │ macro_source=58 │ :path => "/home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl" :: Value │ macro_source=58 │ :linenumber => 14 :: Value │ macro_source=58 │ :module => MultistartOptimization :: Value │ macro_source=58 │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ F :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl" │ line = 7 └ mod = MultistartOptimization ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =# - assignment syntax in structure fields is reserved Expression:  (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (meta :begin_optional ArgCheck.LabelArgCheck()) (= #1###calle#1038 all) (= #2###arg#1037 (dotcall < lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple))))) (meta :end_optional ArgCheck.LabelArgCheck()) (call (curly new F T) objective lower_bounds upper_bounds)))) Containing expressions:  (block "The function to be minimized." (:: objective F) "Lower bounds (a vector of real numbers)." (:: lower_bounds T) "Upper bounds (a vector of real numbers)." (:: upper_bounds T) (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (meta :begin_optional ArgCheck.LabelArgCheck()) (= #1###calle#1038 all) (= #2###arg#1037 (dotcall < lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple))))) (meta :end_optional ArgCheck.LabelArgCheck()) (call (curly new F T) objective lower_bounds upper_bounds)))) (call Base.Docs.doc! MultistartOptimization (call Base.Docs.Binding MultistartOptimization :MinimizationProblem) (call Base.Docs.docstr (call Core.svec (call DocStringExtensions.interpolation SIGNATURES (inert (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (macrocall @argcheck :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =#) (call all (call .< lower_bounds upper_bounds))) (call (curly new F T) objective lower_bounds upper_bounds))))) "\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n") (call Dict{Symbol, Any} :path => "/home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl" :linenumber => 14 :module => MultistartOptimization)) (where (where (curly Union (curly Tuple F T T) (curly Tuple T) (curly Tuple F)) (<: T Any)) (<: F Any))) val)  Detailed provenance:  (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (meta :begin_optional ArgCheck.LabelArgCheck()) (= #1###calle#1038 all) (= #2###arg#1037 (dotcall < lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple))))) (meta :end_optional ArgCheck.LabelArgCheck()) (call (curly new F T) objective lower_bounds upper_bounds))))  └─ (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (block (meta :begin_optional ArgCheck.LabelArgCheck()) (block (= #1###calle#1038 all) (= #2###arg#1037 (dotcall < lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple)))))) (meta :end_optional ArgCheck.LabelArgCheck())) (call (curly new F T) objective lower_bounds upper_bounds))))  └─ (= val (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (block (meta begin_optional ArgCheck.LabelArgCheck()) (block (= #1###calle#1038 all) (= #2###arg#1037 (call .< lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple)))))) (meta end_optional ArgCheck.LabelArgCheck())) (call (curly new F T) objective lower_bounds upper_bounds))))  └─ (= val (escape (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (block (meta begin_optional ArgCheck.LabelArgCheck()) (block (= #1###calle#1038 all) (= #2###arg#1037 (call .< lower_bounds upper_bounds)) (if (call #1###calle#1038 #2###arg#1037) (block nothing) (block (call throw_check_error (call CallErrorInfo (inert (call all (call .< lower_bounds upper_bounds))) ArgCheck.ArgCheckFlavor() (inert Any[:all, :(lower_bounds .< upper_bounds)]) (vect #1###calle#1038 #2###arg#1037) (tuple)))))) (meta end_optional ArgCheck.LabelArgCheck())) (call (curly new F T) objective lower_bounds upper_bounds)))))  ├─ @ /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14 =#) (string SIGNATURES "\n\nDefine a minimization problem.\n\n- `objective` is a function that maps `ℝᴺ` vectors to real numbers. It should accept all\n `AbstractVector`s of length `N`.\n- `lower_bounds` and `upper_bounds` define the bounds, and their lengths implicitly\n define the dimension `N`.\n\nThe fields of the result should be accessible with the names above.\n") (function (where (call MinimizationProblem (:: objective F) (:: lower_bounds T) (:: upper_bounds T)) F T) (block (macrocall @argcheck :(#= /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:27 =#) (call all (call .< lower_bounds upper_bounds))) (call (curly new F T) objective lower_bounds upper_bounds))))  └─ @ /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:14  Stacktrace:  [1] _collect_struct_fields(ctx::Base.JuliaLowering.DesugaringContext{Dict{Symbol, Dict{Int64, Any}}}, field_names::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, field_types::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, field_attrs::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, field_docs::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, inner_defs::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, exs::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, SubArray{Int64, 1, Vector{Int64}, Tuple{UnitRange{Int64}}, true}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3166  [2] expand_struct_def(ctx::Base.JuliaLowering.DesugaringContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, docs::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3736  [3] expand_forms_2(ctx::Base.JuliaLowering.DesugaringContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, docs::Nothing)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:4317  [4] expand_forms_2(ctx::Base.JuliaLowering.DesugaringContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:4133 [inlined]  [5] expand_forms_2(ctx::Base.JuliaLowering.MacroExpansionContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/desugaring.jl:4450  [6] 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:30  [7] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:327  [8] top-level scope  @ ~/.julia/packages/MultistartOptimization/7t00L/src/MultistartOptimization.jl:10  [9] include(mod::Module, _path::String)  @ Base Base.jl:326  [10] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [11] top-level scope  @ stdin:5  [12] eval(m::Module, e::Any)  @ Core boot.jl:521  [13] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [14] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [15] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [16] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/generic_api.jl:7 in expression starting at /home/pkgeval/.julia/packages/MultistartOptimization/7t00L/src/MultistartOptimization.jl:1 in expression starting at stdin:5 1 dependency had output during precompilation: ┌ MultistartOptimization │ [Output was shown above] └ ERROR: The following 1 package failed to precompile: MultistartOptimization Failed to precompile MultistartOptimization [3933049c-43be-478e-a8bb-6e0f7fd53575] to "/home/pkgeval/.julia/compiled/v1.14/MultistartOptimization/jl_wM1dS0" (ProcessExited(1)). Loading failed after 34.94s ERROR: LoadError: failed process: Process(`/opt/julia/bin/julia -C native -J/opt/julia/lib/julia/sys.so -g1 --check-bounds=yes --inline=yes --check-bounds=yes --pkgimages=existing -e 'using MultistartOptimization'`, ProcessExited(1)) [1] Stacktrace: [1] pipeline_error(proc::Base.Process) @ Base process.jl:612 [inlined] [2] run(::Cmd; wait::Bool) @ Base process.jl:525 [3] run(::Cmd) @ Base process.jl:522 [4] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:197 [5] include(mod::Module, _path::String) @ Base Base.jl:326 [6] exec_options(opts::Base.JLOptions) @ Base client.jl:355 [7] _start() @ Base client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:188 PkgEval failed after 138.25s: package fails to precompile