Package evaluation to test Groebner on Julia 1.14.0-DEV.1367 (f40b117265*) started at 2025-12-14T14:27:04.220 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 8.6s ################################################################################ # Installation # Installing Groebner... Resolving package versions... Installed Groebner ─ v0.10.1 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.1 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [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 5.34s ################################################################################ # 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:577 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:577 Precompilation failed after 13.24s ################################################################################ # Testing # Testing Groebner Status `/tmp/jl_WnypYX/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.1 [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_WnypYX/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.1 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [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.1367 Commit f40b117265* (2025-12-12 20:51 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_WnypYX [ Info: Running arithmetic.jl 6.234058 seconds (4.85 M allocations: 248.238 MiB, 2.14% gc time, 96.20% compilation time: 8% of which was recompilation) [ Info: Running crt.jl 3.525154 seconds (1.90 M allocations: 97.171 MiB, 0.80% gc time, 97.92% compilation time) [ Info: Running ratrec.jl 1.277502 seconds (645.40 k allocations: 33.051 MiB, 4.19% gc time, 96.69% compilation time) [ Info: Running monoms/exponentvector.jl 1.838382 seconds (1.27 M allocations: 67.715 MiB, 1.60% gc time, 97.43% compilation time) [ Info: Running monoms/packedtuples.jl 5.416639 seconds (3.31 M allocations: 172.485 MiB, 1.40% gc time, 95.62% compilation time) [ Info: Running monoms/monom_arithmetic.jl 9.442009 seconds (3.03 M allocations: 158.828 MiB, 0.29% gc time, 97.95% compilation time: <1% of which was recompilation) [ Info: Running monoms/monom_orders.jl 22.704417 seconds (14.05 M allocations: 725.486 MiB, 3.46% gc time, 98.64% 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: [560, 3546, 4572, 6859, 8560, 10785, 15085, 20642, 25485, 27118, 31347, 32102, 35006, 38618, 40138, 41741, 43083, 46053, 47312, 49953, 54617, 56040, 60624, 72215, 74383, 98200, 120665] [ 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 1718.506152 seconds (1.66 G allocations: 104.989 GiB, 2.06% gc time, 87.37% 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. 242.805860 seconds (151.59 M allocations: 8.959 GiB, 1.24% gc time, 94.78% compilation time) [ Info: Running isgroebner.jl 7.206144 seconds (3.70 M allocations: 222.016 MiB, 3.43% gc time, 91.00% compilation time) [ Info: Running normalform.jl [ Info: Producing 1728 tests for normal form. This may take a minute 26.805044 seconds (16.59 M allocations: 1.073 GiB, 2.02% gc time, 44.13% compilation time) [ Info: Running auxiliary.jl 83.479098 seconds (42.19 M allocations: 2.335 GiB, 1.00% gc time, 99.13% compilation time) [ Info: Running output_inferred.jl 2.963559 seconds (3.35 M allocations: 174.443 MiB, 3.86% gc time, 97.97% compilation time: <1% of which was recompilation) [ Info: Running regressions.jl 26.047554 seconds (3.50 M allocations: 590.135 MiB, 1.93% gc time, 4.26% compilation time) [ Info: Running input_output/GroebnerDynamicPolynomialsExt.jl 121.471064 seconds (70.91 M allocations: 3.652 GiB, 2.23% gc time, 99.69% compilation time: 23% of which was recompilation) [ Info: Running input_output/Nemo.jl 160.111492 seconds (86.36 M allocations: 4.448 GiB, 1.10% gc time, 99.58% compilation time: 6% of which was recompilation) Test Summary: | Pass Total Time All tests | 78255 78255 41m16.7s arithmetic in Zp | 23941 23941 3.6s arithmetic in Zp x 4 | 2000 2000 0.8s crt | 37 37 0.8s crt table | 9 9 2.7s ratrec | 2 2 0.3s ratrec table | 6 6 0.9s exponent vector | 131 131 1.3s packed exponent tuple-1 | 89 89 0.9s packed exponent tuple-2 | 96 96 0.5s packed exponent tuple-3 | 101 101 1.3s packed exponent tuple-4 | 95 95 0.7s monom arithmetic | 170 170 3.4s monom division mask | 96 96 3.5s monom hash linearity | 232 232 0.7s monom orders: Lex, DegLex, DegRevLex | 398 398 4.6s monoms, variable permutation | 72 72 8.0s monom orders: WeightedOrdering | 65 65 4.6s monom orders: ProductOrdering | 36 36 3.3s monom orders: MatrixOrdering | 13 13 1.6s groebner basic | 12 12 26.4s groebner low level | 41 41 2m55.9s groebner generic | 32 32 1m57.1s groebner reduced=false | 6 6 3.1s groebner ground fields | 176 176 2m13.2s groebner modular | 265 265 1m13.2s groebner output sorted | 15 15 0.1s monomial overflow | 32 32 10.6s groebner reduced=true | 3 3 3.5s groebner certify | 7 7 19.6s groebner orderings | 1850 1850 5m07.0s groebner parent rings | 12 12 20.0s groebner monoms | 24 24 13.9s groebner zeros | 12 12 0.0s isgroebner zeros | 15 15 4.2s normalform zeros | 15 15 2.7s normalform checks | 4 4 0.4s groebner arithmetic | 16 16 24.4s groebner linear algebra | 10 10 0.2s groebner modular-hard problems | 17 17 11.0s groebner strange example | 1 1 7.6s groebner many variables | 52 52 51.2s groebner large exponents | 143 143 5.4s homogenization, basic | 148 148 2m20.5s homogenization, orderings | 352 352 5m41.0s groebner, change matrix | 72 72 15.3s multi-threading, composable | 20 20 23.0s groebner, multi-threading, Zp | 24 24 11.7s groebner, multi-threading, QQ | 24 24 11.6s groebner random stress tests | 40932 40932 2m35.5s learn & apply, same field | 139 139 18.0s learn & apply, different fields | 461 461 1m07.5s learn & apply, generic | 1 1 0.1s learn & apply, orderings | 88 88 16.1s learn & apply, copy trace | 4 4 1.7s learn & apply, tricky | 31 31 11.6s learn & apply low level | 15 15 27.6s learn & apply, stress | 0 27.1s learn & apply, in batches | 17 17 59.2s learn & apply low level, in batches | 7 7 13.4s isgroebner | 22 22 2.2s isgroebner orderings | 5 5 3.5s isgroebner certify | 68 68 0.3s normalform | 19 19 1.4s normalform many variables | 6 6 12.6s normalform orderings | 4 4 2.9s normalform of an array | 24 24 0.6s normalform random stress tests | 4866 4866 8.4s leading term | 8 8 4.5s leading ideal | 8 8 43.7s quotient basis | 17 17 23.0s 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.6s regression, column order in normalform | 1 1 0.1s regression, tracing invariants | 1 1 25.2s regression, basis | 1 1 0.0s DynamicPolynomials.jl input-output | 44 44 1m56.0s Nemo.jl, univariate | 25 25 17.4s Nemo.jl, generic | 6 6 1m16.0s Nemo.jl, input-output | 418 418 1m03.3s 2477.210458 seconds (2.08 G allocations: 128.326 GiB, 1.87% gc time, 88.47% compilation time: 3% of which was recompilation) Testing Groebner tests passed Testing completed after 2604.36s PkgEval succeeded after 2647.15s