Package evaluation to test PooledArrays on Julia 1.14.0-DEV.2226 (797a5ef2b0*) started at 2026-05-23T17:00:10.534 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 17.21s ################################################################################ # Installation # Installing PooledArrays... Resolving package versions... Installed DataAPI ────── v1.16.0 Installed PooledArrays ─ v1.4.3 Updating `~/.julia/environments/v1.14/Project.toml` [2dfb63ee] + PooledArrays v1.4.3 Updating `~/.julia/environments/v1.14/Manifest.toml` [9a962f9c] + DataAPI v1.16.0 [2dfb63ee] + PooledArrays v1.4.3 [9fa8497b] + Future v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 Installation completed after 1.25s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 5.8 s ✓ TestEnv 1 dependency successfully precompiled in 6 seconds. 27 already precompiled. Precompiling package dependencies... Precompiling project... 77.7 s ✓ OffsetArrays 1.0 s ✓ DataAPI ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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__ │ [macrocall] │ │ @doc :: Identifier │ mod │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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 │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1106  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1007  [7] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1163  [8] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1253  [9] 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:33  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ✗ PooledArrays 2 dependencies successfully precompiled in 84 seconds. 9 already precompiled. Precompilation completed after 116.02s ################################################################################ # Testing # Testing PooledArrays Status `/tmp/jl_W84DRS/Project.toml` [9a962f9c] DataAPI v1.16.0 [6fe1bfb0] OffsetArrays v1.17.0 [2dfb63ee] PooledArrays v1.4.3 [9fa8497b] Future v1.11.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_W84DRS/Manifest.toml` [9a962f9c] DataAPI v1.16.0 [6fe1bfb0] OffsetArrays v1.17.0 [2dfb63ee] PooledArrays v1.4.3 [2a0f44e3] Base64 v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [f489334b] StyledStrings v1.13.0 [8dfed614] Test v1.11.0 Testing Running tests... ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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__ │ [macrocall] │ │ @doc :: Identifier │ mod │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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 │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1106  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1007  [7] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1163  [8] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1253  [9] 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:33  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 1 dependency had output during precompilation: ┌ PooledArrays │ [Output was shown above] └ ERROR: LoadError: The following 1 package failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_cqcypr" (ProcessExited(1)). in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/test/runtests.jl:2 Testing failed after 119.8s ERROR: LoadError: Package PooledArrays errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:3247 [3] Cmd(cmd::Cmd) @ Base /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:3110 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:587 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:172 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [7] test @ /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [inlined] [8] test(pkg::String; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 [10] include(mod::Module, _path::String) @ Base ./Base.jl:326 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:355 [12] _start() @ Base ./client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 274.54s: package fails to precompile