Package evaluation to test GraphsInterfaceChecker on Julia 1.14.0-DEV.1455 (9d9110fde9*) started at 2026-01-01T14:00:17.580


################################################################################
# Set-up
#

Installing PkgEval dependencies (TestEnv)...
  Activating project at `~/.julia/environments/v1.14`

Set-up completed after 9.71s


################################################################################
# Installation
#

Installing GraphsInterfaceChecker...
   Resolving package versions...
    Updating `~/.julia/environments/v1.14/Project.toml`
  [3bef136c] + GraphsInterfaceChecker v0.1.0
    Updating `~/.julia/environments/v1.14/Manifest.toml`
  [ec485272] + ArnoldiMethod v0.4.0
  [864edb3b] + DataStructures v0.19.3
  [86223c79] + Graphs v1.13.3
  [3bef136c] + GraphsInterfaceChecker v0.1.0
  [d25df0c9] + Inflate v0.1.5
  [85a1e053] + Interfaces v0.3.2
  [1914dd2f] + MacroTools v0.5.16
  [bac558e1] + OrderedCollections v1.8.1
  [aea7be01] + PrecompileTools v1.3.3
  [21216c6a] + Preferences v1.5.1
  [699a6c99] + SimpleTraits v0.9.5
  [90137ffa] + StaticArrays v1.9.16
  [1e83bf80] + StaticArraysCore v1.4.4
  [10745b16] + Statistics v1.11.1
  [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.13.0
  [d6f4376e] + Markdown v1.11.0
  [de0858da] + Printf v1.11.0
  [9a3f8284] + Random v1.11.0
  [ea8e919c] + SHA v1.0.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.3.0+1
  [4536629a] + OpenBLAS_jll v0.3.29+0
  [bea87d4a] + SuiteSparse_jll v7.10.1+0
  [8e850b90] + libblastrampoline_jll v5.15.0+0

Installation completed after 1.05s


################################################################################
# Precompilation
#

ERROR: LoadError: MethodError: no method matching setindex!(::Base.ScopedValues.ScopedValue{IO}, ::Nothing)
The function `setindex!` exists, but no method is defined for this combination of argument types.
Stacktrace:
 [1] top-level scope
   @ /PkgEval.jl/scripts/precompile.jl:10
 [2] include(mod::Module, _path::String)
   @ Base ./Base.jl:309
 [3] exec_options(opts::Base.JLOptions)
   @ Base ./client.jl:344
 [4] _start()
   @ Base ./client.jl:585
in expression starting at /PkgEval.jl/scripts/precompile.jl:6

caused by: MethodError: no method matching setindex!(::Base.ScopedValues.ScopedValue{IO}, ::Base.DevNull)
The function `setindex!` exists, but no method is defined for this combination of argument types.
Stacktrace:
 [1] top-level scope
   @ /PkgEval.jl/scripts/precompile.jl:7
 [2] include(mod::Module, _path::String)
   @ Base ./Base.jl:309
 [3] exec_options(opts::Base.JLOptions)
   @ Base ./client.jl:344
 [4] _start()
   @ Base ./client.jl:585

Precompilation failed after 13.22s



################################################################################
# Testing
#

     Testing GraphsInterfaceChecker
      Status `/tmp/jl_phkoGQ/Project.toml`
  [4c88cf16] Aqua v0.8.14
  [86223c79] Graphs v1.13.3
  [3bef136c] GraphsInterfaceChecker v0.1.0
  [85a1e053] Interfaces v0.3.2
  [98e50ef6] JuliaFormatter v2.2.0
  [626554b9] MetaGraphs v0.8.1
  [fa8bd995] MetaGraphsNext v0.7.5
  [7ebac608] Multigraphs v0.3.0
  [47aef6b3] SimpleWeightedGraphs v1.5.1
  [8dfed614] Test v1.11.0
      Status `/tmp/jl_phkoGQ/Manifest.toml`
  [4c88cf16] Aqua v0.8.14
  [ec485272] ArnoldiMethod v0.4.0
  [0b6fb165] ChunkCodecCore v1.0.1
  [4c0bbee4] ChunkCodecLibZlib v1.0.0
  [55437552] ChunkCodecLibZstd v1.0.0
  [a80b9123] CommonMark v0.9.1
  [34da2185] Compat v4.18.1
  [864edb3b] DataStructures v0.19.3
  [5789e2e9] FileIO v1.17.1
  [c27321d9] Glob v1.4.0
  [86223c79] Graphs v1.13.3
  [3bef136c] GraphsInterfaceChecker v0.1.0
  [076d061b] HashArrayMappedTries v0.2.0
  [d25df0c9] Inflate v0.1.5
  [85a1e053] Interfaces v0.3.2
  [033835bb] JLD2 v0.6.3
  [98e50ef6] JuliaFormatter v2.2.0
⌅ [70703baa] JuliaSyntax v0.4.10
  [1914dd2f] MacroTools v0.5.16
  [626554b9] MetaGraphs v0.8.1
  [fa8bd995] MetaGraphsNext v0.7.5
  [7ebac608] Multigraphs v0.3.0
  [bac558e1] OrderedCollections v1.8.1
  [aea7be01] PrecompileTools v1.3.3
  [21216c6a] Preferences v1.5.1
  [ae029012] Requires v1.3.1
  [7e506255] ScopedValues v1.5.0
  [699a6c99] SimpleTraits v0.9.5
  [47aef6b3] SimpleWeightedGraphs v1.5.1
  [90137ffa] StaticArrays v1.9.16
  [1e83bf80] StaticArraysCore v1.4.4
  [10745b16] Statistics v1.11.1
  [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
  [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.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
  [9a3f8284] Random v1.11.0
  [ea8e919c] SHA v1.0.0
  [9e88b42a] Serialization v1.11.0
  [2f01184e] SparseArrays v1.13.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.3.0+1
  [deac9b47] LibCURL_jll v8.17.0+0
  [e37daf67] LibGit2_jll v1.9.2+0
  [29816b5a] LibSSH2_jll v1.11.3+1
  [14a3606d] MozillaCACerts_jll v2025.12.2
  [4536629a] OpenBLAS_jll v0.3.29+0
  [458c3c95] OpenSSL_jll v3.5.4+0
  [efcefdf7] PCRE2_jll v10.47.0+0
  [bea87d4a] SuiteSparse_jll v7.10.1+0
  [83775a58] Zlib_jll v1.3.1+2
  [3161d3a3] Zstd_jll v1.5.7+1
  [8e850b90] libblastrampoline_jll v5.15.0+0
  [8e850ede] nghttp2_jll v1.68.0+1
  [3f19e933] p7zip_jll v17.7.0+0
        Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading.
     Testing Running tests...
ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("8e59a23b-d1ef-5b43-a010-76e7ae578401"), "StaticArraysStatisticsExt") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=0, inline=true, opt_level=0)
Stacktrace:
  [1] error(s::String)
    @ Base ./error.jl:44
  [2] __require_prelocked(pkg::Base.PkgId, env::Nothing)
    @ Base ./loading.jl:2873
  [3] _require_prelocked(uuidkey::Base.PkgId, env::Nothing)
    @ Base ./loading.jl:2725
  [4] _require_prelocked
    @ ./loading.jl:2719 [inlined]
  [5] run_extension_callbacks(extid::Base.ExtensionId)
    @ Base ./loading.jl:1771
  [6] run_extension_callbacks(pkgid::Base.PkgId)
    @ Base ./loading.jl:1808
  [7] run_package_callbacks(modkey::Base.PkgId)
    @ Base ./loading.jl:1624
  [8] _require_prelocked(uuidkey::Base.PkgId, env::String)
    @ Base ./loading.jl:2733
  [9] macro expansion
    @ ./loading.jl:2653 [inlined]
 [10] macro expansion
    @ ./lock.jl:376 [inlined]
 [11] __require(into::Module, mod::Symbol)
    @ Base ./loading.jl:2617
 [12] require
    @ ./loading.jl:2593 [inlined]
 [13] eval_import_path
    @ ./module.jl:36 [inlined]
 [14] eval_import_path_all(at::Module, path::Expr, keyword::String)
    @ Base ./module.jl:60
 [15] _eval_import(::Bool, ::Module, ::Expr, ::Expr, ::Vararg{Expr})
    @ Base ./module.jl:101
 [16] top-level scope
    @ ~/.julia/packages/Graphs/la801/src/Graphs.jl:7
 [17] include(mod::Module, _path::String)
    @ Base ./Base.jl:309
 [18] 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:3309
 [19] top-level scope
    @ stdin:5
 [20] eval(m::Module, e::Any)
    @ Core ./boot.jl:489
 [21] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)
    @ Base ./loading.jl:3151
 [22] include_string
    @ ./loading.jl:3161 [inlined]
 [23] exec_options(opts::Base.JLOptions)
    @ Base ./client.jl:342
 [24] _start()
    @ Base ./client.jl:585
