==>(B Building on scovillain(B ==>(B Checking for remote environment...(B ==>(B Syncing package to remote host...(B sending incremental file list ./ .SRCINFO 1,125 100% 0.00kB/s 0:00:00 1,125 100% 0.00kB/s 0:00:00 (xfr#1, to-chk=7/9) .nvchecker.toml 59 100% 57.62kB/s 0:00:00 59 100% 57.62kB/s 0:00:00 (xfr#2, to-chk=6/9) LICENSE 646 100% 630.86kB/s 0:00:00 646 100% 630.86kB/s 0:00:00 (xfr#3, to-chk=5/9) PKGBUILD 2,100 98% 2.00MB/s 0:00:00 2,140 100% 2.04MB/s 0:00:00 (xfr#4, to-chk=4/9) REUSE.toml 375 100% 366.21kB/s 0:00:00 375 100% 366.21kB/s 0:00:00 (xfr#5, to-chk=3/9) haskell-arithmoi-0.13.4.0-11.log 709 100% 692.38kB/s 0:00:00 709 100% 692.38kB/s 0:00:00 (xfr#6, to-chk=2/9) LICENSES/ sent 2,027 bytes received 198 bytes 890.00 bytes/sec total size is 4,564 speedup is 2.05 ==>(B Patching arch to riscv64...(B ==>(B Running pkgctl build --arch riscv64 on remote host...(B ==> WARNING:(B invalid architecture: riscv64(B ==>(B Updating pacman database cache(B [?25l:: Synchronizing package databases... core downloading... extra downloading... multilib downloading... [?25h==>(B Building haskell-arithmoi(B  ->(B repo: extra(B  ->(B arch: riscv64(B  ->(B worker: felix-7(B ==>(B Building haskell-arithmoi for [extra] (riscv64)(B ]3008;start=1fa1e8635b134c7a822f89076e6f6626;user=root;hostname=scovillain.felixc.at;machineid=5bc7e45048834d3a82e1c93a2f026cc1;bootid=d1b30214c58a4fdfae67c4788aad73d5;pid=1166618;comm=systemd-nspawn;container=arch-nspawn-1166618;type=container\]11;?\]2;🔵 Container arch-nspawn-1166618 on scovillain.felixc.at\[?25l:: Synchronizing package databases... core downloading... extra downloading... :: Starting full system upgrade... there is nothing to do [?25h[!p]104\[?7h]3008;end=1fa1e8635b134c7a822f89076e6f6626\==>(B Building in chroot for [extra] (riscv64)...(B ==>(B Synchronizing chroot copy [/var/lib/archbuild/extra-riscv64/root] -> [felix-7]...(Bdone(B ==>(B Making package: haskell-arithmoi 0.13.4.0-11 (Tue Sep 8 21:12:44 2026)(B ==>(B Retrieving sources...(B  ->(B Downloading arithmoi-0.13.4.0.tar.gz...(B % Total % Received % Xferd Average Speed Time Time Time Current Dload Upload Total Spent Left Speed 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 100 188.3k 100 188.3k 0 0 161.7k 0 00:01 00:01 0 100 188.3k 100 188.3k 0 0 161.6k 0 00:01 00:01 0 100 188.3k 100 188.3k 0 0 161.6k 0 00:01 00:01 0 ==>(B Validating source files with sha512sums...(B arithmoi-0.13.4.0.tar.gz ... Passed ]3008;start=08c3ef5f444b45bc8925e0fb9f98150f;user=root;hostname=scovillain.felixc.at;machineid=5bc7e45048834d3a82e1c93a2f026cc1;bootid=d1b30214c58a4fdfae67c4788aad73d5;pid=1174718;comm=systemd-nspawn;container=arch-nspawn-1174718;type=container\]11;?\]2;🔵 Container arch-nspawn-1174718 on scovillain.felixc.at\]3008;start=c571893e7f804669b5fc6efbb939fe22;user=root;hostname=arch-nspawn-1174718;machineid=f7ddc4a20a754cfcac5123f2ba16e0f3;bootid=df4bcbf36eb34158b6a66c2e89e69146;pid=14;comm=sudo;targetuser=builduser;type=session\==>(B Making package: haskell-arithmoi 0.13.4.0-11 (Tue Sep 8 21:13:33 2026)(B ==>(B Checking runtime dependencies...(B ==>(B Installing missing dependencies...(B ]3008;start=8828b9b9ecd346cfbe52f3143ee5cce7;user=builduser;hostname=arch-nspawn-1174718;machineid=f7ddc4a20a754cfcac5123f2ba16e0f3;bootid=df4bcbf36eb34158b6a66c2e89e69146;pid=1416;comm=sudo;targetuser=root;type=session\[?25lresolving dependencies... looking for conflicting packages... warning: insufficient columns available for table display Packages (46) haskell-adjunctions-4.4.4-49 haskell-ansi-terminal-1.1-96.1 haskell-ansi-terminal-types-1.1-97.1 haskell-assoc-1.1.1-40 haskell-base-orphans-0.9.4-39.1 haskell-bifunctors-5.6.3-45 haskell-boring-0.2.2-2 haskell-colour-2.3.7-63.1 haskell-comonad-5.0.10-33 haskell-contravariant-1.5.5-6 haskell-distributive-0.6.3-47.1 haskell-foldable1-classes-compat-0.1.3-31 haskell-free-5.2-172 haskell-hashable-1.4.7.0-120.1 haskell-indexed-traversable-0.1.4-190 haskell-numtype-dk-0.5.0.3-5 haskell-optparse-applicative-0.18.1.0-431.3 haskell-os-string-2.0.11-45.1 haskell-prettyprinter-1.7.2-20.1 haskell-prettyprinter-ansi-terminal-1.1.4-95.2 haskell-primitive-0.9.1.0-209.1 haskell-profunctors-5.6.3-130 haskell-semigroupoids-6.0.2-51 haskell-splitmix-0.1.3.1-26.1 haskell-statevar-1.2.2-5 haskell-tagged-0.8.9-3 haskell-tasty-1.5.4-22.3 haskell-th-abstraction-0.6.0.0-1 haskell-transformers-base-0.4.6.1-94.1 haskell-transformers-compat-0.7.2-4 haskell-unordered-containers-0.2.21-26.2 haskell-vector-stream-0.1.0.1-4 haskell-void-0.7.4-71.1 numactl-2.0.19-1.1 ghc-libs-9.6.7.20250817-1 haskell-bitvec-1.1.6.0-15 haskell-chimera-0.4.2.0-4 haskell-constraints-0.14.4-20.1 haskell-exact-pi-0.5.1.0-22 haskell-infinite-list-0.1.3-49 haskell-integer-logarithms-1.0.4-240.1 haskell-integer-roots-1.0.4.0-47 haskell-mod-0.2.2.0-8 haskell-random-1.2.1.3-319.2 haskell-semirings-0.7-113 haskell-vector-0.13.2.0-541.5 Total Download Size: 1.06 MiB Total Installed Size: 189.02 MiB :: Proceed with installation? [Y/n] :: Retrieving packages... haskell-bitvec-1.1.6.0-15-riscv64 downloading... haskell-semirings-0.7-113-riscv64 downloading... haskell-chimera-0.4.2.0-4-riscv64 downloading... haskell-integer-roots-1.0.4.0-47-riscv64 downloading... haskell-mod-0.2.2.0-8-riscv64 downloading... haskell-infinite-list-0.1.3-49-riscv64 downloading... haskell-exact-pi-0.5.1.0-22-riscv64 downloading... checking keyring... checking package integrity... loading package files... checking for file conflicts... :: Processing package changes... installing numactl... installing ghc-libs... installing haskell-primitive... installing haskell-splitmix... installing haskell-random... installing haskell-colour... installing haskell-ansi-terminal-types... installing haskell-ansi-terminal... installing haskell-prettyprinter... installing haskell-prettyprinter-ansi-terminal... installing haskell-transformers-compat... installing haskell-optparse-applicative... installing haskell-tagged... installing haskell-tasty... installing haskell-vector-stream... installing haskell-vector... installing haskell-bitvec... installing haskell-distributive... installing haskell-foldable1-classes-compat... installing haskell-indexed-traversable... installing haskell-comonad... installing haskell-base-orphans... installing haskell-assoc... installing haskell-th-abstraction... installing haskell-bifunctors... installing haskell-statevar... installing haskell-contravariant... installing haskell-profunctors... installing haskell-os-string... installing haskell-hashable... installing haskell-unordered-containers... installing haskell-semigroupoids... installing haskell-transformers-base... installing haskell-free... installing haskell-void... installing haskell-adjunctions... installing haskell-infinite-list... installing haskell-chimera... installing haskell-boring... installing haskell-constraints... installing haskell-numtype-dk... installing haskell-exact-pi... installing haskell-integer-logarithms... installing haskell-integer-roots... installing haskell-semirings... installing haskell-mod... :: Running post-transaction hooks... (1/2) Arming ConditionNeedsUpdate... (2/2) Registering Haskell modules... [?25h]3008;end=8828b9b9ecd346cfbe52f3143ee5cce7\==>(B Checking buildtime dependencies...(B ==>(B Installing missing dependencies...(B ]3008;start=2f610f746ac34f4c8c3be5aea3ae30ea;user=builduser;hostname=arch-nspawn-1174718;machineid=f7ddc4a20a754cfcac5123f2ba16e0f3;bootid=df4bcbf36eb34158b6a66c2e89e69146;pid=1824;comm=sudo;targetuser=root;type=session\[?25lresolving dependencies... looking for conflicting packages... warning: insufficient columns available for table display Packages (34) haskell-aeson-2.2.2.0-36 haskell-call-stack-0.4.0-479.1 haskell-character-ps-0.1-1 haskell-data-fix-0.3.4-241.1 haskell-dlist-1.0-463.1 haskell-erf-2.0.0.0-27 haskell-generically-0.1.1-136 haskell-indexed-traversable-instances-0.1.2.1-36 haskell-integer-conversion-0.1.1-102 haskell-logict-0.8.2.0-132.1 haskell-network-uri-2.6.4.2-182 haskell-onetuple-0.4.3-18.1 haskell-primitive-addr-0.1.0.3-95 haskell-quickcheck-classes-base-0.6.2.0-707.2 haskell-scientific-0.3.8.1-127.1 haskell-semialign-1.3.1.1-30 haskell-split-0.2.5.1-3.1 haskell-strict-0.5.1-134.1 haskell-text-iso8601-0.1.1.2-4 haskell-text-short-0.1.6.1-82.2 haskell-th-compat-0.1.7-45 haskell-these-1.2.1-344.1 haskell-time-compat-1.9.9-114.2 haskell-uuid-types-1.0.6.1-83.3 haskell-witherable-0.5-7 ghc-9.6.7.20250817-1 haskell-quickcheck-2.15.0.1-232.2 haskell-quickcheck-classes-0.6.5.0-400 haskell-smallcheck-1.2.2-10.1 haskell-tasty-hunit-0.10.2-308.2 haskell-tasty-quickcheck-0.11.1-237.5 haskell-tasty-rerun-1.1.20-86 haskell-tasty-smallcheck-0.8.2-1048.4 uusi-0.4.4.0-39.1 Total Download Size: 0.69 MiB Total Installed Size: 318.14 MiB :: Proceed with installation? [Y/n] :: Retrieving packages... haskell-quickcheck-classes-base-0.6.2.0-707.2-riscv64 downloading... haskell-smallcheck-1.2.2-10.1-riscv64 downloading... haskell-logict-0.8.2.0-132.1-riscv64 downloading... haskell-quickcheck-classes-0.6.5.0-400-riscv64 downloading... haskell-tasty-rerun-1.1.20-86-riscv64 downloading... haskell-tasty-smallcheck-0.8.2-1048.4-riscv64 downloading... haskell-primitive-addr-0.1.0.3-95-riscv64 downloading... checking keyring... checking package integrity... loading package files... checking for file conflicts... :: Processing package changes... installing ghc... installing uusi... installing haskell-erf... installing haskell-quickcheck... installing haskell-character-ps... installing haskell-data-fix... installing haskell-dlist... installing haskell-generically... installing haskell-integer-conversion... installing haskell-th-compat... installing haskell-network-uri... installing haskell-onetuple... installing haskell-scientific... installing haskell-indexed-traversable-instances... installing haskell-these... installing haskell-semialign... installing haskell-strict... installing haskell-time-compat... installing haskell-text-iso8601... installing haskell-text-short... installing haskell-uuid-types... installing haskell-witherable... installing haskell-aeson... installing haskell-primitive-addr... installing haskell-quickcheck-classes-base... installing haskell-quickcheck-classes... installing haskell-logict... installing haskell-smallcheck... installing haskell-call-stack... installing haskell-tasty-hunit... installing haskell-tasty-quickcheck... installing haskell-split... installing haskell-tasty-rerun... installing haskell-tasty-smallcheck... :: Running post-transaction hooks... (1/2) Arming ConditionNeedsUpdate... (2/2) Registering Haskell modules... [?25h]3008;end=2f610f746ac34f4c8c3be5aea3ae30ea\==>(B Retrieving sources...(B  ->(B Found arithmoi-0.13.4.0.tar.gz(B ==> WARNING:(B Skipping all source file integrity checks.(B ==>(B Extracting sources...(B  ->(B Extracting arithmoi-0.13.4.0.tar.gz with bsdtar(B ==>(B Starting prepare()...(B Write file: /build/haskell-arithmoi/src/arithmoi-0.13.4.0/Setup.hs ==>(B Starting build()...(B Configuring arithmoi-0.13.4.0... Preprocessing library for arithmoi-0.13.4.0.. Building library for arithmoi-0.13.4.0.. [ 1 of 56] Compiling Math.NumberTheory.Euclidean.Coprimes ( Math/NumberTheory/Euclidean/Coprimes.hs, dist/build/Math/NumberTheory/Euclidean/Coprimes.dyn_o ) [ 2 of 56] Compiling Math.NumberTheory.Moduli.SomeMod ( Math/NumberTheory/Moduli/SomeMod.hs, dist/build/Math/NumberTheory/Moduli/SomeMod.dyn_o ) [ 3 of 56] Compiling Math.NumberTheory.Moduli.Chinese ( Math/NumberTheory/Moduli/Chinese.hs, dist/build/Math/NumberTheory/Moduli/Chinese.dyn_o ) [ 4 of 56] Compiling Math.NumberTheory.Primes.Counting.Approximate ( Math/NumberTheory/Primes/Counting/Approximate.hs, dist/build/Math/NumberTheory/Primes/Counting/Approximate.dyn_o ) [ 5 of 56] Compiling Math.NumberTheory.Primes.Sieve.Indexing ( Math/NumberTheory/Primes/Sieve/Indexing.hs, dist/build/Math/NumberTheory/Primes/Sieve/Indexing.dyn_o ) [ 6 of 56] Compiling Math.NumberTheory.Primes.Small ( Math/NumberTheory/Primes/Small.hs, dist/build/Math/NumberTheory/Primes/Small.dyn_o ) [ 7 of 56] Compiling Math.NumberTheory.Recurrences.Pentagonal ( Math/NumberTheory/Recurrences/Pentagonal.hs, dist/build/Math/NumberTheory/Recurrences/Pentagonal.dyn_o ) [ 8 of 56] Compiling Math.NumberTheory.RootsOfUnity ( Math/NumberTheory/RootsOfUnity.hs, dist/build/Math/NumberTheory/RootsOfUnity.dyn_o ) [ 9 of 56] Compiling Math.NumberTheory.SmoothNumbers ( Math/NumberTheory/SmoothNumbers.hs, dist/build/Math/NumberTheory/SmoothNumbers.dyn_o ) [10 of 56] Compiling Math.NumberTheory.Utils.DirichletSeries ( Math/NumberTheory/Utils/DirichletSeries.hs, dist/build/Math/NumberTheory/Utils/DirichletSeries.dyn_o ) [11 of 56] Compiling Math.NumberTheory.Utils.FromIntegral ( Math/NumberTheory/Utils/FromIntegral.hs, dist/build/Math/NumberTheory/Utils/FromIntegral.dyn_o ) [12 of 56] Compiling Math.NumberTheory.Utils ( Math/NumberTheory/Utils.hs, dist/build/Math/NumberTheory/Utils.dyn_o ) [13 of 56] Compiling Math.NumberTheory.Moduli.JacobiSymbol ( Math/NumberTheory/Moduli/JacobiSymbol.hs, dist/build/Math/NumberTheory/Moduli/JacobiSymbol.dyn_o ) [14 of 56] Compiling Math.NumberTheory.Primes.Testing.Probabilistic ( Math/NumberTheory/Primes/Testing/Probabilistic.hs, dist/build/Math/NumberTheory/Primes/Testing/Probabilistic.dyn_o ) [15 of 56] Compiling Math.NumberTheory.Curves.Montgomery ( Math/NumberTheory/Curves/Montgomery.hs, dist/build/Math/NumberTheory/Curves/Montgomery.dyn_o ) [16 of 56] Compiling Math.NumberTheory.Primes.Types ( Math/NumberTheory/Primes/Types.hs, dist/build/Math/NumberTheory/Primes/Types.dyn_o ) [17 of 56] Compiling Math.NumberTheory.Primes.Sieve.Eratosthenes ( Math/NumberTheory/Primes/Sieve/Eratosthenes.hs, dist/build/Math/NumberTheory/Primes/Sieve/Eratosthenes.dyn_o ) [18 of 56] Compiling Math.NumberTheory.Primes.Factorisation.TrialDivision ( Math/NumberTheory/Primes/Factorisation/TrialDivision.hs, dist/build/Math/NumberTheory/Primes/Factorisation/TrialDivision.dyn_o ) [19 of 56] Compiling Math.NumberTheory.Primes.IntSet ( Math/NumberTheory/Primes/IntSet.hs, dist/build/Math/NumberTheory/Primes/IntSet.dyn_o ) [20 of 56] Compiling Math.NumberTheory.Primes.Factorisation.Montgomery ( Math/NumberTheory/Primes/Factorisation/Montgomery.hs, dist/build/Math/NumberTheory/Primes/Factorisation/Montgomery.dyn_o ) [21 of 56] Compiling Math.NumberTheory.Primes.Counting.Impl ( Math/NumberTheory/Primes/Counting/Impl.hs, dist/build/Math/NumberTheory/Primes/Counting/Impl.dyn_o ) [22 of 56] Compiling Math.NumberTheory.Primes.Counting ( Math/NumberTheory/Primes/Counting.hs, dist/build/Math/NumberTheory/Primes/Counting.dyn_o ) [23 of 56] Compiling Math.NumberTheory.Primes ( Math/NumberTheory/Primes.hs, dist/build/Math/NumberTheory/Primes.dyn_o ) [24 of 56] Compiling Math.NumberTheory.Recurrences.Linear ( Math/NumberTheory/Recurrences/Linear.hs, dist/build/Math/NumberTheory/Recurrences/Linear.dyn_o ) [25 of 56] Compiling Math.NumberTheory.Recurrences.Bilinear ( Math/NumberTheory/Recurrences/Bilinear.hs, dist/build/Math/NumberTheory/Recurrences/Bilinear.dyn_o ) [26 of 56] Compiling Math.NumberTheory.Recurrences ( Math/NumberTheory/Recurrences.hs, dist/build/Math/NumberTheory/Recurrences.dyn_o ) [27 of 56] Compiling Math.NumberTheory.Primes.Testing.Certified ( Math/NumberTheory/Primes/Testing/Certified.hs, dist/build/Math/NumberTheory/Primes/Testing/Certified.dyn_o ) [28 of 56] Compiling Math.NumberTheory.Primes.Testing ( Math/NumberTheory/Primes/Testing.hs, dist/build/Math/NumberTheory/Primes/Testing.dyn_o ) [29 of 56] Compiling Math.NumberTheory.Prefactored ( Math/NumberTheory/Prefactored.hs, dist/build/Math/NumberTheory/Prefactored.dyn_o ) [30 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Class ( Math/NumberTheory/ArithmeticFunctions/Class.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Class.dyn_o ) [31 of 56] Compiling Math.NumberTheory.MoebiusInversion ( Math/NumberTheory/MoebiusInversion.hs, dist/build/Math/NumberTheory/MoebiusInversion.dyn_o ) [32 of 56] Compiling Math.NumberTheory.Moduli.Singleton ( Math/NumberTheory/Moduli/Singleton.hs, dist/build/Math/NumberTheory/Moduli/Singleton.dyn_o ) [33 of 56] Compiling Math.NumberTheory.Moduli.Sqrt ( Math/NumberTheory/Moduli/Sqrt.hs, dist/build/Math/NumberTheory/Moduli/Sqrt.dyn_o ) [34 of 56] Compiling Math.NumberTheory.Quadratic.GaussianIntegers ( Math/NumberTheory/Quadratic/GaussianIntegers.hs, dist/build/Math/NumberTheory/Quadratic/GaussianIntegers.dyn_o ) [35 of 56] Compiling Math.NumberTheory.Quadratic.EisensteinIntegers ( Math/NumberTheory/Quadratic/EisensteinIntegers.hs, dist/build/Math/NumberTheory/Quadratic/EisensteinIntegers.dyn_o ) [36 of 56] Compiling Math.NumberTheory.Moduli.Equations ( Math/NumberTheory/Moduli/Equations.hs, dist/build/Math/NumberTheory/Moduli/Equations.dyn_o ) [37 of 56] Compiling Math.NumberTheory.Moduli.Internal ( Math/NumberTheory/Moduli/Internal.hs, dist/build/Math/NumberTheory/Moduli/Internal.dyn_o ) [38 of 56] Compiling Math.NumberTheory.Moduli.Multiplicative ( Math/NumberTheory/Moduli/Multiplicative.hs, dist/build/Math/NumberTheory/Moduli/Multiplicative.dyn_o ) [39 of 56] Compiling Math.NumberTheory.Moduli.Class ( Math/NumberTheory/Moduli/Class.hs, dist/build/Math/NumberTheory/Moduli/Class.dyn_o ) [40 of 56] Compiling Math.NumberTheory.Moduli ( Math/NumberTheory/Moduli.hs, dist/build/Math/NumberTheory/Moduli.dyn_o ) [41 of 56] Compiling Math.NumberTheory.Moduli.Cbrt ( Math/NumberTheory/Moduli/Cbrt.hs, dist/build/Math/NumberTheory/Moduli/Cbrt.dyn_o ) [42 of 56] Compiling Math.NumberTheory.Diophantine ( Math/NumberTheory/Diophantine.hs, dist/build/Math/NumberTheory/Diophantine.dyn_o ) [43 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.NFreedom ( Math/NumberTheory/ArithmeticFunctions/NFreedom.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/NFreedom.dyn_o ) [44 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Moebius ( Math/NumberTheory/ArithmeticFunctions/Moebius.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Moebius.dyn_o ) [45 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Standard ( Math/NumberTheory/ArithmeticFunctions/Standard.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Standard.dyn_o ) [46 of 56] Compiling Math.NumberTheory.ArithmeticFunctions ( Math/NumberTheory/ArithmeticFunctions.hs, dist/build/Math/NumberTheory/ArithmeticFunctions.dyn_o ) [47 of 56] Compiling Math.NumberTheory.DirichletCharacters ( Math/NumberTheory/DirichletCharacters.hs, dist/build/Math/NumberTheory/DirichletCharacters.dyn_o ) [48 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.SieveBlock ( Math/NumberTheory/ArithmeticFunctions/SieveBlock.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/SieveBlock.dyn_o ) [49 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Mertens ( Math/NumberTheory/ArithmeticFunctions/Mertens.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Mertens.dyn_o ) [50 of 56] Compiling Math.NumberTheory.ArithmeticFunctions.Inverse ( Math/NumberTheory/ArithmeticFunctions/Inverse.hs, dist/build/Math/NumberTheory/ArithmeticFunctions/Inverse.dyn_o ) [51 of 56] Compiling Math.NumberTheory.Utils.Hyperbola ( Math/NumberTheory/Utils/Hyperbola.hs, dist/build/Math/NumberTheory/Utils/Hyperbola.dyn_o ) [52 of 56] Compiling Math.NumberTheory.Zeta.Utils ( Math/NumberTheory/Zeta/Utils.hs, dist/build/Math/NumberTheory/Zeta/Utils.dyn_o ) [53 of 56] Compiling Math.NumberTheory.Zeta.Hurwitz ( Math/NumberTheory/Zeta/Hurwitz.hs, dist/build/Math/NumberTheory/Zeta/Hurwitz.dyn_o ) [54 of 56] Compiling Math.NumberTheory.Zeta.Riemann ( Math/NumberTheory/Zeta/Riemann.hs, dist/build/Math/NumberTheory/Zeta/Riemann.dyn_o ) [55 of 56] Compiling Math.NumberTheory.Zeta.Dirichlet ( Math/NumberTheory/Zeta/Dirichlet.hs, dist/build/Math/NumberTheory/Zeta/Dirichlet.dyn_o ) [56 of 56] Compiling Math.NumberTheory.Zeta ( Math/NumberTheory/Zeta.hs, dist/build/Math/NumberTheory/Zeta.dyn_o ) Preprocessing test suite 'arithmoi-tests' for arithmoi-0.13.4.0.. Building test suite 'arithmoi-tests' for arithmoi-0.13.4.0.. [ 1 of 39] Compiling Math.NumberTheory.ArithmeticFunctions.SieveBlockTests ( test-suite/Math/NumberTheory/ArithmeticFunctions/SieveBlockTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/ArithmeticFunctions/SieveBlockTests.dyn_o ) [ 2 of 39] Compiling Math.NumberTheory.TestUtils.MyCompose ( test-suite/Math/NumberTheory/TestUtils/MyCompose.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/TestUtils/MyCompose.dyn_o ) [ 3 of 39] Compiling Math.NumberTheory.TestUtils.Wrappers ( test-suite/Math/NumberTheory/TestUtils/Wrappers.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/TestUtils/Wrappers.dyn_o ) [ 4 of 39] Compiling Math.NumberTheory.TestUtils ( test-suite/Math/NumberTheory/TestUtils.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/TestUtils.dyn_o ) [ 5 of 39] Compiling Math.NumberTheory.SmoothNumbersTests ( test-suite/Math/NumberTheory/SmoothNumbersTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/SmoothNumbersTests.dyn_o ) [ 6 of 39] Compiling Math.NumberTheory.RootsOfUnityTests ( test-suite/Math/NumberTheory/RootsOfUnityTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/RootsOfUnityTests.dyn_o ) [ 7 of 39] Compiling Math.NumberTheory.Recurrences.PentagonalTests ( test-suite/Math/NumberTheory/Recurrences/PentagonalTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Recurrences/PentagonalTests.dyn_o ) [ 8 of 39] Compiling Math.NumberTheory.Recurrences.LinearTests ( test-suite/Math/NumberTheory/Recurrences/LinearTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Recurrences/LinearTests.dyn_o ) [ 9 of 39] Compiling Math.NumberTheory.Recurrences.BilinearTests ( test-suite/Math/NumberTheory/Recurrences/BilinearTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Recurrences/BilinearTests.dyn_o ) [10 of 39] Compiling Math.NumberTheory.PrimesTests ( test-suite/Math/NumberTheory/PrimesTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/PrimesTests.dyn_o ) [11 of 39] Compiling Math.NumberTheory.Primes.TestingTests ( test-suite/Math/NumberTheory/Primes/TestingTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/TestingTests.dyn_o ) [12 of 39] Compiling Math.NumberTheory.Primes.SieveTests ( test-suite/Math/NumberTheory/Primes/SieveTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/SieveTests.dyn_o ) [13 of 39] Compiling Math.NumberTheory.Primes.SequenceTests ( test-suite/Math/NumberTheory/Primes/SequenceTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/SequenceTests.dyn_o ) [14 of 39] Compiling Math.NumberTheory.Primes.FactorisationTests ( test-suite/Math/NumberTheory/Primes/FactorisationTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/FactorisationTests.dyn_o ) [15 of 39] Compiling Math.NumberTheory.Primes.CountingTests ( test-suite/Math/NumberTheory/Primes/CountingTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Primes/CountingTests.dyn_o ) [16 of 39] Compiling Math.NumberTheory.PrefactoredTests ( test-suite/Math/NumberTheory/PrefactoredTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/PrefactoredTests.dyn_o ) [17 of 39] Compiling Math.NumberTheory.MoebiusInversionTests ( test-suite/Math/NumberTheory/MoebiusInversionTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/MoebiusInversionTests.dyn_o ) [18 of 39] Compiling Math.NumberTheory.Moduli.SqrtTests ( test-suite/Math/NumberTheory/Moduli/SqrtTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/SqrtTests.dyn_o ) [19 of 39] Compiling Math.NumberTheory.Moduli.SingletonTests ( test-suite/Math/NumberTheory/Moduli/SingletonTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/SingletonTests.dyn_o ) [20 of 39] Compiling Math.NumberTheory.Moduli.PrimitiveRootTests ( test-suite/Math/NumberTheory/Moduli/PrimitiveRootTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/PrimitiveRootTests.dyn_o ) [21 of 39] Compiling Math.NumberTheory.Moduli.JacobiTests ( test-suite/Math/NumberTheory/Moduli/JacobiTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/JacobiTests.dyn_o ) [22 of 39] Compiling Math.NumberTheory.Moduli.EquationsTests ( test-suite/Math/NumberTheory/Moduli/EquationsTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/EquationsTests.dyn_o ) [23 of 39] Compiling Math.NumberTheory.Moduli.DiscreteLogarithmTests ( test-suite/Math/NumberTheory/Moduli/DiscreteLogarithmTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/DiscreteLogarithmTests.dyn_o ) [24 of 39] Compiling Math.NumberTheory.Moduli.ClassTests ( test-suite/Math/NumberTheory/Moduli/ClassTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/ClassTests.dyn_o ) [25 of 39] Compiling Math.NumberTheory.Moduli.ChineseTests ( test-suite/Math/NumberTheory/Moduli/ChineseTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/ChineseTests.dyn_o ) [26 of 39] Compiling Math.NumberTheory.Moduli.CbrtTests ( test-suite/Math/NumberTheory/Moduli/CbrtTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Moduli/CbrtTests.dyn_o ) [27 of 39] Compiling Math.NumberTheory.GaussianIntegersTests ( test-suite/Math/NumberTheory/GaussianIntegersTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/GaussianIntegersTests.dyn_o ) [28 of 39] Compiling Math.NumberTheory.EuclideanTests ( test-suite/Math/NumberTheory/EuclideanTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/EuclideanTests.dyn_o ) [29 of 39] Compiling Math.NumberTheory.EisensteinIntegersTests ( test-suite/Math/NumberTheory/EisensteinIntegersTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/EisensteinIntegersTests.dyn_o ) [30 of 39] Compiling Math.NumberTheory.DirichletCharactersTests ( test-suite/Math/NumberTheory/DirichletCharactersTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/DirichletCharactersTests.dyn_o ) [31 of 39] Compiling Math.NumberTheory.DiophantineTests ( test-suite/Math/NumberTheory/DiophantineTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/DiophantineTests.dyn_o ) [32 of 39] Compiling Math.NumberTheory.CurvesTests ( test-suite/Math/NumberTheory/CurvesTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/CurvesTests.dyn_o ) [33 of 39] Compiling Math.NumberTheory.ArithmeticFunctionsTests ( test-suite/Math/NumberTheory/ArithmeticFunctionsTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/ArithmeticFunctionsTests.dyn_o ) [34 of 39] Compiling Math.NumberTheory.ArithmeticFunctions.MertensTests ( test-suite/Math/NumberTheory/ArithmeticFunctions/MertensTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/ArithmeticFunctions/MertensTests.dyn_o ) [35 of 39] Compiling Math.NumberTheory.ArithmeticFunctions.InverseTests ( test-suite/Math/NumberTheory/ArithmeticFunctions/InverseTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/ArithmeticFunctions/InverseTests.dyn_o ) [36 of 39] Compiling Math.NumberTheory.UniqueFactorisationTests ( test-suite/Math/NumberTheory/UniqueFactorisationTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/UniqueFactorisationTests.dyn_o ) [37 of 39] Compiling Math.NumberTheory.Zeta.DirichletTests ( test-suite/Math/NumberTheory/Zeta/DirichletTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Zeta/DirichletTests.dyn_o ) [38 of 39] Compiling Math.NumberTheory.Zeta.RiemannTests ( test-suite/Math/NumberTheory/Zeta/RiemannTests.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Math/NumberTheory/Zeta/RiemannTests.dyn_o ) [39 of 39] Compiling Main ( test-suite/Test.hs, dist/build/arithmoi-tests/arithmoi-tests-tmp/Main.dyn_o ) [40 of 40] Linking dist/build/arithmoi-tests/arithmoi-tests Unregistering arithmoi-0.13.4.0... ==>(B Starting check()...(B Running 1 test suites... Test suite arithmoi-tests: RUNNING... 78All Euclidean coprime smallcheck Int: OK (1.27s) 121 tests completed smallcheck Word: OK (0.22s) 36 tests completed smallcheck Integer: OK (1.11s) 121 tests completed smallcheck Natural: OK (0.56s) 36 tests completed quickcheck Int: OK (2.65s) +++ OK, passed 100 tests. quickcheck Word: OK (1.17s) +++ OK, passed 100 tests. quickcheck Integer: OK (2.20s) +++ OK, passed 100 tests. quickcheck Natural: OK (1.54s) +++ OK, passed 100 tests. quickcheck Large Int: OK (1.11s) +++ OK, passed 100 tests. quickcheck Large Word: OK (2.72s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (6.71s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (6.75s) +++ OK, passed 100 tests. splitIntoCoprimes preserves product of factors Natural smallcheck: OK (6.35s) 229 tests completed quickcheck: OK (6.14s) +++ OK, passed 100 tests. Integer smallcheck: OK (12.44s) 862 tests completed quickcheck: OK (7.22s) +++ OK, passed 100 tests. Gaussian smallcheck: OK (62.43s) 2776 tests completed quickcheck: OK (42.14s) +++ OK, passed 100 tests. number of factors is non-decreasing Natural smallcheck: OK (2.58s) 82 tests completed quickcheck: OK (7.27s) +++ OK, passed 100 tests. Integer smallcheck: OK (6.92s) 451 tests completed quickcheck: OK (9.19s) +++ OK, passed 100 tests. Gaussian smallcheck: OK (41.51s) 1225 tests completed quickcheck: OK (41.43s) +++ OK, passed 100 tests. output factors are coprime Natural smallcheck: OK (2.79s) 229 tests completed quickcheck: OK (6.74s) +++ OK, passed 100 tests. Integer smallcheck: OK (36.76s) 862 tests completed quickcheck: OK (6.57s) +++ OK, passed 100 tests. Gaussian smallcheck: OK (62.22s) 2776 tests completed quickcheck: OK (42.83s) +++ OK, passed 100 tests. does not freeze case 1: OK (0.22s) case 2: OK (0.22s) Natural smallcheck: OK (41.10s) 1313 tests completed quickcheck: OK (6.23s) +++ OK, passed 100 tests. Integer: OK (7.16s) +++ OK, passed 100 tests. Gaussian: OK (41.62s) +++ OK, passed 100 tests. output factors are non-unit Natural smallcheck: OK (41.62s) 1313 tests completed quickcheck: OK (7.20s) +++ OK, passed 100 tests. Integer: OK (7.20s) +++ OK, passed 100 tests. Gaussian: OK (41.24s) +++ OK, passed 100 tests. Coprimes test equality: OK (0.22s) test union: OK (0.51s) test insert with coprime base: OK (0.32s) test insert with non-coprime base: OK (0.27s) property union Natural smallcheck: OK (96.38s) 52441 tests completed quickcheck: OK (7.53s) +++ OK, passed 100 tests. Integer: OK (35.35s) +++ OK, passed 100 tests. Recurrences Pentagonal partition matches definition smallcheck: OK (2.25s) 5 tests completed quickcheck: OK (2.85s) +++ OK, passed 100 tests. mod n smallcheck: OK (2.57s) 30 tests completed quickcheck: OK (2.86s) +++ OK, passed 100 tests. first 20 elements of partition are correct: OK (1.98s) Generalized pentagonal numbers matches definition smallcheck: OK (0.26s) 11 tests completed quickcheck: OK (2.17s) +++ OK, passed 100 tests. Linear fibonacci matches definition smallcheck: OK (0.34s) 11 tests completed quickcheck: OK (2.47s) +++ OK, passed 100 tests. negative indices smallcheck: OK (0.34s) 6 tests completed quickcheck: OK (1.56s) +++ OK, passed 100 tests. pair smallcheck: OK (0.23s) 11 tests completed quickcheck: OK (1.44s) +++ OK, passed 100 tests. fibonacci 0: OK fibonacci 1: OK (0.21s) lucas matches definition smallcheck: OK (0.21s) 11 tests completed quickcheck: OK (2.70s) +++ OK, passed 100 tests. negative indices smallcheck: OK (0.33s) 6 tests completed quickcheck: OK (0.95s) +++ OK, passed 100 tests. pair smallcheck: OK (0.43s) 11 tests completed quickcheck: OK (1.18s) +++ OK, passed 100 tests. lucas 0: OK lucas 1: OK generalLucas matches definition smallcheck: OK (2.64s) 726 tests completed quickcheck: OK (2.47s) +++ OK, passed 100 tests. generalLucas 1 (-1) smallcheck: OK (0.20s) 6 tests completed quickcheck: OK (1.69s) +++ OK, passed 100 tests. generalLucas _ _ 0 smallcheck: OK (0.46s) 121 tests completed quickcheck: OK (1.53s) +++ OK, passed 100 tests. factorial factorise . factorial = factorialFactors smallcheck: OK (0.24s) 6 tests completed quickcheck: OK (2.92s) +++ OK, passed 100 tests. factorial = factorBack . factorialFactors smallcheck: OK (0.33s) 6 tests completed quickcheck: OK (1.06s) +++ OK, passed 100 tests. Bilinear binomial shape smallcheck: OK (0.25s) 6 tests completed quickcheck: OK (1.11s) +++ OK, passed 100 tests. left side smallcheck: OK 6 tests completed quickcheck: OK (2.35s) +++ OK, passed 100 tests. right side smallcheck: OK 6 tests completed quickcheck: OK (0.92s) +++ OK, passed 100 tests. recurrency smallcheck: OK 25 tests completed quickcheck: OK (1.66s) +++ OK, passed 100 tests. factorise . binomial = binomialFactors smallcheck: OK (0.05s) 36 tests completed quickcheck: OK (1.39s) +++ OK, passed 100 tests. binomial = factorBack . binomialFactors smallcheck: OK (0.12s) 36 tests completed quickcheck: OK (1.32s) +++ OK, passed 100 tests. line smallcheck: OK (0.05s) 36 tests completed quickcheck: OK (2.34s) +++ OK, passed 100 tests. diagonal smallcheck: OK 36 tests completed quickcheck: OK (2.27s) +++ OK, passed 100 tests. binomialRotated left side smallcheck: OK 6 tests completed quickcheck: OK (0.23s) +++ OK, passed 100 tests. right side smallcheck: OK (0.04s) 6 tests completed quickcheck: OK (1.05s) +++ OK, passed 100 tests. recurrency smallcheck: OK (0.25s) 25 tests completed quickcheck: OK (2.29s) +++ OK, passed 100 tests. line smallcheck: OK (0.15s) 36 tests completed quickcheck: OK (2.35s) +++ OK, passed 100 tests. diagonal smallcheck: OK (0.20s) 36 tests completed quickcheck: OK (1.20s) +++ OK, passed 100 tests. stirling1 shape smallcheck: OK (0.03s) 6 tests completed quickcheck: OK (1.95s) +++ OK, passed 100 tests. left side smallcheck: OK (0.02s) 6 tests completed quickcheck: OK (0.55s) +++ OK, passed 100 tests. right side smallcheck: OK (0.04s) 6 tests completed quickcheck: OK (0.96s) +++ OK, passed 100 tests. recurrency smallcheck: OK (0.09s) 25 tests completed quickcheck: OK (0.90s) +++ OK, passed 100 tests. stirling2 shape smallcheck: OK 6 tests completed quickcheck: OK (0.57s) +++ OK, passed 100 tests. left side smallcheck: OK (0.03s) 6 tests completed quickcheck: OK (1.17s) +++ OK, passed 100 tests. right side smallcheck: OK (0.02s) 6 tests completed quickcheck: OK (2.02s) +++ OK, passed 100 tests. recurrency smallcheck: OK (0.24s) 25 tests completed quickcheck: OK (0.85s) +++ OK, passed 100 tests. lah shape smallcheck: OK 6 tests completed quickcheck: OK (0.33s) +++ OK, passed 100 tests. left side smallcheck: OK 6 tests completed quickcheck: OK (0.72s) +++ OK, passed 100 tests. right side smallcheck: OK 6 tests completed quickcheck: OK (0.41s) +++ OK, passed 100 tests. zip stirlings smallcheck: OK (1.05s) 25 tests completed quickcheck: OK (2.36s) +++ OK, passed 100 tests. eulerian1 shape smallcheck: OK 6 tests completed quickcheck: OK (1.53s) +++ OK, passed 100 tests. left side smallcheck: OK (0.03s) 5 tests completed quickcheck: OK (0.23s) +++ OK, passed 100 tests. right side smallcheck: OK (0.05s) 5 tests completed quickcheck: OK (0.60s) +++ OK, passed 100 tests. recurrency smallcheck: OK (0.30s) 25 tests completed quickcheck: OK (1.66s) +++ OK, passed 100 tests. eulerian2 shape smallcheck: OK (0.04s) 6 tests completed quickcheck: OK (2.17s) +++ OK, passed 100 tests. left side smallcheck: OK 5 tests completed quickcheck: OK (0.90s) +++ OK, passed 100 tests. right side smallcheck: OK 5 tests completed quickcheck: OK (2.53s) +++ OK, passed 100 tests. recurrency smallcheck: OK (0.38s) 25 tests completed quickcheck: OK (5.76s) +++ OK, passed 100 tests. bernoulli B_0: OK B_1: OK sign smallcheck: OK 6 tests completed quickcheck: OK (2.73s) +++ OK, passed 100 tests. recursive definition smallcheck: OK (0.89s) 6 tests completed quickcheck: OK (2.77s) +++ OK, passed 100 tests. Euler numbers First 20 elements of E_n are correct: OK (0.95s) E_n with n odd is 0 smallcheck: OK (0.88s) 5 tests completed quickcheck: OK (6.33s) +++ OK, passed 100 tests. E_n for n in [2,6,8,12..] is negative smallcheck: OK (0.88s) 6 tests completed quickcheck: OK (30.20s) +++ OK, passed 100 tests. Euler Polynomial of order N evaluated at 1 First 20 elements of E_n(1) are correct: OK (0.04s) E_n(1) with n in [2,4,6..] is 0 smallcheck: OK (0.03s) 5 tests completed quickcheck: OK (5.77s) +++ OK, passed 100 tests. Moduli chinese smallcheck: OK (6.41s) 3025 tests completed quickcheck: OK (1.76s) +++ OK, passed 100 tests. Class invertMod smallcheck: OK (0.29s) 55 tests completed quickcheck: OK (1.39s) +++ OK, passed 100 tests. powerMod generic multiplicative by base smallcheck Int: OK (7.18s) 3630 tests completed smallcheck Word: OK (7.54s) 3630 tests completed smallcheck Integer: OK (6.91s) 3630 tests completed smallcheck Natural: OK (7.38s) 3630 tests completed quickcheck Int: OK (1.26s) +++ OK, passed 100 tests. quickcheck Word: OK (0.94s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.90s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.72s) +++ OK, passed 100 tests. quickcheck Large Int: OK (1.12s) +++ OK, passed 100 tests. quickcheck Large Word: OK (2.46s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (2.59s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (2.29s) +++ OK, passed 100 tests. additive by exponent smallcheck Int: OK (2.72s) 1980 tests completed smallcheck Word: OK (6.20s) 1980 tests completed smallcheck Integer: OK (2.63s) 1980 tests completed smallcheck Natural: OK (6.77s) 1980 tests completed quickcheck Int: OK (5.64s) +++ OK, passed 100 tests. quickcheck Word: OK (0.66s) +++ OK, passed 100 tests. quickcheck Integer: OK (2.23s) +++ OK, passed 100 tests. quickcheck Natural: OK (2.00s) +++ OK, passed 100 tests. quickcheck Large Int: OK (2.33s) +++ OK, passed 100 tests. quickcheck Large Word: OK (2.14s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (3.46s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (5.65s) +++ OK, passed 100 tests. Integer multiplicative by base smallcheck: OK (6.21s) 3630 tests completed quickcheck: OK (1.17s) +++ OK, passed 100 tests. additive by exponent smallcheck: OK (3.07s) 1980 tests completed quickcheck: OK (0.39s) +++ OK, passed 100 tests. Same SomeMod mul smallcheck: OK (3.32s) 605 tests completed quickcheck: OK (1.79s) +++ OK, passed 100 tests. mul huge: OK (1.87s) +++ OK, passed 100 tests. mul huge all: OK (2.39s) +++ OK, passed 100 tests. SomeMod add smallcheck: OK (5.37s) 3025 tests completed quickcheck: OK (0.78s) +++ OK, passed 100 tests. sub smallcheck: OK (5.25s) 3025 tests completed quickcheck: OK (1.65s) +++ OK, passed 100 tests. mul smallcheck: OK (3.61s) 3025 tests completed quickcheck: OK (0.71s) +++ OK, passed 100 tests. neg smallcheck: OK 55 tests completed quickcheck: OK (0.78s) +++ OK, passed 100 tests. abs smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. InfMod add smallcheck: OK (0.80s) 605 tests completed quickcheck: OK (1.54s) +++ OK, passed 100 tests. sub smallcheck: OK (1.58s) 605 tests completed quickcheck: OK (1.45s) +++ OK, passed 100 tests. mul smallcheck: OK (1.82s) 605 tests completed quickcheck: OK (0.50s) +++ OK, passed 100 tests. getVal/getMod smallcheck: OK (0.20s) 55 tests completed quickcheck: OK (0.30s) +++ OK, passed 100 tests. CubicSymbol multiplicative property of numerators smallcheck: OK (308.64s) 531441 tests completed quickcheck: OK (2.33s) +++ OK, passed 100 tests. multiplicative property of denominators smallcheck: OK (224.20s) 531441 tests completed quickcheck: OK (1.78s) +++ OK, passed 100 tests. cubic residue with prime denominator smallcheck: OK (11.26s) 3564 tests completed quickcheck: OK (15.22s) +++ OK, passed 100 tests. Discrete logarithm output is correct range smallcheck: OK (1.32s) 605 tests completed quickcheck: OK (0.88s) +++ OK, passed 100 tests. a^(log_a b) == b smallcheck: OK (1.74s) 605 tests completed quickcheck: OK (1.33s) +++ OK, passed 100 tests. log_a a^k == k smallcheck: OK (1.09s) 330 tests completed quickcheck: OK (1.39s) +++ OK, passed 100 tests. Equations solveLinear smallcheck: OK (4.90s) 324 tests completed quickcheck: OK (0.76s) +++ OK, passed 100 tests. solveQuadratic smallcheck: OK (62.61s) 2916 tests completed quickcheck: OK (1.52s) +++ OK, passed 100 tests. Jacobi same modulo n smallcheck Int: OK (1.02s) 22 tests completed smallcheck Word: OK (0.02s) 12 tests completed smallcheck Integer: OK (0.18s) 22 tests completed smallcheck Natural: OK (0.23s) 12 tests completed quickcheck Int: OK (0.91s) +++ OK, passed 100 tests. quickcheck Word: OK (1.06s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.86s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.42s) +++ OK, passed 100 tests. quickcheck Large Int: OK (0.96s) +++ OK, passed 100 tests. quickcheck Large Word: OK (1.81s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (6.98s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (7.97s) +++ OK, passed 100 tests. consistent with gcd smallcheck Int: OK (1.06s) 22 tests completed smallcheck Word: OK (0.07s) 12 tests completed smallcheck Integer: OK 22 tests completed smallcheck Natural: OK (0.02s) 12 tests completed quickcheck Int: OK (0.66s) +++ OK, passed 100 tests. quickcheck Word: OK (1.17s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.69s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.83s) +++ OK, passed 100 tests. quickcheck Large Int: OK (1.03s) +++ OK, passed 100 tests. quickcheck Large Word: OK (1.11s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (4.72s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (5.29s) +++ OK, passed 100 tests. multiplicative 1 smallcheck Int: OK (4.24s) 242 tests completed smallcheck Word: OK (0.16s) 72 tests completed smallcheck Integer: OK (0.51s) 242 tests completed smallcheck Natural: OK (0.48s) 72 tests completed quickcheck Int: OK (0.79s) +++ OK, passed 100 tests. quickcheck Word: OK (0.36s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.90s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.54s) +++ OK, passed 100 tests. quickcheck Large Int: OK (0.30s) +++ OK, passed 100 tests. quickcheck Large Word: OK (1.23s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (5.76s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (6.99s) +++ OK, passed 100 tests. multiplicative 2 smallcheck Int: OK (0.10s) 44 tests completed smallcheck Word: OK (0.09s) 24 tests completed smallcheck Integer: OK (0.01s) 44 tests completed smallcheck Natural: OK 24 tests completed quickcheck Int: OK (0.31s) +++ OK, passed 100 tests. quickcheck Word: OK (0.10s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.32s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.10s) +++ OK, passed 100 tests. quickcheck Large Int: OK (0.23s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.15s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (8.82s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (7.65s) +++ OK, passed 100 tests. law of quadratic reciprocity smallcheck Int: OK 4 tests completed smallcheck Word: OK 4 tests completed smallcheck Integer: OK 4 tests completed smallcheck Natural: OK 4 tests completed quickcheck Int: OK (0.37s) +++ OK, passed 100 tests. quickcheck Word: OK (0.02s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.37s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.38s) +++ OK, passed 100 tests. quickcheck Large Int: OK (0.53s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.45s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (5.41s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (7.49s) +++ OK, passed 100 tests. -1 Int smallcheck: OK 2 tests completed quickcheck: OK +++ OK, passed 100 tests. -1 Integer smallcheck: OK 2 tests completed quickcheck: OK (0.06s) +++ OK, passed 100 tests. 2 smallcheck Int: OK 2 tests completed smallcheck Word: OK 2 tests completed smallcheck Integer: OK 2 tests completed smallcheck Natural: OK 2 tests completed quickcheck Int: OK (0.08s) +++ OK, passed 100 tests. quickcheck Word: OK (0.08s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.06s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.28s) +++ OK, passed 100 tests. quickcheck Large Int: OK (0.06s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.05s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (3.60s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (0.46s) +++ OK, passed 100 tests. minBound Int smallcheck: OK 2 tests completed quickcheck: OK (0.21s) +++ OK, passed 100 tests. Primitive root CyclicGroup cyclicGroupFromModulo smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.06s) +++ OK, passed 100 tests. quickcheck Word: OK (0.16s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.06s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.06s) +++ OK, passed 100 tests. quickcheck Large Int: OK (0.89s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.15s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (5.16s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (4.86s) +++ OK, passed 100 tests. cyclic group mod p smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.05s) +++ OK, passed 100 tests. quickcheck Word: OK (0.06s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.08s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.14s) +++ OK, passed 100 tests. quickcheck Large Int: OK (0.28s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.43s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (3.54s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (1.29s) +++ OK, passed 100 tests. cyclic group mod 2p smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.11s) +++ OK, passed 100 tests. quickcheck Word: OK +++ OK, passed 100 tests. quickcheck Integer: OK +++ OK, passed 100 tests. quickcheck Natural: OK (0.16s) +++ OK, passed 100 tests. quickcheck Large Int: OK (0.22s) +++ OK, passed 100 tests. quickcheck Large Word: OK (0.09s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (1.48s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (3.37s) +++ OK, passed 100 tests. cyclic group mod 8: OK isPrimitiveRoot' primitive root is coprime with modulo Integer smallcheck: OK (0.01s) 55 tests completed quickcheck: OK (0.16s) +++ OK, passed 100 tests. Natural smallcheck: OK 30 tests completed quickcheck: OK (0.15s) +++ OK, passed 100 tests. Int smallcheck: OK 55 tests completed quickcheck: OK (0.07s) +++ OK, passed 100 tests. Word smallcheck: OK 30 tests completed quickcheck: OK (0.09s) +++ OK, passed 100 tests. isPrimitiveRoot primitive root is coprime with modulo smallcheck: OK 55 tests completed quickcheck: OK (0.08s) +++ OK, passed 100 tests. cyclic group has a primitive root smallcheck: OK 5 tests completed quickcheck: OK (0.29s) +++ OK, passed 100 tests. primitive root generates cyclic group smallcheck: OK (0.05s) 55 tests completed quickcheck: OK (0.08s) +++ OK, passed 100 tests. cyclic group has right number of primitive roots smallcheck: OK 5 tests completed quickcheck: OK (0.17s) +++ OK, passed 100 tests. Singleton unSFactors . someSFactors = id smallcheck: OK (0.49s) 113 tests completed quickcheck: OK (3.86s) +++ OK, passed 100 tests. cyclicGroupFromModulo = cyclicGroupFromFactors . factorise smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.01s) +++ OK, passed 100 tests. quickcheck Word: OK (0.06s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.06s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.12s) +++ OK, passed 100 tests. Sqrt sqrtsModPrime matches jacobi smallcheck: OK (0.06s) 66 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. is residue smallcheck: OK 66 tests completed quickcheck: OK (0.06s) +++ OK, passed 100 tests. distinct smallcheck: OK (0.06s) 66 tests completed quickcheck: OK (0.05s) +++ OK, passed 100 tests. bounded smallcheck: OK (0.05s) 66 tests completed quickcheck: OK (0.12s) +++ OK, passed 100 tests. tonelliShanks generic smallcheck: OK 30 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. smallest residue smallcheck: OK 6 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. -1 smallcheck: OK (0.12s) 6 tests completed quickcheck: OK (0.12s) +++ OK, passed 100 tests. OEIS A002224: OK (0.41s) sqrtsModPrimePower generic smallcheck: OK (0.11s) 176 tests completed quickcheck: OK (3.23s) +++ OK, passed 100 tests. _ 2 _ smallcheck: OK 55 tests completed quickcheck: OK (0.10s) +++ OK, passed 100 tests. distinct smallcheck: OK (0.08s) 176 tests completed quickcheck: OK (0.12s) +++ OK, passed 100 tests. _ 2 _ smallcheck: OK 55 tests completed quickcheck: OK (0.18s) +++ OK, passed 100 tests. bounded smallcheck: OK (0.08s) 176 tests completed quickcheck: OK (0.25s) +++ OK, passed 100 tests. _ 2 _ smallcheck: OK 55 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. 16 2 2: OK 16 3 2: OK 0 3 2: OK 0 3 3: OK 0 2 4: OK 9 3 3: OK 4 2 3: OK 1 2 2: OK -1 2 2: OK 4 2 4: OK 16 2 6: OK sqrtsModFactorisation generic smallcheck: OK (3.78s) 671 tests completed quickcheck: OK (0.24s) +++ OK, passed 100 tests. distinct smallcheck: OK (4.05s) 671 tests completed quickcheck: OK (3.22s) +++ OK, passed 100 tests. bounded smallcheck: OK (3.74s) 671 tests completed quickcheck: OK (0.26s) +++ OK, passed 100 tests. 0 [(2,1), (3,1), (5,1)]: OK 0 [(3,1), (5,1)]: OK sqrtsMod generic smallcheck: OK 55 tests completed quickcheck: OK (0.06s) +++ OK, passed 100 tests. MoebiusInversion totientSum matches definitions smallcheck: OK (0.02s) 6 tests completed quickcheck: OK (0.21s) +++ OK, passed 100 tests. special case 1: OK (0.03s) zero: OK generalInversion: OK (0.19s) +++ OK, passed 100 tests. Prefactored fromValue smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. fromFactors smallcheck: OK (34.76s) 862 tests completed quickcheck: OK (4.33s) +++ OK, passed 100 tests. Num instance plus smallcheck: OK 121 tests completed quickcheck: OK (0.11s) +++ OK, passed 100 tests. minus smallcheck: OK 121 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. minusNatural smallcheck: OK 36 tests completed quickcheck: OK (0.15s) +++ OK, passed 100 tests. multiply smallcheck: OK (0.16s) 121 tests completed quickcheck: OK (0.07s) +++ OK, passed 100 tests. negate smallcheck: OK 11 tests completed quickcheck: OK (0.10s) +++ OK, passed 100 tests. absSignum smallcheck: OK (0.02s) 11 tests completed quickcheck: OK (0.14s) +++ OK, passed 100 tests. fromInteger smallcheck: OK 11 tests completed quickcheck: OK (0.03s) +++ OK, passed 100 tests. Primes Primes primesSum smallcheck: OK (4.97s) 6 tests completed quickcheck: OK (5.03s) +++ OK, passed 100 tests. symmetricDifference smallcheck: OK (6.93s) 2809 tests completed quickcheck: OK (3.30s) +++ OK, passed 100 tests. toPrimeIntegral Int -> Integer smallcheck: OK 6 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. Int -> Int8 smallcheck: OK (0.07s) 6 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. Integer -> Int smallcheck: OK 6 tests completed quickcheck: OK (0.06s) +++ OK, passed 100 tests. Counting primeCount non-negative smallcheck: OK 11 tests completed quickcheck: OK (0.07s) +++ OK, passed 100 tests. monotonic smallcheck: OK (0.07s) 25 tests completed quickcheck: OK (0.03s) +++ OK, passed 100 tests. increases on primes smallcheck: OK (0.03s) 5 tests completed quickcheck: OK (0.31s) +++ OK, passed 100 tests. special case 1: OK special case 2: OK special case 3: OK special case 4: OK special case 5: OK special case 6: OK special case 7: OK special case 8: OK special case 9: OK (0.50s) special case 10: OK (0.05s) special case 11: OK (3.55s) special case 12: OK (8.53s) nthPrime positive smallcheck: OK 5 tests completed quickcheck: OK (0.50s) +++ OK, passed 100 tests. monotonic smallcheck: OK 25 tests completed quickcheck: OK (0.08s) +++ OK, passed 100 tests. is prime smallcheck: OK 5 tests completed quickcheck: OK (0.50s) +++ OK, passed 100 tests. special case 1: OK special case 2: OK special case 3: OK special case 4: OK special case 5: OK (0.10s) special case 6: OK (1.40s) special case 7: OK (5.03s) special case 8: OK (5.70s) special case 9: OK (7.24s) special case 10: OK (6.64s) special case 11: OK (32.54s) special case 12: OK (38.12s) approxPrimeCount non-negative smallcheck Int: OK (0.07s) 11 tests completed smallcheck Word: OK (0.46s) 6 tests completed smallcheck Integer: OK (0.04s) 11 tests completed smallcheck Natural: OK (0.07s) 6 tests completed quickcheck Int: OK (0.98s) +++ OK, passed 100 tests. quickcheck Word: OK (0.05s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.04s) +++ OK, passed 100 tests. quickcheck Natural: OK +++ OK, passed 100 tests. quickcheck Large Int: OK +++ OK, passed 100 tests. quickcheck Large Word: OK +++ OK, passed 100 tests. quickcheck Huge Integer: OK (3.01s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (3.24s) +++ OK, passed 100 tests. overestimates primeCount smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.19s) +++ OK, passed 100 tests. quickcheck Word: OK (0.17s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.19s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.19s) +++ OK, passed 100 tests. quickcheck Large Int: OK (3.22s) +++ OK, passed 100 tests. quickcheck Large Word: OK (3.10s) +++ OK, passed 100 tests. quickcheck Huge Integer: OK (3.11s) +++ OK, passed 100 tests. quickcheck Huge Natural: OK (3.10s) +++ OK, passed 100 tests. nthPrimeApprox positive smallcheck: OK 11 tests completed quickcheck: OK (0.16s) +++ OK, passed 100 tests. underestimates nthPrime smallcheck: OK 5 tests completed quickcheck: OK (2.97s) +++ OK, passed 100 tests. Factorisation factorise 0: OK negate smallcheck: OK 5 tests completed quickcheck: OK (0.17s) +++ OK, passed 100 tests. bases are prime smallcheck: OK 5 tests completed quickcheck: OK (0.16s) +++ OK, passed 100 tests. bases are distinct smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. factorback smallcheck: OK (0.40s) 5 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. special case 35: OK special case 75: OK special case 4293001441: OK special case 4295098369: OK special case 2147483647: OK special case 4294967291: OK special case 19000...00001: OK (0.88s) special case 41890...00525: OK special case 92233...75783: OK special case 18446...51557: OK special case 41813...70917: OK (5.31s) special case 41813...70918: OK (5.04s) special case 22271...44929: OK (5.12s) special case 10489...67281: OK (5.58s) special case 10489...67282: OK (5.19s) special case 10489...67283: OK (5.89s) special case 10489...67287: OK (37.39s) special case 62930...00748: OK (4.96s) special case 62930...00749: OK (5.15s) special case 62930...00750: OK (25.91s) special case 62930...00751: OK (5.14s) special case 62930...00753: OK (7.48s) special case 62930...00754: OK (4.94s) special case 11999...77057: OK (6.29s) special case 11999...77062: OK (5.06s) special case 16757...78160: OK (5.88s) special case 16757...78162: OK (6.03s) special case 16757...78163: OK (66.41s) special case 11111...11111: OK (5.27s) special case 62350...06937: OK (4.73s) special case 62647...15862: OK (4.72s) special case 63839...24037: OK (5.21s) laziness 14145...65857: OK (11.96s) Sequence nextPrime smallcheck Int: OK 11 tests completed smallcheck Word: OK (0.01s) 6 tests completed smallcheck Integer: OK 11 tests completed smallcheck Natural: OK 6 tests completed quickcheck Int: OK (0.09s) +++ OK, passed 100 tests. quickcheck Word: OK (0.44s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.36s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.33s) +++ OK, passed 100 tests. precPrime smallcheck Int: OK (0.02s) 5 tests completed smallcheck Word: OK (0.02s) 5 tests completed smallcheck Integer: OK (0.11s) 5 tests completed smallcheck Natural: OK (0.01s) 5 tests completed quickcheck Int: OK (0.11s) +++ OK, passed 100 tests. quickcheck Word: OK (0.45s) +++ OK, passed 100 tests. quickcheck Integer: OK (2.20s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.06s) +++ OK, passed 100 tests. toEnum Int smallcheck: OK (0.04s) 11 tests completed quickcheck: OK (2.05s) +++ OK, passed 100 tests. Word smallcheck: OK 11 tests completed quickcheck: OK (2.05s) +++ OK, passed 100 tests. Integer smallcheck: OK (0.04s) 11 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. Natural smallcheck: OK 11 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. fromEnum Int smallcheck: OK (0.05s) 6 tests completed quickcheck: OK (0.42s) +++ OK, passed 100 tests. Word smallcheck: OK 3 tests completed quickcheck: OK (0.19s) +++ OK, passed 100 tests. Integer smallcheck: OK 6 tests completed quickcheck: OK (0.45s) +++ OK, passed 100 tests. Natural smallcheck: OK 3 tests completed quickcheck: OK (1.92s) +++ OK, passed 100 tests. succ Int smallcheck: OK 6 tests completed quickcheck: OK (1.89s) +++ OK, passed 100 tests. Word smallcheck: OK 3 tests completed quickcheck: OK (1.79s) +++ OK, passed 100 tests. Integer smallcheck: OK 6 tests completed quickcheck: OK (0.13s) +++ OK, passed 100 tests. Natural smallcheck: OK 3 tests completed quickcheck: OK (1.64s) +++ OK, passed 100 tests. pred Int smallcheck: OK (0.01s) 6 tests completed quickcheck: OK (1.56s) +++ OK, passed 100 tests. Word smallcheck: OK 3 tests completed quickcheck: OK (1.54s) +++ OK, passed 100 tests. Integer smallcheck: OK 6 tests completed quickcheck: OK (1.51s) +++ OK, passed 100 tests. Natural smallcheck: OK (1.40s) 3 tests completed quickcheck: OK (0.17s) +++ OK, passed 100 tests. [2..2] == [2]: OK [65500..65600]: OK [2..100000]: OK (3.80s) enumFrom Int smallcheck: OK (2.07s) 36 tests completed quickcheck: FAIL (2.07s) *** Failed! Falsified (after 10 tests): Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 518125833172177590 5300451581113764577,9)" to reproduce. Use -p '/enumFrom.Int.quickcheck/' to rerun this test only. Word smallcheck: OK (2.07s) 9 tests completed quickcheck: FAIL (34.57s) *** Failed! Falsified (after 21 tests): Prime 11 Prime 11 Use --quickcheck-replay="(SMGen 3840685126204280117 14966029366183363401,20)" to reproduce. Use -p '/enumFrom.Word.quickcheck/' to rerun this test only. Integer smallcheck: OK (2.07s) 36 tests completed quickcheck: FAIL (2.06s) *** Failed! Falsified (after 11 tests): Prime 7 Prime 13 Use --quickcheck-replay="(SMGen 10085597235547025898 12042748375499791845,10)" to reproduce. Use -p '/enumFrom.Integer.quickcheck/' to rerun this test only. Natural smallcheck: OK (2.05s) 9 tests completed quickcheck: FAIL (43.86s) *** Failed! Falsified (after 37 tests): Prime 11 Prime 19 Use --quickcheck-replay="(SMGen 11931851811842848638 8540188447890210045,36)" to reproduce. Use -p '/enumFrom.Natural.quickcheck/' to rerun this test only. enumFromTo Int smallcheck: OK 36 tests completed quickcheck: FAIL *** Failed! Falsified (after 9 tests): Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 13993809246713366723 17409839086236701669,8)" to reproduce. Use -p '/enumFromTo.Int.quickcheck/' to rerun this test only. Word smallcheck: OK (0.06s) 9 tests completed quickcheck: FAIL (0.07s) *** Failed! Falsified (after 8 tests): Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 5138510106275687871 4703078732336279121,7)" to reproduce. Use -p '/enumFromTo.Word.quickcheck/' to rerun this test only. Integer smallcheck: OK 36 tests completed quickcheck: FAIL *** Failed! Falsified (after 12 tests): Prime 11 Prime 13 Use --quickcheck-replay="(SMGen 2562744665744396751 15565943770992581765,11)" to reproduce. Use -p '/enumFromTo.Integer.quickcheck/' to rerun this test only. Natural smallcheck: OK 9 tests completed quickcheck: FAIL (0.12s) *** Failed! Falsified (after 20 tests): Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 16310546619286736613 15395257125276377323,19)" to reproduce. Use -p '/enumFromTo.Natural.quickcheck/' to rerun this test only. enumFromThen Int smallcheck: OK (2.65s) 216 tests completed quickcheck: FAIL (2.12s) *** Failed! Falsified (after 15 tests): Prime 7 Prime 13 Prime 13 Use --quickcheck-replay="(SMGen 12636969960760365809 15292150983179310347,14)" to reproduce. Use -p '/enumFromThen.Int.quickcheck/' to rerun this test only. Word smallcheck: OK (2.11s) 27 tests completed quickcheck: FAIL (2.13s) *** Failed! Falsified (after 12 tests): Prime 7 Prime 11 Prime 11 Use --quickcheck-replay="(SMGen 8497806123142335952 15291958927150247673,11)" to reproduce. Use -p '/enumFromThen.Word.quickcheck/' to rerun this test only. Integer smallcheck: OK (2.47s) 216 tests completed quickcheck: FAIL (2.02s) *** Failed! Falsified (after 15 tests): Prime 11 Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 12860663376386645317 17606017407346805419,14)" to reproduce. Use -p '/enumFromThen.Integer.quickcheck/' to rerun this test only. Natural smallcheck: OK (2.16s) 27 tests completed quickcheck: FAIL (1.96s) *** Failed! Falsified (after 9 tests): Prime 7 Prime 3 Prime 7 Use --quickcheck-replay="(SMGen 16652026023396165319 12444739761616124693,8)" to reproduce. Use -p '/enumFromThen.Natural.quickcheck/' to rerun this test only. enumFromThenTo Int smallcheck: OK (0.03s) 216 tests completed quickcheck: FAIL *** Failed! Falsified (after 22 tests): Prime 11 Prime 13 Prime 19 Use --quickcheck-replay="(SMGen 9193283599759560867 4509200714784221249,21)" to reproduce. Use -p '/enumFromThenTo.Int.quickcheck/' to rerun this test only. Word smallcheck: OK 27 tests completed quickcheck: FAIL *** Failed! Falsified (after 10 tests): Prime 7 Prime 5 Prime 7 Use --quickcheck-replay="(SMGen 6310931018532821603 17527665988856691951,9)" to reproduce. Use -p '/enumFromThenTo.Word.quickcheck/' to rerun this test only. Integer smallcheck: OK (0.12s) 216 tests completed quickcheck: FAIL (0.12s) *** Failed! Falsified (after 17 tests): Prime 7 Prime 13 Prime 13 Use --quickcheck-replay="(SMGen 9433140882804945901 11908954606762912455,16)" to reproduce. Use -p '/enumFromThenTo.Integer.quickcheck/' to rerun this test only. Natural smallcheck: OK 27 tests completed quickcheck: FAIL (0.01s) *** Failed! Falsified (after 23 tests): Prime 17 Prime 7 Prime 7 Use --quickcheck-replay="(SMGen 13945372051098128329 15402879647691355377,22)" to reproduce. Use -p '/enumFromThenTo.Natural.quickcheck/' to rerun this test only. Sieve primes Int: OK (62.94s) Word: OK (64.83s) Integer: OK (62.55s) Natural: OK (66.15s) Int8: OK (1.70s) Int16: OK (3.51s) Word8: OK (1.68s) Word16: OK (19.77s) primeSieve smallcheck: OK (1.68s) 11 tests completed quickcheck: OK (1.73s) +++ OK, passed 100 tests. psieveList Int: OK (19.75s) Word: OK (30.68s) Integer: OK (34.72s) Natural: OK (10.17s) Int8: OK (1.60s) Int16: OK (4.41s) Word8: OK (1.58s) Word16: OK (18.97s) Testing isPrime [0..100]: OK negate smallcheck: OK 11 tests completed quickcheck: OK (0.12s) +++ OK, passed 100 tests. Carmichael pseudoprimes: OK strong pseudoprimes base 2: OK strong Lucas pseudoprimes: OK isStrongFermatPP matches isPrime smallcheck: OK (0.03s) 66 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. EisensteinIntegers forall z . z == signum z * abs z smallcheck: OK (0.04s) 81 tests completed quickcheck: OK +++ OK, passed 100 tests. abs z rotates to the first sextant smallcheck: OK (0.07s) 81 tests completed quickcheck: OK +++ OK, passed 100 tests. Division The remainder's norm is smaller than the divisor's smallcheck: OK (4.10s) 6561 tests completed quickcheck: OK +++ OK, passed 100 tests. quotE and remE work properly smallcheck: OK (19.47s) 6561 tests completed quickcheck: OK (0.05s) +++ OK, passed 100 tests. quotRemE works properly smallcheck: OK (7.44s) 6561 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. g.c.d. The g.c.d. of two Eisenstein integers divides them smallcheck: OK (19.86s) 6561 tests completed quickcheck: OK (0.20s) +++ OK, passed 100 tests. Common divisor divides gcd: OK (0.04s) +++ OK, passed 100 tests. g.c.d. (12 :+ 23) (23 :+ 34): OK The Eisenstein norm function is multiplicative smallcheck: OK (4.25s) 6561 tests completed quickcheck: OK (0.09s) +++ OK, passed 100 tests. Primality findPrime returns prime smallcheck: OK (1.23s) 5 tests completed quickcheck: OK (1.70s) +++ OK, passed 100 tests. primes are actually prime smallcheck: OK (1.42s) 5 tests completed quickcheck: OK (1.85s) +++ OK, passed 100 tests. primes is ordered smallcheck: OK (1.49s) 5 tests completed quickcheck: OK (1.70s) +++ OK, passed 100 tests. primes are in the first sextant smallcheck: OK (1.63s) 5 tests completed quickcheck: OK (1.35s) +++ OK, passed 100 tests. Factorisation factorise produces correct results smallcheck: OK (0.08s) 81 tests completed quickcheck: OK (0.08s) +++ OK, passed 100 tests. factorise produces no factors with exponent 0 smallcheck: OK (0.09s) 81 tests completed quickcheck: OK (0.08s) +++ OK, passed 100 tests. factorise produces no unit factors smallcheck: OK (0.02s) 81 tests completed quickcheck: OK (0.02s) +++ OK, passed 100 tests. factorise 15:+12: OK GcdDomain divide1: OK (0.07s) +++ OK, passed 100 tests; 10 discarded. divide2: OK (0.05s) +++ OK, passed 100 tests; 10 discarded. gcd1: OK (0.02s) +++ OK, passed 100 tests; 10 discarded. gcd2: OK (0.57s) +++ OK, passed 100 tests; 10 discarded. lcm1: OK (0.05s) +++ OK, passed 100 tests; 11 discarded. lcm2: OK (0.03s) +++ OK, passed 100 tests; 12 discarded. coprime: OK (0.06s) +++ OK, passed 100 tests; 10 discarded. Euclidean degree: OK (0.01s) +++ OK, passed 100 tests; 10 discarded. quotRem: OK (0.06s) +++ OK, passed 100 tests; 10 discarded. quot: OK (0.01s) +++ OK, passed 100 tests; 11 discarded. rem: OK (0.05s) +++ OK, passed 100 tests; 10 discarded. GaussianIntegers factorise factor back smallcheck: OK (0.05s) 81 tests completed quickcheck: OK (0.31s) +++ OK, passed 100 tests. powers are > 0 smallcheck: OK (0.04s) 81 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. factors are > 1 smallcheck: OK (0.26s) 81 tests completed quickcheck: OK (0.27s) +++ OK, passed 100 tests. factorise 63:+36: OK laziness: OK (1.23s) findPrime' smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. isPrime smallcheck: OK (0.26s) 81 tests completed quickcheck: OK (0.26s) +++ OK, passed 100 tests. primes matches reference: OK (0.99s) primes smallcheck: OK (1.21s) 6 tests completed quickcheck: OK (1.06s) +++ OK, passed 100 tests. primes are ordered: OK (1.23s) counting primes: OK (55.60s) signumAbsProperty smallcheck: OK (0.01s) 81 tests completed quickcheck: OK +++ OK, passed 100 tests. absProperty smallcheck: OK (0.21s) 81 tests completed quickcheck: OK (0.19s) +++ OK, passed 100 tests. remProperty smallcheck: OK (18.46s) 6561 tests completed quickcheck: OK (0.20s) +++ OK, passed 100 tests. gcd is divisor smallcheck: OK (28.00s) 6561 tests completed quickcheck: OK (0.20s) +++ OK, passed 100 tests. is greatest: OK (0.09s) +++ OK, passed 100 tests. (12 :+ 23) (23 :+ 34): OK (0 :+ 3) (2 :+ 2): OK GcdDomain divide1: OK (0.14s) +++ OK, passed 100 tests; 11 discarded. divide2: OK (0.08s) +++ OK, passed 100 tests; 11 discarded. gcd1: OK (0.07s) +++ OK, passed 100 tests; 10 discarded. gcd2: OK (0.08s) +++ OK, passed 100 tests; 10 discarded. lcm1: OK (0.12s) +++ OK, passed 100 tests; 11 discarded. lcm2: OK (0.07s) +++ OK, passed 100 tests; 12 discarded. coprime: OK +++ OK, passed 100 tests; 10 discarded. Euclidean degree: OK (0.06s) +++ OK, passed 100 tests; 10 discarded. quotRem: OK +++ OK, passed 100 tests; 11 discarded. quot: OK +++ OK, passed 100 tests; 11 discarded. rem: OK (0.05s) +++ OK, passed 100 tests; 10 discarded. ArithmeticFunctions ArithmeticFunctions Divisors length . divisors = tau smallcheck: OK 5 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. sum . divisors = sigma_1 smallcheck: OK 5 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. matches definition smallcheck: OK 5 tests completed quickcheck: OK (0.09s) +++ OK, passed 100 tests. divisors = divisorsSmall smallcheck: OK 10 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. divisors = divisorsList smallcheck: OK 10 tests completed quickcheck: OK +++ OK, passed 100 tests. divisors = divisorsTo smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. Tau OEIS: OK Sigma sigma_0 = tau smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. sigma_1 n > n smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS sigma_1: OK OEIS sigma_2: OK Totient totient is even smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. totient n < n smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS: OK Jordan jordan_0 = [== 1] smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. jordan_1 = totient smallcheck: OK 5 tests completed quickcheck: OK (0.05s) +++ OK, passed 100 tests. OEIS jordan_2: OK Ramanujan ramanujan mod 8 congruences smallcheck: OK 5 tests completed quickcheck: OK +++ OK, passed 100 tests. ramanujan mod 7 congruences smallcheck: OK 5 tests completed quickcheck: OK (0.11s) +++ OK, passed 100 tests. baseline ramanujan range: OK (0.06s) baseline ramanujan powers2: OK baseline ramanujan powers3: OK Moebius OEIS: OK Lazy: OK Liouville liouville values smallcheck: OK 5 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. liouville matches moebius smallcheck: OK 5 tests completed quickcheck: OK (0.05s) +++ OK, passed 100 tests. OEIS: OK Carmichael carmichael divides totient smallcheck: OK 5 tests completed quickcheck: OK (0.04s) +++ OK, passed 100 tests. OEIS: OK (0.04s) Omegas smallOmega <= bigOmega smallcheck: OK (0.04s) 5 tests completed quickcheck: OK +++ OK, passed 100 tests. OEIS smallOmega: OK OEIS bigOmega: OK Mangoldt OEIS: OK N-freedom `isNFree` matches the definition smallcheck: OK 30 tests completed quickcheck: OK +++ OK, passed 100 tests. numbers produces by `nFrees`s are `n`-free smallcheck: OK (0.01s) 30 tests completed quickcheck: OK (0.43s) +++ OK, passed 100 tests. distribution of n-free numbers matches expected smallcheck: OK (0.23s) 25 tests completed quickcheck: OK (20.78s) +++ OK, passed 100 tests. nFreesBlock matches nFrees smallcheck: OK (0.32s) 150 tests completed quickcheck: OK (0.44s) +++ OK, passed 100 tests. `1` is the only 0-free number: OK `1` is the only 1-free number: OK Inverse Totient forward smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.44s) +++ OK, passed 100 tests. quickcheck Word: OK (0.13s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.12s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.13s) +++ OK, passed 100 tests. backward smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.14s) +++ OK, passed 100 tests. quickcheck Word: OK (0.21s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.81s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.48s) +++ OK, passed 100 tests. count factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK (0.04s) factorial 7: OK (0.04s) factorial 8: OK (0.07s) factorial 9: OK factorial 10: OK (0.09s) factorial 11: OK (0.16s) factorial 12: OK (0.61s) factorial 13: OK (1.76s) factorial 14: OK (4.41s) factorial 15: OK (29.69s) factorial 16: OK (36.30s) factorial 17: OK (45.32s) factorial 18: OK (54.84s) min factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK (0.09s) factorial 6: OK (0.07s) factorial 7: OK (0.07s) factorial 8: OK factorial 9: OK factorial 10: OK (0.02s) factorial 11: OK (0.21s) factorial 12: OK (0.44s) factorial 13: OK (3.07s) factorial 14: OK (4.38s) factorial 15: OK (32.09s) factorial 16: OK (40.34s) factorial 17: OK (48.37s) factorial 18: OK (60.95s) max factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK (0.07s) factorial 5: OK (0.09s) factorial 6: OK (0.10s) factorial 7: OK (0.08s) factorial 8: OK (0.09s) factorial 9: OK (0.08s) factorial 10: OK (0.43s) factorial 11: OK (0.33s) factorial 12: OK (0.19s) factorial 13: OK (1.83s) factorial 14: OK (18.98s) factorial 15: OK (32.07s) factorial 16: OK (32.93s) factorial 17: OK (46.01s) factorial 18: OK (57.39s) Sigma1 forward smallcheck Int: OK 5 tests completed smallcheck Word: OK 5 tests completed smallcheck Integer: OK 5 tests completed smallcheck Natural: OK 5 tests completed quickcheck Int: OK (0.36s) +++ OK, passed 100 tests. quickcheck Word: OK (0.43s) +++ OK, passed 100 tests. quickcheck Integer: OK (1.24s) +++ OK, passed 100 tests. quickcheck Natural: OK (1.13s) +++ OK, passed 100 tests. backward smallcheck Int: OK (0.06s) 5 tests completed smallcheck Word: OK (0.23s) 5 tests completed smallcheck Integer: OK (0.05s) 5 tests completed smallcheck Natural: OK (0.06s) 5 tests completed quickcheck Int: OK (0.43s) +++ OK, passed 100 tests. quickcheck Word: OK (1.33s) +++ OK, passed 100 tests. quickcheck Integer: OK (0.23s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.41s) +++ OK, passed 100 tests. 200: OK count factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK factorial 7: OK factorial 8: OK factorial 9: OK (0.01s) factorial 10: OK (0.29s) factorial 11: OK (1.03s) factorial 12: OK (0.83s) factorial 13: OK (1.22s) factorial 14: OK (26.72s) factorial 15: OK (33.94s) factorial 16: OK (39.35s) factorial 17: OK (51.62s) factorial 18: OK (61.17s) min factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK (0.05s) factorial 6: OK (0.05s) factorial 7: OK factorial 8: OK (0.30s) factorial 9: OK (0.07s) factorial 10: OK (1.58s) factorial 11: OK (2.35s) factorial 12: OK (27.47s) factorial 13: OK (32.63s) factorial 14: OK (34.98s) factorial 15: OK (46.92s) factorial 16: OK (57.87s) max factorial 1: OK factorial 2: OK factorial 3: OK factorial 4: OK factorial 5: OK factorial 6: OK factorial 7: OK (0.07s) factorial 8: OK (0.06s) factorial 9: OK (0.06s) factorial 10: OK (1.45s) factorial 11: OK (0.87s) factorial 12: OK (22.60s) factorial 13: OK (32.17s) factorial 14: OK (39.20s) factorial 15: OK (49.37s) factorial 16: OK (58.03s) Jordan forward smallcheck Integer: OK 25 tests completed smallcheck Natural: OK 25 tests completed quickcheck Integer: OK (61.54s) +++ OK, passed 100 tests. quickcheck Natural: OK (75.87s) +++ OK, passed 100 tests. backward smallcheck Integer: OK 25 tests completed smallcheck Natural: OK (0.06s) 25 tests completed quickcheck Integer: OK (0.01s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.01s) +++ OK, passed 100 tests. inverseJordan inverseJordan 51: OK inverseJordan 531: OK inverseJordan 5242: OK inverseJordan 5992: OK inverseJordan 53124: OK inverseJordan 57502: OK (0.01s) inverseJordan 516806: OK (0.06s) inverseJordan 531744: OK (0.11s) inverseJordan 558806: OK inverseJordan 596844: OK (0.19s) inverseJordan 5161050: OK inverseJordan 5240064: OK inverseJordan 5371292: OK inverseJordan 5520986: OK inverseJordan 5756008: OK inverseJordan 51015808: OK inverseJordan 51419856: OK inverseJordan 51822986: OK inverseJordan 52476098: OK inverseJordan 53099008: OK inverseJordan 54067052: OK inverseJordan 54992550: OK inverseJordan 56436342: OK inverseJordan 57682048: OK inverseJordan 59762500: OK inverseJordan 511510052: OK (0.05s) inverseJordan 514289858: OK (0.11s) inverseJordan 516671552: OK (0.07s) inverseJordan 520511148: OK (0.07s) SigmaK forward smallcheck Integer: OK (0.11s) 25 tests completed smallcheck Natural: OK 25 tests completed quickcheck Integer: OK (16.41s) +++ OK, passed 100 tests. quickcheck Natural: OK (28.98s) +++ OK, passed 100 tests. backward smallcheck Integer: OK 25 tests completed smallcheck Natural: OK 25 tests completed quickcheck Integer: OK (0.42s) +++ OK, passed 100 tests. quickcheck Natural: OK (0.06s) +++ OK, passed 100 tests. inverseSigma inverseSigma 51: OK inverseSigma 533: OK inverseSigma 5244: OK inverseSigma 51057: OK inverseSigma 53126: OK inverseSigma 58052: OK inverseSigma 516808: OK inverseSigma 533825: OK inverseSigma 559293: OK inverseSigma 5103158: OK inverseSigma 5161052: OK inverseSigma 5257908: OK inverseSigma 5371294: OK inverseSigma 5554664: OK inverseSigma 5762744: OK inverseSigma 51082401: OK inverseSigma 51419858: OK inverseSigma 51956669: OK inverseSigma 52476100: OK inverseSigma 53304182: OK inverseSigma 54101152: OK inverseSigma 55314716: OK inverseSigma 56436344: OK (0.43s) inverseSigma 58253300: OK inverseSigma 59768751: OK inverseSigma 512252702: OK inverseSigma 514408200: OK inverseSigma 517766056: OK inverseSigma 520511150: OK Mertens pointwise smallcheck: OK (0.43s) 36 tests completed quickcheck: OK (0.79s) +++ OK, passed 100 tests. block special smallcheck: OK (0.06s) 36 tests completed quickcheck: OK (0.69s) +++ OK, passed 100 tests. block unboxed smallcheck: OK (0.34s) 36 tests completed quickcheck: OK (1.07s) +++ OK, passed 100 tests. block boxed smallcheck: OK (0.08s) 36 tests completed quickcheck: OK (0.74s) +++ OK, passed 100 tests. SieveBlock pointwise divisors: OK (1.03s) tau: OK (0.36s) totient: OK (0.01s) moebius: OK (0.68s) smallOmega: OK (0.56s) bigOmega: OK (0.78s) carmichael: OK (0.73s) special moebius 1,1: OK 1,2: OK 208,298: OK 1,12835: OK (0.06s) 10956,4430: OK 65,16171: OK (0.03s) 120906,19456: OK (0.19s) 33800000,27002: OK (0.32s) 17266222643,5051: OK (0.92s) 1000158,48758: OK (0.60s) 1307265,3725: OK (0.18s) 2600000,14686: OK (0.51s) 4516141322507,100001: OK (32.87s) 1133551496949257,100001: OK (88.97s) does not segfault at 0: OK UniqueFactorisation Int smallcheck: OK 11 tests completed quickcheck: OK +++ OK, passed 100 tests. Word smallcheck: OK 6 tests completed quickcheck: OK +++ OK, passed 100 tests. Integer smallcheck: OK 11 tests completed quickcheck: OK (0.23s) +++ OK, passed 100 tests. Natural smallcheck: OK (0.01s) 6 tests completed quickcheck: OK (0.01s) +++ OK, passed 100 tests. GaussianInteger smallcheck: OK (0.01s) 81 tests completed quickcheck: OK (0.03s) +++ OK, passed 100 tests. EisensteinInteger smallcheck: OK (0.12s) 81 tests completed quickcheck: OK (0.06s) +++ OK, passed 100 tests. Montgomery range of newPoint: OK (27.89s) +++ OK, passed 1000 tests; 16294 discarded. range of double: OK (33.73s) +++ OK, passed 1000 tests; 16191 discarded. range of add: OK (27.06s) +++ OK, passed 1000 tests; 16334 discarded. range of multiply: OK (32.44s) +++ OK, passed 1000 tests; 15661 discarded. double matches multiply: OK (31.79s) +++ OK, passed 1000 tests; 16754 discarded. add matches multiply: OK (41.60s) +++ OK, passed 1000 tests; 28928 discarded. SmoothNumbers smoothOverInRange == smoothOverInRangeBF Int smallcheck: OK (44.17s) 2368 tests completed quickcheck: OK (3.06s) +++ OK, passed 100 tests. Word smallcheck: OK (25.40s) 656 tests completed quickcheck: OK (1.90s) +++ OK, passed 100 tests. Integer smallcheck: OK (45.99s) 2368 tests completed quickcheck: OK (17.61s) +++ OK, passed 100 tests. Natural smallcheck: OK (21.17s) 656 tests completed quickcheck: OK (5.42s) +++ OK, passed 100 tests. smoothOver generates a list without duplicates Integer smallcheck: OK (39.03s) 6665 tests completed quickcheck: OK (1.78s) +++ OK, passed 100 tests. Natural smallcheck: OK (1.83s) 1030 tests completed quickcheck: OK (0.54s) +++ OK, passed 100 tests. Quadratic rings smoothOver generates valid smooth numbers Gaussian smallcheck: OK (0.11s) 25 tests completed quickcheck: OK (26.45s) +++ OK, passed 100 tests. Eisenstein smallcheck: OK (0.17s) 25 tests completed quickcheck: OK (25.83s) +++ OK, passed 100 tests. all distinct for base [1+3*i,6+8*i]: OK 6 is smooth for base [4,3,6,10,7]: OK (0.05s) Diophantine Cornacchia correct smallcheck: OK (0.06s) 25 tests completed quickcheck: OK (0.14s) +++ OK, passed 100 tests. Cornacchia same solutions as brute force smallcheck: OK 25 tests completed quickcheck: OK (0.06s) +++ OK, passed 100 tests. Zeta Zeta zetasEven zeta(0): OK zeta(2): OK zeta(4): OK zeta(2n) > zeta(2n+2) smallcheck: OK 5 tests completed quickcheck: OK (0.05s) +++ OK, passed 100 tests. zetasEven matches zetas smallcheck: OK 5 tests completed quickcheck: OK (3.46s) +++ OK, passed 100 tests. zetas zeta(1): OK zeta(3): OK zeta(5): OK zeta(n) > zeta(n+1) smallcheck: OK 5 tests completed quickcheck: OK (0.50s) +++ OK, passed 100 tests. precision smallcheck: OK (14.52s) 36 tests completed quickcheck: OK (33.66s) +++ OK, passed 100 tests. Beta betasOdd beta(1): OK beta(3): OK beta(5): OK beta(2n-1) < beta(2n+1) smallcheck: OK 5 tests completed quickcheck: OK (5.88s) +++ OK, passed 100 tests. betasOdd matches betas smallcheck: OK (0.12s) 6 tests completed quickcheck: OK (25.95s) +++ OK, passed 100 tests. betas beta(0): OK (0.05s) beta(2): OK beta(4): OK (0.06s) beta(n) < beta(n+1) smallcheck: OK (0.08s) 5 tests completed quickcheck: OK (1.22s) +++ OK, passed 100 tests. precision smallcheck: OK (26.21s) 36 tests completed quickcheck: OK (42.66s) +++ OK, passed 100 tests. DirichletCharacters Dirichlet characters divide the right order smallcheck: OK 30 tests completed quickcheck: OK (0.08s) +++ OK, passed 100 tests. Dirichlet characters are multiplicative smallcheck: OK (0.89s) 1080 tests completed quickcheck: OK (0.25s) +++ OK, passed 100 tests. Dirichlet characters are 1 at 1 smallcheck: OK 30 tests completed quickcheck: OK (0.19s) +++ OK, passed 100 tests. Right number of Dirichlet characters smallcheck: OK 5 tests completed quickcheck: OK (0.73s) +++ OK, passed 100 tests. Principal character behaves as expected smallcheck: OK (0.03s) 25 tests completed quickcheck: OK (0.83s) +++ OK, passed 100 tests. Orthogonality relation 1 smallcheck: OK (0.56s) 30 tests completed quickcheck: OK (6.65s) +++ OK, passed 100 tests. Orthogonality relation 2 smallcheck: OK (0.19s) 55 tests completed quickcheck: OK (0.63s) +++ OK, passed 100 tests. Real character checking is correct smallcheck: OK 30 tests completed quickcheck: OK (0.89s) +++ OK, passed 100 tests. Real character evaluation is accurate smallcheck: OK (0.07s) 605 tests completed quickcheck: OK (0.63s) +++ OK, passed 100 tests. Jacobi character matches symbol smallcheck: OK 5 tests completed quickcheck: OK (1.25s) +++ OK, passed 100 tests. Bulk evaluation matches pointwise smallcheck: OK (0.47s) 30 tests completed quickcheck: OK (0.92s) +++ OK, passed 100 tests. Induced character is correct smallcheck: OK (0.08s) 150 tests completed quickcheck: OK (25.92s) +++ OK, passed 100 tests. Primitive character checking is correct smallcheck: OK 30 tests completed quickcheck: OK (0.20s) +++ OK, passed 100 tests. makePrimitive produces primitive character smallcheck: OK 30 tests completed quickcheck: OK (0.25s) +++ OK, passed 100 tests. makePrimitive is idempotent smallcheck: OK 30 tests completed quickcheck: OK (0.50s) +++ OK, passed 100 tests. Calculates correct order smallcheck: OK 30 tests completed quickcheck: OK (0.07s) +++ OK, passed 100 tests. Can construct from table smallcheck: OK (0.39s) 30 tests completed quickcheck: OK (0.32s) +++ OK, passed 100 tests. Creates valid characters indexToChar smallcheck: OK 30 tests completed quickcheck: OK (0.12s) +++ OK, passed 100 tests. principalChar smallcheck: OK 5 tests completed quickcheck: OK (0.17s) +++ OK, passed 100 tests. mulChars smallcheck: OK (0.20s) 180 tests completed quickcheck: OK (0.25s) +++ OK, passed 100 tests. stimesChar smallcheck: OK (0.21s) 330 tests completed quickcheck: OK (0.14s) +++ OK, passed 100 tests. succ smallcheck: OK (0.04s) 30 tests completed quickcheck: OK (0.20s) +++ OK, passed 100 tests. induced smallcheck: OK (0.06s) 150 tests completed quickcheck: OK (0.14s) +++ OK, passed 100 tests. jacobi smallcheck: OK (0.09s) 5 tests completed quickcheck: OK (0.21s) +++ OK, passed 100 tests. makePrimitive smallcheck: OK 30 tests completed quickcheck: OK (0.80s) +++ OK, passed 100 tests. RootOfUnity contains roots of unity smallcheck: OK 55 tests completed quickcheck: OK +++ OK, passed 100 tests. 16 out of 1170 tests failed (312.50s) Test suite arithmoi-tests: FAIL Test suite logged to: dist/test/arithmoi-0.13.4.0-arithmoi-tests.log 0 of 1 test suites (0 of 1 test cases) passed. ==> ERROR:(B A failure occurred in check().(B  Aborting...(B ]3008;end=c571893e7f804669b5fc6efbb939fe22\[!p]104\[?7h]3008;end=08c3ef5f444b45bc8925e0fb9f98150f\==> ERROR:(B Build failed, check /var/lib/archbuild/extra-riscv64/felix-7/build(B [?12l[?25h[?12l[?25h[?12l[?25hreceiving incremental file list haskell-arithmoi-0.13.4.0-11-riscv64-build.log haskell-arithmoi-0.13.4.0-11-riscv64-check.log haskell-arithmoi-0.13.4.0-11-riscv64-prepare.log sent 81 bytes received 13,458 bytes 9,026.00 bytes/sec total size is 130,465 speedup is 9.64