Package evaluation to test Groebner on Julia 1.14.0-DEV.1455 (9d9110fde9*) started at 2026-01-01T14:43:37.745 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 9.93s ################################################################################ # Installation # Installing Groebner... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [0b43b601] + Groebner v0.10.1 Updating `~/.julia/environments/v1.14/Manifest.toml` [c3fe647b] + AbstractAlgebra v0.47.6 [a9b6321e] + Atomix v1.1.2 [861a8166] + Combinatorics v1.1.0 [e2ba6199] + ExprTools v0.1.10 [0b43b601] + Groebner v0.10.1 [18e54dd8] + IntegerMathUtils v0.1.3 [692b3bcd] + JLLWrappers v1.7.1 [1914dd2f] + MacroTools v0.5.16 [2edaba10] + Nemo v0.53.2 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [27ebfcd6] + Primes v0.5.7 [fb686558] + RandomExtensions v0.4.4 [a759f4b9] + TimerOutputs v0.5.29 [013be700] + UnsafeAtomics v0.3.0 [e134572f] + FLINT_jll v301.400.1+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+0 [56f22d72] + Artifacts v1.11.0 [ade2ca70] + Dates v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging 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 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [781609d7] + GMP_jll v6.3.0+2 [3a97d323] + MPFR_jll v4.2.2+0 [4536629a] + OpenBLAS_jll v0.3.29+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 4.94s ################################################################################ # 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.4s ################################################################################ # Testing # Testing Groebner Status `/tmp/jl_pjzJ2R/Project.toml` [c3fe647b] AbstractAlgebra v0.47.6 [a9b6321e] Atomix v1.1.2 [6e4b80f9] BenchmarkTools v1.6.3 [861a8166] Combinatorics v1.1.0 [7c1d4256] DynamicPolynomials v0.6.4 [0b43b601] Groebner v0.10.1 [2edaba10] Nemo v0.53.2 [aea7be01] PrecompileTools v1.3.3 [27ebfcd6] Primes v0.5.7 [a759f4b9] TimerOutputs v0.5.29 [b77e0a4c] InteractiveUtils v1.11.0 [56ddb016] Logging v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_pjzJ2R/Manifest.toml` [c3fe647b] AbstractAlgebra v0.47.6 [a9b6321e] Atomix v1.1.2 [6e4b80f9] BenchmarkTools v1.6.3 [861a8166] Combinatorics v1.1.0 [34da2185] Compat v4.18.1 [864edb3b] DataStructures v0.19.3 [7c1d4256] DynamicPolynomials v0.6.4 [e2ba6199] ExprTools v0.1.10 [0b43b601] Groebner v0.10.1 [18e54dd8] IntegerMathUtils v0.1.3 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.3.0 [1914dd2f] MacroTools v0.5.16 [102ac46a] MultivariatePolynomials v0.5.13 [d8a4904e] MutableArithmetics v1.6.7 [2edaba10] Nemo v0.53.2 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [27ebfcd6] Primes v0.5.7 [fb686558] RandomExtensions v0.4.4 [189a3867] Reexport v1.2.2 [10745b16] Statistics v1.11.1 [ec057cc2] StructUtils v2.6.0 [a759f4b9] TimerOutputs v0.5.29 [013be700] UnsafeAtomics v0.3.0 [e134572f] FLINT_jll v301.400.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [de0858da] Printf v1.11.0 [9abbd945] Profile 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 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [3a97d323] MPFR_jll v4.2.2+0 [4536629a] OpenBLAS_jll v0.3.29+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [8e850b90] libblastrampoline_jll v5.15.0+0 Testing Running tests... WARNING: Method definition invariants_enabled() in module Groebner at /home/pkgeval/.julia/packages/Groebner/4lAu7/src/Groebner.jl:28 overwritten at /home/pkgeval/.julia/packages/Groebner/4lAu7/test/runtests.jl:5. Julia Version 1.14.0-DEV.1455 Commit 9d9110fde9* (2026-01-01 07:57 UTC) Platform Info: OS: Linux (x86_64-linux-gnu) CPU: 128 × AMD EPYC 7502 32-Core Processor WORD_SIZE: 64 LLVM: libLLVM-20.1.8 (ORCJIT, znver2) GC: Built with stock GC Threads: 1 default, 0 interactive, 1 GC (on 1 virtual cores) Environment: JULIA_CPU_THREADS = 1 JULIA_NUM_PRECOMPILE_TASKS = 1 JULIA_PKG_PRECOMPILE_AUTO = 0 JULIA_PKGEVAL = true JULIA_DEPOT_PATH = /home/pkgeval/.julia:/usr/local/share/julia: JULIA_NUM_THREADS = 1 JULIA_LOAD_PATH = @:/tmp/jl_pjzJ2R [ Info: Running arithmetic.jl 7.255849 seconds (5.01 M allocations: 258.381 MiB, 5.89% gc time, 96.83% compilation time: 12% of which was recompilation) [ Info: Running crt.jl 3.682151 seconds (1.95 M allocations: 99.883 MiB, 1.85% gc time, 96.16% compilation time) [ Info: Running ratrec.jl 1.357301 seconds (648.66 k allocations: 33.031 MiB, 96.44% compilation time) [ Info: Running monoms/exponentvector.jl 1.988240 seconds (1.27 M allocations: 67.945 MiB, 3.95% gc time, 97.20% compilation time) [ Info: Running monoms/packedtuples.jl 5.544168 seconds (3.28 M allocations: 171.393 MiB, 0.60% gc time, 95.85% compilation time: 11% of which was recompilation) [ Info: Running monoms/monom_arithmetic.jl 9.836139 seconds (3.02 M allocations: 158.560 MiB, 0.32% gc time, 98.07% compilation time: <1% of which was recompilation) [ Info: Running monoms/monom_orders.jl 24.461413 seconds (13.91 M allocations: 719.223 MiB, 1.10% gc time, 98.72% compilation time) [ Info: Running groebner.jl ┌ Warning: Groebner.jl does not have a native implementation for the given field: Finite field F_10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652624386837205668069673. │ Falling back to a generic implementation (may be slow). │ If this is unexpected, please consider submitting a GitHub issue. └ @ Groebner ~/.julia/packages/Groebner/4lAu7/src/input_output/AbstractAlgebra.jl:78 ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. ┌ Info: Two blocks of the product ordering intersect by their variables. │ Block 1: Lex(x6,x2,x1,x5) └ Block 2: Lex(x4,x1,x3) ┌ Info: Two blocks of the product ordering intersect by their variables. │ Block 1: Lex(6,2,1,5) └ Block 2: Lex(4,1,3) [ Info: GB contains polynomials of lengths: [548, 5450, 7483, 10338, 14966, 20193, 24061, 31571, 40769, 42350, 44397, 49310, 53731, 56648, 64288, 67326, 68922, 77270, 83178, 87409, 89256, 96811, 99109, 110779] [ Info: Variables: 64 [ Info: Variables: 100 [ Info: Variables: 101 [ Info: Variables: 127 [ Info: Variables: 128 [ Info: Variables: 256 [ Info: Variables: 257 ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. ┌ Info: The option `tasks = 128` was provided to Groebner.jl, │ however, multi-threading is disabled globally in Groebner.jl. │ The option `tasks` was ignored. └ See `Groebner.threading_enabled()` for details. [ Info: Testing multi-threading over Zp using 1 threads [ Info: Testing multi-threading over QQ using 1 threads [ Info: Producing 46656 small random tests for groebner. This may take a minute 1672.324213 seconds (1.68 G allocations: 105.979 GiB, 3.06% gc time, 86.46% compilation time) [ Info: Running learn_and_apply.jl Recorded 1 traces. Showing only one. # Trace of F4 recorded in 0.0 s (0.02 MiB). ring : Z[x1,...,x2] mod 2147483647 input : 2 polynomials output: 2 polynomials apply : 1 / 0 (success/fail) # Parameters input order : DegRevLex() output order : DegRevLex() homogenize : false permute : false monom. type : Groebner.PackedTuple1{UInt64, UInt8} coeff. type : UInt32 arithmetic : Groebner.SpecializedArithmeticZp{UInt64, UInt32, true} # F4 statistics iterations : 1 hashtable : 4 / 1024 filled matrix up-rows : 2 (100.0 % useful) matrix low-rows: 0 (NaN % useful) pair degrees : pair count : ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. Recorded 1 traces. Showing only one. # Trace of F4 recorded in 0.0 s (0.02 MiB). ring : Z[x1,...,x2] mod 2147483647 input : 2 polynomials output: 3 polynomials apply : 0 / 0 (success/fail) # Parameters input order : DegRevLex() output order : DegRevLex() homogenize : false permute : false monom. type : Vector{UInt64} coeff. type : UInt32 arithmetic : Groebner.SpecializedArithmeticZp{UInt64, UInt32, true} # F4 statistics iterations : 3 hashtable : 13 / 1024 filled matrix up-rows : 6 (66.67 % useful) matrix low-rows: 2 (50.0 % useful) pair degrees : 2000,2000 pair count : 1,1 Recorded 1 traces. Showing only one. # Trace of F4 recorded in 0.0 s (0.02 MiB). ring : Z[x1,...,x2] mod 4611686018427388039 input : 2 polynomials output: 3 polynomials apply : 0 / 0 (success/fail) # Parameters input order : DegRevLex() output order : DegRevLex() homogenize : false permute : false monom. type : Vector{UInt64} coeff. type : UInt64 arithmetic : Groebner.SpecializedArithmeticZp{UInt128, UInt64, false} # F4 statistics iterations : 3 hashtable : 13 / 1024 filled matrix up-rows : 6 (66.67 % useful) matrix low-rows: 2 (50.0 % useful) pair degrees : 2000,2000 pair count : 1,1 [ Info: Trace might be corrupted. Recovering... ┌ Info: Stress testing groebner_apply! on: │ primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 1031, 1048583, 134217689, 134217757] │ boot = 10 │ system = └ AbstractAlgebra.Generic.MPoly{Rational{BigInt}}[x*y + y, x*y + x + y] [ Info: Apply (expectedly) failed in 1052 / 1820 cases. ┌ Info: Stress testing groebner_apply! on: │ primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 1031, 1048583, 134217689, 134217757] │ boot = 10 │ system = └ AbstractAlgebra.Generic.MPoly{Rational{BigInt}}[z1 + z2 + z3 + z4 + z5, z1*z2 + z2*z3 + z3*z4 + z1*z5 + z4*z5, z1*z2*z3 + z2*z3*z4 + z1*z2*z5 + z1*z4*z5 + z3*z4*z5, z1*z2*z3*z4 + z1*z2*z3*z5 + z1*z2*z4*z5 + z1*z3*z4*z5 + z2*z3*z4*z5, z1*z2*z3*z4*z5 - 1] [ Info: Apply (expectedly) failed in 1724 / 1820 cases. 233.228154 seconds (151.67 M allocations: 8.961 GiB, 1.74% gc time, 94.28% compilation time) [ Info: Running isgroebner.jl 7.362461 seconds (3.73 M allocations: 223.881 MiB, 3.19% gc time, 87.88% compilation time) [ Info: Running normalform.jl [ Info: Producing 1728 tests for normal form. This may take a minute 28.037816 seconds (16.68 M allocations: 1.079 GiB, 1.77% gc time, 42.75% compilation time) [ Info: Running auxiliary.jl 82.604588 seconds (42.89 M allocations: 2.374 GiB, 2.54% gc time, 97.66% compilation time) [ Info: Running output_inferred.jl 3.380238 seconds (3.46 M allocations: 181.781 MiB, 98.05% compilation time: <1% of which was recompilation) [ Info: Running regressions.jl 25.039785 seconds (3.50 M allocations: 590.362 MiB, 1.26% gc time, 4.70% compilation time) [ Info: Running input_output/GroebnerDynamicPolynomialsExt.jl 122.600418 seconds (72.40 M allocations: 3.735 GiB, 1.10% gc time, 99.69% compilation time: 25% of which was recompilation) [ Info: Running input_output/Nemo.jl 155.799511 seconds (87.30 M allocations: 4.499 GiB, 1.13% gc time, 99.58% compilation time: 6% of which was recompilation) Test Summary: | Pass Total Time All tests | 78304 78304 40m21.2s arithmetic in Zp | 23953 23953 4.1s arithmetic in Zp x 4 | 2000 2000 0.9s crt | 37 37 0.9s crt table | 9 9 2.7s ratrec | 2 2 0.3s ratrec table | 6 6 1.0s exponent vector | 131 131 1.4s packed exponent tuple-1 | 89 89 0.9s packed exponent tuple-2 | 96 96 0.5s packed exponent tuple-3 | 101 101 1.4s packed exponent tuple-4 | 95 95 0.7s monom arithmetic | 170 170 3.5s monom division mask | 96 96 3.7s monom hash linearity | 222 222 0.7s monom orders: Lex, DegLex, DegRevLex | 445 445 5.0s monoms, variable permutation | 72 72 8.5s monom orders: WeightedOrdering | 65 65 4.8s monom orders: ProductOrdering | 36 36 3.7s monom orders: MatrixOrdering | 13 13 1.9s groebner basic | 12 12 30.4s groebner low level | 41 41 3m07.4s groebner generic | 32 32 2m05.7s groebner reduced=false | 6 6 3.2s groebner ground fields | 176 176 2m17.8s groebner modular | 265 265 53.1s groebner output sorted | 15 15 0.0s monomial overflow | 32 32 7.3s groebner reduced=true | 3 3 2.3s groebner certify | 7 7 13.9s groebner orderings | 1850 1850 4m04.3s groebner parent rings | 12 12 17.5s groebner monoms | 24 24 13.2s groebner zeros | 12 12 0.0s isgroebner zeros | 15 15 3.9s normalform zeros | 15 15 2.1s normalform checks | 4 4 0.3s groebner arithmetic | 16 16 24.5s groebner linear algebra | 10 10 0.3s groebner modular-hard problems | 17 17 13.8s groebner strange example | 1 1 12.0s groebner many variables | 52 52 58.0s groebner large exponents | 143 143 5.9s homogenization, basic | 148 148 2m25.9s homogenization, orderings | 352 352 5m41.0s groebner, change matrix | 72 72 14.3s multi-threading, composable | 20 20 24.3s groebner, multi-threading, Zp | 24 24 11.4s groebner, multi-threading, QQ | 24 24 12.7s groebner random stress tests | 40932 40932 2m36.7s learn & apply, same field | 139 139 17.1s learn & apply, different fields | 461 461 1m01.2s learn & apply, generic | 1 1 0.1s learn & apply, orderings | 88 88 15.0s learn & apply, copy trace | 4 4 1.6s learn & apply, tricky | 31 31 10.7s learn & apply low level | 15 15 26.8s learn & apply, stress | 0 26.5s learn & apply, in batches | 17 17 59.3s learn & apply low level, in batches | 7 7 14.2s isgroebner | 22 22 2.6s isgroebner orderings | 5 5 3.3s isgroebner certify | 68 68 0.3s normalform | 19 19 1.5s normalform many variables | 6 6 13.6s normalform orderings | 4 4 3.0s normalform of an array | 24 24 0.6s normalform random stress tests | 4866 4866 8.5s leading term | 8 8 4.4s leading ideal | 8 8 41.6s quotient basis | 17 17 24.3s dimension | 8 8 11.7s output type inferred | 10 10 0.2s regression, SI.jl normalform | 5 5 0.0s regression, ordering of empty | 4 4 0.0s regression, SI.jl cmp | 1 1 0.7s regression, column order in normalform | 1 1 0.1s regression, tracing invariants | 1 1 24.2s regression, basis | 1 1 0.0s DynamicPolynomials.jl input-output | 44 44 1m54.2s Nemo.jl, univariate | 25 25 18.2s Nemo.jl, generic | 6 6 1m13.3s Nemo.jl, input-output | 418 418 1m00.7s 2421.658656 seconds (2.09 G allocations: 129.448 GiB, 2.64% gc time, 87.70% compilation time: 3% of which was recompilation) Testing Groebner tests passed Testing completed after 2556.87s PkgEval succeeded after 2598.63s