in expression starting at /home/pkgeval/.julia/packages/Graphs/la801/src/Graphs.jl:1
in expression starting at stdin:5

JuliaFormatter: Test Failed at /home/pkgeval/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:11
  Expression: JuliaFormatter.format(GraphsInterfaceChecker; overwrite = false)
  Stacktrace:
   [1] top-level scope
     @ ~/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:7
   [2] macro expansion
     @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:1995 [inlined]
   [3] macro expansion
     @ ~/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:11 [inlined]
   [4] macro expansion
     @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:1995 [inlined]
   [5] macro expansion
     @ ~/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:11 [inlined]
   [6] macro expansion
     @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:773 [inlined]

Testing AbstractGraphInterface is implemented for SimpleGraph

Mandatory components
is_directed: (`is_directed` outputs a boolean [true, true, true])
edgetype: (`edgetype` outputs a type [true, true, true])
vertices: (`vertices` is coherent with `eltype` [true, true, true],
           every vertex in `vertices(g)` exists [true, true, true],
           vertices beyond `vertices(g)` don't exist [true, true, true])
edges: (`edges` is coherent with `edgetype` [true, true, true],
        every edge in `edges` exists [true, true, true],
        `edges` are symmetric for undirected graphs [true, true, true])
nv: (`nv` outputs an integer` [true, true, true],
     `nv` is coherent with `vertices` [true, true, true])
ne: (`ne` outputs an integer` [true, true, true],
     `ne` is coherent with `edges` [true, true, true])
neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true],
            `outneighbors` is coherent with `has_edge` [true, true, true],
            `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true])
weights: (`weights` outputs a matrix of real numbers [true, true, true],
          `weights` has the right size [true, true, true],
          `weights` are symmetric for undirected graphs [true, true, true])

Optional components
mutation: (`add_vertex!` increases `nv` by one [true, true, true],
           `rem_vertex!` decreases `nv` by one [true, true, true])

Testing AbstractGraphInterface is implemented for SimpleDiGraph

Mandatory components
is_directed: (`is_directed` outputs a boolean [true, true, true])
edgetype: (`edgetype` outputs a type [true, true, true])
vertices: (`vertices` is coherent with `eltype` [true, true, true],
           every vertex in `vertices(g)` exists [true, true, true],
           vertices beyond `vertices(g)` don't exist [true, true, true])
edges: (`edges` is coherent with `edgetype` [true, true, true],
        every edge in `edges` exists [true, true, true],
        `edges` are symmetric for undirected graphs [true, true, true])
nv: (`nv` outputs an integer` [true, true, true],
     `nv` is coherent with `vertices` [true, true, true])
