Package evaluation to load MotifCluster on Julia 1.14.0-DEV.2373 (cf67ecc88f*) started at 2026-06-13T15:35:56.786 ################################################################################ # Set-up # Set-up completed after 0.12s ################################################################################ # Installation # Installing MotifCluster... Resolving package versions... Installed Rmath_jll ─────────────── v0.5.1+0 Installed ArnoldiMethod ─────────── v0.4.0 Installed AbstractTrees ─────────── v0.4.5 Installed FillArrays ────────────── v1.16.0 Installed DataStructures ────────── v0.19.5 Installed MacroTools ────────────── v0.5.16 Installed HypergeometricFunctions ─ v0.3.28 Installed AliasTables ───────────── v1.1.3 Installed OrderedCollections ────── v1.8.2 Installed StatsBase ─────────────── v0.34.11 Installed Compat ────────────────── v4.18.1 Installed DataAPI ───────────────── v1.16.0 Installed Statistics ────────────── v1.11.1 Installed NearestNeighbors ──────── v0.4.27 Installed StatsAPI ──────────────── v1.8.0 Installed Clustering ────────────── v0.15.8 Installed MotifCluster ──────────── v0.2.3 Installed Distances ─────────────── v0.10.12 Installed PrecompileTools ───────── v1.3.4 Installed StaticArraysCore ──────── v1.4.4 Installed SimpleTraits ──────────── v0.9.6 Installed OpenSpecFun_jll ───────── v0.5.6+0 Installed IrrationalConstants ───── v0.2.6 Installed StaticArrays ──────────── v1.9.18 Installed LogExpFunctions ───────── v1.0.1 Installed QuadGK ────────────────── v2.11.3 Installed Rmath ─────────────────── v0.9.0 Installed StatsFuns ─────────────── v2.1.0 Installed Reexport ──────────────── v1.2.2 Installed SpecialFunctions ──────── v2.8.0 Installed Missings ──────────────── v1.2.0 Installed PtrArrays ─────────────── v1.4.0 Installed Distributions ─────────── v0.25.126 Installed SortingAlgorithms ─────── v1.2.2 Installed Inflate ───────────────── v0.1.5 Installed PDMats ────────────────── v0.11.37 Installed DocStringExtensions ───── v0.9.5 Installed Preferences ───────────── v1.5.2 Installed JLLWrappers ───────────── v1.8.0 Installed Aqua ──────────────────── v0.6.7 Installed Graphs ────────────────── v1.14.0 Installing 2 artifacts Installed artifact OpenSpecFun 194.9 KiB Installed artifact Rmath 121.9 KiB Updating `~/.julia/environments/v1.14/Project.toml` [daa9fd3b] + MotifCluster v0.2.3 Updating `~/.julia/environments/v1.14/Manifest.toml` [1520ce14] + AbstractTrees v0.4.5 [66dad0bd] + AliasTables v1.1.3 ⌅ [4c88cf16] + Aqua v0.6.7 [ec485272] + ArnoldiMethod v0.4.0 [aaaa29a8] + Clustering v0.15.8 [34da2185] + Compat v4.18.1 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.19.5 [b4f34e82] + Distances v0.10.12 [31c24e10] + Distributions v0.25.126 [ffbed154] + DocStringExtensions v0.9.5 [1a297f60] + FillArrays v1.16.0 [86223c79] + Graphs v1.14.0 [34004b35] + HypergeometricFunctions v0.3.28 [d25df0c9] + Inflate v0.1.5 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [e1d29d7a] + Missings v1.2.0 [daa9fd3b] + MotifCluster v0.2.3 [b8a86587] + NearestNeighbors v0.4.27 ⌅ [bac558e1] + OrderedCollections v1.8.2 [90014a1f] + PDMats v0.11.37 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [43287f4e] + PtrArrays v1.4.0 [1fd47b50] + QuadGK v2.11.3 [189a3867] + Reexport v1.2.2 [79098fc4] + Rmath v0.9.0 [699a6c99] + SimpleTraits v0.9.6 [a2af1166] + SortingAlgorithms v1.2.2 [276daf66] + SpecialFunctions v2.8.0 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.8.0 [2913bbd2] + StatsBase v0.34.11 [4c63d2b9] + StatsFuns v2.1.0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f50d1b31] + Rmath_jll v0.5.1+0 [0dad84c5] + ArgTools v1.2.0 [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 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.14.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 [4607b0f0] + SuiteSparse [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.2+0 [deac9b47] + LibCURL_jll v8.20.0+1 [e37daf67] + LibGit2_jll v1.9.4+0 [29816b5a] + LibSSH2_jll v1.11.101+0 [14a3606d] + MozillaCACerts_jll v2026.5.14 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.7+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+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 12.06s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Project No packages added to or removed from `~/.julia/environments/pkgeval/Project.toml` Manifest No packages added to or removed from `~/.julia/environments/pkgeval/Manifest.toml` Precompiling package dependencies... Precompiling project... 3.8 s ✓ MacroTools 0.5 s ✓ Reexport 1.0 s ✓ Statistics 1.0 s ✓ DataAPI 2.3 s ✓ IrrationalConstants 0.9 s ✓ StaticArraysCore 0.6 s ✓ StatsAPI 133.4 s ✓ OrderedCollections 1.1 s ✓ DocStringExtensions 66.2 s ✓ AbstractTrees 0.9 s ✓ Inflate 104.9 s ✓ FillArrays 33.1 s ✓ PtrArrays 38.1 s ✓ PDMats 1.4 s ✓ Compat 2.5 s ✓ Preferences 3.1 s ✓ SimpleTraits 36.5 s ✓ Statistics → SparseArraysExt 48.0 s ✓ Missings 1.8 s ✓ Distances 143.0 s ✓ DataStructures 1.6 s ✓ LogExpFunctions 68.0 s ✓ FillArrays → FillArraysSparseArraysExt 35.8 s ✓ FillArrays → FillArraysStatisticsExt 35.2 s ✓ AliasTables 66.7 s ✓ FillArrays → FillArraysPDMatsExt 0.7 s ✓ Compat → CompatLinearAlgebraExt 2.8 s ✓ JLLWrappers 2.7 s ✓ PrecompileTools 35.5 s ✓ Distances → DistancesSparseArraysExt 33.8 s ✓ SortingAlgorithms 36.3 s ✓ QuadGK 42.0 s ✓ Aqua 3.0 s ✓ Rmath_jll 3.0 s ✓ OpenSpecFun_jll 297.1 s ✓ StaticArrays 151.7 s ✓ StatsBase 2.8 s ✓ Rmath 70.9 s ✓ SpecialFunctions 35.2 s ✓ StaticArrays → StaticArraysStatisticsExt 37.2 s ✓ ArnoldiMethod 65.4 s ✓ FillArrays → FillArraysStaticArraysExt 66.5 s ✓ PDMats → StatsBaseExt 36.5 s ✓ HypergeometricFunctions 103.0 s ✓ NearestNeighbors ┌ 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 35.8 s ✓ StatsFuns 71.5 s ✓ Clustering 77.1 s ✓ Distributions 36.8 s ✓ Distributions → DistributionsTestExt 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/MotifCluster/BEzjj/src/MotifCluster.jl:6  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl: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/MotifCluster/BEzjj/src/MotifCluster.jl:1 in expression starting at stdin:5 ✗ MotifCluster 49 dependencies successfully precompiled in 2273 seconds. 34 already precompiled. Precompilation completed after 2291.24s ################################################################################ # Loading # Loading MotifCluster... ┌ 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/MotifCluster/BEzjj/src/MotifCluster.jl:6  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl: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/MotifCluster/BEzjj/src/MotifCluster.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ 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 └ ┌ MotifCluster │ [Output was shown above] └ ERROR: The following 2 packages failed to precompile: Graphs Failed to precompile Graphs [86223c79-3864-5bf0-83f7-82e725a168b6] to "/home/pkgeval/.julia/compiled/v1.14/Graphs/jl_Yi4kxC" (ProcessExited(1)). MotifCluster Failed to precompile MotifCluster [daa9fd3b-41af-4965-b715-a21506bae1e4] to "/home/pkgeval/.julia/compiled/v1.14/MotifCluster/jl_ikl2Az" (ProcessExited(1)). Loading failed after 204.21s ERROR: LoadError: failed process: Process(`/opt/julia/bin/julia -C native -J/opt/julia/lib/julia/sys.so -g1 --check-bounds=yes --inline=yes --check-bounds=yes --pkgimages=existing -e 'using MotifCluster'`, ProcessExited(1)) [1] Stacktrace: [1] pipeline_error(proc::Base.Process) @ Base process.jl:612 [inlined] [2] run(::Cmd; wait::Bool) @ Base process.jl:525 [3] run(::Cmd) @ Base process.jl:522 [4] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:197 [5] include(mod::Module, _path::String) @ Base Base.jl:325 [6] exec_options(opts::Base.JLOptions) @ Base client.jl:355 [7] _start() @ Base client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:188 PkgEval failed after 2529.19s: package fails to precompile