Package evaluation to test NearestNeighborDescent on Julia 1.14.0-DEV.2373 (cf67ecc88f*) started at 2026-06-13T07:48:55.585 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.48s ################################################################################ # Installation # Installing NearestNeighborDescent... Resolving package versions... Installed Reexport ─────────────── v1.2.2 Installed SimpleTraits ─────────── v0.9.6 Installed StatsAPI ─────────────── v1.8.0 Installed Statistics ───────────── v1.11.1 Installed DataStructures ───────── v0.19.5 Installed MacroTools ───────────── v0.5.16 Installed Preferences ──────────── v1.5.2 Installed ArnoldiMethod ────────── v0.4.0 Installed NearestNeighborDescent ─ v0.3.8 Installed PrecompileTools ──────── v1.3.4 Installed StaticArraysCore ─────── v1.4.4 Installed Inflate ──────────────── v0.1.5 Installed Distances ────────────── v0.10.12 Installed OrderedCollections ───── v1.8.2 Installed StaticArrays ─────────── v1.9.18 Installed Graphs ───────────────── v1.14.0 Updating `~/.julia/environments/v1.14/Project.toml` [dd2c4c9e] + NearestNeighborDescent v0.3.8 Updating `~/.julia/environments/v1.14/Manifest.toml` [ec485272] + ArnoldiMethod v0.4.0 [864edb3b] + DataStructures v0.19.5 [b4f34e82] + Distances v0.10.12 [86223c79] + Graphs v1.14.0 [d25df0c9] + Inflate v0.1.5 [1914dd2f] + MacroTools v0.5.16 [dd2c4c9e] + NearestNeighborDescent v0.3.8 ⌅ [bac558e1] + OrderedCollections v1.8.2 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [189a3867] + Reexport v1.2.2 [699a6c99] + SimpleTraits v0.9.6 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.8.0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.2+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [8e850b90] + libblastrampoline_jll v5.15.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 2.29s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 6.1 s ✓ TestEnv 1 dependency successfully precompiled in 6 seconds. 27 already precompiled. Precompiling package dependencies... Precompiling project... 3.9 s ✓ MacroTools 0.9 s ✓ StaticArraysCore 0.6 s ✓ StatsAPI 0.9 s ✓ Inflate 0.6 s ✓ Reexport 1.1 s ✓ Statistics 129.2 s ✓ OrderedCollections 2.3 s ✓ Preferences 2.9 s ✓ SimpleTraits 36.2 s ✓ Statistics → SparseArraysExt 1.8 s ✓ Distances 145.0 s ✓ DataStructures 2.6 s ✓ PrecompileTools 34.7 s ✓ Distances → DistancesSparseArraysExt 292.9 s ✓ StaticArrays 34.8 s ✓ StaticArrays → StaticArraysStatisticsExt 36.5 s ✓ ArnoldiMethod ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =# Core.@doc " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" function karger_cut_cost(g::AbstractGraph{T}, cut::Vector{<:Integer}) where T <: Integer │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:48 =# │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ return count((e::Edge{T}->begin │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ cut[src(e)] != cut[dst(e)] │ end), edges(g)) │ 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/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) :: Value │ │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value │ │ [function] │ │ [where] │ │ [call] │ │ karger_cut_cost :: Identifier │ │ [::] │ │ g :: Identifier │ │ [curly] │ │ AbstractGraph :: Identifier │ │ T :: Identifier │ │ [::] │ │ cut :: Identifier │ │ [curly] │ │ Vector :: Identifier │ │ [<:] │ │ Integer :: Identifier │ │ [<:] │ │ T :: Identifier │ │ Integer :: Identifier │ │ [block] │ │ [return] │ │ [call] │ │ count :: Identifier │ │ [->] │ │ [::] │ │ e :: Identifier │ │ [curly] │ │ Edge :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ != :: Identifier │ │ [ref] │ │ cut :: Identifier │ │ [call] │ │ src :: Identifier │ │ e :: Identifier │ │ [ref] │ │ cut :: Identifier │ │ [call] │ │ dst :: Identifier │ │ e :: Identifier │ │ [call] │ │ edges :: Identifier │ │ g :: 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] │ │ karger_cut_cost :: Identifier │ scope_layer=1 │ [::] │ │ g :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractGraph :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ cut :: Identifier │ scope_layer=1 │ [curly] │ │ Vector :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [block] │ │ [return] │ │ [call] │ │ count :: Identifier │ scope_layer=1 │ [->] │ │ [::] │ │ e :: Identifier │ scope_layer=1 │ [curly] │ │ Edge :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ != :: Identifier │ scope_layer=1 │ [ref] │ │ cut :: Identifier │ scope_layer=1 │ [call] │ │ src :: Identifier │ scope_layer=1 │ e :: Identifier │ scope_layer=1 │ [ref] │ │ cut :: Identifier │ scope_layer=1 │ [call] │ │ dst :: Identifier │ scope_layer=1 │ e :: Identifier │ scope_layer=1 │ [call] │ │ edges :: Identifier │ scope_layer=1 │ g :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=48 │ Graphs :: Value │ macro_source=48 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=48 │ Graphs :: Value │ │ [inert] │ jl_source=L65 │ karger_cut_cost :: Identifier │ │ [call] │ macro_source=48 │ Base.Docs.docstr :: Value │ macro_source=48 │ [call] │ macro_source=48 │ Core.svec :: Value │ macro_source=48 │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value │ macro_source=48 │ [call] │ macro_source=48 │ Dict{Symbol, Any} :: Value │ macro_source=48 │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value │ macro_source=48 │ :linenumber => 42 :: Value │ macro_source=48 │ :module => Graphs :: Value │ macro_source=48 │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractGraph :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [curly] │ │ Vector :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" │ line = 42 └ mod = Graphs ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# - Found unexpected binding of kind static_parameter Expression:  #₁₆/T Containing expressions:  (= #₃₆/T #₁₆/T)  (call core.svec (call core.svec #₂₉/#karger_cut_cost##->###0 (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0)  (call core.svec (call core.svec (function_type #₁₇/#->#) (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0)  Detailed provenance:  #₁₆/T  └─ T  └─ T  ├─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097  [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:1162  [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:1257  [4] 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:1287  [5] 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  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [7] top-level scope  @ ~/.julia/packages/Graphs/nH2e0/src/Graphs.jl:570  [8] include(mod::Module, _path::String)  @ Base Base.jl:325  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:522  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/Graphs.jl:1 in expression starting at stdin:5 ✗ Graphs ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("86223c79-3864-5bf0-83f7-82e725a168b6"), "Graphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207  [12] top-level scope  @ ~/.julia/packages/NearestNeighborDescent/J15hU/src/NearestNeighborDescent.jl:5  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:522  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [18] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [20] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/NearestNeighborDescent/J15hU/src/NearestNeighborDescent.jl:1 in expression starting at stdin:5 ✗ NearestNeighborDescent 17 dependencies successfully precompiled in 920 seconds. 14 already precompiled. Precompilation completed after 949.49s ################################################################################ # Testing # Testing NearestNeighborDescent Status `/tmp/jl_e6Z4xC/Project.toml` [864edb3b] DataStructures v0.19.5 [b4f34e82] Distances v0.10.12 [86223c79] Graphs v1.14.0 [dd2c4c9e] NearestNeighborDescent v0.3.8 [189a3867] Reexport v1.2.2 [10745b16] Statistics v1.11.1 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_e6Z4xC/Manifest.toml` [ec485272] ArnoldiMethod v0.4.0 [864edb3b] DataStructures v0.19.5 [b4f34e82] Distances v0.10.12 [86223c79] Graphs v1.14.0 [d25df0c9] Inflate v0.1.5 [1914dd2f] MacroTools v0.5.16 [dd2c4c9e] NearestNeighborDescent v0.3.8 ⌅ [bac558e1] OrderedCollections v1.8.2 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [189a3867] Reexport v1.2.2 [699a6c99] SimpleTraits v0.9.6 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [8dfed614] Test v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.2+0 [4536629a] OpenBLAS_jll v0.3.33+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [8e850b90] libblastrampoline_jll v5.15.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/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =# Core.@doc " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" function karger_cut_cost(g::AbstractGraph{T}, cut::Vector{<:Integer}) where T <: Integer │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:48 =# │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ return count((e::Edge{T}->begin │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ cut[src(e)] != cut[dst(e)] │ end), edges(g)) │ 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/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) :: Value │ │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value │ │ [function] │ │ [where] │ │ [call] │ │ karger_cut_cost :: Identifier │ │ [::] │ │ g :: Identifier │ │ [curly] │ │ AbstractGraph :: Identifier │ │ T :: Identifier │ │ [::] │ │ cut :: Identifier │ │ [curly] │ │ Vector :: Identifier │ │ [<:] │ │ Integer :: Identifier │ │ [<:] │ │ T :: Identifier │ │ Integer :: Identifier │ │ [block] │ │ [return] │ │ [call] │ │ count :: Identifier │ │ [->] │ │ [::] │ │ e :: Identifier │ │ [curly] │ │ Edge :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ != :: Identifier │ │ [ref] │ │ cut :: Identifier │ │ [call] │ │ src :: Identifier │ │ e :: Identifier │ │ [ref] │ │ cut :: Identifier │ │ [call] │ │ dst :: Identifier │ │ e :: Identifier │ │ [call] │ │ edges :: Identifier │ │ g :: 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] │ │ karger_cut_cost :: Identifier │ scope_layer=1 │ [::] │ │ g :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractGraph :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ cut :: Identifier │ scope_layer=1 │ [curly] │ │ Vector :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [block] │ │ [return] │ │ [call] │ │ count :: Identifier │ scope_layer=1 │ [->] │ │ [::] │ │ e :: Identifier │ scope_layer=1 │ [curly] │ │ Edge :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ != :: Identifier │ scope_layer=1 │ [ref] │ │ cut :: Identifier │ scope_layer=1 │ [call] │ │ src :: Identifier │ scope_layer=1 │ e :: Identifier │ scope_layer=1 │ [ref] │ │ cut :: Identifier │ scope_layer=1 │ [call] │ │ dst :: Identifier │ scope_layer=1 │ e :: Identifier │ scope_layer=1 │ [call] │ │ edges :: Identifier │ scope_layer=1 │ g :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=48 │ Graphs :: Value │ macro_source=48 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=48 │ Graphs :: Value │ │ [inert] │ jl_source=L65 │ karger_cut_cost :: Identifier │ │ [call] │ macro_source=48 │ Base.Docs.docstr :: Value │ macro_source=48 │ [call] │ macro_source=48 │ Core.svec :: Value │ macro_source=48 │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value │ macro_source=48 │ [call] │ macro_source=48 │ Dict{Symbol, Any} :: Value │ macro_source=48 │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value │ macro_source=48 │ :linenumber => 42 :: Value │ macro_source=48 │ :module => Graphs :: Value │ macro_source=48 │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractGraph :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [curly] │ │ Vector :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" │ line = 42 └ mod = Graphs ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# - Found unexpected binding of kind static_parameter Expression:  #₁₆/T Containing expressions:  (= #₃₆/T #₁₆/T)  (call core.svec (call core.svec #₂₉/#karger_cut_cost##->###0 (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0)  (call core.svec (call core.svec (function_type #₁₇/#->#) (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0)  Detailed provenance:  #₁₆/T  └─ T  └─ T  ├─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097  [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:1162  [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:1257  [4] 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:1287  [5] 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  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [7] top-level scope  @ ~/.julia/packages/Graphs/nH2e0/src/Graphs.jl:570  [8] include(mod::Module, _path::String)  @ Base Base.jl:325  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:522  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/Graphs.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("86223c79-3864-5bf0-83f7-82e725a168b6"), "Graphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:207  [12] top-level scope  @ ~/.julia/packages/NearestNeighborDescent/J15hU/src/NearestNeighborDescent.jl:5  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:522  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [18] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [20] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/NearestNeighborDescent/J15hU/src/NearestNeighborDescent.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ NearestNeighborDescent │ [Output was shown above] └ ┌ Graphs │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =# Core.@doc " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" function karger_cut_cost(g::AbstractGraph{T}, cut::Vector{<:Integer}) where T <: Integer │ │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:48 =# │ │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ │ return count((e::Edge{T}->begin │ │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ │ cut[src(e)] != cut[dst(e)] │ │ end), edges(g)) │ │ 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/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) :: Value │ │ │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [call] │ │ │ karger_cut_cost :: Identifier │ │ │ [::] │ │ │ g :: Identifier │ │ │ [curly] │ │ │ AbstractGraph :: Identifier │ │ │ T :: Identifier │ │ │ [::] │ │ │ cut :: Identifier │ │ │ [curly] │ │ │ Vector :: Identifier │ │ │ [<:] │ │ │ Integer :: Identifier │ │ │ [<:] │ │ │ T :: Identifier │ │ │ Integer :: Identifier │ │ │ [block] │ │ │ [return] │ │ │ [call] │ │ │ count :: Identifier │ │ │ [->] │ │ │ [::] │ │ │ e :: Identifier │ │ │ [curly] │ │ │ Edge :: Identifier │ │ │ T :: Identifier │ │ │ [block] │ │ │ [call] │ │ │ != :: Identifier │ │ │ [ref] │ │ │ cut :: Identifier │ │ │ [call] │ │ │ src :: Identifier │ │ │ e :: Identifier │ │ │ [ref] │ │ │ cut :: Identifier │ │ │ [call] │ │ │ dst :: Identifier │ │ │ e :: Identifier │ │ │ [call] │ │ │ edges :: Identifier │ │ │ g :: 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] │ │ │ karger_cut_cost :: Identifier │ scope_layer=1 │ │ [::] │ │ │ g :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ AbstractGraph :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [::] │ │ │ cut :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Vector :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Integer :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ Integer :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [return] │ │ │ [call] │ │ │ count :: Identifier │ scope_layer=1 │ │ [->] │ │ │ [::] │ │ │ e :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Edge :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [call] │ │ │ != :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ cut :: Identifier │ scope_layer=1 │ │ [call] │ │ │ src :: Identifier │ scope_layer=1 │ │ e :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ cut :: Identifier │ scope_layer=1 │ │ [call] │ │ │ dst :: Identifier │ scope_layer=1 │ │ e :: Identifier │ scope_layer=1 │ │ [call] │ │ │ edges :: Identifier │ scope_layer=1 │ │ g :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=48 │ │ Graphs :: Value │ macro_source=48 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=48 │ │ Graphs :: Value │ │ │ [inert] │ jl_source=L65 │ │ karger_cut_cost :: Identifier │ │ │ [call] │ macro_source=48 │ │ Base.Docs.docstr :: Value │ macro_source=48 │ │ [call] │ macro_source=48 │ │ Core.svec :: Value │ macro_source=48 │ │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value │ macro_source=48 │ │ [call] │ macro_source=48 │ │ Dict{Symbol, Any} :: Value │ macro_source=48 │ │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value │ macro_source=48 │ │ :linenumber => 42 :: Value │ macro_source=48 │ │ :module => Graphs :: Value │ macro_source=48 │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ AbstractGraph :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Vector :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Integer :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ Integer :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" │ │ line = 42 │ └ mod = Graphs │ ERROR: LoadError: LoweringError: │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# - Found unexpected binding of kind static_parameter │ Expression: │ #₁₆/T │ Containing expressions: │ (= #₃₆/T #₁₆/T) │ (call core.svec (call core.svec #₂₉/#karger_cut_cost##->###0 (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0) │ (call core.svec (call core.svec (function_type #₁₇/#->#) (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0) │ │ Detailed provenance: │ #₁₆/T │ └─ T │ └─ T │ ├─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g)))))) │ └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 │ │ Stacktrace: │ [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097 │ [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:1162 │ [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:1257 │ [4] 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:1287 │ [5] 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 │ [6] include(mapexpr::Function, mod::Module, _path::String) │ @ Base Base.jl:326 │ [7] top-level scope │ @ ~/.julia/packages/Graphs/nH2e0/src/Graphs.jl:570 │ [8] include(mod::Module, _path::String) │ @ Base Base.jl:325 │ [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ @ Base loading.jl:3296 │ [10] top-level scope │ @ stdin:5 │ [11] eval(m::Module, e::Any) │ @ Core boot.jl:522 │ [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base loading.jl:3132 │ [13] include_string(m::Module, txt::String, fname::String) │ @ Base loading.jl:3142 [inlined] │ [14] exec_options(opts::Base.JLOptions) │ @ Base client.jl:353 │ [15] _start() │ @ Base client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 │ in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/Graphs.jl:1 │ in expression starting at stdin:5 └ ERROR: LoadError: The following 2 packages failed to precompile: NearestNeighborDescent Failed to precompile NearestNeighborDescent [dd2c4c9e-a32f-5b2f-b342-08c2f244fce8] to "/home/pkgeval/.julia/compiled/v1.14/NearestNeighborDescent/jl_FcbK3O" (ProcessExited(1)). Graphs Failed to precompile Graphs [86223c79-3864-5bf0-83f7-82e725a168b6] to "/home/pkgeval/.julia/compiled/v1.14/Graphs/jl_hbnsWh" (ProcessExited(1)). in expression starting at /home/pkgeval/.julia/packages/NearestNeighborDescent/J15hU/test/runtests.jl:2 Testing failed after 207.63s ERROR: LoadError: Package NearestNeighborDescent 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] 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 [4] 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 [5] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [6] test(pkg::String; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159 [inlined] [7] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 [8] include(mod::Module, _path::String) @ Base Base.jl:325 [9] exec_options(opts::Base.JLOptions) @ Base client.jl:355 [10] _start() @ Base client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 1194.47s: package fails to precompile