ne: (`ne` outputs an integer` [true, true, true],
     `ne` is coherent with `edges` [true, true, true])
neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true],
            `outneighbors` is coherent with `has_edge` [true, true, true],
            `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true])
weights: (`weights` outputs a matrix of real numbers [true, true, true],
          `weights` has the right size [true, true, true],
          `weights` are symmetric for undirected graphs [true, true, true])

Optional components
mutation: (`add_vertex!` increases `nv` by one [true, true, true],
           `rem_vertex!` decreases `nv` by one [true, true, true])

Testing AbstractGraphInterface is implemented for MetaGraphs.MetaGraph

Mandatory components
is_directed: (`is_directed` outputs a boolean [true, true, true])
edgetype: (`edgetype` outputs a type [true, true, true])
vertices: (`vertices` is coherent with `eltype` [true, true, true],
           every vertex in `vertices(g)` exists [true, true, true],
           vertices beyond `vertices(g)` don't exist [true, true, true])
edges: (`edges` is coherent with `edgetype` [true, true, true],
        every edge in `edges` exists [true, true, true],
        `edges` are symmetric for undirected graphs [true, true, true])
nv: (`nv` outputs an integer` [true, true, true],
     `nv` is coherent with `vertices` [true, true, true])
ne: (`ne` outputs an integer` [true, true, true],
     `ne` is coherent with `edges` [true, true, true])
neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true],
            `outneighbors` is coherent with `has_edge` [true, true, true],
            `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true])
weights: (`weights` outputs a matrix of real numbers [true, true, true],
          `weights` has the right size [true, true, true],
          `weights` are symmetric for undirected graphs [true, true, true])

Testing AbstractGraphInterface is implemented for MetaGraphs.MetaDiGraph

Mandatory components
is_directed: (`is_directed` outputs a boolean [true, true, true])
edgetype: (`edgetype` outputs a type [true, true, true])
vertices: (`vertices` is coherent with `eltype` [true, true, true],
           every vertex in `vertices(g)` exists [true, true, true],
           vertices beyond `vertices(g)` don't exist [true, true, true])
edges: (`edges` is coherent with `edgetype` [true, true, true],
        every edge in `edges` exists [true, true, true],
        `edges` are symmetric for undirected graphs [true, true, true])
nv: (`nv` outputs an integer` [true, true, true],
     `nv` is coherent with `vertices` [true, true, true])
