Package evaluation to test NetcdfIO on Julia 1.14.0-DEV.2226 (797a5ef2b0*) started at 2026-05-24T16:33:00.134 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 17.26s ################################################################################ # Installation # Installing NetcdfIO... Resolving package versions... Installed Bzip2_jll ─────────────────── v1.0.9+0 Installed DiskArrays ────────────────── v0.4.19 Installed Lz4_jll ───────────────────── v1.10.1+0 Installed DataStructures ────────────── v0.19.4 Installed CFTime ────────────────────── v0.2.9 Installed NetCDF_jll ────────────────── v401.900.300+0 Installed InlineStrings ─────────────── v1.4.5 Installed ConstructionBase ──────────── v1.6.0 Installed NetcdfIO ──────────────────── v0.3.0 Installed MicrosoftMPI_jll ──────────── v10.1.4+3 (no artifacts on this platform) Installed libaec_jll ────────────────── v1.1.6+0 Installed OrderedCollections ────────── v1.8.1 Installed MPICH_jll ─────────────────── v4.3.2+0 Installed IteratorInterfaceExtensions ─ v1.0.0 Installed DataAPI ───────────────────── v1.16.0 Installed InvertedIndices ───────────── v1.3.1 Installed Compat ────────────────────── v4.18.1 Installed DataValueInterfaces ───────── v1.0.0 Installed Statistics ────────────────── v1.11.1 Installed libzip_jll ────────────────── v1.11.3+0 Installed SentinelArrays ────────────── v1.4.10 Installed Xorg_libpciaccess_jll ─────── v0.19.0+0 Installed OffsetArrays ──────────────── v1.17.0 Installed PrecompileTools ───────────── v1.3.4 Installed Blosc_jll ─────────────────── v1.21.7+0 Installed HDF5_jll ──────────────────── v1.14.6+0 Installed StringManipulation ────────── v0.4.4 Installed Tables ────────────────────── v1.12.1 Installed OpenMPI_jll ───────────────── v5.0.11+0 Installed Hwloc_jll ─────────────────── v2.13.0+1 Installed XML2_jll ──────────────────── v2.13.9+0 Installed Missings ──────────────────── v1.2.0 Installed Reexport ──────────────────── v1.2.2 Installed Preferences ───────────────── v1.5.2 Installed DataFrames ────────────────── v1.8.2 Installed PrettyTables ──────────────── v3.3.2 Installed PooledArrays ──────────────── v1.4.3 Installed TableTraits ───────────────── v1.0.1 Installed LaTeXStrings ──────────────── v1.4.0 Installed Libiconv_jll ──────────────── v1.18.0+0 Installed MPIPreferences ────────────── v0.1.12 Installed XZ_jll ────────────────────── v5.8.3+0 Installed JLLWrappers ───────────────── v1.8.0 Installed SortingAlgorithms ─────────── v1.2.2 Installed CommonDataModel ───────────── v0.4.3 Installed Crayons ───────────────────── v4.1.1 Installed DocStringExtensions ───────── v0.9.5 Installed LRUCache ──────────────────── v1.6.2 Installed MPItrampoline_jll ─────────── v5.5.6+0 Installing 13 artifacts Installed artifact Bzip2 503.5 KiB Installed artifact Xorg_libpciaccess 26.2 KiB Installed artifact libzip 177.6 KiB Installed artifact Blosc 44.2 KiB Installed artifact libaec 50.0 KiB Installed artifact Lz4 239.7 KiB Installed artifact NetCDF 936.0 KiB Installed artifact Libiconv 1.9 MiB Installed artifact MPICH 3.3 MiB Installed artifact Hwloc 3.5 MiB Installed artifact XML2 2.5 MiB Installed artifact XZ 1.6 MiB Installed artifact HDF5 5.7 MiB Updating `~/.julia/environments/v1.14/Project.toml` [6a36f34d] + NetcdfIO v0.3.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [179af706] + CFTime v0.2.9 [1fbeeb36] + CommonDataModel v0.4.3 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [a93c6f00] + DataFrames v1.8.2 [864edb3b] + DataStructures v0.19.4 [e2d170a0] + DataValueInterfaces v1.0.0 [3c3547ce] + DiskArrays v0.4.19 [ffbed154] + DocStringExtensions v0.9.5 [842dd82b] + InlineStrings v1.4.5 [41ab1584] + InvertedIndices v1.3.1 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.8.0 [8ac3fa9e] + LRUCache v1.6.2 [b964fa9f] + LaTeXStrings v1.4.0 [3da0fdf6] + MPIPreferences v0.1.12 [e1d29d7a] + Missings v1.2.0 [6a36f34d] + NetcdfIO v0.3.0 [6fe1bfb0] + OffsetArrays v1.17.0 [bac558e1] + OrderedCollections v1.8.1 [2dfb63ee] + PooledArrays v1.4.3 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [08abe8d2] + PrettyTables v3.3.2 [189a3867] + Reexport v1.2.2 [91c51154] + SentinelArrays v1.4.10 [a2af1166] + SortingAlgorithms v1.2.2 [10745b16] + Statistics v1.11.1 [892a3eda] + StringManipulation v0.4.4 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [0b7ba130] + Blosc_jll v1.21.7+0 [6e34b625] + Bzip2_jll v1.0.9+0 ⌅ [0234f1f7] + HDF5_jll v1.14.6+0 [e33a78d0] + Hwloc_jll v2.13.0+1 [94ce4f54] + Libiconv_jll v1.18.0+0 [5ced341a] + Lz4_jll v1.10.1+0 ⌅ [7cb0a576] + MPICH_jll v4.3.2+0 [f1f71cc9] + MPItrampoline_jll v5.5.6+0 [9237b28f] + MicrosoftMPI_jll v10.1.4+3 ⌅ [7243133f] + NetCDF_jll v401.900.300+0 [fe0851c0] + OpenMPI_jll v5.0.11+0 ⌅ [02c8fc9c] + XML2_jll v2.13.9+0 [ffd25f8a] + XZ_jll v5.8.3+0 [a65dc6b1] + Xorg_libpciaccess_jll v0.19.0+0 [477f73a3] + libaec_jll v1.1.6+0 [337d8026] + libzip_jll v1.11.3+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [4af54fe1] + LazyArtifacts v1.11.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.14.0 [de0858da] + Printf v1.11.0 [3fa0cd96] + REPL v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.1+0 [deac9b47] + LibCURL_jll v8.20.0+1 [e37daf67] + LibGit2_jll v1.9.3+0 [29816b5a] + LibSSH2_jll v1.11.101+0 [14a3606d] + MozillaCACerts_jll v2026.5.14 [4536629a] + OpenBLAS_jll v0.3.33+0 [458c3c95] + OpenSSL_jll v3.5.6+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [83775a58] + Zlib_jll v1.3.2+0 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.69.0+0 [3f19e933] + p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 17.4s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 5.3 s ✓ TestEnv 1 dependency successfully precompiled in 6 seconds. 27 already precompiled. Precompiling package dependencies... Precompiling project... 298.3 s ✓ InlineStrings 0.5 s ✓ Reexport 1.0 s ✓ Statistics 0.9 s ✓ DataAPI 1.0 s ✓ ConstructionBase 0.5 s ✓ DataValueInterfaces 147.4 s ✓ OrderedCollections 37.9 s ✓ InvertedIndices 1.1 s ✓ DocStringExtensions 76.0 s ✓ OffsetArrays 95.0 s ✓ LRUCache 0.5 s ✓ IteratorInterfaceExtensions 41.6 s ✓ LaTeXStrings 1.8 s ✓ Crayons 152.6 s ✓ SentinelArrays 48.7 s ✓ CFTime 1.4 s ✓ Compat 2.3 s ✓ Preferences 63.0 s ✓ Missings ┌ 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 0.5 s ✓ ConstructionBase → ConstructionBaseLinearAlgebraExt 179.4 s ✓ DataStructures 36.8 s ✓ LRUCache → SerializationExt 0.5 s ✓ TableTraits 0.6 s ✓ Compat → CompatLinearAlgebraExt 2.6 s ✓ JLLWrappers 2.7 s ✓ MPIPreferences 2.4 s ✓ PrecompileTools 204.8 s ✓ DiskArrays 38.1 s ✓ SortingAlgorithms 162.3 s ✓ Tables 3.0 s ✓ libaec_jll 3.0 s ✓ Xorg_libpciaccess_jll 3.0 s ✓ Bzip2_jll 2.9 s ✓ Libiconv_jll 3.0 s ✓ Lz4_jll 3.0 s ✓ XZ_jll 2.3 s ✓ MicrosoftMPI_jll 5.9 s ✓ MPItrampoline_jll 70.4 s ✓ StringManipulation 283.4 s ✓ CommonDataModel 3.0 s ✓ XML2_jll 3.1 s ✓ Blosc_jll 4.1 s ✓ libzip_jll 189.1 s ✓ PrettyTables 3.0 s ✓ Hwloc_jll ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base ./module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207  [12] top-level scope  @ ~/.julia/packages/DataFrames/0Y1g5/src/DataFrames.jl:3  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 ✗ DataFrames 6.1 s ✓ MPICH_jll 5.4 s ✓ OpenMPI_jll 6.8 s ✓ HDF5_jll 6.7 s ✓ NetCDF_jll ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("a93c6f00-e57d-5684-b7b6-d8193f3e46c0"), "DataFrames") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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:195  [12] top-level scope  @ ~/.julia/packages/NetcdfIO/IwPHn/src/NetcdfIO.jl:10  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/NetcdfIO/IwPHn/src/NetcdfIO.jl:1 in expression starting at stdin:5 ✗ NetcdfIO 49 dependencies successfully precompiled in 2259 seconds. 35 already precompiled. Precompilation completed after 2296.79s ################################################################################ # Testing # Testing NetcdfIO Status `/tmp/jl_qf89n0/Project.toml` [1fbeeb36] CommonDataModel v0.4.3 [a93c6f00] DataFrames v1.8.2 [3c3547ce] DiskArrays v0.4.19 [ffbed154] DocStringExtensions v0.9.5 [6a36f34d] NetcdfIO v0.3.0 [bac558e1] OrderedCollections v1.8.1 ⌅ [7243133f] NetCDF_jll v401.900.300+0 [8dfed614] Test v1.11.0 Status `/tmp/jl_qf89n0/Manifest.toml` [179af706] CFTime v0.2.9 [1fbeeb36] CommonDataModel v0.4.3 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [a8cc5b0e] Crayons v4.1.1 [9a962f9c] DataAPI v1.16.0 [a93c6f00] DataFrames v1.8.2 [864edb3b] DataStructures v0.19.4 [e2d170a0] DataValueInterfaces v1.0.0 [3c3547ce] DiskArrays v0.4.19 [ffbed154] DocStringExtensions v0.9.5 [842dd82b] InlineStrings v1.4.5 [41ab1584] InvertedIndices v1.3.1 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [8ac3fa9e] LRUCache v1.6.2 [b964fa9f] LaTeXStrings v1.4.0 [3da0fdf6] MPIPreferences v0.1.12 [e1d29d7a] Missings v1.2.0 [6a36f34d] NetcdfIO v0.3.0 [6fe1bfb0] OffsetArrays v1.17.0 [bac558e1] OrderedCollections v1.8.1 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [08abe8d2] PrettyTables v3.3.2 [189a3867] Reexport v1.2.2 [91c51154] SentinelArrays v1.4.10 [a2af1166] SortingAlgorithms v1.2.2 [10745b16] Statistics v1.11.1 [892a3eda] StringManipulation v0.4.4 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [0b7ba130] Blosc_jll v1.21.7+0 [6e34b625] Bzip2_jll v1.0.9+0 ⌅ [0234f1f7] HDF5_jll v1.14.6+0 [e33a78d0] Hwloc_jll v2.13.0+1 [94ce4f54] Libiconv_jll v1.18.0+0 [5ced341a] Lz4_jll v1.10.1+0 ⌅ [7cb0a576] MPICH_jll v4.3.2+0 [f1f71cc9] MPItrampoline_jll v5.5.6+0 [9237b28f] MicrosoftMPI_jll v10.1.4+3 ⌅ [7243133f] NetCDF_jll v401.900.300+0 [fe0851c0] OpenMPI_jll v5.0.11+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [ffd25f8a] XZ_jll v5.8.3+0 [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0 [477f73a3] libaec_jll v1.1.6+0 [337d8026] libzip_jll v1.11.3+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [3fa0cd96] REPL v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.1+0 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.3+0 [29816b5a] LibSSH2_jll v1.11.101+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [458c3c95] OpenSSL_jll v3.5.6+0 [efcefdf7] PCRE2_jll v10.47.0+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. 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 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base ./module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207  [12] top-level scope  @ ~/.julia/packages/DataFrames/0Y1g5/src/DataFrames.jl:3  [13] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ 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 └ ┌ DataFrames │ [Output was shown above] └ ERROR: LoadError: The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_bDkHjC" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_blgUSB" (ProcessExited(1)). in expression starting at /home/pkgeval/.julia/packages/NetcdfIO/IwPHn/test/runtests.jl:1 Testing failed after 35.17s ERROR: LoadError: Package NetcdfIO 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 2396.39s: package fails to precompile