Package evaluation of Groebner on Julia 1.10.9 (96dc2d8c45*) started at 2025-06-06T14:01:19.741 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 4.69s ################################################################################ # Installation # Installing Groebner... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [0b43b601] + Groebner v0.9.4 Updating `~/.julia/environments/v1.10/Manifest.toml` ⌅ [c3fe647b] + AbstractAlgebra v0.44.13 [a9b6321e] + Atomix v1.1.1 [861a8166] + Combinatorics v1.0.3 [0b43b601] + Groebner v0.9.4 [18e54dd8] + IntegerMathUtils v0.1.2 [692b3bcd] + JLLWrappers v1.7.0 [1914dd2f] + MacroTools v0.5.16 ⌅ [2edaba10] + Nemo v0.49.5 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [27ebfcd6] + Primes v0.5.7 [fb686558] + RandomExtensions v0.4.4 [013be700] + UnsafeAtomics v0.3.0 [e134572f] + FLINT_jll v300.200.201+0 ⌅ [656ef2d0] + OpenBLAS32_jll v0.3.24+0 [56f22d72] + Artifacts [ade2ca70] + Dates [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [de0858da] + Printf [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [2f01184e] + SparseArrays v1.10.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [781609d7] + GMP_jll v6.2.1+6 [3a97d323] + MPFR_jll v4.2.0+1 [4536629a] + OpenBLAS_jll v0.3.23+4 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [8e850b90] + libblastrampoline_jll v5.11.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 7.68s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 82.07s ################################################################################ # Testing # Testing Groebner Status `/tmp/jl_BFx6Ur/Project.toml` ⌅ [c3fe647b] AbstractAlgebra v0.44.13 [a9b6321e] Atomix v1.1.1 [6e4b80f9] BenchmarkTools v1.6.0 [861a8166] Combinatorics v1.0.3 [7c1d4256] DynamicPolynomials v0.6.2 [0b43b601] Groebner v0.9.4 ⌅ [2edaba10] Nemo v0.49.5 ⌅ [aea7be01] PrecompileTools v1.2.1 [27ebfcd6] Primes v0.5.7 [b77e0a4c] InteractiveUtils [56ddb016] Logging [de0858da] Printf [9a3f8284] Random [8dfed614] Test Status `/tmp/jl_BFx6Ur/Manifest.toml` ⌅ [c3fe647b] AbstractAlgebra v0.44.13 [a9b6321e] Atomix v1.1.1 [6e4b80f9] BenchmarkTools v1.6.0 [d360d2e6] ChainRulesCore v1.25.1 [861a8166] Combinatorics v1.0.3 [34da2185] Compat v4.16.0 [864edb3b] DataStructures v0.18.22 [7c1d4256] DynamicPolynomials v0.6.2 [0b43b601] Groebner v0.9.4 [18e54dd8] IntegerMathUtils v0.1.2 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [1914dd2f] MacroTools v0.5.16 [102ac46a] MultivariatePolynomials v0.5.9 [d8a4904e] MutableArithmetics v1.6.4 ⌅ [2edaba10] Nemo v0.49.5 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [27ebfcd6] Primes v0.5.7 [fb686558] RandomExtensions v0.4.4 [189a3867] Reexport v1.2.2 [013be700] UnsafeAtomics v0.3.0 [e134572f] FLINT_jll v300.200.201+0 ⌅ [656ef2d0] OpenBLAS32_jll v0.3.24+0 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [9fa8497b] Future [b77e0a4c] InteractiveUtils [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [de0858da] Printf [9abbd945] Profile [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [781609d7] GMP_jll v6.2.1+6 [3a97d323] MPFR_jll v4.2.0+1 [4536629a] OpenBLAS_jll v0.3.23+4 [bea87d4a] SuiteSparse_jll v7.2.1+1 [8e850b90] libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... WARNING: Method definition invariants_enabled() in module Groebner at /home/pkgeval/.julia/packages/Groebner/FT1eI/src/Groebner.jl:28 overwritten at /home/pkgeval/.julia/packages/Groebner/FT1eI/test/runtests.jl:5. Julia Version 1.10.9 Commit 96dc2d8c45* (2025-06-05 14:25 UTC) Platform Info: OS: Linux (x86_64-linux-gnu) CPU: 128 × AMD EPYC 7502 32-Core Processor WORD_SIZE: 64 LIBM: libopenlibm LLVM: libLLVM-15.0.7 (ORCJIT, znver2) 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_BFx6Ur [ Info: Running arithmetic.jl 3.881569 seconds (2.80 M allocations: 183.818 MiB, 4.02% gc time, 97.55% compilation time) [ Info: Running crt.jl 0.627309 seconds (267.38 k allocations: 17.937 MiB, 97.26% compilation time) [ Info: Running monoms/exponentvector.jl 1.215266 seconds (760.14 k allocations: 51.874 MiB, 0.81% gc time, 98.21% compilation time) [ Info: Running monoms/packedtuples.jl 3.602124 seconds (2.01 M allocations: 130.497 MiB, 1.15% gc time, 96.81% compilation time) [ Info: Running monoms/monom_arithmetic.jl 3.823936 seconds (1.80 M allocations: 121.828 MiB, 0.60% gc time, 97.47% compilation time) [ Info: Running monoms/monom_orders.jl 12.695527 seconds (6.66 M allocations: 452.507 MiB, 1.21% gc time, 98.60% 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/FT1eI/src/input_output/AbstractAlgebra.jl:86 ┌ 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: [549, 6775, 9155, 12362, 15854, 18430, 18457, 19992, 22931, 28908, 30416, 30872, 44154, 44952, 47428, 51739, 51803, 52719, 59694, 66569, 68577, 70236, 71912, 72214, 77315, 80100, 82555, 86375, 91411, 93486, 95461, 98183, 102039, 105971, 107571, 108596, 109863, 110995, 112651, 121075, 123048, 127717, 133224, 146950, 158705, 188950, 190522, 193596, 197867, 243967, 248197, 248234, 305002, 309561, 312743, 347230, 386269, 404219, 415031, 416012, 467179, 471269, 472251, 472844, 478017, 480179, 491286, 562475, 565380, 593857] [ 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: Testing multi-threading over Zp using 1 threads [ Info: Testing multi-threading over QQ using 1 threads [ Info: Producing 15552 small random tests for groebner. This may take a minute 1796.612670 seconds (509.57 M allocations: 72.430 GiB, 2.99% gc time, 54.54% 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. 160.134618 seconds (80.44 M allocations: 6.471 GiB, 2.18% gc time, 89.22% compilation time) [ Info: Running isgroebner.jl 7.825213 seconds (17.65 M allocations: 649.190 MiB, 4.54% gc time, 65.17% compilation time) [ Info: Running normalform.jl [ Info: Producing 1728 tests for normal form. This may take a minute 24.578065 seconds (11.79 M allocations: 1.035 GiB, 1.47% gc time, 69.11% compilation time) [ Info: Running auxiliary.jl 64.353933 seconds (17.04 M allocations: 1.269 GiB, 0.93% gc time, 98.97% compilation time) [ Info: Running output_inferred.jl 1.064604 seconds (551.01 k allocations: 37.335 MiB, 3.40% gc time, 92.10% compilation time) [ Info: Running regressions.jl 25.710280 seconds (1.77 M allocations: 593.559 MiB, 1.06% gc time, 3.89% compilation time) [ Info: Running input_output/GroebnerDynamicPolynomialsExt.jl 54.572404 seconds (18.64 M allocations: 1.236 GiB, 2.19% gc time, 99.66% compilation time: <1% of which was recompilation) [ Info: Running input_output/Nemo.jl 101.420548 seconds (32.59 M allocations: 2.179 GiB, 1.20% gc time, 99.67% compilation time: <1% of which was recompilation) Test Summary: | Pass Total Time All tests | 51172 51172 37m54.2s arithmetic in Zp | 23939 23939 1.7s arithmetic in Zp x 4 | 2000 2000 0.5s CRT | 37 37 0.6s exponent vector | 131 131 0.7s packed exponent tuple-1 | 89 89 0.4s packed exponent tuple-2 | 96 96 0.3s packed exponent tuple-3 | 101 101 0.9s packed exponent tuple-4 | 95 95 0.5s monom arithmetic | 170 170 1.9s monom division mask | 96 96 0.6s monom hash linearity | 188 188 0.6s monom orders: Lex, DegLex, DegRevLex | 414 414 2.3s monoms, variable permutation | 72 72 4.7s monom orders: WeightedOrdering | 65 65 2.6s monom orders: ProductOrdering | 36 36 1.6s monom orders: MatrixOrdering | 13 13 1.2s groebner basic | 12 12 21.5s groebner low level | 41 41 2m09.9s groebner generic | 32 32 1m19.5s groebner reduced=false | 6 6 1.3s groebner ground fields | 176 176 1m19.5s groebner modular | 264 264 40.9s groebner output sorted | 15 15 0.1s monomial overflow | 32 32 6.3s groebner reduced=true | 3 3 2.4s groebner certify | 7 7 10.9s groebner orderings | 1850 1850 2m48.7s groebner parent rings | 12 12 13.9s groebner monoms | 24 24 14.1s groebner zeros | 12 12 0.0s isgroebner zeros | 15 15 3.5s normalform zeros | 15 15 1.9s normalform checks | 4 4 0.0s groebner arithmetic | 16 16 24.0s groebner linear algebra | 10 10 0.0s groebner modular-hard problems | 17 17 13.2s groebner strange example | 1 1 12m30.9s groebner many variables | 52 52 41.8s groebner large exponents | 142 142 4.0s homogenization, basic | 111 111 1m38.7s homogenization, orderings | 352 352 3m41.8s groebner, change matrix | 72 72 14.0s groebner, multi-threading, Zp | 24 24 8.5s groebner, multi-threading, QQ | 24 24 4.2s groebner random stress tests | 13944 13944 32.2s learn & apply, same field | 139 139 12.6s learn & apply, different fields | 461 461 39.0s learn & apply, generic | 1 1 0.1s learn & apply, orderings | 88 88 15.9s learn & apply, copy trace | 4 4 1.1s learn & apply, tricky | 31 31 6.5s learn & apply low level | 15 15 14.6s learn & apply, stress | None 13.9s learn & apply, in batches | 17 17 44.6s learn & apply low level, in batches | 7 7 11.2s isgroebner | 22 22 4.1s isgroebner orderings | 5 5 2.2s isgroebner certify | 68 68 0.3s normalform | 19 19 1.2s normalform many variables | 6 6 5.4s normalform orderings | 4 4 2.2s normalform of an array | 24 24 0.4s normalform random stress tests | 4878 4878 14.7s leading term | 8 8 2.7s leading ideal | 8 8 34.0s quotient basis | 17 17 17.1s dimension | 8 8 9.2s 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 24.9s DynamicPolynomials.jl input-output | 44 44 35.2s Nemo.jl, univariate | 25 25 12.8s Nemo.jl, generic | 6 6 53.3s Nemo.jl, input-output | 418 418 31.0s 2274.556665 seconds (705.77 M allocations: 86.905 GiB, 2.71% gc time, 61.35% compilation time: <1% of which was recompilation) Testing Groebner tests passed Testing completed after 2284.08s PkgEval succeeded after 2391.26s