ne: (`ne` outputs an integer` [true, true, true],
     `ne` is coherent with `edges` [true, true, true])
neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true],
            `outneighbors` is coherent with `has_edge` [true, true, true],
            `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true])
weights: (`weights` outputs a matrix of real numbers [true, true, true],
          `weights` has the right size [true, true, true],
          `weights` are symmetric for undirected graphs [true, true, true])

Testing AbstractGraphInterface is implemented for SimpleWeightedGraphs.SimpleWeightedGraph

Mandatory components
is_directed: (`is_directed` outputs a boolean [true, true, true])
edgetype: (`edgetype` outputs a type [true, true, true])
vertices: (`vertices` is coherent with `eltype` [true, true, true],
           every vertex in `vertices(g)` exists [true, true, true],
           vertices beyond `vertices(g)` don't exist [true, true, true])
edges: (`edges` is coherent with `edgetype` [true, true, true],
        every edge in `edges` exists [true, true, true],
        `edges` are symmetric for undirected graphs [true, true, true])
nv: (`nv` outputs an integer` [true, true, true],
     `nv` is coherent with `vertices` [true, true, true])
ne: (`ne` outputs an integer` [true, true, true],
     `ne` is coherent with `edges` [true, true, true])
neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true],
            `outneighbors` is coherent with `has_edge` [true, true, true],
            `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true])
weights: (`weights` outputs a matrix of real numbers [true, true, true],
          `weights` has the right size [true, true, true],
          `weights` are symmetric for undirected graphs [true, true, true])

Testing AbstractGraphInterface is implemented for SimpleWeightedGraphs.SimpleWeightedDiGraph

Mandatory components
is_directed: (`is_directed` outputs a boolean [true, true, true])
edgetype: (`edgetype` outputs a type [true, true, true])
vertices: (`vertices` is coherent with `eltype` [true, true, true],
           every vertex in `vertices(g)` exists [true, true, true],
           vertices beyond `vertices(g)` don't exist [true, true, true])
edges: (`edges` is coherent with `edgetype` [true, true, true],
        every edge in `edges` exists [true, true, true],
        `edges` are symmetric for undirected graphs [true, true, true])
nv: (`nv` outputs an integer` [true, true, true],
     `nv` is coherent with `vertices` [true, true, true])
ne: (`ne` outputs an integer` [true, true, true],
     `ne` is coherent with `edges` [true, true, true])
neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true],
            `outneighbors` is coherent with `has_edge` [true, true, true],
            `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true])
weights: (`weights` outputs a matrix of real numbers [true, true, true],
          `weights` has the right size [true, true, true],
          `weights` are symmetric for undirected graphs [true, true, true])

Testing AbstractGraphInterface is implemented for MetaGraphsNext.MetaGraph

Mandatory components
is_directed: (`is_directed` outputs a boolean [true, true, true, true, true, true])
edgetype: (`edgetype` outputs a type [true, true, true, true, true, true])
vertices: (`vertices` is coherent with `eltype` [true, true, true, true, true, true],
           every vertex in `vertices(g)` exists [true, true, true, true, true, true],
           vertices beyond `vertices(g)` don't exist [true, true, true, true, true, true])
edges: (`edges` is coherent with `edgetype` [true, true, true, true, true, true],
        every edge in `edges` exists [true, true, true, true, true, true],
        `edges` are symmetric for undirected graphs [true, true, true, true, true, true])
nv: (`nv` outputs an integer` [true, true, true, true, true, true],
     `nv` is coherent with `vertices` [true, true, true, true, true, true])
ne: (`ne` outputs an integer` [true, true, true, true, true, true],
     `ne` is coherent with `edges` [true, true, true, true, true, true])
neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true, true, true, true],
            `outneighbors` is coherent with `has_edge` [true, true, true, true, true, true],
            `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true, true, true, true])
weights: (`weights` outputs a matrix of real numbers [true, true, true, true, true, true],
          `weights` has the right size [true, true, true, true, true, true],
          `weights` are symmetric for undirected graphs [true, true, true, true, true, true])

Testing AbstractGraphInterface is implemented for Multigraph

Testing AbstractGraphInterface is implemented for DiMultigraph
Test Summary:             | Pass  Fail  Broken  Total     Time
GraphsInterfaceChecker.jl |   18     1       2     21  2m58.3s
  Aqua                    |   11                   11  1m01.9s
  JuliaFormatter          |          1              1    56.5s
  Graphs.jl               |    2                    2    10.9s
  MetaGraphs.jl           |    2                    2    10.2s
  SimpleWeightedGraphs.jl |    2                    2     9.0s
  MetaGraphsNext.jl       |    1                    1    26.9s
  Multigraphs.jl          |                  2      2     2.8s
RNG of the outermost testset: Random.Xoshiro(0x4b79fe6fdc4d791b, 0xa6b0d836c6ec166d, 0x9445336da614930e, 0x9da6b2d9d5e5cecd, 0x74756c2d48c14343)
ERROR: LoadError: Some tests did not pass: 18 passed, 1 failed, 0 errored, 2 broken.
in expression starting at /home/pkgeval/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:6

Testing failed after 209.41s

ERROR: LoadError: Package GraphsInterfaceChecker 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:3067
  [3] test
    @ /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:2916 [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:572
  [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec})
    @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:548
  [6] 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
  [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec})
    @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:161
  [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd})
    @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160
  [9] test
    @ /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [inlined]
 [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String)
    @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159
 [11] top-level scope
    @ /PkgEval.jl/scripts/evaluate.jl:237
 [12] include(mod::Module, _path::String)
    @ Base ./Base.jl:309
 [13] exec_options(opts::Base.JLOptions)
    @ Base ./client.jl:344
 [14] _start()
    @ Base ./client.jl:585
in expression starting at /PkgEval.jl/scripts/evaluate.jl:228

PkgEval failed after 250.7s: package has test failures