1. 0.03 s $ /nix/store/vzx1mi9c0xfadmsm9dhd83d005cb1qs9-coreutils-9.8/bin/timeout --kill-after=15s 1800s /nix/store/99b1z08awpxj8b6mzggn59gp1shljnff-nix-2.34.5/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link git+https://github.com/sellout/duoids?ref=renovate%2Flock-file-maintenance&rev=efcb599e94b311c8c6f8c2a5caf56f3137bbef9a#packages.x86_64-linux.ghc9103_all --print-build-logs
  2. 0.11 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  3. 0.11 s Pass '--accept-flake-config' to trust it
  4. 0.11 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  5. 0.11 s Pass '--accept-flake-config' to trust it
  6. 0.11 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  7. 0.11 s Pass '--accept-flake-config' to trust it
  8. 0.11 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  9. 0.11 s Pass '--accept-flake-config' to trust it
  10. 0.11 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  11. 0.11 s Pass '--accept-flake-config' to trust it
  12. 0.11 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  13. 0.11 s Pass '--accept-flake-config' to trust it
  14. 0.13 s error (ignored): SQLite database '/var/cache/private/nix-ci-worker/eval-cache-v6/19f80154faf27ddfad5dcb3251253294aea6c838e143ff7a5a949b25d9d532ff.sqlite' is busy
  15. 0.45 s 'system' has been renamed to/replaced by 'stdenv.hostPlatform.system'
  16. 1.19 s
  17. 1.27 s Building cabal2nix-duoids
  18. 1.35 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids
  19. 1.84 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  20. 1.86 s [post-build-hook] Uploading to the NixCI cache: /nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids
  21. 1.91 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22. 2.58 s [post-build-hook] copying 1 paths...
  23. 2.58 s [post-build-hook] copying path '/nix/store/8cvsa25gmfb4x0lc0fmq7qkk8mdx5ybw-cabal2nix-duoids' to 'https://cache.nix-ci.com'...
  24. 2.87 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  25. 3.02 s [post-build-hook] copying 0 paths...
  26. 3.04 s Progress: 1 of 2 built
  27. 3.04 s
  28. 3.04 s Waiting for lock on waiting for lock on '/nix/store/xksxzim591rvs6p53cas0vg2wzzw3l6d-cabal2nix-duoids-hedgehog'
  29. 11.15 s Downloading cached colour-2.3.6-data from https://cache.nix-ci.com
  30. 11.15 s Downloading cached die-hook from https://cache.nix-ci.com
  31. 11.15 s Downloading cached pretty-show-1.10-data from https://cache.nix-ci.com
  32. 11.19 s Downloading cached ghc-9.10.3-doc from https://cache.nix-ci.com
  33. 11.19 s Downloading cached lndir from https://cache.nix-ci.com
  34. 11.19 s Downloading cached ncurses-6.5-man from https://cache.nix-ci.com
  35. 11.19 s Downloading cached setup-debug-info-dirs-hook from https://cache.nix-ci.com
  36. 11.19 s Downloading cached gmp-with-cxx-6.3.0-dev from https://cache.nix-ci.com
  37. 11.19 s Downloading cached libffi-3.5.2-dev from https://cache.nix-ci.com
  38. 11.19 s Downloading cached numactl-2.0.18-dev from https://cache.nix-ci.com
  39. 11.19 s Building builder.pl
  40. 11.19 s Downloading cached algebraic-graphs-0.7-allow-inspection-testing from https://cache.nix-ci.com
  41. 11.19 s Downloading cached algebraic-graphs-0.7-r3.cabal from https://cache.nix-ci.com
  42. 11.19 s Downloading cached algebraic-graphs from https://cache.nix-ci.com
  43. 11.20 s Downloading cached dns-root-data-2025-04 from https://cache.nix-ci.com
  44. 11.20 s Downloading cached hscolour from https://cache.nix-ci.com
  45. 11.20 s Downloading cached libtasn1 from https://cache.nix-ci.com
  46. 11.25 s Building haskell-generic-builder-test-wrapper.sh
  47. 11.29 s Progress: 0 of 107 built (2 building), 1 of 193 downloaded from cache (15 downloading)
  48. 11.29 s Progress: 0 of 107 built (2 building), 2 of 193 downloaded from cache (14 downloading)
  49. 11.29 s Progress: 0 of 107 built (2 building), 3 of 193 downloaded from cache (13 downloading)
  50. 11.29 s Progress: 0 of 107 built (2 building), 4 of 193 downloaded from cache (12 downloading)
  51. 11.29 s Progress: 0 of 107 built (2 building), 5 of 193 downloaded from cache (11 downloading)
  52. 11.29 s Progress: 0 of 107 built (2 building), 6 of 193 downloaded from cache (10 downloading)
  53. 11.29 s [builder.pl] Phase: patchPhase
  54. 11.29 s [builder.pl] Phase: updateAutotoolsGnuConfigScriptsPhase
  55. 11.29 s [builder.pl] Phase: configurePhase
  56. 11.29 s [builder.pl] no configure script, doing nothing
  57. 11.29 s [builder.pl] Phase: buildPhase
  58. 11.29 s [builder.pl] Phase: checkPhase
  59. 11.29 s Downloading cached cabal-doctest from https://cache.nix-ci.com
  60. 11.29 s Downloading cached doctest from https://cache.nix-ci.com
  61. 11.29 s Downloading cached extra from https://cache.nix-ci.com
  62. 11.29 s Downloading cached ghc-paths-0.1.0.12-r8.cabal from https://cache.nix-ci.com
  63. 11.29 s Downloading cached ghc-paths from https://cache.nix-ci.com
  64. 11.29 s Downloading cached jailbreak-cabal from https://cache.nix-ci.com
  65. 11.30 s [builder.pl] Phase: installPhase
  66. 11.30 s [builder.pl] no Makefile or custom installPhase, doing nothing
  67. 11.30 s Progress: 0 of 106 built (2 building), 7 of 193 downloaded from cache (15 downloading)
  68. 11.30 s Downloading cached libevent from https://cache.nix-ci.com
  69. 11.30 s [builder.pl] Phase: fixupPhase
  70. 11.31 s Progress: 0 of 106 built (2 building), 8 of 193 downloaded from cache (15 downloading)
  71. 11.31 s Downloading cached make-shell-wrapper-hook from https://cache.nix-ci.com
  72. 11.33 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/j7sa9rqsbgy8iq0bvk19y8qk5jny5wcq-haskell-generic-builder-test-wrapper.sh
  73. 17.85 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  74. 17.86 s [post-build-hook] Uploading to the NixCI cache: /nix/store/j7sa9rqsbgy8iq0bvk19y8qk5jny5wcq-haskell-generic-builder-test-wrapper.sh
  75. 17.90 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  76. 18.10 s [post-build-hook] copying 0 paths...
  77. 18.15 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  78. 18.17 s [post-build-hook] copying 0 paths...
  79. 18.18 s Progress: 1 of 106 built (1 building), 8 of 193 downloaded from cache (16 downloading)
  80. 18.18 s Progress: 1 of 105 built (1 building), 9 of 193 downloaded from cache (15 downloading)
  81. 18.18 s Progress: 1 of 105 built (1 building), 10 of 193 downloaded from cache (14 downloading)
  82. 18.18 s Progress: 1 of 105 built (1 building), 11 of 193 downloaded from cache (13 downloading)
  83. 18.18 s Progress: 1 of 105 built (1 building), 12 of 193 downloaded from cache (12 downloading)
  84. 18.18 s Progress: 1 of 105 built (1 building), 13 of 193 downloaded from cache (11 downloading)
  85. 18.18 s Progress: 1 of 105 built (1 building), 14 of 193 downloaded from cache (10 downloading)
  86. 18.18 s Progress: 1 of 105 built (1 building), 15 of 193 downloaded from cache (9 downloading)
  87. 18.18 s Progress: 1 of 105 built (1 building), 16 of 193 downloaded from cache (8 downloading)
  88. 18.18 s Progress: 1 of 105 built (1 building), 17 of 193 downloaded from cache (7 downloading)
  89. 18.18 s Progress: 1 of 105 built (1 building), 18 of 193 downloaded from cache (6 downloading)
  90. 18.18 s Progress: 1 of 105 built (1 building), 19 of 193 downloaded from cache (5 downloading)
  91. 18.18 s Progress: 1 of 105 built (1 building), 20 of 193 downloaded from cache (4 downloading)
  92. 18.18 s Progress: 1 of 105 built (1 building), 21 of 193 downloaded from cache (3 downloading)
  93. 18.18 s Progress: 1 of 105 built (1 building), 22 of 193 downloaded from cache (2 downloading)
  94. 18.18 s Progress: 1 of 105 built (1 building), 23 of 193 downloaded from cache (1 downloading)
  95. 18.18 s Progress: 1 of 105 built (1 building), 24 of 193 downloaded from cache
  96. 18.18 s [builder.pl] shrinking RPATHs of ELF executables and libraries in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
  97. 18.18 s [builder.pl] checking for references to /build/ in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl...
  98. 18.18 s [builder.pl] patching script interpreter paths in /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
  99. 18.18 s Downloading cached nettle from https://cache.nix-ci.com
  100. 18.18 s Downloading cached nothunks-0.3.1-r1.cabal from https://cache.nix-ci.com
  101. 18.18 s Downloading cached nothunks from https://cache.nix-ci.com
  102. 18.18 s Downloading cached quickcheck-instances-0.3.33-r1.cabal from https://cache.nix-ci.com
  103. 18.18 s Downloading cached quickcheck-instances from https://cache.nix-ci.com
  104. 18.18 s Downloading cached remove-references-to from https://cache.nix-ci.com
  105. 18.18 s Downloading cached unordered-containers from https://cache.nix-ci.com
  106. 18.18 s Downloading cached vector-0.13.2.0-r2.cabal from https://cache.nix-ci.com
  107. 18.18 s Downloading cached vector from https://cache.nix-ci.com
  108. 18.18 s Downloading cached Cabal-syntax-3.12.1.0-doc from https://cache.nix-ci.com
  109. 18.18 s Downloading cached OneTuple-0.4.2-doc from https://cache.nix-ci.com
  110. 18.18 s Downloading cached assoc-1.1.1-doc from https://cache.nix-ci.com
  111. 18.18 s Downloading cached base-compat-0.14.1-doc from https://cache.nix-ci.com
  112. 18.18 s Downloading cached base-orphans-0.9.3-doc from https://cache.nix-ci.com
  113. 18.19 s Downloading cached call-stack-0.4.0-doc from https://cache.nix-ci.com
  114. 18.19 s Downloading cached clock-0.8.4-doc from https://cache.nix-ci.com
  115. 18.20 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
  116. 26.47 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  117. 26.53 s [post-build-hook] Uploading to the NixCI cache: /nix/store/8rrk76xjrp5s0v35ij1cdb2ymp2dsrki-builder.pl
  118. 26.54 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  119. 26.87 s [post-build-hook] copying 0 paths...
  120. 26.94 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  121. 27.28 s [post-build-hook] copying 0 paths...
  122. 27.30 s Progress: 2 of 95 built, 24 of 193 downloaded from cache (16 downloading)
  123. 27.30 s Progress: 2 of 94 built, 25 of 193 downloaded from cache (15 downloading)
  124. 27.30 s Progress: 2 of 94 built, 26 of 193 downloaded from cache (14 downloading)
  125. 27.30 s Progress: 2 of 94 built, 27 of 193 downloaded from cache (13 downloading)
  126. 27.30 s Progress: 2 of 94 built, 28 of 193 downloaded from cache (12 downloading)
  127. 27.30 s Progress: 2 of 94 built, 29 of 193 downloaded from cache (11 downloading)
  128. 27.30 s Progress: 2 of 94 built, 30 of 193 downloaded from cache (10 downloading)
  129. 27.30 s Progress: 2 of 94 built, 31 of 193 downloaded from cache (9 downloading)
  130. 27.30 s Progress: 2 of 94 built, 32 of 193 downloaded from cache (8 downloading)
  131. 27.30 s Progress: 2 of 94 built, 33 of 193 downloaded from cache (7 downloading)
  132. 27.30 s Progress: 2 of 94 built, 34 of 193 downloaded from cache (6 downloading)
  133. 27.30 s Progress: 2 of 94 built, 35 of 193 downloaded from cache (5 downloading)
  134. 27.30 s Progress: 2 of 94 built, 36 of 193 downloaded from cache (4 downloading)
  135. 27.30 s Progress: 2 of 94 built, 37 of 193 downloaded from cache (3 downloading)
  136. 27.30 s Progress: 2 of 94 built, 38 of 193 downloaded from cache (2 downloading)
  137. 27.30 s Progress: 2 of 94 built, 39 of 193 downloaded from cache (1 downloading)
  138. 27.30 s Progress: 2 of 94 built, 40 of 193 downloaded from cache
  139. 27.30 s Downloading cached code-page-0.2.1-doc from https://cache.nix-ci.com
  140. 27.30 s Downloading cached colour-2.3.6-doc from https://cache.nix-ci.com
  141. 27.30 s Downloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com
  142. 27.30 s Downloading cached ghc-compat-plugin-0.1.0.1-doc from https://cache.nix-ci.com
  143. 27.30 s Downloading cached hashable-1.5.0.0-doc from https://cache.nix-ci.com
  144. 27.30 s Downloading cached haskell-lexer-1.2.1-doc from https://cache.nix-ci.com
  145. 27.30 s Downloading cached hspec-discover-2.11.14-doc from https://cache.nix-ci.com
  146. 27.30 s Downloading cached inspection-testing-0.6.2-doc from https://cache.nix-ci.com
  147. 27.30 s Downloading cached integer-logarithms-1.0.4-doc from https://cache.nix-ci.com
  148. 27.30 s Downloading cached mmorph-1.2.1-doc from https://cache.nix-ci.com
  149. 27.30 s Downloading cached ncurses-6.5-dev from https://cache.nix-ci.com
  150. 27.30 s Downloading cached old-locale-1.0.0.7-doc from https://cache.nix-ci.com
  151. 27.30 s Downloading cached prettyprinter-1.7.1-doc from https://cache.nix-ci.com
  152. 27.30 s Downloading cached primitive-0.9.1.0-doc from https://cache.nix-ci.com
  153. 27.30 s Downloading cached p11-kit from https://cache.nix-ci.com
  154. 27.30 s Downloading cached safe-exceptions-0.1.7.4-doc from https://cache.nix-ci.com
  155. 27.30 s Progress: 2 of 86 built, 41 of 193 downloaded from cache (15 downloading)
  156. 27.30 s Progress: 2 of 86 built, 42 of 193 downloaded from cache (14 downloading)
  157. 27.30 s Downloading cached Cabal-3.12.1.0-doc from https://cache.nix-ci.com
  158. 27.31 s Downloading cached HUnit-1.6.2.0-doc from https://cache.nix-ci.com
  159. 27.50 s Progress: 2 of 86 built, 43 of 193 downloaded from cache (15 downloading)
  160. 27.50 s Downloading cached logging-facade-0.3.1-doc from https://cache.nix-ci.com
  161. 27.51 s Progress: 2 of 86 built, 44 of 193 downloaded from cache (15 downloading)
  162. 27.51 s Downloading cached silently-1.2.5.4-doc from https://cache.nix-ci.com
  163. 27.51 s Progress: 2 of 86 built, 45 of 193 downloaded from cache (15 downloading)
  164. 27.51 s Downloading cached async-2.2.5-doc from https://cache.nix-ci.com
  165. 27.52 s Progress: 2 of 86 built, 46 of 193 downloaded from cache (15 downloading)
  166. 27.52 s Downloading cached case-insensitive-1.2.1.0-doc from https://cache.nix-ci.com
  167. 27.55 s Progress: 2 of 86 built, 47 of 193 downloaded from cache (15 downloading)
  168. 27.55 s Downloading cached data-fix-0.3.4-doc from https://cache.nix-ci.com
  169. 27.55 s Progress: 2 of 86 built, 48 of 193 downloaded from cache (15 downloading)
  170. 27.55 s Downloading cached pretty-show-1.10-doc from https://cache.nix-ci.com
  171. 27.56 s Progress: 2 of 86 built, 49 of 193 downloaded from cache (15 downloading)
  172. 27.56 s Downloading cached splitmix-0.1.3.1-doc from https://cache.nix-ci.com
  173. 27.56 s Progress: 2 of 86 built, 50 of 193 downloaded from cache (15 downloading)
  174. 27.56 s Downloading cached old-time-1.1.0.4-doc from https://cache.nix-ci.com
  175. 27.56 s Progress: 2 of 86 built, 51 of 193 downloaded from cache (15 downloading)
  176. 27.56 s Downloading cached stringbuilder-0.5.1-doc from https://cache.nix-ci.com
  177. 27.57 s Progress: 2 of 86 built, 52 of 193 downloaded from cache (15 downloading)
  178. 27.57 s Downloading cached syb-0.7.2.4-doc from https://cache.nix-ci.com
  179. 27.57 s Progress: 2 of 86 built, 53 of 193 downloaded from cache (15 downloading)
  180. 27.57 s Downloading cached tagged-0.8.9-doc from https://cache.nix-ci.com
  181. 27.57 s Progress: 2 of 86 built, 54 of 193 downloaded from cache (15 downloading)
  182. 27.57 s Downloading cached terminal-size-0.3.4-doc from https://cache.nix-ci.com
  183. 27.57 s Progress: 2 of 86 built, 55 of 193 downloaded from cache (15 downloading)
  184. 27.57 s Downloading cached hspec-expectations-0.8.4-doc from https://cache.nix-ci.com
  185. 27.60 s Progress: 2 of 86 built, 56 of 193 downloaded from cache (15 downloading)
  186. 27.60 s Downloading cached ansi-terminal-types-1.1.3-doc from https://cache.nix-ci.com
  187. 27.68 s Progress: 2 of 86 built, 57 of 193 downloaded from cache (15 downloading)
  188. 27.68 s Downloading cached scientific-0.3.8.0-doc from https://cache.nix-ci.com
  189. 27.69 s Progress: 2 of 86 built, 58 of 193 downloaded from cache (15 downloading)
  190. 27.69 s Downloading cached text-short-0.1.6-doc from https://cache.nix-ci.com
  191. 27.69 s Progress: 2 of 86 built, 59 of 193 downloaded from cache (15 downloading)
  192. 27.69 s Downloading cached these-1.2.1-doc from https://cache.nix-ci.com
  193. 27.69 s Progress: 2 of 86 built, 60 of 193 downloaded from cache (15 downloading)
  194. 27.69 s Downloading cached time-compat-1.9.8-doc from https://cache.nix-ci.com
  195. 27.70 s Progress: 2 of 86 built, 61 of 193 downloaded from cache (15 downloading)
  196. 27.70 s Downloading cached transformers-base-0.4.6-doc from https://cache.nix-ci.com
  197. 27.71 s Progress: 2 of 86 built, 62 of 193 downloaded from cache (15 downloading)
  198. 27.71 s Downloading cached transformers-compat-0.7.2-doc from https://cache.nix-ci.com
  199. 27.73 s Progress: 2 of 86 built, 63 of 193 downloaded from cache (15 downloading)
  200. 27.73 s Downloading cached unbound-1.24.2-lib from https://cache.nix-ci.com
  201. 27.73 s Progress: 2 of 86 built, 64 of 193 downloaded from cache (15 downloading)
  202. 27.73 s Downloading cached unliftio-core-0.2.1.0-doc from https://cache.nix-ci.com
  203. 27.74 s Progress: 2 of 86 built, 65 of 193 downloaded from cache (15 downloading)
  204. 27.74 s Downloading cached gnutls from https://cache.nix-ci.com
  205. 27.74 s Progress: 2 of 86 built, 66 of 193 downloaded from cache (15 downloading)
  206. 27.74 s Downloading cached vector-stream-0.1.0.1-doc from https://cache.nix-ci.com
  207. 27.74 s Progress: 2 of 86 built, 67 of 193 downloaded from cache (15 downloading)
  208. 27.74 s Downloading cached random-1.2.1.3-doc from https://cache.nix-ci.com
  209. 27.74 s Progress: 2 of 86 built, 68 of 193 downloaded from cache (15 downloading)
  210. 27.74 s Downloading cached libmicrohttpd from https://cache.nix-ci.com
  211. 27.74 s Progress: 2 of 86 built, 69 of 193 downloaded from cache (15 downloading)
  212. 27.74 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com
  213. 27.75 s Progress: 2 of 86 built, 70 of 193 downloaded from cache (15 downloading)
  214. 27.75 s Downloading cached elfutils-0.194-bin from https://cache.nix-ci.com
  215. 27.75 s Progress: 2 of 86 built, 71 of 193 downloaded from cache (15 downloading)
  216. 27.75 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com
  217. 27.76 s Progress: 2 of 86 built, 72 of 193 downloaded from cache (15 downloading)
  218. 27.76 s Downloading cached elfutils-0.194-dev from https://cache.nix-ci.com
  219. 27.76 s Progress: 2 of 86 built, 73 of 193 downloaded from cache (15 downloading)
  220. 27.76 s Downloading cached ghc from https://cache.nix-ci.com
  221. 27.76 s Progress: 2 of 86 built, 74 of 193 downloaded from cache (15 downloading)
  222. 27.76 s Downloading cached boring-0.2.2-doc from https://cache.nix-ci.com
  223. 27.76 s Progress: 2 of 86 built, 75 of 193 downloaded from cache (15 downloading)
  224. 27.76 s Downloading cached distributive-0.6.2.1-doc from https://cache.nix-ci.com
  225. 27.77 s Progress: 2 of 86 built, 76 of 193 downloaded from cache (15 downloading)
  226. 27.78 s Progress: 2 of 86 built, 77 of 193 downloaded from cache (14 downloading)
  227. 27.78 s Downloading cached ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  228. 27.86 s Progress: 2 of 86 built, 78 of 193 downloaded from cache (14 downloading)
  229. 27.86 s Progress: 2 of 86 built, 79 of 193 downloaded from cache (13 downloading)
  230. 27.87 s Downloading cached strict-0.5.1-doc from https://cache.nix-ci.com
  231. 27.87 s Progress: 2 of 86 built, 80 of 193 downloaded from cache (13 downloading)
  232. 27.88 s Progress: 2 of 86 built, 81 of 193 downloaded from cache (12 downloading)
  233. 27.88 s Downloading cached monad-control-1.0.3.1-doc from https://cache.nix-ci.com
  234. 27.88 s Progress: 2 of 86 built, 82 of 193 downloaded from cache (12 downloading)
  235. 27.89 s Progress: 2 of 86 built, 83 of 193 downloaded from cache (11 downloading)
  236. 27.89 s Downloading cached resourcet-1.3.0-doc from https://cache.nix-ci.com
  237. 27.93 s Progress: 2 of 86 built, 84 of 193 downloaded from cache (11 downloading)
  238. 27.93 s Progress: 2 of 86 built, 85 of 193 downloaded from cache (10 downloading)
  239. 27.94 s Progress: 2 of 86 built, 86 of 193 downloaded from cache (9 downloading)
  240. 27.94 s Downloading cached QuickCheck-2.15.0.1-doc from https://cache.nix-ci.com
  241. 27.94 s Downloading cached temporary-1.3-doc from https://cache.nix-ci.com
  242. 27.94 s Downloading cached tf-random-0.5-doc from https://cache.nix-ci.com
  243. 27.94 s Downloading cached uuid-types-1.0.6-doc from https://cache.nix-ci.com
  244. 27.94 s Progress: 2 of 86 built, 87 of 193 downloaded from cache (12 downloading)
  245. 27.95 s Progress: 2 of 86 built, 88 of 193 downloaded from cache (11 downloading)
  246. 27.96 s Progress: 2 of 86 built, 89 of 193 downloaded from cache (10 downloading)
  247. 27.96 s Downloading cached constraints-0.14.2-doc from https://cache.nix-ci.com
  248. 27.96 s Progress: 2 of 86 built, 90 of 193 downloaded from cache (10 downloading)
  249. 27.96 s Downloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com
  250. 28.02 s Progress: 2 of 86 built, 91 of 193 downloaded from cache (10 downloading)
  251. 28.02 s Downloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com
  252. 28.02 s Downloading cached prettyprinter-ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  253. 28.06 s Progress: 2 of 86 built, 92 of 193 downloaded from cache (11 downloading)
  254. 28.06 s Downloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com
  255. 28.07 s Progress: 2 of 86 built, 93 of 193 downloaded from cache (11 downloading)
  256. 28.08 s Progress: 2 of 86 built, 94 of 193 downloaded from cache (10 downloading)
  257. 28.13 s Progress: 2 of 86 built, 95 of 193 downloaded from cache (9 downloading)
  258. 28.13 s Downloading cached mockery-0.3.5-doc from https://cache.nix-ci.com
  259. 28.15 s Progress: 2 of 86 built, 96 of 193 downloaded from cache (9 downloading)
  260. 28.15 s Progress: 2 of 86 built, 97 of 193 downloaded from cache (8 downloading)
  261. 28.16 s Progress: 2 of 86 built, 98 of 193 downloaded from cache (7 downloading)
  262. 28.16 s Downloading cached ChasingBottoms-1.3.1.17-doc from https://cache.nix-ci.com
  263. 28.16 s Downloading cached quickcheck-io-0.2.0-doc from https://cache.nix-ci.com
  264. 28.19 s Progress: 2 of 86 built, 99 of 193 downloaded from cache (8 downloading)
  265. 28.22 s Progress: 2 of 86 built, 100 of 193 downloaded from cache (7 downloading)
  266. 28.25 s Progress: 2 of 86 built, 101 of 193 downloaded from cache (6 downloading)
  267. 28.25 s Downloading cached optparse-applicative-0.18.1.0-doc from https://cache.nix-ci.com
  268. 28.25 s Progress: 2 of 86 built, 102 of 193 downloaded from cache (6 downloading)
  269. 28.28 s Progress: 2 of 86 built, 103 of 193 downloaded from cache (5 downloading)
  270. 28.28 s Downloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com
  271. 28.38 s Progress: 2 of 86 built, 104 of 193 downloaded from cache (5 downloading)
  272. 28.41 s Progress: 2 of 86 built, 105 of 193 downloaded from cache (4 downloading)
  273. 28.41 s Downloading cached hspec-core-2.11.14-doc from https://cache.nix-ci.com
  274. 28.42 s Progress: 2 of 86 built, 106 of 193 downloaded from cache (4 downloading)
  275. 28.50 s Progress: 2 of 86 built, 107 of 193 downloaded from cache (3 downloading)
  276. 28.50 s Downloading cached tasty-1.5.3-doc from https://cache.nix-ci.com
  277. 28.52 s Progress: 2 of 86 built, 108 of 193 downloaded from cache (3 downloading)
  278. 28.52 s Downloading cached hedgehog-1.5-doc from https://cache.nix-ci.com
  279. 28.67 s Progress: 2 of 86 built, 109 of 193 downloaded from cache (3 downloading)
  280. 28.67 s Downloading cached hspec-2.11.14-doc from https://cache.nix-ci.com
  281. 28.76 s Progress: 2 of 86 built, 110 of 193 downloaded from cache (3 downloading)
  282. 28.76 s Downloading cached tasty-hunit-0.10.2-doc from https://cache.nix-ci.com
  283. 28.76 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com
  284. 28.76 s Downloading cached tasty-quickcheck-0.11.1-doc from https://cache.nix-ci.com
  285. 28.83 s Progress: 2 of 86 built, 111 of 193 downloaded from cache (5 downloading)
  286. 28.83 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  287. 28.90 s Progress: 2 of 86 built, 112 of 193 downloaded from cache (5 downloading)
  288. 28.99 s Progress: 2 of 86 built, 113 of 193 downloaded from cache (4 downloading)
  289. 28.99 s Progress: 2 of 86 built, 114 of 193 downloaded from cache (3 downloading)
  290. 28.99 s Progress: 2 of 86 built, 115 of 193 downloaded from cache (2 downloading)
  291. 29.05 s Progress: 2 of 86 built, 116 of 193 downloaded from cache (1 downloading)
  292. 40.75 s Progress: 2 of 86 built, 117 of 193 downloaded from cache
  293. 40.75 s Downloading cached Cabal-syntax from https://cache.nix-ci.com
  294. 40.84 s Downloading cached OneTuple from https://cache.nix-ci.com
  295. 40.84 s Downloading cached assoc from https://cache.nix-ci.com
  296. 40.84 s Downloading cached base-compat from https://cache.nix-ci.com
  297. 40.84 s Downloading cached call-stack from https://cache.nix-ci.com
  298. 40.84 s Downloading cached base-orphans from https://cache.nix-ci.com
  299. 40.84 s Downloading cached clock from https://cache.nix-ci.com
  300. 40.84 s Downloading cached code-page from https://cache.nix-ci.com
  301. 40.84 s Downloading cached colour from https://cache.nix-ci.com
  302. 40.84 s Downloading cached erf from https://cache.nix-ci.com
  303. 40.84 s Downloading cached ghc-compat-plugin from https://cache.nix-ci.com
  304. 40.84 s Downloading cached hashable from https://cache.nix-ci.com
  305. 40.84 s Downloading cached haskell-lexer from https://cache.nix-ci.com
  306. 40.84 s Downloading cached inspection-testing from https://cache.nix-ci.com
  307. 40.84 s Downloading cached hspec-discover from https://cache.nix-ci.com
  308. 40.84 s Downloading cached integer-logarithms from https://cache.nix-ci.com
  309. 41.07 s Progress: 2 of 85 built, 118 of 193 downloaded from cache (15 downloading)
  310. 41.07 s Downloading cached old-locale from https://cache.nix-ci.com
  311. 41.12 s Progress: 2 of 84 built, 119 of 193 downloaded from cache (15 downloading)
  312. 41.12 s Downloading cached prettyprinter from https://cache.nix-ci.com
  313. 41.25 s Progress: 2 of 83 built, 120 of 193 downloaded from cache (15 downloading)
  314. 41.25 s Progress: 2 of 83 built, 121 of 193 downloaded from cache (14 downloading)
  315. 41.25 s Downloading cached primitive from https://cache.nix-ci.com
  316. 41.25 s Downloading cached safe-exceptions from https://cache.nix-ci.com
  317. 41.25 s Progress: 2 of 82 built, 122 of 193 downloaded from cache (15 downloading)
  318. 41.25 s Progress: 2 of 82 built, 123 of 193 downloaded from cache (14 downloading)
  319. 41.25 s Downloading cached silently from https://cache.nix-ci.com
  320. 41.25 s Downloading cached splitmix from https://cache.nix-ci.com
  321. 41.34 s Progress: 2 of 82 built, 124 of 193 downloaded from cache (15 downloading)
  322. 41.34 s Downloading cached HUnit from https://cache.nix-ci.com
  323. 41.34 s Progress: 2 of 81 built, 125 of 193 downloaded from cache (15 downloading)
  324. 41.34 s Downloading cached logging-facade from https://cache.nix-ci.com
  325. 41.40 s Progress: 2 of 80 built, 126 of 193 downloaded from cache (15 downloading)
  326. 41.40 s Downloading cached ansi-terminal-types from https://cache.nix-ci.com
  327. 41.45 s Progress: 2 of 79 built, 127 of 193 downloaded from cache (15 downloading)
  328. 41.45 s Downloading cached stringbuilder from https://cache.nix-ci.com
  329. 41.51 s Progress: 2 of 78 built, 128 of 193 downloaded from cache (15 downloading)
  330. 41.52 s Downloading cached syb from https://cache.nix-ci.com
  331. 41.55 s Progress: 2 of 77 built, 129 of 193 downloaded from cache (15 downloading)
  332. 41.55 s Downloading cached tagged from https://cache.nix-ci.com
  333. 41.56 s Progress: 2 of 76 built, 130 of 193 downloaded from cache (15 downloading)
  334. 41.56 s Downloading cached async from https://cache.nix-ci.com
  335. 41.60 s Progress: 2 of 75 built, 131 of 193 downloaded from cache (15 downloading)
  336. 41.60 s Downloading cached case-insensitive from https://cache.nix-ci.com
  337. 41.66 s Progress: 2 of 75 built, 132 of 193 downloaded from cache (15 downloading)
  338. 41.66 s Downloading cached data-fix from https://cache.nix-ci.com
  339. 41.78 s Progress: 2 of 74 built, 133 of 193 downloaded from cache (15 downloading)
  340. 41.79 s Downloading cached old-time from https://cache.nix-ci.com
  341. 41.80 s Progress: 2 of 73 built, 134 of 193 downloaded from cache (15 downloading)
  342. 41.80 s Downloading cached terminal-size from https://cache.nix-ci.com
  343. 41.87 s Progress: 2 of 72 built, 135 of 193 downloaded from cache (15 downloading)
  344. 41.87 s Downloading cached pretty-show from https://cache.nix-ci.com
  345. 41.88 s Progress: 2 of 71 built, 136 of 193 downloaded from cache (15 downloading)
  346. 41.89 s Downloading cached text-short from https://cache.nix-ci.com
  347. 41.89 s Progress: 2 of 70 built, 137 of 193 downloaded from cache (15 downloading)
  348. 41.89 s Downloading cached random from https://cache.nix-ci.com
  349. 41.94 s Progress: 2 of 70 built, 138 of 193 downloaded from cache (15 downloading)
  350. 41.95 s Downloading cached these from https://cache.nix-ci.com
  351. 41.96 s Progress: 2 of 70 built, 139 of 193 downloaded from cache (15 downloading)
  352. 41.97 s Downloading cached time-compat from https://cache.nix-ci.com
  353. 41.98 s Progress: 2 of 69 built, 140 of 193 downloaded from cache (15 downloading)
  354. 41.98 s Downloading cached hspec-expectations from https://cache.nix-ci.com
  355. 42.02 s Progress: 2 of 68 built, 141 of 193 downloaded from cache (15 downloading)
  356. 42.02 s Downloading cached transformers-compat from https://cache.nix-ci.com
  357. 42.05 s Progress: 2 of 67 built, 142 of 193 downloaded from cache (15 downloading)
  358. 42.05 s Downloading cached ansi-terminal from https://cache.nix-ci.com
  359. 42.11 s Progress: 2 of 66 built, 143 of 193 downloaded from cache (15 downloading)
  360. 42.11 s Downloading cached scientific from https://cache.nix-ci.com
  361. 42.12 s Progress: 2 of 65 built, 144 of 193 downloaded from cache (15 downloading)
  362. 42.12 s Downloading cached boring from https://cache.nix-ci.com
  363. 42.14 s Progress: 2 of 64 built, 145 of 193 downloaded from cache (15 downloading)
  364. 42.14 s Downloading cached distributive from https://cache.nix-ci.com
  365. 42.14 s Progress: 2 of 63 built, 146 of 193 downloaded from cache (15 downloading)
  366. 42.14 s Downloading cached unliftio-core from https://cache.nix-ci.com
  367. 42.18 s Progress: 2 of 62 built, 147 of 193 downloaded from cache (15 downloading)
  368. 42.18 s Downloading cached vector-stream from https://cache.nix-ci.com
  369. 42.28 s Progress: 2 of 61 built, 148 of 193 downloaded from cache (15 downloading)
  370. 42.28 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  371. 42.29 s Progress: 2 of 60 built, 149 of 193 downloaded from cache (15 downloading)
  372. 42.29 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  373. 42.43 s Progress: 2 of 59 built, 150 of 193 downloaded from cache (15 downloading)
  374. 42.45 s Progress: 2 of 58 built, 151 of 193 downloaded from cache (14 downloading)
  375. 42.50 s Progress: 2 of 58 built, 152 of 193 downloaded from cache (13 downloading)
  376. 42.50 s Downloading cached strict from https://cache.nix-ci.com
  377. 42.53 s Progress: 2 of 57 built, 153 of 193 downloaded from cache (13 downloading)
  378. 42.60 s Progress: 2 of 56 built, 154 of 193 downloaded from cache (12 downloading)
  379. 42.60 s Progress: 2 of 56 built, 155 of 193 downloaded from cache (11 downloading)
  380. 42.60 s Downloading cached concurrent-output from https://cache.nix-ci.com
  381. 42.60 s Progress: 2 of 54 built, 156 of 193 downloaded from cache (13 downloading)
  382. 42.60 s Downloading cached constraints from https://cache.nix-ci.com
  383. 42.60 s Downloading cached prettyprinter-ansi-terminal from https://cache.nix-ci.com
  384. 42.60 s Downloading cached QuickCheck from https://cache.nix-ci.com
  385. 42.60 s Downloading cached temporary from https://cache.nix-ci.com
  386. 42.60 s Downloading cached tf-random from https://cache.nix-ci.com
  387. 42.60 s Progress: 2 of 53 built, 157 of 193 downloaded from cache (15 downloading)
  388. 42.60 s Downloading cached uuid-types from https://cache.nix-ci.com
  389. 42.63 s Progress: 2 of 52 built, 158 of 193 downloaded from cache (15 downloading)
  390. 42.63 s Downloading cached mmorph from https://cache.nix-ci.com
  391. 42.66 s Progress: 2 of 51 built, 159 of 193 downloaded from cache (15 downloading)
  392. 42.66 s Downloading cached resourcet from https://cache.nix-ci.com
  393. 42.67 s Progress: 2 of 50 built, 160 of 193 downloaded from cache (15 downloading)
  394. 42.67 s Downloading cached barbies from https://cache.nix-ci.com
  395. 42.67 s Progress: 2 of 49 built, 161 of 193 downloaded from cache (15 downloading)
  396. 42.67 s Downloading cached transformers-base from https://cache.nix-ci.com
  397. 42.77 s Progress: 2 of 48 built, 162 of 193 downloaded from cache (15 downloading)
  398. 42.77 s Progress: 2 of 47 built, 163 of 193 downloaded from cache (14 downloading)
  399. 42.88 s Progress: 2 of 46 built, 164 of 193 downloaded from cache (13 downloading)
  400. 43.23 s Progress: 2 of 45 built, 165 of 193 downloaded from cache (12 downloading)
  401. 43.27 s Progress: 2 of 44 built, 166 of 193 downloaded from cache (11 downloading)
  402. 43.27 s Downloading cached mockery from https://cache.nix-ci.com
  403. 43.28 s Progress: 2 of 43 built, 167 of 193 downloaded from cache (11 downloading)
  404. 43.29 s Progress: 2 of 42 built, 168 of 193 downloaded from cache (10 downloading)
  405. 43.29 s Downloading cached optparse-applicative from https://cache.nix-ci.com
  406. 43.35 s Progress: 2 of 42 built, 169 of 193 downloaded from cache (10 downloading)
  407. 43.36 s Progress: 2 of 41 built, 170 of 193 downloaded from cache (9 downloading)
  408. 43.42 s Progress: 2 of 41 built, 171 of 193 downloaded from cache (8 downloading)
  409. 43.46 s Progress: 2 of 40 built, 172 of 193 downloaded from cache (7 downloading)
  410. 43.46 s Downloading cached monad-control from https://cache.nix-ci.com
  411. 43.46 s Progress: 2 of 39 built, 173 of 193 downloaded from cache (7 downloading)
  412. 43.53 s Progress: 2 of 38 built, 174 of 193 downloaded from cache (6 downloading)
  413. 43.55 s Progress: 2 of 37 built, 175 of 193 downloaded from cache (5 downloading)
  414. 43.68 s Progress: 2 of 36 built, 176 of 193 downloaded from cache (4 downloading)
  415. 43.70 s Progress: 2 of 35 built, 177 of 193 downloaded from cache (3 downloading)
  416. 43.70 s Downloading cached lifted-base from https://cache.nix-ci.com
  417. 43.71 s Progress: 2 of 34 built, 178 of 193 downloaded from cache (3 downloading)
  418. 43.71 s Downloading cached tasty from https://cache.nix-ci.com
  419. 43.77 s Progress: 2 of 34 built, 179 of 193 downloaded from cache (3 downloading)
  420. 43.78 s Downloading cached ChasingBottoms from https://cache.nix-ci.com
  421. 43.78 s Downloading cached quickcheck-io from https://cache.nix-ci.com
  422. 43.81 s Progress: 2 of 33 built, 180 of 193 downloaded from cache (4 downloading)
  423. 43.81 s Downloading cached lifted-async from https://cache.nix-ci.com
  424. 43.94 s Progress: 2 of 32 built, 181 of 193 downloaded from cache (4 downloading)
  425. 43.94 s Downloading cached hspec-core from https://cache.nix-ci.com
  426. 44.01 s Progress: 2 of 32 built, 182 of 193 downloaded from cache (4 downloading)
  427. 44.03 s Progress: 2 of 31 built, 183 of 193 downloaded from cache (3 downloading)
  428. 44.03 s Downloading cached tasty-hunit from https://cache.nix-ci.com
  429. 44.03 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  430. 44.03 s Downloading cached tasty-quickcheck from https://cache.nix-ci.com
  431. 44.07 s Progress: 2 of 30 built, 184 of 193 downloaded from cache (5 downloading)
  432. 44.07 s Downloading cached hedgehog from https://cache.nix-ci.com
  433. 44.32 s Progress: 2 of 29 built, 185 of 193 downloaded from cache (5 downloading)
  434. 44.32 s Progress: 2 of 28 built, 186 of 193 downloaded from cache (4 downloading)
  435. 44.33 s Progress: 2 of 27 built, 187 of 193 downloaded from cache (3 downloading)
  436. 44.45 s Progress: 2 of 26 built, 188 of 193 downloaded from cache (2 downloading)
  437. 44.45 s Downloading cached hspec from https://cache.nix-ci.com
  438. 44.56 s Progress: 2 of 25 built, 189 of 193 downloaded from cache (2 downloading)
  439. 44.60 s Progress: 2 of 24 built, 190 of 193 downloaded from cache (1 downloading)
  440. 44.60 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  441. 44.61 s Progress: 2 of 23 built, 191 of 193 downloaded from cache (1 downloading)
  442. 44.61 s Downloading cached Cabal from https://cache.nix-ci.com
  443. 44.62 s Progress: 2 of 23 built, 192 of 193 downloaded from cache (1 downloading)
  444. 45.63 s Progress: 2 of 22 built, 193 of 193 downloaded from cache
  445. 49.52 s Building cabal-doctest
  446. 49.68 s Building ghc-paths
  447. 49.68 s [cabal-doctest] Phase: setupCompilerEnvironmentPhase
  448. 49.77 s [cabal-doctest] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  449. 49.77 s [ghc-paths] Phase: setupCompilerEnvironmentPhase
  450. 49.78 s [ghc-paths] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  451. 49.89 s [cabal-doctest] Phase: unpackPhase
  452. 49.90 s [cabal-doctest] unpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
  453. 49.91 s [cabal-doctest] source root is cabal-doctest-1.0.12
  454. 49.91 s [cabal-doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
  455. 49.92 s [cabal-doctest] Phase: patchPhase
  456. 49.93 s [cabal-doctest] Phase: compileBuildDriverPhase
  457. 49.94 s [cabal-doctest] setupCompileFlags: -package-db=/build/tmp.K4kcaAEGBc/setup-package.conf.d -threaded
  458. 49.99 s [ghc-paths] Phase: unpackPhase
  459. 49.99 s [ghc-paths] unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  460. 50.00 s [ghc-paths] source root is ghc-paths-0.1.0.12
  461. 50.00 s [ghc-paths] setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
  462. 50.01 s [ghc-paths] Phase: patchPhase
  463. 50.01 s [ghc-paths] Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
  464. 50.02 s [cabal-doctest] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.K4kcaAEGBc/Main.o )
  465. 50.02 s [ghc-paths] applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
  466. 50.02 s [ghc-paths] patching file GHC/Paths.hs
  467. 50.02 s [ghc-paths] Phase: compileBuildDriverPhase
  468. 50.03 s [ghc-paths] setupCompileFlags: -package-db=/build/tmp.KUi5LCtmhx/setup-package.conf.d -threaded
  469. 50.11 s [cabal-doctest] [2 of 2] Linking Setup
  470. 50.17 s [ghc-paths] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.KUi5LCtmhx/Main.o )
  471. 50.51 s [ghc-paths] [2 of 2] Linking Setup
  472. 52.06 s [cabal-doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  473. 52.07 s [cabal-doctest] Phase: configurePhase
  474. 52.08 s [cabal-doctest] configureFlags: --verbose --prefix=/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.K4kcaAEGBc/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  475. 52.09 s [cabal-doctest] Using Parsec parser
  476. 52.09 s [cabal-doctest] Configuring cabal-doctest-1.0.12...
  477. 52.23 s [ghc-paths] Phase: updateAutotoolsGnuConfigScriptsPhase
  478. 52.25 s [ghc-paths] Phase: configurePhase
  479. 52.25 s [ghc-paths] configureFlags: --verbose --prefix=/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.KUi5LCtmhx/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  480. 52.26 s [ghc-paths] Using Parsec parser
  481. 52.26 s [ghc-paths] Configuring ghc-paths-0.1.0.12...
  482. 52.93 s [cabal-doctest] Dependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
  483. 52.93 s [cabal-doctest] Dependency base >=4.9 && <5: using base-4.20.2.0
  484. 52.93 s [cabal-doctest] Dependency directory >=1.3 && <2: using directory-1.3.8.5
  485. 52.93 s [cabal-doctest] Dependency filepath >=1.4 && <2: using filepath-1.5.4.0
  486. 52.93 s [cabal-doctest] Source component graph: component lib
  487. 52.93 s [cabal-doctest] Configured component graph:
  488. 52.93 s [cabal-doctest] component cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  489. 52.93 s [cabal-doctest] include Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
  490. 52.93 s [cabal-doctest] include base-4.20.2.0-acb8
  491. 52.93 s [cabal-doctest] include directory-1.3.8.5-e377
  492. 52.93 s [cabal-doctest] include filepath-1.5.4.0-c4eb
  493. 52.93 s [cabal-doctest] Linked component graph:
  494. 52.93 s [cabal-doctest] unit cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  495. 52.93 s [cabal-doctest] include Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
  496. 52.93 s [cabal-doctest] include base-4.20.2.0-acb8
  497. 52.93 s [cabal-doctest] include directory-1.3.8.5-e377
  498. 52.93 s [cabal-doctest] include filepath-1.5.4.0-c4eb
  499. 52.93 s [cabal-doctest] Distribution.Extra.Doctest=cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m:Distribution.Extra.Doctest
  500. 52.93 s [cabal-doctest] Ready component graph:
  501. 52.93 s [cabal-doctest] definite cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  502. 52.93 s [cabal-doctest] depends Cabal-3.12.1.0-6pPBtuT1VEQBltj6c523Xh
  503. 52.93 s [cabal-doctest] depends base-4.20.2.0-acb8
  504. 52.93 s [cabal-doctest] depends directory-1.3.8.5-e377
  505. 52.93 s [cabal-doctest] depends filepath-1.5.4.0-c4eb
  506. 52.93 s [cabal-doctest] Using Cabal-3.12.1.0 compiled by ghc-9.10
  507. 52.93 s [cabal-doctest] Using compiler: ghc-9.10.3
  508. 52.93 s [cabal-doctest] Using install prefix:
  509. 52.93 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
  510. 52.93 s [cabal-doctest] Executables installed in:
  511. 52.93 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/bin
  512. 52.93 s [cabal-doctest] Libraries installed in:
  513. 52.93 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  514. 52.93 s [cabal-doctest] Dynamic Libraries installed in:
  515. 52.93 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  516. 52.93 s [cabal-doctest] Private executables installed in:
  517. 52.93 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12
  518. 52.93 s [cabal-doctest] Data files installed in:
  519. 52.93 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12
  520. 52.93 s [cabal-doctest] Documentation installed in:
  521. 52.93 s [cabal-doctest] /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
  522. 52.93 s [cabal-doctest] Configuration files installed in:
  523. 52.93 s [cabal-doctest] /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/etc
  524. 52.93 s [cabal-doctest] No alex found
  525. 52.93 s [cabal-doctest] Using ar found on system at:
  526. 52.93 s [cabal-doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  527. 52.93 s [cabal-doctest] No c2hs found
  528. 52.93 s [cabal-doctest] No cpphs found
  529. 52.93 s [cabal-doctest] No doctest found
  530. 52.93 s [cabal-doctest] Using gcc version 14.3.0 given by user at:
  531. 52.93 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  532. 52.93 s [cabal-doctest] Using ghc version 9.10.3 found on system at:
  533. 52.93 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  534. 52.93 s [cabal-doctest] Using ghc-pkg version 9.10.3 found on system at:
  535. 52.93 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  536. 52.93 s [cabal-doctest] No ghcjs found
  537. 52.93 s [cabal-doctest] No ghcjs-pkg found
  538. 52.93 s [cabal-doctest] No greencard found
  539. 52.93 s [cabal-doctest] Using haddock version 2.31.1 found on system at:
  540. 52.93 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  541. 52.93 s [cabal-doctest] No happy found
  542. 52.93 s [cabal-doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  543. 52.93 s [cabal-doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  544. 52.94 s [cabal-doctest] No hmake found
  545. 52.94 s [cabal-doctest] Using hpc version 0.69 found on system at:
  546. 52.94 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  547. 52.94 s [cabal-doctest] Using hsc2hs version 0.68.10 found on system at:
  548. 52.94 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  549. 52.94 s [cabal-doctest] Using hscolour version 1.25 found on system at:
  550. 52.94 s [cabal-doctest] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  551. 52.94 s [cabal-doctest] No jhc found
  552. 52.94 s [cabal-doctest] Using ld found on system at:
  553. 52.94 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  554. 52.94 s [cabal-doctest] No pkg-config found
  555. 52.94 s [cabal-doctest] Using runghc version 9.10.3 found on system at:
  556. 52.94 s [cabal-doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  557. 52.94 s [cabal-doctest] Using strip version 2.44 found on system at:
  558. 52.94 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  559. 52.94 s [cabal-doctest] Using tar found on system at:
  560. 52.94 s [cabal-doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  561. 52.94 s [cabal-doctest] No uhc found
  562. 53.06 s [ghc-paths] Dependency base >=3 && <5: using base-4.20.2.0
  563. 53.06 s [ghc-paths] Source component graph: component lib
  564. 53.06 s [ghc-paths] Configured component graph:
  565. 53.06 s [ghc-paths] component ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  566. 53.06 s [ghc-paths] include base-4.20.2.0-acb8
  567. 53.06 s [ghc-paths] Linked component graph:
  568. 53.06 s [ghc-paths] unit ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  569. 53.06 s [ghc-paths] include base-4.20.2.0-acb8
  570. 53.06 s [ghc-paths] GHC.Paths=ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww:GHC.Paths
  571. 53.06 s [ghc-paths] Ready component graph:
  572. 53.06 s [ghc-paths] definite ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  573. 53.06 s [ghc-paths] depends base-4.20.2.0-acb8
  574. 53.06 s [ghc-paths] Using Cabal-3.12.1.0 compiled by ghc-9.10
  575. 53.06 s [ghc-paths] Using compiler: ghc-9.10.3
  576. 53.06 s [ghc-paths] Using install prefix:
  577. 53.06 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  578. 53.06 s [ghc-paths] Executables installed in:
  579. 53.06 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/bin
  580. 53.06 s [ghc-paths] Libraries installed in:
  581. 53.06 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  582. 53.06 s [ghc-paths] Dynamic Libraries installed in:
  583. 53.06 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  584. 53.06 s [ghc-paths] Private executables installed in:
  585. 53.06 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12
  586. 53.06 s [ghc-paths] Data files installed in:
  587. 53.06 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12
  588. 53.06 s [ghc-paths] Documentation installed in:
  589. 53.06 s [ghc-paths] /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
  590. 53.06 s [ghc-paths] Configuration files installed in:
  591. 53.06 s [ghc-paths] /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/etc
  592. 53.06 s [ghc-paths] No alex found
  593. 53.06 s [ghc-paths] Using ar found on system at:
  594. 53.06 s [ghc-paths] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  595. 53.06 s [ghc-paths] No c2hs found
  596. 53.06 s [ghc-paths] No cpphs found
  597. 53.06 s [ghc-paths] No doctest found
  598. 53.06 s [ghc-paths] Using gcc version 14.3.0 given by user at:
  599. 53.06 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  600. 53.06 s [ghc-paths] Using ghc version 9.10.3 found on system at:
  601. 53.06 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  602. 53.06 s [ghc-paths] Using ghc-pkg version 9.10.3 found on system at:
  603. 53.06 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  604. 53.06 s [ghc-paths] No ghcjs found
  605. 53.06 s [ghc-paths] No ghcjs-pkg found
  606. 53.06 s [ghc-paths] No greencard found
  607. 53.06 s [ghc-paths] Using haddock version 2.31.1 found on system at:
  608. 53.06 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  609. 53.06 s [ghc-paths] No happy found
  610. 53.06 s [ghc-paths] Using haskell-suite found on system at: haskell-suite-dummy-location
  611. 53.06 s [ghc-paths] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  612. 53.06 s [ghc-paths] No hmake found
  613. 53.06 s [ghc-paths] Using hpc version 0.69 found on system at:
  614. 53.06 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  615. 53.06 s [ghc-paths] Using hsc2hs version 0.68.10 found on system at:
  616. 53.06 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  617. 53.06 s [ghc-paths] Using hscolour version 1.25 found on system at:
  618. 53.06 s [ghc-paths] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  619. 53.06 s [ghc-paths] No jhc found
  620. 53.06 s [ghc-paths] Using ld found on system at:
  621. 53.06 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  622. 53.06 s [ghc-paths] No pkg-config found
  623. 53.06 s [ghc-paths] Using runghc version 9.10.3 found on system at:
  624. 53.06 s [ghc-paths] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  625. 53.06 s [ghc-paths] Using strip version 2.44 found on system at:
  626. 53.06 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  627. 53.06 s [ghc-paths] Using tar found on system at:
  628. 53.06 s [ghc-paths] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  629. 53.06 s [ghc-paths] No uhc found
  630. 53.06 s [ghc-paths] Running: /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
  631. 53.11 s [cabal-doctest] Phase: buildPhase
  632. 53.12 s [ghc-paths] Phase: buildPhase
  633. 53.18 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12...
  634. 53.18 s [cabal-doctest] Building library for cabal-doctest-1.0.12...
  635. 53.19 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  636. 53.19 s [ghc-paths] Building library for ghc-paths-0.1.0.12...
  637. 53.30 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o )
  638. 53.32 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
  639. 53.63 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
  640. 55.23 s [ghc-paths] Phase: checkPhase
  641. 55.28 s [ghc-paths] Package has no test suites.
  642. 55.29 s [ghc-paths] Phase: haddockPhase
  643. 55.34 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
  644. 55.48 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  645. 55.48 s [ghc-paths] Running Haddock on library for ghc-paths-0.1.0.12...
  646. 55.84 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, nothing )
  647. 55.95 s [ghc-paths] Haddock coverage:
  648. 55.95 s [ghc-paths] 0% ( 0 / 5) in 'GHC.Paths'
  649. 55.95 s [ghc-paths] Missing documentation for:
  650. 55.95 s [ghc-paths] Module header
  651. 55.95 s [ghc-paths] ghc (GHC/Paths.hs:34)
  652. 55.95 s [ghc-paths] ghc_pkg (GHC/Paths.hs:35)
  653. 55.95 s [ghc-paths] libdir (GHC/Paths.hs:31)
  654. 55.95 s [ghc-paths] docdir (GHC/Paths.hs:32)
  655. 59.98 s [cabal-doctest] Phase: checkPhase
  656. 60.03 s [cabal-doctest] Package has no test suites.
  657. 60.04 s [cabal-doctest] Phase: haddockPhase
  658. 60.28 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12...
  659. 60.28 s [cabal-doctest] Running Haddock on library for cabal-doctest-1.0.12...
  660. 60.76 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing )
  661. 61.45 s [ghc-paths] Documentation created: dist/doc/html/ghc-paths/,
  662. 61.49 s [ghc-paths] dist/doc/html/ghc-paths/ghc-paths.txt
  663. 61.49 s [cabal-doctest] Haddock coverage:
  664. 61.49 s [cabal-doctest] Warning: 'UserHooks' is ambiguous. It is defined
  665. 61.49 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  666. 61.49 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  667. 61.49 s [cabal-doctest] You may be able to disambiguate the identifier by qualifying it or
  668. 61.49 s [cabal-doctest] by specifying the type/value namespace explicitly.
  669. 61.49 s [cabal-doctest] Defaulting to the one defined in ‘Distribution.Simple.UserHooks’
  670. 61.49 s [cabal-doctest] 100% ( 7 / 7) in 'Distribution.Extra.Doctest'
  671. 61.54 s [ghc-paths] Phase: installPhase
  672. 61.61 s [ghc-paths] Installing library in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  673. 61.89 s [ghc-paths] Phase: fixupPhase
  674. 61.92 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  675. 61.92 s [ghc-paths] shrinking /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww-ghc9.10.3.so
  676. 61.93 s [ghc-paths] checking for references to /build/ in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12...
  677. 61.96 s [ghc-paths] patching script interpreter paths in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  678. 61.96 s [ghc-paths] stripping (with command strip and flags -S -p) in /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12/lib
  679. 62.00 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc
  680. 62.01 s [ghc-paths] checking for references to /build/ in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc...
  681. 62.04 s [ghc-paths] patching script interpreter paths in /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc
  682. 62.17 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  683. 62.76 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  684. 62.80 s [post-build-hook] Uploading to the NixCI cache: /nix/store/a0nm5cispl4gxvghdfqs20zkbghk5w9j-ghc-paths-0.1.0.12-doc /nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12
  685. 62.90 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  686. 63.48 s [post-build-hook] copying 1 paths...
  687. 63.48 s [post-build-hook] copying path '/nix/store/ymiwk23zhjcs1p4gzwm3vwk46cxphb0m-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
  688. 64.91 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  689. 65.50 s [post-build-hook] copying 0 paths...
  690. 65.53 s Progress: 3 of 22 built (1 building), 193 of 193 downloaded from cache
  691. 65.61 s Building doctest
  692. 65.82 s [doctest] Phase: setupCompilerEnvironmentPhase
  693. 65.82 s [doctest] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  694. 66.28 s [doctest] Phase: unpackPhase
  695. 66.37 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  696. 66.39 s [doctest] source root is doctest-0.24.2
  697. 66.40 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  698. 66.41 s [doctest] Phase: patchPhase
  699. 66.47 s [doctest] Phase: compileBuildDriverPhase
  700. 66.47 s [doctest] setupCompileFlags: -package-db=/build/tmp.fP5BjGWh5V/setup-package.conf.d -threaded
  701. 66.66 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.fP5BjGWh5V/Main.o )
  702. 66.86 s [doctest] [2 of 2] Linking Setup
  703. 70.11 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  704. 70.23 s [doctest] Phase: configurePhase
  705. 70.30 s [doctest] configureFlags: --verbose --prefix=/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.fP5BjGWh5V/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  706. 70.33 s [doctest] Using Parsec parser
  707. 70.33 s [doctest] Configuring doctest-0.24.2...
  708. 71.24 s [doctest] Flags chosen: cabal-doctest=False
  709. 72.05 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  710. 72.09 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  711. 72.09 s [doctest] Dependency containers: using containers-0.7
  712. 72.09 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  713. 72.09 s [doctest] Dependency directory: using directory-1.3.8.5
  714. 72.09 s [doctest] Dependency exceptions: using exceptions-0.10.9
  715. 72.09 s [doctest] Dependency filepath: using filepath-1.5.4.0
  716. 72.09 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.3
  717. 72.09 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  718. 72.09 s [doctest] Dependency process: using process-1.6.26.1
  719. 72.09 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  720. 72.09 s [doctest] Dependency temporary: using temporary-1.3
  721. 72.09 s [doctest] Dependency transformers: using transformers-0.6.1.1
  722. 72.09 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  723. 72.09 s [doctest] Dependency doctest: using doctest-0.24.2
  724. 72.09 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  725. 72.09 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  726. 72.09 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  727. 72.09 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  728. 72.09 s [doctest] Dependency containers: using containers-0.7
  729. 72.09 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  730. 72.09 s [doctest] Dependency directory: using directory-1.3.8.5
  731. 72.09 s [doctest] Dependency exceptions: using exceptions-0.10.9
  732. 72.09 s [doctest] Dependency filepath: using filepath-1.5.4.0
  733. 72.09 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.3
  734. 72.09 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  735. 72.09 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  736. 72.09 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  737. 72.09 s [doctest] Dependency mockery: using mockery-0.3.5
  738. 72.09 s [doctest] Dependency process: using process-1.6.26.1
  739. 72.09 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  740. 72.09 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  741. 72.09 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  742. 72.09 s [doctest] Dependency temporary: using temporary-1.3
  743. 72.09 s [doctest] Dependency transformers: using transformers-0.6.1.1
  744. 72.09 s [doctest] Source component graph:
  745. 72.09 s [doctest] component test:spec
  746. 72.09 s [doctest] component lib
  747. 72.09 s [doctest] component exe:doctest dependency lib
  748. 72.09 s [doctest] Configured component graph:
  749. 72.09 s [doctest] component doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
  750. 72.09 s [doctest] include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  751. 72.09 s [doctest] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  752. 72.09 s [doctest] include base-4.20.2.0-acb8
  753. 72.09 s [doctest] include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  754. 72.09 s [doctest] include containers-0.7-a3f6
  755. 72.09 s [doctest] include deepseq-1.5.0.0-7e72
  756. 72.09 s [doctest] include directory-1.3.8.5-e377
  757. 72.09 s [doctest] include exceptions-0.10.9-0130
  758. 72.09 s [doctest] include filepath-1.5.4.0-c4eb
  759. 72.09 s [doctest] include ghc-9.10.3-5702
  760. 72.09 s [doctest] include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  761. 72.09 s [doctest] include hspec-2.11.14-K0D92V7bzH349viEnZTxvm
  762. 72.10 s [doctest] include hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
  763. 72.10 s [doctest] include mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
  764. 72.10 s [doctest] include process-1.6.26.1-c5d9
  765. 72.10 s [doctest] include silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
  766. 72.10 s [doctest] include stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
  767. 72.10 s [doctest] include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  768. 72.10 s [doctest] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  769. 72.10 s [doctest] include transformers-0.6.1.1-74e0
  770. 72.10 s [doctest] component doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  771. 72.10 s [doctest] include base-4.20.2.0-acb8
  772. 72.10 s [doctest] include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  773. 72.10 s [doctest] include containers-0.7-a3f6
  774. 72.10 s [doctest] include deepseq-1.5.0.0-7e72
  775. 72.10 s [doctest] include directory-1.3.8.5-e377
  776. 72.10 s [doctest] include exceptions-0.10.9-0130
  777. 72.10 s [doctest] include filepath-1.5.4.0-c4eb
  778. 72.10 s [doctest] include ghc-9.10.3-5702
  779. 72.10 s [doctest] include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  780. 72.10 s [doctest] include process-1.6.26.1-c5d9
  781. 72.10 s [doctest] include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  782. 72.10 s [doctest] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  783. 72.10 s [doctest] include transformers-0.6.1.1-74e0
  784. 72.10 s [doctest] component doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
  785. 72.10 s [doctest] include base-4.20.2.0-acb8
  786. 72.10 s [doctest] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  787. 72.10 s [doctest] Linked component graph:
  788. 72.10 s [doctest] unit doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
  789. 72.10 s [doctest] include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  790. 72.10 s [doctest] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  791. 72.10 s [doctest] include base-4.20.2.0-acb8
  792. 72.10 s [doctest] include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  793. 72.10 s [doctest] include containers-0.7-a3f6
  794. 72.10 s [doctest] include deepseq-1.5.0.0-7e72
  795. 72.10 s [doctest] include directory-1.3.8.5-e377
  796. 72.10 s [doctest] include exceptions-0.10.9-0130
  797. 72.10 s [doctest] include filepath-1.5.4.0-c4eb
  798. 72.10 s [doctest] include ghc-9.10.3-5702
  799. 72.10 s [doctest] include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  800. 72.10 s [doctest] include hspec-2.11.14-K0D92V7bzH349viEnZTxvm
  801. 72.10 s [doctest] include hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
  802. 72.10 s [doctest] include mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
  803. 72.10 s [doctest] include process-1.6.26.1-c5d9
  804. 72.10 s [doctest] include silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
  805. 72.10 s [doctest] include stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
  806. 72.10 s [doctest] include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  807. 72.10 s [doctest] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  808. 72.10 s [doctest] include transformers-0.6.1.1-74e0
  809. 72.10 s [doctest] unit doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  810. 72.10 s [doctest] include base-4.20.2.0-acb8
  811. 72.10 s [doctest] include code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  812. 72.10 s [doctest] include containers-0.7-a3f6
  813. 72.10 s [doctest] include deepseq-1.5.0.0-7e72
  814. 72.10 s [doctest] include directory-1.3.8.5-e377
  815. 72.10 s [doctest] include exceptions-0.10.9-0130
  816. 72.10 s [doctest] include filepath-1.5.4.0-c4eb
  817. 72.10 s [doctest] include ghc-9.10.3-5702
  818. 72.10 s [doctest] include ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  819. 72.10 s [doctest] include process-1.6.26.1-c5d9
  820. 72.10 s [doctest] include syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  821. 72.10 s [doctest] include temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  822. 72.10 s [doctest] include transformers-0.6.1.1-74e0
  823. 72.10 s [doctest] Test.DocTest=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR:Test.DocTest.Internal.Run
  824. 72.10 s [doctest] unit doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
  825. 72.10 s [doctest] include base-4.20.2.0-acb8
  826. 72.10 s [doctest] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  827. 72.10 s [doctest] Ready component graph:
  828. 72.10 s [doctest] definite doctest-0.24.2-DM1nRfpekBiDYfA0F1Xpwe-spec
  829. 72.10 s [doctest] depends HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  830. 72.10 s [doctest] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  831. 72.10 s [doctest] depends base-4.20.2.0-acb8
  832. 72.10 s [doctest] depends code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  833. 72.10 s [doctest] depends containers-0.7-a3f6
  834. 72.10 s [doctest] depends deepseq-1.5.0.0-7e72
  835. 72.10 s [doctest] depends directory-1.3.8.5-e377
  836. 72.10 s [doctest] depends exceptions-0.10.9-0130
  837. 72.10 s [doctest] depends filepath-1.5.4.0-c4eb
  838. 72.10 s [doctest] depends ghc-9.10.3-5702
  839. 72.10 s [doctest] depends ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  840. 72.10 s [doctest] depends hspec-2.11.14-K0D92V7bzH349viEnZTxvm
  841. 72.10 s [doctest] depends hspec-core-2.11.14-8XRH3K8BPWG69bHF50sBfH
  842. 72.10 s [doctest] depends mockery-0.3.5-3Qryyw7zMx12T20sfyazvN
  843. 72.10 s [doctest] depends process-1.6.26.1-c5d9
  844. 72.10 s [doctest] depends silently-1.2.5.4-ByKm4HpsZRZGBC8N5tSYGn
  845. 72.10 s [doctest] depends stringbuilder-0.5.1-8L9q1CfIA5xBia3rv7hOIN
  846. 72.10 s [doctest] depends syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  847. 72.10 s [doctest] depends temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  848. 72.10 s [doctest] depends transformers-0.6.1.1-74e0
  849. 72.10 s [doctest] definite doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  850. 72.10 s [doctest] depends base-4.20.2.0-acb8
  851. 72.10 s [doctest] depends code-page-0.2.1-Jt6CrfBFGlS4Z4wzcZWnq2
  852. 72.10 s [doctest] depends containers-0.7-a3f6
  853. 72.10 s [doctest] depends deepseq-1.5.0.0-7e72
  854. 72.10 s [doctest] depends directory-1.3.8.5-e377
  855. 72.10 s [doctest] depends exceptions-0.10.9-0130
  856. 72.10 s [doctest] depends filepath-1.5.4.0-c4eb
  857. 72.10 s [doctest] depends ghc-9.10.3-5702
  858. 72.10 s [doctest] depends ghc-paths-0.1.0.12-6oH6WUIZVsxv28KmA80ww
  859. 72.10 s [doctest] depends process-1.6.26.1-c5d9
  860. 72.10 s [doctest] depends syb-0.7.2.4-4DQrK89tOsuFUDVxKdoNj
  861. 72.10 s [doctest] depends temporary-1.3-EOs1QAHjJhILyOEg1JGJM0
  862. 72.10 s [doctest] depends transformers-0.6.1.1-74e0
  863. 72.10 s [doctest] definite doctest-0.24.2-9GcIPE00TeSCcMZoB8T4Sl-doctest
  864. 72.10 s [doctest] depends base-4.20.2.0-acb8
  865. 72.10 s [doctest] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  866. 72.10 s [doctest] Using Cabal-3.12.1.0 compiled by ghc-9.10
  867. 72.10 s [doctest] Using compiler: ghc-9.10.3
  868. 72.10 s [doctest] Using install prefix:
  869. 72.10 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
  870. 72.10 s [doctest] Executables installed in:
  871. 72.10 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
  872. 72.10 s [doctest] Libraries installed in:
  873. 72.10 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  874. 72.10 s [doctest] Dynamic Libraries installed in:
  875. 72.10 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  876. 72.10 s [doctest] Private executables installed in:
  877. 72.13 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/libexec/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2
  878. 72.13 s [doctest] Data files installed in:
  879. 72.13 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/share/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2
  880. 72.13 s [doctest] Documentation installed in:
  881. 72.13 s [doctest] /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  882. 72.13 s [doctest] Configuration files installed in:
  883. 72.13 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/etc
  884. 72.13 s [doctest] No alex found
  885. 72.13 s [doctest] Using ar found on system at:
  886. 72.13 s [doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  887. 72.13 s [doctest] No c2hs found
  888. 72.13 s [doctest] No cpphs found
  889. 72.13 s [doctest] No doctest found
  890. 72.13 s [doctest] Using gcc version 14.3.0 given by user at:
  891. 72.13 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  892. 72.13 s [doctest] Using ghc version 9.10.3 found on system at:
  893. 72.13 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  894. 72.13 s [doctest] Using ghc-pkg version 9.10.3 found on system at:
  895. 72.13 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  896. 72.13 s [doctest] No ghcjs found
  897. 72.13 s [doctest] No ghcjs-pkg found
  898. 72.14 s [doctest] No greencard found
  899. 72.14 s [doctest] Using haddock version 2.31.1 found on system at:
  900. 72.14 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  901. 72.14 s [doctest] No happy found
  902. 72.14 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  903. 72.14 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  904. 72.14 s [doctest] No hmake found
  905. 72.14 s [doctest] Using hpc version 0.69 found on system at:
  906. 72.14 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  907. 72.14 s [doctest] Using hsc2hs version 0.68.10 found on system at:
  908. 72.14 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  909. 72.14 s [doctest] Using hscolour version 1.25 found on system at:
  910. 72.14 s [doctest] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  911. 72.14 s [doctest] No jhc found
  912. 72.14 s [doctest] Using ld found on system at:
  913. 72.14 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  914. 72.14 s [doctest] No pkg-config found
  915. 72.14 s [doctest] Using runghc version 9.10.3 found on system at:
  916. 72.14 s [doctest] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  917. 72.14 s [doctest] Using strip version 2.44 found on system at:
  918. 72.14 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  919. 72.14 s [doctest] Using tar found on system at:
  920. 72.14 s [doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  921. 72.14 s [doctest] No uhc found
  922. 72.40 s [doctest] Phase: buildPhase
  923. 72.61 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  924. 72.63 s [doctest] Building test suite 'spec' for doctest-0.24.2...
  925. 74.03 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  926. 74.25 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  927. 78.02 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  928. 78.02 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  929. 78.11 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  930. 78.11 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  931. 78.11 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  932. 78.31 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  933. 78.31 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  934. 78.31 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  935. 78.31 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  936. 78.31 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  937. 78.31 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  938. 78.31 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  939. 78.31 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  940. 78.31 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  941. 78.31 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  942. 78.31 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  943. 78.31 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  944. 78.97 s [cabal-doctest] Documentation created: dist/doc/html/cabal-doctest/,
  945. 78.97 s [cabal-doctest] dist/doc/html/cabal-doctest/cabal-doctest.txt
  946. 79.16 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  947. 79.16 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  948. 79.16 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  949. 79.16 s [doctest] [23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
  950. 79.16 s [doctest] [24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
  951. 79.16 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  952. 79.16 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  953. 79.20 s [cabal-doctest] Phase: installPhase
  954. 79.39 s [doctest] [27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
  955. 79.42 s [cabal-doctest] Installing library in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/cabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m
  956. 79.44 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  957. 80.06 s [cabal-doctest] Phase: fixupPhase
  958. 80.11 s [doctest] [29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
  959. 80.12 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
  960. 80.13 s [cabal-doctest] shrinking /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHScabal-doctest-1.0.12-AsRuuIaBriV8XLsESCiT1m-ghc9.10.3.so
  961. 80.14 s [cabal-doctest] checking for references to /build/ in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12...
  962. 80.21 s [cabal-doctest] patching script interpreter paths in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12
  963. 80.21 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  964. 80.23 s [cabal-doctest] stripping (with command strip and flags -S -p) in /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12/lib
  965. 80.50 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
  966. 80.51 s [cabal-doctest] checking for references to /build/ in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc...
  967. 80.56 s [cabal-doctest] patching script interpreter paths in /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
  968. 80.89 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
  969. 82.36 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  970. 82.47 s [post-build-hook] Uploading to the NixCI cache: /nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12 /nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc
  971. 83.13 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  972. 83.23 s [post-build-hook] copying 2 paths...
  973. 83.28 s [post-build-hook] copying path '/nix/store/rk297j9fidnzgl27gayrnfqvxsxmkj75-cabal-doctest-1.0.12-doc' to 'https://cache.nix-ci.com'...
  974. 83.75 s [post-build-hook] copying path '/nix/store/09796ziywv1s52214c383r9k7v4i34ww-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...
  975. 84.96 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  976. 85.34 s [post-build-hook] copying 0 paths...
  977. 85.56 s Progress: 4 of 22 built (1 building), 193 of 193 downloaded from cache
  978. 85.56 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  979. 85.56 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  980. 85.56 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  981. 85.56 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  982. 85.56 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  983. 85.56 s [doctest] [36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
  984. 85.56 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  985. 85.56 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  986. 85.56 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  987. 85.56 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  988. 85.56 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  989. 85.56 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  990. 85.56 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  991. 85.56 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  992. 91.60 s [doctest] [45 of 45] Linking dist/build/spec/spec
  993. 105.94 s [doctest] Preprocessing library for doctest-0.24.2...
  994. 105.95 s [doctest] Building library for doctest-0.24.2...
  995. 107.87 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  996. 109.19 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  997. 118.36 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  998. 118.40 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  999. 118.40 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  1000. 118.40 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
  1001. 118.40 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  1002. 118.40 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  1003. 118.40 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  1004. 118.40 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
  1005. 118.40 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  1006. 118.40 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  1007. 118.40 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  1008. 118.40 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
  1009. 118.40 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
  1010. 118.40 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  1011. 118.40 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  1012. 121.12 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
  1013. 121.22 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  1014. 122.20 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
  1015. 122.29 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  1016. 124.04 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  1017. 124.08 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  1018. 125.41 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  1019. 125.91 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
  1020. 125.97 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  1021. 128.43 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  1022. 129.48 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  1023. 136.87 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  1024. 136.91 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  1025. 136.91 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  1026. 136.91 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  1027. 136.91 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  1028. 136.91 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  1029. 136.91 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  1030. 136.91 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  1031. 136.91 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  1032. 136.91 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  1033. 138.29 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  1034. 138.29 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  1035. 138.29 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  1036. 138.29 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  1037. 138.29 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  1038. 139.26 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  1039. 139.61 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  1040. 140.65 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  1041. 141.11 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  1042. 142.12 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  1043. 142.16 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  1044. 143.55 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  1045. 144.19 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  1046. 144.63 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  1047. 159.54 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  1048. 159.55 s [doctest] Building executable 'doctest' for doctest-0.24.2...
  1049. 159.92 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  1050. 160.95 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  1051. 161.62 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  1052. 173.83 s [doctest] buildPhase completed in 1 minutes 42 seconds
  1053. 173.83 s [doctest] Phase: checkPhase
  1054. 174.90 s [doctest] Running 1 test suites...
  1055. 174.90 s [doctest] Test suite spec: RUNNING...
  1056. 174.93 s [doctest]
  1057. 174.93 s [doctest] Extract
  1058. 174.93 s [doctest] extract
  1059. 175.11 s [doctest] extracts documentation for a top-level declaration [✔]
  1060. 175.23 s [doctest] extracts documentation from argument list [✔]
  1061. 175.30 s [doctest] extracts documentation for a type class function [✔]
  1062. 175.40 s [doctest] extracts documentation from the argument list of a type class function [✔]
  1063. 175.49 s [doctest] extracts documentation from the module header [✔]
  1064. 175.60 s [doctest] extracts documentation from imported modules [✔]
  1065. 175.69 s [doctest] extracts documentation from export list [✔]
  1066. 175.79 s [doctest] extracts documentation from named chunks [✔]
  1067. 175.88 s [doctest] returns docstrings in the same order they appear in the source [✔]
  1068. 175.99 s [doctest] extracts $setup code [✔]
  1069. 176.07 s [doctest] fails on invalid flags [✔]
  1070. 176.07 s [doctest] extract (regression tests)
  1071. 176.17 s [doctest] works with infix operators [✔]
  1072. 176.26 s [doctest] works with parallel list comprehensions [✔]
  1073. 176.35 s [doctest] works with list comprehensions in instance definitions [✔]
  1074. 176.44 s [doctest] works with foreign imports [✔]
  1075. 176.52 s [doctest] works for rewrite rules [✔]
  1076. 176.62 s [doctest] works for rewrite rules with type signatures [✔]
  1077. 176.72 s [doctest] strips CR from dos line endings [✔]
  1078. 176.83 s [doctest] works with a module that splices in an expression from an other module [✔]
  1079. 176.93 s [doctest] works for type families and GHC 7.6.1 [✔]
  1080. 176.93 s [doctest] Info
  1081. 176.93 s [doctest] formatInfo
  1082. 177.10 s [doctest] formats --info output [✔]
  1083. 177.10 s [doctest] Interpreter
  1084. 177.10 s [doctest] interpreterSupported
  1085. 177.21 s [doctest] indicates whether GHCi is supported on current platform [✔]
  1086. 177.21 s [doctest] ghcInfo
  1087. 177.33 s [doctest] includes "Have interpreter" [✔]
  1088. 177.33 s [doctest] safeEval
  1089. 177.90 s [doctest] evaluates an expression [✔]
  1090. 178.54 s [doctest] returns Left on unterminated multiline command [✔]
  1091. 178.54 s [doctest] filterExpression
  1092. 178.54 s [doctest] removes :set -XTemplateHaskell [✔]
  1093. 178.54 s [doctest] filters -XTemplateHaskell [✔]
  1094. 178.54 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  1095. 178.54 s [doctest] Language.Haskell.GhciWrapper
  1096. 178.54 s [doctest] evalEcho
  1097. 179.36 s [doctest] prints result to stdout [✔]
  1098. 179.36 s [doctest] evalWith
  1099. 179.36 s [doctest] with PreserveIt
  1100. 180.09 s [doctest] preserves it [✔]
  1101. 180.13 s [doctest] eval
  1102. 180.71 s [doctest] shows literals [✔]
  1103. 181.34 s [doctest] shows string literals containing Unicode [✔]
  1104. 181.97 s [doctest] evaluates simple expressions [✔]
  1105. 182.69 s [doctest] supports let bindings [✔]
  1106. 183.30 s [doctest] allows import statements [✔]
  1107. 183.89 s [doctest] captures stdout [✔]
  1108. 184.50 s [doctest] captures stdout (Unicode) [✔]
  1109. 185.22 s [doctest] captures stdout (empty line) [✔]
  1110. 185.94 s [doctest] captures stdout (multiple lines) [✔]
  1111. 186.53 s [doctest] captures stderr [✔]
  1112. 187.11 s [doctest] captures stderr (Unicode) [✔]
  1113. 187.77 s [doctest] shows exceptions [✔]
  1114. 188.39 s [doctest] shows exceptions (ExitCode) [✔]
  1115. 189.00 s [doctest] gives an error message for identifiers that are not in scope [✔]
  1116. 189.00 s [doctest] when configVerbose is True
  1117. 189.54 s [doctest] prints prompt [✔]
  1118. 189.54 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  1119. 190.12 s [doctest] does not fail on marker expression (bug fix) [✔]
  1120. 190.12 s [doctest] with NoImplicitPrelude
  1121. 190.69 s [doctest] works [✔]
  1122. 190.69 s [doctest] with a strange String type
  1123. 191.27 s [doctest] works [✔]
  1124. 191.27 s [doctest] Location
  1125. 191.27 s [doctest] toLocation
  1126. 191.27 s [doctest] works for a regular SrcSpan [✔]
  1127. 191.27 s [doctest] works for a single-line SrcSpan [✔]
  1128. 191.27 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  1129. 191.27 s [doctest] works for a bad SrcSpan [✔]
  1130. 191.27 s [doctest] works for a SrcLoc with bad locations [✔]
  1131. 191.27 s [doctest] enumerate
  1132. 191.27 s [doctest] replicates UnhelpfulLocation [✔]
  1133. 191.27 s [doctest] enumerates Location [✔]
  1134. 191.27 s [doctest] Main
  1135. 191.27 s [doctest] doctest
  1136. 191.99 s [doctest] testSimple [✔]
  1137. 192.83 s [doctest] it-variable [✔]
  1138. 193.73 s [doctest] it-variable in $setup [✔]
  1139. 194.61 s [doctest] failing [✔]
  1140. 195.53 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  1141. 195.53 s [doctest] without --fail-fast
  1142. 196.46 s [doctest] continuous even if some tests fail [✔]
  1143. 196.46 s [doctest] with --fail-fast
  1144. 197.38 s [doctest] stops after the first failure [✔]
  1145. 198.30 s [doctest] stops after failures in $setup [✔]
  1146. 200.11 s [doctest] testImport [✔]
  1147. 201.30 s [doctest] testCommentLocation [✔]
  1148. 202.05 s [doctest] testPutStr [✔]
  1149. 202.70 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  1150. 203.59 s [doctest] testBlankline [✔]
  1151. 204.36 s [doctest] examples from the same Haddock comment share the same scope [✔]
  1152. 205.13 s [doctest] testDocumentationForArguments [✔]
  1153. 205.85 s [doctest] template-haskell [✔]
  1154. 206.40 s [doctest] handles source files with CRLF line endings [✔]
  1155. 206.93 s [doctest] runs $setup before each test group [✔]
  1156. 207.47 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  1157. 208.10 s [doctest] ignores trailing whitespace when matching test output [✔]
  1158. 208.14 s [doctest] doctest as a runner for QuickCheck properties
  1159. 208.85 s [doctest] runs a boolean property [✔]
  1160. 209.74 s [doctest] runs an explicitly quantified property [✔]
  1161. 210.57 s [doctest] runs an implicitly quantified property [✔]
  1162. 211.30 s [doctest] reports a failing property [✔]
  1163. 212.10 s [doctest] runs a boolean property with an explicit type signature [✔]
  1164. 213.13 s [doctest] runs $setup before each property [✔]
  1165. 213.13 s [doctest] doctest (regression tests)
  1166. 214.43 s [doctest] bugfixWorkingDirectory [✔]
  1167. 215.15 s [doctest] bugfixOutputToStdErr [✔]
  1168. 215.91 s [doctest] bugfixImportHierarchical [✔]
  1169. 216.73 s [doctest] bugfixMultipleModules [✔]
  1170. 218.23 s [doctest] testCPP [✔]
  1171. 219.48 s [doctest] template-haskell-bugfix [✔]
  1172. 220.44 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  1173. 221.28 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  1174. 221.34 s [doctest] Options
  1175. 221.34 s [doctest] parseOptions
  1176. 221.34 s [doctest] strips --optghc [✔]
  1177. 221.34 s [doctest] strips --optghc= [✔]
  1178. 221.34 s [doctest] with ghc options that are not valid with --interactive
  1179. 221.38 s [doctest] returns ProxyToGhc [✔]
  1180. 221.38 s [doctest] +++ OK, passed 100 tests.
  1181. 221.38 s [doctest] with --interactive
  1182. 221.38 s [doctest] disables magic mode [✔]
  1183. 221.38 s [doctest] filters out --interactive [✔]
  1184. 221.38 s [doctest] accepts --fast [✔]
  1185. 221.38 s [doctest] --no-magic
  1186. 221.38 s [doctest] without --no-magic
  1187. 221.38 s [doctest] enables magic mode [✔]
  1188. 221.38 s [doctest] with --no-magic
  1189. 221.38 s [doctest] disables magic mode [✔]
  1190. 221.38 s [doctest] --fast
  1191. 221.38 s [doctest] without --fast
  1192. 221.38 s [doctest] disables fast mode [✔]
  1193. 221.38 s [doctest] with --fast
  1194. 221.38 s [doctest] enables fast mode [✔]
  1195. 221.38 s [doctest] --preserve-it
  1196. 221.38 s [doctest] without --preserve-it
  1197. 221.38 s [doctest] does not preserve the `it` variable [✔]
  1198. 221.38 s [doctest] with --preserve-it
  1199. 221.38 s [doctest] preserves the `it` variable [✔]
  1200. 221.38 s [doctest] --fail-fast
  1201. 221.38 s [doctest] without --fail-fast
  1202. 221.38 s [doctest] disables fail-fast mode [✔]
  1203. 221.38 s [doctest] with --fail-fast
  1204. 221.38 s [doctest] enables fail-fast mode [✔]
  1205. 221.38 s [doctest] with --help
  1206. 221.39 s [doctest] outputs usage information [✔]
  1207. 221.39 s [doctest] with --version
  1208. 221.39 s [doctest] outputs version information [✔]
  1209. 221.39 s [doctest] with --info
  1210. 221.55 s [doctest] outputs machine readable version information [✔]
  1211. 221.55 s [doctest] --verbose
  1212. 221.55 s [doctest] without --verbose
  1213. 221.55 s [doctest] is not verbose by default [✔]
  1214. 221.55 s [doctest] with --verbose
  1215. 221.55 s [doctest] parses verbose option [✔]
  1216. 221.55 s [doctest] PackageDBs
  1217. 221.55 s [doctest] getPackageDBsFromEnv
  1218. 221.55 s [doctest] uses global and user when no env used [✔]
  1219. 221.56 s [doctest] respects GHC_PACKAGE_PATH [✔]
  1220. 221.56 s [doctest] Parse
  1221. 221.56 s [doctest] extractDocTests
  1222. 221.62 s [doctest] extracts properties from a module [✔]
  1223. 221.72 s [doctest] extracts examples from a module [✔]
  1224. 221.82 s [doctest] extracts examples from documentation for non-exported names [✔]
  1225. 221.93 s [doctest] extracts multiple examples from a module [✔]
  1226. 222.03 s [doctest] returns an empty list, if documentation contains no examples [✔]
  1227. 222.08 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  1228. 222.16 s [doctest] keeps modules that only contain setup code [✔]
  1229. 222.16 s [doctest] parseInteractions (an internal function)
  1230. 222.16 s [doctest] parses an interaction [✔]
  1231. 222.16 s [doctest] drops whitespace as appropriate [✔]
  1232. 222.16 s [doctest] parses an interaction without a result [✔]
  1233. 222.16 s [doctest] works with a complex example [✔]
  1234. 222.16 s [doctest] attaches location information to parsed interactions [✔]
  1235. 222.16 s [doctest] basic multiline [✔]
  1236. 222.16 s [doctest] multiline align output [✔]
  1237. 222.16 s [doctest] multiline align output with >>> [✔]
  1238. 222.16 s [doctest] parses wild cards lines [✔]
  1239. 222.16 s [doctest] parses wild card chunks [✔]
  1240. 222.17 s [doctest] parseProperties (an internal function)
  1241. 222.17 s [doctest] parses a property [✔]
  1242. 222.17 s [doctest] mkLineChunks (an internal function)
  1243. 222.17 s [doctest] replaces ellipsis with WildCardChunks [✔]
  1244. 222.17 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  1245. 222.17 s [doctest] handles leading and trailing dots [✔]
  1246. 222.17 s [doctest] handles leading and trailing ellipsis [✔]
  1247. 222.17 s [doctest] Property
  1248. 222.17 s [doctest] runProperty
  1249. 223.12 s [doctest] reports a failing property [✔]
  1250. 223.98 s [doctest] runs a Bool property [✔]
  1251. 224.87 s [doctest] runs a Bool property with an explicit type signature [✔]
  1252. 225.59 s [doctest] runs an implicitly quantified property [✔]
  1253. 226.31 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  1254. 226.89 s [doctest] runs an explicitly quantified property [✔]
  1255. 227.76 s [doctest] allows to mix implicit and explicit quantification [✔]
  1256. 228.75 s [doctest] reports the value for which a property fails [✔]
  1257. 229.62 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  1258. 230.62 s [doctest] defaults ambiguous type variables to Integer [✔]
  1259. 230.62 s [doctest] freeVariables
  1260. 231.25 s [doctest] finds a free variables in a term [✔]
  1261. 231.90 s [doctest] ignores duplicates [✔]
  1262. 232.57 s [doctest] works for terms with multiple names [✔]
  1263. 233.38 s [doctest] works for names that contain a prime [✔]
  1264. 234.09 s [doctest] works for names that are similar to other names that are in scope [✔]
  1265. 234.09 s [doctest] parseNotInScope
  1266. 234.09 s [doctest] when error message was produced by GHC 7.4.1
  1267. 234.09 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  1268. 234.09 s [doctest] ignores duplicates [✔]
  1269. 234.09 s [doctest] works for variable names that contain a prime [✔]
  1270. 234.09 s [doctest] works for error messages with suggestions [✔]
  1271. 234.09 s [doctest] when error message was produced by GHC 8.0.1
  1272. 234.09 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  1273. 234.09 s [doctest] ignores duplicates [✔]
  1274. 234.09 s [doctest] works for variable names that contain a prime [✔]
  1275. 234.09 s [doctest] works for error messages with suggestions [✔]
  1276. 234.09 s [doctest] Run
  1277. 234.09 s [doctest] doctest
  1278. 235.22 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  1279. 235.22 s [doctest] prints help on --help [✔]
  1280. 235.22 s [doctest] prints version on --version [✔]
  1281. 236.58 s [doctest] accepts arbitrary GHC options [✔]
  1282. 237.76 s [doctest] accepts GHC options with --optghc [✔]
  1283. 238.97 s [doctest] prints a deprecation message for --optghc [✔]
  1284. 239.18 s [doctest] prints error message on invalid option [✔]
  1285. 240.40 s [doctest] interprets GHC response files [✔]
  1286. 241.51 s [doctest] prints verbose description of a specification [✔]
  1287. 242.79 s [doctest] prints verbose description of a property [✔]
  1288. 243.82 s [doctest] prints verbose error [✔]
  1289. 245.48 s [doctest] can deal with potentially problematic GHC options [✔]
  1290. 245.49 s [doctest] doctestWithResult
  1291. 245.50 s [doctest] on parse error
  1292. 245.63 s [doctest] aborts with (ExitFailure 1) [✔]
  1293. 245.75 s [doctest] prints a useful error message [✔]
  1294. 245.76 s [doctest] expandDirs
  1295. 245.76 s [doctest] expands a directory [✔]
  1296. 245.77 s [doctest] ignores files [✔]
  1297. 245.77 s [doctest] ignores random things [✔]
  1298. 245.78 s [doctest] Runner
  1299. 245.78 s [doctest] report
  1300. 245.78 s [doctest] when mode is interactive
  1301. 245.79 s [doctest] writes to stderr [✔]
  1302. 245.79 s [doctest] when mode is non-interactive
  1303. 245.80 s [doctest] writes to stderr [✔]
  1304. 245.81 s [doctest] report_
  1305. 245.81 s [doctest] when mode is interactive
  1306. 245.81 s [doctest] writes transient output to stderr [✔]
  1307. 245.82 s [doctest] when mode is non-interactive
  1308. 245.83 s [doctest] is ignored [✔]
  1309. 245.84 s [doctest] Runner.Example
  1310. 245.84 s [doctest] mkResult
  1311. 246.15 s [doctest] returns Equal when output matches [✔]
  1312. 246.15 s [doctest] +++ OK, passed 100 tests.
  1313. 246.16 s [doctest] ignores trailing whitespace [✔]
  1314. 246.16 s [doctest] with WildCardLine
  1315. 246.16 s [doctest] matches zero lines [✔]
  1316. 246.17 s [doctest] matches first zero line [✔]
  1317. 246.17 s [doctest] matches final zero line [✔]
  1318. 246.17 s [doctest] matches an arbitrary number of lines [✔]
  1319. 246.17 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  1320. 246.17 s [doctest] +++ OK, passed 100 tests.
  1321. 246.17 s [doctest] with WildCardChunk
  1322. 246.17 s [doctest] matches an arbitrary line chunk [✔]
  1323. 246.17 s [doctest] matches an arbitrary line chunk at end [✔]
  1324. 246.17 s [doctest] does not match at end [✔]
  1325. 246.17 s [doctest] does not match at start [✔]
  1326. 246.17 s [doctest] when output does not match
  1327. 246.17 s [doctest] constructs failure message [✔]
  1328. 246.17 s [doctest] constructs failure message for multi-line output [✔]
  1329. 246.17 s [doctest] when any output line contains "unsafe" characters
  1330. 246.17 s [doctest] uses show to format output lines [✔]
  1331. 246.17 s [doctest] insert caret after last matching character on different lengths [✔]
  1332. 246.17 s [doctest] insert caret after mismatching line for multi-line output [✔]
  1333. 246.17 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  1334. 246.17 s [doctest] insert caret after longest match for wildcard [✔]
  1335. 246.17 s [doctest] show expanded pattern for long matches [✔]
  1336. 246.17 s [doctest] Util
  1337. 246.17 s [doctest] convertDosLineEndings
  1338. 246.17 s [doctest] converts CRLF to LF [✔]
  1339. 246.17 s [doctest] strips a trailing CR [✔]
  1340. 246.17 s [doctest] takeWhileEnd
  1341. 246.18 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  1342. 246.18 s [doctest]
  1343. 246.18 s [doctest] Finished in 71.2484 seconds
  1344. 246.18 s [doctest] 198 examples, 0 failures
  1345. 246.23 s [doctest] Test suite spec: PASS
  1346. 246.23 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  1347. 246.23 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  1348. 246.25 s [doctest] checkPhase completed in 1 minutes 12 seconds
  1349. 246.25 s [doctest] Phase: haddockPhase
  1350. 246.83 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  1351. 246.87 s [doctest] Preprocessing library for doctest-0.24.2...
  1352. 246.88 s [doctest] Running Haddock on library for doctest-0.24.2...
  1353. 249.34 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, nothing )
  1354. 249.64 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, nothing )
  1355. 250.97 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing )
  1356. 251.16 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, nothing )
  1357. 251.26 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, nothing )
  1358. 251.33 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing )
  1359. 251.50 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, nothing )
  1360. 251.59 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, nothing )
  1361. 251.69 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, nothing )
  1362. 251.73 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, nothing )
  1363. 251.76 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, nothing )
  1364. 251.78 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, nothing )
  1365. 252.41 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, nothing )
  1366. 252.65 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing )
  1367. 252.66 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing )
  1368. 252.67 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, nothing )
  1369. 252.69 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, nothing )
  1370. 253.21 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing )
  1371. 253.22 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, nothing )
  1372. 253.39 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing )
  1373. 253.40 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, nothing )
  1374. 253.59 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, nothing )
  1375. 253.67 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, nothing )
  1376. 253.94 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, nothing )
  1377. 254.02 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing )
  1378. 254.03 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, nothing )
  1379. 254.03 s [doctest] Haddock coverage:
  1380. 254.04 s [doctest] Warning: Imports: Could not find documentation for exported module: Imports
  1381. 254.06 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  1382. 254.06 s [doctest] Missing documentation for:
  1383. 254.06 s [doctest] Module header
  1384. 254.06 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:10)
  1385. 254.06 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  1386. 254.06 s [doctest] Missing documentation for:
  1387. 254.06 s [doctest] Module header
  1388. 254.06 s [doctest] Warning: 'SomeException' is ambiguous. It is defined
  1389. 254.06 s [doctest] * in ‘GHC.Internal.Exception.Type’
  1390. 254.06 s [doctest] * in ‘GHC.Internal.Exception.Type’
  1391. 254.06 s [doctest] You may be able to disambiguate the identifier by qualifying it or
  1392. 254.06 s [doctest] by specifying the type/value namespace explicitly.
  1393. 254.06 s [doctest] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  1394. 254.06 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  1395. 254.06 s [doctest] Missing documentation for:
  1396. 254.06 s [doctest] Module header
  1397. 254.07 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  1398. 254.07 s [doctest] Missing documentation for:
  1399. 254.07 s [doctest] Module header
  1400. 254.07 s [doctest] DocTest (src/Parse.hs:29)
  1401. 254.07 s [doctest] Expression (src/Parse.hs:44)
  1402. 254.07 s [doctest] ExpectedResult (src/Parse.hs:45)
  1403. 254.07 s [doctest] ExpectedLine (src/Parse.hs:38)
  1404. 254.07 s [doctest] LineChunk (src/Parse.hs:32)
  1405. 254.07 s [doctest] parseModules (src/Parse.hs:60)
  1406. 254.07 s [doctest] Warning: 'report_' is out of scope.
  1407. 254.07 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  1408. 254.08 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  1409. 254.08 s [doctest] Missing documentation for:
  1410. 254.08 s [doctest] Module header
  1411. 254.08 s [doctest] Result (src/Run.hs:139)
  1412. 254.08 s [doctest] Config (src/Options.hs:58)
  1413. 254.08 s [doctest] isSuccess (src/Runner.hs:55)
  1414. 254.08 s [doctest] defaultConfig (src/Options.hs:68)
  1415. 254.08 s [doctest] doctestWithRepl (src/Run.hs:67)
  1416. 254.08 s [doctest] doctestWith (src/Run.hs:137)
  1417. 254.08 s [doctest] formatSummary (src/Runner.hs:58)
  1418. 254.08 s [doctest] evaluateResult (src/Run.hs:142)
  1419. 254.08 s [doctest] doctestWithResult (src/Run.hs:145)
  1420. 254.08 s [doctest] runDocTests (src/Run.hs:155)
  1421. 254.08 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  1422. 254.08 s [doctest] Missing documentation for:
  1423. 254.08 s [doctest] Module header
  1424. 293.14 s [doctest] Documentation created: dist/doc/html/doctest/,
  1425. 293.14 s [doctest] dist/doc/html/doctest/doctest.txt
  1426. 293.38 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  1427. 293.40 s [doctest] haddockPhase completed in 47 seconds
  1428. 293.40 s [doctest] Phase: installPhase
  1429. 293.75 s [doctest] Installing library in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1430. 294.01 s [doctest] Installing executable doctest in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
  1431. 294.01 s [doctest] Warning: The directory
  1432. 294.01 s [doctest] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin is not in the
  1433. 294.01 s [doctest] system search path.
  1434. 296.12 s [doctest] Phase: fixupPhase
  1435. 296.16 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
  1436. 296.16 s [doctest] shrinking /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  1437. 296.58 s [doctest] shrinking /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSdoctest-0.24.2-18dgXXsZmap5NU7dF4zxUR-ghc9.10.3.so
  1438. 296.61 s [doctest] checking for references to /build/ in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2...
  1439. 296.80 s [doctest] patching script interpreter paths in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2
  1440. 296.82 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/lib /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin
  1441. 297.66 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
  1442. 297.67 s [doctest] checking for references to /build/ in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc...
  1443. 297.71 s [doctest] patching script interpreter paths in /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
  1444. 298.31 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
  1445. 298.96 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  1446. 299.08 s [post-build-hook] Uploading to the NixCI cache: /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2 /nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc
  1447. 299.18 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1448. 299.21 s [post-build-hook] copying 2 paths...
  1449. 299.21 s [post-build-hook] copying path '/nix/store/9w16jfsmqf4xq8g2y6i0cvy9h68ki5hm-doctest-0.24.2-doc' to 'https://cache.nix-ci.com'...
  1450. 299.75 s [post-build-hook] copying path '/nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  1451. 359.50 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1452. 359.72 s [post-build-hook] copying 0 paths...
  1453. 359.96 s Progress: 5 of 22 built, 193 of 193 downloaded from cache
  1454. 360.09 s Building duoids
  1455. 360.21 s Building vector
  1456. 360.25 s [duoids] Phase: setupCompilerEnvironmentPhase
  1457. 360.26 s [duoids] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  1458. 360.43 s [vector] Phase: setupCompilerEnvironmentPhase
  1459. 360.45 s [vector] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  1460. 360.85 s [duoids] Phase: unpackPhase
  1461. 360.87 s [duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./core
  1462. 360.97 s [duoids] source root is core
  1463. 361.01 s [duoids] Phase: patchPhase
  1464. 361.06 s [duoids] Phase: compileBuildDriverPhase
  1465. 361.08 s [duoids] setupCompileFlags: -package-db=/build/tmp.mdEdsJdbGp/setup-package.conf.d -threaded
  1466. 361.29 s [vector] Phase: unpackPhase
  1467. 361.29 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.mdEdsJdbGp/Main.o )
  1468. 361.30 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  1469. 361.33 s [vector] source root is vector-0.13.2.0
  1470. 361.35 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  1471. 361.36 s [vector] Phase: patchPhase
  1472. 361.37 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  1473. 361.39 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  1474. 361.44 s [vector] Phase: compileBuildDriverPhase
  1475. 361.45 s [vector] setupCompileFlags: -package-db=/build/tmp.ocYpasffed/setup-package.conf.d -threaded
  1476. 361.51 s [duoids] [2 of 2] Linking Setup
  1477. 361.70 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ocYpasffed/Main.o )
  1478. 361.96 s [vector] [2 of 2] Linking Setup
  1479. 365.48 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  1480. 365.51 s [vector] Phase: configurePhase
  1481. 365.52 s [vector] configureFlags: --verbose --prefix=/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.ocYpasffed/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  1482. 365.56 s [vector] Using Parsec parser
  1483. 365.56 s [vector] Configuring vector-0.13.2.0...
  1484. 366.37 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  1485. 366.40 s [duoids] Phase: configurePhase
  1486. 366.41 s [duoids] configureFlags: --verbose --prefix=/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.mdEdsJdbGp/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  1487. 366.43 s [duoids] Using Parsec parser
  1488. 366.43 s [duoids] Configuring duoids-0.0.1.0...
  1489. 366.70 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  1490. 366.70 s [vector] wall=False
  1491. 367.44 s [vector] Dependency base: using base-4.20.2.0
  1492. 367.45 s [vector] Dependency deepseq: using deepseq-1.5.0.0
  1493. 367.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  1494. 367.45 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  1495. 367.45 s [vector] Dependency base: using base-4.20.2.0
  1496. 367.45 s [vector] Dependency random: using random-1.2.1.3
  1497. 367.45 s [vector] Dependency tasty: using tasty-1.5.3
  1498. 367.45 s [vector] Dependency vector: using vector-0.13.2.0
  1499. 367.45 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1500. 367.45 s [vector] Dependency base: using base-4.20.2.0
  1501. 367.45 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  1502. 367.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  1503. 367.45 s [vector] Dependency random: using random-1.2.1.3
  1504. 367.45 s [vector] Dependency tasty: using tasty-1.5.3
  1505. 367.45 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  1506. 367.45 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  1507. 367.45 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  1508. 367.45 s [vector] Dependency transformers: using transformers-0.6.1.1
  1509. 367.45 s [vector] Dependency vector: using vector-0.13.2.0
  1510. 367.45 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1511. 367.45 s [vector] Dependency base: using base-4.20.2.0
  1512. 367.45 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  1513. 367.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  1514. 367.45 s [vector] Dependency random: using random-1.2.1.3
  1515. 367.45 s [vector] Dependency tasty: using tasty-1.5.3
  1516. 367.45 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  1517. 367.45 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  1518. 367.45 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  1519. 367.45 s [vector] Dependency transformers: using transformers-0.6.1.1
  1520. 367.45 s [vector] Dependency vector: using vector-0.13.2.0
  1521. 367.45 s [vector] Dependency base: using base-4.20.2.0
  1522. 367.45 s [vector] Dependency doctest: using doctest-0.24.2
  1523. 367.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  1524. 367.45 s [vector] Dependency vector: using vector-0.13.2.0
  1525. 367.45 s [vector] Dependency base: using base-4.20.2.0
  1526. 367.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  1527. 367.45 s [vector] Dependency tasty: using tasty-1.5.3
  1528. 367.45 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  1529. 367.45 s [vector] Dependency vector: using vector-0.13.2.0
  1530. 367.45 s [vector] Source component graph:
  1531. 367.45 s [vector] component lib
  1532. 367.45 s [vector] component lib:benchmarks-O2 dependency lib
  1533. 367.45 s [vector] component test:vector-doctest dependency lib
  1534. 367.45 s [vector] component test:vector-inspection dependency lib
  1535. 367.45 s [vector] component test:vector-tests-O0 dependency lib
  1536. 367.45 s [vector] component test:vector-tests-O2 dependency lib
  1537. 367.45 s [vector] Configured component graph:
  1538. 367.45 s [vector] component vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1539. 367.45 s [vector] include base-4.20.2.0-acb8
  1540. 367.45 s [vector] include deepseq-1.5.0.0-7e72
  1541. 367.45 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1542. 367.45 s [vector] include vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
  1543. 367.45 s [vector] component vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
  1544. 367.45 s [vector] include base-4.20.2.0-acb8
  1545. 367.45 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1546. 367.45 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1547. 367.45 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1548. 367.45 s [vector] component vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
  1549. 367.45 s [vector] include base-4.20.2.0-acb8
  1550. 367.45 s [vector] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1551. 367.45 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1552. 367.45 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1553. 367.45 s [vector] component vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
  1554. 367.45 s [vector] include base-4.20.2.0-acb8
  1555. 367.45 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1556. 367.45 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1557. 367.45 s [vector] include tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
  1558. 367.45 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1559. 367.45 s [vector] component vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
  1560. 367.45 s [vector] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1561. 367.45 s [vector] include base-4.20.2.0-acb8
  1562. 367.45 s [vector] include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1563. 367.45 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1564. 367.45 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1565. 367.45 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1566. 367.45 s [vector] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1567. 367.45 s [vector] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1568. 367.45 s [vector] include template-haskell-2.22.0.0-af3f
  1569. 367.45 s [vector] include transformers-0.6.1.1-74e0
  1570. 367.45 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1571. 367.45 s [vector] component vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
  1572. 367.45 s [vector] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1573. 367.45 s [vector] include base-4.20.2.0-acb8
  1574. 367.45 s [vector] include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1575. 367.45 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1576. 367.45 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1577. 367.45 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1578. 367.45 s [vector] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1579. 367.45 s [vector] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1580. 367.45 s [vector] include template-haskell-2.22.0.0-af3f
  1581. 367.45 s [vector] include transformers-0.6.1.1-74e0
  1582. 367.45 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1583. 367.45 s [vector] Linked component graph:
  1584. 367.45 s [vector] unit vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1585. 367.45 s [vector] include base-4.20.2.0-acb8
  1586. 367.45 s [vector] include deepseq-1.5.0.0-7e72
  1587. 367.45 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1588. 367.45 s [vector] include vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
  1589. 367.45 s [vector] Data.Vector=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg:Data.Vector.Unboxed.Mutable
  1590. 367.45 s [vector] unit vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
  1591. 367.45 s [vector] include base-4.20.2.0-acb8
  1592. 367.45 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1593. 367.45 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1594. 367.45 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1595. 367.52 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  1596. 367.53 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2:Bench.Vector.TestData.ParenTree
  1597. 367.53 s [vector] unit vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
  1598. 367.53 s [vector] include base-4.20.2.0-acb8
  1599. 367.53 s [vector] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1600. 367.53 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1601. 367.53 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1602. 367.53 s [vector] unit vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
  1603. 367.53 s [vector] include base-4.20.2.0-acb8
  1604. 367.53 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1605. 367.53 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1606. 367.53 s [vector] include tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
  1607. 367.53 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1608. 367.53 s [vector] unit vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
  1609. 367.53 s [vector] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1610. 367.53 s [vector] include base-4.20.2.0-acb8
  1611. 367.53 s [vector] include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1612. 367.53 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1613. 367.53 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1614. 367.53 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1615. 367.53 s [vector] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1616. 367.53 s [vector] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1617. 367.53 s [vector] include template-haskell-2.22.0.0-af3f
  1618. 367.53 s [vector] include transformers-0.6.1.1-74e0
  1619. 367.53 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1620. 367.53 s [vector] unit vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
  1621. 367.53 s [vector] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1622. 367.53 s [vector] include base-4.20.2.0-acb8
  1623. 367.53 s [vector] include base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1624. 367.53 s [vector] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1625. 367.53 s [vector] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1626. 367.53 s [vector] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1627. 367.53 s [vector] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1628. 367.53 s [vector] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1629. 367.53 s [vector] include template-haskell-2.22.0.0-af3f
  1630. 367.53 s [vector] include transformers-0.6.1.1-74e0
  1631. 367.53 s [vector] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1632. 367.53 s [vector] Ready component graph:
  1633. 367.53 s [vector] definite vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1634. 367.53 s [vector] depends base-4.20.2.0-acb8
  1635. 367.53 s [vector] depends deepseq-1.5.0.0-7e72
  1636. 367.53 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1637. 367.53 s [vector] depends vector-stream-0.1.0.1-2tj7oI3vwQGAFca6yIjUY2
  1638. 367.53 s [vector] definite vector-0.13.2.0-CU97HsECnd7DuGJDQvy5Pn-vector-tests-O2
  1639. 367.53 s [vector] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1640. 367.53 s [vector] depends base-4.20.2.0-acb8
  1641. 367.53 s [vector] depends base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1642. 367.53 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1643. 367.53 s [vector] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1644. 367.53 s [vector] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1645. 367.53 s [vector] depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1646. 367.53 s [vector] depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1647. 367.53 s [vector] depends template-haskell-2.22.0.0-af3f
  1648. 367.53 s [vector] depends transformers-0.6.1.1-74e0
  1649. 367.53 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1650. 367.53 s [vector] definite vector-0.13.2.0-DnSPcwBcWgq9zTMimd0nah-vector-tests-O0
  1651. 367.53 s [vector] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  1652. 367.53 s [vector] depends base-4.20.2.0-acb8
  1653. 367.53 s [vector] depends base-orphans-0.9.3-4sqcl4G26xA94CCGcPMMk5
  1654. 367.53 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1655. 367.53 s [vector] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1656. 367.53 s [vector] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1657. 367.53 s [vector] depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  1658. 367.54 s [vector] depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  1659. 367.54 s [vector] depends template-haskell-2.22.0.0-af3f
  1660. 367.54 s [vector] depends transformers-0.6.1.1-74e0
  1661. 367.54 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1662. 367.54 s [vector] definite vector-0.13.2.0-JbFHaIgT3rIJKb0WGEV1Eg-vector-doctest
  1663. 367.54 s [vector] depends base-4.20.2.0-acb8
  1664. 367.54 s [vector] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1665. 367.54 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1666. 367.54 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1667. 367.54 s [vector] definite vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
  1668. 367.54 s [vector] depends base-4.20.2.0-acb8
  1669. 367.54 s [vector] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  1670. 367.54 s [vector] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1671. 367.54 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1672. 367.54 s [vector] definite vector-0.13.2.0-knuS4JeBvcGrPgIe2h2Ro-vector-inspection
  1673. 367.54 s [vector] depends base-4.20.2.0-acb8
  1674. 367.54 s [vector] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  1675. 367.54 s [vector] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  1676. 367.54 s [vector] depends tasty-inspection-testing-0.2.1-DJtNDI9X64S9lohYBgxqCJ
  1677. 367.54 s [vector] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1678. 367.54 s [vector] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1679. 367.54 s [vector] Using compiler: ghc-9.10.3
  1680. 367.54 s [vector] Using install prefix:
  1681. 367.54 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  1682. 367.54 s [vector] Executables installed in:
  1683. 367.54 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/bin
  1684. 367.54 s [vector] Libraries installed in:
  1685. 367.54 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  1686. 367.54 s [vector] Dynamic Libraries installed in:
  1687. 367.54 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  1688. 367.54 s [vector] Private executables installed in:
  1689. 367.54 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
  1690. 367.54 s [vector] Data files installed in:
  1691. 367.54 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/share/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
  1692. 367.54 s [vector] Documentation installed in:
  1693. 367.54 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0
  1694. 367.54 s [vector] Configuration files installed in:
  1695. 367.54 s [vector] /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/etc
  1696. 367.54 s [vector] No alex found
  1697. 367.54 s [vector] Using ar found on system at:
  1698. 367.54 s [vector] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  1699. 367.54 s [vector] No c2hs found
  1700. 367.54 s [vector] No cpphs found
  1701. 367.54 s [vector] Using doctest version 0.24.2 found on system at:
  1702. 367.54 s [vector] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  1703. 367.54 s [vector] Using gcc version 14.3.0 given by user at:
  1704. 367.54 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  1705. 367.54 s [vector] Using ghc version 9.10.3 found on system at:
  1706. 367.54 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  1707. 367.54 s [vector] Using ghc-pkg version 9.10.3 found on system at:
  1708. 367.54 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1709. 367.54 s [vector] No ghcjs found
  1710. 367.54 s [vector] No ghcjs-pkg found
  1711. 367.54 s [vector] No greencard found
  1712. 367.54 s [vector] Using haddock version 2.31.1 found on system at:
  1713. 367.54 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1714. 367.54 s [vector] No happy found
  1715. 367.54 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  1716. 367.54 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1717. 367.54 s [vector] No hmake found
  1718. 367.54 s [vector] Using hpc version 0.69 found on system at:
  1719. 367.54 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1720. 367.54 s [vector] Using hsc2hs version 0.68.10 found on system at:
  1721. 367.54 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1722. 367.54 s [vector] Using hscolour version 1.25 found on system at:
  1723. 367.54 s [vector] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  1724. 367.54 s [vector] No jhc found
  1725. 367.54 s [vector] Using ld found on system at:
  1726. 367.54 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  1727. 367.54 s [vector] No pkg-config found
  1728. 367.54 s [vector] Using runghc version 9.10.3 found on system at:
  1729. 367.54 s [vector] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  1730. 367.54 s [vector] Using strip version 2.44 found on system at:
  1731. 367.54 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  1732. 367.54 s [vector] Using tar found on system at:
  1733. 367.54 s [vector] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  1734. 367.54 s [vector] No uhc found
  1735. 367.88 s [vector] Phase: buildPhase
  1736. 368.09 s [vector] Preprocessing library for vector-0.13.2.0...
  1737. 368.10 s [vector] Building library for vector-0.13.2.0...
  1738. 368.26 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1739. 368.26 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  1740. 368.26 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1741. 368.26 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1742. 368.26 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  1743. 368.26 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  1744. 368.26 s [duoids] <0.25: using doctest-0.24.2
  1745. 368.26 s [duoids] Dependency duoids: using duoids-0.0.1.0
  1746. 368.26 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1747. 368.26 s [duoids] Source component graph:
  1748. 368.26 s [duoids] component lib
  1749. 368.26 s [duoids] component test:doctests dependency lib
  1750. 368.26 s [duoids] Configured component graph:
  1751. 368.26 s [duoids] component duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1752. 368.26 s [duoids] include base-4.20.2.0-acb8
  1753. 368.26 s [duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1754. 368.26 s [duoids] component duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
  1755. 368.26 s [duoids] include base-4.20.2.0-acb8
  1756. 368.26 s [duoids] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1757. 368.26 s [duoids] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1758. 368.26 s [duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1759. 368.26 s [duoids] Linked component graph:
  1760. 368.26 s [duoids] unit duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1761. 368.26 s [duoids] include base-4.20.2.0-acb8
  1762. 368.26 s [duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1763. 368.26 s [duoids] Control.Duoidal=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c:Data.Duoid.Laws
  1764. 368.26 s [duoids] unit duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
  1765. 368.26 s [duoids] include base-4.20.2.0-acb8
  1766. 368.26 s [duoids] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1767. 368.26 s [duoids] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1768. 368.26 s [duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1769. 368.26 s [duoids] Ready component graph:
  1770. 368.26 s [duoids] definite duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1771. 368.26 s [duoids] depends base-4.20.2.0-acb8
  1772. 368.26 s [duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1773. 368.26 s [duoids] definite duoids-0.0.1.0-5K7xPrnULSaMCSEqoY2Nt-doctests
  1774. 368.26 s [duoids] depends base-4.20.2.0-acb8
  1775. 368.26 s [duoids] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  1776. 368.26 s [duoids] depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1777. 368.26 s [duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  1778. 368.26 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1779. 368.26 s [duoids] Using compiler: ghc-9.10.3
  1780. 368.26 s [duoids] Using install prefix:
  1781. 368.26 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
  1782. 368.26 s [duoids] Executables installed in:
  1783. 368.26 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/bin
  1784. 368.26 s [duoids] Libraries installed in:
  1785. 368.26 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  1786. 368.26 s [duoids] Dynamic Libraries installed in:
  1787. 368.26 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  1788. 368.26 s [duoids] Private executables installed in:
  1789. 368.26 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0
  1790. 368.26 s [duoids] Data files installed in:
  1791. 368.26 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0
  1792. 368.26 s [duoids] Documentation installed in:
  1793. 368.26 s [duoids] /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  1794. 368.26 s [duoids] Configuration files installed in:
  1795. 368.26 s [duoids] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/etc
  1796. 368.26 s [duoids] No alex found
  1797. 368.26 s [duoids] Using ar found on system at:
  1798. 368.26 s [duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  1799. 368.26 s [duoids] No c2hs found
  1800. 368.26 s [duoids] No cpphs found
  1801. 368.26 s [duoids] Using doctest version 0.24.2 found on system at:
  1802. 368.26 s [duoids] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  1803. 368.26 s [duoids] Using gcc version 14.3.0 given by user at:
  1804. 368.26 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  1805. 368.26 s [duoids] Using ghc version 9.10.3 found on system at:
  1806. 368.26 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  1807. 368.26 s [duoids] Using ghc-pkg version 9.10.3 found on system at:
  1808. 368.26 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1809. 368.26 s [duoids] No ghcjs found
  1810. 368.26 s [duoids] No ghcjs-pkg found
  1811. 368.26 s [duoids] No greencard found
  1812. 368.26 s [duoids] Using haddock version 2.31.1 found on system at:
  1813. 368.26 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1814. 368.26 s [duoids] No happy found
  1815. 368.26 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  1816. 368.26 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1817. 368.26 s [duoids] No hmake found
  1818. 368.26 s [duoids] Using hpc version 0.69 found on system at:
  1819. 368.26 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1820. 368.26 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  1821. 368.26 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1822. 368.26 s [duoids] Using hscolour version 1.25 found on system at:
  1823. 368.26 s [duoids] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  1824. 368.26 s [duoids] No jhc found
  1825. 368.26 s [duoids] Using ld found on system at:
  1826. 368.26 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  1827. 368.26 s [duoids] No pkg-config found
  1828. 368.26 s [duoids] Using runghc version 9.10.3 found on system at:
  1829. 368.26 s [duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  1830. 368.26 s [duoids] Using strip version 2.44 found on system at:
  1831. 368.26 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  1832. 368.26 s [duoids] Using tar found on system at:
  1833. 368.26 s [duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  1834. 368.26 s [duoids] No uhc found
  1835. 368.57 s [duoids] Phase: buildPhase
  1836. 368.79 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1837. 368.79 s [duoids] Building library for duoids-0.0.1.0...
  1838. 369.07 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  1839. 369.38 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.o, dist/build/Data/Vector/Fusion/Stream/Monadic.dyn_o )
  1840. 369.53 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.o, dist/build/Data/Vector/Fusion/Util.dyn_o )
  1841. 369.57 s [vector] [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.o, dist/build/Data/Vector/Fusion/Bundle/Size.dyn_o )
  1842. 370.15 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  1843. 370.17 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.o, dist/build/Data/Vector/Generic/Mutable/Base.dyn_o )
  1844. 370.17 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.o, dist/build/Data/Vector/Generic/Base.dyn_o )
  1845. 370.17 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.o, dist/build/Data/Vector/Internal/Check.dyn_o )
  1846. 370.17 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.o, dist/build/Data/Vector/Fusion/Bundle/Monadic.dyn_o )
  1847. 374.51 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  1848. 379.23 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  1849. 379.36 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  1850. 379.36 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  1851. 380.10 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  1852. 381.23 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  1853. 384.48 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.o, dist/build/Data/Vector/Fusion/Bundle.dyn_o )
  1854. 384.69 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  1855. 389.73 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  1856. 390.03 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  1857. 390.03 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  1858. 391.95 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.o, dist/build/Data/Vector/Generic/Mutable.dyn_o )
  1859. 398.69 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1860. 398.69 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  1861. 398.92 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1862. 399.27 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.o, dist/build/Data/Vector/Generic/New.dyn_o )
  1863. 399.82 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1864. 400.48 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.o, dist/build/Data/Vector/Generic.dyn_o )
  1865. 401.10 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  1866. 410.73 s [duoids] buildPhase completed in 42 seconds
  1867. 410.73 s [duoids] Phase: checkPhase
  1868. 411.47 s [duoids] Running 1 test suites...
  1869. 411.47 s [duoids] Test suite doctests: RUNNING...
  1870. 412.37 s [duoids] on the commandline: warning: [GHC-98887]
  1871. 412.37 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1872. 412.37 s [duoids]
  1873. 412.37 s [duoids] on the commandline: warning: [GHC-98887]
  1874. 412.38 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1875. 412.38 s [duoids]
  1876. 412.38 s [duoids] on the commandline: warning: [GHC-98887]
  1877. 412.38 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1878. 412.38 s [duoids]
  1879. 412.38 s [duoids] on the commandline: warning: [GHC-98887]
  1880. 412.38 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1881. 412.38 s [duoids]
  1882. 412.38 s [duoids] on the commandline: warning: [GHC-98887]
  1883. 412.38 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1884. 412.38 s [duoids]
  1885. 412.38 s [duoids] on the commandline: warning: [GHC-98887]
  1886. 412.38 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1887. 412.38 s [duoids]
  1888. 412.39 s [duoids] on the commandline: warning: [GHC-98887]
  1889. 412.39 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1890. 412.39 s [duoids]
  1891. 412.39 s [duoids] on the commandline: warning: [GHC-98887]
  1892. 412.39 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1893. 412.39 s [duoids]
  1894. 412.40 s [duoids] on the commandline: warning: [GHC-98887]
  1895. 412.40 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1896. 412.40 s [duoids]
  1897. 412.40 s [duoids] on the commandline: warning: [GHC-98887]
  1898. 412.40 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1899. 412.40 s [duoids]
  1900. 415.50 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  1901. 415.59 s [duoids] NameLib Nothing
  1902. 415.59 s [duoids] ----------------------------------------
  1903. 415.62 s [duoids] Test suite doctests: PASS
  1904. 415.62 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  1905. 415.62 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  1906. 415.64 s [duoids] Phase: haddockPhase
  1907. 416.01 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1908. 416.01 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  1909. 417.01 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
  1910. 417.65 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing )
  1911. 418.76 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing )
  1912. 420.71 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
  1913. 420.74 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing )
  1914. 420.84 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
  1915. 420.91 s [duoids] Haddock coverage:
  1916. 420.91 s [duoids] Warning: 'cancel' is out of scope.
  1917. 420.91 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1918. 420.92 s [duoids] Warning: 'Applicative' is out of scope.
  1919. 420.92 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1920. 420.92 s [duoids] Warning: 'Alternative' is out of scope.
  1921. 420.92 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1922. 420.93 s [duoids] Warning: 'Par' is ambiguous. It is defined
  1923. 420.93 s [duoids] * at src/Data/Duoid.hs:62:5
  1924. 420.93 s [duoids] * at src/Data/Duoid.hs:58:1
  1925. 420.93 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1926. 420.93 s [duoids] by specifying the type/value namespace explicitly.
  1927. 420.93 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:58:1
  1928. 420.93 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  1929. 420.93 s [duoids] * at src/Data/Duoid.hs:118:5
  1930. 420.93 s [duoids] * at src/Data/Duoid.hs:114:1
  1931. 420.93 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1932. 420.93 s [duoids] by specifying the type/value namespace explicitly.
  1933. 420.93 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:114:1
  1934. 420.95 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  1935. 420.97 s [duoids] Warning: 'ExceptT' is out of scope.
  1936. 420.97 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1937. 420.97 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  1938. 420.97 s [duoids] * at src/Control/Duoidal.hs:238:5
  1939. 420.97 s [duoids] * at src/Control/Duoidal.hs:234:1
  1940. 420.97 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1941. 420.97 s [duoids] by specifying the type/value namespace explicitly.
  1942. 420.97 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:234:1
  1943. 420.97 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  1944. 420.97 s [duoids] * at src/Control/Duoidal.hs:308:5
  1945. 420.97 s [duoids] * at src/Control/Duoidal.hs:304:1
  1946. 420.97 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1947. 420.97 s [duoids] by specifying the type/value namespace explicitly.
  1948. 420.97 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:304:1
  1949. 420.97 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  1950. 420.97 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1951. 420.97 s [duoids] Warning: 'Validation' is out of scope.
  1952. 420.97 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1953. 420.97 s [duoids] Warning: 'fail' is out of scope.
  1954. 420.97 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1955. 420.97 s [duoids] Warning: 'MonadFail' is out of scope.
  1956. 420.97 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1957. 420.98 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  1958. 420.98 s [duoids] * at src/Control/Duoidal.hs:774:5
  1959. 420.98 s [duoids] * at src/Control/Duoidal.hs:770:1
  1960. 420.98 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1961. 420.98 s [duoids] by specifying the type/value namespace explicitly.
  1962. 420.98 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:770:1
  1963. 420.98 s [duoids] Warning: 'Writer' is out of scope.
  1964. 420.98 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1965. 420.98 s [duoids] Warning: 'Set' is out of scope.
  1966. 420.98 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1967. 420.98 s [duoids] Warning: 'Char' is out of scope.
  1968. 420.98 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1969. 421.01 s [duoids] Warning: 'Const' is ambiguous. It is defined
  1970. 421.01 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  1971. 421.02 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  1972. 421.02 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1973. 421.02 s [duoids] by specifying the type/value namespace explicitly.
  1974. 421.06 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  1975. 421.06 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  1976. 421.06 s [duoids] * at src/Control/Duoidal.hs:395:1
  1977. 421.06 s [duoids] * at src/Data/Duoid.hs:183:1
  1978. 421.06 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1979. 421.06 s [duoids] by specifying the type/value namespace explicitly.
  1980. 421.06 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:183:1
  1981. 421.06 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  1982. 421.06 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  1983. 421.06 s [duoids] Warning: 'Normal' is out of scope.
  1984. 421.06 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1985. 421.06 s [duoids] Warning: 'Law' is ambiguous. It is defined
  1986. 421.06 s [duoids] * at src/Data/Duoid/Laws.hs:38:5
  1987. 421.06 s [duoids] * at src/Data/Duoid/Laws.hs:34:1
  1988. 421.06 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1989. 421.06 s [duoids] by specifying the type/value namespace explicitly.
  1990. 421.06 s [duoids] Defaulting to the one defined at src/Data/Duoid/Laws.hs:34:1
  1991. 421.06 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  1992. 421.06 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  1993. 421.79 s [duoids] Warning: Data.Duoid: could not find link destinations for:
  1994. 421.79 s [duoids] - Data.Duoid.Rep_Comm
  1995. 421.79 s [duoids] - Data.Duoid.Rep1_Comm
  1996. 421.79 s [duoids] - Data.Duoid.Rep_Seq
  1997. 421.79 s [duoids] - Data.Duoid.Rep1_Seq
  1998. 421.79 s [duoids] - Data.Duoid.Rep_Par
  1999. 421.79 s [duoids] - Data.Duoid.Rep1_Par
  2000. 421.85 s [duoids] Warning: Control.Duoidal: could not find link destinations for:
  2001. 421.85 s [duoids] - Control.Duoidal.Rep_Commutative
  2002. 421.85 s [duoids] - Control.Duoidal.Rep1_Commutative
  2003. 421.85 s [duoids] - Control.Duoidal.Rep_Sequential
  2004. 421.85 s [duoids] - Control.Duoidal.Rep1_Sequential
  2005. 421.85 s [duoids] - Control.Duoidal.Rep_Parallel
  2006. 421.85 s [duoids] - Control.Duoidal.Rep1_Parallel
  2007. 421.86 s [duoids] Warning: Data.Duoid.Laws: could not find link destinations for:
  2008. 421.86 s [duoids] - Data.Duoid.Laws.Rep_NormalLaws
  2009. 421.86 s [duoids] - Data.Duoid.Laws.Rep1_NormalLaws
  2010. 421.86 s [duoids] - Data.Duoid.Laws.Rep_Laws
  2011. 421.86 s [duoids] - Data.Duoid.Laws.Rep_Law
  2012. 422.99 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.o, dist/build/Data/Vector/Mutable.dyn_o )
  2013. 422.99 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  2014. 444.19 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.o, dist/build/Data/Vector/Primitive/Mutable.dyn_o )
  2015. 444.23 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.o, dist/build/Data/Vector/Primitive.dyn_o )
  2016. 444.23 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.o, dist/build/Data/Vector/Storable/Internal.dyn_o )
  2017. 444.23 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.o, dist/build/Data/Vector/Storable/Mutable.dyn_o )
  2018. 444.23 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.o, dist/build/Data/Vector/Storable.dyn_o )
  2019. 445.59 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.o, dist/build/Data/Vector/Strict/Mutable.dyn_o )
  2020. 445.59 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.o, dist/build/Data/Vector/Strict.dyn_o )
  2021. 454.55 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  2022. 454.69 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  2023. 454.73 s [duoids] haddockPhase completed in 39 seconds
  2024. 454.73 s [duoids] Phase: installPhase
  2025. 454.88 s [duoids] Installing library in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2026. 455.54 s [duoids] Phase: fixupPhase
  2027. 455.57 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
  2028. 455.58 s [duoids] shrinking /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c-ghc9.10.3.so
  2029. 455.59 s [duoids] checking for references to /build/ in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0...
  2030. 455.62 s [duoids] patching script interpreter paths in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0
  2031. 455.63 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/lib
  2032. 455.95 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
  2033. 455.96 s [duoids] checking for references to /build/ in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc...
  2034. 455.99 s [duoids] patching script interpreter paths in /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
  2035. 456.37 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
  2036. 457.09 s [post-build-hook] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  2037. 457.09 s [post-build-hook]
  2038. 457.47 s [post-build-hook] Pushing /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 (8.23 MiB)
  2039. 457.57 s [post-build-hook] Pushing /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc (2.25 MiB)
  2040. 458.62 s [post-build-hook]
  2041. 458.62 s [post-build-hook] All done.
  2042. 458.66 s [post-build-hook] Uploading to the NixCI cache: /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0 /nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc
  2043. 458.75 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2044. 458.78 s [post-build-hook] copying 2 paths...
  2045. 458.78 s [post-build-hook] copying path '/nix/store/yhxla1q2szayzd8vp7z99cm3wzkbvg1d-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2046. 459.66 s [post-build-hook] copying path '/nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  2047. 463.78 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2048. 464.09 s [post-build-hook] copying 1 paths...
  2049. 464.13 s [post-build-hook] copying path '/nix/store/vsgni15q8ggj44anj5lpzwvg2fwgwdpr-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  2050. 464.38 s Progress: 6 of 22 built (1 building), 193 of 193 downloaded from cache
  2051. 464.50 s Building duoidal-transformers
  2052. 464.60 s Building duoids-hedgehog
  2053. 464.60 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.o, dist/build/Data/Vector/Unboxed/Base.dyn_o )
  2054. 464.66 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  2055. 464.66 s [duoidal-transformers] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  2056. 464.88 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  2057. 464.89 s [duoids-hedgehog] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  2058. 465.25 s [duoidal-transformers] Phase: unpackPhase
  2059. 465.26 s [duoidal-transformers] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./transformers
  2060. 465.28 s [duoidal-transformers] source root is transformers
  2061. 465.30 s [duoidal-transformers] Phase: patchPhase
  2062. 465.33 s [duoidal-transformers] Phase: compileBuildDriverPhase
  2063. 465.33 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.dD59VnwDja/setup-package.conf.d -threaded
  2064. 465.61 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.dD59VnwDja/Main.o )
  2065. 465.73 s [duoids-hedgehog] Phase: unpackPhase
  2066. 465.74 s [duoids-hedgehog] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./hedgehog
  2067. 465.75 s [duoids-hedgehog] source root is hedgehog
  2068. 465.77 s [duoids-hedgehog] Phase: patchPhase
  2069. 465.79 s [duoidal-transformers] [2 of 2] Linking Setup
  2070. 465.79 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  2071. 465.80 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.cbsYtfdiVI/setup-package.conf.d -threaded
  2072. 466.00 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.cbsYtfdiVI/Main.o )
  2073. 466.15 s [duoids-hedgehog] [2 of 2] Linking Setup
  2074. 468.97 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  2075. 468.99 s [duoidal-transformers] Phase: configurePhase
  2076. 469.00 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.dD59VnwDja/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  2077. 469.02 s [duoidal-transformers] Using Parsec parser
  2078. 469.02 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  2079. 469.18 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  2080. 469.22 s [duoids-hedgehog] Phase: configurePhase
  2081. 469.22 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.cbsYtfdiVI/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  2082. 469.25 s [duoids-hedgehog] Using Parsec parser
  2083. 469.25 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  2084. 469.89 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  2085. 470.09 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  2086. 470.54 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2087. 470.54 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2088. 470.54 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2089. 470.54 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2090. 470.54 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.1
  2091. 470.54 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2092. 470.54 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2093. 470.54 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  2094. 470.54 s [duoidal-transformers] <0.25: using doctest-0.24.2
  2095. 470.54 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  2096. 470.54 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2097. 470.54 s [duoidal-transformers] Source component graph:
  2098. 470.54 s [duoidal-transformers] component lib
  2099. 470.54 s [duoidal-transformers] component test:doctests dependency lib
  2100. 470.54 s [duoidal-transformers] Configured component graph:
  2101. 470.54 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2102. 470.54 s [duoidal-transformers] include base-4.20.2.0-acb8
  2103. 470.54 s [duoidal-transformers] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2104. 470.54 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2105. 470.54 s [duoidal-transformers] include transformers-0.6.1.1-74e0
  2106. 470.54 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
  2107. 470.54 s [duoidal-transformers] include base-4.20.2.0-acb8
  2108. 470.54 s [duoidal-transformers] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2109. 470.54 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2110. 470.54 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2111. 470.54 s [duoidal-transformers] Linked component graph:
  2112. 470.54 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2113. 470.54 s [duoidal-transformers] include base-4.20.2.0-acb8
  2114. 470.54 s [duoidal-transformers] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2115. 470.54 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2116. 470.54 s [duoidal-transformers] include transformers-0.6.1.1-74e0
  2117. 470.54 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C:Control.Duoidal.Trans.Orphans
  2118. 470.54 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
  2119. 470.54 s [duoidal-transformers] include base-4.20.2.0-acb8
  2120. 470.54 s [duoidal-transformers] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2121. 470.54 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2122. 470.54 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2123. 470.54 s [duoidal-transformers] Ready component graph:
  2124. 470.54 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2125. 470.54 s [duoidal-transformers] depends base-4.20.2.0-acb8
  2126. 470.54 s [duoidal-transformers] depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2127. 470.54 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2128. 470.54 s [duoidal-transformers] depends transformers-0.6.1.1-74e0
  2129. 470.54 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-FYwykNJN3GjCMzXCDo8yOa-doctests
  2130. 470.54 s [duoidal-transformers] depends base-4.20.2.0-acb8
  2131. 470.54 s [duoidal-transformers] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2132. 470.54 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2133. 470.54 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2134. 470.54 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  2135. 470.54 s [duoidal-transformers] Using compiler: ghc-9.10.3
  2136. 470.54 s [duoidal-transformers] Using install prefix:
  2137. 470.54 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2138. 470.54 s [duoidal-transformers] Executables installed in:
  2139. 470.54 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/bin
  2140. 470.54 s [duoidal-transformers] Libraries installed in:
  2141. 470.54 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2142. 470.54 s [duoidal-transformers] Dynamic Libraries installed in:
  2143. 470.54 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  2144. 470.54 s [duoidal-transformers] Private executables installed in:
  2145. 470.54 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0
  2146. 470.54 s [duoidal-transformers] Data files installed in:
  2147. 470.54 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0
  2148. 470.54 s [duoidal-transformers] Documentation installed in:
  2149. 470.54 s [duoidal-transformers] /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  2150. 470.54 s [duoidal-transformers] Configuration files installed in:
  2151. 470.54 s [duoidal-transformers] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/etc
  2152. 470.54 s [duoidal-transformers] No alex found
  2153. 470.54 s [duoidal-transformers] Using ar found on system at:
  2154. 470.54 s [duoidal-transformers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2155. 470.54 s [duoidal-transformers] No c2hs found
  2156. 470.55 s [duoidal-transformers] No cpphs found
  2157. 470.55 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  2158. 470.55 s [duoidal-transformers] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  2159. 470.55 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  2160. 470.55 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2161. 470.55 s [duoidal-transformers] Using ghc version 9.10.3 found on system at:
  2162. 470.55 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  2163. 470.55 s [duoidal-transformers] Using ghc-pkg version 9.10.3 found on system at:
  2164. 470.55 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  2165. 470.55 s [duoidal-transformers] No ghcjs found
  2166. 470.55 s [duoidal-transformers] No ghcjs-pkg found
  2167. 470.55 s [duoidal-transformers] No greencard found
  2168. 470.55 s [duoidal-transformers] Using haddock version 2.31.1 found on system at:
  2169. 470.55 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  2170. 470.55 s [duoidal-transformers] No happy found
  2171. 470.55 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  2172. 470.55 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2173. 470.55 s [duoidal-transformers] No hmake found
  2174. 470.55 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  2175. 470.55 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  2176. 470.55 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  2177. 470.55 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  2178. 470.55 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  2179. 470.55 s [duoidal-transformers] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  2180. 470.55 s [duoidal-transformers] No jhc found
  2181. 470.55 s [duoidal-transformers] Using ld found on system at:
  2182. 470.55 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2183. 470.55 s [duoidal-transformers] No pkg-config found
  2184. 470.55 s [duoidal-transformers] Using runghc version 9.10.3 found on system at:
  2185. 470.55 s [duoidal-transformers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  2186. 470.55 s [duoidal-transformers] Using strip version 2.44 found on system at:
  2187. 470.55 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2188. 470.55 s [duoidal-transformers] Using tar found on system at:
  2189. 470.55 s [duoidal-transformers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2190. 470.55 s [duoidal-transformers] No uhc found
  2191. 470.77 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2192. 470.77 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2193. 470.77 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2194. 470.77 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2195. 470.77 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  2196. 470.77 s [duoids-hedgehog] hedgehog-1.5
  2197. 470.77 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2198. 470.77 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2199. 470.77 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  2200. 470.77 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2201. 470.77 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  2202. 470.77 s [duoids-hedgehog] hedgehog-1.5
  2203. 470.77 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2204. 470.77 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  2205. 470.77 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  2206. 470.77 s [duoids-hedgehog] <0.25: using doctest-0.24.2
  2207. 470.77 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  2208. 470.77 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  2209. 470.77 s [duoids-hedgehog] Source component graph:
  2210. 470.77 s [duoids-hedgehog] component lib
  2211. 470.77 s [duoids-hedgehog] component test:doctests dependency lib
  2212. 470.77 s [duoids-hedgehog] component test:laws dependency lib
  2213. 470.77 s [duoids-hedgehog] Configured component graph:
  2214. 470.77 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2215. 470.77 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2216. 470.77 s [duoids-hedgehog] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2217. 470.77 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2218. 470.77 s [duoids-hedgehog] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2219. 470.77 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
  2220. 470.77 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2221. 470.77 s [duoids-hedgehog] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2222. 470.77 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2223. 470.77 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2224. 470.77 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
  2225. 470.77 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2226. 470.77 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2227. 470.77 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2228. 470.77 s [duoids-hedgehog] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2229. 470.77 s [duoids-hedgehog] Linked component graph:
  2230. 470.77 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2231. 470.77 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2232. 470.77 s [duoids-hedgehog] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2233. 470.77 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2234. 470.77 s [duoids-hedgehog] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2235. 470.77 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW:Test.Duoidal
  2236. 470.77 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
  2237. 470.77 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2238. 470.77 s [duoids-hedgehog] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2239. 470.77 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2240. 470.77 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2241. 470.77 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
  2242. 470.77 s [duoids-hedgehog] include base-4.20.2.0-acb8
  2243. 470.77 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2244. 470.77 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2245. 470.77 s [duoids-hedgehog] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2246. 470.77 s [duoids-hedgehog] Ready component graph:
  2247. 470.77 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2248. 470.77 s [duoids-hedgehog] depends base-4.20.2.0-acb8
  2249. 470.77 s [duoids-hedgehog] depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  2250. 470.77 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2251. 470.77 s [duoids-hedgehog] depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2252. 470.77 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-HEJJPuqx96k3Z5VnclDp4D-laws
  2253. 470.77 s [duoids-hedgehog] depends base-4.20.2.0-acb8
  2254. 470.77 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2255. 470.77 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2256. 470.77 s [duoids-hedgehog] depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  2257. 470.77 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-3Jv1gaRZt2Z4efsDgUKshe-doctests
  2258. 470.77 s [duoids-hedgehog] depends base-4.20.2.0-acb8
  2259. 470.77 s [duoids-hedgehog] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  2260. 470.77 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2261. 470.77 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  2262. 470.77 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.10
  2263. 470.77 s [duoids-hedgehog] Using compiler: ghc-9.10.3
  2264. 470.77 s [duoids-hedgehog] Using install prefix:
  2265. 470.77 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
  2266. 470.77 s [duoids-hedgehog] Executables installed in:
  2267. 470.77 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/bin
  2268. 470.77 s [duoids-hedgehog] Libraries installed in:
  2269. 470.77 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2270. 470.77 s [duoids-hedgehog] Dynamic Libraries installed in:
  2271. 470.77 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  2272. 470.77 s [duoids-hedgehog] Private executables installed in:
  2273. 470.77 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0
  2274. 470.77 s [duoids-hedgehog] Data files installed in:
  2275. 470.77 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0
  2276. 470.77 s [duoids-hedgehog] Documentation installed in:
  2277. 470.77 s [duoids-hedgehog] /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  2278. 470.77 s [duoids-hedgehog] Configuration files installed in:
  2279. 470.77 s [duoids-hedgehog] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/etc
  2280. 470.77 s [duoids-hedgehog] No alex found
  2281. 470.77 s [duoids-hedgehog] Using ar found on system at:
  2282. 470.77 s [duoids-hedgehog] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2283. 470.77 s [duoids-hedgehog] No c2hs found
  2284. 470.77 s [duoids-hedgehog] No cpphs found
  2285. 470.77 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  2286. 470.77 s [duoids-hedgehog] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  2287. 470.77 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  2288. 470.77 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2289. 470.77 s [duoids-hedgehog] Using ghc version 9.10.3 found on system at:
  2290. 470.77 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  2291. 470.77 s [duoids-hedgehog] Using ghc-pkg version 9.10.3 found on system at:
  2292. 470.77 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  2293. 470.77 s [duoids-hedgehog] No ghcjs found
  2294. 470.77 s [duoids-hedgehog] No ghcjs-pkg found
  2295. 470.77 s [duoids-hedgehog] No greencard found
  2296. 470.77 s [duoids-hedgehog] Using haddock version 2.31.1 found on system at:
  2297. 470.77 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  2298. 470.77 s [duoids-hedgehog] No happy found
  2299. 470.77 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  2300. 470.77 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2301. 470.77 s [duoids-hedgehog] No hmake found
  2302. 470.77 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  2303. 470.77 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  2304. 470.77 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  2305. 470.77 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  2306. 470.77 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  2307. 470.77 s [duoids-hedgehog] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  2308. 470.77 s [duoids-hedgehog] No jhc found
  2309. 470.77 s [duoids-hedgehog] Using ld found on system at:
  2310. 470.77 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2311. 470.77 s [duoids-hedgehog] No pkg-config found
  2312. 470.77 s [duoids-hedgehog] Using runghc version 9.10.3 found on system at:
  2313. 470.77 s [duoids-hedgehog] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  2314. 470.77 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  2315. 470.77 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2316. 470.77 s [duoids-hedgehog] Using tar found on system at:
  2317. 470.77 s [duoids-hedgehog] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2318. 470.77 s [duoids-hedgehog] No uhc found
  2319. 470.82 s [duoidal-transformers] Phase: buildPhase
  2320. 471.04 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  2321. 471.04 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  2322. 471.13 s [duoids-hedgehog] Phase: buildPhase
  2323. 471.35 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.o, dist/build/Control/Duoidal/Trans/Class.dyn_o )
  2324. 471.38 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  2325. 471.38 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  2326. 471.71 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  2327. 471.92 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.o, dist/build/Control/Duoidal/Trans/Orphans.dyn_o )
  2328. 472.70 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.o, dist/build/Data/Vector/Unboxed.dyn_o )
  2329. 473.04 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  2330. 473.24 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.p_o )
  2331. 473.66 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  2332. 474.01 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.p_o )
  2333. 475.06 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  2334. 482.01 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2335. 482.08 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2336. 482.31 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  2337. 483.09 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2338. 484.05 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  2339. 484.05 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  2340. 484.39 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  2341. 484.65 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  2342. 486.06 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  2343. 487.33 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.o, dist/build/Data/Vector/Unboxed/Mutable.dyn_o )
  2344. 487.74 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  2345. 487.74 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  2346. 487.97 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  2347. 488.62 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2348. 488.71 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.p_o )
  2349. 489.10 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  2350. 489.18 s [vector] [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.p_o )
  2351. 489.76 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.p_o )
  2352. 489.76 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  2353. 489.76 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  2354. 489.76 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.p_o )
  2355. 489.94 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  2356. 491.68 s [duoidal-transformers] Phase: checkPhase
  2357. 492.15 s [duoidal-transformers] Running 1 test suites...
  2358. 492.15 s [duoidal-transformers] Test suite doctests: RUNNING...
  2359. 492.61 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  2360. 492.61 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2361. 492.65 s [duoidal-transformers]
  2362. 492.65 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  2363. 492.65 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2364. 492.65 s [duoidal-transformers]
  2365. 492.65 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  2366. 492.65 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2367. 492.65 s [duoidal-transformers]
  2368. 492.94 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2369. 493.00 s [duoidal-transformers] NameLib Nothing
  2370. 493.00 s [duoidal-transformers] ----------------------------------------
  2371. 493.02 s [duoidal-transformers] Test suite doctests: PASS
  2372. 493.02 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  2373. 493.02 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  2374. 493.03 s [duoidal-transformers] Phase: haddockPhase
  2375. 493.34 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  2376. 493.34 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  2377. 494.18 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
  2378. 494.59 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
  2379. 494.86 s [duoidal-transformers] Haddock coverage:
  2380. 494.86 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  2381. 494.86 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  2382. 494.86 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  2383. 494.86 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  2384. 497.34 s [duoids-hedgehog] Phase: checkPhase
  2385. 498.11 s [duoids-hedgehog] Running 2 test suites...
  2386. 498.11 s [duoids-hedgehog] Test suite laws: RUNNING...
  2387. 498.14 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  2388. 498.14 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2389. 498.14 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2390. 498.14 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2391. 498.14 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2392. 498.14 s [duoids-hedgehog] ✓ 4 succeeded.
  2393. 498.15 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  2394. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2395. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2396. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2397. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2398. 498.15 s [duoids-hedgehog] ✓ 4 succeeded.
  2399. 498.15 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  2400. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2401. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2402. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2403. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2404. 498.15 s [duoids-hedgehog] ✓ 4 succeeded.
  2405. 498.15 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  2406. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2407. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2408. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2409. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2410. 498.15 s [duoids-hedgehog] ✓ 4 succeeded.
  2411. 498.15 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  2412. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2413. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2414. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2415. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2416. 498.15 s [duoids-hedgehog] ✓ 4 succeeded.
  2417. 498.15 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  2418. 498.15 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2419. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2420. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2421. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2422. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2423. 498.15 s [duoids-hedgehog] ✓ 5 succeeded.
  2424. 498.15 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  2425. 498.15 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2426. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2427. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2428. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2429. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2430. 498.15 s [duoids-hedgehog] ✓ 5 succeeded.
  2431. 498.15 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  2432. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2433. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2434. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2435. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2436. 498.15 s [duoids-hedgehog] ✓ 4 succeeded.
  2437. 498.15 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  2438. 498.15 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2439. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2440. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2441. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2442. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2443. 498.15 s [duoids-hedgehog] ✓ 5 succeeded.
  2444. 498.15 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  2445. 498.15 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2446. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2447. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2448. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2449. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2450. 498.15 s [duoids-hedgehog] ✓ 5 succeeded.
  2451. 498.15 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  2452. 498.15 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2453. 498.15 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2454. 498.15 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2455. 498.15 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2456. 498.15 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2457. 498.16 s [duoids-hedgehog] ✓ 5 succeeded.
  2458. 498.16 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  2459. 498.16 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2460. 498.16 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2461. 498.16 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2462. 498.16 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2463. 498.16 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2464. 498.16 s [duoids-hedgehog] ✓ 5 succeeded.
  2465. 498.16 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  2466. 498.16 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  2467. 498.16 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  2468. 498.16 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  2469. 498.16 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  2470. 498.16 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  2471. 498.16 s [duoids-hedgehog] ✓ 5 succeeded.
  2472. 498.16 s [duoids-hedgehog] Test suite laws: PASS
  2473. 498.16 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  2474. 498.16 s [duoids-hedgehog] Test suite doctests: RUNNING...
  2475. 499.93 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2476. 500.05 s [duoids-hedgehog] NameLib Nothing
  2477. 500.05 s [duoids-hedgehog] ----------------------------------------
  2478. 500.07 s [duoids-hedgehog] Test suite doctests: PASS
  2479. 500.07 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  2480. 500.07 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  2481. 500.19 s [duoids-hedgehog] Phase: haddockPhase
  2482. 500.89 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  2483. 500.89 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  2484. 500.92 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  2485. 502.37 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  2486. 504.00 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  2487. 504.15 s [duoids-hedgehog] Haddock coverage:
  2488. 504.15 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  2489. 504.15 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  2490. 509.07 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  2491. 516.20 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  2492. 518.02 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  2493. 519.25 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  2494. 519.25 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  2495. 519.41 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2496. 519.42 s [duoidal-transformers] Phase: installPhase
  2497. 519.66 s [duoidal-transformers] Installing library in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C
  2498. 520.24 s [duoidal-transformers] Phase: fixupPhase
  2499. 520.27 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2500. 520.27 s [duoidal-transformers] shrinking /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoidal-transformers-0.0.1.0-CvSDw6uKPS3oljO08JK1C-ghc9.10.3.so
  2501. 520.29 s [duoidal-transformers] checking for references to /build/ in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0...
  2502. 520.32 s [duoidal-transformers] patching script interpreter paths in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2503. 520.34 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/lib
  2504. 520.41 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc
  2505. 520.42 s [duoidal-transformers] checking for references to /build/ in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc...
  2506. 520.45 s [duoidal-transformers] patching script interpreter paths in /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc
  2507. 520.76 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2508. 521.73 s [post-build-hook] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  2509. 521.73 s [post-build-hook]
  2510. 522.17 s [post-build-hook] Pushing /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0 (674.16 KiB)
  2511. 522.22 s [post-build-hook] Pushing /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc (347.32 KiB)
  2512. 523.32 s [post-build-hook]
  2513. 523.32 s [post-build-hook] All done.
  2514. 523.35 s [post-build-hook] Uploading to the NixCI cache: /nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0
  2515. 523.44 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2516. 523.47 s [post-build-hook] copying 2 paths...
  2517. 523.47 s [post-build-hook] copying path '/nix/store/9ixkkkzx87l3hawcn4hm2gam0gry5nd2-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2518. 523.93 s [post-build-hook] copying path '/nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  2519. 524.49 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2520. 524.77 s [post-build-hook] copying 1 paths...
  2521. 524.77 s [post-build-hook] copying path '/nix/store/3z632d2bnwf31pgdmw7lppbzcvncbqp1-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  2522. 525.38 s Progress: 7 of 21 built (2 building), 193 of 193 downloaded from cache
  2523. 529.60 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  2524. 529.64 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  2525. 529.80 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  2526. 529.81 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  2527. 529.83 s [duoids-hedgehog] haddockPhase completed in 30 seconds
  2528. 529.83 s [duoids-hedgehog] Phase: installPhase
  2529. 530.15 s [duoids-hedgehog] Installing library in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  2530. 530.95 s [duoids-hedgehog] Phase: fixupPhase
  2531. 531.00 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
  2532. 531.00 s [duoids-hedgehog] shrinking /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSduoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW-ghc9.10.3.so
  2533. 531.02 s [duoids-hedgehog] checking for references to /build/ in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0...
  2534. 531.06 s [duoids-hedgehog] patching script interpreter paths in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0
  2535. 531.07 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/lib
  2536. 531.16 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
  2537. 531.17 s [duoids-hedgehog] checking for references to /build/ in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc...
  2538. 531.21 s [duoids-hedgehog] patching script interpreter paths in /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
  2539. 531.61 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
  2540. 532.50 s [post-build-hook] Pushing 2 paths (136 are already present) using zstd to cache sellout ⏳
  2541. 532.50 s [post-build-hook]
  2542. 533.00 s [post-build-hook] Pushing /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc (301.60 KiB)
  2543. 533.00 s [post-build-hook] Pushing /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 (538.12 KiB)
  2544. 534.16 s [post-build-hook]
  2545. 534.16 s [post-build-hook] All done.
  2546. 534.24 s [post-build-hook] Uploading to the NixCI cache: /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0 /nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc
  2547. 534.39 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2548. 534.48 s [post-build-hook] copying 2 paths...
  2549. 534.49 s [post-build-hook] copying path '/nix/store/almam2irckbyg0a0s7kyis290vjq1rac-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2550. 535.07 s [post-build-hook] copying path '/nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  2551. 535.92 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2552. 536.34 s [post-build-hook] copying 1 paths...
  2553. 536.35 s [post-build-hook] copying path '/nix/store/48a9v6w5scdj0m568j6z19lwa09gshck-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  2554. 536.70 s Progress: 8 of 20 built (1 building), 193 of 193 downloaded from cache
  2555. 536.70 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  2556. 536.70 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  2557. 555.41 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  2558. 555.45 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  2559. 555.45 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  2560. 555.45 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  2561. 555.45 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  2562. 555.49 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  2563. 555.49 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  2564. 568.84 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  2565. 577.97 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  2566. 588.56 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  2567. 590.23 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  2568. 590.24 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  2569. 590.36 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.dyn_o )
  2570. 590.54 s [vector] [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.dyn_o )
  2571. 602.30 s [vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.dyn_o )
  2572. 602.33 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2573. 602.34 s [vector] In the use of ‘tail’
  2574. 602.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2575. 602.34 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2576. 602.34 s [vector] |
  2577. 602.34 s [vector] 244 | postscanl f z = tail . scanl f z
  2578. 602.34 s [vector] | ^^^^
  2579. 602.34 s [vector]
  2580. 602.34 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2581. 602.34 s [vector] In the use of ‘tail’
  2582. 602.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2583. 602.34 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2584. 602.34 s [vector] |
  2585. 602.34 s [vector] 245 | prescanr f z = tail . scanr f z
  2586. 602.34 s [vector] | ^^^^
  2587. 602.34 s [vector]
  2588. 602.34 s [vector] [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.dyn_o )
  2589. 602.34 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2590. 602.34 s [vector] In the use of ‘head’
  2591. 602.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2592. 602.34 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2593. 602.34 s [vector] |
  2594. 602.34 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2595. 602.34 s [vector] | ^^^^
  2596. 602.34 s [vector]
  2597. 602.34 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2598. 602.34 s [vector] In the use of ‘head’
  2599. 602.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2600. 602.34 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2601. 602.34 s [vector] |
  2602. 602.34 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2603. 602.34 s [vector] | ^^^^
  2604. 602.34 s [vector]
  2605. 602.34 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2606. 602.34 s [vector] In the use of ‘tail’
  2607. 602.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2608. 602.34 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2609. 602.34 s [vector] |
  2610. 602.34 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2611. 602.34 s [vector] | ^^^^
  2612. 602.34 s [vector]
  2613. 602.34 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2614. 602.34 s [vector] In the use of ‘head’
  2615. 602.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2616. 602.34 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2617. 602.34 s [vector] |
  2618. 602.34 s [vector] 439 | = V.uniq `eq` (map head . group)
  2619. 602.34 s [vector] | ^^^^
  2620. 602.34 s [vector]
  2621. 615.72 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.dyn_o )
  2622. 649.77 s [vector] [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.dyn_o )
  2623. 649.80 s [vector] [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.dyn_o )
  2624. 649.80 s [vector] [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.dyn_o )
  2625. 649.80 s [vector] [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.dyn_o )
  2626. 649.80 s [vector] [10 of 12] Compiling Tests.Move ( tests/Tests/Move.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.dyn_o )
  2627. 649.80 s [vector] [11 of 12] Compiling Tests.Bundle ( tests/Tests/Bundle.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.dyn_o )
  2628. 649.80 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2629. 649.80 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2630. 649.80 s [vector] |
  2631. 649.80 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2632. 649.80 s [vector] | ^^^^^^
  2633. 649.80 s [vector]
  2634. 649.80 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2635. 649.80 s [vector] In the use of ‘head’
  2636. 649.80 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2637. 649.80 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2638. 649.80 s [vector] |
  2639. 649.80 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2640. 649.80 s [vector] | ^^^^
  2641. 649.80 s [vector]
  2642. 649.80 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2643. 649.80 s [vector] In the use of ‘tail’
  2644. 649.80 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2645. 649.80 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2646. 649.80 s [vector] |
  2647. 649.80 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2648. 649.80 s [vector] | ^^^^
  2649. 649.80 s [vector]
  2650. 649.80 s [vector] [12 of 12] Compiling Main ( tests/Main.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.dyn_o )
  2651. 650.57 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  2652. 651.85 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  2653. 651.86 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  2654. 651.97 s [vector] [ 1 of 12] Compiling Boilerplater ( tests/Boilerplater.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.dyn_o )
  2655. 652.14 s [vector] [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.dyn_o )
  2656. 653.51 s [vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.dyn_o )
  2657. 653.51 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2658. 653.51 s [vector] In the use of ‘tail’
  2659. 653.51 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2660. 653.51 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2661. 653.51 s [vector] |
  2662. 653.51 s [vector] 244 | postscanl f z = tail . scanl f z
  2663. 653.51 s [vector] | ^^^^
  2664. 653.51 s [vector]
  2665. 653.51 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2666. 653.51 s [vector] In the use of ‘tail’
  2667. 653.51 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2668. 653.51 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2669. 653.51 s [vector] |
  2670. 653.51 s [vector] 245 | prescanr f z = tail . scanr f z
  2671. 653.51 s [vector] | ^^^^
  2672. 653.51 s [vector]
  2673. 653.51 s [vector] [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.dyn_o )
  2674. 653.51 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2675. 653.51 s [vector] In the use of ‘head’
  2676. 653.51 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2677. 653.51 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2678. 653.51 s [vector] |
  2679. 653.51 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2680. 653.51 s [vector] | ^^^^
  2681. 653.51 s [vector]
  2682. 653.51 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2683. 653.51 s [vector] In the use of ‘head’
  2684. 653.51 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2685. 653.51 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2686. 653.51 s [vector] |
  2687. 653.51 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2688. 653.51 s [vector] | ^^^^
  2689. 653.51 s [vector]
  2690. 653.51 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2691. 653.51 s [vector] In the use of ‘tail’
  2692. 653.51 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2693. 653.51 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2694. 653.51 s [vector] |
  2695. 653.51 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2696. 653.51 s [vector] | ^^^^
  2697. 653.51 s [vector]
  2698. 653.51 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2699. 653.51 s [vector] In the use of ‘head’
  2700. 653.51 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2701. 653.51 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2702. 653.51 s [vector] |
  2703. 653.51 s [vector] 439 | = V.uniq `eq` (map head . group)
  2704. 653.51 s [vector] | ^^^^
  2705. 653.51 s [vector]
  2706. 655.07 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.dyn_o )
  2707. 655.37 s [vector] [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.dyn_o )
  2708. 655.37 s [vector] [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.dyn_o )
  2709. 655.37 s [vector] [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.dyn_o )
  2710. 655.37 s [vector] [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.dyn_o )
  2711. 655.37 s [vector] [10 of 12] Compiling Tests.Move ( tests/Tests/Move.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.dyn_o )
  2712. 655.37 s [vector] [11 of 12] Compiling Tests.Bundle ( tests/Tests/Bundle.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.dyn_o )
  2713. 655.37 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2714. 655.37 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2715. 655.37 s [vector] |
  2716. 655.37 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2717. 655.37 s [vector] | ^^^^^^
  2718. 655.37 s [vector]
  2719. 655.37 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2720. 655.37 s [vector] In the use of ‘head’
  2721. 655.37 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2722. 655.37 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2723. 655.37 s [vector] |
  2724. 655.37 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2725. 655.37 s [vector] | ^^^^
  2726. 655.37 s [vector]
  2727. 655.37 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2728. 655.37 s [vector] In the use of ‘tail’
  2729. 655.37 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2730. 655.37 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2731. 655.37 s [vector] |
  2732. 655.37 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2733. 655.37 s [vector] | ^^^^
  2734. 655.37 s [vector]
  2735. 655.37 s [vector] [12 of 12] Compiling Main ( tests/Main.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.dyn_o )
  2736. 656.11 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  2737. 657.31 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  2738. 657.31 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  2739. 657.39 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  2740. 657.83 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  2741. 662.69 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  2742. 662.73 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  2743. 662.82 s [vector] [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.dyn_o )
  2744. 665.27 s [vector] [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.o, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.dyn_o )
  2745. 665.27 s [vector] [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.dyn_o )
  2746. 665.50 s [vector] [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.dyn_o )
  2747. 665.50 s [vector] [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.o, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.dyn_o )
  2748. 665.50 s [vector] [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.o, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.dyn_o )
  2749. 665.50 s [vector] [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.o, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.dyn_o )
  2750. 665.50 s [vector] [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.dyn_o )
  2751. 665.50 s [vector] [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.dyn_o )
  2752. 665.50 s [vector] [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.dyn_o )
  2753. 665.50 s [vector] [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.dyn_o )
  2754. 665.50 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.o, dist/build/benchmarks-O2/Bench/Vector/Tasty.dyn_o )
  2755. 665.50 s [vector] [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.o, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.dyn_o )
  2756. 665.50 s [vector] [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.o, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.dyn_o )
  2757. 665.84 s [vector] [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.p_o )
  2758. 667.99 s [vector] [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.p_o )
  2759. 668.03 s [vector] [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.p_o )
  2760. 668.30 s [vector] [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.p_o )
  2761. 668.30 s [vector] [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.p_o )
  2762. 668.30 s [vector] [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.p_o )
  2763. 668.30 s [vector] [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.p_o )
  2764. 668.30 s [vector] [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.p_o )
  2765. 668.30 s [vector] [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.p_o )
  2766. 668.30 s [vector] [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.p_o )
  2767. 668.30 s [vector] [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.p_o )
  2768. 668.30 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  2769. 668.30 s [vector] [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.p_o )
  2770. 668.30 s [vector] [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.p_o )
  2771. 670.55 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  2772. 670.55 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  2773. 670.71 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  2774. 671.40 s [vector] [2 of 4] Compiling Inspect.DerivingVia.OtherFoo ( tests-inspect/Inspect/DerivingVia/OtherFoo.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.dyn_o )
  2775. 671.40 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  2776. 672.44 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  2777. 673.29 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  2778. 674.25 s [vector] buildPhase completed in 5 minutes 6 seconds
  2779. 674.25 s [vector] Phase: checkPhase
  2780. 674.57 s [vector] Running 2 test suites...
  2781. 674.57 s [vector] Test suite vector-tests-O0: RUNNING...
  2782. 674.91 s [vector] toplevel
  2783. 674.91 s [vector] Data.Vector.Fusion.Bundle
  2784. 674.91 s [vector] fromList.toList == id: OK
  2785. 674.91 s [vector] +++ OK, passed 100 tests.
  2786. 674.91 s [vector] toList.fromList == id: OK
  2787. 674.91 s [vector] +++ OK, passed 100 tests.
  2788. 674.91 s [vector] eq: OK
  2789. 674.91 s [vector] +++ OK, passed 100 tests.
  2790. 674.91 s [vector] length: OK
  2791. 674.91 s [vector] +++ OK, passed 100 tests.
  2792. 674.91 s [vector] null: OK
  2793. 674.91 s [vector] +++ OK, passed 100 tests.
  2794. 674.91 s [vector] empty: OK
  2795. 674.91 s [vector] +++ OK, passed 100 tests.
  2796. 674.91 s [vector] singleton: OK
  2797. 674.92 s [vector] +++ OK, passed 100 tests.
  2798. 674.92 s [vector] replicate: OK
  2799. 674.92 s [vector] +++ OK, passed 100 tests.
  2800. 674.92 s [vector] cons: OK
  2801. 674.92 s [vector] +++ OK, passed 100 tests.
  2802. 674.92 s [vector] snoc: OK
  2803. 674.92 s [vector] +++ OK, passed 100 tests.
  2804. 674.92 s [vector] append: OK
  2805. 674.92 s [vector] +++ OK, passed 100 tests.
  2806. 674.92 s [vector] head: OK
  2807. 674.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2808. 674.92 s [vector] last: OK
  2809. 674.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2810. 674.92 s [vector] index: OK
  2811. 674.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2812. 674.92 s [vector] extract: OK
  2813. 674.92 s [vector] +++ OK, passed 100 tests.
  2814. 674.92 s [vector] init: OK
  2815. 674.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2816. 674.93 s [vector] tail: OK
  2817. 674.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2818. 674.93 s [vector] take: OK
  2819. 674.93 s [vector] +++ OK, passed 100 tests.
  2820. 674.93 s [vector] drop: OK
  2821. 674.93 s [vector] +++ OK, passed 100 tests.
  2822. 674.93 s [vector] map: OK
  2823. 674.93 s [vector] +++ OK, passed 100 tests.
  2824. 674.93 s [vector] zipWith: OK
  2825. 674.93 s [vector] +++ OK, passed 100 tests.
  2826. 674.93 s [vector] zipWith3: OK
  2827. 674.93 s [vector] +++ OK, passed 100 tests.
  2828. 674.93 s [vector] filter: OK
  2829. 674.93 s [vector] +++ OK, passed 100 tests.
  2830. 674.93 s [vector] takeWhile: OK
  2831. 674.93 s [vector] +++ OK, passed 100 tests.
  2832. 674.93 s [vector] dropWhile: OK
  2833. 674.93 s [vector] +++ OK, passed 100 tests.
  2834. 674.93 s [vector] elem: OK
  2835. 674.93 s [vector] +++ OK, passed 100 tests.
  2836. 674.93 s [vector] notElem: OK
  2837. 674.93 s [vector] +++ OK, passed 100 tests.
  2838. 674.93 s [vector] find: OK
  2839. 674.93 s [vector] +++ OK, passed 100 tests.
  2840. 674.93 s [vector] findIndex: OK
  2841. 674.93 s [vector] +++ OK, passed 100 tests.
  2842. 674.93 s [vector] foldl: OK
  2843. 674.93 s [vector] +++ OK, passed 100 tests.
  2844. 674.93 s [vector] foldl1: OK
  2845. 674.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2846. 674.93 s [vector] foldl': OK
  2847. 674.93 s [vector] +++ OK, passed 100 tests.
  2848. 674.93 s [vector] foldl1': OK
  2849. 674.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2850. 674.93 s [vector] foldr: OK
  2851. 674.93 s [vector] +++ OK, passed 100 tests.
  2852. 674.93 s [vector] foldr1: OK
  2853. 674.93 s [vector] +++ OK, passed 100 tests; 10 discarded.
  2854. 674.93 s [vector] prescanl: OK
  2855. 674.93 s [vector] +++ OK, passed 100 tests.
  2856. 674.93 s [vector] prescanl': OK
  2857. 674.93 s [vector] +++ OK, passed 100 tests.
  2858. 674.94 s [vector] postscanl: OK
  2859. 674.94 s [vector] +++ OK, passed 100 tests.
  2860. 674.94 s [vector] postscanl': OK
  2861. 674.94 s [vector] +++ OK, passed 100 tests.
  2862. 674.94 s [vector] scanl: OK
  2863. 674.94 s [vector] +++ OK, passed 100 tests.
  2864. 674.94 s [vector] scanl': OK
  2865. 674.94 s [vector] +++ OK, passed 100 tests.
  2866. 674.94 s [vector] scanl1: OK
  2867. 674.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2868. 674.94 s [vector] scanl1': OK
  2869. 674.94 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2870. 674.94 s [vector] concatMap: OK
  2871. 674.94 s [vector] +++ OK, passed 100 tests.
  2872. 674.94 s [vector] unfoldr: OK
  2873. 674.94 s [vector] +++ OK, passed 100 tests.
  2874. 674.94 s [vector] and: OK
  2875. 674.94 s [vector] +++ OK, passed 100 tests.
  2876. 674.95 s [vector] or: OK
  2877. 674.95 s [vector] +++ OK, passed 100 tests.
  2878. 674.95 s [vector] Tests.Vector.Boxed
  2879. 674.95 s [vector] Bool
  2880. 674.96 s [vector] fromList.toList == id: OK
  2881. 674.97 s [vector] +++ OK, passed 100 tests.
  2882. 674.97 s [vector] toList.fromList == id: OK
  2883. 674.97 s [vector] +++ OK, passed 100 tests.
  2884. 674.97 s [vector] unstream.stream == id: OK
  2885. 674.97 s [vector] +++ OK, passed 100 tests.
  2886. 674.97 s [vector] stream.unstream == id: OK
  2887. 674.97 s [vector] +++ OK, passed 100 tests.
  2888. 674.97 s [vector] eq: OK
  2889. 674.97 s [vector] +++ OK, passed 100 tests.
  2890. 674.97 s [vector] length: OK
  2891. 674.98 s [vector] +++ OK, passed 100 tests.
  2892. 674.98 s [vector] null: OK
  2893. 674.98 s [vector] +++ OK, passed 100 tests.
  2894. 674.98 s [vector] index: OK
  2895. 674.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2896. 674.98 s [vector] safeIndex: OK
  2897. 674.99 s [vector] +++ OK, passed 100 tests.
  2898. 674.99 s [vector] head: OK
  2899. 674.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2900. 674.99 s [vector] last: OK
  2901. 674.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2902. 674.99 s [vector] unsafeIndex: OK
  2903. 674.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2904. 674.99 s [vector] unsafeHead: OK
  2905. 674.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2906. 674.99 s [vector] unsafeLast: OK
  2907. 674.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2908. 674.99 s [vector] slice: OK
  2909. 674.99 s [vector] +++ OK, passed 100 tests.
  2910. 674.99 s [vector] init: OK
  2911. 674.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2912. 674.99 s [vector] tail: OK
  2913. 674.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2914. 674.99 s [vector] take: OK
  2915. 674.99 s [vector] +++ OK, passed 100 tests.
  2916. 674.99 s [vector] drop: OK
  2917. 674.99 s [vector] +++ OK, passed 100 tests.
  2918. 674.99 s [vector] splitAt: OK
  2919. 674.99 s [vector] +++ OK, passed 100 tests.
  2920. 674.99 s [vector] empty: OK
  2921. 674.99 s [vector] +++ OK, passed 100 tests.
  2922. 674.99 s [vector] singleton: OK
  2923. 674.99 s [vector] +++ OK, passed 100 tests.
  2924. 674.99 s [vector] replicate: OK
  2925. 674.99 s [vector] +++ OK, passed 100 tests.
  2926. 674.99 s [vector] generate: OK
  2927. 674.99 s [vector] +++ OK, passed 100 tests.
  2928. 674.99 s [vector] iterateN: OK
  2929. 674.99 s [vector] +++ OK, passed 100 tests.
  2930. 674.99 s [vector] iterateNM: OK (0.05s)
  2931. 674.99 s [vector] +++ OK, passed 100 tests.
  2932. 674.99 s [vector] generateM: OK (0.01s)
  2933. 674.99 s [vector] +++ OK, passed 100 tests.
  2934. 675.00 s [vector] replicateM: OK (0.01s)
  2935. 675.00 s [vector] +++ OK, passed 100 tests.
  2936. 675.00 s [vector] create: OK
  2937. 675.00 s [vector] +++ OK, passed 100 tests.
  2938. 675.00 s [vector] createT: OK
  2939. 675.00 s [vector] +++ OK, passed 100 tests.
  2940. 675.00 s [vector] unfoldr: OK
  2941. 675.00 s [vector] +++ OK, passed 100 tests.
  2942. 675.00 s [vector] unfoldrN: OK
  2943. 675.00 s [vector] +++ OK, passed 100 tests.
  2944. 675.01 s [vector] unfoldrExactN: OK
  2945. 675.01 s [vector] +++ OK, passed 100 tests.
  2946. 675.01 s [vector] unfoldrM: OK
  2947. 675.01 s [vector] +++ OK, passed 100 tests.
  2948. 675.01 s [vector] unfoldrNM: OK
  2949. 675.01 s [vector] +++ OK, passed 100 tests.
  2950. 675.01 s [vector] unfoldrExactNM: OK (0.02s)
  2951. 675.01 s [vector] +++ OK, passed 100 tests.
  2952. 675.01 s [vector] constructN: OK
  2953. 675.01 s [vector] +++ OK, passed 100 tests.
  2954. 675.01 s [vector] constructrN: OK
  2955. 675.01 s [vector] +++ OK, passed 100 tests.
  2956. 675.01 s [vector] cons: OK
  2957. 675.01 s [vector] +++ OK, passed 100 tests.
  2958. 675.01 s [vector] snoc: OK
  2959. 675.01 s [vector] +++ OK, passed 100 tests.
  2960. 675.01 s [vector] append: OK
  2961. 675.01 s [vector] +++ OK, passed 100 tests.
  2962. 675.01 s [vector] concat: OK
  2963. 675.01 s [vector] +++ OK, passed 100 tests.
  2964. 675.01 s [vector] force: OK
  2965. 675.01 s [vector] +++ OK, passed 100 tests.
  2966. 675.01 s [vector] upd: OK
  2967. 675.01 s [vector] +++ OK, passed 100 tests.
  2968. 675.01 s [vector] accum: OK
  2969. 675.01 s [vector] +++ OK, passed 100 tests.
  2970. 675.01 s [vector] reverse: OK
  2971. 675.01 s [vector] +++ OK, passed 100 tests.
  2972. 675.01 s [vector] backpermute: OK
  2973. 675.01 s [vector] +++ OK, passed 100 tests.
  2974. 675.01 s [vector] map: OK
  2975. 675.01 s [vector] +++ OK, passed 100 tests.
  2976. 675.01 s [vector] imap: OK
  2977. 675.01 s [vector] +++ OK, passed 100 tests.
  2978. 675.01 s [vector] concatMap: OK
  2979. 675.01 s [vector] +++ OK, passed 100 tests.
  2980. 675.01 s [vector] mapM: OK
  2981. 675.01 s [vector] +++ OK, passed 100 tests.
  2982. 675.01 s [vector] mapM_: OK (0.01s)
  2983. 675.01 s [vector] +++ OK, passed 100 tests.
  2984. 675.01 s [vector] forM: OK
  2985. 675.01 s [vector] +++ OK, passed 100 tests.
  2986. 675.01 s [vector] forM_: OK (0.01s)
  2987. 675.01 s [vector] +++ OK, passed 100 tests.
  2988. 675.01 s [vector] imapM: OK
  2989. 675.01 s [vector] +++ OK, passed 100 tests.
  2990. 675.01 s [vector] imapM_: OK (0.01s)
  2991. 675.01 s [vector] +++ OK, passed 100 tests.
  2992. 675.01 s [vector] zipWith: OK
  2993. 675.01 s [vector] +++ OK, passed 100 tests.
  2994. 675.01 s [vector] zipWith3: OK
  2995. 675.01 s [vector] +++ OK, passed 100 tests.
  2996. 675.01 s [vector] izipWith: OK
  2997. 675.01 s [vector] +++ OK, passed 100 tests.
  2998. 675.01 s [vector] izipWith3: OK
  2999. 675.01 s [vector] +++ OK, passed 100 tests.
  3000. 675.01 s [vector] izipWithM: OK
  3001. 675.01 s [vector] +++ OK, passed 100 tests.
  3002. 675.01 s [vector] izipWithM_: OK
  3003. 675.01 s [vector] +++ OK, passed 100 tests.
  3004. 675.01 s [vector] zipWithM: OK
  3005. 675.02 s [vector] +++ OK, passed 100 tests.
  3006. 675.02 s [vector] zipWithM_: OK
  3007. 675.02 s [vector] +++ OK, passed 100 tests.
  3008. 675.02 s [vector] filter: OK
  3009. 675.02 s [vector] +++ OK, passed 100 tests.
  3010. 675.02 s [vector] ifilter: OK
  3011. 675.02 s [vector] +++ OK, passed 100 tests.
  3012. 675.03 s [vector] filterM: OK (0.02s)
  3013. 675.03 s [vector] +++ OK, passed 100 tests.
  3014. 675.03 s [vector] uniq: OK
  3015. 675.03 s [vector] +++ OK, passed 100 tests.
  3016. 675.03 s [vector] mapMaybe: OK
  3017. 675.03 s [vector] +++ OK, passed 100 tests.
  3018. 675.03 s [vector] imapMaybe: OK
  3019. 675.03 s [vector] +++ OK, passed 100 tests.
  3020. 675.03 s [vector] takeWhile: OK
  3021. 675.03 s [vector] +++ OK, passed 100 tests.
  3022. 675.03 s [vector] dropWhile: OK
  3023. 675.03 s [vector] +++ OK, passed 100 tests.
  3024. 675.03 s [vector] partition: OK
  3025. 675.03 s [vector] +++ OK, passed 100 tests.
  3026. 675.03 s [vector] partitionWith: OK
  3027. 675.03 s [vector] +++ OK, passed 100 tests.
  3028. 675.03 s [vector] span: OK
  3029. 675.03 s [vector] +++ OK, passed 100 tests.
  3030. 675.03 s [vector] break: OK
  3031. 675.03 s [vector] +++ OK, passed 100 tests.
  3032. 675.03 s [vector] spanR: OK
  3033. 675.03 s [vector] +++ OK, passed 100 tests.
  3034. 675.03 s [vector] breakR: OK
  3035. 675.03 s [vector] +++ OK, passed 100 tests.
  3036. 675.03 s [vector] groupBy: OK
  3037. 675.03 s [vector] +++ OK, passed 100 tests.
  3038. 675.03 s [vector] elem: OK
  3039. 675.04 s [vector] +++ OK, passed 100 tests.
  3040. 675.04 s [vector] notElem: OK
  3041. 675.04 s [vector] +++ OK, passed 100 tests.
  3042. 675.04 s [vector] find: OK
  3043. 675.04 s [vector] +++ OK, passed 100 tests.
  3044. 675.04 s [vector] findIndex: OK
  3045. 675.04 s [vector] +++ OK, passed 100 tests.
  3046. 675.04 s [vector] findIndexR: OK
  3047. 675.04 s [vector] +++ OK, passed 100 tests.
  3048. 675.04 s [vector] findIndices: OK
  3049. 675.04 s [vector] +++ OK, passed 100 tests.
  3050. 675.05 s [vector] elemIndex: OK
  3051. 675.05 s [vector] +++ OK, passed 100 tests.
  3052. 675.05 s [vector] elemIndices: OK
  3053. 675.05 s [vector] +++ OK, passed 100 tests.
  3054. 675.05 s [vector] foldl: OK
  3055. 675.05 s [vector] +++ OK, passed 100 tests.
  3056. 675.05 s [vector] foldl1: OK
  3057. 675.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3058. 675.05 s [vector] foldl': OK
  3059. 675.05 s [vector] +++ OK, passed 100 tests.
  3060. 675.05 s [vector] foldl1': OK
  3061. 675.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3062. 675.05 s [vector] foldr: OK
  3063. 675.05 s [vector] +++ OK, passed 100 tests.
  3064. 675.05 s [vector] foldr1: OK
  3065. 675.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3066. 675.05 s [vector] foldr': OK
  3067. 675.05 s [vector] +++ OK, passed 100 tests.
  3068. 675.05 s [vector] foldr1': OK
  3069. 675.05 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3070. 675.05 s [vector] ifoldl: OK
  3071. 675.05 s [vector] +++ OK, passed 100 tests.
  3072. 675.05 s [vector] ifoldl': OK
  3073. 675.05 s [vector] +++ OK, passed 100 tests.
  3074. 675.05 s [vector] ifoldr: OK
  3075. 675.05 s [vector] +++ OK, passed 100 tests.
  3076. 675.05 s [vector] ifoldr': OK
  3077. 675.05 s [vector] +++ OK, passed 100 tests.
  3078. 675.05 s [vector] ifoldM: OK
  3079. 675.05 s [vector] +++ OK, passed 100 tests.
  3080. 675.05 s [vector] ifoldM': OK
  3081. 675.05 s [vector] +++ OK, passed 100 tests.
  3082. 675.05 s [vector] ifoldM_: OK (0.01s)
  3083. 675.05 s [vector] +++ OK, passed 100 tests.
  3084. 675.05 s [vector] ifoldM'_: OK (0.01s)
  3085. 675.05 s [vector] +++ OK, passed 100 tests.
  3086. 675.05 s [vector] all: OK
  3087. 675.05 s [vector] +++ OK, passed 100 tests.
  3088. 675.05 s [vector] any: OK
  3089. 675.05 s [vector] +++ OK, passed 100 tests.
  3090. 675.05 s [vector] prescanl: OK
  3091. 675.05 s [vector] +++ OK, passed 100 tests.
  3092. 675.05 s [vector] prescanl': OK
  3093. 675.05 s [vector] +++ OK, passed 100 tests.
  3094. 675.05 s [vector] postscanl: OK
  3095. 675.05 s [vector] +++ OK, passed 100 tests.
  3096. 675.05 s [vector] postscanl': OK
  3097. 675.05 s [vector] +++ OK, passed 100 tests.
  3098. 675.05 s [vector] scanl: OK
  3099. 675.05 s [vector] +++ OK, passed 100 tests.
  3100. 675.05 s [vector] scanl': OK
  3101. 675.05 s [vector] +++ OK, passed 100 tests.
  3102. 675.05 s [vector] scanl1: OK
  3103. 675.05 s [vector] +++ OK, passed 100 tests.
  3104. 675.05 s [vector] scanl1': OK
  3105. 675.05 s [vector] +++ OK, passed 100 tests.
  3106. 675.05 s [vector] iscanl: OK
  3107. 675.05 s [vector] +++ OK, passed 100 tests.
  3108. 675.05 s [vector] iscanl': OK
  3109. 675.05 s [vector] +++ OK, passed 100 tests.
  3110. 675.05 s [vector] prescanr: OK
  3111. 675.05 s [vector] +++ OK, passed 100 tests.
  3112. 675.05 s [vector] prescanr': OK
  3113. 675.05 s [vector] +++ OK, passed 100 tests.
  3114. 675.06 s [vector] postscanr: OK
  3115. 675.06 s [vector] +++ OK, passed 100 tests.
  3116. 675.06 s [vector] postscanr': OK
  3117. 675.06 s [vector] +++ OK, passed 100 tests.
  3118. 675.06 s [vector] scanr: OK
  3119. 675.06 s [vector] +++ OK, passed 100 tests.
  3120. 675.06 s [vector] scanr': OK
  3121. 675.06 s [vector] +++ OK, passed 100 tests.
  3122. 675.06 s [vector] scanr1: OK
  3123. 675.06 s [vector] +++ OK, passed 100 tests.
  3124. 675.06 s [vector] scanr1': OK
  3125. 675.06 s [vector] +++ OK, passed 100 tests.
  3126. 675.06 s [vector] iscanr: OK
  3127. 675.06 s [vector] +++ OK, passed 100 tests.
  3128. 675.06 s [vector] iscanr': OK
  3129. 675.06 s [vector] +++ OK, passed 100 tests.
  3130. 675.06 s [vector] mut_read: OK
  3131. 675.06 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3132. 675.06 s [vector] mut_write: OK
  3133. 675.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3134. 675.06 s [vector] mut_modify: OK
  3135. 675.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3136. 675.06 s [vector] mut_generate: OK
  3137. 675.06 s [vector] +++ OK, passed 100 tests.
  3138. 675.06 s [vector] mut_generateM: OK
  3139. 675.06 s [vector] +++ OK, passed 100 tests.
  3140. 675.06 s [vector] mut_mapM_: OK
  3141. 675.06 s [vector] +++ OK, passed 100 tests.
  3142. 675.06 s [vector] mut_imapM_: OK (0.01s)
  3143. 675.06 s [vector] +++ OK, passed 100 tests.
  3144. 675.07 s [vector] mut_forM_: OK
  3145. 675.07 s [vector] +++ OK, passed 100 tests.
  3146. 675.08 s [vector] mut_iforM_: OK (0.01s)
  3147. 675.08 s [vector] +++ OK, passed 100 tests.
  3148. 675.08 s [vector] mut_foldr: OK
  3149. 675.08 s [vector] +++ OK, passed 100 tests.
  3150. 675.08 s [vector] mut_foldr': OK
  3151. 675.08 s [vector] +++ OK, passed 100 tests.
  3152. 675.08 s [vector] mut_foldl: OK
  3153. 675.08 s [vector] +++ OK, passed 100 tests.
  3154. 675.08 s [vector] mut_foldl': OK
  3155. 675.08 s [vector] +++ OK, passed 100 tests.
  3156. 675.09 s [vector] mut_ifoldr: OK
  3157. 675.09 s [vector] +++ OK, passed 100 tests.
  3158. 675.09 s [vector] mut_ifoldr': OK
  3159. 675.09 s [vector] +++ OK, passed 100 tests.
  3160. 675.09 s [vector] mut_ifoldl: OK
  3161. 675.09 s [vector] +++ OK, passed 100 tests.
  3162. 675.09 s [vector] mut_ifoldl': OK
  3163. 675.09 s [vector] +++ OK, passed 100 tests.
  3164. 675.10 s [vector] mut_foldM: OK
  3165. 675.10 s [vector] +++ OK, passed 100 tests.
  3166. 675.10 s [vector] mut_foldM': OK
  3167. 675.10 s [vector] +++ OK, passed 100 tests.
  3168. 675.11 s [vector] mut_foldrM: OK
  3169. 675.11 s [vector] +++ OK, passed 100 tests.
  3170. 675.11 s [vector] mut_foldrM': OK
  3171. 675.11 s [vector] +++ OK, passed 100 tests.
  3172. 675.11 s [vector] mut_ifoldM: OK
  3173. 675.11 s [vector] +++ OK, passed 100 tests.
  3174. 675.11 s [vector] mut_ifoldM': OK
  3175. 675.11 s [vector] +++ OK, passed 100 tests.
  3176. 675.11 s [vector] mut_ifoldrM: OK
  3177. 675.11 s [vector] +++ OK, passed 100 tests.
  3178. 675.11 s [vector] mut_ifoldrM': OK
  3179. 675.11 s [vector] +++ OK, passed 100 tests.
  3180. 675.11 s [vector] compare: OK
  3181. 675.11 s [vector] +++ OK, passed 100 tests.
  3182. 675.11 s [vector] maximum: OK
  3183. 675.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3184. 675.11 s [vector] minimum: OK
  3185. 675.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3186. 675.11 s [vector] minIndex: OK
  3187. 675.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3188. 675.11 s [vector] maxIndex: OK
  3189. 675.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3190. 675.11 s [vector] maximumBy: OK
  3191. 675.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3192. 675.12 s [vector] minimumBy: OK
  3193. 675.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3194. 675.12 s [vector] maximumOn: OK
  3195. 675.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3196. 675.12 s [vector] minimumOn: OK
  3197. 675.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3198. 675.12 s [vector] maxIndexBy: OK
  3199. 675.12 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3200. 675.12 s [vector] minIndexBy: OK
  3201. 675.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3202. 675.12 s [vector] ListFirstMaxIndexWins: OK
  3203. 675.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3204. 675.12 s [vector] FalseListFirstMaxIndexWins: OK
  3205. 675.12 s [vector] +++ OK, failed as expected. (after 1 test):
  3206. 675.12 s [vector] Exception:
  3207. 675.12 s [vector] Prelude.foldr1: empty list
  3208. 675.12 s [vector] CallStack (from HasCallStack):
  3209. 675.12 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3210. 675.12 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3211. 675.12 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3212. 675.12 s [vector] []
  3213. 675.12 s [vector] zip: OK
  3214. 675.12 s [vector] +++ OK, passed 100 tests.
  3215. 675.12 s [vector] zip3: OK
  3216. 675.12 s [vector] +++ OK, passed 100 tests.
  3217. 675.12 s [vector] unzip: OK
  3218. 675.12 s [vector] +++ OK, passed 100 tests.
  3219. 675.12 s [vector] unzip3: OK
  3220. 675.12 s [vector] +++ OK, passed 100 tests.
  3221. 675.12 s [vector] indexed: OK
  3222. 675.12 s [vector] +++ OK, passed 100 tests.
  3223. 675.13 s [vector] update: OK
  3224. 675.13 s [vector] +++ OK, passed 100 tests.
  3225. 675.13 s [vector] concat: OK
  3226. 675.13 s [vector] +++ OK, passed 100 tests.
  3227. 675.14 s [vector] mempty: OK
  3228. 675.14 s [vector] +++ OK, passed 100 tests.
  3229. 675.14 s [vector] mappend: OK
  3230. 675.14 s [vector] +++ OK, passed 100 tests.
  3231. 675.14 s [vector] mconcat: OK
  3232. 675.14 s [vector] +++ OK, passed 100 tests.
  3233. 675.14 s [vector] fmap: OK
  3234. 675.15 s [vector] +++ OK, passed 100 tests.
  3235. 675.15 s [vector] return: OK
  3236. 675.15 s [vector] +++ OK, passed 100 tests.
  3237. 675.15 s [vector] bind: OK
  3238. 675.15 s [vector] +++ OK, passed 100 tests.
  3239. 675.16 s [vector] mzip: OK
  3240. 675.16 s [vector] +++ OK, passed 100 tests.
  3241. 675.16 s [vector] munzip: OK
  3242. 675.16 s [vector] +++ OK, passed 100 tests.
  3243. 675.16 s [vector] applicative_pure: OK
  3244. 675.16 s [vector] +++ OK, passed 100 tests.
  3245. 675.17 s [vector] applicative_appl: OK (0.02s)
  3246. 675.17 s [vector] +++ OK, passed 100 tests.
  3247. 675.17 s [vector] alternative_empty: OK
  3248. 675.17 s [vector] +++ OK, passed 100 tests.
  3249. 675.18 s [vector] alternative_or: OK
  3250. 675.18 s [vector] +++ OK, passed 100 tests.
  3251. 675.20 s [vector] sequence: OK (0.02s)
  3252. 675.20 s [vector] +++ OK, passed 100 tests.
  3253. 675.20 s [vector] sequence_: OK
  3254. 675.20 s [vector] +++ OK, passed 100 tests.
  3255. 675.21 s [vector] glength: OK
  3256. 675.21 s [vector] +++ OK, passed 100 tests.
  3257. 675.21 s [vector] and: OK
  3258. 675.21 s [vector] +++ OK, passed 100 tests.
  3259. 675.21 s [vector] or: OK
  3260. 675.21 s [vector] +++ OK, passed 100 tests.
  3261. 675.21 s [vector] Int
  3262. 675.21 s [vector] fromList.toList == id: OK
  3263. 675.21 s [vector] +++ OK, passed 100 tests.
  3264. 675.21 s [vector] toList.fromList == id: OK
  3265. 675.21 s [vector] +++ OK, passed 100 tests.
  3266. 675.21 s [vector] unstream.stream == id: OK
  3267. 675.21 s [vector] +++ OK, passed 100 tests.
  3268. 675.21 s [vector] stream.unstream == id: OK
  3269. 675.21 s [vector] +++ OK, passed 100 tests.
  3270. 675.21 s [vector] eq: OK
  3271. 675.21 s [vector] +++ OK, passed 100 tests.
  3272. 675.21 s [vector] length: OK
  3273. 675.21 s [vector] +++ OK, passed 100 tests.
  3274. 675.21 s [vector] null: OK
  3275. 675.21 s [vector] +++ OK, passed 100 tests.
  3276. 675.21 s [vector] index: OK
  3277. 675.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3278. 675.21 s [vector] safeIndex: OK
  3279. 675.21 s [vector] +++ OK, passed 100 tests.
  3280. 675.21 s [vector] head: OK
  3281. 675.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3282. 675.21 s [vector] last: OK
  3283. 675.21 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3284. 675.21 s [vector] unsafeIndex: OK
  3285. 675.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3286. 675.21 s [vector] unsafeHead: OK
  3287. 675.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3288. 675.21 s [vector] unsafeLast: OK
  3289. 675.22 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3290. 675.22 s [vector] slice: OK
  3291. 675.22 s [vector] +++ OK, passed 100 tests.
  3292. 675.22 s [vector] init: OK
  3293. 675.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3294. 675.22 s [vector] tail: OK
  3295. 675.22 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3296. 675.22 s [vector] take: OK
  3297. 675.22 s [vector] +++ OK, passed 100 tests.
  3298. 675.22 s [vector] drop: OK
  3299. 675.22 s [vector] +++ OK, passed 100 tests.
  3300. 675.22 s [vector] splitAt: OK
  3301. 675.22 s [vector] +++ OK, passed 100 tests.
  3302. 675.22 s [vector] empty: OK
  3303. 675.23 s [vector] +++ OK, passed 100 tests.
  3304. 675.23 s [vector] singleton: OK
  3305. 675.23 s [vector] +++ OK, passed 100 tests.
  3306. 675.23 s [vector] replicate: OK
  3307. 675.23 s [vector] +++ OK, passed 100 tests.
  3308. 675.23 s [vector] generate: OK
  3309. 675.23 s [vector] +++ OK, passed 100 tests.
  3310. 675.23 s [vector] iterateN: OK
  3311. 675.23 s [vector] +++ OK, passed 100 tests.
  3312. 675.27 s [vector] iterateNM: OK (0.05s)
  3313. 675.27 s [vector] +++ OK, passed 100 tests.
  3314. 675.29 s [vector] generateM: OK
  3315. 675.29 s [vector] +++ OK, passed 100 tests.
  3316. 675.30 s [vector] replicateM: OK (0.01s)
  3317. 675.30 s [vector] +++ OK, passed 100 tests.
  3318. 675.30 s [vector] create: OK
  3319. 675.30 s [vector] +++ OK, passed 100 tests.
  3320. 675.30 s [vector] createT: OK
  3321. 675.30 s [vector] +++ OK, passed 100 tests.
  3322. 675.30 s [vector] unfoldr: OK
  3323. 675.30 s [vector] +++ OK, passed 100 tests.
  3324. 675.30 s [vector] unfoldrN: OK
  3325. 675.30 s [vector] +++ OK, passed 100 tests.
  3326. 675.30 s [vector] unfoldrExactN: OK
  3327. 675.30 s [vector] +++ OK, passed 100 tests.
  3328. 675.31 s [vector] unfoldrM: OK
  3329. 675.31 s [vector] +++ OK, passed 100 tests.
  3330. 675.31 s [vector] unfoldrNM: OK
  3331. 675.31 s [vector] +++ OK, passed 100 tests.
  3332. 675.36 s [vector] unfoldrExactNM: OK (0.05s)
  3333. 675.36 s [vector] +++ OK, passed 100 tests.
  3334. 675.36 s [vector] constructN: OK
  3335. 675.36 s [vector] +++ OK, passed 100 tests.
  3336. 675.36 s [vector] constructrN: OK
  3337. 675.36 s [vector] +++ OK, passed 100 tests.
  3338. 675.36 s [vector] cons: OK
  3339. 675.36 s [vector] +++ OK, passed 100 tests.
  3340. 675.36 s [vector] snoc: OK
  3341. 675.36 s [vector] +++ OK, passed 100 tests.
  3342. 675.36 s [vector] append: OK
  3343. 675.36 s [vector] +++ OK, passed 100 tests.
  3344. 675.37 s [vector] concat: OK (0.01s)
  3345. 675.37 s [vector] +++ OK, passed 100 tests.
  3346. 675.37 s [vector] force: OK
  3347. 675.37 s [vector] +++ OK, passed 100 tests.
  3348. 675.38 s [vector] upd: OK
  3349. 675.38 s [vector] +++ OK, passed 100 tests.
  3350. 675.38 s [vector] accum: OK
  3351. 675.38 s [vector] +++ OK, passed 100 tests.
  3352. 675.38 s [vector] reverse: OK
  3353. 675.38 s [vector] +++ OK, passed 100 tests.
  3354. 675.38 s [vector] backpermute: OK
  3355. 675.38 s [vector] +++ OK, passed 100 tests.
  3356. 675.39 s [vector] map: OK
  3357. 675.39 s [vector] +++ OK, passed 100 tests.
  3358. 675.39 s [vector] imap: OK
  3359. 675.39 s [vector] +++ OK, passed 100 tests.
  3360. 675.39 s [vector] concatMap: OK
  3361. 675.39 s [vector] +++ OK, passed 100 tests.
  3362. 675.39 s [vector] mapM: OK
  3363. 675.40 s [vector] +++ OK, passed 100 tests.
  3364. 675.41 s [vector] mapM_: OK (0.01s)
  3365. 675.42 s [vector] +++ OK, passed 100 tests.
  3366. 675.43 s [vector] forM: OK
  3367. 675.43 s [vector] +++ OK, passed 100 tests.
  3368. 675.44 s [vector] forM_: OK (0.02s)
  3369. 675.44 s [vector] +++ OK, passed 100 tests.
  3370. 675.44 s [vector] imapM: OK
  3371. 675.44 s [vector] +++ OK, passed 100 tests.
  3372. 675.45 s [vector] imapM_: OK (0.02s)
  3373. 675.45 s [vector] +++ OK, passed 100 tests.
  3374. 675.45 s [vector] zipWith: OK
  3375. 675.46 s [vector] +++ OK, passed 100 tests.
  3376. 675.46 s [vector] zipWith3: OK
  3377. 675.46 s [vector] +++ OK, passed 100 tests.
  3378. 675.46 s [vector] izipWith: OK
  3379. 675.46 s [vector] +++ OK, passed 100 tests.
  3380. 675.46 s [vector] izipWith3: OK
  3381. 675.46 s [vector] +++ OK, passed 100 tests.
  3382. 675.46 s [vector] izipWithM: OK
  3383. 675.46 s [vector] +++ OK, passed 100 tests.
  3384. 675.47 s [vector] izipWithM_: OK (0.01s)
  3385. 675.47 s [vector] +++ OK, passed 100 tests.
  3386. 675.47 s [vector] zipWithM: OK
  3387. 675.47 s [vector] +++ OK, passed 100 tests.
  3388. 675.49 s [vector] zipWithM_: OK
  3389. 675.49 s [vector] +++ OK, passed 100 tests.
  3390. 675.50 s [vector] filter: OK
  3391. 675.50 s [vector] +++ OK, passed 100 tests.
  3392. 675.51 s [vector] ifilter: OK
  3393. 675.51 s [vector] +++ OK, passed 100 tests.
  3394. 675.52 s [vector] filterM: OK (0.03s)
  3395. 675.52 s [vector] +++ OK, passed 100 tests.
  3396. 675.52 s [vector] uniq: OK
  3397. 675.52 s [vector] +++ OK, passed 100 tests.
  3398. 675.52 s [vector] mapMaybe: OK
  3399. 675.52 s [vector] +++ OK, passed 100 tests.
  3400. 675.53 s [vector] imapMaybe: OK
  3401. 675.53 s [vector] +++ OK, passed 100 tests.
  3402. 675.53 s [vector] takeWhile: OK
  3403. 675.53 s [vector] +++ OK, passed 100 tests.
  3404. 675.53 s [vector] dropWhile: OK
  3405. 675.53 s [vector] +++ OK, passed 100 tests.
  3406. 675.53 s [vector] partition: OK
  3407. 675.53 s [vector] +++ OK, passed 100 tests.
  3408. 675.53 s [vector] partitionWith: OK
  3409. 675.53 s [vector] +++ OK, passed 100 tests.
  3410. 675.53 s [vector] span: OK
  3411. 675.53 s [vector] +++ OK, passed 100 tests.
  3412. 675.53 s [vector] break: OK
  3413. 675.53 s [vector] +++ OK, passed 100 tests.
  3414. 675.53 s [vector] spanR: OK
  3415. 675.53 s [vector] +++ OK, passed 100 tests.
  3416. 675.54 s [vector] breakR: OK
  3417. 675.54 s [vector] +++ OK, passed 100 tests.
  3418. 675.54 s [vector] groupBy: OK
  3419. 675.54 s [vector] +++ OK, passed 100 tests.
  3420. 675.54 s [vector] elem: OK
  3421. 675.54 s [vector] +++ OK, passed 100 tests.
  3422. 675.54 s [vector] notElem: OK
  3423. 675.54 s [vector] +++ OK, passed 100 tests.
  3424. 675.54 s [vector] find: OK
  3425. 675.54 s [vector] +++ OK, passed 100 tests.
  3426. 675.54 s [vector] findIndex: OK
  3427. 675.54 s [vector] +++ OK, passed 100 tests.
  3428. 675.54 s [vector] findIndexR: OK
  3429. 675.54 s [vector] +++ OK, passed 100 tests.
  3430. 675.54 s [vector] findIndices: OK
  3431. 675.54 s [vector] +++ OK, passed 100 tests.
  3432. 675.54 s [vector] elemIndex: OK
  3433. 675.54 s [vector] +++ OK, passed 100 tests.
  3434. 675.54 s [vector] elemIndices: OK
  3435. 675.54 s [vector] +++ OK, passed 100 tests.
  3436. 675.54 s [vector] foldl: OK
  3437. 675.54 s [vector] +++ OK, passed 100 tests.
  3438. 675.55 s [vector] foldl1: OK
  3439. 675.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3440. 675.55 s [vector] foldl': OK
  3441. 675.55 s [vector] +++ OK, passed 100 tests.
  3442. 675.56 s [vector] foldl1': OK
  3443. 675.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3444. 675.56 s [vector] foldr: OK
  3445. 675.56 s [vector] +++ OK, passed 100 tests.
  3446. 675.56 s [vector] foldr1: OK
  3447. 675.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3448. 675.56 s [vector] foldr': OK
  3449. 675.56 s [vector] +++ OK, passed 100 tests.
  3450. 675.56 s [vector] foldr1': OK
  3451. 675.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3452. 675.57 s [vector] ifoldl: OK
  3453. 675.57 s [vector] +++ OK, passed 100 tests.
  3454. 675.57 s [vector] ifoldl': OK
  3455. 675.58 s [vector] +++ OK, passed 100 tests.
  3456. 675.58 s [vector] ifoldr: OK
  3457. 675.58 s [vector] +++ OK, passed 100 tests.
  3458. 675.58 s [vector] ifoldr': OK
  3459. 675.58 s [vector] +++ OK, passed 100 tests.
  3460. 675.58 s [vector] ifoldM: OK
  3461. 675.58 s [vector] +++ OK, passed 100 tests.
  3462. 675.59 s [vector] ifoldM': OK
  3463. 675.59 s [vector] +++ OK, passed 100 tests.
  3464. 675.60 s [vector] ifoldM_: OK (0.02s)
  3465. 675.60 s [vector] +++ OK, passed 100 tests.
  3466. 675.62 s [vector] ifoldM'_: OK (0.02s)
  3467. 675.62 s [vector] +++ OK, passed 100 tests.
  3468. 675.62 s [vector] all: OK
  3469. 675.62 s [vector] +++ OK, passed 100 tests.
  3470. 675.62 s [vector] any: OK
  3471. 675.62 s [vector] +++ OK, passed 100 tests.
  3472. 675.62 s [vector] prescanl: OK
  3473. 675.62 s [vector] +++ OK, passed 100 tests.
  3474. 675.63 s [vector] prescanl': OK
  3475. 675.63 s [vector] +++ OK, passed 100 tests.
  3476. 675.63 s [vector] postscanl: OK
  3477. 675.63 s [vector] +++ OK, passed 100 tests.
  3478. 675.63 s [vector] postscanl': OK
  3479. 675.63 s [vector] +++ OK, passed 100 tests.
  3480. 675.63 s [vector] scanl: OK
  3481. 675.63 s [vector] +++ OK, passed 100 tests.
  3482. 675.63 s [vector] scanl': OK
  3483. 675.63 s [vector] +++ OK, passed 100 tests.
  3484. 675.63 s [vector] scanl1: OK
  3485. 675.64 s [vector] +++ OK, passed 100 tests.
  3486. 675.64 s [vector] scanl1': OK
  3487. 675.64 s [vector] +++ OK, passed 100 tests.
  3488. 675.64 s [vector] iscanl: OK
  3489. 675.64 s [vector] +++ OK, passed 100 tests.
  3490. 675.64 s [vector] iscanl': OK
  3491. 675.64 s [vector] +++ OK, passed 100 tests.
  3492. 675.65 s [vector] prescanr: OK
  3493. 675.65 s [vector] +++ OK, passed 100 tests.
  3494. 675.65 s [vector] prescanr': OK
  3495. 675.65 s [vector] +++ OK, passed 100 tests.
  3496. 675.66 s [vector] postscanr: OK
  3497. 675.66 s [vector] +++ OK, passed 100 tests.
  3498. 675.66 s [vector] postscanr': OK
  3499. 675.66 s [vector] +++ OK, passed 100 tests.
  3500. 675.67 s [vector] scanr: OK
  3501. 675.67 s [vector] +++ OK, passed 100 tests.
  3502. 675.67 s [vector] scanr': OK
  3503. 675.67 s [vector] +++ OK, passed 100 tests.
  3504. 675.67 s [vector] scanr1: OK
  3505. 675.67 s [vector] +++ OK, passed 100 tests.
  3506. 675.67 s [vector] scanr1': OK
  3507. 675.67 s [vector] +++ OK, passed 100 tests.
  3508. 675.67 s [vector] iscanr: OK
  3509. 675.67 s [vector] +++ OK, passed 100 tests.
  3510. 675.67 s [vector] iscanr': OK
  3511. 675.67 s [vector] +++ OK, passed 100 tests.
  3512. 675.67 s [vector] mut_read: OK
  3513. 675.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3514. 675.68 s [vector] mut_write: OK
  3515. 675.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3516. 675.68 s [vector] mut_modify: OK
  3517. 675.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3518. 675.68 s [vector] mut_generate: OK
  3519. 675.69 s [vector] +++ OK, passed 100 tests.
  3520. 675.69 s [vector] mut_generateM: OK
  3521. 675.69 s [vector] +++ OK, passed 100 tests.
  3522. 675.70 s [vector] mut_mapM_: OK (0.02s)
  3523. 675.70 s [vector] +++ OK, passed 100 tests.
  3524. 675.72 s [vector] mut_imapM_: OK (0.02s)
  3525. 675.72 s [vector] +++ OK, passed 100 tests.
  3526. 675.74 s [vector] mut_forM_: OK (0.02s)
  3527. 675.74 s [vector] +++ OK, passed 100 tests.
  3528. 675.75 s [vector] mut_iforM_: OK (0.02s)
  3529. 675.76 s [vector] +++ OK, passed 100 tests.
  3530. 675.76 s [vector] mut_foldr: OK
  3531. 675.76 s [vector] +++ OK, passed 100 tests.
  3532. 675.76 s [vector] mut_foldr': OK
  3533. 675.76 s [vector] +++ OK, passed 100 tests.
  3534. 675.76 s [vector] mut_foldl: OK
  3535. 675.76 s [vector] +++ OK, passed 100 tests.
  3536. 675.76 s [vector] mut_foldl': OK
  3537. 675.76 s [vector] +++ OK, passed 100 tests.
  3538. 675.76 s [vector] mut_ifoldr: OK
  3539. 675.76 s [vector] +++ OK, passed 100 tests.
  3540. 675.77 s [vector] mut_ifoldr': OK
  3541. 675.77 s [vector] +++ OK, passed 100 tests.
  3542. 675.78 s [vector] mut_ifoldl: OK
  3543. 675.78 s [vector] +++ OK, passed 100 tests.
  3544. 675.78 s [vector] mut_ifoldl': OK
  3545. 675.78 s [vector] +++ OK, passed 100 tests.
  3546. 675.78 s [vector] mut_foldM: OK
  3547. 675.78 s [vector] +++ OK, passed 100 tests.
  3548. 675.79 s [vector] mut_foldM': OK
  3549. 675.79 s [vector] +++ OK, passed 100 tests.
  3550. 675.79 s [vector] mut_foldrM: OK
  3551. 675.80 s [vector] +++ OK, passed 100 tests.
  3552. 675.80 s [vector] mut_foldrM': OK
  3553. 675.80 s [vector] +++ OK, passed 100 tests.
  3554. 675.80 s [vector] mut_ifoldM: OK
  3555. 675.80 s [vector] +++ OK, passed 100 tests.
  3556. 675.80 s [vector] mut_ifoldM': OK
  3557. 675.80 s [vector] +++ OK, passed 100 tests.
  3558. 675.80 s [vector] mut_ifoldrM: OK
  3559. 675.80 s [vector] +++ OK, passed 100 tests.
  3560. 675.81 s [vector] mut_ifoldrM': OK
  3561. 675.81 s [vector] +++ OK, passed 100 tests.
  3562. 675.81 s [vector] compare: OK
  3563. 675.81 s [vector] +++ OK, passed 100 tests.
  3564. 675.81 s [vector] maximum: OK
  3565. 675.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3566. 675.81 s [vector] minimum: OK
  3567. 675.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3568. 675.81 s [vector] minIndex: OK
  3569. 675.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3570. 675.81 s [vector] maxIndex: OK
  3571. 675.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3572. 675.81 s [vector] maximumBy: OK
  3573. 675.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3574. 675.81 s [vector] minimumBy: OK
  3575. 675.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3576. 675.81 s [vector] maximumOn: OK
  3577. 675.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3578. 675.81 s [vector] minimumOn: OK
  3579. 675.82 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3580. 675.82 s [vector] maxIndexBy: OK
  3581. 675.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3582. 675.82 s [vector] minIndexBy: OK
  3583. 675.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3584. 675.82 s [vector] ListFirstMaxIndexWins: OK
  3585. 675.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3586. 675.82 s [vector] FalseListFirstMaxIndexWins: OK
  3587. 675.82 s [vector] +++ OK, failed as expected. (after 1 test):
  3588. 675.82 s [vector] Exception:
  3589. 675.82 s [vector] Prelude.foldr1: empty list
  3590. 675.82 s [vector] CallStack (from HasCallStack):
  3591. 675.82 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3592. 675.82 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3593. 675.82 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3594. 675.82 s [vector] []
  3595. 675.82 s [vector] zip: OK
  3596. 675.82 s [vector] +++ OK, passed 100 tests.
  3597. 675.82 s [vector] zip3: OK
  3598. 675.82 s [vector] +++ OK, passed 100 tests.
  3599. 675.82 s [vector] unzip: OK
  3600. 675.82 s [vector] +++ OK, passed 100 tests.
  3601. 675.82 s [vector] unzip3: OK
  3602. 675.82 s [vector] +++ OK, passed 100 tests.
  3603. 675.82 s [vector] indexed: OK
  3604. 675.82 s [vector] +++ OK, passed 100 tests.
  3605. 675.82 s [vector] update: OK
  3606. 675.82 s [vector] +++ OK, passed 100 tests.
  3607. 675.83 s [vector] concat: OK (0.01s)
  3608. 675.84 s [vector] +++ OK, passed 100 tests.
  3609. 675.84 s [vector] mempty: OK
  3610. 675.84 s [vector] +++ OK, passed 100 tests.
  3611. 675.84 s [vector] mappend: OK
  3612. 675.84 s [vector] +++ OK, passed 100 tests.
  3613. 675.85 s [vector] mconcat: OK (0.01s)
  3614. 675.85 s [vector] +++ OK, passed 100 tests.
  3615. 675.87 s [vector] fmap: OK
  3616. 675.87 s [vector] +++ OK, passed 100 tests.
  3617. 675.87 s [vector] return: OK
  3618. 675.87 s [vector] +++ OK, passed 100 tests.
  3619. 675.87 s [vector] bind: OK (0.02s)
  3620. 675.87 s [vector] +++ OK, passed 100 tests.
  3621. 675.87 s [vector] mzip: OK
  3622. 675.87 s [vector] +++ OK, passed 100 tests.
  3623. 675.87 s [vector] munzip: OK
  3624. 675.87 s [vector] +++ OK, passed 100 tests.
  3625. 675.88 s [vector] applicative_pure: OK
  3626. 675.88 s [vector] +++ OK, passed 100 tests.
  3627. 675.90 s [vector] applicative_appl: OK (0.03s)
  3628. 675.90 s [vector] +++ OK, passed 100 tests.
  3629. 675.90 s [vector] alternative_empty: OK
  3630. 675.90 s [vector] +++ OK, passed 100 tests.
  3631. 675.90 s [vector] alternative_or: OK
  3632. 675.90 s [vector] +++ OK, passed 100 tests.
  3633. 675.94 s [vector] sequence: OK (0.03s)
  3634. 675.94 s [vector] +++ OK, passed 100 tests.
  3635. 675.94 s [vector] sequence_: OK (0.01s)
  3636. 675.94 s [vector] +++ OK, passed 100 tests.
  3637. 675.94 s [vector] glength: OK
  3638. 675.94 s [vector] +++ OK, passed 100 tests.
  3639. 675.95 s [vector] sum: OK
  3640. 675.95 s [vector] +++ OK, passed 100 tests.
  3641. 675.95 s [vector] product: OK
  3642. 675.95 s [vector] +++ OK, passed 100 tests.
  3643. 675.95 s [vector] enumFromN: OK
  3644. 675.95 s [vector] +++ OK, passed 100 tests.
  3645. 675.95 s [vector] enumFromThenN: OK
  3646. 675.95 s [vector] +++ OK, passed 100 tests.
  3647. 675.95 s [vector] enumFromTo: OK
  3648. 675.95 s [vector] +++ OK, passed 100 tests.
  3649. 675.95 s [vector] enumFromThenTo: OK
  3650. 675.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3651. 675.95 s [vector] unstream
  3652. 675.95 s [vector] unstream == vunstream (exact): OK
  3653. 675.95 s [vector] +++ OK, passed 100 tests.
  3654. 675.95 s [vector] unstream == vunstream (unknown): OK
  3655. 675.95 s [vector] +++ OK, passed 100 tests.
  3656. 675.95 s [vector] unstreamR ~= vunstream (exact): OK
  3657. 675.95 s [vector] +++ OK, passed 100 tests.
  3658. 675.95 s [vector] unstreamR ~= vunstream (unknown): OK
  3659. 675.95 s [vector] +++ OK, passed 100 tests.
  3660. 675.95 s [vector] Tests.Vector.Primitive
  3661. 675.95 s [vector] Int
  3662. 675.95 s [vector] fromList.toList == id: OK
  3663. 675.96 s [vector] +++ OK, passed 100 tests.
  3664. 675.96 s [vector] toList.fromList == id: OK
  3665. 675.96 s [vector] +++ OK, passed 100 tests.
  3666. 675.96 s [vector] unstream.stream == id: OK
  3667. 675.96 s [vector] +++ OK, passed 100 tests.
  3668. 675.96 s [vector] stream.unstream == id: OK
  3669. 675.96 s [vector] +++ OK, passed 100 tests.
  3670. 675.96 s [vector] eq: OK
  3671. 675.96 s [vector] +++ OK, passed 100 tests.
  3672. 675.96 s [vector] length: OK
  3673. 675.96 s [vector] +++ OK, passed 100 tests.
  3674. 675.96 s [vector] null: OK
  3675. 675.96 s [vector] +++ OK, passed 100 tests.
  3676. 675.96 s [vector] index: OK
  3677. 675.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3678. 675.96 s [vector] safeIndex: OK
  3679. 675.96 s [vector] +++ OK, passed 100 tests.
  3680. 675.96 s [vector] head: OK
  3681. 675.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3682. 675.96 s [vector] last: OK
  3683. 675.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3684. 675.96 s [vector] unsafeIndex: OK
  3685. 675.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3686. 675.96 s [vector] unsafeHead: OK
  3687. 675.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3688. 675.96 s [vector] unsafeLast: OK
  3689. 675.96 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3690. 675.96 s [vector] slice: OK
  3691. 675.96 s [vector] +++ OK, passed 100 tests.
  3692. 675.96 s [vector] init: OK
  3693. 675.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3694. 675.96 s [vector] tail: OK
  3695. 675.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3696. 675.97 s [vector] take: OK
  3697. 675.97 s [vector] +++ OK, passed 100 tests.
  3698. 675.97 s [vector] drop: OK
  3699. 675.97 s [vector] +++ OK, passed 100 tests.
  3700. 675.97 s [vector] splitAt: OK
  3701. 675.97 s [vector] +++ OK, passed 100 tests.
  3702. 675.97 s [vector] empty: OK
  3703. 675.97 s [vector] +++ OK, passed 100 tests.
  3704. 675.97 s [vector] singleton: OK
  3705. 675.97 s [vector] +++ OK, passed 100 tests.
  3706. 675.97 s [vector] replicate: OK
  3707. 675.97 s [vector] +++ OK, passed 100 tests.
  3708. 675.97 s [vector] generate: OK
  3709. 675.97 s [vector] +++ OK, passed 100 tests.
  3710. 675.98 s [vector] iterateN: OK
  3711. 675.98 s [vector] +++ OK, passed 100 tests.
  3712. 676.02 s [vector] iterateNM: OK (0.04s)
  3713. 676.02 s [vector] +++ OK, passed 100 tests.
  3714. 676.02 s [vector] generateM: OK (0.02s)
  3715. 676.02 s [vector] +++ OK, passed 100 tests.
  3716. 676.03 s [vector] replicateM: OK
  3717. 676.03 s [vector] +++ OK, passed 100 tests.
  3718. 676.03 s [vector] create: OK
  3719. 676.03 s [vector] +++ OK, passed 100 tests.
  3720. 676.04 s [vector] createT: OK
  3721. 676.04 s [vector] +++ OK, passed 100 tests.
  3722. 676.04 s [vector] unfoldr: OK
  3723. 676.04 s [vector] +++ OK, passed 100 tests.
  3724. 676.04 s [vector] unfoldrN: OK
  3725. 676.04 s [vector] +++ OK, passed 100 tests.
  3726. 676.04 s [vector] unfoldrExactN: OK
  3727. 676.04 s [vector] +++ OK, passed 100 tests.
  3728. 676.04 s [vector] unfoldrM: OK
  3729. 676.04 s [vector] +++ OK, passed 100 tests.
  3730. 676.04 s [vector] unfoldrNM: OK
  3731. 676.04 s [vector] +++ OK, passed 100 tests.
  3732. 676.10 s [vector] unfoldrExactNM: OK (0.06s)
  3733. 676.11 s [vector] +++ OK, passed 100 tests.
  3734. 676.11 s [vector] constructN: OK
  3735. 676.11 s [vector] +++ OK, passed 100 tests.
  3736. 676.12 s [vector] constructrN: OK
  3737. 676.12 s [vector] +++ OK, passed 100 tests.
  3738. 676.12 s [vector] cons: OK
  3739. 676.12 s [vector] +++ OK, passed 100 tests.
  3740. 676.12 s [vector] snoc: OK
  3741. 676.12 s [vector] +++ OK, passed 100 tests.
  3742. 676.12 s [vector] append: OK
  3743. 676.12 s [vector] +++ OK, passed 100 tests.
  3744. 676.14 s [vector] concat: OK (0.02s)
  3745. 676.14 s [vector] +++ OK, passed 100 tests.
  3746. 676.14 s [vector] force: OK
  3747. 676.14 s [vector] +++ OK, passed 100 tests.
  3748. 676.14 s [vector] upd: OK
  3749. 676.14 s [vector] +++ OK, passed 100 tests.
  3750. 676.14 s [vector] accum: OK
  3751. 676.14 s [vector] +++ OK, passed 100 tests.
  3752. 676.15 s [vector] reverse: OK
  3753. 676.15 s [vector] +++ OK, passed 100 tests.
  3754. 676.15 s [vector] backpermute: OK
  3755. 676.15 s [vector] +++ OK, passed 100 tests.
  3756. 676.15 s [vector] map: OK
  3757. 676.15 s [vector] +++ OK, passed 100 tests.
  3758. 676.15 s [vector] imap: OK
  3759. 676.16 s [vector] +++ OK, passed 100 tests.
  3760. 676.17 s [vector] concatMap: OK
  3761. 676.17 s [vector] +++ OK, passed 100 tests.
  3762. 676.17 s [vector] mapM: OK
  3763. 676.17 s [vector] +++ OK, passed 100 tests.
  3764. 676.18 s [vector] mapM_: OK (0.02s)
  3765. 676.18 s [vector] +++ OK, passed 100 tests.
  3766. 676.18 s [vector] forM: OK
  3767. 676.18 s [vector] +++ OK, passed 100 tests.
  3768. 676.20 s [vector] forM_: OK (0.02s)
  3769. 676.20 s [vector] +++ OK, passed 100 tests.
  3770. 676.21 s [vector] imapM: OK
  3771. 676.21 s [vector] +++ OK, passed 100 tests.
  3772. 676.22 s [vector] imapM_: OK (0.02s)
  3773. 676.22 s [vector] +++ OK, passed 100 tests.
  3774. 676.22 s [vector] zipWith: OK
  3775. 676.23 s [vector] +++ OK, passed 100 tests.
  3776. 676.24 s [vector] zipWith3: OK
  3777. 676.24 s [vector] +++ OK, passed 100 tests.
  3778. 676.25 s [vector] izipWith: OK
  3779. 676.25 s [vector] +++ OK, passed 100 tests.
  3780. 676.25 s [vector] izipWith3: OK
  3781. 676.25 s [vector] +++ OK, passed 100 tests.
  3782. 676.25 s [vector] izipWithM: OK
  3783. 676.25 s [vector] +++ OK, passed 100 tests.
  3784. 676.25 s [vector] izipWithM_: OK (0.02s)
  3785. 676.25 s [vector] +++ OK, passed 100 tests.
  3786. 676.25 s [vector] zipWithM: OK
  3787. 676.25 s [vector] +++ OK, passed 100 tests.
  3788. 676.27 s [vector] zipWithM_: OK (0.01s)
  3789. 676.27 s [vector] +++ OK, passed 100 tests.
  3790. 676.27 s [vector] filter: OK
  3791. 676.27 s [vector] +++ OK, passed 100 tests.
  3792. 676.27 s [vector] ifilter: OK
  3793. 676.27 s [vector] +++ OK, passed 100 tests.
  3794. 676.30 s [vector] filterM: OK (0.02s)
  3795. 676.30 s [vector] +++ OK, passed 100 tests.
  3796. 676.30 s [vector] uniq: OK
  3797. 676.30 s [vector] +++ OK, passed 100 tests.
  3798. 676.30 s [vector] mapMaybe: OK
  3799. 676.30 s [vector] +++ OK, passed 100 tests.
  3800. 676.30 s [vector] imapMaybe: OK
  3801. 676.30 s [vector] +++ OK, passed 100 tests.
  3802. 676.30 s [vector] takeWhile: OK
  3803. 676.30 s [vector] +++ OK, passed 100 tests.
  3804. 676.30 s [vector] dropWhile: OK
  3805. 676.30 s [vector] +++ OK, passed 100 tests.
  3806. 676.31 s [vector] partition: OK
  3807. 676.31 s [vector] +++ OK, passed 100 tests.
  3808. 676.31 s [vector] partitionWith: OK
  3809. 676.31 s [vector] +++ OK, passed 100 tests.
  3810. 676.31 s [vector] span: OK
  3811. 676.31 s [vector] +++ OK, passed 100 tests.
  3812. 676.31 s [vector] break: OK
  3813. 676.31 s [vector] +++ OK, passed 100 tests.
  3814. 676.31 s [vector] spanR: OK
  3815. 676.31 s [vector] +++ OK, passed 100 tests.
  3816. 676.31 s [vector] breakR: OK
  3817. 676.31 s [vector] +++ OK, passed 100 tests.
  3818. 676.31 s [vector] groupBy: OK
  3819. 676.31 s [vector] +++ OK, passed 100 tests.
  3820. 676.32 s [vector] elem: OK
  3821. 676.32 s [vector] +++ OK, passed 100 tests.
  3822. 676.32 s [vector] notElem: OK
  3823. 676.32 s [vector] +++ OK, passed 100 tests.
  3824. 676.32 s [vector] find: OK
  3825. 676.32 s [vector] +++ OK, passed 100 tests.
  3826. 676.32 s [vector] findIndex: OK
  3827. 676.32 s [vector] +++ OK, passed 100 tests.
  3828. 676.32 s [vector] findIndexR: OK
  3829. 676.32 s [vector] +++ OK, passed 100 tests.
  3830. 676.32 s [vector] findIndices: OK
  3831. 676.32 s [vector] +++ OK, passed 100 tests.
  3832. 676.32 s [vector] elemIndex: OK
  3833. 676.32 s [vector] +++ OK, passed 100 tests.
  3834. 676.32 s [vector] elemIndices: OK
  3835. 676.32 s [vector] +++ OK, passed 100 tests.
  3836. 676.32 s [vector] foldl: OK
  3837. 676.32 s [vector] +++ OK, passed 100 tests.
  3838. 676.33 s [vector] foldl1: OK
  3839. 676.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3840. 676.33 s [vector] foldl': OK
  3841. 676.33 s [vector] +++ OK, passed 100 tests.
  3842. 676.33 s [vector] foldl1': OK
  3843. 676.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3844. 676.34 s [vector] foldr: OK
  3845. 676.34 s [vector] +++ OK, passed 100 tests.
  3846. 676.34 s [vector] foldr1: OK
  3847. 676.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3848. 676.34 s [vector] foldr': OK
  3849. 676.34 s [vector] +++ OK, passed 100 tests.
  3850. 676.34 s [vector] foldr1': OK
  3851. 676.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3852. 676.35 s [vector] ifoldl: OK
  3853. 676.35 s [vector] +++ OK, passed 100 tests.
  3854. 676.36 s [vector] ifoldl': OK
  3855. 676.36 s [vector] +++ OK, passed 100 tests.
  3856. 676.36 s [vector] ifoldr: OK
  3857. 676.36 s [vector] +++ OK, passed 100 tests.
  3858. 676.36 s [vector] ifoldr': OK
  3859. 676.36 s [vector] +++ OK, passed 100 tests.
  3860. 676.37 s [vector] ifoldM: OK
  3861. 676.37 s [vector] +++ OK, passed 100 tests.
  3862. 676.37 s [vector] ifoldM': OK
  3863. 676.37 s [vector] +++ OK, passed 100 tests.
  3864. 676.38 s [vector] ifoldM_: OK (0.02s)
  3865. 676.38 s [vector] +++ OK, passed 100 tests.
  3866. 676.40 s [vector] ifoldM'_: OK (0.02s)
  3867. 676.40 s [vector] +++ OK, passed 100 tests.
  3868. 676.40 s [vector] all: OK
  3869. 676.40 s [vector] +++ OK, passed 100 tests.
  3870. 676.40 s [vector] any: OK
  3871. 676.40 s [vector] +++ OK, passed 100 tests.
  3872. 676.40 s [vector] prescanl: OK
  3873. 676.40 s [vector] +++ OK, passed 100 tests.
  3874. 676.41 s [vector] prescanl': OK
  3875. 676.41 s [vector] +++ OK, passed 100 tests.
  3876. 676.42 s [vector] postscanl: OK
  3877. 676.42 s [vector] +++ OK, passed 100 tests.
  3878. 676.42 s [vector] postscanl': OK
  3879. 676.42 s [vector] +++ OK, passed 100 tests.
  3880. 676.42 s [vector] scanl: OK
  3881. 676.43 s [vector] +++ OK, passed 100 tests.
  3882. 676.43 s [vector] scanl': OK
  3883. 676.44 s [vector] +++ OK, passed 100 tests.
  3884. 676.44 s [vector] scanl1: OK
  3885. 676.44 s [vector] +++ OK, passed 100 tests.
  3886. 676.44 s [vector] scanl1': OK
  3887. 676.44 s [vector] +++ OK, passed 100 tests.
  3888. 676.44 s [vector] iscanl: OK
  3889. 676.44 s [vector] +++ OK, passed 100 tests.
  3890. 676.44 s [vector] iscanl': OK
  3891. 676.44 s [vector] +++ OK, passed 100 tests.
  3892. 676.44 s [vector] prescanr: OK
  3893. 676.44 s [vector] +++ OK, passed 100 tests.
  3894. 676.44 s [vector] prescanr': OK
  3895. 676.44 s [vector] +++ OK, passed 100 tests.
  3896. 676.44 s [vector] postscanr: OK
  3897. 676.44 s [vector] +++ OK, passed 100 tests.
  3898. 676.44 s [vector] postscanr': OK
  3899. 676.45 s [vector] +++ OK, passed 100 tests.
  3900. 676.45 s [vector] scanr: OK
  3901. 676.45 s [vector] +++ OK, passed 100 tests.
  3902. 676.45 s [vector] scanr': OK
  3903. 676.46 s [vector] +++ OK, passed 100 tests.
  3904. 676.46 s [vector] scanr1: OK
  3905. 676.46 s [vector] +++ OK, passed 100 tests.
  3906. 676.46 s [vector] scanr1': OK
  3907. 676.46 s [vector] +++ OK, passed 100 tests.
  3908. 676.46 s [vector] iscanr: OK
  3909. 676.47 s [vector] +++ OK, passed 100 tests.
  3910. 676.47 s [vector] iscanr': OK
  3911. 676.47 s [vector] +++ OK, passed 100 tests.
  3912. 676.47 s [vector] mut_read: OK
  3913. 676.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3914. 676.47 s [vector] mut_write: OK
  3915. 676.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3916. 676.47 s [vector] mut_modify: OK
  3917. 676.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3918. 676.47 s [vector] mut_generate: OK
  3919. 676.47 s [vector] +++ OK, passed 100 tests.
  3920. 676.49 s [vector] mut_generateM: OK (0.01s)
  3921. 676.49 s [vector] +++ OK, passed 100 tests.
  3922. 676.51 s [vector] mut_mapM_: OK (0.02s)
  3923. 676.51 s [vector] +++ OK, passed 100 tests.
  3924. 676.53 s [vector] mut_imapM_: OK (0.02s)
  3925. 676.53 s [vector] +++ OK, passed 100 tests.
  3926. 676.55 s [vector] mut_forM_: OK (0.02s)
  3927. 676.55 s [vector] +++ OK, passed 100 tests.
  3928. 676.56 s [vector] mut_iforM_: OK (0.02s)
  3929. 676.56 s [vector] +++ OK, passed 100 tests.
  3930. 676.56 s [vector] mut_foldr: OK
  3931. 676.56 s [vector] +++ OK, passed 100 tests.
  3932. 676.57 s [vector] mut_foldr': OK
  3933. 676.57 s [vector] +++ OK, passed 100 tests.
  3934. 676.57 s [vector] mut_foldl: OK
  3935. 676.57 s [vector] +++ OK, passed 100 tests.
  3936. 676.58 s [vector] mut_foldl': OK
  3937. 676.58 s [vector] +++ OK, passed 100 tests.
  3938. 676.59 s [vector] mut_ifoldr: OK
  3939. 676.59 s [vector] +++ OK, passed 100 tests.
  3940. 676.59 s [vector] mut_ifoldr': OK
  3941. 676.59 s [vector] +++ OK, passed 100 tests.
  3942. 676.60 s [vector] mut_ifoldl: OK
  3943. 676.60 s [vector] +++ OK, passed 100 tests.
  3944. 676.60 s [vector] mut_ifoldl': OK
  3945. 676.60 s [vector] +++ OK, passed 100 tests.
  3946. 676.61 s [vector] mut_foldM: OK
  3947. 676.61 s [vector] +++ OK, passed 100 tests.
  3948. 676.62 s [vector] mut_foldM': OK
  3949. 676.62 s [vector] +++ OK, passed 100 tests.
  3950. 676.62 s [vector] mut_foldrM: OK
  3951. 676.62 s [vector] +++ OK, passed 100 tests.
  3952. 676.62 s [vector] mut_foldrM': OK
  3953. 676.62 s [vector] +++ OK, passed 100 tests.
  3954. 676.62 s [vector] mut_ifoldM: OK
  3955. 676.62 s [vector] +++ OK, passed 100 tests.
  3956. 676.62 s [vector] mut_ifoldM': OK
  3957. 676.62 s [vector] +++ OK, passed 100 tests.
  3958. 676.62 s [vector] mut_ifoldrM: OK
  3959. 676.62 s [vector] +++ OK, passed 100 tests.
  3960. 676.62 s [vector] mut_ifoldrM': OK
  3961. 676.62 s [vector] +++ OK, passed 100 tests.
  3962. 676.62 s [vector] compare: OK
  3963. 676.62 s [vector] +++ OK, passed 100 tests.
  3964. 676.62 s [vector] maximum: OK
  3965. 676.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3966. 676.62 s [vector] minimum: OK
  3967. 676.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3968. 676.63 s [vector] minIndex: OK
  3969. 676.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3970. 676.63 s [vector] maxIndex: OK
  3971. 676.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3972. 676.63 s [vector] maximumBy: OK
  3973. 676.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3974. 676.63 s [vector] minimumBy: OK
  3975. 676.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3976. 676.63 s [vector] maximumOn: OK
  3977. 676.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3978. 676.63 s [vector] minimumOn: OK
  3979. 676.63 s [vector] +++ OK, passed 100 tests; 25 discarded.
  3980. 676.63 s [vector] maxIndexBy: OK
  3981. 676.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3982. 676.63 s [vector] minIndexBy: OK
  3983. 676.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3984. 676.63 s [vector] ListFirstMaxIndexWins: OK
  3985. 676.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3986. 676.63 s [vector] FalseListFirstMaxIndexWins: OK
  3987. 676.63 s [vector] +++ OK, failed as expected. (after 1 test):
  3988. 676.63 s [vector] Exception:
  3989. 676.63 s [vector] Prelude.foldr1: empty list
  3990. 676.63 s [vector] CallStack (from HasCallStack):
  3991. 676.63 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3992. 676.63 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3993. 676.63 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3994. 676.63 s [vector] []
  3995. 676.63 s [vector] mempty: OK
  3996. 676.63 s [vector] +++ OK, passed 100 tests.
  3997. 676.64 s [vector] mappend: OK
  3998. 676.65 s [vector] +++ OK, passed 100 tests.
  3999. 676.66 s [vector] mconcat: OK (0.02s)
  4000. 676.66 s [vector] +++ OK, passed 100 tests.
  4001. 676.66 s [vector] glength: OK
  4002. 676.66 s [vector] +++ OK, passed 100 tests.
  4003. 676.66 s [vector] sum: OK
  4004. 676.66 s [vector] +++ OK, passed 100 tests.
  4005. 676.66 s [vector] product: OK
  4006. 676.66 s [vector] +++ OK, passed 100 tests.
  4007. 676.67 s [vector] enumFromN: OK
  4008. 676.67 s [vector] +++ OK, passed 100 tests.
  4009. 676.67 s [vector] enumFromThenN: OK
  4010. 676.67 s [vector] +++ OK, passed 100 tests.
  4011. 676.67 s [vector] enumFromTo: OK
  4012. 676.67 s [vector] +++ OK, passed 100 tests.
  4013. 676.67 s [vector] enumFromThenTo: OK
  4014. 676.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4015. 676.67 s [vector] Double
  4016. 676.67 s [vector] fromList.toList == id: OK
  4017. 676.67 s [vector] +++ OK, passed 100 tests.
  4018. 676.67 s [vector] toList.fromList == id: OK
  4019. 676.67 s [vector] +++ OK, passed 100 tests.
  4020. 676.67 s [vector] unstream.stream == id: OK
  4021. 676.67 s [vector] +++ OK, passed 100 tests.
  4022. 676.67 s [vector] stream.unstream == id: OK
  4023. 676.67 s [vector] +++ OK, passed 100 tests.
  4024. 676.67 s [vector] eq: OK
  4025. 676.67 s [vector] +++ OK, passed 100 tests.
  4026. 676.67 s [vector] length: OK
  4027. 676.67 s [vector] +++ OK, passed 100 tests.
  4028. 676.67 s [vector] null: OK
  4029. 676.67 s [vector] +++ OK, passed 100 tests.
  4030. 676.67 s [vector] index: OK
  4031. 676.67 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4032. 676.68 s [vector] safeIndex: OK
  4033. 676.68 s [vector] +++ OK, passed 100 tests.
  4034. 676.68 s [vector] head: OK
  4035. 676.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4036. 676.68 s [vector] last: OK
  4037. 676.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4038. 676.68 s [vector] unsafeIndex: OK
  4039. 676.68 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4040. 676.68 s [vector] unsafeHead: OK
  4041. 676.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4042. 676.68 s [vector] unsafeLast: OK
  4043. 676.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4044. 676.69 s [vector] slice: OK
  4045. 676.69 s [vector] +++ OK, passed 100 tests.
  4046. 676.69 s [vector] init: OK
  4047. 676.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4048. 676.69 s [vector] tail: OK
  4049. 676.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4050. 676.69 s [vector] take: OK
  4051. 676.69 s [vector] +++ OK, passed 100 tests.
  4052. 676.69 s [vector] drop: OK
  4053. 676.69 s [vector] +++ OK, passed 100 tests.
  4054. 676.69 s [vector] splitAt: OK
  4055. 676.69 s [vector] +++ OK, passed 100 tests.
  4056. 676.69 s [vector] empty: OK
  4057. 676.69 s [vector] +++ OK, passed 100 tests.
  4058. 676.69 s [vector] singleton: OK
  4059. 676.70 s [vector] +++ OK, passed 100 tests.
  4060. 676.70 s [vector] replicate: OK
  4061. 676.70 s [vector] +++ OK, passed 100 tests.
  4062. 676.70 s [vector] generate: OK
  4063. 676.70 s [vector] +++ OK, passed 100 tests.
  4064. 676.73 s [vector] iterateN: OK
  4065. 676.74 s [vector] +++ OK, passed 100 tests.
  4066. 676.82 s [vector] iterateNM: OK (0.12s)
  4067. 676.82 s [vector] +++ OK, passed 100 tests.
  4068. 676.84 s [vector] generateM: OK (0.02s)
  4069. 676.84 s [vector] +++ OK, passed 100 tests.
  4070. 676.86 s [vector] replicateM: OK (0.01s)
  4071. 676.86 s [vector] +++ OK, passed 100 tests.
  4072. 676.86 s [vector] create: OK
  4073. 676.86 s [vector] +++ OK, passed 100 tests.
  4074. 676.86 s [vector] createT: OK
  4075. 676.86 s [vector] +++ OK, passed 100 tests.
  4076. 676.86 s [vector] unfoldr: OK
  4077. 676.86 s [vector] +++ OK, passed 100 tests.
  4078. 676.86 s [vector] unfoldrN: OK
  4079. 676.86 s [vector] +++ OK, passed 100 tests.
  4080. 676.86 s [vector] unfoldrExactN: OK
  4081. 676.87 s [vector] +++ OK, passed 100 tests.
  4082. 676.87 s [vector] unfoldrM: OK
  4083. 676.87 s [vector] +++ OK, passed 100 tests.
  4084. 676.89 s [vector] unfoldrNM: OK (0.02s)
  4085. 676.89 s [vector] +++ OK, passed 100 tests.
  4086. 676.92 s [vector] unfoldrExactNM: OK (0.03s)
  4087. 676.92 s [vector] +++ OK, passed 100 tests.
  4088. 676.93 s [vector] constructN: OK (0.01s)
  4089. 676.93 s [vector] +++ OK, passed 100 tests.
  4090. 676.94 s [vector] constructrN: OK (0.02s)
  4091. 676.94 s [vector] +++ OK, passed 100 tests.
  4092. 676.94 s [vector] cons: OK
  4093. 676.94 s [vector] +++ OK, passed 100 tests.
  4094. 676.94 s [vector] snoc: OK
  4095. 676.96 s [vector] +++ OK, passed 100 tests.
  4096. 676.97 s [vector] append: OK
  4097. 676.97 s [vector] +++ OK, passed 100 tests.
  4098. 676.97 s [vector] concat: OK (0.03s)
  4099. 676.97 s [vector] +++ OK, passed 100 tests.
  4100. 676.97 s [vector] force: OK
  4101. 676.97 s [vector] +++ OK, passed 100 tests.
  4102. 676.98 s [vector] upd: OK
  4103. 676.99 s [vector] +++ OK, passed 100 tests.
  4104. 676.99 s [vector] accum: OK (0.02s)
  4105. 676.99 s [vector] +++ OK, passed 100 tests.
  4106. 677.00 s [vector] reverse: OK
  4107. 677.00 s [vector] +++ OK, passed 100 tests.
  4108. 677.01 s [vector] backpermute: OK
  4109. 677.01 s [vector] +++ OK, passed 100 tests.
  4110. 677.01 s [vector] map: OK
  4111. 677.02 s [vector] +++ OK, passed 100 tests.
  4112. 677.03 s [vector] imap: OK
  4113. 677.03 s [vector] +++ OK, passed 100 tests.
  4114. 677.05 s [vector] concatMap: OK
  4115. 677.05 s [vector] +++ OK, passed 100 tests.
  4116. 677.05 s [vector] mapM: OK
  4117. 677.05 s [vector] +++ OK, passed 100 tests.
  4118. 677.06 s [vector] mapM_: OK (0.03s)
  4119. 677.08 s [vector] +++ OK, passed 100 tests.
  4120. 677.08 s [vector] forM: OK (0.02s)
  4121. 677.08 s [vector] +++ OK, passed 100 tests.
  4122. 677.13 s [vector] forM_: OK (0.04s)
  4123. 677.13 s [vector] +++ OK, passed 100 tests.
  4124. 677.15 s [vector] imapM: OK (0.01s)
  4125. 677.15 s [vector] +++ OK, passed 100 tests.
  4126. 677.18 s [vector] imapM_: OK (0.04s)
  4127. 677.18 s [vector] +++ OK, passed 100 tests.
  4128. 677.19 s [vector] zipWith: OK (0.01s)
  4129. 677.19 s [vector] +++ OK, passed 100 tests.
  4130. 677.20 s [vector] zipWith3: OK (0.01s)
  4131. 677.21 s [vector] +++ OK, passed 100 tests.
  4132. 677.22 s [vector] izipWith: OK (0.01s)
  4133. 677.22 s [vector] +++ OK, passed 100 tests.
  4134. 677.23 s [vector] izipWith3: OK (0.01s)
  4135. 677.23 s [vector] +++ OK, passed 100 tests.
  4136. 677.25 s [vector] izipWithM: OK (0.01s)
  4137. 677.25 s [vector] +++ OK, passed 100 tests.
  4138. 677.27 s [vector] izipWithM_: OK (0.04s)
  4139. 677.27 s [vector] +++ OK, passed 100 tests.
  4140. 677.31 s [vector] zipWithM: OK
  4141. 677.31 s [vector] +++ OK, passed 100 tests.
  4142. 677.33 s [vector] zipWithM_: OK (0.03s)
  4143. 677.33 s [vector] +++ OK, passed 100 tests.
  4144. 677.33 s [vector] filter: OK
  4145. 677.35 s [vector] +++ OK, passed 100 tests.
  4146. 677.35 s [vector] ifilter: OK
  4147. 677.35 s [vector] +++ OK, passed 100 tests.
  4148. 677.39 s [vector] filterM: OK (0.06s)
  4149. 677.39 s [vector] +++ OK, passed 100 tests.
  4150. 677.39 s [vector] uniq: OK
  4151. 677.39 s [vector] +++ OK, passed 100 tests.
  4152. 677.40 s [vector] mapMaybe: OK
  4153. 677.40 s [vector] +++ OK, passed 100 tests.
  4154. 677.41 s [vector] imapMaybe: OK
  4155. 677.41 s [vector] +++ OK, passed 100 tests.
  4156. 677.41 s [vector] takeWhile: OK
  4157. 677.42 s [vector] +++ OK, passed 100 tests.
  4158. 677.43 s [vector] dropWhile: OK
  4159. 677.43 s [vector] +++ OK, passed 100 tests.
  4160. 677.43 s [vector] partition: OK
  4161. 677.43 s [vector] +++ OK, passed 100 tests.
  4162. 677.44 s [vector] partitionWith: OK
  4163. 677.44 s [vector] +++ OK, passed 100 tests.
  4164. 677.44 s [vector] span: OK
  4165. 677.44 s [vector] +++ OK, passed 100 tests.
  4166. 677.44 s [vector] break: OK
  4167. 677.44 s [vector] +++ OK, passed 100 tests.
  4168. 677.44 s [vector] spanR: OK
  4169. 677.44 s [vector] +++ OK, passed 100 tests.
  4170. 677.45 s [vector] breakR: OK
  4171. 677.45 s [vector] +++ OK, passed 100 tests.
  4172. 677.45 s [vector] groupBy: OK (0.01s)
  4173. 677.46 s [vector] +++ OK, passed 100 tests.
  4174. 677.46 s [vector] elem: OK
  4175. 677.46 s [vector] +++ OK, passed 100 tests.
  4176. 677.46 s [vector] notElem: OK
  4177. 677.46 s [vector] +++ OK, passed 100 tests.
  4178. 677.46 s [vector] find: OK
  4179. 677.46 s [vector] +++ OK, passed 100 tests.
  4180. 677.46 s [vector] findIndex: OK
  4181. 677.46 s [vector] +++ OK, passed 100 tests.
  4182. 677.46 s [vector] findIndexR: OK
  4183. 677.46 s [vector] +++ OK, passed 100 tests.
  4184. 677.47 s [vector] findIndices: OK
  4185. 677.47 s [vector] +++ OK, passed 100 tests.
  4186. 677.47 s [vector] elemIndex: OK
  4187. 677.47 s [vector] +++ OK, passed 100 tests.
  4188. 677.48 s [vector] elemIndices: OK
  4189. 677.48 s [vector] +++ OK, passed 100 tests.
  4190. 677.51 s [vector] foldl: OK (0.02s)
  4191. 677.51 s [vector] +++ OK, passed 100 tests.
  4192. 677.53 s [vector] foldl1: OK (0.02s)
  4193. 677.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4194. 677.55 s [vector] foldl': OK (0.02s)
  4195. 677.55 s [vector] +++ OK, passed 100 tests.
  4196. 677.59 s [vector] foldl1': OK (0.03s)
  4197. 677.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4198. 677.61 s [vector] foldr: OK (0.03s)
  4199. 677.61 s [vector] +++ OK, passed 100 tests.
  4200. 677.62 s [vector] foldr1: OK (0.02s)
  4201. 677.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4202. 677.64 s [vector] foldr': OK (0.02s)
  4203. 677.65 s [vector] +++ OK, passed 100 tests.
  4204. 677.68 s [vector] foldr1': OK (0.03s)
  4205. 677.68 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4206. 677.71 s [vector] ifoldl: OK (0.03s)
  4207. 677.71 s [vector] +++ OK, passed 100 tests.
  4208. 677.72 s [vector] ifoldl': OK (0.03s)
  4209. 677.73 s [vector] +++ OK, passed 100 tests.
  4210. 677.77 s [vector] ifoldr: OK (0.03s)
  4211. 677.77 s [vector] +++ OK, passed 100 tests.
  4212. 677.79 s [vector] ifoldr': OK (0.03s)
  4213. 677.79 s [vector] +++ OK, passed 100 tests.
  4214. 677.82 s [vector] ifoldM: OK
  4215. 677.83 s [vector] +++ OK, passed 100 tests.
  4216. 677.84 s [vector] ifoldM': OK (0.03s)
  4217. 677.85 s [vector] +++ OK, passed 100 tests.
  4218. 677.90 s [vector] ifoldM_: OK (0.06s)
  4219. 677.90 s [vector] +++ OK, passed 100 tests.
  4220. 677.97 s [vector] ifoldM'_: OK (0.07s)
  4221. 677.97 s [vector] +++ OK, passed 100 tests.
  4222. 677.97 s [vector] all: OK
  4223. 677.97 s [vector] +++ OK, passed 100 tests.
  4224. 677.97 s [vector] any: OK
  4225. 678.00 s [vector] +++ OK, passed 100 tests.
  4226. 678.00 s [vector] prescanl: OK (0.02s)
  4227. 678.00 s [vector] +++ OK, passed 100 tests.
  4228. 678.01 s [vector] prescanl': OK (0.02s)
  4229. 678.01 s [vector] +++ OK, passed 100 tests.
  4230. 678.03 s [vector] postscanl: OK (0.02s)
  4231. 678.03 s [vector] +++ OK, passed 100 tests.
  4232. 678.05 s [vector] postscanl': OK (0.02s)
  4233. 678.05 s [vector] +++ OK, passed 100 tests.
  4234. 678.07 s [vector] scanl: OK (0.02s)
  4235. 678.07 s [vector] +++ OK, passed 100 tests.
  4236. 678.08 s [vector] scanl': OK (0.02s)
  4237. 678.09 s [vector] +++ OK, passed 100 tests.
  4238. 678.11 s [vector] scanl1: OK (0.02s)
  4239. 678.11 s [vector] +++ OK, passed 100 tests.
  4240. 678.12 s [vector] scanl1': OK (0.02s)
  4241. 678.13 s [vector] +++ OK, passed 100 tests.
  4242. 678.13 s [vector] iscanl: OK (0.02s)
  4243. 678.14 s [vector] +++ OK, passed 100 tests.
  4244. 678.14 s [vector] iscanl': OK (0.02s)
  4245. 678.14 s [vector] +++ OK, passed 100 tests.
  4246. 678.17 s [vector] prescanr: OK (0.02s)
  4247. 678.17 s [vector] +++ OK, passed 100 tests.
  4248. 678.18 s [vector] prescanr': OK (0.02s)
  4249. 678.19 s [vector] +++ OK, passed 100 tests.
  4250. 678.20 s [vector] postscanr: OK (0.02s)
  4251. 678.20 s [vector] +++ OK, passed 100 tests.
  4252. 678.20 s [vector] postscanr': OK (0.01s)
  4253. 678.20 s [vector] +++ OK, passed 100 tests.
  4254. 678.23 s [vector] scanr: OK (0.02s)
  4255. 678.23 s [vector] +++ OK, passed 100 tests.
  4256. 678.25 s [vector] scanr': OK (0.02s)
  4257. 678.25 s [vector] +++ OK, passed 100 tests.
  4258. 678.27 s [vector] scanr1: OK (0.01s)
  4259. 678.27 s [vector] +++ OK, passed 100 tests.
  4260. 678.29 s [vector] scanr1': OK (0.02s)
  4261. 678.29 s [vector] +++ OK, passed 100 tests.
  4262. 678.31 s [vector] iscanr: OK (0.02s)
  4263. 678.51 s [vector] +++ OK, passed 100 tests.
  4264. 678.51 s [vector] iscanr': OK (0.02s)
  4265. 678.51 s [vector] +++ OK, passed 100 tests.
  4266. 678.51 s [vector] mut_read: OK
  4267. 678.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4268. 678.51 s [vector] mut_write: OK
  4269. 678.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4270. 678.51 s [vector] mut_modify: OK
  4271. 678.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4272. 678.51 s [vector] mut_generate: OK
  4273. 678.51 s [vector] +++ OK, passed 100 tests.
  4274. 678.51 s [vector] mut_generateM: OK (0.02s)
  4275. 678.51 s [vector] +++ OK, passed 100 tests.
  4276. 678.51 s [vector] mut_mapM_: OK (0.03s)
  4277. 678.51 s [vector] +++ OK, passed 100 tests.
  4278. 678.51 s [vector] mut_imapM_: OK (0.04s)
  4279. 678.51 s [vector] +++ OK, passed 100 tests.
  4280. 678.51 s [vector] mut_forM_: OK (0.04s)
  4281. 678.51 s [vector] +++ OK, passed 100 tests.
  4282. 678.51 s [vector] mut_iforM_: OK (0.04s)
  4283. 678.51 s [vector] +++ OK, passed 100 tests.
  4284. 678.51 s [vector] mut_foldr: OK (0.01s)
  4285. 678.51 s [vector] +++ OK, passed 100 tests.
  4286. 678.52 s [vector] mut_foldr': OK (0.02s)
  4287. 678.53 s [vector] +++ OK, passed 100 tests.
  4288. 678.54 s [vector] mut_foldl: OK (0.02s)
  4289. 678.55 s [vector] +++ OK, passed 100 tests.
  4290. 678.55 s [vector] mut_foldl': OK (0.02s)
  4291. 678.55 s [vector] +++ OK, passed 100 tests.
  4292. 678.56 s [vector] mut_ifoldr: OK
  4293. 678.58 s [vector] +++ OK, passed 100 tests.
  4294. 678.58 s [vector] mut_ifoldr': OK (0.02s)
  4295. 678.58 s [vector] +++ OK, passed 100 tests.
  4296. 678.61 s [vector] mut_ifoldl: OK (0.02s)
  4297. 678.61 s [vector] +++ OK, passed 100 tests.
  4298. 678.62 s [vector] mut_ifoldl': OK (0.02s)
  4299. 678.63 s [vector] +++ OK, passed 100 tests.
  4300. 678.65 s [vector] mut_foldM: OK (0.02s)
  4301. 678.65 s [vector] +++ OK, passed 100 tests.
  4302. 678.67 s [vector] mut_foldM': OK (0.02s)
  4303. 678.67 s [vector] +++ OK, passed 100 tests.
  4304. 678.68 s [vector] mut_foldrM: OK (0.02s)
  4305. 678.68 s [vector] +++ OK, passed 100 tests.
  4306. 678.69 s [vector] mut_foldrM': OK (0.02s)
  4307. 678.69 s [vector] +++ OK, passed 100 tests.
  4308. 678.71 s [vector] mut_ifoldM: OK (0.02s)
  4309. 678.71 s [vector] +++ OK, passed 100 tests.
  4310. 678.72 s [vector] mut_ifoldM': OK (0.02s)
  4311. 678.73 s [vector] +++ OK, passed 100 tests.
  4312. 678.74 s [vector] mut_ifoldrM: OK (0.02s)
  4313. 678.74 s [vector] +++ OK, passed 100 tests.
  4314. 678.75 s [vector] mut_ifoldrM': OK
  4315. 678.75 s [vector] +++ OK, passed 100 tests.
  4316. 678.75 s [vector] compare: OK
  4317. 678.76 s [vector] +++ OK, passed 100 tests.
  4318. 678.76 s [vector] maximum: OK
  4319. 678.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4320. 678.76 s [vector] minimum: OK
  4321. 678.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4322. 678.76 s [vector] minIndex: OK
  4323. 678.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4324. 678.76 s [vector] maxIndex: OK
  4325. 678.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4326. 678.76 s [vector] maximumBy: OK
  4327. 678.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4328. 678.76 s [vector] minimumBy: OK
  4329. 678.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4330. 678.76 s [vector] maximumOn: OK
  4331. 678.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4332. 678.76 s [vector] minimumOn: OK
  4333. 678.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4334. 678.77 s [vector] maxIndexBy: OK
  4335. 678.77 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4336. 678.77 s [vector] minIndexBy: OK
  4337. 678.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4338. 678.77 s [vector] ListFirstMaxIndexWins: OK
  4339. 678.77 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4340. 678.77 s [vector] FalseListFirstMaxIndexWins: OK
  4341. 678.77 s [vector] +++ OK, failed as expected. (after 1 test):
  4342. 678.77 s [vector] Exception:
  4343. 678.77 s [vector] Prelude.foldr1: empty list
  4344. 678.77 s [vector] CallStack (from HasCallStack):
  4345. 678.77 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4346. 678.77 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4347. 678.77 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4348. 678.77 s [vector] []
  4349. 678.77 s [vector] mempty: OK
  4350. 678.77 s [vector] +++ OK, passed 100 tests.
  4351. 678.77 s [vector] mappend: OK
  4352. 678.77 s [vector] +++ OK, passed 100 tests.
  4353. 678.80 s [vector] mconcat: OK
  4354. 678.80 s [vector] +++ OK, passed 100 tests.
  4355. 678.80 s [vector] glength: OK
  4356. 678.80 s [vector] +++ OK, passed 100 tests.
  4357. 678.80 s [vector] sum: OK
  4358. 678.80 s [vector] +++ OK, passed 100 tests.
  4359. 678.80 s [vector] product: OK
  4360. 678.80 s [vector] +++ OK, passed 100 tests.
  4361. 678.80 s [vector] enumFromN: OK
  4362. 678.80 s [vector] +++ OK, passed 100 tests.
  4363. 678.80 s [vector] enumFromThenN: OK
  4364. 678.80 s [vector] +++ OK, passed 100 tests.
  4365. 678.80 s [vector] enumFromTo: OK
  4366. 678.80 s [vector] +++ OK, passed 100 tests.
  4367. 678.81 s [vector] enumFromThenTo: OK
  4368. 678.81 s [vector] +++ OK, passed 100 tests; 1 discarded.
  4369. 678.81 s [vector] unstream
  4370. 678.81 s [vector] unstream == vunstream (exact): OK
  4371. 678.81 s [vector] +++ OK, passed 100 tests.
  4372. 678.81 s [vector] unstream == vunstream (unknown): OK
  4373. 678.81 s [vector] +++ OK, passed 100 tests.
  4374. 678.81 s [vector] unstreamR ~= vunstream (exact): OK
  4375. 678.81 s [vector] +++ OK, passed 100 tests.
  4376. 678.81 s [vector] unstreamR ~= vunstream (unknown): OK
  4377. 678.81 s [vector] +++ OK, passed 100 tests.
  4378. 678.81 s [vector] Tests.Vector.Storable
  4379. 678.81 s [vector] Data.Vector.Storable.Vector (Int)
  4380. 678.81 s [vector] fromList.toList == id: OK
  4381. 678.81 s [vector] +++ OK, passed 100 tests.
  4382. 678.81 s [vector] toList.fromList == id: OK
  4383. 678.81 s [vector] +++ OK, passed 100 tests.
  4384. 678.81 s [vector] unstream.stream == id: OK
  4385. 678.81 s [vector] +++ OK, passed 100 tests.
  4386. 678.81 s [vector] stream.unstream == id: OK
  4387. 678.81 s [vector] +++ OK, passed 100 tests.
  4388. 678.81 s [vector] eq: OK
  4389. 678.81 s [vector] +++ OK, passed 100 tests.
  4390. 678.81 s [vector] length: OK
  4391. 678.81 s [vector] +++ OK, passed 100 tests.
  4392. 678.81 s [vector] null: OK
  4393. 678.81 s [vector] +++ OK, passed 100 tests.
  4394. 678.81 s [vector] index: OK
  4395. 678.81 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4396. 678.82 s [vector] safeIndex: OK
  4397. 678.82 s [vector] +++ OK, passed 100 tests.
  4398. 678.82 s [vector] head: OK
  4399. 678.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4400. 678.82 s [vector] last: OK
  4401. 678.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4402. 678.82 s [vector] unsafeIndex: OK
  4403. 678.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4404. 678.82 s [vector] unsafeHead: OK
  4405. 678.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4406. 678.82 s [vector] unsafeLast: OK
  4407. 678.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4408. 678.82 s [vector] slice: OK
  4409. 678.82 s [vector] +++ OK, passed 100 tests.
  4410. 678.82 s [vector] init: OK
  4411. 678.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4412. 678.82 s [vector] tail: OK
  4413. 678.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4414. 678.82 s [vector] take: OK
  4415. 678.82 s [vector] +++ OK, passed 100 tests.
  4416. 678.82 s [vector] drop: OK
  4417. 678.82 s [vector] +++ OK, passed 100 tests.
  4418. 678.82 s [vector] splitAt: OK
  4419. 678.82 s [vector] +++ OK, passed 100 tests.
  4420. 678.82 s [vector] empty: OK
  4421. 678.82 s [vector] +++ OK, passed 100 tests.
  4422. 678.82 s [vector] singleton: OK
  4423. 678.82 s [vector] +++ OK, passed 100 tests.
  4424. 678.82 s [vector] replicate: OK
  4425. 678.82 s [vector] +++ OK, passed 100 tests.
  4426. 678.82 s [vector] generate: OK
  4427. 678.82 s [vector] +++ OK, passed 100 tests.
  4428. 678.84 s [vector] iterateN: OK
  4429. 678.85 s [vector] +++ OK, passed 100 tests.
  4430. 678.88 s [vector] iterateNM: OK (0.04s)
  4431. 678.88 s [vector] +++ OK, passed 100 tests.
  4432. 678.89 s [vector] generateM: OK (0.02s)
  4433. 678.89 s [vector] +++ OK, passed 100 tests.
  4434. 678.90 s [vector] replicateM: OK
  4435. 678.90 s [vector] +++ OK, passed 100 tests.
  4436. 678.90 s [vector] create: OK
  4437. 678.90 s [vector] +++ OK, passed 100 tests.
  4438. 678.90 s [vector] createT: OK
  4439. 678.90 s [vector] +++ OK, passed 100 tests.
  4440. 678.90 s [vector] unfoldr: OK
  4441. 678.90 s [vector] +++ OK, passed 100 tests.
  4442. 678.90 s [vector] unfoldrN: OK
  4443. 678.90 s [vector] +++ OK, passed 100 tests.
  4444. 678.91 s [vector] unfoldrExactN: OK
  4445. 678.92 s [vector] +++ OK, passed 100 tests.
  4446. 678.93 s [vector] unfoldrM: OK
  4447. 678.93 s [vector] +++ OK, passed 100 tests.
  4448. 678.93 s [vector] unfoldrNM: OK
  4449. 678.93 s [vector] +++ OK, passed 100 tests.
  4450. 678.96 s [vector] unfoldrExactNM: OK (0.04s)
  4451. 678.96 s [vector] +++ OK, passed 100 tests.
  4452. 678.97 s [vector] constructN: OK
  4453. 678.97 s [vector] +++ OK, passed 100 tests.
  4454. 678.97 s [vector] constructrN: OK
  4455. 678.97 s [vector] +++ OK, passed 100 tests.
  4456. 678.97 s [vector] cons: OK
  4457. 678.97 s [vector] +++ OK, passed 100 tests.
  4458. 678.97 s [vector] snoc: OK
  4459. 678.97 s [vector] +++ OK, passed 100 tests.
  4460. 678.99 s [vector] append: OK
  4461. 678.99 s [vector] +++ OK, passed 100 tests.
  4462. 679.00 s [vector] concat: OK (0.02s)
  4463. 679.00 s [vector] +++ OK, passed 100 tests.
  4464. 679.00 s [vector] force: OK
  4465. 679.00 s [vector] +++ OK, passed 100 tests.
  4466. 679.00 s [vector] upd: OK
  4467. 679.01 s [vector] +++ OK, passed 100 tests.
  4468. 679.01 s [vector] accum: OK
  4469. 679.01 s [vector] +++ OK, passed 100 tests.
  4470. 679.01 s [vector] reverse: OK
  4471. 679.02 s [vector] +++ OK, passed 100 tests.
  4472. 679.02 s [vector] backpermute: OK
  4473. 679.02 s [vector] +++ OK, passed 100 tests.
  4474. 679.02 s [vector] map: OK
  4475. 679.02 s [vector] +++ OK, passed 100 tests.
  4476. 679.02 s [vector] imap: OK
  4477. 679.02 s [vector] +++ OK, passed 100 tests.
  4478. 679.03 s [vector] concatMap: OK
  4479. 679.03 s [vector] +++ OK, passed 100 tests.
  4480. 679.04 s [vector] mapM: OK
  4481. 679.05 s [vector] +++ OK, passed 100 tests.
  4482. 679.06 s [vector] mapM_: OK (0.03s)
  4483. 679.06 s [vector] +++ OK, passed 100 tests.
  4484. 679.06 s [vector] forM: OK
  4485. 679.06 s [vector] +++ OK, passed 100 tests.
  4486. 679.09 s [vector] forM_: OK (0.03s)
  4487. 679.10 s [vector] +++ OK, passed 100 tests.
  4488. 679.11 s [vector] imapM: OK
  4489. 679.11 s [vector] +++ OK, passed 100 tests.
  4490. 679.12 s [vector] imapM_: OK (0.02s)
  4491. 679.12 s [vector] +++ OK, passed 100 tests.
  4492. 679.12 s [vector] zipWith: OK
  4493. 679.12 s [vector] +++ OK, passed 100 tests.
  4494. 679.12 s [vector] zipWith3: OK
  4495. 679.12 s [vector] +++ OK, passed 100 tests.
  4496. 679.12 s [vector] izipWith: OK
  4497. 679.12 s [vector] +++ OK, passed 100 tests.
  4498. 679.13 s [vector] izipWith3: OK
  4499. 679.13 s [vector] +++ OK, passed 100 tests.
  4500. 679.14 s [vector] izipWithM: OK
  4501. 679.14 s [vector] +++ OK, passed 100 tests.
  4502. 679.16 s [vector] izipWithM_: OK (0.02s)
  4503. 679.16 s [vector] +++ OK, passed 100 tests.
  4504. 679.17 s [vector] zipWithM: OK
  4505. 679.17 s [vector] +++ OK, passed 100 tests.
  4506. 679.18 s [vector] zipWithM_: OK (0.01s)
  4507. 679.18 s [vector] +++ OK, passed 100 tests.
  4508. 679.18 s [vector] filter: OK
  4509. 679.18 s [vector] +++ OK, passed 100 tests.
  4510. 679.18 s [vector] ifilter: OK
  4511. 679.18 s [vector] +++ OK, passed 100 tests.
  4512. 679.21 s [vector] filterM: OK (0.03s)
  4513. 679.21 s [vector] +++ OK, passed 100 tests.
  4514. 679.21 s [vector] uniq: OK
  4515. 679.21 s [vector] +++ OK, passed 100 tests.
  4516. 679.21 s [vector] mapMaybe: OK
  4517. 679.21 s [vector] +++ OK, passed 100 tests.
  4518. 679.22 s [vector] imapMaybe: OK
  4519. 679.22 s [vector] +++ OK, passed 100 tests.
  4520. 679.22 s [vector] takeWhile: OK
  4521. 679.22 s [vector] +++ OK, passed 100 tests.
  4522. 679.22 s [vector] dropWhile: OK
  4523. 679.22 s [vector] +++ OK, passed 100 tests.
  4524. 679.22 s [vector] partition: OK
  4525. 679.22 s [vector] +++ OK, passed 100 tests.
  4526. 679.22 s [vector] partitionWith: OK
  4527. 679.22 s [vector] +++ OK, passed 100 tests.
  4528. 679.22 s [vector] span: OK
  4529. 679.22 s [vector] +++ OK, passed 100 tests.
  4530. 679.22 s [vector] break: OK
  4531. 679.22 s [vector] +++ OK, passed 100 tests.
  4532. 679.22 s [vector] spanR: OK
  4533. 679.22 s [vector] +++ OK, passed 100 tests.
  4534. 679.22 s [vector] breakR: OK
  4535. 679.22 s [vector] +++ OK, passed 100 tests.
  4536. 679.22 s [vector] groupBy: OK
  4537. 679.22 s [vector] +++ OK, passed 100 tests.
  4538. 679.22 s [vector] elem: OK
  4539. 679.22 s [vector] +++ OK, passed 100 tests.
  4540. 679.23 s [vector] notElem: OK
  4541. 679.23 s [vector] +++ OK, passed 100 tests.
  4542. 679.23 s [vector] find: OK
  4543. 679.23 s [vector] +++ OK, passed 100 tests.
  4544. 679.23 s [vector] findIndex: OK
  4545. 679.23 s [vector] +++ OK, passed 100 tests.
  4546. 679.23 s [vector] findIndexR: OK
  4547. 679.23 s [vector] +++ OK, passed 100 tests.
  4548. 679.23 s [vector] findIndices: OK
  4549. 679.23 s [vector] +++ OK, passed 100 tests.
  4550. 679.23 s [vector] elemIndex: OK
  4551. 679.23 s [vector] +++ OK, passed 100 tests.
  4552. 679.23 s [vector] elemIndices: OK
  4553. 679.23 s [vector] +++ OK, passed 100 tests.
  4554. 679.24 s [vector] foldl: OK
  4555. 679.24 s [vector] +++ OK, passed 100 tests.
  4556. 679.24 s [vector] foldl1: OK
  4557. 679.24 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4558. 679.24 s [vector] foldl': OK
  4559. 679.24 s [vector] +++ OK, passed 100 tests.
  4560. 679.24 s [vector] foldl1': OK
  4561. 679.24 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4562. 679.24 s [vector] foldr: OK
  4563. 679.24 s [vector] +++ OK, passed 100 tests.
  4564. 679.25 s [vector] foldr1: OK
  4565. 679.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4566. 679.25 s [vector] foldr': OK
  4567. 679.25 s [vector] +++ OK, passed 100 tests.
  4568. 679.25 s [vector] foldr1': OK
  4569. 679.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4570. 679.26 s [vector] ifoldl: OK
  4571. 679.26 s [vector] +++ OK, passed 100 tests.
  4572. 679.26 s [vector] ifoldl': OK
  4573. 679.26 s [vector] +++ OK, passed 100 tests.
  4574. 679.26 s [vector] ifoldr: OK
  4575. 679.27 s [vector] +++ OK, passed 100 tests.
  4576. 679.27 s [vector] ifoldr': OK
  4577. 679.27 s [vector] +++ OK, passed 100 tests.
  4578. 679.27 s [vector] ifoldM: OK
  4579. 679.27 s [vector] +++ OK, passed 100 tests.
  4580. 679.28 s [vector] ifoldM': OK
  4581. 679.28 s [vector] +++ OK, passed 100 tests.
  4582. 679.30 s [vector] ifoldM_: OK (0.02s)
  4583. 679.31 s [vector] +++ OK, passed 100 tests.
  4584. 679.31 s [vector] ifoldM'_: OK (0.02s)
  4585. 679.31 s [vector] +++ OK, passed 100 tests.
  4586. 679.32 s [vector] all: OK
  4587. 679.32 s [vector] +++ OK, passed 100 tests.
  4588. 679.32 s [vector] any: OK
  4589. 679.33 s [vector] +++ OK, passed 100 tests.
  4590. 679.33 s [vector] prescanl: OK
  4591. 679.33 s [vector] +++ OK, passed 100 tests.
  4592. 679.33 s [vector] prescanl': OK
  4593. 679.33 s [vector] +++ OK, passed 100 tests.
  4594. 679.34 s [vector] postscanl: OK
  4595. 679.34 s [vector] +++ OK, passed 100 tests.
  4596. 679.34 s [vector] postscanl': OK
  4597. 679.34 s [vector] +++ OK, passed 100 tests.
  4598. 679.34 s [vector] scanl: OK
  4599. 679.34 s [vector] +++ OK, passed 100 tests.
  4600. 679.34 s [vector] scanl': OK
  4601. 679.34 s [vector] +++ OK, passed 100 tests.
  4602. 679.34 s [vector] scanl1: OK
  4603. 679.34 s [vector] +++ OK, passed 100 tests.
  4604. 679.35 s [vector] scanl1': OK
  4605. 679.35 s [vector] +++ OK, passed 100 tests.
  4606. 679.36 s [vector] iscanl: OK
  4607. 679.36 s [vector] +++ OK, passed 100 tests.
  4608. 679.36 s [vector] iscanl': OK
  4609. 679.36 s [vector] +++ OK, passed 100 tests.
  4610. 679.36 s [vector] prescanr: OK
  4611. 679.36 s [vector] +++ OK, passed 100 tests.
  4612. 679.36 s [vector] prescanr': OK
  4613. 679.36 s [vector] +++ OK, passed 100 tests.
  4614. 679.36 s [vector] postscanr: OK
  4615. 679.36 s [vector] +++ OK, passed 100 tests.
  4616. 679.36 s [vector] postscanr': OK
  4617. 679.36 s [vector] +++ OK, passed 100 tests.
  4618. 679.36 s [vector] scanr: OK
  4619. 679.36 s [vector] +++ OK, passed 100 tests.
  4620. 679.37 s [vector] scanr': OK
  4621. 679.37 s [vector] +++ OK, passed 100 tests.
  4622. 679.37 s [vector] scanr1: OK
  4623. 679.37 s [vector] +++ OK, passed 100 tests.
  4624. 679.38 s [vector] scanr1': OK
  4625. 679.38 s [vector] +++ OK, passed 100 tests.
  4626. 679.38 s [vector] iscanr: OK
  4627. 679.38 s [vector] +++ OK, passed 100 tests.
  4628. 679.38 s [vector] iscanr': OK
  4629. 679.38 s [vector] +++ OK, passed 100 tests.
  4630. 679.38 s [vector] mut_read: OK
  4631. 679.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4632. 679.38 s [vector] mut_write: OK
  4633. 679.38 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4634. 679.39 s [vector] mut_modify: OK
  4635. 679.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4636. 679.39 s [vector] mut_generate: OK
  4637. 679.39 s [vector] +++ OK, passed 100 tests.
  4638. 679.40 s [vector] mut_generateM: OK (0.01s)
  4639. 679.40 s [vector] +++ OK, passed 100 tests.
  4640. 679.42 s [vector] mut_mapM_: OK
  4641. 679.42 s [vector] +++ OK, passed 100 tests.
  4642. 679.44 s [vector] mut_imapM_: OK (0.02s)
  4643. 679.44 s [vector] +++ OK, passed 100 tests.
  4644. 679.46 s [vector] mut_forM_: OK (0.02s)
  4645. 679.46 s [vector] +++ OK, passed 100 tests.
  4646. 679.47 s [vector] mut_iforM_: OK (0.02s)
  4647. 679.47 s [vector] +++ OK, passed 100 tests.
  4648. 679.47 s [vector] mut_foldr: OK
  4649. 679.47 s [vector] +++ OK, passed 100 tests.
  4650. 679.48 s [vector] mut_foldr': OK
  4651. 679.48 s [vector] +++ OK, passed 100 tests.
  4652. 679.49 s [vector] mut_foldl: OK
  4653. 679.49 s [vector] +++ OK, passed 100 tests.
  4654. 679.49 s [vector] mut_foldl': OK
  4655. 679.50 s [vector] +++ OK, passed 100 tests.
  4656. 679.50 s [vector] mut_ifoldr: OK
  4657. 679.50 s [vector] +++ OK, passed 100 tests.
  4658. 679.51 s [vector] mut_ifoldr': OK
  4659. 679.51 s [vector] +++ OK, passed 100 tests.
  4660. 679.51 s [vector] mut_ifoldl: OK
  4661. 679.51 s [vector] +++ OK, passed 100 tests.
  4662. 679.51 s [vector] mut_ifoldl': OK
  4663. 679.51 s [vector] +++ OK, passed 100 tests.
  4664. 679.51 s [vector] mut_foldM: OK
  4665. 679.51 s [vector] +++ OK, passed 100 tests.
  4666. 679.51 s [vector] mut_foldM': OK
  4667. 679.51 s [vector] +++ OK, passed 100 tests.
  4668. 679.51 s [vector] mut_foldrM: OK
  4669. 679.51 s [vector] +++ OK, passed 100 tests.
  4670. 679.51 s [vector] mut_foldrM': OK
  4671. 679.52 s [vector] +++ OK, passed 100 tests.
  4672. 679.52 s [vector] mut_ifoldM: OK
  4673. 679.52 s [vector] +++ OK, passed 100 tests.
  4674. 679.53 s [vector] mut_ifoldM': OK
  4675. 679.53 s [vector] +++ OK, passed 100 tests.
  4676. 679.53 s [vector] mut_ifoldrM: OK
  4677. 679.53 s [vector] +++ OK, passed 100 tests.
  4678. 679.53 s [vector] mut_ifoldrM': OK
  4679. 679.53 s [vector] +++ OK, passed 100 tests.
  4680. 679.53 s [vector] compare: OK
  4681. 679.53 s [vector] +++ OK, passed 100 tests.
  4682. 679.53 s [vector] maximum: OK
  4683. 679.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4684. 679.53 s [vector] minimum: OK
  4685. 679.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4686. 679.53 s [vector] minIndex: OK
  4687. 679.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4688. 679.53 s [vector] maxIndex: OK
  4689. 679.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4690. 679.53 s [vector] maximumBy: OK
  4691. 679.53 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4692. 679.53 s [vector] minimumBy: OK
  4693. 679.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4694. 679.53 s [vector] maximumOn: OK
  4695. 679.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4696. 679.53 s [vector] minimumOn: OK
  4697. 679.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4698. 679.53 s [vector] maxIndexBy: OK
  4699. 679.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4700. 679.54 s [vector] minIndexBy: OK
  4701. 679.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4702. 679.54 s [vector] ListFirstMaxIndexWins: OK
  4703. 679.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4704. 679.54 s [vector] FalseListFirstMaxIndexWins: OK
  4705. 679.54 s [vector] +++ OK, failed as expected. (after 1 test):
  4706. 679.54 s [vector] Exception:
  4707. 679.54 s [vector] Prelude.foldr1: empty list
  4708. 679.54 s [vector] CallStack (from HasCallStack):
  4709. 679.55 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4710. 679.55 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4711. 679.55 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4712. 679.55 s [vector] []
  4713. 679.55 s [vector] mempty: OK
  4714. 679.55 s [vector] +++ OK, passed 100 tests.
  4715. 679.55 s [vector] mappend: OK
  4716. 679.55 s [vector] +++ OK, passed 100 tests.
  4717. 679.56 s [vector] mconcat: OK (0.02s)
  4718. 679.56 s [vector] +++ OK, passed 100 tests.
  4719. 679.56 s [vector] glength: OK
  4720. 679.56 s [vector] +++ OK, passed 100 tests.
  4721. 679.56 s [vector] sum: OK
  4722. 679.56 s [vector] +++ OK, passed 100 tests.
  4723. 679.56 s [vector] product: OK
  4724. 679.56 s [vector] +++ OK, passed 100 tests.
  4725. 679.56 s [vector] enumFromN: OK
  4726. 679.56 s [vector] +++ OK, passed 100 tests.
  4727. 679.56 s [vector] enumFromThenN: OK
  4728. 679.56 s [vector] +++ OK, passed 100 tests.
  4729. 679.56 s [vector] enumFromTo: OK
  4730. 679.56 s [vector] +++ OK, passed 100 tests.
  4731. 679.56 s [vector] enumFromThenTo: OK
  4732. 679.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4733. 679.56 s [vector] Data.Vector.Storable.Vector (Double)
  4734. 679.56 s [vector] fromList.toList == id: OK
  4735. 679.56 s [vector] +++ OK, passed 100 tests.
  4736. 679.57 s [vector] toList.fromList == id: OK
  4737. 679.57 s [vector] +++ OK, passed 100 tests.
  4738. 679.57 s [vector] unstream.stream == id: OK
  4739. 679.57 s [vector] +++ OK, passed 100 tests.
  4740. 679.57 s [vector] stream.unstream == id: OK
  4741. 679.57 s [vector] +++ OK, passed 100 tests.
  4742. 679.57 s [vector] eq: OK
  4743. 679.57 s [vector] +++ OK, passed 100 tests.
  4744. 679.57 s [vector] length: OK
  4745. 679.57 s [vector] +++ OK, passed 100 tests.
  4746. 679.57 s [vector] null: OK
  4747. 679.57 s [vector] +++ OK, passed 100 tests.
  4748. 679.57 s [vector] index: OK
  4749. 679.57 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4750. 679.57 s [vector] safeIndex: OK
  4751. 679.57 s [vector] +++ OK, passed 100 tests.
  4752. 679.57 s [vector] head: OK
  4753. 679.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4754. 679.57 s [vector] last: OK
  4755. 679.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4756. 679.57 s [vector] unsafeIndex: OK
  4757. 679.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4758. 679.57 s [vector] unsafeHead: OK
  4759. 679.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4760. 679.57 s [vector] unsafeLast: OK
  4761. 679.57 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4762. 679.57 s [vector] slice: OK
  4763. 679.57 s [vector] +++ OK, passed 100 tests.
  4764. 679.58 s [vector] init: OK
  4765. 679.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4766. 679.58 s [vector] tail: OK
  4767. 679.58 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4768. 679.58 s [vector] take: OK
  4769. 679.58 s [vector] +++ OK, passed 100 tests.
  4770. 679.58 s [vector] drop: OK
  4771. 679.58 s [vector] +++ OK, passed 100 tests.
  4772. 679.58 s [vector] splitAt: OK
  4773. 679.58 s [vector] +++ OK, passed 100 tests.
  4774. 679.58 s [vector] empty: OK
  4775. 679.58 s [vector] +++ OK, passed 100 tests.
  4776. 679.58 s [vector] singleton: OK
  4777. 679.58 s [vector] +++ OK, passed 100 tests.
  4778. 679.59 s [vector] replicate: OK
  4779. 679.59 s [vector] +++ OK, passed 100 tests.
  4780. 679.59 s [vector] generate: OK
  4781. 679.59 s [vector] +++ OK, passed 100 tests.
  4782. 679.59 s [vector] iterateN: OK
  4783. 679.59 s [vector] +++ OK, passed 100 tests.
  4784. 679.62 s [vector] iterateNM: OK (0.04s)
  4785. 679.62 s [vector] +++ OK, passed 100 tests.
  4786. 679.66 s [vector] generateM: OK (0.04s)
  4787. 679.66 s [vector] +++ OK, passed 100 tests.
  4788. 679.67 s [vector] replicateM: OK (0.01s)
  4789. 679.67 s [vector] +++ OK, passed 100 tests.
  4790. 679.67 s [vector] create: OK
  4791. 679.68 s [vector] +++ OK, passed 100 tests.
  4792. 679.68 s [vector] createT: OK
  4793. 679.68 s [vector] +++ OK, passed 100 tests.
  4794. 679.68 s [vector] unfoldr: OK
  4795. 679.68 s [vector] +++ OK, passed 100 tests.
  4796. 679.69 s [vector] unfoldrN: OK
  4797. 679.69 s [vector] +++ OK, passed 100 tests.
  4798. 679.69 s [vector] unfoldrExactN: OK
  4799. 679.69 s [vector] +++ OK, passed 100 tests.
  4800. 679.69 s [vector] unfoldrM: OK
  4801. 679.69 s [vector] +++ OK, passed 100 tests.
  4802. 679.70 s [vector] unfoldrNM: OK (0.02s)
  4803. 679.70 s [vector] +++ OK, passed 100 tests.
  4804. 679.76 s [vector] unfoldrExactNM: OK (0.05s)
  4805. 679.76 s [vector] +++ OK, passed 100 tests.
  4806. 679.77 s [vector] constructN: OK (0.02s)
  4807. 679.77 s [vector] +++ OK, passed 100 tests.
  4808. 679.78 s [vector] constructrN: OK (0.02s)
  4809. 679.78 s [vector] +++ OK, passed 100 tests.
  4810. 679.78 s [vector] cons: OK
  4811. 679.78 s [vector] +++ OK, passed 100 tests.
  4812. 679.78 s [vector] snoc: OK
  4813. 679.78 s [vector] +++ OK, passed 100 tests.
  4814. 679.79 s [vector] append: OK
  4815. 679.79 s [vector] +++ OK, passed 100 tests.
  4816. 679.81 s [vector] concat: OK (0.02s)
  4817. 679.81 s [vector] +++ OK, passed 100 tests.
  4818. 679.81 s [vector] force: OK
  4819. 679.81 s [vector] +++ OK, passed 100 tests.
  4820. 679.82 s [vector] upd: OK
  4821. 679.82 s [vector] +++ OK, passed 100 tests.
  4822. 679.83 s [vector] accum: OK (0.02s)
  4823. 679.83 s [vector] +++ OK, passed 100 tests.
  4824. 679.84 s [vector] reverse: OK
  4825. 679.84 s [vector] +++ OK, passed 100 tests.
  4826. 679.84 s [vector] backpermute: OK
  4827. 679.84 s [vector] +++ OK, passed 100 tests.
  4828. 679.84 s [vector] map: OK
  4829. 679.84 s [vector] +++ OK, passed 100 tests.
  4830. 679.86 s [vector] imap: OK
  4831. 679.86 s [vector] +++ OK, passed 100 tests.
  4832. 679.86 s [vector] concatMap: OK (0.01s)
  4833. 679.86 s [vector] +++ OK, passed 100 tests.
  4834. 679.87 s [vector] mapM: OK
  4835. 679.87 s [vector] +++ OK, passed 100 tests.
  4836. 679.90 s [vector] mapM_: OK (0.03s)
  4837. 679.91 s [vector] +++ OK, passed 100 tests.
  4838. 679.91 s [vector] forM: OK
  4839. 679.91 s [vector] +++ OK, passed 100 tests.
  4840. 679.96 s [vector] forM_: OK (0.02s)
  4841. 679.96 s [vector] +++ OK, passed 100 tests.
  4842. 679.96 s [vector] imapM: OK
  4843. 679.96 s [vector] +++ OK, passed 100 tests.
  4844. 680.00 s [vector] imapM_: OK (0.04s)
  4845. 680.00 s [vector] +++ OK, passed 100 tests.
  4846. 680.02 s [vector] zipWith: OK (0.01s)
  4847. 680.02 s [vector] +++ OK, passed 100 tests.
  4848. 680.03 s [vector] zipWith3: OK (0.01s)
  4849. 680.03 s [vector] +++ OK, passed 100 tests.
  4850. 680.05 s [vector] izipWith: OK (0.01s)
  4851. 680.06 s [vector] +++ OK, passed 100 tests.
  4852. 680.07 s [vector] izipWith3: OK (0.01s)
  4853. 680.08 s [vector] +++ OK, passed 100 tests.
  4854. 680.09 s [vector] izipWithM: OK (0.02s)
  4855. 680.09 s [vector] +++ OK, passed 100 tests.
  4856. 680.11 s [vector] izipWithM_: OK (0.04s)
  4857. 680.12 s [vector] +++ OK, passed 100 tests.
  4858. 680.13 s [vector] zipWithM: OK
  4859. 680.13 s [vector] +++ OK, passed 100 tests.
  4860. 680.14 s [vector] zipWithM_: OK (0.03s)
  4861. 680.15 s [vector] +++ OK, passed 100 tests.
  4862. 680.15 s [vector] filter: OK
  4863. 680.15 s [vector] +++ OK, passed 100 tests.
  4864. 680.16 s [vector] ifilter: OK
  4865. 680.16 s [vector] +++ OK, passed 100 tests.
  4866. 680.21 s [vector] filterM: OK (0.04s)
  4867. 680.22 s [vector] +++ OK, passed 100 tests.
  4868. 680.22 s [vector] uniq: OK
  4869. 680.22 s [vector] +++ OK, passed 100 tests.
  4870. 680.23 s [vector] mapMaybe: OK
  4871. 680.23 s [vector] +++ OK, passed 100 tests.
  4872. 680.23 s [vector] imapMaybe: OK
  4873. 680.24 s [vector] +++ OK, passed 100 tests.
  4874. 680.24 s [vector] takeWhile: OK
  4875. 680.25 s [vector] +++ OK, passed 100 tests.
  4876. 680.26 s [vector] dropWhile: OK
  4877. 680.26 s [vector] +++ OK, passed 100 tests.
  4878. 680.26 s [vector] partition: OK
  4879. 680.26 s [vector] +++ OK, passed 100 tests.
  4880. 680.26 s [vector] partitionWith: OK
  4881. 680.26 s [vector] +++ OK, passed 100 tests.
  4882. 680.26 s [vector] span: OK
  4883. 680.26 s [vector] +++ OK, passed 100 tests.
  4884. 680.26 s [vector] break: OK
  4885. 680.26 s [vector] +++ OK, passed 100 tests.
  4886. 680.26 s [vector] spanR: OK
  4887. 680.26 s [vector] +++ OK, passed 100 tests.
  4888. 680.27 s [vector] breakR: OK
  4889. 680.27 s [vector] +++ OK, passed 100 tests.
  4890. 680.27 s [vector] groupBy: OK
  4891. 680.27 s [vector] +++ OK, passed 100 tests.
  4892. 680.27 s [vector] elem: OK
  4893. 680.27 s [vector] +++ OK, passed 100 tests.
  4894. 680.27 s [vector] notElem: OK
  4895. 680.27 s [vector] +++ OK, passed 100 tests.
  4896. 680.28 s [vector] find: OK
  4897. 680.28 s [vector] +++ OK, passed 100 tests.
  4898. 680.29 s [vector] findIndex: OK
  4899. 680.29 s [vector] +++ OK, passed 100 tests.
  4900. 680.30 s [vector] findIndexR: OK
  4901. 680.31 s [vector] +++ OK, passed 100 tests.
  4902. 680.31 s [vector] findIndices: OK
  4903. 680.32 s [vector] +++ OK, passed 100 tests.
  4904. 680.33 s [vector] elemIndex: OK
  4905. 680.33 s [vector] +++ OK, passed 100 tests.
  4906. 680.34 s [vector] elemIndices: OK
  4907. 680.35 s [vector] +++ OK, passed 100 tests.
  4908. 680.35 s [vector] foldl: OK (0.01s)
  4909. 680.35 s [vector] +++ OK, passed 100 tests.
  4910. 680.37 s [vector] foldl1: OK (0.01s)
  4911. 680.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4912. 680.39 s [vector] foldl': OK (0.01s)
  4913. 680.39 s [vector] +++ OK, passed 100 tests.
  4914. 680.40 s [vector] foldl1': OK (0.01s)
  4915. 680.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4916. 680.40 s [vector] foldr: OK (0.01s)
  4917. 680.40 s [vector] +++ OK, passed 100 tests.
  4918. 680.40 s [vector] foldr1: OK (0.01s)
  4919. 680.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4920. 680.40 s [vector] foldr': OK (0.01s)
  4921. 680.40 s [vector] +++ OK, passed 100 tests.
  4922. 680.40 s [vector] foldr1': OK (0.01s)
  4923. 680.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4924. 680.41 s [vector] ifoldl: OK (0.02s)
  4925. 680.41 s [vector] +++ OK, passed 100 tests.
  4926. 680.41 s [vector] ifoldl': OK (0.02s)
  4927. 680.41 s [vector] +++ OK, passed 100 tests.
  4928. 680.42 s [vector] ifoldr: OK (0.02s)
  4929. 680.43 s [vector] +++ OK, passed 100 tests.
  4930. 680.44 s [vector] ifoldr': OK (0.02s)
  4931. 680.45 s [vector] +++ OK, passed 100 tests.
  4932. 680.46 s [vector] ifoldM: OK (0.01s)
  4933. 680.46 s [vector] +++ OK, passed 100 tests.
  4934. 680.46 s [vector] ifoldM': OK (0.01s)
  4935. 680.47 s [vector] +++ OK, passed 100 tests.
  4936. 680.50 s [vector] ifoldM_: OK (0.04s)
  4937. 680.50 s [vector] +++ OK, passed 100 tests.
  4938. 680.54 s [vector] ifoldM'_: OK (0.04s)
  4939. 680.54 s [vector] +++ OK, passed 100 tests.
  4940. 680.54 s [vector] all: OK
  4941. 680.55 s [vector] +++ OK, passed 100 tests.
  4942. 680.55 s [vector] any: OK
  4943. 680.56 s [vector] +++ OK, passed 100 tests.
  4944. 680.56 s [vector] prescanl: OK (0.01s)
  4945. 680.57 s [vector] +++ OK, passed 100 tests.
  4946. 680.58 s [vector] prescanl': OK (0.01s)
  4947. 680.58 s [vector] +++ OK, passed 100 tests.
  4948. 680.59 s [vector] postscanl: OK (0.01s)
  4949. 680.59 s [vector] +++ OK, passed 100 tests.
  4950. 680.60 s [vector] postscanl': OK (0.01s)
  4951. 680.61 s [vector] +++ OK, passed 100 tests.
  4952. 680.62 s [vector] scanl: OK (0.01s)
  4953. 680.62 s [vector] +++ OK, passed 100 tests.
  4954. 680.63 s [vector] scanl': OK (0.01s)
  4955. 680.63 s [vector] +++ OK, passed 100 tests.
  4956. 680.64 s [vector] scanl1: OK (0.01s)
  4957. 680.65 s [vector] +++ OK, passed 100 tests.
  4958. 680.66 s [vector] scanl1': OK (0.01s)
  4959. 680.66 s [vector] +++ OK, passed 100 tests.
  4960. 680.68 s [vector] iscanl: OK (0.01s)
  4961. 680.68 s [vector] +++ OK, passed 100 tests.
  4962. 680.68 s [vector] iscanl': OK (0.01s)
  4963. 680.68 s [vector] +++ OK, passed 100 tests.
  4964. 680.70 s [vector] prescanr: OK (0.01s)
  4965. 680.71 s [vector] +++ OK, passed 100 tests.
  4966. 680.72 s [vector] prescanr': OK (0.01s)
  4967. 680.72 s [vector] +++ OK, passed 100 tests.
  4968. 680.73 s [vector] postscanr: OK (0.01s)
  4969. 680.73 s [vector] +++ OK, passed 100 tests.
  4970. 680.74 s [vector] postscanr': OK (0.01s)
  4971. 680.75 s [vector] +++ OK, passed 100 tests.
  4972. 680.76 s [vector] scanr: OK (0.01s)
  4973. 680.76 s [vector] +++ OK, passed 100 tests.
  4974. 680.76 s [vector] scanr': OK (0.01s)
  4975. 680.76 s [vector] +++ OK, passed 100 tests.
  4976. 680.78 s [vector] scanr1: OK (0.01s)
  4977. 680.78 s [vector] +++ OK, passed 100 tests.
  4978. 680.78 s [vector] scanr1': OK (0.01s)
  4979. 680.78 s [vector] +++ OK, passed 100 tests.
  4980. 680.80 s [vector] iscanr: OK (0.02s)
  4981. 680.81 s [vector] +++ OK, passed 100 tests.
  4982. 680.81 s [vector] iscanr': OK (0.02s)
  4983. 680.81 s [vector] +++ OK, passed 100 tests.
  4984. 680.82 s [vector] mut_read: OK
  4985. 680.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4986. 680.82 s [vector] mut_write: OK
  4987. 680.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4988. 680.82 s [vector] mut_modify: OK
  4989. 680.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4990. 680.82 s [vector] mut_generate: OK
  4991. 680.82 s [vector] +++ OK, passed 100 tests.
  4992. 680.84 s [vector] mut_generateM: OK (0.02s)
  4993. 680.84 s [vector] +++ OK, passed 100 tests.
  4994. 680.88 s [vector] mut_mapM_: OK (0.04s)
  4995. 680.88 s [vector] +++ OK, passed 100 tests.
  4996. 680.92 s [vector] mut_imapM_: OK (0.04s)
  4997. 680.92 s [vector] +++ OK, passed 100 tests.
  4998. 680.94 s [vector] mut_forM_: OK (0.03s)
  4999. 680.95 s [vector] +++ OK, passed 100 tests.
  5000. 680.98 s [vector] mut_iforM_: OK (0.04s)
  5001. 680.98 s [vector] +++ OK, passed 100 tests.
  5002. 681.00 s [vector] mut_foldr: OK (0.01s)
  5003. 681.00 s [vector] +++ OK, passed 100 tests.
  5004. 681.00 s [vector] mut_foldr': OK (0.01s)
  5005. 681.00 s [vector] +++ OK, passed 100 tests.
  5006. 681.02 s [vector] mut_foldl: OK (0.01s)
  5007. 681.02 s [vector] +++ OK, passed 100 tests.
  5008. 681.03 s [vector] mut_foldl': OK
  5009. 681.04 s [vector] +++ OK, passed 100 tests.
  5010. 681.05 s [vector] mut_ifoldr: OK (0.01s)
  5011. 681.05 s [vector] +++ OK, passed 100 tests.
  5012. 681.06 s [vector] mut_ifoldr': OK (0.01s)
  5013. 681.06 s [vector] +++ OK, passed 100 tests.
  5014. 681.08 s [vector] mut_ifoldl: OK (0.01s)
  5015. 681.08 s [vector] +++ OK, passed 100 tests.
  5016. 681.08 s [vector] mut_ifoldl': OK (0.01s)
  5017. 681.08 s [vector] +++ OK, passed 100 tests.
  5018. 681.10 s [vector] mut_foldM: OK (0.02s)
  5019. 681.10 s [vector] +++ OK, passed 100 tests.
  5020. 681.12 s [vector] mut_foldM': OK (0.02s)
  5021. 681.12 s [vector] +++ OK, passed 100 tests.
  5022. 681.14 s [vector] mut_foldrM: OK (0.02s)
  5023. 681.15 s [vector] +++ OK, passed 100 tests.
  5024. 681.16 s [vector] mut_foldrM': OK (0.01s)
  5025. 681.17 s [vector] +++ OK, passed 100 tests.
  5026. 681.18 s [vector] mut_ifoldM: OK (0.01s)
  5027. 681.18 s [vector] +++ OK, passed 100 tests.
  5028. 681.19 s [vector] mut_ifoldM': OK (0.01s)
  5029. 681.19 s [vector] +++ OK, passed 100 tests.
  5030. 681.20 s [vector] mut_ifoldrM: OK (0.01s)
  5031. 681.21 s [vector] +++ OK, passed 100 tests.
  5032. 681.21 s [vector] mut_ifoldrM': OK (0.01s)
  5033. 681.21 s [vector] +++ OK, passed 100 tests.
  5034. 681.21 s [vector] compare: OK
  5035. 681.21 s [vector] +++ OK, passed 100 tests.
  5036. 681.21 s [vector] maximum: OK
  5037. 681.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5038. 681.21 s [vector] minimum: OK
  5039. 681.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5040. 681.21 s [vector] minIndex: OK
  5041. 681.21 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5042. 681.21 s [vector] maxIndex: OK
  5043. 681.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5044. 681.21 s [vector] maximumBy: OK
  5045. 681.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5046. 681.21 s [vector] minimumBy: OK
  5047. 681.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5048. 681.22 s [vector] maximumOn: OK
  5049. 681.22 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5050. 681.22 s [vector] minimumOn: OK
  5051. 681.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5052. 681.22 s [vector] maxIndexBy: OK
  5053. 681.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5054. 681.22 s [vector] minIndexBy: OK
  5055. 681.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5056. 681.22 s [vector] ListFirstMaxIndexWins: OK
  5057. 681.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5058. 681.22 s [vector] FalseListFirstMaxIndexWins: OK
  5059. 681.22 s [vector] +++ OK, failed as expected. (after 1 test):
  5060. 681.22 s [vector] Exception:
  5061. 681.22 s [vector] Prelude.foldr1: empty list
  5062. 681.22 s [vector] CallStack (from HasCallStack):
  5063. 681.22 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5064. 681.22 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5065. 681.22 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5066. 681.22 s [vector] []
  5067. 681.22 s [vector] mempty: OK
  5068. 681.22 s [vector] +++ OK, passed 100 tests.
  5069. 681.22 s [vector] mappend: OK
  5070. 681.23 s [vector] +++ OK, passed 100 tests.
  5071. 681.25 s [vector] mconcat: OK (0.02s)
  5072. 681.25 s [vector] +++ OK, passed 100 tests.
  5073. 681.25 s [vector] glength: OK
  5074. 681.25 s [vector] +++ OK, passed 100 tests.
  5075. 681.25 s [vector] sum: OK
  5076. 681.25 s [vector] +++ OK, passed 100 tests.
  5077. 681.25 s [vector] product: OK
  5078. 681.25 s [vector] +++ OK, passed 100 tests.
  5079. 681.25 s [vector] enumFromN: OK
  5080. 681.26 s [vector] +++ OK, passed 100 tests.
  5081. 681.26 s [vector] enumFromThenN: OK
  5082. 681.26 s [vector] +++ OK, passed 100 tests.
  5083. 681.26 s [vector] enumFromTo: OK
  5084. 681.26 s [vector] +++ OK, passed 100 tests.
  5085. 681.26 s [vector] enumFromThenTo: OK
  5086. 681.26 s [vector] +++ OK, passed 100 tests; 2 discarded.
  5087. 681.26 s [vector] unstream
  5088. 681.26 s [vector] unstream == vunstream (exact): OK
  5089. 681.26 s [vector] +++ OK, passed 100 tests.
  5090. 681.26 s [vector] unstream == vunstream (unknown): OK
  5091. 681.26 s [vector] +++ OK, passed 100 tests.
  5092. 681.27 s [vector] unstreamR ~= vunstream (exact): OK
  5093. 681.27 s [vector] +++ OK, passed 100 tests.
  5094. 681.27 s [vector] unstreamR ~= vunstream (unknown): OK
  5095. 681.27 s [vector] +++ OK, passed 100 tests.
  5096. 681.27 s [vector] Tests.Vector.Strict
  5097. 681.27 s [vector] Bool
  5098. 681.27 s [vector] fromList.toList == id: OK
  5099. 681.27 s [vector] +++ OK, passed 100 tests.
  5100. 681.27 s [vector] toList.fromList == id: OK
  5101. 681.27 s [vector] +++ OK, passed 100 tests.
  5102. 681.27 s [vector] unstream.stream == id: OK
  5103. 681.27 s [vector] +++ OK, passed 100 tests.
  5104. 681.27 s [vector] stream.unstream == id: OK
  5105. 681.27 s [vector] +++ OK, passed 100 tests.
  5106. 681.27 s [vector] eq: OK
  5107. 681.27 s [vector] +++ OK, passed 100 tests.
  5108. 681.27 s [vector] length: OK
  5109. 681.27 s [vector] +++ OK, passed 100 tests.
  5110. 681.27 s [vector] null: OK
  5111. 681.27 s [vector] +++ OK, passed 100 tests.
  5112. 681.27 s [vector] index: OK
  5113. 681.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5114. 681.27 s [vector] safeIndex: OK
  5115. 681.27 s [vector] +++ OK, passed 100 tests.
  5116. 681.27 s [vector] head: OK
  5117. 681.27 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5118. 681.27 s [vector] last: OK
  5119. 681.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5120. 681.27 s [vector] unsafeIndex: OK
  5121. 681.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5122. 681.27 s [vector] unsafeHead: OK
  5123. 681.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5124. 681.28 s [vector] unsafeLast: OK
  5125. 681.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5126. 681.28 s [vector] slice: OK
  5127. 681.28 s [vector] +++ OK, passed 100 tests.
  5128. 681.28 s [vector] init: OK
  5129. 681.28 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5130. 681.28 s [vector] tail: OK
  5131. 681.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5132. 681.28 s [vector] take: OK
  5133. 681.28 s [vector] +++ OK, passed 100 tests.
  5134. 681.28 s [vector] drop: OK
  5135. 681.28 s [vector] +++ OK, passed 100 tests.
  5136. 681.28 s [vector] splitAt: OK
  5137. 681.28 s [vector] +++ OK, passed 100 tests.
  5138. 681.28 s [vector] empty: OK
  5139. 681.28 s [vector] +++ OK, passed 100 tests.
  5140. 681.28 s [vector] singleton: OK
  5141. 681.29 s [vector] +++ OK, passed 100 tests.
  5142. 681.29 s [vector] replicate: OK
  5143. 681.29 s [vector] +++ OK, passed 100 tests.
  5144. 681.29 s [vector] generate: OK
  5145. 681.29 s [vector] +++ OK, passed 100 tests.
  5146. 681.30 s [vector] iterateN: OK
  5147. 681.30 s [vector] +++ OK, passed 100 tests.
  5148. 681.34 s [vector] iterateNM: OK (0.06s)
  5149. 681.34 s [vector] +++ OK, passed 100 tests.
  5150. 681.36 s [vector] generateM: OK (0.02s)
  5151. 681.36 s [vector] +++ OK, passed 100 tests.
  5152. 681.37 s [vector] replicateM: OK (0.01s)
  5153. 681.37 s [vector] +++ OK, passed 100 tests.
  5154. 681.37 s [vector] create: OK
  5155. 681.37 s [vector] +++ OK, passed 100 tests.
  5156. 681.37 s [vector] createT: OK
  5157. 681.37 s [vector] +++ OK, passed 100 tests.
  5158. 681.37 s [vector] unfoldr: OK
  5159. 681.37 s [vector] +++ OK, passed 100 tests.
  5160. 681.38 s [vector] unfoldrN: OK
  5161. 681.38 s [vector] +++ OK, passed 100 tests.
  5162. 681.39 s [vector] unfoldrExactN: OK
  5163. 681.39 s [vector] +++ OK, passed 100 tests.
  5164. 681.39 s [vector] unfoldrM: OK
  5165. 681.39 s [vector] +++ OK, passed 100 tests.
  5166. 681.39 s [vector] unfoldrNM: OK
  5167. 681.39 s [vector] +++ OK, passed 100 tests.
  5168. 681.44 s [vector] unfoldrExactNM: OK (0.06s)
  5169. 681.44 s [vector] +++ OK, passed 100 tests.
  5170. 681.44 s [vector] constructN: OK
  5171. 681.44 s [vector] +++ OK, passed 100 tests.
  5172. 681.45 s [vector] constructrN: OK
  5173. 681.45 s [vector] +++ OK, passed 100 tests.
  5174. 681.45 s [vector] cons: OK
  5175. 681.45 s [vector] +++ OK, passed 100 tests.
  5176. 681.45 s [vector] snoc: OK
  5177. 681.45 s [vector] +++ OK, passed 100 tests.
  5178. 681.46 s [vector] append: OK
  5179. 681.46 s [vector] +++ OK, passed 100 tests.
  5180. 681.47 s [vector] concat: OK (0.01s)
  5181. 681.47 s [vector] +++ OK, passed 100 tests.
  5182. 681.47 s [vector] force: OK
  5183. 681.47 s [vector] +++ OK, passed 100 tests.
  5184. 681.48 s [vector] upd: OK
  5185. 681.48 s [vector] +++ OK, passed 100 tests.
  5186. 681.48 s [vector] accum: OK
  5187. 681.48 s [vector] +++ OK, passed 100 tests.
  5188. 681.48 s [vector] reverse: OK
  5189. 681.48 s [vector] +++ OK, passed 100 tests.
  5190. 681.48 s [vector] backpermute: OK
  5191. 681.48 s [vector] +++ OK, passed 100 tests.
  5192. 681.48 s [vector] map: OK
  5193. 681.48 s [vector] +++ OK, passed 100 tests.
  5194. 681.48 s [vector] imap: OK
  5195. 681.48 s [vector] +++ OK, passed 100 tests.
  5196. 681.49 s [vector] concatMap: OK
  5197. 681.49 s [vector] +++ OK, passed 100 tests.
  5198. 681.49 s [vector] mapM: OK
  5199. 681.50 s [vector] +++ OK, passed 100 tests.
  5200. 681.51 s [vector] mapM_: OK (0.02s)
  5201. 681.52 s [vector] +++ OK, passed 100 tests.
  5202. 681.52 s [vector] forM: OK
  5203. 681.52 s [vector] +++ OK, passed 100 tests.
  5204. 681.52 s [vector] forM_: OK
  5205. 681.52 s [vector] +++ OK, passed 100 tests.
  5206. 681.52 s [vector] imapM: OK
  5207. 681.53 s [vector] +++ OK, passed 100 tests.
  5208. 681.53 s [vector] imapM_: OK (0.01s)
  5209. 681.53 s [vector] +++ OK, passed 100 tests.
  5210. 681.53 s [vector] zipWith: OK
  5211. 681.53 s [vector] +++ OK, passed 100 tests.
  5212. 681.53 s [vector] zipWith3: OK
  5213. 681.54 s [vector] +++ OK, passed 100 tests.
  5214. 681.54 s [vector] izipWith: OK
  5215. 681.54 s [vector] +++ OK, passed 100 tests.
  5216. 681.54 s [vector] izipWith3: OK
  5217. 681.54 s [vector] +++ OK, passed 100 tests.
  5218. 681.54 s [vector] izipWithM: OK
  5219. 681.54 s [vector] +++ OK, passed 100 tests.
  5220. 681.55 s [vector] izipWithM_: OK (0.01s)
  5221. 681.56 s [vector] +++ OK, passed 100 tests.
  5222. 681.56 s [vector] zipWithM: OK
  5223. 681.56 s [vector] +++ OK, passed 100 tests.
  5224. 681.56 s [vector] zipWithM_: OK
  5225. 681.56 s [vector] +++ OK, passed 100 tests.
  5226. 681.56 s [vector] filter: OK
  5227. 681.56 s [vector] +++ OK, passed 100 tests.
  5228. 681.57 s [vector] ifilter: OK
  5229. 681.57 s [vector] +++ OK, passed 100 tests.
  5230. 681.58 s [vector] filterM: OK (0.02s)
  5231. 681.58 s [vector] +++ OK, passed 100 tests.
  5232. 681.58 s [vector] uniq: OK
  5233. 681.58 s [vector] +++ OK, passed 100 tests.
  5234. 681.58 s [vector] mapMaybe: OK
  5235. 681.59 s [vector] +++ OK, passed 100 tests.
  5236. 681.59 s [vector] imapMaybe: OK
  5237. 681.59 s [vector] +++ OK, passed 100 tests.
  5238. 681.59 s [vector] takeWhile: OK
  5239. 681.59 s [vector] +++ OK, passed 100 tests.
  5240. 681.59 s [vector] dropWhile: OK
  5241. 681.59 s [vector] +++ OK, passed 100 tests.
  5242. 681.59 s [vector] partition: OK
  5243. 681.59 s [vector] +++ OK, passed 100 tests.
  5244. 681.59 s [vector] partitionWith: OK
  5245. 681.59 s [vector] +++ OK, passed 100 tests.
  5246. 681.59 s [vector] span: OK
  5247. 681.59 s [vector] +++ OK, passed 100 tests.
  5248. 681.59 s [vector] break: OK
  5249. 681.59 s [vector] +++ OK, passed 100 tests.
  5250. 681.59 s [vector] spanR: OK
  5251. 681.59 s [vector] +++ OK, passed 100 tests.
  5252. 681.59 s [vector] breakR: OK
  5253. 681.59 s [vector] +++ OK, passed 100 tests.
  5254. 681.59 s [vector] groupBy: OK
  5255. 681.59 s [vector] +++ OK, passed 100 tests.
  5256. 681.59 s [vector] elem: OK
  5257. 681.59 s [vector] +++ OK, passed 100 tests.
  5258. 681.59 s [vector] notElem: OK
  5259. 681.59 s [vector] +++ OK, passed 100 tests.
  5260. 681.59 s [vector] find: OK
  5261. 681.59 s [vector] +++ OK, passed 100 tests.
  5262. 681.59 s [vector] findIndex: OK
  5263. 681.59 s [vector] +++ OK, passed 100 tests.
  5264. 681.60 s [vector] findIndexR: OK
  5265. 681.60 s [vector] +++ OK, passed 100 tests.
  5266. 681.60 s [vector] findIndices: OK
  5267. 681.60 s [vector] +++ OK, passed 100 tests.
  5268. 681.60 s [vector] elemIndex: OK
  5269. 681.60 s [vector] +++ OK, passed 100 tests.
  5270. 681.60 s [vector] elemIndices: OK
  5271. 681.60 s [vector] +++ OK, passed 100 tests.
  5272. 681.60 s [vector] foldl: OK
  5273. 681.60 s [vector] +++ OK, passed 100 tests.
  5274. 681.60 s [vector] foldl1: OK
  5275. 681.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5276. 681.60 s [vector] foldl': OK
  5277. 681.61 s [vector] +++ OK, passed 100 tests.
  5278. 681.61 s [vector] foldl1': OK
  5279. 681.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5280. 681.61 s [vector] foldr: OK
  5281. 681.61 s [vector] +++ OK, passed 100 tests.
  5282. 681.61 s [vector] foldr1: OK
  5283. 681.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5284. 681.61 s [vector] foldr': OK
  5285. 681.61 s [vector] +++ OK, passed 100 tests.
  5286. 681.62 s [vector] foldr1': OK
  5287. 681.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5288. 681.62 s [vector] ifoldl: OK
  5289. 681.62 s [vector] +++ OK, passed 100 tests.
  5290. 681.62 s [vector] ifoldl': OK
  5291. 681.62 s [vector] +++ OK, passed 100 tests.
  5292. 681.63 s [vector] ifoldr: OK
  5293. 681.63 s [vector] +++ OK, passed 100 tests.
  5294. 681.63 s [vector] ifoldr': OK
  5295. 681.63 s [vector] +++ OK, passed 100 tests.
  5296. 681.63 s [vector] ifoldM: OK
  5297. 681.63 s [vector] +++ OK, passed 100 tests.
  5298. 681.63 s [vector] ifoldM': OK
  5299. 681.63 s [vector] +++ OK, passed 100 tests.
  5300. 681.64 s [vector] ifoldM_: OK (0.01s)
  5301. 681.64 s [vector] +++ OK, passed 100 tests.
  5302. 681.66 s [vector] ifoldM'_: OK (0.01s)
  5303. 681.66 s [vector] +++ OK, passed 100 tests.
  5304. 681.66 s [vector] all: OK
  5305. 681.66 s [vector] +++ OK, passed 100 tests.
  5306. 681.66 s [vector] any: OK
  5307. 681.66 s [vector] +++ OK, passed 100 tests.
  5308. 681.66 s [vector] prescanl: OK
  5309. 681.66 s [vector] +++ OK, passed 100 tests.
  5310. 681.66 s [vector] prescanl': OK
  5311. 681.66 s [vector] +++ OK, passed 100 tests.
  5312. 681.66 s [vector] postscanl: OK
  5313. 681.66 s [vector] +++ OK, passed 100 tests.
  5314. 681.67 s [vector] postscanl': OK
  5315. 681.67 s [vector] +++ OK, passed 100 tests.
  5316. 681.67 s [vector] scanl: OK
  5317. 681.67 s [vector] +++ OK, passed 100 tests.
  5318. 681.67 s [vector] scanl': OK
  5319. 681.67 s [vector] +++ OK, passed 100 tests.
  5320. 681.68 s [vector] scanl1: OK
  5321. 681.68 s [vector] +++ OK, passed 100 tests.
  5322. 681.68 s [vector] scanl1': OK
  5323. 681.68 s [vector] +++ OK, passed 100 tests.
  5324. 681.68 s [vector] iscanl: OK
  5325. 681.68 s [vector] +++ OK, passed 100 tests.
  5326. 681.68 s [vector] iscanl': OK
  5327. 681.68 s [vector] +++ OK, passed 100 tests.
  5328. 681.69 s [vector] prescanr: OK
  5329. 681.69 s [vector] +++ OK, passed 100 tests.
  5330. 681.69 s [vector] prescanr': OK
  5331. 681.69 s [vector] +++ OK, passed 100 tests.
  5332. 681.69 s [vector] postscanr: OK
  5333. 681.69 s [vector] +++ OK, passed 100 tests.
  5334. 681.69 s [vector] postscanr': OK
  5335. 681.69 s [vector] +++ OK, passed 100 tests.
  5336. 681.70 s [vector] scanr: OK
  5337. 681.70 s [vector] +++ OK, passed 100 tests.
  5338. 681.70 s [vector] scanr': OK
  5339. 681.70 s [vector] +++ OK, passed 100 tests.
  5340. 681.70 s [vector] scanr1: OK
  5341. 681.70 s [vector] +++ OK, passed 100 tests.
  5342. 681.70 s [vector] scanr1': OK
  5343. 681.70 s [vector] +++ OK, passed 100 tests.
  5344. 681.71 s [vector] iscanr: OK
  5345. 681.71 s [vector] +++ OK, passed 100 tests.
  5346. 681.71 s [vector] iscanr': OK
  5347. 681.71 s [vector] +++ OK, passed 100 tests.
  5348. 681.71 s [vector] mut_read: OK
  5349. 681.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5350. 681.71 s [vector] mut_write: OK
  5351. 681.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5352. 681.71 s [vector] mut_modify: OK
  5353. 681.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5354. 681.72 s [vector] mut_generate: OK
  5355. 681.72 s [vector] +++ OK, passed 100 tests.
  5356. 681.73 s [vector] mut_generateM: OK
  5357. 681.73 s [vector] +++ OK, passed 100 tests.
  5358. 681.74 s [vector] mut_mapM_: OK (0.01s)
  5359. 681.74 s [vector] +++ OK, passed 100 tests.
  5360. 681.76 s [vector] mut_imapM_: OK (0.01s)
  5361. 681.76 s [vector] +++ OK, passed 100 tests.
  5362. 681.76 s [vector] mut_forM_: OK
  5363. 681.76 s [vector] +++ OK, passed 100 tests.
  5364. 681.77 s [vector] mut_iforM_: OK (0.01s)
  5365. 681.77 s [vector] +++ OK, passed 100 tests.
  5366. 681.77 s [vector] mut_foldr: OK
  5367. 681.77 s [vector] +++ OK, passed 100 tests.
  5368. 681.78 s [vector] mut_foldr': OK
  5369. 681.78 s [vector] +++ OK, passed 100 tests.
  5370. 681.78 s [vector] mut_foldl: OK
  5371. 681.79 s [vector] +++ OK, passed 100 tests.
  5372. 681.79 s [vector] mut_foldl': OK
  5373. 681.79 s [vector] +++ OK, passed 100 tests.
  5374. 681.79 s [vector] mut_ifoldr: OK
  5375. 681.79 s [vector] +++ OK, passed 100 tests.
  5376. 681.79 s [vector] mut_ifoldr': OK
  5377. 681.79 s [vector] +++ OK, passed 100 tests.
  5378. 681.79 s [vector] mut_ifoldl: OK
  5379. 681.79 s [vector] +++ OK, passed 100 tests.
  5380. 681.79 s [vector] mut_ifoldl': OK
  5381. 681.79 s [vector] +++ OK, passed 100 tests.
  5382. 681.79 s [vector] mut_foldM: OK
  5383. 681.79 s [vector] +++ OK, passed 100 tests.
  5384. 681.79 s [vector] mut_foldM': OK
  5385. 681.79 s [vector] +++ OK, passed 100 tests.
  5386. 681.79 s [vector] mut_foldrM: OK
  5387. 681.79 s [vector] +++ OK, passed 100 tests.
  5388. 681.80 s [vector] mut_foldrM': OK
  5389. 681.80 s [vector] +++ OK, passed 100 tests.
  5390. 681.80 s [vector] mut_ifoldM: OK
  5391. 681.80 s [vector] +++ OK, passed 100 tests.
  5392. 681.80 s [vector] mut_ifoldM': OK
  5393. 681.80 s [vector] +++ OK, passed 100 tests.
  5394. 681.81 s [vector] mut_ifoldrM: OK
  5395. 681.81 s [vector] +++ OK, passed 100 tests.
  5396. 681.81 s [vector] mut_ifoldrM': OK
  5397. 681.81 s [vector] +++ OK, passed 100 tests.
  5398. 681.81 s [vector] compare: OK
  5399. 681.81 s [vector] +++ OK, passed 100 tests.
  5400. 681.81 s [vector] maximum: OK
  5401. 681.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5402. 681.81 s [vector] minimum: OK
  5403. 681.81 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5404. 681.81 s [vector] minIndex: OK
  5405. 681.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5406. 681.81 s [vector] maxIndex: OK
  5407. 681.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5408. 681.82 s [vector] maximumBy: OK
  5409. 681.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5410. 681.82 s [vector] minimumBy: OK
  5411. 681.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5412. 681.82 s [vector] maximumOn: OK
  5413. 681.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5414. 681.82 s [vector] minimumOn: OK
  5415. 681.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5416. 681.82 s [vector] maxIndexBy: OK
  5417. 681.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5418. 681.82 s [vector] minIndexBy: OK
  5419. 681.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5420. 681.83 s [vector] ListFirstMaxIndexWins: OK
  5421. 681.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5422. 681.83 s [vector] FalseListFirstMaxIndexWins: OK
  5423. 681.83 s [vector] +++ OK, failed as expected. (after 1 test):
  5424. 681.84 s [vector] Exception:
  5425. 681.84 s [vector] Prelude.foldr1: empty list
  5426. 681.84 s [vector] CallStack (from HasCallStack):
  5427. 681.84 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5428. 681.84 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5429. 681.85 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5430. 681.85 s [vector] []
  5431. 681.85 s [vector] zip: OK
  5432. 681.85 s [vector] +++ OK, passed 100 tests.
  5433. 681.85 s [vector] zip3: OK
  5434. 681.85 s [vector] +++ OK, passed 100 tests.
  5435. 681.85 s [vector] unzip: OK
  5436. 681.85 s [vector] +++ OK, passed 100 tests.
  5437. 681.85 s [vector] unzip3: OK
  5438. 681.85 s [vector] +++ OK, passed 100 tests.
  5439. 681.85 s [vector] indexed: OK
  5440. 681.85 s [vector] +++ OK, passed 100 tests.
  5441. 681.85 s [vector] update: OK
  5442. 681.85 s [vector] +++ OK, passed 100 tests.
  5443. 681.86 s [vector] concat: OK (0.01s)
  5444. 681.87 s [vector] +++ OK, passed 100 tests.
  5445. 681.87 s [vector] mempty: OK
  5446. 681.87 s [vector] +++ OK, passed 100 tests.
  5447. 681.89 s [vector] mappend: OK
  5448. 681.89 s [vector] +++ OK, passed 100 tests.
  5449. 681.89 s [vector] mconcat: OK
  5450. 681.89 s [vector] +++ OK, passed 100 tests.
  5451. 681.89 s [vector] fmap: OK
  5452. 681.89 s [vector] +++ OK, passed 100 tests.
  5453. 681.89 s [vector] return: OK
  5454. 681.89 s [vector] +++ OK, passed 100 tests.
  5455. 681.89 s [vector] bind: OK (0.01s)
  5456. 681.89 s [vector] +++ OK, passed 100 tests.
  5457. 681.89 s [vector] mzip: OK
  5458. 681.89 s [vector] +++ OK, passed 100 tests.
  5459. 681.89 s [vector] munzip: OK
  5460. 681.89 s [vector] +++ OK, passed 100 tests.
  5461. 681.89 s [vector] applicative_pure: OK
  5462. 681.89 s [vector] +++ OK, passed 100 tests.
  5463. 681.89 s [vector] applicative_appl: OK (0.01s)
  5464. 681.89 s [vector] +++ OK, passed 100 tests.
  5465. 681.89 s [vector] alternative_empty: OK
  5466. 681.89 s [vector] +++ OK, passed 100 tests.
  5467. 681.89 s [vector] alternative_or: OK
  5468. 681.89 s [vector] +++ OK, passed 100 tests.
  5469. 681.92 s [vector] sequence: OK (0.04s)
  5470. 681.92 s [vector] +++ OK, passed 100 tests.
  5471. 681.92 s [vector] sequence_: OK (0.01s)
  5472. 681.92 s [vector] +++ OK, passed 100 tests.
  5473. 681.92 s [vector] glength: OK
  5474. 681.92 s [vector] +++ OK, passed 100 tests.
  5475. 681.92 s [vector] and: OK
  5476. 681.92 s [vector] +++ OK, passed 100 tests.
  5477. 681.92 s [vector] or: OK
  5478. 681.93 s [vector] +++ OK, passed 100 tests.
  5479. 681.93 s [vector] Int
  5480. 681.93 s [vector] fromList.toList == id: OK
  5481. 681.93 s [vector] +++ OK, passed 100 tests.
  5482. 681.93 s [vector] toList.fromList == id: OK
  5483. 681.93 s [vector] +++ OK, passed 100 tests.
  5484. 681.93 s [vector] unstream.stream == id: OK
  5485. 681.93 s [vector] +++ OK, passed 100 tests.
  5486. 681.93 s [vector] stream.unstream == id: OK
  5487. 681.93 s [vector] +++ OK, passed 100 tests.
  5488. 681.93 s [vector] eq: OK
  5489. 681.93 s [vector] +++ OK, passed 100 tests.
  5490. 681.93 s [vector] length: OK
  5491. 681.93 s [vector] +++ OK, passed 100 tests.
  5492. 681.93 s [vector] null: OK
  5493. 681.93 s [vector] +++ OK, passed 100 tests.
  5494. 681.93 s [vector] index: OK
  5495. 681.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5496. 681.93 s [vector] safeIndex: OK
  5497. 681.93 s [vector] +++ OK, passed 100 tests.
  5498. 681.93 s [vector] head: OK
  5499. 681.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5500. 681.93 s [vector] last: OK
  5501. 681.93 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5502. 681.93 s [vector] unsafeIndex: OK
  5503. 681.93 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5504. 681.93 s [vector] unsafeHead: OK
  5505. 681.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5506. 681.93 s [vector] unsafeLast: OK
  5507. 681.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5508. 681.93 s [vector] slice: OK
  5509. 681.93 s [vector] +++ OK, passed 100 tests.
  5510. 681.93 s [vector] init: OK
  5511. 681.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5512. 681.93 s [vector] tail: OK
  5513. 681.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5514. 681.94 s [vector] take: OK
  5515. 681.94 s [vector] +++ OK, passed 100 tests.
  5516. 681.94 s [vector] drop: OK
  5517. 681.94 s [vector] +++ OK, passed 100 tests.
  5518. 681.94 s [vector] splitAt: OK
  5519. 681.94 s [vector] +++ OK, passed 100 tests.
  5520. 681.94 s [vector] empty: OK
  5521. 681.94 s [vector] +++ OK, passed 100 tests.
  5522. 681.94 s [vector] singleton: OK
  5523. 681.94 s [vector] +++ OK, passed 100 tests.
  5524. 681.94 s [vector] replicate: OK
  5525. 681.94 s [vector] +++ OK, passed 100 tests.
  5526. 681.94 s [vector] generate: OK
  5527. 681.94 s [vector] +++ OK, passed 100 tests.
  5528. 681.94 s [vector] iterateN: OK
  5529. 681.94 s [vector] +++ OK, passed 100 tests.
  5530. 682.04 s [vector] iterateNM: OK (0.09s)
  5531. 682.04 s [vector] +++ OK, passed 100 tests.
  5532. 682.06 s [vector] generateM: OK (0.03s)
  5533. 682.07 s [vector] +++ OK, passed 100 tests.
  5534. 682.08 s [vector] replicateM: OK (0.02s)
  5535. 682.09 s [vector] +++ OK, passed 100 tests.
  5536. 682.09 s [vector] create: OK
  5537. 682.09 s [vector] +++ OK, passed 100 tests.
  5538. 682.09 s [vector] createT: OK
  5539. 682.09 s [vector] +++ OK, passed 100 tests.
  5540. 682.09 s [vector] unfoldr: OK
  5541. 682.09 s [vector] +++ OK, passed 100 tests.
  5542. 682.09 s [vector] unfoldrN: OK
  5543. 682.09 s [vector] +++ OK, passed 100 tests.
  5544. 682.10 s [vector] unfoldrExactN: OK
  5545. 682.11 s [vector] +++ OK, passed 100 tests.
  5546. 682.11 s [vector] unfoldrM: OK
  5547. 682.11 s [vector] +++ OK, passed 100 tests.
  5548. 682.11 s [vector] unfoldrNM: OK
  5549. 682.11 s [vector] +++ OK, passed 100 tests.
  5550. 682.14 s [vector] unfoldrExactNM: OK (0.05s)
  5551. 682.14 s [vector] +++ OK, passed 100 tests.
  5552. 682.15 s [vector] constructN: OK
  5553. 682.15 s [vector] +++ OK, passed 100 tests.
  5554. 682.16 s [vector] constructrN: OK
  5555. 682.16 s [vector] +++ OK, passed 100 tests.
  5556. 682.16 s [vector] cons: OK
  5557. 682.16 s [vector] +++ OK, passed 100 tests.
  5558. 682.16 s [vector] snoc: OK
  5559. 682.16 s [vector] +++ OK, passed 100 tests.
  5560. 682.16 s [vector] append: OK
  5561. 682.17 s [vector] +++ OK, passed 100 tests.
  5562. 682.18 s [vector] concat: OK (0.02s)
  5563. 682.18 s [vector] +++ OK, passed 100 tests.
  5564. 682.18 s [vector] force: OK
  5565. 682.18 s [vector] +++ OK, passed 100 tests.
  5566. 682.19 s [vector] upd: OK
  5567. 682.19 s [vector] +++ OK, passed 100 tests.
  5568. 682.19 s [vector] accum: OK
  5569. 682.19 s [vector] +++ OK, passed 100 tests.
  5570. 682.20 s [vector] reverse: OK
  5571. 682.20 s [vector] +++ OK, passed 100 tests.
  5572. 682.21 s [vector] backpermute: OK
  5573. 682.21 s [vector] +++ OK, passed 100 tests.
  5574. 682.23 s [vector] map: OK
  5575. 682.23 s [vector] +++ OK, passed 100 tests.
  5576. 682.23 s [vector] imap: OK
  5577. 682.23 s [vector] +++ OK, passed 100 tests.
  5578. 682.23 s [vector] concatMap: OK
  5579. 682.23 s [vector] +++ OK, passed 100 tests.
  5580. 682.24 s [vector] mapM: OK
  5581. 682.24 s [vector] +++ OK, passed 100 tests.
  5582. 682.24 s [vector] mapM_: OK (0.03s)
  5583. 682.24 s [vector] +++ OK, passed 100 tests.
  5584. 682.24 s [vector] forM: OK
  5585. 682.24 s [vector] +++ OK, passed 100 tests.
  5586. 682.27 s [vector] forM_: OK (0.02s)
  5587. 682.27 s [vector] +++ OK, passed 100 tests.
  5588. 682.28 s [vector] imapM: OK
  5589. 682.28 s [vector] +++ OK, passed 100 tests.
  5590. 682.29 s [vector] imapM_: OK (0.02s)
  5591. 682.29 s [vector] +++ OK, passed 100 tests.
  5592. 682.29 s [vector] zipWith: OK
  5593. 682.29 s [vector] +++ OK, passed 100 tests.
  5594. 682.30 s [vector] zipWith3: OK
  5595. 682.30 s [vector] +++ OK, passed 100 tests.
  5596. 682.30 s [vector] izipWith: OK
  5597. 682.30 s [vector] +++ OK, passed 100 tests.
  5598. 682.30 s [vector] izipWith3: OK
  5599. 682.30 s [vector] +++ OK, passed 100 tests.
  5600. 682.32 s [vector] izipWithM: OK
  5601. 682.32 s [vector] +++ OK, passed 100 tests.
  5602. 682.34 s [vector] izipWithM_: OK (0.01s)
  5603. 682.34 s [vector] +++ OK, passed 100 tests.
  5604. 682.36 s [vector] zipWithM: OK
  5605. 682.37 s [vector] +++ OK, passed 100 tests.
  5606. 682.37 s [vector] zipWithM_: OK (0.02s)
  5607. 682.37 s [vector] +++ OK, passed 100 tests.
  5608. 682.37 s [vector] filter: OK
  5609. 682.37 s [vector] +++ OK, passed 100 tests.
  5610. 682.37 s [vector] ifilter: OK
  5611. 682.37 s [vector] +++ OK, passed 100 tests.
  5612. 682.37 s [vector] filterM: OK (0.03s)
  5613. 682.37 s [vector] +++ OK, passed 100 tests.
  5614. 682.37 s [vector] uniq: OK
  5615. 682.37 s [vector] +++ OK, passed 100 tests.
  5616. 682.38 s [vector] mapMaybe: OK
  5617. 682.38 s [vector] +++ OK, passed 100 tests.
  5618. 682.38 s [vector] imapMaybe: OK
  5619. 682.38 s [vector] +++ OK, passed 100 tests.
  5620. 682.38 s [vector] takeWhile: OK
  5621. 682.38 s [vector] +++ OK, passed 100 tests.
  5622. 682.38 s [vector] dropWhile: OK
  5623. 682.38 s [vector] +++ OK, passed 100 tests.
  5624. 682.38 s [vector] partition: OK
  5625. 682.38 s [vector] +++ OK, passed 100 tests.
  5626. 682.38 s [vector] partitionWith: OK
  5627. 682.39 s [vector] +++ OK, passed 100 tests.
  5628. 682.39 s [vector] span: OK
  5629. 682.39 s [vector] +++ OK, passed 100 tests.
  5630. 682.39 s [vector] break: OK
  5631. 682.39 s [vector] +++ OK, passed 100 tests.
  5632. 682.39 s [vector] spanR: OK
  5633. 682.39 s [vector] +++ OK, passed 100 tests.
  5634. 682.39 s [vector] breakR: OK
  5635. 682.39 s [vector] +++ OK, passed 100 tests.
  5636. 682.39 s [vector] groupBy: OK
  5637. 682.39 s [vector] +++ OK, passed 100 tests.
  5638. 682.39 s [vector] elem: OK
  5639. 682.39 s [vector] +++ OK, passed 100 tests.
  5640. 682.39 s [vector] notElem: OK
  5641. 682.39 s [vector] +++ OK, passed 100 tests.
  5642. 682.39 s [vector] find: OK
  5643. 682.39 s [vector] +++ OK, passed 100 tests.
  5644. 682.39 s [vector] findIndex: OK
  5645. 682.39 s [vector] +++ OK, passed 100 tests.
  5646. 682.40 s [vector] findIndexR: OK
  5647. 682.40 s [vector] +++ OK, passed 100 tests.
  5648. 682.40 s [vector] findIndices: OK
  5649. 682.40 s [vector] +++ OK, passed 100 tests.
  5650. 682.40 s [vector] elemIndex: OK
  5651. 682.40 s [vector] +++ OK, passed 100 tests.
  5652. 682.40 s [vector] elemIndices: OK
  5653. 682.40 s [vector] +++ OK, passed 100 tests.
  5654. 682.41 s [vector] foldl: OK
  5655. 682.41 s [vector] +++ OK, passed 100 tests.
  5656. 682.41 s [vector] foldl1: OK
  5657. 682.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5658. 682.42 s [vector] foldl': OK
  5659. 682.42 s [vector] +++ OK, passed 100 tests.
  5660. 682.42 s [vector] foldl1': OK
  5661. 682.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5662. 682.42 s [vector] foldr: OK
  5663. 682.42 s [vector] +++ OK, passed 100 tests.
  5664. 682.43 s [vector] foldr1: OK
  5665. 682.43 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5666. 682.44 s [vector] foldr': OK
  5667. 682.44 s [vector] +++ OK, passed 100 tests.
  5668. 682.44 s [vector] foldr1': OK
  5669. 682.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5670. 682.44 s [vector] ifoldl: OK
  5671. 682.44 s [vector] +++ OK, passed 100 tests.
  5672. 682.45 s [vector] ifoldl': OK
  5673. 682.45 s [vector] +++ OK, passed 100 tests.
  5674. 682.46 s [vector] ifoldr: OK
  5675. 682.46 s [vector] +++ OK, passed 100 tests.
  5676. 682.46 s [vector] ifoldr': OK
  5677. 682.46 s [vector] +++ OK, passed 100 tests.
  5678. 682.48 s [vector] ifoldM: OK
  5679. 682.48 s [vector] +++ OK, passed 100 tests.
  5680. 682.49 s [vector] ifoldM': OK
  5681. 682.49 s [vector] +++ OK, passed 100 tests.
  5682. 682.53 s [vector] ifoldM_: OK (0.03s)
  5683. 682.53 s [vector] +++ OK, passed 100 tests.
  5684. 682.55 s [vector] ifoldM'_: OK (0.05s)
  5685. 682.55 s [vector] +++ OK, passed 100 tests.
  5686. 682.55 s [vector] all: OK
  5687. 682.55 s [vector] +++ OK, passed 100 tests.
  5688. 682.55 s [vector] any: OK
  5689. 682.55 s [vector] +++ OK, passed 100 tests.
  5690. 682.56 s [vector] prescanl: OK
  5691. 682.56 s [vector] +++ OK, passed 100 tests.
  5692. 682.57 s [vector] prescanl': OK
  5693. 682.57 s [vector] +++ OK, passed 100 tests.
  5694. 682.57 s [vector] postscanl: OK
  5695. 682.57 s [vector] +++ OK, passed 100 tests.
  5696. 682.58 s [vector] postscanl': OK
  5697. 682.58 s [vector] +++ OK, passed 100 tests.
  5698. 682.58 s [vector] scanl: OK
  5699. 682.58 s [vector] +++ OK, passed 100 tests.
  5700. 682.59 s [vector] scanl': OK
  5701. 682.59 s [vector] +++ OK, passed 100 tests.
  5702. 682.60 s [vector] scanl1: OK
  5703. 682.60 s [vector] +++ OK, passed 100 tests.
  5704. 682.60 s [vector] scanl1': OK
  5705. 682.60 s [vector] +++ OK, passed 100 tests.
  5706. 682.60 s [vector] iscanl: OK
  5707. 682.60 s [vector] +++ OK, passed 100 tests.
  5708. 682.61 s [vector] iscanl': OK
  5709. 682.61 s [vector] +++ OK, passed 100 tests.
  5710. 682.61 s [vector] prescanr: OK
  5711. 682.61 s [vector] +++ OK, passed 100 tests.
  5712. 682.62 s [vector] prescanr': OK
  5713. 682.62 s [vector] +++ OK, passed 100 tests.
  5714. 682.62 s [vector] postscanr: OK
  5715. 682.62 s [vector] +++ OK, passed 100 tests.
  5716. 682.63 s [vector] postscanr': OK
  5717. 682.63 s [vector] +++ OK, passed 100 tests.
  5718. 682.64 s [vector] scanr: OK
  5719. 682.64 s [vector] +++ OK, passed 100 tests.
  5720. 682.65 s [vector] scanr': OK
  5721. 682.65 s [vector] +++ OK, passed 100 tests.
  5722. 682.65 s [vector] scanr1: OK
  5723. 682.65 s [vector] +++ OK, passed 100 tests.
  5724. 682.65 s [vector] scanr1': OK
  5725. 682.65 s [vector] +++ OK, passed 100 tests.
  5726. 682.65 s [vector] iscanr: OK
  5727. 682.65 s [vector] +++ OK, passed 100 tests.
  5728. 682.66 s [vector] iscanr': OK
  5729. 682.66 s [vector] +++ OK, passed 100 tests.
  5730. 682.66 s [vector] mut_read: OK
  5731. 682.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5732. 682.66 s [vector] mut_write: OK
  5733. 682.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5734. 682.67 s [vector] mut_modify: OK
  5735. 682.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5736. 682.68 s [vector] mut_generate: OK
  5737. 682.69 s [vector] +++ OK, passed 100 tests.
  5738. 682.70 s [vector] mut_generateM: OK (0.02s)
  5739. 682.70 s [vector] +++ OK, passed 100 tests.
  5740. 682.73 s [vector] mut_mapM_: OK (0.03s)
  5741. 682.73 s [vector] +++ OK, passed 100 tests.
  5742. 682.76 s [vector] mut_imapM_: OK (0.04s)
  5743. 682.77 s [vector] +++ OK, passed 100 tests.
  5744. 682.79 s [vector] mut_forM_: OK (0.03s)
  5745. 682.79 s [vector] +++ OK, passed 100 tests.
  5746. 682.82 s [vector] mut_iforM_: OK (0.03s)
  5747. 682.82 s [vector] +++ OK, passed 100 tests.
  5748. 682.82 s [vector] mut_foldr: OK
  5749. 682.82 s [vector] +++ OK, passed 100 tests.
  5750. 682.82 s [vector] mut_foldr': OK
  5751. 682.82 s [vector] +++ OK, passed 100 tests.
  5752. 682.83 s [vector] mut_foldl: OK
  5753. 682.84 s [vector] +++ OK, passed 100 tests.
  5754. 682.84 s [vector] mut_foldl': OK
  5755. 682.84 s [vector] +++ OK, passed 100 tests.
  5756. 682.84 s [vector] mut_ifoldr: OK
  5757. 682.85 s [vector] +++ OK, passed 100 tests.
  5758. 682.85 s [vector] mut_ifoldr': OK
  5759. 682.85 s [vector] +++ OK, passed 100 tests.
  5760. 682.85 s [vector] mut_ifoldl: OK
  5761. 682.85 s [vector] +++ OK, passed 100 tests.
  5762. 682.86 s [vector] mut_ifoldl': OK
  5763. 682.86 s [vector] +++ OK, passed 100 tests.
  5764. 682.86 s [vector] mut_foldM: OK
  5765. 682.87 s [vector] +++ OK, passed 100 tests.
  5766. 682.87 s [vector] mut_foldM': OK
  5767. 682.87 s [vector] +++ OK, passed 100 tests.
  5768. 682.87 s [vector] mut_foldrM: OK
  5769. 682.88 s [vector] +++ OK, passed 100 tests.
  5770. 682.88 s [vector] mut_foldrM': OK
  5771. 682.88 s [vector] +++ OK, passed 100 tests.
  5772. 682.88 s [vector] mut_ifoldM: OK
  5773. 682.88 s [vector] +++ OK, passed 100 tests.
  5774. 682.88 s [vector] mut_ifoldM': OK
  5775. 682.88 s [vector] +++ OK, passed 100 tests.
  5776. 682.88 s [vector] mut_ifoldrM: OK
  5777. 682.88 s [vector] +++ OK, passed 100 tests.
  5778. 682.89 s [vector] mut_ifoldrM': OK
  5779. 682.89 s [vector] +++ OK, passed 100 tests.
  5780. 682.89 s [vector] compare: OK
  5781. 682.89 s [vector] +++ OK, passed 100 tests.
  5782. 682.89 s [vector] maximum: OK
  5783. 682.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5784. 682.89 s [vector] minimum: OK
  5785. 682.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5786. 682.89 s [vector] minIndex: OK
  5787. 682.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5788. 682.89 s [vector] maxIndex: OK
  5789. 682.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5790. 682.89 s [vector] maximumBy: OK
  5791. 682.89 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5792. 682.89 s [vector] minimumBy: OK
  5793. 682.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5794. 682.89 s [vector] maximumOn: OK
  5795. 682.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5796. 682.89 s [vector] minimumOn: OK
  5797. 682.89 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5798. 682.89 s [vector] maxIndexBy: OK
  5799. 682.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5800. 682.89 s [vector] minIndexBy: OK
  5801. 682.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5802. 682.90 s [vector] ListFirstMaxIndexWins: OK
  5803. 682.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5804. 682.90 s [vector] FalseListFirstMaxIndexWins: OK
  5805. 682.90 s [vector] +++ OK, failed as expected. (after 1 test):
  5806. 682.90 s [vector] Exception:
  5807. 682.90 s [vector] Prelude.foldr1: empty list
  5808. 682.90 s [vector] CallStack (from HasCallStack):
  5809. 682.90 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5810. 682.90 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5811. 682.90 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5812. 682.90 s [vector] []
  5813. 682.90 s [vector] zip: OK
  5814. 682.90 s [vector] +++ OK, passed 100 tests.
  5815. 682.90 s [vector] zip3: OK
  5816. 682.90 s [vector] +++ OK, passed 100 tests.
  5817. 682.90 s [vector] unzip: OK
  5818. 682.90 s [vector] +++ OK, passed 100 tests.
  5819. 682.90 s [vector] unzip3: OK
  5820. 682.90 s [vector] +++ OK, passed 100 tests.
  5821. 682.90 s [vector] indexed: OK
  5822. 682.90 s [vector] +++ OK, passed 100 tests.
  5823. 682.90 s [vector] update: OK
  5824. 682.90 s [vector] +++ OK, passed 100 tests.
  5825. 682.92 s [vector] concat: OK (0.01s)
  5826. 682.92 s [vector] +++ OK, passed 100 tests.
  5827. 682.92 s [vector] mempty: OK
  5828. 682.92 s [vector] +++ OK, passed 100 tests.
  5829. 682.92 s [vector] mappend: OK
  5830. 682.93 s [vector] +++ OK, passed 100 tests.
  5831. 682.93 s [vector] mconcat: OK (0.01s)
  5832. 682.93 s [vector] +++ OK, passed 100 tests.
  5833. 682.93 s [vector] fmap: OK
  5834. 682.93 s [vector] +++ OK, passed 100 tests.
  5835. 682.93 s [vector] return: OK
  5836. 682.93 s [vector] +++ OK, passed 100 tests.
  5837. 682.95 s [vector] bind: OK (0.02s)
  5838. 682.95 s [vector] +++ OK, passed 100 tests.
  5839. 682.95 s [vector] mzip: OK
  5840. 682.95 s [vector] +++ OK, passed 100 tests.
  5841. 682.95 s [vector] munzip: OK
  5842. 682.96 s [vector] +++ OK, passed 100 tests.
  5843. 682.97 s [vector] applicative_pure: OK
  5844. 682.97 s [vector] +++ OK, passed 100 tests.
  5845. 682.98 s [vector] applicative_appl: OK (0.03s)
  5846. 682.98 s [vector] +++ OK, passed 100 tests.
  5847. 682.98 s [vector] alternative_empty: OK
  5848. 682.98 s [vector] +++ OK, passed 100 tests.
  5849. 682.98 s [vector] alternative_or: OK
  5850. 682.98 s [vector] +++ OK, passed 100 tests.
  5851. 683.02 s [vector] sequence: OK (0.04s)
  5852. 683.02 s [vector] +++ OK, passed 100 tests.
  5853. 683.03 s [vector] sequence_: OK
  5854. 683.03 s [vector] +++ OK, passed 100 tests.
  5855. 683.03 s [vector] glength: OK
  5856. 683.03 s [vector] +++ OK, passed 100 tests.
  5857. 683.03 s [vector] sum: OK
  5858. 683.04 s [vector] +++ OK, passed 100 tests.
  5859. 683.04 s [vector] product: OK
  5860. 683.04 s [vector] +++ OK, passed 100 tests.
  5861. 683.04 s [vector] enumFromN: OK
  5862. 683.04 s [vector] +++ OK, passed 100 tests.
  5863. 683.04 s [vector] enumFromThenN: OK
  5864. 683.04 s [vector] +++ OK, passed 100 tests.
  5865. 683.04 s [vector] enumFromTo: OK
  5866. 683.04 s [vector] +++ OK, passed 100 tests.
  5867. 683.04 s [vector] enumFromThenTo: OK
  5868. 683.04 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5869. 683.04 s [vector] unstream
  5870. 683.04 s [vector] unstream == vunstream (exact): OK
  5871. 683.04 s [vector] +++ OK, passed 100 tests.
  5872. 683.04 s [vector] unstream == vunstream (unknown): OK
  5873. 683.04 s [vector] +++ OK, passed 100 tests.
  5874. 683.04 s [vector] unstreamR ~= vunstream (exact): OK
  5875. 683.04 s [vector] +++ OK, passed 100 tests.
  5876. 683.04 s [vector] unstreamR ~= vunstream (unknown): OK
  5877. 683.04 s [vector] +++ OK, passed 100 tests.
  5878. 683.04 s [vector] Tests.Vector.Unboxed
  5879. 683.04 s [vector] ()
  5880. 683.04 s [vector] fromList.toList == id: OK
  5881. 683.04 s [vector] +++ OK, passed 100 tests.
  5882. 683.04 s [vector] toList.fromList == id: OK
  5883. 683.05 s [vector] +++ OK, passed 100 tests.
  5884. 683.05 s [vector] unstream.stream == id: OK
  5885. 683.05 s [vector] +++ OK, passed 100 tests.
  5886. 683.05 s [vector] stream.unstream == id: OK
  5887. 683.05 s [vector] +++ OK, passed 100 tests.
  5888. 683.05 s [vector] eq: OK
  5889. 683.05 s [vector] +++ OK, passed 100 tests.
  5890. 683.05 s [vector] length: OK
  5891. 683.05 s [vector] +++ OK, passed 100 tests.
  5892. 683.05 s [vector] null: OK
  5893. 683.05 s [vector] +++ OK, passed 100 tests.
  5894. 683.05 s [vector] index: OK
  5895. 683.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5896. 683.05 s [vector] safeIndex: OK
  5897. 683.05 s [vector] +++ OK, passed 100 tests.
  5898. 683.05 s [vector] head: OK
  5899. 683.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5900. 683.05 s [vector] last: OK
  5901. 683.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5902. 683.05 s [vector] unsafeIndex: OK
  5903. 683.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5904. 683.06 s [vector] unsafeHead: OK
  5905. 683.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5906. 683.07 s [vector] unsafeLast: OK
  5907. 683.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5908. 683.07 s [vector] slice: OK
  5909. 683.07 s [vector] +++ OK, passed 100 tests.
  5910. 683.07 s [vector] init: OK
  5911. 683.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5912. 683.07 s [vector] tail: OK
  5913. 683.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5914. 683.08 s [vector] take: OK
  5915. 683.08 s [vector] +++ OK, passed 100 tests.
  5916. 683.08 s [vector] drop: OK
  5917. 683.08 s [vector] +++ OK, passed 100 tests.
  5918. 683.09 s [vector] splitAt: OK
  5919. 683.09 s [vector] +++ OK, passed 100 tests.
  5920. 683.09 s [vector] empty: OK
  5921. 683.09 s [vector] +++ OK, passed 100 tests.
  5922. 683.09 s [vector] singleton: OK
  5923. 683.09 s [vector] +++ OK, passed 100 tests.
  5924. 683.09 s [vector] replicate: OK
  5925. 683.09 s [vector] +++ OK, passed 100 tests.
  5926. 683.10 s [vector] generate: OK
  5927. 683.10 s [vector] +++ OK, passed 100 tests.
  5928. 683.11 s [vector] iterateN: OK
  5929. 683.11 s [vector] +++ OK, passed 100 tests.
  5930. 683.11 s [vector] iterateNM: OK (0.04s)
  5931. 683.11 s [vector] +++ OK, passed 100 tests.
  5932. 683.11 s [vector] generateM: OK
  5933. 683.11 s [vector] +++ OK, passed 100 tests.
  5934. 683.11 s [vector] replicateM: OK
  5935. 683.11 s [vector] +++ OK, passed 100 tests.
  5936. 683.11 s [vector] create: OK
  5937. 683.11 s [vector] +++ OK, passed 100 tests.
  5938. 683.12 s [vector] createT: OK
  5939. 683.12 s [vector] +++ OK, passed 100 tests.
  5940. 683.13 s [vector] unfoldr: OK
  5941. 683.13 s [vector] +++ OK, passed 100 tests.
  5942. 683.13 s [vector] unfoldrN: OK
  5943. 683.13 s [vector] +++ OK, passed 100 tests.
  5944. 683.13 s [vector] unfoldrExactN: OK
  5945. 683.13 s [vector] +++ OK, passed 100 tests.
  5946. 683.13 s [vector] unfoldrM: OK
  5947. 683.13 s [vector] +++ OK, passed 100 tests.
  5948. 683.13 s [vector] unfoldrNM: OK
  5949. 683.13 s [vector] +++ OK, passed 100 tests.
  5950. 683.16 s [vector] unfoldrExactNM: OK (0.04s)
  5951. 683.16 s [vector] +++ OK, passed 100 tests.
  5952. 683.16 s [vector] constructN: OK
  5953. 683.16 s [vector] +++ OK, passed 100 tests.
  5954. 683.16 s [vector] constructrN: OK
  5955. 683.16 s [vector] +++ OK, passed 100 tests.
  5956. 683.16 s [vector] cons: OK
  5957. 683.17 s [vector] +++ OK, passed 100 tests.
  5958. 683.17 s [vector] snoc: OK
  5959. 683.17 s [vector] +++ OK, passed 100 tests.
  5960. 683.17 s [vector] append: OK
  5961. 683.17 s [vector] +++ OK, passed 100 tests.
  5962. 683.17 s [vector] concat: OK
  5963. 683.17 s [vector] +++ OK, passed 100 tests.
  5964. 683.18 s [vector] force: OK
  5965. 683.18 s [vector] +++ OK, passed 100 tests.
  5966. 683.18 s [vector] upd: OK
  5967. 683.18 s [vector] +++ OK, passed 100 tests.
  5968. 683.18 s [vector] accum: OK
  5969. 683.18 s [vector] +++ OK, passed 100 tests.
  5970. 683.18 s [vector] reverse: OK
  5971. 683.18 s [vector] +++ OK, passed 100 tests.
  5972. 683.18 s [vector] backpermute: OK
  5973. 683.18 s [vector] +++ OK, passed 100 tests.
  5974. 683.18 s [vector] map: OK
  5975. 683.18 s [vector] +++ OK, passed 100 tests.
  5976. 683.18 s [vector] imap: OK
  5977. 683.18 s [vector] +++ OK, passed 100 tests.
  5978. 683.18 s [vector] concatMap: OK
  5979. 683.18 s [vector] +++ OK, passed 100 tests.
  5980. 683.19 s [vector] mapM: OK
  5981. 683.19 s [vector] +++ OK, passed 100 tests.
  5982. 683.20 s [vector] mapM_: OK
  5983. 683.20 s [vector] +++ OK, passed 100 tests.
  5984. 683.20 s [vector] forM: OK
  5985. 683.20 s [vector] +++ OK, passed 100 tests.
  5986. 683.21 s [vector] forM_: OK
  5987. 683.21 s [vector] +++ OK, passed 100 tests.
  5988. 683.21 s [vector] imapM: OK
  5989. 683.21 s [vector] +++ OK, passed 100 tests.
  5990. 683.22 s [vector] imapM_: OK
  5991. 683.22 s [vector] +++ OK, passed 100 tests.
  5992. 683.22 s [vector] zipWith: OK
  5993. 683.22 s [vector] +++ OK, passed 100 tests.
  5994. 683.22 s [vector] zipWith3: OK
  5995. 683.22 s [vector] +++ OK, passed 100 tests.
  5996. 683.22 s [vector] izipWith: OK
  5997. 683.22 s [vector] +++ OK, passed 100 tests.
  5998. 683.22 s [vector] izipWith3: OK
  5999. 683.22 s [vector] +++ OK, passed 100 tests.
  6000. 683.22 s [vector] izipWithM: OK
  6001. 683.22 s [vector] +++ OK, passed 100 tests.
  6002. 683.23 s [vector] izipWithM_: OK
  6003. 683.23 s [vector] +++ OK, passed 100 tests.
  6004. 683.23 s [vector] zipWithM: OK
  6005. 683.23 s [vector] +++ OK, passed 100 tests.
  6006. 683.24 s [vector] zipWithM_: OK
  6007. 683.24 s [vector] +++ OK, passed 100 tests.
  6008. 683.24 s [vector] filter: OK
  6009. 683.24 s [vector] +++ OK, passed 100 tests.
  6010. 683.24 s [vector] ifilter: OK
  6011. 683.24 s [vector] +++ OK, passed 100 tests.
  6012. 683.28 s [vector] filterM: OK (0.03s)
  6013. 683.28 s [vector] +++ OK, passed 100 tests.
  6014. 683.28 s [vector] uniq: OK
  6015. 683.28 s [vector] +++ OK, passed 100 tests.
  6016. 683.28 s [vector] mapMaybe: OK
  6017. 683.28 s [vector] +++ OK, passed 100 tests.
  6018. 683.29 s [vector] imapMaybe: OK
  6019. 683.29 s [vector] +++ OK, passed 100 tests.
  6020. 683.29 s [vector] takeWhile: OK
  6021. 683.29 s [vector] +++ OK, passed 100 tests.
  6022. 683.29 s [vector] dropWhile: OK
  6023. 683.29 s [vector] +++ OK, passed 100 tests.
  6024. 683.29 s [vector] partition: OK
  6025. 683.29 s [vector] +++ OK, passed 100 tests.
  6026. 683.29 s [vector] partitionWith: OK
  6027. 683.29 s [vector] +++ OK, passed 100 tests.
  6028. 683.29 s [vector] span: OK
  6029. 683.29 s [vector] +++ OK, passed 100 tests.
  6030. 683.29 s [vector] break: OK
  6031. 683.29 s [vector] +++ OK, passed 100 tests.
  6032. 683.29 s [vector] spanR: OK
  6033. 683.29 s [vector] +++ OK, passed 100 tests.
  6034. 683.29 s [vector] breakR: OK
  6035. 683.29 s [vector] +++ OK, passed 100 tests.
  6036. 683.29 s [vector] groupBy: OK
  6037. 683.29 s [vector] +++ OK, passed 100 tests.
  6038. 683.29 s [vector] elem: OK
  6039. 683.29 s [vector] +++ OK, passed 100 tests.
  6040. 683.29 s [vector] notElem: OK
  6041. 683.29 s [vector] +++ OK, passed 100 tests.
  6042. 683.29 s [vector] find: OK
  6043. 683.29 s [vector] +++ OK, passed 100 tests.
  6044. 683.29 s [vector] findIndex: OK
  6045. 683.29 s [vector] +++ OK, passed 100 tests.
  6046. 683.29 s [vector] findIndexR: OK
  6047. 683.29 s [vector] +++ OK, passed 100 tests.
  6048. 683.29 s [vector] findIndices: OK
  6049. 683.29 s [vector] +++ OK, passed 100 tests.
  6050. 683.30 s [vector] elemIndex: OK
  6051. 683.30 s [vector] +++ OK, passed 100 tests.
  6052. 683.30 s [vector] elemIndices: OK
  6053. 683.30 s [vector] +++ OK, passed 100 tests.
  6054. 683.30 s [vector] foldl: OK
  6055. 683.30 s [vector] +++ OK, passed 100 tests.
  6056. 683.30 s [vector] foldl1: OK
  6057. 683.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6058. 683.30 s [vector] foldl': OK
  6059. 683.30 s [vector] +++ OK, passed 100 tests.
  6060. 683.30 s [vector] foldl1': OK
  6061. 683.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6062. 683.30 s [vector] foldr: OK
  6063. 683.30 s [vector] +++ OK, passed 100 tests.
  6064. 683.30 s [vector] foldr1: OK
  6065. 683.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6066. 683.30 s [vector] foldr': OK
  6067. 683.30 s [vector] +++ OK, passed 100 tests.
  6068. 683.30 s [vector] foldr1': OK
  6069. 683.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6070. 683.30 s [vector] ifoldl: OK
  6071. 683.30 s [vector] +++ OK, passed 100 tests.
  6072. 683.30 s [vector] ifoldl': OK
  6073. 683.30 s [vector] +++ OK, passed 100 tests.
  6074. 683.30 s [vector] ifoldr: OK
  6075. 683.30 s [vector] +++ OK, passed 100 tests.
  6076. 683.30 s [vector] ifoldr': OK
  6077. 683.30 s [vector] +++ OK, passed 100 tests.
  6078. 683.30 s [vector] ifoldM: OK
  6079. 683.30 s [vector] +++ OK, passed 100 tests.
  6080. 683.30 s [vector] ifoldM': OK
  6081. 683.30 s [vector] +++ OK, passed 100 tests.
  6082. 683.32 s [vector] ifoldM_: OK (0.01s)
  6083. 683.62 s [vector] +++ OK, passed 100 tests.
  6084. 683.62 s [vector] ifoldM'_: OK
  6085. 683.62 s [vector] +++ OK, passed 100 tests.
  6086. 683.63 s [vector] all: OK
  6087. 683.63 s [vector] +++ OK, passed 100 tests.
  6088. 683.63 s [vector] any: OK
  6089. 683.63 s [vector] +++ OK, passed 100 tests.
  6090. 683.63 s [vector] prescanl: OK
  6091. 683.63 s [vector] +++ OK, passed 100 tests.
  6092. 683.63 s [vector] prescanl': OK
  6093. 683.63 s [vector] +++ OK, passed 100 tests.
  6094. 683.63 s [vector] postscanl: OK
  6095. 683.63 s [vector] +++ OK, passed 100 tests.
  6096. 683.63 s [vector] postscanl': OK
  6097. 683.63 s [vector] +++ OK, passed 100 tests.
  6098. 683.63 s [vector] scanl: OK
  6099. 683.63 s [vector] +++ OK, passed 100 tests.
  6100. 683.63 s [vector] scanl': OK
  6101. 683.63 s [vector] +++ OK, passed 100 tests.
  6102. 683.63 s [vector] scanl1: OK
  6103. 683.63 s [vector] +++ OK, passed 100 tests.
  6104. 683.63 s [vector] scanl1': OK
  6105. 683.63 s [vector] +++ OK, passed 100 tests.
  6106. 683.63 s [vector] iscanl: OK
  6107. 683.63 s [vector] +++ OK, passed 100 tests.
  6108. 683.63 s [vector] iscanl': OK
  6109. 683.63 s [vector] +++ OK, passed 100 tests.
  6110. 683.63 s [vector] prescanr: OK
  6111. 683.63 s [vector] +++ OK, passed 100 tests.
  6112. 683.63 s [vector] prescanr': OK
  6113. 683.63 s [vector] +++ OK, passed 100 tests.
  6114. 683.63 s [vector] postscanr: OK
  6115. 683.63 s [vector] +++ OK, passed 100 tests.
  6116. 683.63 s [vector] postscanr': OK
  6117. 683.63 s [vector] +++ OK, passed 100 tests.
  6118. 683.63 s [vector] scanr: OK
  6119. 683.63 s [vector] +++ OK, passed 100 tests.
  6120. 683.63 s [vector] scanr': OK
  6121. 683.63 s [vector] +++ OK, passed 100 tests.
  6122. 683.63 s [vector] scanr1: OK
  6123. 683.63 s [vector] +++ OK, passed 100 tests.
  6124. 683.63 s [vector] scanr1': OK
  6125. 683.63 s [vector] +++ OK, passed 100 tests.
  6126. 683.63 s [vector] iscanr: OK
  6127. 683.63 s [vector] +++ OK, passed 100 tests.
  6128. 683.63 s [vector] iscanr': OK
  6129. 683.63 s [vector] +++ OK, passed 100 tests.
  6130. 683.63 s [vector] mut_read: OK
  6131. 683.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6132. 683.63 s [vector] mut_write: OK
  6133. 683.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6134. 683.63 s [vector] mut_modify: OK
  6135. 683.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6136. 683.63 s [vector] mut_generate: OK
  6137. 683.63 s [vector] +++ OK, passed 100 tests.
  6138. 683.63 s [vector] mut_generateM: OK
  6139. 683.63 s [vector] +++ OK, passed 100 tests.
  6140. 683.63 s [vector] mut_mapM_: OK
  6141. 683.63 s [vector] +++ OK, passed 100 tests.
  6142. 683.63 s [vector] mut_imapM_: OK (0.01s)
  6143. 683.63 s [vector] +++ OK, passed 100 tests.
  6144. 683.63 s [vector] mut_forM_: OK (0.02s)
  6145. 683.63 s [vector] +++ OK, passed 100 tests.
  6146. 683.63 s [vector] mut_iforM_: OK (0.02s)
  6147. 683.63 s [vector] +++ OK, passed 100 tests.
  6148. 683.63 s [vector] mut_foldr: OK
  6149. 683.63 s [vector] +++ OK, passed 100 tests.
  6150. 683.63 s [vector] mut_foldr': OK
  6151. 683.63 s [vector] +++ OK, passed 100 tests.
  6152. 683.63 s [vector] mut_foldl: OK
  6153. 683.63 s [vector] +++ OK, passed 100 tests.
  6154. 683.63 s [vector] mut_foldl': OK
  6155. 683.63 s [vector] +++ OK, passed 100 tests.
  6156. 683.63 s [vector] mut_ifoldr: OK
  6157. 683.63 s [vector] +++ OK, passed 100 tests.
  6158. 683.63 s [vector] mut_ifoldr': OK
  6159. 683.63 s [vector] +++ OK, passed 100 tests.
  6160. 683.63 s [vector] mut_ifoldl: OK
  6161. 683.63 s [vector] +++ OK, passed 100 tests.
  6162. 683.63 s [vector] mut_ifoldl': OK
  6163. 683.63 s [vector] +++ OK, passed 100 tests.
  6164. 683.63 s [vector] mut_foldM: OK
  6165. 683.63 s [vector] +++ OK, passed 100 tests.
  6166. 683.63 s [vector] mut_foldM': OK
  6167. 683.63 s [vector] +++ OK, passed 100 tests.
  6168. 683.63 s [vector] mut_foldrM: OK
  6169. 683.63 s [vector] +++ OK, passed 100 tests.
  6170. 683.63 s [vector] mut_foldrM': OK
  6171. 683.63 s [vector] +++ OK, passed 100 tests.
  6172. 683.63 s [vector] mut_ifoldM: OK
  6173. 683.63 s [vector] +++ OK, passed 100 tests.
  6174. 683.63 s [vector] mut_ifoldM': OK
  6175. 683.63 s [vector] +++ OK, passed 100 tests.
  6176. 683.63 s [vector] mut_ifoldrM: OK
  6177. 683.63 s [vector] +++ OK, passed 100 tests.
  6178. 683.63 s [vector] mut_ifoldrM': OK
  6179. 683.63 s [vector] +++ OK, passed 100 tests.
  6180. 683.63 s [vector] compare: OK
  6181. 683.63 s [vector] +++ OK, passed 100 tests.
  6182. 683.63 s [vector] maximum: OK
  6183. 683.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6184. 683.63 s [vector] minimum: OK
  6185. 683.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6186. 683.63 s [vector] minIndex: OK
  6187. 683.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6188. 683.63 s [vector] maxIndex: OK
  6189. 683.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6190. 683.63 s [vector] maximumBy: OK
  6191. 683.63 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6192. 683.63 s [vector] minimumBy: OK
  6193. 683.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6194. 683.63 s [vector] maximumOn: OK
  6195. 683.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6196. 683.63 s [vector] minimumOn: OK
  6197. 683.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6198. 683.63 s [vector] maxIndexBy: OK
  6199. 683.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6200. 683.63 s [vector] minIndexBy: OK
  6201. 683.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6202. 683.63 s [vector] ListFirstMaxIndexWins: OK
  6203. 683.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6204. 683.64 s [vector] FalseListFirstMaxIndexWins: OK
  6205. 683.64 s [vector] +++ OK, failed as expected. (after 1 test):
  6206. 683.64 s [vector] Exception:
  6207. 683.64 s [vector] Prelude.foldr1: empty list
  6208. 683.64 s [vector] CallStack (from HasCallStack):
  6209. 683.64 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6210. 683.64 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6211. 683.64 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6212. 683.64 s [vector] []
  6213. 683.64 s [vector] zip: OK
  6214. 683.64 s [vector] +++ OK, passed 100 tests.
  6215. 683.64 s [vector] zip3: OK
  6216. 683.64 s [vector] +++ OK, passed 100 tests.
  6217. 683.64 s [vector] unzip: OK
  6218. 683.64 s [vector] +++ OK, passed 100 tests.
  6219. 683.64 s [vector] unzip3: OK
  6220. 683.64 s [vector] +++ OK, passed 100 tests.
  6221. 683.64 s [vector] indexed: OK
  6222. 683.64 s [vector] +++ OK, passed 100 tests.
  6223. 683.64 s [vector] update: OK
  6224. 683.64 s [vector] +++ OK, passed 100 tests.
  6225. 683.64 s [vector] mempty: OK
  6226. 683.64 s [vector] +++ OK, passed 100 tests.
  6227. 683.64 s [vector] mappend: OK
  6228. 683.64 s [vector] +++ OK, passed 100 tests.
  6229. 683.64 s [vector] mconcat: OK (0.01s)
  6230. 683.64 s [vector] +++ OK, passed 100 tests.
  6231. 683.64 s [vector] glength: OK
  6232. 683.64 s [vector] +++ OK, passed 100 tests.
  6233. 683.64 s [vector] (Bool)
  6234. 683.64 s [vector] fromList.toList == id: OK
  6235. 683.64 s [vector] +++ OK, passed 100 tests.
  6236. 683.64 s [vector] toList.fromList == id: OK
  6237. 683.64 s [vector] +++ OK, passed 100 tests.
  6238. 683.64 s [vector] unstream.stream == id: OK
  6239. 683.64 s [vector] +++ OK, passed 100 tests.
  6240. 683.64 s [vector] stream.unstream == id: OK
  6241. 683.64 s [vector] +++ OK, passed 100 tests.
  6242. 683.64 s [vector] eq: OK
  6243. 683.64 s [vector] +++ OK, passed 100 tests.
  6244. 683.64 s [vector] length: OK
  6245. 683.64 s [vector] +++ OK, passed 100 tests.
  6246. 683.64 s [vector] null: OK
  6247. 683.64 s [vector] +++ OK, passed 100 tests.
  6248. 683.64 s [vector] index: OK
  6249. 683.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6250. 683.64 s [vector] safeIndex: OK
  6251. 683.64 s [vector] +++ OK, passed 100 tests.
  6252. 683.64 s [vector] head: OK
  6253. 683.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6254. 683.64 s [vector] last: OK
  6255. 683.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6256. 683.64 s [vector] unsafeIndex: OK
  6257. 683.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6258. 683.64 s [vector] unsafeHead: OK
  6259. 683.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6260. 683.64 s [vector] unsafeLast: OK
  6261. 683.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6262. 683.64 s [vector] slice: OK
  6263. 683.64 s [vector] +++ OK, passed 100 tests.
  6264. 683.64 s [vector] init: OK
  6265. 683.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6266. 683.64 s [vector] tail: OK
  6267. 683.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6268. 683.64 s [vector] take: OK
  6269. 683.64 s [vector] +++ OK, passed 100 tests.
  6270. 683.64 s [vector] drop: OK
  6271. 683.64 s [vector] +++ OK, passed 100 tests.
  6272. 683.64 s [vector] splitAt: OK
  6273. 683.64 s [vector] +++ OK, passed 100 tests.
  6274. 683.64 s [vector] empty: OK
  6275. 683.64 s [vector] +++ OK, passed 100 tests.
  6276. 683.64 s [vector] singleton: OK
  6277. 683.64 s [vector] +++ OK, passed 100 tests.
  6278. 683.64 s [vector] replicate: OK
  6279. 683.64 s [vector] +++ OK, passed 100 tests.
  6280. 683.64 s [vector] generate: OK
  6281. 683.64 s [vector] +++ OK, passed 100 tests.
  6282. 683.64 s [vector] iterateN: OK
  6283. 683.64 s [vector] +++ OK, passed 100 tests.
  6284. 683.64 s [vector] iterateNM: OK (0.02s)
  6285. 683.64 s [vector] +++ OK, passed 100 tests.
  6286. 683.64 s [vector] generateM: OK (0.01s)
  6287. 683.64 s [vector] +++ OK, passed 100 tests.
  6288. 683.64 s [vector] replicateM: OK (0.01s)
  6289. 683.64 s [vector] +++ OK, passed 100 tests.
  6290. 683.64 s [vector] create: OK
  6291. 683.64 s [vector] +++ OK, passed 100 tests.
  6292. 683.64 s [vector] createT: OK
  6293. 683.64 s [vector] +++ OK, passed 100 tests.
  6294. 683.64 s [vector] unfoldr: OK
  6295. 683.64 s [vector] +++ OK, passed 100 tests.
  6296. 683.64 s [vector] unfoldrN: OK
  6297. 683.64 s [vector] +++ OK, passed 100 tests.
  6298. 683.64 s [vector] unfoldrExactN: OK
  6299. 683.64 s [vector] +++ OK, passed 100 tests.
  6300. 683.64 s [vector] unfoldrM: OK
  6301. 683.64 s [vector] +++ OK, passed 100 tests.
  6302. 683.64 s [vector] unfoldrNM: OK
  6303. 683.64 s [vector] +++ OK, passed 100 tests.
  6304. 683.64 s [vector] unfoldrExactNM: OK (0.02s)
  6305. 683.64 s [vector] +++ OK, passed 100 tests.
  6306. 683.64 s [vector] constructN: OK
  6307. 683.64 s [vector] +++ OK, passed 100 tests.
  6308. 683.64 s [vector] constructrN: OK
  6309. 683.64 s [vector] +++ OK, passed 100 tests.
  6310. 683.64 s [vector] cons: OK
  6311. 683.64 s [vector] +++ OK, passed 100 tests.
  6312. 683.64 s [vector] snoc: OK
  6313. 683.64 s [vector] +++ OK, passed 100 tests.
  6314. 683.64 s [vector] append: OK
  6315. 683.64 s [vector] +++ OK, passed 100 tests.
  6316. 683.64 s [vector] concat: OK (0.02s)
  6317. 683.64 s [vector] +++ OK, passed 100 tests.
  6318. 683.64 s [vector] force: OK
  6319. 683.64 s [vector] +++ OK, passed 100 tests.
  6320. 683.64 s [vector] upd: OK
  6321. 683.64 s [vector] +++ OK, passed 100 tests.
  6322. 683.64 s [vector] accum: OK
  6323. 683.64 s [vector] +++ OK, passed 100 tests.
  6324. 683.64 s [vector] reverse: OK
  6325. 683.64 s [vector] +++ OK, passed 100 tests.
  6326. 683.64 s [vector] backpermute: OK
  6327. 683.64 s [vector] +++ OK, passed 100 tests.
  6328. 683.64 s [vector] map: OK
  6329. 683.64 s [vector] +++ OK, passed 100 tests.
  6330. 683.64 s [vector] imap: OK
  6331. 683.64 s [vector] +++ OK, passed 100 tests.
  6332. 683.64 s [vector] concatMap: OK
  6333. 683.64 s [vector] +++ OK, passed 100 tests.
  6334. 683.65 s [vector] mapM: OK
  6335. 683.66 s [vector] +++ OK, passed 100 tests.
  6336. 683.66 s [vector] mapM_: OK (0.01s)
  6337. 683.66 s [vector] +++ OK, passed 100 tests.
  6338. 683.66 s [vector] forM: OK
  6339. 683.66 s [vector] +++ OK, passed 100 tests.
  6340. 683.66 s [vector] forM_: OK (0.01s)
  6341. 683.66 s [vector] +++ OK, passed 100 tests.
  6342. 683.66 s [vector] imapM: OK
  6343. 683.66 s [vector] +++ OK, passed 100 tests.
  6344. 683.67 s [vector] imapM_: OK
  6345. 683.67 s [vector] +++ OK, passed 100 tests.
  6346. 683.67 s [vector] zipWith: OK
  6347. 683.67 s [vector] +++ OK, passed 100 tests.
  6348. 683.68 s [vector] zipWith3: OK
  6349. 683.68 s [vector] +++ OK, passed 100 tests.
  6350. 683.68 s [vector] izipWith: OK
  6351. 683.69 s [vector] +++ OK, passed 100 tests.
  6352. 683.69 s [vector] izipWith3: OK
  6353. 683.69 s [vector] +++ OK, passed 100 tests.
  6354. 683.69 s [vector] izipWithM: OK
  6355. 683.70 s [vector] +++ OK, passed 100 tests.
  6356. 683.70 s [vector] izipWithM_: OK
  6357. 683.70 s [vector] +++ OK, passed 100 tests.
  6358. 683.70 s [vector] zipWithM: OK
  6359. 683.71 s [vector] +++ OK, passed 100 tests.
  6360. 683.71 s [vector] zipWithM_: OK
  6361. 683.71 s [vector] +++ OK, passed 100 tests.
  6362. 683.71 s [vector] filter: OK
  6363. 683.71 s [vector] +++ OK, passed 100 tests.
  6364. 683.71 s [vector] ifilter: OK
  6365. 683.71 s [vector] +++ OK, passed 100 tests.
  6366. 683.73 s [vector] filterM: OK (0.03s)
  6367. 683.73 s [vector] +++ OK, passed 100 tests.
  6368. 683.73 s [vector] uniq: OK
  6369. 683.73 s [vector] +++ OK, passed 100 tests.
  6370. 683.73 s [vector] mapMaybe: OK
  6371. 683.73 s [vector] +++ OK, passed 100 tests.
  6372. 683.73 s [vector] imapMaybe: OK
  6373. 683.74 s [vector] +++ OK, passed 100 tests.
  6374. 683.74 s [vector] takeWhile: OK
  6375. 683.74 s [vector] +++ OK, passed 100 tests.
  6376. 683.74 s [vector] dropWhile: OK
  6377. 683.74 s [vector] +++ OK, passed 100 tests.
  6378. 683.74 s [vector] partition: OK
  6379. 683.74 s [vector] +++ OK, passed 100 tests.
  6380. 683.74 s [vector] partitionWith: OK
  6381. 683.74 s [vector] +++ OK, passed 100 tests.
  6382. 683.74 s [vector] span: OK
  6383. 683.74 s [vector] +++ OK, passed 100 tests.
  6384. 683.74 s [vector] break: OK
  6385. 683.74 s [vector] +++ OK, passed 100 tests.
  6386. 683.74 s [vector] spanR: OK
  6387. 683.75 s [vector] +++ OK, passed 100 tests.
  6388. 683.75 s [vector] breakR: OK
  6389. 683.75 s [vector] +++ OK, passed 100 tests.
  6390. 683.75 s [vector] groupBy: OK
  6391. 683.75 s [vector] +++ OK, passed 100 tests.
  6392. 683.75 s [vector] elem: OK
  6393. 683.75 s [vector] +++ OK, passed 100 tests.
  6394. 683.75 s [vector] notElem: OK
  6395. 683.75 s [vector] +++ OK, passed 100 tests.
  6396. 683.75 s [vector] find: OK
  6397. 683.75 s [vector] +++ OK, passed 100 tests.
  6398. 683.75 s [vector] findIndex: OK
  6399. 683.75 s [vector] +++ OK, passed 100 tests.
  6400. 683.75 s [vector] findIndexR: OK
  6401. 683.75 s [vector] +++ OK, passed 100 tests.
  6402. 683.75 s [vector] findIndices: OK
  6403. 683.75 s [vector] +++ OK, passed 100 tests.
  6404. 683.75 s [vector] elemIndex: OK
  6405. 683.75 s [vector] +++ OK, passed 100 tests.
  6406. 683.75 s [vector] elemIndices: OK
  6407. 683.75 s [vector] +++ OK, passed 100 tests.
  6408. 683.75 s [vector] foldl: OK
  6409. 683.75 s [vector] +++ OK, passed 100 tests.
  6410. 683.75 s [vector] foldl1: OK
  6411. 683.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6412. 683.75 s [vector] foldl': OK
  6413. 683.75 s [vector] +++ OK, passed 100 tests.
  6414. 683.75 s [vector] foldl1': OK
  6415. 683.75 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6416. 683.76 s [vector] foldr: OK
  6417. 683.76 s [vector] +++ OK, passed 100 tests.
  6418. 683.76 s [vector] foldr1: OK
  6419. 683.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6420. 683.76 s [vector] foldr': OK
  6421. 683.76 s [vector] +++ OK, passed 100 tests.
  6422. 683.77 s [vector] foldr1': OK
  6423. 683.77 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6424. 683.77 s [vector] ifoldl: OK
  6425. 683.77 s [vector] +++ OK, passed 100 tests.
  6426. 683.78 s [vector] ifoldl': OK
  6427. 683.78 s [vector] +++ OK, passed 100 tests.
  6428. 683.80 s [vector] ifoldr: OK
  6429. 683.80 s [vector] +++ OK, passed 100 tests.
  6430. 683.80 s [vector] ifoldr': OK
  6431. 683.80 s [vector] +++ OK, passed 100 tests.
  6432. 683.80 s [vector] ifoldM: OK
  6433. 683.80 s [vector] +++ OK, passed 100 tests.
  6434. 683.80 s [vector] ifoldM': OK
  6435. 683.80 s [vector] +++ OK, passed 100 tests.
  6436. 683.80 s [vector] ifoldM_: OK (0.01s)
  6437. 683.80 s [vector] +++ OK, passed 100 tests.
  6438. 683.80 s [vector] ifoldM'_: OK (0.01s)
  6439. 683.80 s [vector] +++ OK, passed 100 tests.
  6440. 683.80 s [vector] all: OK
  6441. 683.80 s [vector] +++ OK, passed 100 tests.
  6442. 683.80 s [vector] any: OK
  6443. 683.80 s [vector] +++ OK, passed 100 tests.
  6444. 683.80 s [vector] prescanl: OK
  6445. 683.80 s [vector] +++ OK, passed 100 tests.
  6446. 683.80 s [vector] prescanl': OK
  6447. 683.80 s [vector] +++ OK, passed 100 tests.
  6448. 683.80 s [vector] postscanl: OK
  6449. 683.80 s [vector] +++ OK, passed 100 tests.
  6450. 683.81 s [vector] postscanl': OK
  6451. 683.81 s [vector] +++ OK, passed 100 tests.
  6452. 683.81 s [vector] scanl: OK
  6453. 683.81 s [vector] +++ OK, passed 100 tests.
  6454. 683.81 s [vector] scanl': OK
  6455. 683.82 s [vector] +++ OK, passed 100 tests.
  6456. 683.82 s [vector] scanl1: OK
  6457. 683.82 s [vector] +++ OK, passed 100 tests.
  6458. 683.82 s [vector] scanl1': OK
  6459. 683.82 s [vector] +++ OK, passed 100 tests.
  6460. 683.82 s [vector] iscanl: OK
  6461. 683.82 s [vector] +++ OK, passed 100 tests.
  6462. 683.82 s [vector] iscanl': OK
  6463. 683.82 s [vector] +++ OK, passed 100 tests.
  6464. 683.82 s [vector] prescanr: OK
  6465. 683.82 s [vector] +++ OK, passed 100 tests.
  6466. 683.82 s [vector] prescanr': OK
  6467. 683.82 s [vector] +++ OK, passed 100 tests.
  6468. 683.82 s [vector] postscanr: OK
  6469. 683.82 s [vector] +++ OK, passed 100 tests.
  6470. 683.82 s [vector] postscanr': OK
  6471. 683.82 s [vector] +++ OK, passed 100 tests.
  6472. 683.82 s [vector] scanr: OK
  6473. 683.82 s [vector] +++ OK, passed 100 tests.
  6474. 683.83 s [vector] scanr': OK
  6475. 683.83 s [vector] +++ OK, passed 100 tests.
  6476. 683.83 s [vector] scanr1: OK
  6477. 683.83 s [vector] +++ OK, passed 100 tests.
  6478. 683.83 s [vector] scanr1': OK
  6479. 683.83 s [vector] +++ OK, passed 100 tests.
  6480. 683.84 s [vector] iscanr: OK
  6481. 683.84 s [vector] +++ OK, passed 100 tests.
  6482. 683.84 s [vector] iscanr': OK
  6483. 683.84 s [vector] +++ OK, passed 100 tests.
  6484. 683.84 s [vector] mut_read: OK
  6485. 683.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6486. 683.84 s [vector] mut_write: OK
  6487. 683.85 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6488. 683.85 s [vector] mut_modify: OK
  6489. 683.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6490. 683.85 s [vector] mut_generate: OK
  6491. 683.85 s [vector] +++ OK, passed 100 tests.
  6492. 683.85 s [vector] mut_generateM: OK
  6493. 683.85 s [vector] +++ OK, passed 100 tests.
  6494. 683.86 s [vector] mut_mapM_: OK (0.01s)
  6495. 683.86 s [vector] +++ OK, passed 100 tests.
  6496. 683.88 s [vector] mut_imapM_: OK (0.01s)
  6497. 683.88 s [vector] +++ OK, passed 100 tests.
  6498. 683.88 s [vector] mut_forM_: OK (0.01s)
  6499. 683.89 s [vector] +++ OK, passed 100 tests.
  6500. 683.89 s [vector] mut_iforM_: OK (0.01s)
  6501. 683.89 s [vector] +++ OK, passed 100 tests.
  6502. 683.89 s [vector] mut_foldr: OK
  6503. 683.89 s [vector] +++ OK, passed 100 tests.
  6504. 683.90 s [vector] mut_foldr': OK
  6505. 683.90 s [vector] +++ OK, passed 100 tests.
  6506. 683.90 s [vector] mut_foldl: OK
  6507. 683.90 s [vector] +++ OK, passed 100 tests.
  6508. 683.90 s [vector] mut_foldl': OK
  6509. 683.90 s [vector] +++ OK, passed 100 tests.
  6510. 683.90 s [vector] mut_ifoldr: OK
  6511. 683.90 s [vector] +++ OK, passed 100 tests.
  6512. 683.90 s [vector] mut_ifoldr': OK
  6513. 683.90 s [vector] +++ OK, passed 100 tests.
  6514. 683.90 s [vector] mut_ifoldl: OK
  6515. 683.90 s [vector] +++ OK, passed 100 tests.
  6516. 683.91 s [vector] mut_ifoldl': OK
  6517. 683.91 s [vector] +++ OK, passed 100 tests.
  6518. 683.91 s [vector] mut_foldM: OK
  6519. 683.91 s [vector] +++ OK, passed 100 tests.
  6520. 683.92 s [vector] mut_foldM': OK
  6521. 683.92 s [vector] +++ OK, passed 100 tests.
  6522. 683.92 s [vector] mut_foldrM: OK
  6523. 683.92 s [vector] +++ OK, passed 100 tests.
  6524. 683.92 s [vector] mut_foldrM': OK
  6525. 683.92 s [vector] +++ OK, passed 100 tests.
  6526. 683.92 s [vector] mut_ifoldM: OK
  6527. 683.92 s [vector] +++ OK, passed 100 tests.
  6528. 683.92 s [vector] mut_ifoldM': OK
  6529. 683.92 s [vector] +++ OK, passed 100 tests.
  6530. 683.92 s [vector] mut_ifoldrM: OK
  6531. 683.93 s [vector] +++ OK, passed 100 tests.
  6532. 683.93 s [vector] mut_ifoldrM': OK
  6533. 683.93 s [vector] +++ OK, passed 100 tests.
  6534. 683.93 s [vector] compare: OK
  6535. 683.93 s [vector] +++ OK, passed 100 tests.
  6536. 683.93 s [vector] maximum: OK
  6537. 683.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6538. 683.93 s [vector] minimum: OK
  6539. 683.93 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6540. 683.93 s [vector] minIndex: OK
  6541. 683.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6542. 683.93 s [vector] maxIndex: OK
  6543. 683.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6544. 683.93 s [vector] maximumBy: OK
  6545. 683.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6546. 683.93 s [vector] minimumBy: OK
  6547. 683.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6548. 683.93 s [vector] maximumOn: OK
  6549. 683.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6550. 683.93 s [vector] minimumOn: OK
  6551. 683.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6552. 683.93 s [vector] maxIndexBy: OK
  6553. 683.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6554. 683.93 s [vector] minIndexBy: OK
  6555. 683.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6556. 683.93 s [vector] ListFirstMaxIndexWins: OK
  6557. 683.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6558. 683.93 s [vector] FalseListFirstMaxIndexWins: OK
  6559. 683.93 s [vector] +++ OK, failed as expected. (after 1 test):
  6560. 683.93 s [vector] Exception:
  6561. 683.93 s [vector] Prelude.foldr1: empty list
  6562. 683.94 s [vector] CallStack (from HasCallStack):
  6563. 683.94 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6564. 683.94 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6565. 683.94 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6566. 683.94 s [vector] []
  6567. 683.94 s [vector] zip: OK
  6568. 683.94 s [vector] +++ OK, passed 100 tests.
  6569. 683.94 s [vector] zip3: OK
  6570. 683.94 s [vector] +++ OK, passed 100 tests.
  6571. 683.94 s [vector] unzip: OK
  6572. 683.94 s [vector] +++ OK, passed 100 tests.
  6573. 683.94 s [vector] unzip3: OK
  6574. 683.94 s [vector] +++ OK, passed 100 tests.
  6575. 683.94 s [vector] indexed: OK
  6576. 683.94 s [vector] +++ OK, passed 100 tests.
  6577. 683.95 s [vector] update: OK
  6578. 683.95 s [vector] +++ OK, passed 100 tests.
  6579. 683.96 s [vector] mempty: OK
  6580. 683.96 s [vector] +++ OK, passed 100 tests.
  6581. 683.97 s [vector] mappend: OK
  6582. 683.97 s [vector] +++ OK, passed 100 tests.
  6583. 683.97 s [vector] mconcat: OK (0.01s)
  6584. 683.97 s [vector] +++ OK, passed 100 tests.
  6585. 683.97 s [vector] glength: OK
  6586. 683.97 s [vector] +++ OK, passed 100 tests.
  6587. 683.97 s [vector] and: OK
  6588. 683.97 s [vector] +++ OK, passed 100 tests.
  6589. 683.97 s [vector] or: OK
  6590. 683.97 s [vector] +++ OK, passed 100 tests.
  6591. 683.97 s [vector] (Int)
  6592. 683.97 s [vector] fromList.toList == id: OK
  6593. 683.97 s [vector] +++ OK, passed 100 tests.
  6594. 683.97 s [vector] toList.fromList == id: OK
  6595. 683.97 s [vector] +++ OK, passed 100 tests.
  6596. 683.97 s [vector] unstream.stream == id: OK
  6597. 683.97 s [vector] +++ OK, passed 100 tests.
  6598. 683.97 s [vector] stream.unstream == id: OK
  6599. 683.97 s [vector] +++ OK, passed 100 tests.
  6600. 683.97 s [vector] eq: OK
  6601. 683.97 s [vector] +++ OK, passed 100 tests.
  6602. 683.97 s [vector] length: OK
  6603. 683.97 s [vector] +++ OK, passed 100 tests.
  6604. 683.97 s [vector] null: OK
  6605. 683.97 s [vector] +++ OK, passed 100 tests.
  6606. 683.97 s [vector] index: OK
  6607. 683.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6608. 683.97 s [vector] safeIndex: OK
  6609. 683.97 s [vector] +++ OK, passed 100 tests.
  6610. 683.97 s [vector] head: OK
  6611. 683.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6612. 683.98 s [vector] last: OK
  6613. 683.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6614. 683.98 s [vector] unsafeIndex: OK
  6615. 683.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6616. 683.98 s [vector] unsafeHead: OK
  6617. 683.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6618. 683.98 s [vector] unsafeLast: OK
  6619. 683.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6620. 683.98 s [vector] slice: OK
  6621. 683.98 s [vector] +++ OK, passed 100 tests.
  6622. 683.98 s [vector] init: OK
  6623. 683.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6624. 683.98 s [vector] tail: OK
  6625. 683.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6626. 683.98 s [vector] take: OK
  6627. 683.98 s [vector] +++ OK, passed 100 tests.
  6628. 683.98 s [vector] drop: OK
  6629. 683.98 s [vector] +++ OK, passed 100 tests.
  6630. 683.98 s [vector] splitAt: OK
  6631. 683.98 s [vector] +++ OK, passed 100 tests.
  6632. 683.98 s [vector] empty: OK
  6633. 683.98 s [vector] +++ OK, passed 100 tests.
  6634. 683.98 s [vector] singleton: OK
  6635. 683.98 s [vector] +++ OK, passed 100 tests.
  6636. 683.98 s [vector] replicate: OK
  6637. 683.98 s [vector] +++ OK, passed 100 tests.
  6638. 683.98 s [vector] generate: OK
  6639. 684.01 s [vector] +++ OK, passed 100 tests.
  6640. 684.01 s [vector] iterateN: OK
  6641. 684.01 s [vector] +++ OK, passed 100 tests.
  6642. 684.08 s [vector] iterateNM: OK (0.06s)
  6643. 684.08 s [vector] +++ OK, passed 100 tests.
  6644. 684.08 s [vector] generateM: OK (0.03s)
  6645. 684.09 s [vector] +++ OK, passed 100 tests.
  6646. 684.09 s [vector] replicateM: OK (0.01s)
  6647. 684.09 s [vector] +++ OK, passed 100 tests.
  6648. 684.09 s [vector] create: OK
  6649. 684.09 s [vector] +++ OK, passed 100 tests.
  6650. 684.09 s [vector] createT: OK
  6651. 684.09 s [vector] +++ OK, passed 100 tests.
  6652. 684.10 s [vector] unfoldr: OK
  6653. 684.10 s [vector] +++ OK, passed 100 tests.
  6654. 684.10 s [vector] unfoldrN: OK
  6655. 684.10 s [vector] +++ OK, passed 100 tests.
  6656. 684.10 s [vector] unfoldrExactN: OK
  6657. 684.11 s [vector] +++ OK, passed 100 tests.
  6658. 684.11 s [vector] unfoldrM: OK
  6659. 684.11 s [vector] +++ OK, passed 100 tests.
  6660. 684.11 s [vector] unfoldrNM: OK
  6661. 684.11 s [vector] +++ OK, passed 100 tests.
  6662. 684.16 s [vector] unfoldrExactNM: OK (0.05s)
  6663. 684.16 s [vector] +++ OK, passed 100 tests.
  6664. 684.16 s [vector] constructN: OK
  6665. 684.16 s [vector] +++ OK, passed 100 tests.
  6666. 684.16 s [vector] constructrN: OK
  6667. 684.16 s [vector] +++ OK, passed 100 tests.
  6668. 684.16 s [vector] cons: OK
  6669. 684.16 s [vector] +++ OK, passed 100 tests.
  6670. 684.16 s [vector] snoc: OK
  6671. 684.16 s [vector] +++ OK, passed 100 tests.
  6672. 684.18 s [vector] append: OK
  6673. 684.19 s [vector] +++ OK, passed 100 tests.
  6674. 684.19 s [vector] concat: OK (0.02s)
  6675. 684.19 s [vector] +++ OK, passed 100 tests.
  6676. 684.19 s [vector] force: OK
  6677. 684.20 s [vector] +++ OK, passed 100 tests.
  6678. 684.20 s [vector] upd: OK
  6679. 684.20 s [vector] +++ OK, passed 100 tests.
  6680. 684.20 s [vector] accum: OK
  6681. 684.20 s [vector] +++ OK, passed 100 tests.
  6682. 684.20 s [vector] reverse: OK
  6683. 684.20 s [vector] +++ OK, passed 100 tests.
  6684. 684.21 s [vector] backpermute: OK
  6685. 684.21 s [vector] +++ OK, passed 100 tests.
  6686. 684.21 s [vector] map: OK
  6687. 684.21 s [vector] +++ OK, passed 100 tests.
  6688. 684.21 s [vector] imap: OK
  6689. 684.21 s [vector] +++ OK, passed 100 tests.
  6690. 684.22 s [vector] concatMap: OK
  6691. 684.22 s [vector] +++ OK, passed 100 tests.
  6692. 684.23 s [vector] mapM: OK
  6693. 684.23 s [vector] +++ OK, passed 100 tests.
  6694. 684.27 s [vector] mapM_: OK (0.04s)
  6695. 684.29 s [vector] +++ OK, passed 100 tests.
  6696. 684.29 s [vector] forM: OK
  6697. 684.29 s [vector] +++ OK, passed 100 tests.
  6698. 684.31 s [vector] forM_: OK (0.04s)
  6699. 684.31 s [vector] +++ OK, passed 100 tests.
  6700. 684.31 s [vector] imapM: OK
  6701. 684.31 s [vector] +++ OK, passed 100 tests.
  6702. 684.35 s [vector] imapM_: OK (0.03s)
  6703. 684.36 s [vector] +++ OK, passed 100 tests.
  6704. 684.37 s [vector] zipWith: OK
  6705. 684.37 s [vector] +++ OK, passed 100 tests.
  6706. 684.39 s [vector] zipWith3: OK
  6707. 684.39 s [vector] +++ OK, passed 100 tests.
  6708. 684.39 s [vector] izipWith: OK
  6709. 684.39 s [vector] +++ OK, passed 100 tests.
  6710. 684.39 s [vector] izipWith3: OK
  6711. 684.39 s [vector] +++ OK, passed 100 tests.
  6712. 684.39 s [vector] izipWithM: OK
  6713. 684.39 s [vector] +++ OK, passed 100 tests.
  6714. 684.41 s [vector] izipWithM_: OK (0.03s)
  6715. 684.41 s [vector] +++ OK, passed 100 tests.
  6716. 684.43 s [vector] zipWithM: OK
  6717. 684.43 s [vector] +++ OK, passed 100 tests.
  6718. 684.43 s [vector] zipWithM_: OK (0.01s)
  6719. 684.43 s [vector] +++ OK, passed 100 tests.
  6720. 684.43 s [vector] filter: OK
  6721. 684.43 s [vector] +++ OK, passed 100 tests.
  6722. 684.43 s [vector] ifilter: OK
  6723. 684.43 s [vector] +++ OK, passed 100 tests.
  6724. 684.46 s [vector] filterM: OK (0.03s)
  6725. 684.46 s [vector] +++ OK, passed 100 tests.
  6726. 684.46 s [vector] uniq: OK
  6727. 684.46 s [vector] +++ OK, passed 100 tests.
  6728. 684.47 s [vector] mapMaybe: OK
  6729. 684.47 s [vector] +++ OK, passed 100 tests.
  6730. 684.47 s [vector] imapMaybe: OK
  6731. 684.47 s [vector] +++ OK, passed 100 tests.
  6732. 684.47 s [vector] takeWhile: OK
  6733. 684.47 s [vector] +++ OK, passed 100 tests.
  6734. 684.48 s [vector] dropWhile: OK
  6735. 684.48 s [vector] +++ OK, passed 100 tests.
  6736. 684.48 s [vector] partition: OK
  6737. 684.48 s [vector] +++ OK, passed 100 tests.
  6738. 684.48 s [vector] partitionWith: OK
  6739. 684.48 s [vector] +++ OK, passed 100 tests.
  6740. 684.48 s [vector] span: OK
  6741. 684.48 s [vector] +++ OK, passed 100 tests.
  6742. 684.48 s [vector] break: OK
  6743. 684.48 s [vector] +++ OK, passed 100 tests.
  6744. 684.48 s [vector] spanR: OK
  6745. 684.48 s [vector] +++ OK, passed 100 tests.
  6746. 684.48 s [vector] breakR: OK
  6747. 684.48 s [vector] +++ OK, passed 100 tests.
  6748. 684.48 s [vector] groupBy: OK
  6749. 684.48 s [vector] +++ OK, passed 100 tests.
  6750. 684.48 s [vector] elem: OK
  6751. 684.48 s [vector] +++ OK, passed 100 tests.
  6752. 684.48 s [vector] notElem: OK
  6753. 684.48 s [vector] +++ OK, passed 100 tests.
  6754. 684.49 s [vector] find: OK
  6755. 684.49 s [vector] +++ OK, passed 100 tests.
  6756. 684.49 s [vector] findIndex: OK
  6757. 684.49 s [vector] +++ OK, passed 100 tests.
  6758. 684.50 s [vector] findIndexR: OK
  6759. 684.50 s [vector] +++ OK, passed 100 tests.
  6760. 684.50 s [vector] findIndices: OK
  6761. 684.51 s [vector] +++ OK, passed 100 tests.
  6762. 684.51 s [vector] elemIndex: OK
  6763. 684.51 s [vector] +++ OK, passed 100 tests.
  6764. 684.52 s [vector] elemIndices: OK
  6765. 684.52 s [vector] +++ OK, passed 100 tests.
  6766. 684.52 s [vector] foldl: OK
  6767. 684.52 s [vector] +++ OK, passed 100 tests.
  6768. 684.52 s [vector] foldl1: OK
  6769. 684.52 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6770. 684.52 s [vector] foldl': OK
  6771. 684.52 s [vector] +++ OK, passed 100 tests.
  6772. 684.52 s [vector] foldl1': OK
  6773. 684.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6774. 684.52 s [vector] foldr: OK
  6775. 684.52 s [vector] +++ OK, passed 100 tests.
  6776. 684.52 s [vector] foldr1: OK
  6777. 684.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6778. 684.52 s [vector] foldr': OK
  6779. 684.52 s [vector] +++ OK, passed 100 tests.
  6780. 684.52 s [vector] foldr1': OK
  6781. 684.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6782. 684.52 s [vector] ifoldl: OK
  6783. 684.52 s [vector] +++ OK, passed 100 tests.
  6784. 684.52 s [vector] ifoldl': OK
  6785. 684.52 s [vector] +++ OK, passed 100 tests.
  6786. 684.52 s [vector] ifoldr: OK
  6787. 684.52 s [vector] +++ OK, passed 100 tests.
  6788. 684.53 s [vector] ifoldr': OK
  6789. 684.54 s [vector] +++ OK, passed 100 tests.
  6790. 684.55 s [vector] ifoldM: OK
  6791. 684.55 s [vector] +++ OK, passed 100 tests.
  6792. 684.55 s [vector] ifoldM': OK
  6793. 684.55 s [vector] +++ OK, passed 100 tests.
  6794. 684.57 s [vector] ifoldM_: OK (0.02s)
  6795. 684.57 s [vector] +++ OK, passed 100 tests.
  6796. 684.58 s [vector] ifoldM'_: OK (0.02s)
  6797. 684.58 s [vector] +++ OK, passed 100 tests.
  6798. 684.58 s [vector] all: OK
  6799. 684.58 s [vector] +++ OK, passed 100 tests.
  6800. 684.58 s [vector] any: OK
  6801. 684.58 s [vector] +++ OK, passed 100 tests.
  6802. 684.58 s [vector] prescanl: OK
  6803. 684.58 s [vector] +++ OK, passed 100 tests.
  6804. 684.59 s [vector] prescanl': OK
  6805. 684.59 s [vector] +++ OK, passed 100 tests.
  6806. 684.59 s [vector] postscanl: OK
  6807. 684.59 s [vector] +++ OK, passed 100 tests.
  6808. 684.59 s [vector] postscanl': OK
  6809. 684.59 s [vector] +++ OK, passed 100 tests.
  6810. 684.60 s [vector] scanl: OK
  6811. 684.60 s [vector] +++ OK, passed 100 tests.
  6812. 684.60 s [vector] scanl': OK
  6813. 684.60 s [vector] +++ OK, passed 100 tests.
  6814. 684.60 s [vector] scanl1: OK
  6815. 684.60 s [vector] +++ OK, passed 100 tests.
  6816. 684.60 s [vector] scanl1': OK
  6817. 684.60 s [vector] +++ OK, passed 100 tests.
  6818. 684.61 s [vector] iscanl: OK
  6819. 684.61 s [vector] +++ OK, passed 100 tests.
  6820. 684.62 s [vector] iscanl': OK
  6821. 684.62 s [vector] +++ OK, passed 100 tests.
  6822. 684.62 s [vector] prescanr: OK
  6823. 684.63 s [vector] +++ OK, passed 100 tests.
  6824. 684.63 s [vector] prescanr': OK
  6825. 684.63 s [vector] +++ OK, passed 100 tests.
  6826. 684.64 s [vector] postscanr: OK
  6827. 684.64 s [vector] +++ OK, passed 100 tests.
  6828. 684.65 s [vector] postscanr': OK
  6829. 684.65 s [vector] +++ OK, passed 100 tests.
  6830. 684.65 s [vector] scanr: OK
  6831. 684.65 s [vector] +++ OK, passed 100 tests.
  6832. 684.66 s [vector] scanr': OK
  6833. 684.66 s [vector] +++ OK, passed 100 tests.
  6834. 684.67 s [vector] scanr1: OK
  6835. 684.67 s [vector] +++ OK, passed 100 tests.
  6836. 684.67 s [vector] scanr1': OK
  6837. 684.67 s [vector] +++ OK, passed 100 tests.
  6838. 684.67 s [vector] iscanr: OK
  6839. 684.67 s [vector] +++ OK, passed 100 tests.
  6840. 684.67 s [vector] iscanr': OK
  6841. 684.67 s [vector] +++ OK, passed 100 tests.
  6842. 684.68 s [vector] mut_read: OK
  6843. 684.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6844. 684.68 s [vector] mut_write: OK
  6845. 684.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6846. 684.68 s [vector] mut_modify: OK
  6847. 684.68 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6848. 684.68 s [vector] mut_generate: OK
  6849. 684.69 s [vector] +++ OK, passed 100 tests.
  6850. 684.69 s [vector] mut_generateM: OK (0.01s)
  6851. 684.69 s [vector] +++ OK, passed 100 tests.
  6852. 684.69 s [vector] mut_mapM_: OK (0.02s)
  6853. 684.69 s [vector] +++ OK, passed 100 tests.
  6854. 684.70 s [vector] mut_imapM_: OK (0.02s)
  6855. 684.71 s [vector] +++ OK, passed 100 tests.
  6856. 684.72 s [vector] mut_forM_: OK (0.02s)
  6857. 684.73 s [vector] +++ OK, passed 100 tests.
  6858. 684.74 s [vector] mut_iforM_: OK (0.02s)
  6859. 684.74 s [vector] +++ OK, passed 100 tests.
  6860. 684.74 s [vector] mut_foldr: OK
  6861. 684.74 s [vector] +++ OK, passed 100 tests.
  6862. 684.75 s [vector] mut_foldr': OK
  6863. 684.75 s [vector] +++ OK, passed 100 tests.
  6864. 684.76 s [vector] mut_foldl: OK
  6865. 684.76 s [vector] +++ OK, passed 100 tests.
  6866. 684.76 s [vector] mut_foldl': OK
  6867. 684.76 s [vector] +++ OK, passed 100 tests.
  6868. 684.76 s [vector] mut_ifoldr: OK
  6869. 684.76 s [vector] +++ OK, passed 100 tests.
  6870. 684.76 s [vector] mut_ifoldr': OK
  6871. 684.76 s [vector] +++ OK, passed 100 tests.
  6872. 684.76 s [vector] mut_ifoldl: OK
  6873. 684.76 s [vector] +++ OK, passed 100 tests.
  6874. 684.77 s [vector] mut_ifoldl': OK
  6875. 684.77 s [vector] +++ OK, passed 100 tests.
  6876. 684.77 s [vector] mut_foldM: OK
  6877. 684.78 s [vector] +++ OK, passed 100 tests.
  6878. 684.78 s [vector] mut_foldM': OK
  6879. 684.78 s [vector] +++ OK, passed 100 tests.
  6880. 684.78 s [vector] mut_foldrM: OK
  6881. 684.78 s [vector] +++ OK, passed 100 tests.
  6882. 684.79 s [vector] mut_foldrM': OK
  6883. 684.79 s [vector] +++ OK, passed 100 tests.
  6884. 684.80 s [vector] mut_ifoldM: OK
  6885. 684.80 s [vector] +++ OK, passed 100 tests.
  6886. 684.80 s [vector] mut_ifoldM': OK
  6887. 684.80 s [vector] +++ OK, passed 100 tests.
  6888. 684.80 s [vector] mut_ifoldrM: OK
  6889. 684.80 s [vector] +++ OK, passed 100 tests.
  6890. 684.80 s [vector] mut_ifoldrM': OK
  6891. 684.80 s [vector] +++ OK, passed 100 tests.
  6892. 684.80 s [vector] compare: OK
  6893. 684.80 s [vector] +++ OK, passed 100 tests.
  6894. 684.80 s [vector] maximum: OK
  6895. 684.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6896. 684.80 s [vector] minimum: OK
  6897. 684.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6898. 684.80 s [vector] minIndex: OK
  6899. 684.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6900. 684.80 s [vector] maxIndex: OK
  6901. 684.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6902. 684.80 s [vector] maximumBy: OK
  6903. 684.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6904. 684.80 s [vector] minimumBy: OK
  6905. 684.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6906. 684.80 s [vector] maximumOn: OK
  6907. 684.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6908. 684.81 s [vector] minimumOn: OK
  6909. 684.81 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6910. 684.81 s [vector] maxIndexBy: OK
  6911. 684.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6912. 684.81 s [vector] minIndexBy: OK
  6913. 684.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6914. 684.81 s [vector] ListFirstMaxIndexWins: OK
  6915. 684.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6916. 684.81 s [vector] FalseListFirstMaxIndexWins: OK
  6917. 684.81 s [vector] +++ OK, failed as expected. (after 1 test):
  6918. 684.81 s [vector] Exception:
  6919. 684.81 s [vector] Prelude.foldr1: empty list
  6920. 684.81 s [vector] CallStack (from HasCallStack):
  6921. 684.81 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6922. 684.81 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6923. 684.81 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6924. 684.81 s [vector] []
  6925. 684.81 s [vector] zip: OK
  6926. 684.81 s [vector] +++ OK, passed 100 tests.
  6927. 684.81 s [vector] zip3: OK
  6928. 684.82 s [vector] +++ OK, passed 100 tests.
  6929. 684.83 s [vector] unzip: OK
  6930. 684.83 s [vector] +++ OK, passed 100 tests.
  6931. 684.83 s [vector] unzip3: OK
  6932. 684.83 s [vector] +++ OK, passed 100 tests.
  6933. 684.84 s [vector] indexed: OK
  6934. 684.85 s [vector] +++ OK, passed 100 tests.
  6935. 684.85 s [vector] update: OK (0.01s)
  6936. 684.85 s [vector] +++ OK, passed 100 tests.
  6937. 684.85 s [vector] mempty: OK
  6938. 684.85 s [vector] +++ OK, passed 100 tests.
  6939. 684.85 s [vector] mappend: OK
  6940. 684.85 s [vector] +++ OK, passed 100 tests.
  6941. 684.86 s [vector] mconcat: OK (0.02s)
  6942. 684.86 s [vector] +++ OK, passed 100 tests.
  6943. 684.86 s [vector] glength: OK
  6944. 684.86 s [vector] +++ OK, passed 100 tests.
  6945. 684.86 s [vector] sum: OK
  6946. 684.86 s [vector] +++ OK, passed 100 tests.
  6947. 684.86 s [vector] product: OK
  6948. 684.86 s [vector] +++ OK, passed 100 tests.
  6949. 684.86 s [vector] enumFromN: OK
  6950. 684.86 s [vector] +++ OK, passed 100 tests.
  6951. 684.86 s [vector] enumFromThenN: OK
  6952. 684.86 s [vector] +++ OK, passed 100 tests.
  6953. 684.86 s [vector] enumFromTo: OK
  6954. 684.86 s [vector] +++ OK, passed 100 tests.
  6955. 684.86 s [vector] enumFromThenTo: OK
  6956. 684.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6957. 684.86 s [vector] (Float)
  6958. 684.86 s [vector] fromList.toList == id: OK
  6959. 684.86 s [vector] +++ OK, passed 100 tests.
  6960. 684.86 s [vector] toList.fromList == id: OK
  6961. 684.86 s [vector] +++ OK, passed 100 tests.
  6962. 684.86 s [vector] unstream.stream == id: OK
  6963. 684.86 s [vector] +++ OK, passed 100 tests.
  6964. 684.86 s [vector] stream.unstream == id: OK
  6965. 684.86 s [vector] +++ OK, passed 100 tests.
  6966. 684.86 s [vector] eq: OK
  6967. 684.86 s [vector] +++ OK, passed 100 tests.
  6968. 684.86 s [vector] length: OK
  6969. 684.86 s [vector] +++ OK, passed 100 tests.
  6970. 684.86 s [vector] null: OK
  6971. 684.86 s [vector] +++ OK, passed 100 tests.
  6972. 684.87 s [vector] index: OK
  6973. 684.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6974. 684.87 s [vector] safeIndex: OK
  6975. 684.87 s [vector] +++ OK, passed 100 tests.
  6976. 684.87 s [vector] head: OK
  6977. 684.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6978. 684.87 s [vector] last: OK
  6979. 684.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6980. 684.87 s [vector] unsafeIndex: OK
  6981. 684.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6982. 684.87 s [vector] unsafeHead: OK
  6983. 684.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6984. 684.87 s [vector] unsafeLast: OK
  6985. 684.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6986. 684.87 s [vector] slice: OK
  6987. 684.87 s [vector] +++ OK, passed 100 tests.
  6988. 684.87 s [vector] init: OK
  6989. 684.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6990. 684.87 s [vector] tail: OK
  6991. 684.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6992. 684.87 s [vector] take: OK
  6993. 684.87 s [vector] +++ OK, passed 100 tests.
  6994. 684.88 s [vector] drop: OK
  6995. 684.88 s [vector] +++ OK, passed 100 tests.
  6996. 684.88 s [vector] splitAt: OK
  6997. 684.88 s [vector] +++ OK, passed 100 tests.
  6998. 684.88 s [vector] empty: OK
  6999. 684.88 s [vector] +++ OK, passed 100 tests.
  7000. 684.88 s [vector] singleton: OK
  7001. 684.88 s [vector] +++ OK, passed 100 tests.
  7002. 684.88 s [vector] replicate: OK
  7003. 684.88 s [vector] +++ OK, passed 100 tests.
  7004. 684.88 s [vector] generate: OK
  7005. 684.88 s [vector] +++ OK, passed 100 tests.
  7006. 684.88 s [vector] iterateN: OK
  7007. 684.88 s [vector] +++ OK, passed 100 tests.
  7008. 684.90 s [vector] iterateNM: OK (0.02s)
  7009. 684.90 s [vector] +++ OK, passed 100 tests.
  7010. 684.92 s [vector] generateM: OK (0.02s)
  7011. 684.93 s [vector] +++ OK, passed 100 tests.
  7012. 684.93 s [vector] replicateM: OK
  7013. 684.93 s [vector] +++ OK, passed 100 tests.
  7014. 684.93 s [vector] create: OK
  7015. 684.93 s [vector] +++ OK, passed 100 tests.
  7016. 684.93 s [vector] createT: OK
  7017. 684.94 s [vector] +++ OK, passed 100 tests.
  7018. 684.94 s [vector] unfoldr: OK
  7019. 684.94 s [vector] +++ OK, passed 100 tests.
  7020. 684.94 s [vector] unfoldrN: OK
  7021. 684.94 s [vector] +++ OK, passed 100 tests.
  7022. 684.94 s [vector] unfoldrExactN: OK
  7023. 684.94 s [vector] +++ OK, passed 100 tests.
  7024. 684.94 s [vector] unfoldrM: OK
  7025. 684.94 s [vector] +++ OK, passed 100 tests.
  7026. 684.94 s [vector] unfoldrNM: OK
  7027. 684.94 s [vector] +++ OK, passed 100 tests.
  7028. 685.00 s [vector] unfoldrExactNM: OK (0.05s)
  7029. 685.00 s [vector] +++ OK, passed 100 tests.
  7030. 685.01 s [vector] constructN: OK
  7031. 685.01 s [vector] +++ OK, passed 100 tests.
  7032. 685.01 s [vector] constructrN: OK (0.01s)
  7033. 685.01 s [vector] +++ OK, passed 100 tests.
  7034. 685.01 s [vector] cons: OK
  7035. 685.01 s [vector] +++ OK, passed 100 tests.
  7036. 685.01 s [vector] snoc: OK
  7037. 685.02 s [vector] +++ OK, passed 100 tests.
  7038. 685.03 s [vector] append: OK
  7039. 685.03 s [vector] +++ OK, passed 100 tests.
  7040. 685.04 s [vector] concat: OK (0.02s)
  7041. 685.04 s [vector] +++ OK, passed 100 tests.
  7042. 685.04 s [vector] force: OK
  7043. 685.04 s [vector] +++ OK, passed 100 tests.
  7044. 685.04 s [vector] upd: OK
  7045. 685.05 s [vector] +++ OK, passed 100 tests.
  7046. 685.05 s [vector] accum: OK (0.01s)
  7047. 685.05 s [vector] +++ OK, passed 100 tests.
  7048. 685.05 s [vector] reverse: OK
  7049. 685.05 s [vector] +++ OK, passed 100 tests.
  7050. 685.06 s [vector] backpermute: OK
  7051. 685.06 s [vector] +++ OK, passed 100 tests.
  7052. 685.06 s [vector] map: OK
  7053. 685.06 s [vector] +++ OK, passed 100 tests.
  7054. 685.07 s [vector] imap: OK
  7055. 685.08 s [vector] +++ OK, passed 100 tests.
  7056. 685.09 s [vector] concatMap: OK
  7057. 685.09 s [vector] +++ OK, passed 100 tests.
  7058. 685.09 s [vector] mapM: OK
  7059. 685.09 s [vector] +++ OK, passed 100 tests.
  7060. 685.12 s [vector] mapM_: OK (0.04s)
  7061. 685.12 s [vector] +++ OK, passed 100 tests.
  7062. 685.13 s [vector] forM: OK
  7063. 685.13 s [vector] +++ OK, passed 100 tests.
  7064. 685.16 s [vector] forM_: OK (0.03s)
  7065. 685.16 s [vector] +++ OK, passed 100 tests.
  7066. 685.17 s [vector] imapM: OK
  7067. 685.17 s [vector] +++ OK, passed 100 tests.
  7068. 685.20 s [vector] imapM_: OK (0.03s)
  7069. 685.20 s [vector] +++ OK, passed 100 tests.
  7070. 685.20 s [vector] zipWith: OK
  7071. 685.20 s [vector] +++ OK, passed 100 tests.
  7072. 685.21 s [vector] zipWith3: OK
  7073. 685.21 s [vector] +++ OK, passed 100 tests.
  7074. 685.22 s [vector] izipWith: OK
  7075. 685.22 s [vector] +++ OK, passed 100 tests.
  7076. 685.22 s [vector] izipWith3: OK
  7077. 685.22 s [vector] +++ OK, passed 100 tests.
  7078. 685.24 s [vector] izipWithM: OK
  7079. 685.25 s [vector] +++ OK, passed 100 tests.
  7080. 685.26 s [vector] izipWithM_: OK (0.03s)
  7081. 685.26 s [vector] +++ OK, passed 100 tests.
  7082. 685.26 s [vector] zipWithM: OK
  7083. 685.26 s [vector] +++ OK, passed 100 tests.
  7084. 685.29 s [vector] zipWithM_: OK
  7085. 685.29 s [vector] +++ OK, passed 100 tests.
  7086. 685.29 s [vector] filter: OK
  7087. 685.29 s [vector] +++ OK, passed 100 tests.
  7088. 685.30 s [vector] ifilter: OK
  7089. 685.30 s [vector] +++ OK, passed 100 tests.
  7090. 685.33 s [vector] filterM: OK (0.04s)
  7091. 685.33 s [vector] +++ OK, passed 100 tests.
  7092. 685.34 s [vector] uniq: OK
  7093. 685.34 s [vector] +++ OK, passed 100 tests.
  7094. 685.34 s [vector] mapMaybe: OK
  7095. 685.34 s [vector] +++ OK, passed 100 tests.
  7096. 685.35 s [vector] imapMaybe: OK
  7097. 685.35 s [vector] +++ OK, passed 100 tests.
  7098. 685.35 s [vector] takeWhile: OK
  7099. 685.36 s [vector] +++ OK, passed 100 tests.
  7100. 685.36 s [vector] dropWhile: OK
  7101. 685.36 s [vector] +++ OK, passed 100 tests.
  7102. 685.36 s [vector] partition: OK
  7103. 685.36 s [vector] +++ OK, passed 100 tests.
  7104. 685.36 s [vector] partitionWith: OK
  7105. 685.36 s [vector] +++ OK, passed 100 tests.
  7106. 685.36 s [vector] span: OK
  7107. 685.36 s [vector] +++ OK, passed 100 tests.
  7108. 685.36 s [vector] break: OK
  7109. 685.36 s [vector] +++ OK, passed 100 tests.
  7110. 685.37 s [vector] spanR: OK
  7111. 685.37 s [vector] +++ OK, passed 100 tests.
  7112. 685.37 s [vector] breakR: OK
  7113. 685.37 s [vector] +++ OK, passed 100 tests.
  7114. 685.37 s [vector] groupBy: OK
  7115. 685.37 s [vector] +++ OK, passed 100 tests.
  7116. 685.37 s [vector] elem: OK
  7117. 685.37 s [vector] +++ OK, passed 100 tests.
  7118. 685.37 s [vector] notElem: OK
  7119. 685.37 s [vector] +++ OK, passed 100 tests.
  7120. 685.38 s [vector] find: OK
  7121. 685.38 s [vector] +++ OK, passed 100 tests.
  7122. 685.38 s [vector] findIndex: OK
  7123. 685.38 s [vector] +++ OK, passed 100 tests.
  7124. 685.39 s [vector] findIndexR: OK
  7125. 685.39 s [vector] +++ OK, passed 100 tests.
  7126. 685.40 s [vector] findIndices: OK
  7127. 685.41 s [vector] +++ OK, passed 100 tests.
  7128. 685.41 s [vector] elemIndex: OK
  7129. 685.42 s [vector] +++ OK, passed 100 tests.
  7130. 685.43 s [vector] elemIndices: OK
  7131. 685.43 s [vector] +++ OK, passed 100 tests.
  7132. 685.43 s [vector] foldl: OK
  7133. 685.43 s [vector] +++ OK, passed 100 tests.
  7134. 685.43 s [vector] foldl1: OK
  7135. 685.43 s [vector] +++ OK, passed 100 tests; 25 discarded.
  7136. 685.43 s [vector] foldl': OK
  7137. 685.43 s [vector] +++ OK, passed 100 tests.
  7138. 685.44 s [vector] foldl1': OK
  7139. 685.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7140. 685.45 s [vector] foldr: OK
  7141. 685.45 s [vector] +++ OK, passed 100 tests.
  7142. 685.45 s [vector] foldr1: OK
  7143. 685.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7144. 685.45 s [vector] foldr': OK
  7145. 685.45 s [vector] +++ OK, passed 100 tests.
  7146. 685.45 s [vector] foldr1': OK
  7147. 685.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7148. 685.45 s [vector] ifoldl: OK
  7149. 685.45 s [vector] +++ OK, passed 100 tests.
  7150. 685.46 s [vector] ifoldl': OK
  7151. 685.47 s [vector] +++ OK, passed 100 tests.
  7152. 685.47 s [vector] ifoldr: OK
  7153. 685.48 s [vector] +++ OK, passed 100 tests.
  7154. 685.48 s [vector] ifoldr': OK
  7155. 685.48 s [vector] +++ OK, passed 100 tests.
  7156. 685.49 s [vector] ifoldM: OK
  7157. 685.49 s [vector] +++ OK, passed 100 tests.
  7158. 685.50 s [vector] ifoldM': OK
  7159. 685.50 s [vector] +++ OK, passed 100 tests.
  7160. 685.53 s [vector] ifoldM_: OK (0.04s)
  7161. 685.53 s [vector] +++ OK, passed 100 tests.
  7162. 685.57 s [vector] ifoldM'_: OK (0.04s)
  7163. 685.57 s [vector] +++ OK, passed 100 tests.
  7164. 685.57 s [vector] all: OK
  7165. 685.57 s [vector] +++ OK, passed 100 tests.
  7166. 685.58 s [vector] any: OK
  7167. 685.58 s [vector] +++ OK, passed 100 tests.
  7168. 685.59 s [vector] prescanl: OK
  7169. 685.59 s [vector] +++ OK, passed 100 tests.
  7170. 685.59 s [vector] prescanl': OK
  7171. 685.59 s [vector] +++ OK, passed 100 tests.
  7172. 685.60 s [vector] postscanl: OK
  7173. 685.60 s [vector] +++ OK, passed 100 tests.
  7174. 685.61 s [vector] postscanl': OK
  7175. 685.61 s [vector] +++ OK, passed 100 tests.
  7176. 685.61 s [vector] scanl: OK
  7177. 685.61 s [vector] +++ OK, passed 100 tests.
  7178. 685.62 s [vector] scanl': OK
  7179. 685.62 s [vector] +++ OK, passed 100 tests.
  7180. 685.63 s [vector] scanl1: OK
  7181. 685.63 s [vector] +++ OK, passed 100 tests.
  7182. 685.63 s [vector] scanl1': OK
  7183. 685.63 s [vector] +++ OK, passed 100 tests.
  7184. 685.64 s [vector] iscanl: OK
  7185. 685.64 s [vector] +++ OK, passed 100 tests.
  7186. 685.65 s [vector] iscanl': OK
  7187. 685.65 s [vector] +++ OK, passed 100 tests.
  7188. 685.66 s [vector] prescanr: OK
  7189. 685.66 s [vector] +++ OK, passed 100 tests.
  7190. 685.67 s [vector] prescanr': OK
  7191. 685.67 s [vector] +++ OK, passed 100 tests.
  7192. 685.67 s [vector] postscanr: OK
  7193. 685.67 s [vector] +++ OK, passed 100 tests.
  7194. 685.68 s [vector] postscanr': OK
  7195. 685.69 s [vector] +++ OK, passed 100 tests.
  7196. 685.69 s [vector] scanr: OK
  7197. 685.69 s [vector] +++ OK, passed 100 tests.
  7198. 685.70 s [vector] scanr': OK
  7199. 685.70 s [vector] +++ OK, passed 100 tests.
  7200. 685.70 s [vector] scanr1: OK
  7201. 685.70 s [vector] +++ OK, passed 100 tests.
  7202. 685.72 s [vector] scanr1': OK
  7203. 685.72 s [vector] +++ OK, passed 100 tests.
  7204. 685.73 s [vector] iscanr: OK
  7205. 685.73 s [vector] +++ OK, passed 100 tests.
  7206. 685.73 s [vector] iscanr': OK
  7207. 685.73 s [vector] +++ OK, passed 100 tests.
  7208. 685.73 s [vector] mut_read: OK
  7209. 685.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7210. 685.73 s [vector] mut_write: OK
  7211. 685.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7212. 685.73 s [vector] mut_modify: OK
  7213. 685.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7214. 685.75 s [vector] mut_generate: OK
  7215. 685.75 s [vector] +++ OK, passed 100 tests.
  7216. 685.75 s [vector] mut_generateM: OK (0.02s)
  7217. 685.75 s [vector] +++ OK, passed 100 tests.
  7218. 685.78 s [vector] mut_mapM_: OK (0.02s)
  7219. 685.78 s [vector] +++ OK, passed 100 tests.
  7220. 685.82 s [vector] mut_imapM_: OK (0.03s)
  7221. 685.82 s [vector] +++ OK, passed 100 tests.
  7222. 685.84 s [vector] mut_forM_: OK (0.03s)
  7223. 685.84 s [vector] +++ OK, passed 100 tests.
  7224. 685.87 s [vector] mut_iforM_: OK (0.03s)
  7225. 685.87 s [vector] +++ OK, passed 100 tests.
  7226. 685.89 s [vector] mut_foldr: OK
  7227. 685.89 s [vector] +++ OK, passed 100 tests.
  7228. 685.89 s [vector] mut_foldr': OK
  7229. 685.89 s [vector] +++ OK, passed 100 tests.
  7230. 685.91 s [vector] mut_foldl: OK (0.01s)
  7231. 685.91 s [vector] +++ OK, passed 100 tests.
  7232. 685.91 s [vector] mut_foldl': OK
  7233. 685.92 s [vector] +++ OK, passed 100 tests.
  7234. 685.93 s [vector] mut_ifoldr: OK (0.01s)
  7235. 685.93 s [vector] +++ OK, passed 100 tests.
  7236. 685.93 s [vector] mut_ifoldr': OK (0.01s)
  7237. 685.93 s [vector] +++ OK, passed 100 tests.
  7238. 685.95 s [vector] mut_ifoldl: OK
  7239. 685.95 s [vector] +++ OK, passed 100 tests.
  7240. 685.96 s [vector] mut_ifoldl': OK (0.02s)
  7241. 685.97 s [vector] +++ OK, passed 100 tests.
  7242. 685.98 s [vector] mut_foldM: OK (0.02s)
  7243. 685.99 s [vector] +++ OK, passed 100 tests.
  7244. 686.00 s [vector] mut_foldM': OK (0.01s)
  7245. 686.00 s [vector] +++ OK, passed 100 tests.
  7246. 686.01 s [vector] mut_foldrM: OK (0.01s)
  7247. 686.01 s [vector] +++ OK, passed 100 tests.
  7248. 686.01 s [vector] mut_foldrM': OK
  7249. 686.02 s [vector] +++ OK, passed 100 tests.
  7250. 686.03 s [vector] mut_ifoldM: OK (0.01s)
  7251. 686.03 s [vector] +++ OK, passed 100 tests.
  7252. 686.04 s [vector] mut_ifoldM': OK (0.01s)
  7253. 686.04 s [vector] +++ OK, passed 100 tests.
  7254. 686.05 s [vector] mut_ifoldrM: OK
  7255. 686.05 s [vector] +++ OK, passed 100 tests.
  7256. 686.06 s [vector] mut_ifoldrM': OK
  7257. 686.06 s [vector] +++ OK, passed 100 tests.
  7258. 686.06 s [vector] compare: OK
  7259. 686.06 s [vector] +++ OK, passed 100 tests.
  7260. 686.06 s [vector] maximum: OK
  7261. 686.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7262. 686.06 s [vector] minimum: OK
  7263. 686.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7264. 686.06 s [vector] minIndex: OK
  7265. 686.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7266. 686.06 s [vector] maxIndex: OK
  7267. 686.06 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7268. 686.06 s [vector] maximumBy: OK
  7269. 686.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7270. 686.07 s [vector] minimumBy: OK
  7271. 686.07 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7272. 686.07 s [vector] maximumOn: OK
  7273. 686.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7274. 686.07 s [vector] minimumOn: OK
  7275. 686.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7276. 686.07 s [vector] maxIndexBy: OK
  7277. 686.07 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7278. 686.07 s [vector] minIndexBy: OK
  7279. 686.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7280. 686.07 s [vector] ListFirstMaxIndexWins: OK
  7281. 686.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7282. 686.07 s [vector] FalseListFirstMaxIndexWins: OK
  7283. 686.07 s [vector] +++ OK, failed as expected. (after 1 test):
  7284. 686.07 s [vector] Exception:
  7285. 686.07 s [vector] Prelude.foldr1: empty list
  7286. 686.07 s [vector] CallStack (from HasCallStack):
  7287. 686.07 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7288. 686.07 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7289. 686.07 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7290. 686.07 s [vector] []
  7291. 686.07 s [vector] zip: OK
  7292. 686.07 s [vector] +++ OK, passed 100 tests.
  7293. 686.08 s [vector] zip3: OK
  7294. 686.08 s [vector] +++ OK, passed 100 tests.
  7295. 686.08 s [vector] unzip: OK
  7296. 686.08 s [vector] +++ OK, passed 100 tests.
  7297. 686.08 s [vector] unzip3: OK
  7298. 686.08 s [vector] +++ OK, passed 100 tests.
  7299. 686.08 s [vector] indexed: OK
  7300. 686.08 s [vector] +++ OK, passed 100 tests.
  7301. 686.09 s [vector] update: OK
  7302. 686.09 s [vector] +++ OK, passed 100 tests.
  7303. 686.09 s [vector] mempty: OK
  7304. 686.09 s [vector] +++ OK, passed 100 tests.
  7305. 686.09 s [vector] mappend: OK
  7306. 686.10 s [vector] +++ OK, passed 100 tests.
  7307. 686.11 s [vector] mconcat: OK (0.02s)
  7308. 686.11 s [vector] +++ OK, passed 100 tests.
  7309. 686.11 s [vector] glength: OK
  7310. 686.11 s [vector] +++ OK, passed 100 tests.
  7311. 686.11 s [vector] sum: OK
  7312. 686.12 s [vector] +++ OK, passed 100 tests.
  7313. 686.12 s [vector] product: OK
  7314. 686.12 s [vector] +++ OK, passed 100 tests.
  7315. 686.12 s [vector] enumFromN: OK
  7316. 686.12 s [vector] +++ OK, passed 100 tests.
  7317. 686.12 s [vector] enumFromThenN: OK
  7318. 686.12 s [vector] +++ OK, passed 100 tests.
  7319. 686.12 s [vector] enumFromTo: OK
  7320. 686.12 s [vector] +++ OK, passed 100 tests.
  7321. 686.12 s [vector] enumFromThenTo: OK
  7322. 686.12 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7323. 686.12 s [vector] (Double)
  7324. 686.12 s [vector] fromList.toList == id: OK
  7325. 686.12 s [vector] +++ OK, passed 100 tests.
  7326. 686.12 s [vector] toList.fromList == id: OK
  7327. 686.13 s [vector] +++ OK, passed 100 tests.
  7328. 686.13 s [vector] unstream.stream == id: OK
  7329. 686.13 s [vector] +++ OK, passed 100 tests.
  7330. 686.13 s [vector] stream.unstream == id: OK
  7331. 686.13 s [vector] +++ OK, passed 100 tests.
  7332. 686.13 s [vector] eq: OK
  7333. 686.13 s [vector] +++ OK, passed 100 tests.
  7334. 686.13 s [vector] length: OK
  7335. 686.13 s [vector] +++ OK, passed 100 tests.
  7336. 686.13 s [vector] null: OK
  7337. 686.13 s [vector] +++ OK, passed 100 tests.
  7338. 686.13 s [vector] index: OK
  7339. 686.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7340. 686.13 s [vector] safeIndex: OK
  7341. 686.13 s [vector] +++ OK, passed 100 tests.
  7342. 686.13 s [vector] head: OK
  7343. 686.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7344. 686.13 s [vector] last: OK
  7345. 686.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7346. 686.13 s [vector] unsafeIndex: OK
  7347. 686.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7348. 686.13 s [vector] unsafeHead: OK
  7349. 686.13 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7350. 686.13 s [vector] unsafeLast: OK
  7351. 686.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7352. 686.13 s [vector] slice: OK
  7353. 686.13 s [vector] +++ OK, passed 100 tests.
  7354. 686.13 s [vector] init: OK
  7355. 686.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7356. 686.13 s [vector] tail: OK
  7357. 686.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7358. 686.14 s [vector] take: OK
  7359. 686.14 s [vector] +++ OK, passed 100 tests.
  7360. 686.14 s [vector] drop: OK
  7361. 686.14 s [vector] +++ OK, passed 100 tests.
  7362. 686.14 s [vector] splitAt: OK
  7363. 686.14 s [vector] +++ OK, passed 100 tests.
  7364. 686.14 s [vector] empty: OK
  7365. 686.14 s [vector] +++ OK, passed 100 tests.
  7366. 686.14 s [vector] singleton: OK
  7367. 686.14 s [vector] +++ OK, passed 100 tests.
  7368. 686.14 s [vector] replicate: OK
  7369. 686.14 s [vector] +++ OK, passed 100 tests.
  7370. 686.15 s [vector] generate: OK
  7371. 686.15 s [vector] +++ OK, passed 100 tests.
  7372. 686.15 s [vector] iterateN: OK
  7373. 686.15 s [vector] +++ OK, passed 100 tests.
  7374. 686.18 s [vector] iterateNM: OK (0.04s)
  7375. 686.18 s [vector] +++ OK, passed 100 tests.
  7376. 686.22 s [vector] generateM: OK (0.04s)
  7377. 686.23 s [vector] +++ OK, passed 100 tests.
  7378. 686.23 s [vector] replicateM: OK (0.01s)
  7379. 686.23 s [vector] +++ OK, passed 100 tests.
  7380. 686.23 s [vector] create: OK
  7381. 686.23 s [vector] +++ OK, passed 100 tests.
  7382. 686.24 s [vector] createT: OK
  7383. 686.25 s [vector] +++ OK, passed 100 tests.
  7384. 686.26 s [vector] unfoldr: OK
  7385. 686.26 s [vector] +++ OK, passed 100 tests.
  7386. 686.26 s [vector] unfoldrN: OK
  7387. 686.27 s [vector] +++ OK, passed 100 tests.
  7388. 686.27 s [vector] unfoldrExactN: OK
  7389. 686.27 s [vector] +++ OK, passed 100 tests.
  7390. 686.27 s [vector] unfoldrM: OK
  7391. 686.27 s [vector] +++ OK, passed 100 tests.
  7392. 686.27 s [vector] unfoldrNM: OK (0.02s)
  7393. 686.27 s [vector] +++ OK, passed 100 tests.
  7394. 686.31 s [vector] unfoldrExactNM: OK (0.05s)
  7395. 686.32 s [vector] +++ OK, passed 100 tests.
  7396. 686.35 s [vector] constructN: OK (0.01s)
  7397. 686.35 s [vector] +++ OK, passed 100 tests.
  7398. 686.36 s [vector] constructrN: OK (0.02s)
  7399. 686.36 s [vector] +++ OK, passed 100 tests.
  7400. 686.36 s [vector] cons: OK
  7401. 686.36 s [vector] +++ OK, passed 100 tests.
  7402. 686.36 s [vector] snoc: OK
  7403. 686.36 s [vector] +++ OK, passed 100 tests.
  7404. 686.36 s [vector] append: OK
  7405. 686.37 s [vector] +++ OK, passed 100 tests.
  7406. 686.39 s [vector] concat: OK (0.03s)
  7407. 686.39 s [vector] +++ OK, passed 100 tests.
  7408. 686.39 s [vector] force: OK
  7409. 686.40 s [vector] +++ OK, passed 100 tests.
  7410. 686.41 s [vector] upd: OK
  7411. 686.41 s [vector] +++ OK, passed 100 tests.
  7412. 686.41 s [vector] accum: OK (0.02s)
  7413. 686.42 s [vector] +++ OK, passed 100 tests.
  7414. 686.42 s [vector] reverse: OK
  7415. 686.43 s [vector] +++ OK, passed 100 tests.
  7416. 686.44 s [vector] backpermute: OK
  7417. 686.45 s [vector] +++ OK, passed 100 tests.
  7418. 686.45 s [vector] map: OK
  7419. 686.45 s [vector] +++ OK, passed 100 tests.
  7420. 686.45 s [vector] imap: OK (0.01s)
  7421. 686.45 s [vector] +++ OK, passed 100 tests.
  7422. 686.46 s [vector] concatMap: OK
  7423. 686.46 s [vector] +++ OK, passed 100 tests.
  7424. 686.46 s [vector] mapM: OK
  7425. 686.46 s [vector] +++ OK, passed 100 tests.
  7426. 686.50 s [vector] mapM_: OK (0.03s)
  7427. 686.50 s [vector] +++ OK, passed 100 tests.
  7428. 686.51 s [vector] forM: OK
  7429. 686.51 s [vector] +++ OK, passed 100 tests.
  7430. 686.55 s [vector] forM_: OK (0.04s)
  7431. 686.55 s [vector] +++ OK, passed 100 tests.
  7432. 686.57 s [vector] imapM: OK (0.01s)
  7433. 686.57 s [vector] +++ OK, passed 100 tests.
  7434. 686.63 s [vector] imapM_: OK (0.06s)
  7435. 686.63 s [vector] +++ OK, passed 100 tests.
  7436. 686.64 s [vector] zipWith: OK (0.01s)
  7437. 686.64 s [vector] +++ OK, passed 100 tests.
  7438. 686.64 s [vector] zipWith3: OK (0.02s)
  7439. 686.64 s [vector] +++ OK, passed 100 tests.
  7440. 686.66 s [vector] izipWith: OK (0.02s)
  7441. 686.66 s [vector] +++ OK, passed 100 tests.
  7442. 686.68 s [vector] izipWith3: OK (0.02s)
  7443. 686.69 s [vector] +++ OK, passed 100 tests.
  7444. 686.70 s [vector] izipWithM: OK (0.02s)
  7445. 686.71 s [vector] +++ OK, passed 100 tests.
  7446. 686.74 s [vector] izipWithM_: OK (0.03s)
  7447. 686.75 s [vector] +++ OK, passed 100 tests.
  7448. 686.76 s [vector] zipWithM: OK (0.01s)
  7449. 686.76 s [vector] +++ OK, passed 100 tests.
  7450. 686.80 s [vector] zipWithM_: OK (0.05s)
  7451. 686.81 s [vector] +++ OK, passed 100 tests.
  7452. 686.82 s [vector] filter: OK (0.01s)
  7453. 686.82 s [vector] +++ OK, passed 100 tests.
  7454. 686.83 s [vector] ifilter: OK (0.01s)
  7455. 686.83 s [vector] +++ OK, passed 100 tests.
  7456. 686.89 s [vector] filterM: OK (0.07s)
  7457. 686.90 s [vector] +++ OK, passed 100 tests.
  7458. 686.91 s [vector] uniq: OK
  7459. 686.91 s [vector] +++ OK, passed 100 tests.
  7460. 686.91 s [vector] mapMaybe: OK
  7461. 686.91 s [vector] +++ OK, passed 100 tests.
  7462. 686.91 s [vector] imapMaybe: OK
  7463. 686.91 s [vector] +++ OK, passed 100 tests.
  7464. 686.92 s [vector] takeWhile: OK
  7465. 686.93 s [vector] +++ OK, passed 100 tests.
  7466. 686.93 s [vector] dropWhile: OK
  7467. 686.93 s [vector] +++ OK, passed 100 tests.
  7468. 686.93 s [vector] partition: OK
  7469. 686.93 s [vector] +++ OK, passed 100 tests.
  7470. 686.93 s [vector] partitionWith: OK
  7471. 686.93 s [vector] +++ OK, passed 100 tests.
  7472. 686.93 s [vector] span: OK
  7473. 686.93 s [vector] +++ OK, passed 100 tests.
  7474. 686.94 s [vector] break: OK
  7475. 686.94 s [vector] +++ OK, passed 100 tests.
  7476. 686.94 s [vector] spanR: OK
  7477. 686.94 s [vector] +++ OK, passed 100 tests.
  7478. 686.94 s [vector] breakR: OK
  7479. 686.94 s [vector] +++ OK, passed 100 tests.
  7480. 686.95 s [vector] groupBy: OK (0.01s)
  7481. 686.95 s [vector] +++ OK, passed 100 tests.
  7482. 686.95 s [vector] elem: OK
  7483. 686.95 s [vector] +++ OK, passed 100 tests.
  7484. 686.95 s [vector] notElem: OK
  7485. 686.95 s [vector] +++ OK, passed 100 tests.
  7486. 686.95 s [vector] find: OK
  7487. 686.95 s [vector] +++ OK, passed 100 tests.
  7488. 686.95 s [vector] findIndex: OK
  7489. 686.96 s [vector] +++ OK, passed 100 tests.
  7490. 686.96 s [vector] findIndexR: OK
  7491. 686.96 s [vector] +++ OK, passed 100 tests.
  7492. 686.96 s [vector] findIndices: OK
  7493. 686.96 s [vector] +++ OK, passed 100 tests.
  7494. 686.96 s [vector] elemIndex: OK
  7495. 686.96 s [vector] +++ OK, passed 100 tests.
  7496. 686.96 s [vector] elemIndices: OK
  7497. 686.96 s [vector] +++ OK, passed 100 tests.
  7498. 686.98 s [vector] foldl: OK (0.01s)
  7499. 686.98 s [vector] +++ OK, passed 100 tests.
  7500. 687.00 s [vector] foldl1: OK (0.01s)
  7501. 687.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7502. 687.01 s [vector] foldl': OK (0.01s)
  7503. 687.01 s [vector] +++ OK, passed 100 tests.
  7504. 687.02 s [vector] foldl1': OK (0.01s)
  7505. 687.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7506. 687.04 s [vector] foldr: OK (0.02s)
  7507. 687.05 s [vector] +++ OK, passed 100 tests.
  7508. 687.06 s [vector] foldr1: OK (0.02s)
  7509. 687.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7510. 687.08 s [vector] foldr': OK (0.02s)
  7511. 687.08 s [vector] +++ OK, passed 100 tests.
  7512. 687.10 s [vector] foldr1': OK (0.02s)
  7513. 687.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7514. 687.12 s [vector] ifoldl: OK (0.02s)
  7515. 687.12 s [vector] +++ OK, passed 100 tests.
  7516. 687.14 s [vector] ifoldl': OK (0.02s)
  7517. 687.14 s [vector] +++ OK, passed 100 tests.
  7518. 687.16 s [vector] ifoldr: OK (0.02s)
  7519. 687.17 s [vector] +++ OK, passed 100 tests.
  7520. 687.18 s [vector] ifoldr': OK (0.02s)
  7521. 687.19 s [vector] +++ OK, passed 100 tests.
  7522. 687.20 s [vector] ifoldM: OK (0.02s)
  7523. 687.20 s [vector] +++ OK, passed 100 tests.
  7524. 687.21 s [vector] ifoldM': OK
  7525. 687.21 s [vector] +++ OK, passed 100 tests.
  7526. 687.26 s [vector] ifoldM_: OK (0.05s)
  7527. 687.26 s [vector] +++ OK, passed 100 tests.
  7528. 687.30 s [vector] ifoldM'_: OK (0.04s)
  7529. 687.30 s [vector] +++ OK, passed 100 tests.
  7530. 687.30 s [vector] all: OK
  7531. 687.30 s [vector] +++ OK, passed 100 tests.
  7532. 687.30 s [vector] any: OK
  7533. 687.30 s [vector] +++ OK, passed 100 tests.
  7534. 687.32 s [vector] prescanl: OK (0.01s)
  7535. 687.33 s [vector] +++ OK, passed 100 tests.
  7536. 687.33 s [vector] prescanl': OK (0.01s)
  7537. 687.33 s [vector] +++ OK, passed 100 tests.
  7538. 687.34 s [vector] postscanl: OK
  7539. 687.34 s [vector] +++ OK, passed 100 tests.
  7540. 687.36 s [vector] postscanl': OK (0.01s)
  7541. 687.37 s [vector] +++ OK, passed 100 tests.
  7542. 687.38 s [vector] scanl: OK (0.02s)
  7543. 687.39 s [vector] +++ OK, passed 100 tests.
  7544. 687.40 s [vector] scanl': OK (0.01s)
  7545. 687.40 s [vector] +++ OK, passed 100 tests.
  7546. 687.42 s [vector] scanl1: OK (0.01s)
  7547. 687.42 s [vector] +++ OK, passed 100 tests.
  7548. 687.43 s [vector] scanl1': OK (0.01s)
  7549. 687.43 s [vector] +++ OK, passed 100 tests.
  7550. 687.44 s [vector] iscanl: OK (0.01s)
  7551. 687.44 s [vector] +++ OK, passed 100 tests.
  7552. 687.46 s [vector] iscanl': OK (0.02s)
  7553. 687.46 s [vector] +++ OK, passed 100 tests.
  7554. 687.47 s [vector] prescanr: OK (0.01s)
  7555. 687.47 s [vector] +++ OK, passed 100 tests.
  7556. 687.48 s [vector] prescanr': OK (0.02s)
  7557. 687.49 s [vector] +++ OK, passed 100 tests.
  7558. 687.50 s [vector] postscanr: OK (0.01s)
  7559. 687.51 s [vector] +++ OK, passed 100 tests.
  7560. 687.52 s [vector] postscanr': OK (0.01s)
  7561. 687.53 s [vector] +++ OK, passed 100 tests.
  7562. 687.53 s [vector] scanr: OK (0.01s)
  7563. 687.53 s [vector] +++ OK, passed 100 tests.
  7564. 687.55 s [vector] scanr': OK (0.01s)
  7565. 687.55 s [vector] +++ OK, passed 100 tests.
  7566. 687.56 s [vector] scanr1: OK (0.01s)
  7567. 687.57 s [vector] +++ OK, passed 100 tests.
  7568. 687.57 s [vector] scanr1': OK (0.01s)
  7569. 687.57 s [vector] +++ OK, passed 100 tests.
  7570. 687.58 s [vector] iscanr: OK (0.01s)
  7571. 687.59 s [vector] +++ OK, passed 100 tests.
  7572. 687.59 s [vector] iscanr': OK (0.01s)
  7573. 687.59 s [vector] +++ OK, passed 100 tests.
  7574. 687.59 s [vector] mut_read: OK
  7575. 687.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7576. 687.59 s [vector] mut_write: OK
  7577. 687.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7578. 687.60 s [vector] mut_modify: OK
  7579. 687.60 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7580. 687.60 s [vector] mut_generate: OK
  7581. 687.60 s [vector] +++ OK, passed 100 tests.
  7582. 687.62 s [vector] mut_generateM: OK (0.02s)
  7583. 687.62 s [vector] +++ OK, passed 100 tests.
  7584. 687.66 s [vector] mut_mapM_: OK (0.04s)
  7585. 687.66 s [vector] +++ OK, passed 100 tests.
  7586. 687.70 s [vector] mut_imapM_: OK (0.04s)
  7587. 687.71 s [vector] +++ OK, passed 100 tests.
  7588. 687.75 s [vector] mut_forM_: OK (0.04s)
  7589. 687.75 s [vector] +++ OK, passed 100 tests.
  7590. 687.79 s [vector] mut_iforM_: OK (0.04s)
  7591. 687.79 s [vector] +++ OK, passed 100 tests.
  7592. 687.80 s [vector] mut_foldr: OK (0.03s)
  7593. 687.80 s [vector] +++ OK, passed 100 tests.
  7594. 687.82 s [vector] mut_foldr': OK (0.02s)
  7595. 687.83 s [vector] +++ OK, passed 100 tests.
  7596. 687.84 s [vector] mut_foldl: OK (0.01s)
  7597. 687.84 s [vector] +++ OK, passed 100 tests.
  7598. 687.85 s [vector] mut_foldl': OK (0.01s)
  7599. 687.85 s [vector] +++ OK, passed 100 tests.
  7600. 687.86 s [vector] mut_ifoldr: OK (0.02s)
  7601. 687.87 s [vector] +++ OK, passed 100 tests.
  7602. 687.89 s [vector] mut_ifoldr': OK (0.02s)
  7603. 687.89 s [vector] +++ OK, passed 100 tests.
  7604. 687.90 s [vector] mut_ifoldl: OK (0.02s)
  7605. 687.90 s [vector] +++ OK, passed 100 tests.
  7606. 687.90 s [vector] mut_ifoldl': OK (0.01s)
  7607. 687.90 s [vector] +++ OK, passed 100 tests.
  7608. 687.92 s [vector] mut_foldM: OK (0.01s)
  7609. 687.93 s [vector] +++ OK, passed 100 tests.
  7610. 687.94 s [vector] mut_foldM': OK (0.01s)
  7611. 687.95 s [vector] +++ OK, passed 100 tests.
  7612. 687.96 s [vector] mut_foldrM: OK (0.02s)
  7613. 687.96 s [vector] +++ OK, passed 100 tests.
  7614. 687.97 s [vector] mut_foldrM': OK (0.01s)
  7615. 687.97 s [vector] +++ OK, passed 100 tests.
  7616. 687.98 s [vector] mut_ifoldM: OK (0.02s)
  7617. 687.99 s [vector] +++ OK, passed 100 tests.
  7618. 688.00 s [vector] mut_ifoldM': OK (0.02s)
  7619. 688.01 s [vector] +++ OK, passed 100 tests.
  7620. 688.02 s [vector] mut_ifoldrM: OK (0.02s)
  7621. 688.03 s [vector] +++ OK, passed 100 tests.
  7622. 688.03 s [vector] mut_ifoldrM': OK (0.02s)
  7623. 688.03 s [vector] +++ OK, passed 100 tests.
  7624. 688.03 s [vector] compare: OK
  7625. 688.03 s [vector] +++ OK, passed 100 tests.
  7626. 688.03 s [vector] maximum: OK
  7627. 688.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7628. 688.03 s [vector] minimum: OK
  7629. 688.03 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7630. 688.03 s [vector] minIndex: OK
  7631. 688.03 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7632. 688.03 s [vector] maxIndex: OK
  7633. 688.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7634. 688.04 s [vector] maximumBy: OK
  7635. 688.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7636. 688.04 s [vector] minimumBy: OK
  7637. 688.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7638. 688.04 s [vector] maximumOn: OK
  7639. 688.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7640. 688.04 s [vector] minimumOn: OK
  7641. 688.04 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7642. 688.04 s [vector] maxIndexBy: OK
  7643. 688.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7644. 688.04 s [vector] minIndexBy: OK
  7645. 688.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7646. 688.04 s [vector] ListFirstMaxIndexWins: OK
  7647. 688.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7648. 688.04 s [vector] FalseListFirstMaxIndexWins: OK
  7649. 688.04 s [vector] +++ OK, failed as expected. (after 1 test):
  7650. 688.04 s [vector] Exception:
  7651. 688.04 s [vector] Prelude.foldr1: empty list
  7652. 688.04 s [vector] CallStack (from HasCallStack):
  7653. 688.04 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7654. 688.05 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7655. 688.05 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7656. 688.05 s [vector] []
  7657. 688.05 s [vector] zip: OK
  7658. 688.05 s [vector] +++ OK, passed 100 tests.
  7659. 688.05 s [vector] zip3: OK
  7660. 688.05 s [vector] +++ OK, passed 100 tests.
  7661. 688.05 s [vector] unzip: OK
  7662. 688.05 s [vector] +++ OK, passed 100 tests.
  7663. 688.05 s [vector] unzip3: OK
  7664. 688.05 s [vector] +++ OK, passed 100 tests.
  7665. 688.05 s [vector] indexed: OK
  7666. 688.06 s [vector] +++ OK, passed 100 tests.
  7667. 688.06 s [vector] update: OK
  7668. 688.06 s [vector] +++ OK, passed 100 tests.
  7669. 688.06 s [vector] mempty: OK
  7670. 688.06 s [vector] +++ OK, passed 100 tests.
  7671. 688.06 s [vector] mappend: OK
  7672. 688.06 s [vector] +++ OK, passed 100 tests.
  7673. 688.09 s [vector] mconcat: OK (0.03s)
  7674. 688.09 s [vector] +++ OK, passed 100 tests.
  7675. 688.09 s [vector] glength: OK
  7676. 688.09 s [vector] +++ OK, passed 100 tests.
  7677. 688.09 s [vector] sum: OK
  7678. 688.09 s [vector] +++ OK, passed 100 tests.
  7679. 688.09 s [vector] product: OK
  7680. 688.09 s [vector] +++ OK, passed 100 tests.
  7681. 688.10 s [vector] enumFromN: OK
  7682. 688.10 s [vector] +++ OK, passed 100 tests.
  7683. 688.10 s [vector] enumFromThenN: OK
  7684. 688.10 s [vector] +++ OK, passed 100 tests.
  7685. 688.10 s [vector] enumFromTo: OK
  7686. 688.10 s [vector] +++ OK, passed 100 tests.
  7687. 688.10 s [vector] enumFromThenTo: OK
  7688. 688.10 s [vector] +++ OK, passed 100 tests.
  7689. 688.10 s [vector] (Int,Bool)
  7690. 688.10 s [vector] fromList.toList == id: OK
  7691. 688.10 s [vector] +++ OK, passed 100 tests.
  7692. 688.11 s [vector] toList.fromList == id: OK
  7693. 688.11 s [vector] +++ OK, passed 100 tests.
  7694. 688.11 s [vector] unstream.stream == id: OK
  7695. 688.11 s [vector] +++ OK, passed 100 tests.
  7696. 688.11 s [vector] stream.unstream == id: OK
  7697. 688.12 s [vector] +++ OK, passed 100 tests.
  7698. 688.12 s [vector] eq: OK
  7699. 688.12 s [vector] +++ OK, passed 100 tests.
  7700. 688.12 s [vector] length: OK
  7701. 688.12 s [vector] +++ OK, passed 100 tests.
  7702. 688.12 s [vector] null: OK
  7703. 688.12 s [vector] +++ OK, passed 100 tests.
  7704. 688.12 s [vector] index: OK
  7705. 688.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7706. 688.12 s [vector] safeIndex: OK
  7707. 688.12 s [vector] +++ OK, passed 100 tests.
  7708. 688.12 s [vector] head: OK
  7709. 688.12 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7710. 688.12 s [vector] last: OK
  7711. 688.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7712. 688.12 s [vector] unsafeIndex: OK
  7713. 688.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7714. 688.12 s [vector] unsafeHead: OK
  7715. 688.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7716. 688.12 s [vector] unsafeLast: OK
  7717. 688.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7718. 688.12 s [vector] slice: OK
  7719. 688.12 s [vector] +++ OK, passed 100 tests.
  7720. 688.12 s [vector] init: OK
  7721. 688.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7722. 688.12 s [vector] tail: OK
  7723. 688.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7724. 688.12 s [vector] take: OK
  7725. 688.12 s [vector] +++ OK, passed 100 tests.
  7726. 688.12 s [vector] drop: OK
  7727. 688.12 s [vector] +++ OK, passed 100 tests.
  7728. 688.12 s [vector] splitAt: OK
  7729. 688.12 s [vector] +++ OK, passed 100 tests.
  7730. 688.12 s [vector] empty: OK
  7731. 688.12 s [vector] +++ OK, passed 100 tests.
  7732. 688.12 s [vector] singleton: OK
  7733. 688.12 s [vector] +++ OK, passed 100 tests.
  7734. 688.12 s [vector] replicate: OK
  7735. 688.12 s [vector] +++ OK, passed 100 tests.
  7736. 688.12 s [vector] generate: OK
  7737. 688.12 s [vector] +++ OK, passed 100 tests.
  7738. 688.14 s [vector] iterateN: OK
  7739. 688.14 s [vector] +++ OK, passed 100 tests.
  7740. 688.19 s [vector] iterateNM: OK (0.05s)
  7741. 688.19 s [vector] +++ OK, passed 100 tests.
  7742. 688.24 s [vector] generateM: OK (0.06s)
  7743. 688.25 s [vector] +++ OK, passed 100 tests.
  7744. 688.26 s [vector] replicateM: OK (0.02s)
  7745. 688.26 s [vector] +++ OK, passed 100 tests.
  7746. 688.26 s [vector] create: OK
  7747. 688.26 s [vector] +++ OK, passed 100 tests.
  7748. 688.26 s [vector] createT: OK
  7749. 688.27 s [vector] +++ OK, passed 100 tests.
  7750. 688.27 s [vector] unfoldr: OK
  7751. 688.27 s [vector] +++ OK, passed 100 tests.
  7752. 688.28 s [vector] unfoldrN: OK
  7753. 688.29 s [vector] +++ OK, passed 100 tests.
  7754. 688.29 s [vector] unfoldrExactN: OK
  7755. 688.29 s [vector] +++ OK, passed 100 tests.
  7756. 688.29 s [vector] unfoldrM: OK
  7757. 688.30 s [vector] +++ OK, passed 100 tests.
  7758. 688.30 s [vector] unfoldrNM: OK
  7759. 688.30 s [vector] +++ OK, passed 100 tests.
  7760. 688.37 s [vector] unfoldrExactNM: OK (0.09s)
  7761. 688.37 s [vector] +++ OK, passed 100 tests.
  7762. 688.70 s [vector] constructN: OK
  7763. 688.70 s [vector] +++ OK, passed 100 tests.
  7764. 688.70 s [vector] constructrN: OK
  7765. 688.70 s [vector] +++ OK, passed 100 tests.
  7766. 688.70 s [vector] cons: OK
  7767. 688.70 s [vector] +++ OK, passed 100 tests.
  7768. 688.70 s [vector] snoc: OK
  7769. 688.70 s [vector] +++ OK, passed 100 tests.
  7770. 688.70 s [vector] append: OK
  7771. 688.70 s [vector] +++ OK, passed 100 tests.
  7772. 688.70 s [vector] concat: OK (0.04s)
  7773. 688.70 s [vector] +++ OK, passed 100 tests.
  7774. 688.70 s [vector] force: OK
  7775. 688.70 s [vector] +++ OK, passed 100 tests.
  7776. 688.70 s [vector] upd: OK
  7777. 688.70 s [vector] +++ OK, passed 100 tests.
  7778. 688.70 s [vector] accum: OK
  7779. 688.70 s [vector] +++ OK, passed 100 tests.
  7780. 688.70 s [vector] reverse: OK
  7781. 688.70 s [vector] +++ OK, passed 100 tests.
  7782. 688.70 s [vector] backpermute: OK
  7783. 688.70 s [vector] +++ OK, passed 100 tests.
  7784. 688.70 s [vector] map: OK
  7785. 688.70 s [vector] +++ OK, passed 100 tests.
  7786. 688.70 s [vector] imap: OK
  7787. 688.70 s [vector] +++ OK, passed 100 tests.
  7788. 688.70 s [vector] concatMap: OK
  7789. 688.70 s [vector] +++ OK, passed 100 tests.
  7790. 688.70 s [vector] mapM: OK
  7791. 688.70 s [vector] +++ OK, passed 100 tests.
  7792. 688.70 s [vector] mapM_: OK (0.03s)
  7793. 688.70 s [vector] +++ OK, passed 100 tests.
  7794. 688.70 s [vector] forM: OK
  7795. 688.70 s [vector] +++ OK, passed 100 tests.
  7796. 688.70 s [vector] forM_: OK (0.03s)
  7797. 688.70 s [vector] +++ OK, passed 100 tests.
  7798. 688.70 s [vector] imapM: OK
  7799. 688.70 s [vector] +++ OK, passed 100 tests.
  7800. 688.70 s [vector] imapM_: OK (0.03s)
  7801. 688.70 s [vector] +++ OK, passed 100 tests.
  7802. 688.70 s [vector] zipWith: OK
  7803. 688.70 s [vector] +++ OK, passed 100 tests.
  7804. 688.70 s [vector] zipWith3: OK
  7805. 688.70 s [vector] +++ OK, passed 100 tests.
  7806. 688.70 s [vector] izipWith: OK
  7807. 688.70 s [vector] +++ OK, passed 100 tests.
  7808. 688.70 s [vector] izipWith3: OK
  7809. 688.70 s [vector] +++ OK, passed 100 tests.
  7810. 688.70 s [vector] izipWithM: OK
  7811. 688.70 s [vector] +++ OK, passed 100 tests.
  7812. 688.70 s [vector] izipWithM_: OK (0.03s)
  7813. 688.70 s [vector] +++ OK, passed 100 tests.
  7814. 688.70 s [vector] zipWithM: OK
  7815. 688.70 s [vector] +++ OK, passed 100 tests.
  7816. 688.70 s [vector] zipWithM_: OK (0.03s)
  7817. 688.70 s [vector] +++ OK, passed 100 tests.
  7818. 688.70 s [vector] filter: OK
  7819. 688.70 s [vector] +++ OK, passed 100 tests.
  7820. 688.70 s [vector] ifilter: OK
  7821. 688.70 s [vector] +++ OK, passed 100 tests.
  7822. 688.73 s [vector] filterM: OK (0.06s)
  7823. 688.73 s [vector] +++ OK, passed 100 tests.
  7824. 688.73 s [vector] uniq: OK
  7825. 688.73 s [vector] +++ OK, passed 100 tests.
  7826. 688.74 s [vector] mapMaybe: OK
  7827. 688.74 s [vector] +++ OK, passed 100 tests.
  7828. 688.74 s [vector] imapMaybe: OK
  7829. 688.74 s [vector] +++ OK, passed 100 tests.
  7830. 688.74 s [vector] takeWhile: OK
  7831. 688.74 s [vector] +++ OK, passed 100 tests.
  7832. 688.75 s [vector] dropWhile: OK
  7833. 688.75 s [vector] +++ OK, passed 100 tests.
  7834. 688.75 s [vector] partition: OK
  7835. 688.75 s [vector] +++ OK, passed 100 tests.
  7836. 688.76 s [vector] partitionWith: OK
  7837. 688.76 s [vector] +++ OK, passed 100 tests.
  7838. 688.76 s [vector] span: OK
  7839. 688.76 s [vector] +++ OK, passed 100 tests.
  7840. 688.77 s [vector] break: OK
  7841. 688.77 s [vector] +++ OK, passed 100 tests.
  7842. 688.77 s [vector] spanR: OK
  7843. 688.77 s [vector] +++ OK, passed 100 tests.
  7844. 688.78 s [vector] breakR: OK
  7845. 688.78 s [vector] +++ OK, passed 100 tests.
  7846. 688.78 s [vector] groupBy: OK
  7847. 688.78 s [vector] +++ OK, passed 100 tests.
  7848. 688.78 s [vector] elem: OK
  7849. 688.78 s [vector] +++ OK, passed 100 tests.
  7850. 688.78 s [vector] notElem: OK
  7851. 688.78 s [vector] +++ OK, passed 100 tests.
  7852. 688.78 s [vector] find: OK
  7853. 688.79 s [vector] +++ OK, passed 100 tests.
  7854. 688.79 s [vector] findIndex: OK
  7855. 688.79 s [vector] +++ OK, passed 100 tests.
  7856. 688.79 s [vector] findIndexR: OK
  7857. 688.79 s [vector] +++ OK, passed 100 tests.
  7858. 688.79 s [vector] findIndices: OK
  7859. 688.79 s [vector] +++ OK, passed 100 tests.
  7860. 688.79 s [vector] elemIndex: OK
  7861. 688.79 s [vector] +++ OK, passed 100 tests.
  7862. 688.79 s [vector] elemIndices: OK
  7863. 688.79 s [vector] +++ OK, passed 100 tests.
  7864. 688.79 s [vector] foldl: OK
  7865. 688.79 s [vector] +++ OK, passed 100 tests.
  7866. 688.80 s [vector] foldl1: OK
  7867. 688.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7868. 688.81 s [vector] foldl': OK
  7869. 688.82 s [vector] +++ OK, passed 100 tests.
  7870. 688.82 s [vector] foldl1': OK
  7871. 688.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7872. 688.83 s [vector] foldr: OK
  7873. 688.83 s [vector] +++ OK, passed 100 tests.
  7874. 688.83 s [vector] foldr1: OK
  7875. 688.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7876. 688.84 s [vector] foldr': OK
  7877. 688.84 s [vector] +++ OK, passed 100 tests.
  7878. 688.85 s [vector] foldr1': OK
  7879. 688.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7880. 688.85 s [vector] ifoldl: OK
  7881. 688.85 s [vector] +++ OK, passed 100 tests.
  7882. 688.85 s [vector] ifoldl': OK
  7883. 688.85 s [vector] +++ OK, passed 100 tests.
  7884. 688.86 s [vector] ifoldr: OK
  7885. 688.86 s [vector] +++ OK, passed 100 tests.
  7886. 688.86 s [vector] ifoldr': OK
  7887. 688.86 s [vector] +++ OK, passed 100 tests.
  7888. 688.87 s [vector] ifoldM: OK
  7889. 688.87 s [vector] +++ OK, passed 100 tests.
  7890. 688.87 s [vector] ifoldM': OK
  7891. 688.87 s [vector] +++ OK, passed 100 tests.
  7892. 688.92 s [vector] ifoldM_: OK (0.04s)
  7893. 688.92 s [vector] +++ OK, passed 100 tests.
  7894. 688.94 s [vector] ifoldM'_: OK (0.04s)
  7895. 688.94 s [vector] +++ OK, passed 100 tests.
  7896. 688.95 s [vector] all: OK
  7897. 688.95 s [vector] +++ OK, passed 100 tests.
  7898. 688.95 s [vector] any: OK
  7899. 688.95 s [vector] +++ OK, passed 100 tests.
  7900. 688.96 s [vector] prescanl: OK
  7901. 688.96 s [vector] +++ OK, passed 100 tests.
  7902. 688.96 s [vector] prescanl': OK
  7903. 688.96 s [vector] +++ OK, passed 100 tests.
  7904. 688.97 s [vector] postscanl: OK
  7905. 688.97 s [vector] +++ OK, passed 100 tests.
  7906. 688.97 s [vector] postscanl': OK
  7907. 688.97 s [vector] +++ OK, passed 100 tests.
  7908. 688.98 s [vector] scanl: OK
  7909. 688.98 s [vector] +++ OK, passed 100 tests.
  7910. 688.98 s [vector] scanl': OK
  7911. 688.98 s [vector] +++ OK, passed 100 tests.
  7912. 688.99 s [vector] scanl1: OK
  7913. 689.00 s [vector] +++ OK, passed 100 tests.
  7914. 689.01 s [vector] scanl1': OK
  7915. 689.01 s [vector] +++ OK, passed 100 tests.
  7916. 689.01 s [vector] iscanl: OK
  7917. 689.01 s [vector] +++ OK, passed 100 tests.
  7918. 689.01 s [vector] iscanl': OK
  7919. 689.01 s [vector] +++ OK, passed 100 tests.
  7920. 689.02 s [vector] prescanr: OK
  7921. 689.02 s [vector] +++ OK, passed 100 tests.
  7922. 689.03 s [vector] prescanr': OK
  7923. 689.04 s [vector] +++ OK, passed 100 tests.
  7924. 689.04 s [vector] postscanr: OK
  7925. 689.04 s [vector] +++ OK, passed 100 tests.
  7926. 689.04 s [vector] postscanr': OK
  7927. 689.04 s [vector] +++ OK, passed 100 tests.
  7928. 689.04 s [vector] scanr: OK
  7929. 689.04 s [vector] +++ OK, passed 100 tests.
  7930. 689.04 s [vector] scanr': OK
  7931. 689.04 s [vector] +++ OK, passed 100 tests.
  7932. 689.05 s [vector] scanr1: OK
  7933. 689.05 s [vector] +++ OK, passed 100 tests.
  7934. 689.06 s [vector] scanr1': OK
  7935. 689.07 s [vector] +++ OK, passed 100 tests.
  7936. 689.07 s [vector] iscanr: OK
  7937. 689.07 s [vector] +++ OK, passed 100 tests.
  7938. 689.07 s [vector] iscanr': OK
  7939. 689.07 s [vector] +++ OK, passed 100 tests.
  7940. 689.07 s [vector] mut_read: OK
  7941. 689.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7942. 689.08 s [vector] mut_write: OK
  7943. 689.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7944. 689.09 s [vector] mut_modify: OK
  7945. 689.09 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7946. 689.09 s [vector] mut_generate: OK
  7947. 689.09 s [vector] +++ OK, passed 100 tests.
  7948. 689.10 s [vector] mut_generateM: OK (0.02s)
  7949. 689.11 s [vector] +++ OK, passed 100 tests.
  7950. 689.12 s [vector] mut_mapM_: OK (0.03s)
  7951. 689.13 s [vector] +++ OK, passed 100 tests.
  7952. 689.16 s [vector] mut_imapM_: OK (0.03s)
  7953. 689.16 s [vector] +++ OK, passed 100 tests.
  7954. 689.18 s [vector] mut_forM_: OK (0.03s)
  7955. 689.18 s [vector] +++ OK, passed 100 tests.
  7956. 689.22 s [vector] mut_iforM_: OK (0.04s)
  7957. 689.22 s [vector] +++ OK, passed 100 tests.
  7958. 689.23 s [vector] mut_foldr: OK
  7959. 689.23 s [vector] +++ OK, passed 100 tests.
  7960. 689.23 s [vector] mut_foldr': OK
  7961. 689.23 s [vector] +++ OK, passed 100 tests.
  7962. 689.24 s [vector] mut_foldl: OK
  7963. 689.24 s [vector] +++ OK, passed 100 tests.
  7964. 689.25 s [vector] mut_foldl': OK
  7965. 689.25 s [vector] +++ OK, passed 100 tests.
  7966. 689.25 s [vector] mut_ifoldr: OK
  7967. 689.25 s [vector] +++ OK, passed 100 tests.
  7968. 689.26 s [vector] mut_ifoldr': OK
  7969. 689.27 s [vector] +++ OK, passed 100 tests.
  7970. 689.27 s [vector] mut_ifoldl: OK
  7971. 689.28 s [vector] +++ OK, passed 100 tests.
  7972. 689.28 s [vector] mut_ifoldl': OK
  7973. 689.29 s [vector] +++ OK, passed 100 tests.
  7974. 689.29 s [vector] mut_foldM: OK
  7975. 689.29 s [vector] +++ OK, passed 100 tests.
  7976. 689.29 s [vector] mut_foldM': OK
  7977. 689.29 s [vector] +++ OK, passed 100 tests.
  7978. 689.29 s [vector] mut_foldrM: OK
  7979. 689.29 s [vector] +++ OK, passed 100 tests.
  7980. 689.30 s [vector] mut_foldrM': OK
  7981. 689.30 s [vector] +++ OK, passed 100 tests.
  7982. 689.31 s [vector] mut_ifoldM: OK
  7983. 689.31 s [vector] +++ OK, passed 100 tests.
  7984. 689.31 s [vector] mut_ifoldM': OK
  7985. 689.31 s [vector] +++ OK, passed 100 tests.
  7986. 689.31 s [vector] mut_ifoldrM: OK
  7987. 689.31 s [vector] +++ OK, passed 100 tests.
  7988. 689.32 s [vector] mut_ifoldrM': OK
  7989. 689.32 s [vector] +++ OK, passed 100 tests.
  7990. 689.32 s [vector] compare: OK
  7991. 689.32 s [vector] +++ OK, passed 100 tests.
  7992. 689.32 s [vector] maximum: OK
  7993. 689.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7994. 689.32 s [vector] minimum: OK
  7995. 689.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7996. 689.33 s [vector] minIndex: OK
  7997. 689.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7998. 689.33 s [vector] maxIndex: OK
  7999. 689.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8000. 689.33 s [vector] maximumBy: OK
  8001. 689.33 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8002. 689.33 s [vector] minimumBy: OK
  8003. 689.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8004. 689.33 s [vector] maximumOn: OK
  8005. 689.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8006. 689.33 s [vector] minimumOn: OK
  8007. 689.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8008. 689.34 s [vector] maxIndexBy: OK
  8009. 689.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8010. 689.34 s [vector] minIndexBy: OK
  8011. 689.34 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8012. 689.34 s [vector] ListFirstMaxIndexWins: OK
  8013. 689.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8014. 689.34 s [vector] FalseListFirstMaxIndexWins: OK
  8015. 689.34 s [vector] +++ OK, failed as expected. (after 1 test):
  8016. 689.34 s [vector] Exception:
  8017. 689.34 s [vector] Prelude.foldr1: empty list
  8018. 689.34 s [vector] CallStack (from HasCallStack):
  8019. 689.35 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8020. 689.35 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8021. 689.35 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8022. 689.35 s [vector] []
  8023. 689.35 s [vector] zip: OK
  8024. 689.35 s [vector] +++ OK, passed 100 tests.
  8025. 689.35 s [vector] zip3: OK
  8026. 689.36 s [vector] +++ OK, passed 100 tests.
  8027. 689.36 s [vector] unzip: OK
  8028. 689.36 s [vector] +++ OK, passed 100 tests.
  8029. 689.37 s [vector] unzip3: OK
  8030. 689.37 s [vector] +++ OK, passed 100 tests.
  8031. 689.37 s [vector] indexed: OK
  8032. 689.38 s [vector] +++ OK, passed 100 tests.
  8033. 689.39 s [vector] update: OK
  8034. 689.39 s [vector] +++ OK, passed 100 tests.
  8035. 689.39 s [vector] mempty: OK
  8036. 689.39 s [vector] +++ OK, passed 100 tests.
  8037. 689.39 s [vector] mappend: OK
  8038. 689.39 s [vector] +++ OK, passed 100 tests.
  8039. 689.41 s [vector] mconcat: OK (0.04s)
  8040. 689.41 s [vector] +++ OK, passed 100 tests.
  8041. 689.42 s [vector] glength: OK
  8042. 689.42 s [vector] +++ OK, passed 100 tests.
  8043. 689.42 s [vector] (Int,Bool,Int)
  8044. 689.42 s [vector] fromList.toList == id: OK
  8045. 689.42 s [vector] +++ OK, passed 100 tests.
  8046. 689.42 s [vector] toList.fromList == id: OK
  8047. 689.42 s [vector] +++ OK, passed 100 tests.
  8048. 689.42 s [vector] unstream.stream == id: OK
  8049. 689.42 s [vector] +++ OK, passed 100 tests.
  8050. 689.42 s [vector] stream.unstream == id: OK
  8051. 689.42 s [vector] +++ OK, passed 100 tests.
  8052. 689.43 s [vector] eq: OK
  8053. 689.43 s [vector] +++ OK, passed 100 tests.
  8054. 689.43 s [vector] length: OK
  8055. 689.43 s [vector] +++ OK, passed 100 tests.
  8056. 689.43 s [vector] null: OK
  8057. 689.43 s [vector] +++ OK, passed 100 tests.
  8058. 689.43 s [vector] index: OK
  8059. 689.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8060. 689.43 s [vector] safeIndex: OK
  8061. 689.43 s [vector] +++ OK, passed 100 tests.
  8062. 689.43 s [vector] head: OK
  8063. 689.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8064. 689.44 s [vector] last: OK
  8065. 689.44 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8066. 689.44 s [vector] unsafeIndex: OK
  8067. 689.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8068. 689.44 s [vector] unsafeHead: OK
  8069. 689.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8070. 689.44 s [vector] unsafeLast: OK
  8071. 689.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8072. 689.44 s [vector] slice: OK
  8073. 689.44 s [vector] +++ OK, passed 100 tests.
  8074. 689.44 s [vector] init: OK
  8075. 689.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8076. 689.45 s [vector] tail: OK
  8077. 689.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8078. 689.48 s [vector] take: OK
  8079. 689.48 s [vector] +++ OK, passed 100 tests.
  8080. 689.48 s [vector] drop: OK
  8081. 689.48 s [vector] +++ OK, passed 100 tests.
  8082. 689.48 s [vector] splitAt: OK
  8083. 689.48 s [vector] +++ OK, passed 100 tests.
  8084. 689.48 s [vector] empty: OK
  8085. 689.48 s [vector] +++ OK, passed 100 tests.
  8086. 689.48 s [vector] singleton: OK
  8087. 689.48 s [vector] +++ OK, passed 100 tests.
  8088. 689.48 s [vector] replicate: OK
  8089. 689.48 s [vector] +++ OK, passed 100 tests.
  8090. 689.48 s [vector] generate: OK
  8091. 689.48 s [vector] +++ OK, passed 100 tests.
  8092. 689.48 s [vector] iterateN: OK
  8093. 689.48 s [vector] +++ OK, passed 100 tests.
  8094. 689.52 s [vector] iterateNM: OK (0.07s)
  8095. 689.53 s [vector] +++ OK, passed 100 tests.
  8096. 689.55 s [vector] generateM: OK (0.03s)
  8097. 689.55 s [vector] +++ OK, passed 100 tests.
  8098. 689.57 s [vector] replicateM: OK
  8099. 689.57 s [vector] +++ OK, passed 100 tests.
  8100. 689.57 s [vector] create: OK
  8101. 689.57 s [vector] +++ OK, passed 100 tests.
  8102. 689.57 s [vector] createT: OK
  8103. 689.57 s [vector] +++ OK, passed 100 tests.
  8104. 689.57 s [vector] unfoldr: OK
  8105. 689.57 s [vector] +++ OK, passed 100 tests.
  8106. 689.58 s [vector] unfoldrN: OK
  8107. 689.58 s [vector] +++ OK, passed 100 tests.
  8108. 689.58 s [vector] unfoldrExactN: OK
  8109. 689.58 s [vector] +++ OK, passed 100 tests.
  8110. 689.58 s [vector] unfoldrM: OK
  8111. 689.58 s [vector] +++ OK, passed 100 tests.
  8112. 689.58 s [vector] unfoldrNM: OK
  8113. 689.58 s [vector] +++ OK, passed 100 tests.
  8114. 689.62 s [vector] unfoldrExactNM: OK (0.04s)
  8115. 689.63 s [vector] +++ OK, passed 100 tests.
  8116. 689.63 s [vector] constructN: OK
  8117. 689.63 s [vector] +++ OK, passed 100 tests.
  8118. 689.64 s [vector] constructrN: OK
  8119. 689.64 s [vector] +++ OK, passed 100 tests.
  8120. 689.64 s [vector] cons: OK
  8121. 689.64 s [vector] +++ OK, passed 100 tests.
  8122. 689.65 s [vector] snoc: OK
  8123. 689.66 s [vector] +++ OK, passed 100 tests.
  8124. 689.67 s [vector] append: OK
  8125. 689.67 s [vector] +++ OK, passed 100 tests.
  8126. 689.71 s [vector] concat: OK (0.06s)
  8127. 689.71 s [vector] +++ OK, passed 100 tests.
  8128. 689.73 s [vector] force: OK
  8129. 689.73 s [vector] +++ OK, passed 100 tests.
  8130. 689.74 s [vector] upd: OK
  8131. 689.74 s [vector] +++ OK, passed 100 tests.
  8132. 689.74 s [vector] accum: OK (0.01s)
  8133. 689.74 s [vector] +++ OK, passed 100 tests.
  8134. 689.75 s [vector] reverse: OK
  8135. 689.75 s [vector] +++ OK, passed 100 tests.
  8136. 689.75 s [vector] backpermute: OK
  8137. 689.75 s [vector] +++ OK, passed 100 tests.
  8138. 689.75 s [vector] map: OK
  8139. 689.75 s [vector] +++ OK, passed 100 tests.
  8140. 689.75 s [vector] imap: OK
  8141. 689.75 s [vector] +++ OK, passed 100 tests.
  8142. 689.75 s [vector] concatMap: OK
  8143. 689.75 s [vector] +++ OK, passed 100 tests.
  8144. 689.76 s [vector] mapM: OK
  8145. 689.76 s [vector] +++ OK, passed 100 tests.
  8146. 689.82 s [vector] mapM_: OK (0.06s)
  8147. 689.82 s [vector] +++ OK, passed 100 tests.
  8148. 689.83 s [vector] forM: OK
  8149. 689.83 s [vector] +++ OK, passed 100 tests.
  8150. 689.90 s [vector] forM_: OK (0.06s)
  8151. 689.90 s [vector] +++ OK, passed 100 tests.
  8152. 689.90 s [vector] imapM: OK
  8153. 689.90 s [vector] +++ OK, passed 100 tests.
  8154. 689.94 s [vector] imapM_: OK (0.04s)
  8155. 689.94 s [vector] +++ OK, passed 100 tests.
  8156. 689.95 s [vector] zipWith: OK
  8157. 689.95 s [vector] +++ OK, passed 100 tests.
  8158. 689.96 s [vector] zipWith3: OK
  8159. 689.96 s [vector] +++ OK, passed 100 tests.
  8160. 689.96 s [vector] izipWith: OK
  8161. 689.96 s [vector] +++ OK, passed 100 tests.
  8162. 689.97 s [vector] izipWith3: OK
  8163. 689.97 s [vector] +++ OK, passed 100 tests.
  8164. 689.98 s [vector] izipWithM: OK
  8165. 689.98 s [vector] +++ OK, passed 100 tests.
  8166. 690.02 s [vector] izipWithM_: OK (0.03s)
  8167. 690.02 s [vector] +++ OK, passed 100 tests.
  8168. 690.03 s [vector] zipWithM: OK
  8169. 690.03 s [vector] +++ OK, passed 100 tests.
  8170. 690.06 s [vector] zipWithM_: OK (0.04s)
  8171. 690.06 s [vector] +++ OK, passed 100 tests.
  8172. 690.07 s [vector] filter: OK
  8173. 690.07 s [vector] +++ OK, passed 100 tests.
  8174. 690.08 s [vector] ifilter: OK
  8175. 690.09 s [vector] +++ OK, passed 100 tests.
  8176. 690.14 s [vector] filterM: OK (0.08s)
  8177. 690.15 s [vector] +++ OK, passed 100 tests.
  8178. 690.15 s [vector] uniq: OK
  8179. 690.15 s [vector] +++ OK, passed 100 tests.
  8180. 690.15 s [vector] mapMaybe: OK
  8181. 690.15 s [vector] +++ OK, passed 100 tests.
  8182. 690.16 s [vector] imapMaybe: OK
  8183. 690.16 s [vector] +++ OK, passed 100 tests.
  8184. 690.16 s [vector] takeWhile: OK
  8185. 690.16 s [vector] +++ OK, passed 100 tests.
  8186. 690.17 s [vector] dropWhile: OK
  8187. 690.17 s [vector] +++ OK, passed 100 tests.
  8188. 690.18 s [vector] partition: OK
  8189. 690.18 s [vector] +++ OK, passed 100 tests.
  8190. 690.18 s [vector] partitionWith: OK
  8191. 690.18 s [vector] +++ OK, passed 100 tests.
  8192. 690.19 s [vector] span: OK
  8193. 690.19 s [vector] +++ OK, passed 100 tests.
  8194. 690.20 s [vector] break: OK
  8195. 690.20 s [vector] +++ OK, passed 100 tests.
  8196. 690.21 s [vector] spanR: OK
  8197. 690.21 s [vector] +++ OK, passed 100 tests.
  8198. 690.21 s [vector] breakR: OK
  8199. 690.21 s [vector] +++ OK, passed 100 tests.
  8200. 690.22 s [vector] groupBy: OK (0.01s)
  8201. 690.22 s [vector] +++ OK, passed 100 tests.
  8202. 690.22 s [vector] elem: OK
  8203. 690.22 s [vector] +++ OK, passed 100 tests.
  8204. 690.22 s [vector] notElem: OK
  8205. 690.22 s [vector] +++ OK, passed 100 tests.
  8206. 690.22 s [vector] find: OK
  8207. 690.22 s [vector] +++ OK, passed 100 tests.
  8208. 690.22 s [vector] findIndex: OK
  8209. 690.22 s [vector] +++ OK, passed 100 tests.
  8210. 690.23 s [vector] findIndexR: OK
  8211. 690.23 s [vector] +++ OK, passed 100 tests.
  8212. 690.24 s [vector] findIndices: OK
  8213. 690.24 s [vector] +++ OK, passed 100 tests.
  8214. 690.24 s [vector] elemIndex: OK
  8215. 690.24 s [vector] +++ OK, passed 100 tests.
  8216. 690.24 s [vector] elemIndices: OK
  8217. 690.24 s [vector] +++ OK, passed 100 tests.
  8218. 690.24 s [vector] foldl: OK
  8219. 690.24 s [vector] +++ OK, passed 100 tests.
  8220. 690.24 s [vector] foldl1: OK
  8221. 690.24 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8222. 690.24 s [vector] foldl': OK
  8223. 690.24 s [vector] +++ OK, passed 100 tests.
  8224. 690.24 s [vector] foldl1': OK
  8225. 690.24 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8226. 690.25 s [vector] foldr: OK
  8227. 690.25 s [vector] +++ OK, passed 100 tests.
  8228. 690.26 s [vector] foldr1: OK
  8229. 690.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8230. 690.28 s [vector] foldr': OK
  8231. 690.28 s [vector] +++ OK, passed 100 tests.
  8232. 690.29 s [vector] foldr1': OK
  8233. 690.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8234. 690.29 s [vector] ifoldl: OK
  8235. 690.29 s [vector] +++ OK, passed 100 tests.
  8236. 690.30 s [vector] ifoldl': OK
  8237. 690.30 s [vector] +++ OK, passed 100 tests.
  8238. 690.31 s [vector] ifoldr: OK
  8239. 690.31 s [vector] +++ OK, passed 100 tests.
  8240. 690.31 s [vector] ifoldr': OK
  8241. 690.31 s [vector] +++ OK, passed 100 tests.
  8242. 690.32 s [vector] ifoldM: OK
  8243. 690.32 s [vector] +++ OK, passed 100 tests.
  8244. 690.33 s [vector] ifoldM': OK
  8245. 690.33 s [vector] +++ OK, passed 100 tests.
  8246. 690.38 s [vector] ifoldM_: OK (0.05s)
  8247. 690.38 s [vector] +++ OK, passed 100 tests.
  8248. 690.43 s [vector] ifoldM'_: OK (0.06s)
  8249. 690.43 s [vector] +++ OK, passed 100 tests.
  8250. 690.43 s [vector] all: OK
  8251. 690.43 s [vector] +++ OK, passed 100 tests.
  8252. 690.44 s [vector] any: OK
  8253. 690.44 s [vector] +++ OK, passed 100 tests.
  8254. 690.45 s [vector] prescanl: OK
  8255. 690.45 s [vector] +++ OK, passed 100 tests.
  8256. 690.45 s [vector] prescanl': OK
  8257. 690.45 s [vector] +++ OK, passed 100 tests.
  8258. 690.46 s [vector] postscanl: OK
  8259. 690.46 s [vector] +++ OK, passed 100 tests.
  8260. 690.47 s [vector] postscanl': OK
  8261. 690.47 s [vector] +++ OK, passed 100 tests.
  8262. 690.47 s [vector] scanl: OK
  8263. 690.47 s [vector] +++ OK, passed 100 tests.
  8264. 690.48 s [vector] scanl': OK
  8265. 690.48 s [vector] +++ OK, passed 100 tests.
  8266. 690.49 s [vector] scanl1: OK
  8267. 690.49 s [vector] +++ OK, passed 100 tests.
  8268. 690.50 s [vector] scanl1': OK (0.01s)
  8269. 690.50 s [vector] +++ OK, passed 100 tests.
  8270. 690.52 s [vector] iscanl: OK (0.01s)
  8271. 690.52 s [vector] +++ OK, passed 100 tests.
  8272. 690.54 s [vector] iscanl': OK (0.01s)
  8273. 690.54 s [vector] +++ OK, passed 100 tests.
  8274. 690.55 s [vector] prescanr: OK (0.02s)
  8275. 690.56 s [vector] +++ OK, passed 100 tests.
  8276. 690.57 s [vector] prescanr': OK
  8277. 690.57 s [vector] +++ OK, passed 100 tests.
  8278. 690.57 s [vector] postscanr: OK
  8279. 690.57 s [vector] +++ OK, passed 100 tests.
  8280. 690.57 s [vector] postscanr': OK
  8281. 690.58 s [vector] +++ OK, passed 100 tests.
  8282. 690.58 s [vector] scanr: OK
  8283. 690.58 s [vector] +++ OK, passed 100 tests.
  8284. 690.59 s [vector] scanr': OK
  8285. 690.59 s [vector] +++ OK, passed 100 tests.
  8286. 690.60 s [vector] scanr1: OK
  8287. 690.60 s [vector] +++ OK, passed 100 tests.
  8288. 690.61 s [vector] scanr1': OK
  8289. 690.61 s [vector] +++ OK, passed 100 tests.
  8290. 690.62 s [vector] iscanr: OK
  8291. 690.62 s [vector] +++ OK, passed 100 tests.
  8292. 690.63 s [vector] iscanr': OK
  8293. 690.63 s [vector] +++ OK, passed 100 tests.
  8294. 690.63 s [vector] mut_read: OK
  8295. 690.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8296. 690.63 s [vector] mut_write: OK
  8297. 690.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8298. 690.63 s [vector] mut_modify: OK
  8299. 690.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8300. 690.63 s [vector] mut_generate: OK
  8301. 690.64 s [vector] +++ OK, passed 100 tests.
  8302. 690.66 s [vector] mut_generateM: OK (0.03s)
  8303. 690.66 s [vector] +++ OK, passed 100 tests.
  8304. 690.72 s [vector] mut_mapM_: OK (0.05s)
  8305. 690.72 s [vector] +++ OK, passed 100 tests.
  8306. 690.76 s [vector] mut_imapM_: OK (0.05s)
  8307. 690.76 s [vector] +++ OK, passed 100 tests.
  8308. 690.80 s [vector] mut_forM_: OK (0.05s)
  8309. 690.80 s [vector] +++ OK, passed 100 tests.
  8310. 690.86 s [vector] mut_iforM_: OK (0.05s)
  8311. 690.86 s [vector] +++ OK, passed 100 tests.
  8312. 690.86 s [vector] mut_foldr: OK (0.02s)
  8313. 690.86 s [vector] +++ OK, passed 100 tests.
  8314. 690.88 s [vector] mut_foldr': OK
  8315. 690.88 s [vector] +++ OK, passed 100 tests.
  8316. 690.89 s [vector] mut_foldl: OK
  8317. 690.89 s [vector] +++ OK, passed 100 tests.
  8318. 690.89 s [vector] mut_foldl': OK
  8319. 690.89 s [vector] +++ OK, passed 100 tests.
  8320. 690.90 s [vector] mut_ifoldr: OK
  8321. 690.90 s [vector] +++ OK, passed 100 tests.
  8322. 690.91 s [vector] mut_ifoldr': OK
  8323. 690.91 s [vector] +++ OK, passed 100 tests.
  8324. 690.91 s [vector] mut_ifoldl: OK
  8325. 690.91 s [vector] +++ OK, passed 100 tests.
  8326. 690.92 s [vector] mut_ifoldl': OK
  8327. 690.92 s [vector] +++ OK, passed 100 tests.
  8328. 690.93 s [vector] mut_foldM: OK
  8329. 690.93 s [vector] +++ OK, passed 100 tests.
  8330. 690.93 s [vector] mut_foldM': OK
  8331. 690.93 s [vector] +++ OK, passed 100 tests.
  8332. 690.94 s [vector] mut_foldrM: OK
  8333. 690.94 s [vector] +++ OK, passed 100 tests.
  8334. 690.96 s [vector] mut_foldrM': OK
  8335. 690.96 s [vector] +++ OK, passed 100 tests.
  8336. 690.97 s [vector] mut_ifoldM: OK
  8337. 690.97 s [vector] +++ OK, passed 100 tests.
  8338. 690.97 s [vector] mut_ifoldM': OK
  8339. 690.97 s [vector] +++ OK, passed 100 tests.
  8340. 690.98 s [vector] mut_ifoldrM: OK
  8341. 690.98 s [vector] +++ OK, passed 100 tests.
  8342. 690.99 s [vector] mut_ifoldrM': OK
  8343. 690.99 s [vector] +++ OK, passed 100 tests.
  8344. 690.99 s [vector] compare: OK
  8345. 690.99 s [vector] +++ OK, passed 100 tests.
  8346. 690.99 s [vector] maximum: OK
  8347. 690.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8348. 690.99 s [vector] minimum: OK
  8349. 690.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8350. 690.99 s [vector] minIndex: OK
  8351. 690.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8352. 690.99 s [vector] maxIndex: OK
  8353. 690.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8354. 691.00 s [vector] maximumBy: OK
  8355. 691.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8356. 691.00 s [vector] minimumBy: OK
  8357. 691.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8358. 691.00 s [vector] maximumOn: OK
  8359. 691.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8360. 691.00 s [vector] minimumOn: OK
  8361. 691.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8362. 691.00 s [vector] maxIndexBy: OK
  8363. 691.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8364. 691.00 s [vector] minIndexBy: OK
  8365. 691.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8366. 691.00 s [vector] ListFirstMaxIndexWins: OK
  8367. 691.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8368. 691.00 s [vector] FalseListFirstMaxIndexWins: OK
  8369. 691.01 s [vector] +++ OK, failed as expected. (after 1 test):
  8370. 691.01 s [vector] Exception:
  8371. 691.01 s [vector] Prelude.foldr1: empty list
  8372. 691.01 s [vector] CallStack (from HasCallStack):
  8373. 691.01 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8374. 691.01 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8375. 691.01 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8376. 691.01 s [vector] []
  8377. 691.01 s [vector] zip: OK
  8378. 691.02 s [vector] +++ OK, passed 100 tests.
  8379. 691.02 s [vector] zip3: OK
  8380. 691.02 s [vector] +++ OK, passed 100 tests.
  8381. 691.02 s [vector] unzip: OK
  8382. 691.02 s [vector] +++ OK, passed 100 tests.
  8383. 691.03 s [vector] unzip3: OK
  8384. 691.03 s [vector] +++ OK, passed 100 tests.
  8385. 691.04 s [vector] indexed: OK
  8386. 691.04 s [vector] +++ OK, passed 100 tests.
  8387. 691.04 s [vector] update: OK
  8388. 691.04 s [vector] +++ OK, passed 100 tests.
  8389. 691.04 s [vector] mempty: OK
  8390. 691.04 s [vector] +++ OK, passed 100 tests.
  8391. 691.04 s [vector] mappend: OK
  8392. 691.04 s [vector] +++ OK, passed 100 tests.
  8393. 691.12 s [vector] mconcat: OK (0.07s)
  8394. 691.12 s [vector] +++ OK, passed 100 tests.
  8395. 691.12 s [vector] glength: OK
  8396. 691.12 s [vector] +++ OK, passed 100 tests.
  8397. 691.12 s [vector] unstream
  8398. 691.12 s [vector] unstream == vunstream (exact): OK
  8399. 691.12 s [vector] +++ OK, passed 100 tests.
  8400. 691.12 s [vector] unstream == vunstream (unknown): OK
  8401. 691.12 s [vector] +++ OK, passed 100 tests.
  8402. 691.13 s [vector] unstreamR ~= vunstream (exact): OK
  8403. 691.13 s [vector] +++ OK, passed 100 tests.
  8404. 691.13 s [vector] unstreamR ~= vunstream (unknown): OK
  8405. 691.13 s [vector] +++ OK, passed 100 tests.
  8406. 691.13 s [vector] Data.Vector.Storable.Vector Alignment
  8407. 691.13 s [vector] Aligned Double: OK
  8408. 691.13 s [vector] Aligned Int: OK
  8409. 691.13 s [vector] Regression tests
  8410. 691.13 s [vector] enumFromTo crash #188
  8411. 691.13 s [vector] Word8: OK
  8412. 691.13 s [vector] Word16: OK
  8413. 691.13 s [vector] Word32: OK
  8414. 691.13 s [vector] Word64: OK
  8415. 691.13 s [vector] Word: OK
  8416. 691.13 s [vector] Int8: OK
  8417. 691.13 s [vector] Int16: OK
  8418. 691.13 s [vector] Int32: OK
  8419. 691.13 s [vector] Int64: OK
  8420. 691.13 s [vector] Int: OK
  8421. 691.13 s [vector] Char: OK
  8422. 691.13 s [vector] Negative tests
  8423. 691.13 s [vector] slice out of bounds #257
  8424. 691.13 s [vector] Boxed
  8425. 691.13 s [vector] Negative ix: OK
  8426. 691.13 s [vector] Negative size: OK
  8427. 691.13 s [vector] Negative ix and size: OK
  8428. 691.13 s [vector] Too large ix: OK
  8429. 691.13 s [vector] Too large size: OK
  8430. 691.13 s [vector] Too large ix and size: OK
  8431. 691.13 s [vector] Overflow: OK
  8432. 691.13 s [vector] OutOfMemory: OK
  8433. 691.13 s [vector] Primitive
  8434. 691.13 s [vector] Negative ix: OK
  8435. 691.13 s [vector] Negative size: OK
  8436. 691.13 s [vector] Negative ix and size: OK
  8437. 691.13 s [vector] Too large ix: OK
  8438. 691.13 s [vector] Too large size: OK
  8439. 691.13 s [vector] Too large ix and size: OK
  8440. 691.13 s [vector] Overflow: OK
  8441. 691.13 s [vector] OutOfMemory: OK
  8442. 691.13 s [vector] Storable
  8443. 691.13 s [vector] Negative ix: OK
  8444. 691.13 s [vector] Negative size: OK
  8445. 691.13 s [vector] Negative ix and size: OK
  8446. 691.13 s [vector] Too large ix: OK
  8447. 691.13 s [vector] Too large size: OK
  8448. 691.13 s [vector] Too large ix and size: OK
  8449. 691.13 s [vector] Overflow: OK
  8450. 691.13 s [vector] OutOfMemory: OK
  8451. 691.13 s [vector] Unboxed
  8452. 691.13 s [vector] Negative ix: OK
  8453. 691.13 s [vector] Negative size: OK
  8454. 691.13 s [vector] Negative ix and size: OK
  8455. 691.13 s [vector] Too large ix: OK
  8456. 691.13 s [vector] Too large size: OK
  8457. 691.13 s [vector] Too large ix and size: OK
  8458. 691.13 s [vector] Overflow: OK
  8459. 691.13 s [vector] OutOfMemory: OK
  8460. 691.13 s [vector] take #282
  8461. 691.13 s [vector] Boxed: OK
  8462. 691.13 s [vector] Primitive: OK
  8463. 691.13 s [vector] Storable: OK
  8464. 691.13 s [vector] Unboxed: OK
  8465. 691.13 s [vector] Data.Vector
  8466. 691.13 s [vector] MonadFix: OK
  8467. 691.13 s [vector] toFromArray: OK
  8468. 691.13 s [vector] toFromArraySlice: OK
  8469. 691.13 s [vector] toFromArraySliceUnsafe: OK
  8470. 691.14 s [vector] toFromMutableArray: OK
  8471. 691.14 s [vector] Data.Vector.Mutable (Move): OK
  8472. 691.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8473. 691.14 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  8474. 691.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8475. 691.14 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  8476. 691.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8477. 691.14 s [vector] Data.Vector.Storable.Mutable (Move): OK
  8478. 691.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8479. 691.16 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  8480. 691.17 s [vector] +++ OK, passed 100 tests.
  8481. 691.18 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.02s)
  8482. 691.18 s [vector] +++ OK, passed 100 tests.
  8483. 691.18 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK (0.01s)
  8484. 691.18 s [vector] +++ OK, passed 100 tests.
  8485. 691.18 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  8486. 691.18 s [vector] +++ OK, passed 100 tests.
  8487. 691.18 s [vector]
  8488. 691.18 s [vector] All 2808 tests passed (16.60s)
  8489. 691.19 s [vector] Test suite vector-tests-O0: PASS
  8490. 691.19 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  8491. 691.19 s [vector] Test suite vector-tests-O2: RUNNING...
  8492. 691.35 s [vector] toplevel
  8493. 691.35 s [vector] Data.Vector.Fusion.Bundle
  8494. 691.36 s [vector] fromList.toList == id: OK
  8495. 691.36 s [vector] +++ OK, passed 100 tests.
  8496. 691.36 s [vector] toList.fromList == id: OK
  8497. 691.36 s [vector] +++ OK, passed 100 tests.
  8498. 691.36 s [vector] eq: OK
  8499. 691.36 s [vector] +++ OK, passed 100 tests.
  8500. 691.36 s [vector] length: OK
  8501. 691.36 s [vector] +++ OK, passed 100 tests.
  8502. 691.36 s [vector] null: OK
  8503. 691.36 s [vector] +++ OK, passed 100 tests.
  8504. 691.36 s [vector] empty: OK
  8505. 691.36 s [vector] +++ OK, passed 100 tests.
  8506. 691.37 s [vector] singleton: OK
  8507. 691.37 s [vector] +++ OK, passed 100 tests.
  8508. 691.37 s [vector] replicate: OK
  8509. 691.37 s [vector] +++ OK, passed 100 tests.
  8510. 691.37 s [vector] cons: OK
  8511. 691.37 s [vector] +++ OK, passed 100 tests.
  8512. 691.37 s [vector] snoc: OK
  8513. 691.37 s [vector] +++ OK, passed 100 tests.
  8514. 691.37 s [vector] append: OK
  8515. 691.37 s [vector] +++ OK, passed 100 tests.
  8516. 691.37 s [vector] head: OK
  8517. 691.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8518. 691.37 s [vector] last: OK
  8519. 691.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8520. 691.37 s [vector] index: OK
  8521. 691.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8522. 691.37 s [vector] extract: OK
  8523. 691.37 s [vector] +++ OK, passed 100 tests.
  8524. 691.37 s [vector] init: OK
  8525. 691.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8526. 691.37 s [vector] tail: OK
  8527. 691.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8528. 691.37 s [vector] take: OK
  8529. 691.37 s [vector] +++ OK, passed 100 tests.
  8530. 691.37 s [vector] drop: OK
  8531. 691.37 s [vector] +++ OK, passed 100 tests.
  8532. 691.37 s [vector] map: OK
  8533. 691.37 s [vector] +++ OK, passed 100 tests.
  8534. 691.37 s [vector] zipWith: OK
  8535. 691.37 s [vector] +++ OK, passed 100 tests.
  8536. 691.37 s [vector] zipWith3: OK
  8537. 691.37 s [vector] +++ OK, passed 100 tests.
  8538. 691.37 s [vector] filter: OK
  8539. 691.37 s [vector] +++ OK, passed 100 tests.
  8540. 691.37 s [vector] takeWhile: OK
  8541. 691.37 s [vector] +++ OK, passed 100 tests.
  8542. 691.37 s [vector] dropWhile: OK
  8543. 691.37 s [vector] +++ OK, passed 100 tests.
  8544. 691.37 s [vector] elem: OK
  8545. 691.37 s [vector] +++ OK, passed 100 tests.
  8546. 691.37 s [vector] notElem: OK
  8547. 691.37 s [vector] +++ OK, passed 100 tests.
  8548. 691.37 s [vector] find: OK
  8549. 691.37 s [vector] +++ OK, passed 100 tests.
  8550. 691.37 s [vector] findIndex: OK
  8551. 691.37 s [vector] +++ OK, passed 100 tests.
  8552. 691.37 s [vector] foldl: OK
  8553. 691.37 s [vector] +++ OK, passed 100 tests.
  8554. 691.37 s [vector] foldl1: OK
  8555. 691.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8556. 691.38 s [vector] foldl': OK
  8557. 691.38 s [vector] +++ OK, passed 100 tests.
  8558. 691.38 s [vector] foldl1': OK
  8559. 691.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8560. 691.38 s [vector] foldr: OK
  8561. 691.38 s [vector] +++ OK, passed 100 tests.
  8562. 691.38 s [vector] foldr1: OK
  8563. 691.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8564. 691.38 s [vector] prescanl: OK
  8565. 691.38 s [vector] +++ OK, passed 100 tests.
  8566. 691.38 s [vector] prescanl': OK
  8567. 691.38 s [vector] +++ OK, passed 100 tests.
  8568. 691.38 s [vector] postscanl: OK
  8569. 691.38 s [vector] +++ OK, passed 100 tests.
  8570. 691.38 s [vector] postscanl': OK
  8571. 691.38 s [vector] +++ OK, passed 100 tests.
  8572. 691.38 s [vector] scanl: OK
  8573. 691.38 s [vector] +++ OK, passed 100 tests.
  8574. 691.38 s [vector] scanl': OK
  8575. 691.38 s [vector] +++ OK, passed 100 tests.
  8576. 691.38 s [vector] scanl1: OK
  8577. 691.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8578. 691.38 s [vector] scanl1': OK
  8579. 691.38 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8580. 691.38 s [vector] concatMap: OK
  8581. 691.38 s [vector] +++ OK, passed 100 tests.
  8582. 691.38 s [vector] unfoldr: OK
  8583. 691.38 s [vector] +++ OK, passed 100 tests.
  8584. 691.38 s [vector] and: OK
  8585. 691.38 s [vector] +++ OK, passed 100 tests.
  8586. 691.38 s [vector] or: OK
  8587. 691.38 s [vector] +++ OK, passed 100 tests.
  8588. 691.38 s [vector] Tests.Vector.Boxed
  8589. 691.38 s [vector] Bool
  8590. 691.38 s [vector] fromList.toList == id: OK
  8591. 691.38 s [vector] +++ OK, passed 100 tests.
  8592. 691.38 s [vector] toList.fromList == id: OK
  8593. 691.38 s [vector] +++ OK, passed 100 tests.
  8594. 691.38 s [vector] unstream.stream == id: OK
  8595. 691.38 s [vector] +++ OK, passed 100 tests.
  8596. 691.39 s [vector] stream.unstream == id: OK
  8597. 691.39 s [vector] +++ OK, passed 100 tests.
  8598. 691.39 s [vector] eq: OK
  8599. 691.39 s [vector] +++ OK, passed 100 tests.
  8600. 691.39 s [vector] length: OK
  8601. 691.39 s [vector] +++ OK, passed 100 tests.
  8602. 691.39 s [vector] null: OK
  8603. 691.39 s [vector] +++ OK, passed 100 tests.
  8604. 691.39 s [vector] index: OK
  8605. 691.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8606. 691.39 s [vector] safeIndex: OK
  8607. 691.39 s [vector] +++ OK, passed 100 tests.
  8608. 691.39 s [vector] head: OK
  8609. 691.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8610. 691.39 s [vector] last: OK
  8611. 691.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8612. 691.39 s [vector] unsafeIndex: OK
  8613. 691.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8614. 691.39 s [vector] unsafeHead: OK
  8615. 691.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8616. 691.39 s [vector] unsafeLast: OK
  8617. 691.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8618. 691.39 s [vector] slice: OK
  8619. 691.39 s [vector] +++ OK, passed 100 tests.
  8620. 691.39 s [vector] init: OK
  8621. 691.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8622. 691.39 s [vector] tail: OK
  8623. 691.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8624. 691.39 s [vector] take: OK
  8625. 691.39 s [vector] +++ OK, passed 100 tests.
  8626. 691.41 s [vector] drop: OK
  8627. 691.41 s [vector] +++ OK, passed 100 tests.
  8628. 691.41 s [vector] splitAt: OK
  8629. 691.41 s [vector] +++ OK, passed 100 tests.
  8630. 691.41 s [vector] empty: OK
  8631. 691.41 s [vector] +++ OK, passed 100 tests.
  8632. 691.41 s [vector] singleton: OK
  8633. 691.41 s [vector] +++ OK, passed 100 tests.
  8634. 691.41 s [vector] replicate: OK
  8635. 691.41 s [vector] +++ OK, passed 100 tests.
  8636. 691.41 s [vector] generate: OK
  8637. 691.41 s [vector] +++ OK, passed 100 tests.
  8638. 691.41 s [vector] iterateN: OK
  8639. 691.41 s [vector] +++ OK, passed 100 tests.
  8640. 691.41 s [vector] iterateNM: OK (0.02s)
  8641. 691.41 s [vector] +++ OK, passed 100 tests.
  8642. 691.41 s [vector] generateM: OK (0.01s)
  8643. 691.41 s [vector] +++ OK, passed 100 tests.
  8644. 691.41 s [vector] replicateM: OK (0.05s)
  8645. 691.41 s [vector] +++ OK, passed 100 tests.
  8646. 691.41 s [vector] create: OK
  8647. 691.41 s [vector] +++ OK, passed 100 tests.
  8648. 691.41 s [vector] createT: OK
  8649. 691.41 s [vector] +++ OK, passed 100 tests.
  8650. 691.41 s [vector] unfoldr: OK
  8651. 691.41 s [vector] +++ OK, passed 100 tests.
  8652. 691.42 s [vector] unfoldrN: OK
  8653. 691.42 s [vector] +++ OK, passed 100 tests.
  8654. 691.42 s [vector] unfoldrExactN: OK
  8655. 691.42 s [vector] +++ OK, passed 100 tests.
  8656. 691.43 s [vector] unfoldrM: OK
  8657. 691.43 s [vector] +++ OK, passed 100 tests.
  8658. 691.43 s [vector] unfoldrNM: OK
  8659. 691.43 s [vector] +++ OK, passed 100 tests.
  8660. 691.43 s [vector] unfoldrExactNM: OK (0.02s)
  8661. 691.43 s [vector] +++ OK, passed 100 tests.
  8662. 691.43 s [vector] constructN: OK
  8663. 691.43 s [vector] +++ OK, passed 100 tests.
  8664. 691.43 s [vector] constructrN: OK
  8665. 691.43 s [vector] +++ OK, passed 100 tests.
  8666. 691.43 s [vector] cons: OK
  8667. 691.43 s [vector] +++ OK, passed 100 tests.
  8668. 691.43 s [vector] snoc: OK
  8669. 691.43 s [vector] +++ OK, passed 100 tests.
  8670. 691.43 s [vector] append: OK
  8671. 691.43 s [vector] +++ OK, passed 100 tests.
  8672. 691.43 s [vector] concat: OK
  8673. 691.43 s [vector] +++ OK, passed 100 tests.
  8674. 691.43 s [vector] force: OK
  8675. 691.43 s [vector] +++ OK, passed 100 tests.
  8676. 691.44 s [vector] upd: OK
  8677. 691.44 s [vector] +++ OK, passed 100 tests.
  8678. 691.44 s [vector] accum: OK
  8679. 691.44 s [vector] +++ OK, passed 100 tests.
  8680. 691.44 s [vector] reverse: OK
  8681. 691.44 s [vector] +++ OK, passed 100 tests.
  8682. 691.44 s [vector] backpermute: OK
  8683. 691.44 s [vector] +++ OK, passed 100 tests.
  8684. 691.44 s [vector] map: OK
  8685. 691.45 s [vector] +++ OK, passed 100 tests.
  8686. 691.45 s [vector] imap: OK
  8687. 691.45 s [vector] +++ OK, passed 100 tests.
  8688. 691.45 s [vector] concatMap: OK
  8689. 691.45 s [vector] +++ OK, passed 100 tests.
  8690. 691.45 s [vector] mapM: OK
  8691. 691.45 s [vector] +++ OK, passed 100 tests.
  8692. 691.45 s [vector] mapM_: OK
  8693. 691.45 s [vector] +++ OK, passed 100 tests.
  8694. 691.45 s [vector] forM: OK
  8695. 691.45 s [vector] +++ OK, passed 100 tests.
  8696. 691.46 s [vector] forM_: OK
  8697. 691.47 s [vector] +++ OK, passed 100 tests.
  8698. 691.47 s [vector] imapM: OK
  8699. 691.47 s [vector] +++ OK, passed 100 tests.
  8700. 691.47 s [vector] imapM_: OK (0.01s)
  8701. 691.47 s [vector] +++ OK, passed 100 tests.
  8702. 691.47 s [vector] zipWith: OK
  8703. 691.47 s [vector] +++ OK, passed 100 tests.
  8704. 691.47 s [vector] zipWith3: OK
  8705. 691.47 s [vector] +++ OK, passed 100 tests.
  8706. 691.47 s [vector] izipWith: OK
  8707. 691.47 s [vector] +++ OK, passed 100 tests.
  8708. 691.47 s [vector] izipWith3: OK
  8709. 691.47 s [vector] +++ OK, passed 100 tests.
  8710. 691.47 s [vector] izipWithM: OK
  8711. 691.48 s [vector] +++ OK, passed 100 tests.
  8712. 691.48 s [vector] izipWithM_: OK
  8713. 691.49 s [vector] +++ OK, passed 100 tests.
  8714. 691.49 s [vector] zipWithM: OK
  8715. 691.49 s [vector] +++ OK, passed 100 tests.
  8716. 691.49 s [vector] zipWithM_: OK
  8717. 691.49 s [vector] +++ OK, passed 100 tests.
  8718. 691.49 s [vector] filter: OK
  8719. 691.49 s [vector] +++ OK, passed 100 tests.
  8720. 691.50 s [vector] ifilter: OK
  8721. 691.50 s [vector] +++ OK, passed 100 tests.
  8722. 691.50 s [vector] filterM: OK (0.01s)
  8723. 691.50 s [vector] +++ OK, passed 100 tests.
  8724. 691.51 s [vector] uniq: OK
  8725. 691.51 s [vector] +++ OK, passed 100 tests.
  8726. 691.51 s [vector] mapMaybe: OK
  8727. 691.51 s [vector] +++ OK, passed 100 tests.
  8728. 691.51 s [vector] imapMaybe: OK
  8729. 691.51 s [vector] +++ OK, passed 100 tests.
  8730. 691.51 s [vector] takeWhile: OK
  8731. 691.51 s [vector] +++ OK, passed 100 tests.
  8732. 691.51 s [vector] dropWhile: OK
  8733. 691.51 s [vector] +++ OK, passed 100 tests.
  8734. 691.51 s [vector] partition: OK
  8735. 691.51 s [vector] +++ OK, passed 100 tests.
  8736. 691.51 s [vector] partitionWith: OK
  8737. 691.51 s [vector] +++ OK, passed 100 tests.
  8738. 691.51 s [vector] span: OK
  8739. 691.51 s [vector] +++ OK, passed 100 tests.
  8740. 691.51 s [vector] break: OK
  8741. 691.51 s [vector] +++ OK, passed 100 tests.
  8742. 691.51 s [vector] spanR: OK
  8743. 691.51 s [vector] +++ OK, passed 100 tests.
  8744. 691.51 s [vector] breakR: OK
  8745. 691.51 s [vector] +++ OK, passed 100 tests.
  8746. 691.51 s [vector] groupBy: OK
  8747. 691.51 s [vector] +++ OK, passed 100 tests.
  8748. 691.52 s [vector] elem: OK
  8749. 691.52 s [vector] +++ OK, passed 100 tests.
  8750. 691.52 s [vector] notElem: OK
  8751. 691.52 s [vector] +++ OK, passed 100 tests.
  8752. 691.52 s [vector] find: OK
  8753. 691.52 s [vector] +++ OK, passed 100 tests.
  8754. 691.52 s [vector] findIndex: OK
  8755. 691.52 s [vector] +++ OK, passed 100 tests.
  8756. 691.52 s [vector] findIndexR: OK
  8757. 691.52 s [vector] +++ OK, passed 100 tests.
  8758. 691.52 s [vector] findIndices: OK
  8759. 691.52 s [vector] +++ OK, passed 100 tests.
  8760. 691.52 s [vector] elemIndex: OK
  8761. 691.52 s [vector] +++ OK, passed 100 tests.
  8762. 691.52 s [vector] elemIndices: OK
  8763. 691.52 s [vector] +++ OK, passed 100 tests.
  8764. 691.52 s [vector] foldl: OK
  8765. 691.52 s [vector] +++ OK, passed 100 tests.
  8766. 691.52 s [vector] foldl1: OK
  8767. 691.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8768. 691.52 s [vector] foldl': OK
  8769. 691.52 s [vector] +++ OK, passed 100 tests.
  8770. 691.52 s [vector] foldl1': OK
  8771. 691.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8772. 691.52 s [vector] foldr: OK
  8773. 691.52 s [vector] +++ OK, passed 100 tests.
  8774. 691.53 s [vector] foldr1: OK
  8775. 691.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8776. 691.53 s [vector] foldr': OK
  8777. 691.53 s [vector] +++ OK, passed 100 tests.
  8778. 691.53 s [vector] foldr1': OK
  8779. 691.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8780. 691.53 s [vector] ifoldl: OK
  8781. 691.53 s [vector] +++ OK, passed 100 tests.
  8782. 691.53 s [vector] ifoldl': OK
  8783. 691.53 s [vector] +++ OK, passed 100 tests.
  8784. 691.53 s [vector] ifoldr: OK
  8785. 691.53 s [vector] +++ OK, passed 100 tests.
  8786. 691.53 s [vector] ifoldr': OK
  8787. 691.53 s [vector] +++ OK, passed 100 tests.
  8788. 691.53 s [vector] ifoldM: OK
  8789. 691.53 s [vector] +++ OK, passed 100 tests.
  8790. 691.54 s [vector] ifoldM': OK
  8791. 691.54 s [vector] +++ OK, passed 100 tests.
  8792. 691.55 s [vector] ifoldM_: OK (0.01s)
  8793. 691.55 s [vector] +++ OK, passed 100 tests.
  8794. 691.56 s [vector] ifoldM'_: OK
  8795. 691.56 s [vector] +++ OK, passed 100 tests.
  8796. 691.56 s [vector] all: OK
  8797. 691.56 s [vector] +++ OK, passed 100 tests.
  8798. 691.56 s [vector] any: OK
  8799. 691.56 s [vector] +++ OK, passed 100 tests.
  8800. 691.56 s [vector] prescanl: OK
  8801. 691.56 s [vector] +++ OK, passed 100 tests.
  8802. 691.56 s [vector] prescanl': OK
  8803. 691.56 s [vector] +++ OK, passed 100 tests.
  8804. 691.56 s [vector] postscanl: OK
  8805. 691.56 s [vector] +++ OK, passed 100 tests.
  8806. 691.56 s [vector] postscanl': OK
  8807. 691.56 s [vector] +++ OK, passed 100 tests.
  8808. 691.56 s [vector] scanl: OK
  8809. 691.56 s [vector] +++ OK, passed 100 tests.
  8810. 691.57 s [vector] scanl': OK
  8811. 691.57 s [vector] +++ OK, passed 100 tests.
  8812. 691.57 s [vector] scanl1: OK
  8813. 691.58 s [vector] +++ OK, passed 100 tests.
  8814. 691.58 s [vector] scanl1': OK
  8815. 691.58 s [vector] +++ OK, passed 100 tests.
  8816. 691.58 s [vector] iscanl: OK
  8817. 691.58 s [vector] +++ OK, passed 100 tests.
  8818. 691.58 s [vector] iscanl': OK
  8819. 691.58 s [vector] +++ OK, passed 100 tests.
  8820. 691.58 s [vector] prescanr: OK
  8821. 691.58 s [vector] +++ OK, passed 100 tests.
  8822. 691.58 s [vector] prescanr': OK
  8823. 691.58 s [vector] +++ OK, passed 100 tests.
  8824. 691.58 s [vector] postscanr: OK
  8825. 691.59 s [vector] +++ OK, passed 100 tests.
  8826. 691.59 s [vector] postscanr': OK
  8827. 691.59 s [vector] +++ OK, passed 100 tests.
  8828. 691.59 s [vector] scanr: OK
  8829. 691.59 s [vector] +++ OK, passed 100 tests.
  8830. 691.59 s [vector] scanr': OK
  8831. 691.59 s [vector] +++ OK, passed 100 tests.
  8832. 691.59 s [vector] scanr1: OK
  8833. 691.59 s [vector] +++ OK, passed 100 tests.
  8834. 691.59 s [vector] scanr1': OK
  8835. 691.59 s [vector] +++ OK, passed 100 tests.
  8836. 691.59 s [vector] iscanr: OK
  8837. 691.59 s [vector] +++ OK, passed 100 tests.
  8838. 691.59 s [vector] iscanr': OK
  8839. 691.59 s [vector] +++ OK, passed 100 tests.
  8840. 691.59 s [vector] mut_read: OK
  8841. 691.60 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8842. 691.61 s [vector] mut_write: OK
  8843. 691.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8844. 691.61 s [vector] mut_modify: OK
  8845. 691.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8846. 691.61 s [vector] mut_generate: OK
  8847. 691.61 s [vector] +++ OK, passed 100 tests.
  8848. 691.62 s [vector] mut_generateM: OK
  8849. 691.63 s [vector] +++ OK, passed 100 tests.
  8850. 691.63 s [vector] mut_mapM_: OK
  8851. 691.63 s [vector] +++ OK, passed 100 tests.
  8852. 691.63 s [vector] mut_imapM_: OK
  8853. 691.63 s [vector] +++ OK, passed 100 tests.
  8854. 691.64 s [vector] mut_forM_: OK
  8855. 691.64 s [vector] +++ OK, passed 100 tests.
  8856. 691.64 s [vector] mut_iforM_: OK
  8857. 691.64 s [vector] +++ OK, passed 100 tests.
  8858. 691.64 s [vector] mut_foldr: OK
  8859. 691.64 s [vector] +++ OK, passed 100 tests.
  8860. 691.65 s [vector] mut_foldr': OK
  8861. 691.65 s [vector] +++ OK, passed 100 tests.
  8862. 691.65 s [vector] mut_foldl: OK
  8863. 691.65 s [vector] +++ OK, passed 100 tests.
  8864. 691.65 s [vector] mut_foldl': OK
  8865. 691.65 s [vector] +++ OK, passed 100 tests.
  8866. 691.65 s [vector] mut_ifoldr: OK
  8867. 691.65 s [vector] +++ OK, passed 100 tests.
  8868. 691.65 s [vector] mut_ifoldr': OK
  8869. 691.65 s [vector] +++ OK, passed 100 tests.
  8870. 691.65 s [vector] mut_ifoldl: OK
  8871. 691.65 s [vector] +++ OK, passed 100 tests.
  8872. 691.65 s [vector] mut_ifoldl': OK
  8873. 691.65 s [vector] +++ OK, passed 100 tests.
  8874. 691.65 s [vector] mut_foldM: OK
  8875. 691.65 s [vector] +++ OK, passed 100 tests.
  8876. 691.65 s [vector] mut_foldM': OK
  8877. 691.65 s [vector] +++ OK, passed 100 tests.
  8878. 691.65 s [vector] mut_foldrM: OK
  8879. 691.65 s [vector] +++ OK, passed 100 tests.
  8880. 691.65 s [vector] mut_foldrM': OK
  8881. 691.65 s [vector] +++ OK, passed 100 tests.
  8882. 691.66 s [vector] mut_ifoldM: OK
  8883. 691.66 s [vector] +++ OK, passed 100 tests.
  8884. 691.66 s [vector] mut_ifoldM': OK
  8885. 691.66 s [vector] +++ OK, passed 100 tests.
  8886. 691.66 s [vector] mut_ifoldrM: OK
  8887. 691.66 s [vector] +++ OK, passed 100 tests.
  8888. 691.66 s [vector] mut_ifoldrM': OK
  8889. 691.66 s [vector] +++ OK, passed 100 tests.
  8890. 691.66 s [vector] compare: OK
  8891. 691.66 s [vector] +++ OK, passed 100 tests.
  8892. 691.66 s [vector] maximum: OK
  8893. 691.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8894. 691.66 s [vector] minimum: OK
  8895. 691.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8896. 691.67 s [vector] minIndex: OK
  8897. 691.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8898. 691.67 s [vector] maxIndex: OK
  8899. 691.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8900. 691.67 s [vector] maximumBy: OK
  8901. 691.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8902. 691.67 s [vector] minimumBy: OK
  8903. 691.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8904. 691.67 s [vector] maximumOn: OK
  8905. 691.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8906. 691.67 s [vector] minimumOn: OK
  8907. 691.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8908. 691.68 s [vector] maxIndexBy: OK
  8909. 691.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8910. 691.69 s [vector] minIndexBy: OK
  8911. 691.69 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8912. 691.69 s [vector] ListFirstMaxIndexWins: OK
  8913. 691.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8914. 691.69 s [vector] FalseListFirstMaxIndexWins: OK
  8915. 691.69 s [vector] +++ OK, failed as expected. (after 1 test):
  8916. 691.70 s [vector] Exception:
  8917. 691.70 s [vector] Prelude.foldr1: empty list
  8918. 691.70 s [vector] CallStack (from HasCallStack):
  8919. 691.70 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8920. 691.70 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8921. 691.70 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8922. 691.70 s [vector] []
  8923. 691.70 s [vector] zip: OK
  8924. 691.70 s [vector] +++ OK, passed 100 tests.
  8925. 691.70 s [vector] zip3: OK
  8926. 691.70 s [vector] +++ OK, passed 100 tests.
  8927. 691.70 s [vector] unzip: OK
  8928. 691.70 s [vector] +++ OK, passed 100 tests.
  8929. 691.70 s [vector] unzip3: OK
  8930. 691.70 s [vector] +++ OK, passed 100 tests.
  8931. 691.70 s [vector] indexed: OK
  8932. 691.70 s [vector] +++ OK, passed 100 tests.
  8933. 691.70 s [vector] update: OK
  8934. 691.71 s [vector] +++ OK, passed 100 tests.
  8935. 691.71 s [vector] concat: OK
  8936. 691.71 s [vector] +++ OK, passed 100 tests.
  8937. 691.71 s [vector] mempty: OK
  8938. 691.71 s [vector] +++ OK, passed 100 tests.
  8939. 691.71 s [vector] mappend: OK
  8940. 691.71 s [vector] +++ OK, passed 100 tests.
  8941. 691.71 s [vector] mconcat: OK
  8942. 691.71 s [vector] +++ OK, passed 100 tests.
  8943. 691.71 s [vector] fmap: OK
  8944. 691.71 s [vector] +++ OK, passed 100 tests.
  8945. 691.71 s [vector] return: OK
  8946. 691.71 s [vector] +++ OK, passed 100 tests.
  8947. 691.71 s [vector] bind: OK (0.01s)
  8948. 691.71 s [vector] +++ OK, passed 100 tests.
  8949. 691.71 s [vector] mzip: OK
  8950. 691.71 s [vector] +++ OK, passed 100 tests.
  8951. 691.71 s [vector] munzip: OK
  8952. 691.71 s [vector] +++ OK, passed 100 tests.
  8953. 691.71 s [vector] applicative_pure: OK
  8954. 691.71 s [vector] +++ OK, passed 100 tests.
  8955. 691.71 s [vector] applicative_appl: OK (0.01s)
  8956. 691.71 s [vector] +++ OK, passed 100 tests.
  8957. 691.71 s [vector] alternative_empty: OK
  8958. 691.71 s [vector] +++ OK, passed 100 tests.
  8959. 691.71 s [vector] alternative_or: OK
  8960. 691.71 s [vector] +++ OK, passed 100 tests.
  8961. 691.72 s [vector] sequence: OK (0.02s)
  8962. 691.72 s [vector] +++ OK, passed 100 tests.
  8963. 691.74 s [vector] sequence_: OK
  8964. 691.74 s [vector] +++ OK, passed 100 tests.
  8965. 691.74 s [vector] glength: OK
  8966. 691.74 s [vector] +++ OK, passed 100 tests.
  8967. 691.74 s [vector] and: OK
  8968. 691.74 s [vector] +++ OK, passed 100 tests.
  8969. 691.74 s [vector] or: OK
  8970. 691.74 s [vector] +++ OK, passed 100 tests.
  8971. 691.74 s [vector] Int
  8972. 691.74 s [vector] fromList.toList == id: OK
  8973. 691.74 s [vector] +++ OK, passed 100 tests.
  8974. 691.74 s [vector] toList.fromList == id: OK
  8975. 691.74 s [vector] +++ OK, passed 100 tests.
  8976. 691.74 s [vector] unstream.stream == id: OK
  8977. 691.74 s [vector] +++ OK, passed 100 tests.
  8978. 691.74 s [vector] stream.unstream == id: OK
  8979. 691.74 s [vector] +++ OK, passed 100 tests.
  8980. 691.74 s [vector] eq: OK
  8981. 691.74 s [vector] +++ OK, passed 100 tests.
  8982. 691.74 s [vector] length: OK
  8983. 691.74 s [vector] +++ OK, passed 100 tests.
  8984. 691.74 s [vector] null: OK
  8985. 691.74 s [vector] +++ OK, passed 100 tests.
  8986. 691.74 s [vector] index: OK
  8987. 691.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8988. 691.74 s [vector] safeIndex: OK
  8989. 691.74 s [vector] +++ OK, passed 100 tests.
  8990. 691.74 s [vector] head: OK
  8991. 691.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8992. 691.74 s [vector] last: OK
  8993. 691.74 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8994. 691.74 s [vector] unsafeIndex: OK
  8995. 691.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8996. 691.75 s [vector] unsafeHead: OK
  8997. 691.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8998. 691.75 s [vector] unsafeLast: OK
  8999. 691.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9000. 691.75 s [vector] slice: OK
  9001. 691.75 s [vector] +++ OK, passed 100 tests.
  9002. 691.75 s [vector] init: OK
  9003. 691.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9004. 691.75 s [vector] tail: OK
  9005. 691.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9006. 691.75 s [vector] take: OK
  9007. 691.75 s [vector] +++ OK, passed 100 tests.
  9008. 691.75 s [vector] drop: OK
  9009. 691.75 s [vector] +++ OK, passed 100 tests.
  9010. 691.75 s [vector] splitAt: OK
  9011. 691.75 s [vector] +++ OK, passed 100 tests.
  9012. 691.75 s [vector] empty: OK
  9013. 691.75 s [vector] +++ OK, passed 100 tests.
  9014. 691.75 s [vector] singleton: OK
  9015. 691.75 s [vector] +++ OK, passed 100 tests.
  9016. 691.75 s [vector] replicate: OK
  9017. 691.75 s [vector] +++ OK, passed 100 tests.
  9018. 691.75 s [vector] generate: OK
  9019. 691.75 s [vector] +++ OK, passed 100 tests.
  9020. 691.76 s [vector] iterateN: OK
  9021. 691.76 s [vector] +++ OK, passed 100 tests.
  9022. 691.76 s [vector] iterateNM: OK (0.01s)
  9023. 691.76 s [vector] +++ OK, passed 100 tests.
  9024. 691.79 s [vector] generateM: OK (0.02s)
  9025. 691.79 s [vector] +++ OK, passed 100 tests.
  9026. 691.79 s [vector] replicateM: OK
  9027. 691.79 s [vector] +++ OK, passed 100 tests.
  9028. 691.80 s [vector] create: OK
  9029. 691.80 s [vector] +++ OK, passed 100 tests.
  9030. 691.80 s [vector] createT: OK
  9031. 691.80 s [vector] +++ OK, passed 100 tests.
  9032. 691.81 s [vector] unfoldr: OK
  9033. 691.81 s [vector] +++ OK, passed 100 tests.
  9034. 691.82 s [vector] unfoldrN: OK
  9035. 691.82 s [vector] +++ OK, passed 100 tests.
  9036. 691.82 s [vector] unfoldrExactN: OK
  9037. 691.82 s [vector] +++ OK, passed 100 tests.
  9038. 691.82 s [vector] unfoldrM: OK
  9039. 691.82 s [vector] +++ OK, passed 100 tests.
  9040. 691.82 s [vector] unfoldrNM: OK
  9041. 691.82 s [vector] +++ OK, passed 100 tests.
  9042. 691.82 s [vector] unfoldrExactNM: OK (0.02s)
  9043. 691.82 s [vector] +++ OK, passed 100 tests.
  9044. 691.82 s [vector] constructN: OK
  9045. 691.82 s [vector] +++ OK, passed 100 tests.
  9046. 691.83 s [vector] constructrN: OK
  9047. 691.83 s [vector] +++ OK, passed 100 tests.
  9048. 691.83 s [vector] cons: OK
  9049. 691.83 s [vector] +++ OK, passed 100 tests.
  9050. 691.83 s [vector] snoc: OK
  9051. 691.83 s [vector] +++ OK, passed 100 tests.
  9052. 691.84 s [vector] append: OK
  9053. 691.84 s [vector] +++ OK, passed 100 tests.
  9054. 691.85 s [vector] concat: OK (0.01s)
  9055. 691.85 s [vector] +++ OK, passed 100 tests.
  9056. 691.85 s [vector] force: OK
  9057. 691.85 s [vector] +++ OK, passed 100 tests.
  9058. 691.85 s [vector] upd: OK
  9059. 691.85 s [vector] +++ OK, passed 100 tests.
  9060. 691.85 s [vector] accum: OK
  9061. 691.85 s [vector] +++ OK, passed 100 tests.
  9062. 691.85 s [vector] reverse: OK
  9063. 691.85 s [vector] +++ OK, passed 100 tests.
  9064. 691.85 s [vector] backpermute: OK
  9065. 691.85 s [vector] +++ OK, passed 100 tests.
  9066. 691.85 s [vector] map: OK
  9067. 691.85 s [vector] +++ OK, passed 100 tests.
  9068. 691.85 s [vector] imap: OK
  9069. 691.85 s [vector] +++ OK, passed 100 tests.
  9070. 691.87 s [vector] concatMap: OK
  9071. 691.87 s [vector] +++ OK, passed 100 tests.
  9072. 691.87 s [vector] mapM: OK
  9073. 691.87 s [vector] +++ OK, passed 100 tests.
  9074. 691.87 s [vector] mapM_: OK (0.01s)
  9075. 691.88 s [vector] +++ OK, passed 100 tests.
  9076. 691.88 s [vector] forM: OK
  9077. 691.88 s [vector] +++ OK, passed 100 tests.
  9078. 691.89 s [vector] forM_: OK (0.01s)
  9079. 691.89 s [vector] +++ OK, passed 100 tests.
  9080. 691.89 s [vector] imapM: OK
  9081. 691.89 s [vector] +++ OK, passed 100 tests.
  9082. 691.90 s [vector] imapM_: OK (0.02s)
  9083. 691.90 s [vector] +++ OK, passed 100 tests.
  9084. 691.91 s [vector] zipWith: OK
  9085. 691.91 s [vector] +++ OK, passed 100 tests.
  9086. 691.91 s [vector] zipWith3: OK
  9087. 691.91 s [vector] +++ OK, passed 100 tests.
  9088. 691.91 s [vector] izipWith: OK
  9089. 691.92 s [vector] +++ OK, passed 100 tests.
  9090. 691.92 s [vector] izipWith3: OK
  9091. 691.92 s [vector] +++ OK, passed 100 tests.
  9092. 691.92 s [vector] izipWithM: OK
  9093. 691.93 s [vector] +++ OK, passed 100 tests.
  9094. 691.93 s [vector] izipWithM_: OK (0.01s)
  9095. 691.93 s [vector] +++ OK, passed 100 tests.
  9096. 691.93 s [vector] zipWithM: OK
  9097. 691.94 s [vector] +++ OK, passed 100 tests.
  9098. 691.94 s [vector] zipWithM_: OK
  9099. 691.95 s [vector] +++ OK, passed 100 tests.
  9100. 691.95 s [vector] filter: OK
  9101. 691.95 s [vector] +++ OK, passed 100 tests.
  9102. 691.95 s [vector] ifilter: OK
  9103. 691.95 s [vector] +++ OK, passed 100 tests.
  9104. 691.97 s [vector] filterM: OK (0.03s)
  9105. 691.97 s [vector] +++ OK, passed 100 tests.
  9106. 691.98 s [vector] uniq: OK
  9107. 691.98 s [vector] +++ OK, passed 100 tests.
  9108. 691.98 s [vector] mapMaybe: OK
  9109. 691.98 s [vector] +++ OK, passed 100 tests.
  9110. 691.98 s [vector] imapMaybe: OK
  9111. 691.98 s [vector] +++ OK, passed 100 tests.
  9112. 691.98 s [vector] takeWhile: OK
  9113. 691.98 s [vector] +++ OK, passed 100 tests.
  9114. 691.99 s [vector] dropWhile: OK
  9115. 691.99 s [vector] +++ OK, passed 100 tests.
  9116. 691.99 s [vector] partition: OK
  9117. 691.99 s [vector] +++ OK, passed 100 tests.
  9118. 691.99 s [vector] partitionWith: OK
  9119. 691.99 s [vector] +++ OK, passed 100 tests.
  9120. 691.99 s [vector] span: OK
  9121. 691.99 s [vector] +++ OK, passed 100 tests.
  9122. 691.99 s [vector] break: OK
  9123. 691.99 s [vector] +++ OK, passed 100 tests.
  9124. 691.99 s [vector] spanR: OK
  9125. 691.99 s [vector] +++ OK, passed 100 tests.
  9126. 691.99 s [vector] breakR: OK
  9127. 691.99 s [vector] +++ OK, passed 100 tests.
  9128. 691.99 s [vector] groupBy: OK
  9129. 691.99 s [vector] +++ OK, passed 100 tests.
  9130. 691.99 s [vector] elem: OK
  9131. 691.99 s [vector] +++ OK, passed 100 tests.
  9132. 691.99 s [vector] notElem: OK
  9133. 691.99 s [vector] +++ OK, passed 100 tests.
  9134. 691.99 s [vector] find: OK
  9135. 691.99 s [vector] +++ OK, passed 100 tests.
  9136. 692.00 s [vector] findIndex: OK
  9137. 692.00 s [vector] +++ OK, passed 100 tests.
  9138. 692.00 s [vector] findIndexR: OK
  9139. 692.00 s [vector] +++ OK, passed 100 tests.
  9140. 692.00 s [vector] findIndices: OK
  9141. 692.00 s [vector] +++ OK, passed 100 tests.
  9142. 692.00 s [vector] elemIndex: OK
  9143. 692.00 s [vector] +++ OK, passed 100 tests.
  9144. 692.00 s [vector] elemIndices: OK
  9145. 692.00 s [vector] +++ OK, passed 100 tests.
  9146. 692.00 s [vector] foldl: OK
  9147. 692.00 s [vector] +++ OK, passed 100 tests.
  9148. 692.00 s [vector] foldl1: OK
  9149. 692.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9150. 692.00 s [vector] foldl': OK
  9151. 692.00 s [vector] +++ OK, passed 100 tests.
  9152. 692.01 s [vector] foldl1': OK
  9153. 692.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9154. 692.01 s [vector] foldr: OK
  9155. 692.01 s [vector] +++ OK, passed 100 tests.
  9156. 692.01 s [vector] foldr1: OK
  9157. 692.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9158. 692.01 s [vector] foldr': OK
  9159. 692.01 s [vector] +++ OK, passed 100 tests.
  9160. 692.02 s [vector] foldr1': OK
  9161. 692.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9162. 692.02 s [vector] ifoldl: OK
  9163. 692.02 s [vector] +++ OK, passed 100 tests.
  9164. 692.02 s [vector] ifoldl': OK
  9165. 692.02 s [vector] +++ OK, passed 100 tests.
  9166. 692.02 s [vector] ifoldr: OK
  9167. 692.02 s [vector] +++ OK, passed 100 tests.
  9168. 692.03 s [vector] ifoldr': OK
  9169. 692.03 s [vector] +++ OK, passed 100 tests.
  9170. 692.03 s [vector] ifoldM: OK
  9171. 692.03 s [vector] +++ OK, passed 100 tests.
  9172. 692.05 s [vector] ifoldM': OK
  9173. 692.05 s [vector] +++ OK, passed 100 tests.
  9174. 692.05 s [vector] ifoldM_: OK (0.02s)
  9175. 692.05 s [vector] +++ OK, passed 100 tests.
  9176. 692.06 s [vector] ifoldM'_: OK (0.01s)
  9177. 692.06 s [vector] +++ OK, passed 100 tests.
  9178. 692.06 s [vector] all: OK
  9179. 692.06 s [vector] +++ OK, passed 100 tests.
  9180. 692.06 s [vector] any: OK
  9181. 692.06 s [vector] +++ OK, passed 100 tests.
  9182. 692.07 s [vector] prescanl: OK
  9183. 692.07 s [vector] +++ OK, passed 100 tests.
  9184. 692.07 s [vector] prescanl': OK
  9185. 692.07 s [vector] +++ OK, passed 100 tests.
  9186. 692.07 s [vector] postscanl: OK
  9187. 692.07 s [vector] +++ OK, passed 100 tests.
  9188. 692.07 s [vector] postscanl': OK
  9189. 692.07 s [vector] +++ OK, passed 100 tests.
  9190. 692.07 s [vector] scanl: OK
  9191. 692.07 s [vector] +++ OK, passed 100 tests.
  9192. 692.07 s [vector] scanl': OK
  9193. 692.07 s [vector] +++ OK, passed 100 tests.
  9194. 692.07 s [vector] scanl1: OK
  9195. 692.08 s [vector] +++ OK, passed 100 tests.
  9196. 692.08 s [vector] scanl1': OK
  9197. 692.08 s [vector] +++ OK, passed 100 tests.
  9198. 692.08 s [vector] iscanl: OK
  9199. 692.09 s [vector] +++ OK, passed 100 tests.
  9200. 692.09 s [vector] iscanl': OK
  9201. 692.09 s [vector] +++ OK, passed 100 tests.
  9202. 692.10 s [vector] prescanr: OK
  9203. 692.10 s [vector] +++ OK, passed 100 tests.
  9204. 692.10 s [vector] prescanr': OK
  9205. 692.10 s [vector] +++ OK, passed 100 tests.
  9206. 692.10 s [vector] postscanr: OK
  9207. 692.10 s [vector] +++ OK, passed 100 tests.
  9208. 692.10 s [vector] postscanr': OK
  9209. 692.11 s [vector] +++ OK, passed 100 tests.
  9210. 692.11 s [vector] scanr: OK
  9211. 692.11 s [vector] +++ OK, passed 100 tests.
  9212. 692.11 s [vector] scanr': OK
  9213. 692.11 s [vector] +++ OK, passed 100 tests.
  9214. 692.11 s [vector] scanr1: OK
  9215. 692.12 s [vector] +++ OK, passed 100 tests.
  9216. 692.12 s [vector] scanr1': OK
  9217. 692.12 s [vector] +++ OK, passed 100 tests.
  9218. 692.12 s [vector] iscanr: OK
  9219. 692.12 s [vector] +++ OK, passed 100 tests.
  9220. 692.12 s [vector] iscanr': OK
  9221. 692.12 s [vector] +++ OK, passed 100 tests.
  9222. 692.12 s [vector] mut_read: OK
  9223. 692.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9224. 692.12 s [vector] mut_write: OK
  9225. 692.12 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9226. 692.12 s [vector] mut_modify: OK
  9227. 692.12 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9228. 692.12 s [vector] mut_generate: OK
  9229. 692.13 s [vector] +++ OK, passed 100 tests.
  9230. 692.15 s [vector] mut_generateM: OK (0.01s)
  9231. 692.15 s [vector] +++ OK, passed 100 tests.
  9232. 692.17 s [vector] mut_mapM_: OK (0.02s)
  9233. 692.17 s [vector] +++ OK, passed 100 tests.
  9234. 692.17 s [vector] mut_imapM_: OK (0.01s)
  9235. 692.17 s [vector] +++ OK, passed 100 tests.
  9236. 692.19 s [vector] mut_forM_: OK (0.02s)
  9237. 692.19 s [vector] +++ OK, passed 100 tests.
  9238. 692.20 s [vector] mut_iforM_: OK (0.02s)
  9239. 692.20 s [vector] +++ OK, passed 100 tests.
  9240. 692.20 s [vector] mut_foldr: OK
  9241. 692.20 s [vector] +++ OK, passed 100 tests.
  9242. 692.20 s [vector] mut_foldr': OK
  9243. 692.20 s [vector] +++ OK, passed 100 tests.
  9244. 692.21 s [vector] mut_foldl: OK
  9245. 692.21 s [vector] +++ OK, passed 100 tests.
  9246. 692.21 s [vector] mut_foldl': OK
  9247. 692.21 s [vector] +++ OK, passed 100 tests.
  9248. 692.22 s [vector] mut_ifoldr: OK
  9249. 692.22 s [vector] +++ OK, passed 100 tests.
  9250. 692.22 s [vector] mut_ifoldr': OK
  9251. 692.22 s [vector] +++ OK, passed 100 tests.
  9252. 692.22 s [vector] mut_ifoldl: OK
  9253. 692.22 s [vector] +++ OK, passed 100 tests.
  9254. 692.22 s [vector] mut_ifoldl': OK
  9255. 692.22 s [vector] +++ OK, passed 100 tests.
  9256. 692.22 s [vector] mut_foldM: OK
  9257. 692.23 s [vector] +++ OK, passed 100 tests.
  9258. 692.23 s [vector] mut_foldM': OK
  9259. 692.23 s [vector] +++ OK, passed 100 tests.
  9260. 692.23 s [vector] mut_foldrM: OK
  9261. 692.23 s [vector] +++ OK, passed 100 tests.
  9262. 692.23 s [vector] mut_foldrM': OK
  9263. 692.23 s [vector] +++ OK, passed 100 tests.
  9264. 692.23 s [vector] mut_ifoldM: OK
  9265. 692.23 s [vector] +++ OK, passed 100 tests.
  9266. 692.23 s [vector] mut_ifoldM': OK
  9267. 692.23 s [vector] +++ OK, passed 100 tests.
  9268. 692.24 s [vector] mut_ifoldrM: OK
  9269. 692.24 s [vector] +++ OK, passed 100 tests.
  9270. 692.24 s [vector] mut_ifoldrM': OK
  9271. 692.24 s [vector] +++ OK, passed 100 tests.
  9272. 692.24 s [vector] compare: OK
  9273. 692.24 s [vector] +++ OK, passed 100 tests.
  9274. 692.24 s [vector] maximum: OK
  9275. 692.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9276. 692.24 s [vector] minimum: OK
  9277. 692.24 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9278. 692.24 s [vector] minIndex: OK
  9279. 692.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9280. 692.24 s [vector] maxIndex: OK
  9281. 692.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9282. 692.25 s [vector] maximumBy: OK
  9283. 692.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9284. 692.25 s [vector] minimumBy: OK
  9285. 692.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9286. 692.25 s [vector] maximumOn: OK
  9287. 692.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9288. 692.25 s [vector] minimumOn: OK
  9289. 692.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9290. 692.25 s [vector] maxIndexBy: OK
  9291. 692.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9292. 692.25 s [vector] minIndexBy: OK
  9293. 692.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9294. 692.25 s [vector] ListFirstMaxIndexWins: OK
  9295. 692.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9296. 692.25 s [vector] FalseListFirstMaxIndexWins: OK
  9297. 692.25 s [vector] +++ OK, failed as expected. (after 1 test):
  9298. 692.25 s [vector] Exception:
  9299. 692.25 s [vector] Prelude.foldr1: empty list
  9300. 692.25 s [vector] CallStack (from HasCallStack):
  9301. 692.25 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9302. 692.25 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9303. 692.25 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9304. 692.25 s [vector] []
  9305. 692.25 s [vector] zip: OK
  9306. 692.25 s [vector] +++ OK, passed 100 tests.
  9307. 692.25 s [vector] zip3: OK
  9308. 692.25 s [vector] +++ OK, passed 100 tests.
  9309. 692.26 s [vector] unzip: OK
  9310. 692.26 s [vector] +++ OK, passed 100 tests.
  9311. 692.27 s [vector] unzip3: OK
  9312. 692.27 s [vector] +++ OK, passed 100 tests.
  9313. 692.27 s [vector] indexed: OK
  9314. 692.27 s [vector] +++ OK, passed 100 tests.
  9315. 692.27 s [vector] update: OK
  9316. 692.27 s [vector] +++ OK, passed 100 tests.
  9317. 692.27 s [vector] concat: OK (0.01s)
  9318. 692.27 s [vector] +++ OK, passed 100 tests.
  9319. 692.27 s [vector] mempty: OK
  9320. 692.27 s [vector] +++ OK, passed 100 tests.
  9321. 692.27 s [vector] mappend: OK
  9322. 692.27 s [vector] +++ OK, passed 100 tests.
  9323. 692.28 s [vector] mconcat: OK (0.01s)
  9324. 692.28 s [vector] +++ OK, passed 100 tests.
  9325. 692.29 s [vector] fmap: OK
  9326. 692.29 s [vector] +++ OK, passed 100 tests.
  9327. 692.29 s [vector] return: OK
  9328. 692.29 s [vector] +++ OK, passed 100 tests.
  9329. 692.30 s [vector] bind: OK (0.01s)
  9330. 692.30 s [vector] +++ OK, passed 100 tests.
  9331. 692.30 s [vector] mzip: OK
  9332. 692.30 s [vector] +++ OK, passed 100 tests.
  9333. 692.30 s [vector] munzip: OK
  9334. 692.30 s [vector] +++ OK, passed 100 tests.
  9335. 692.31 s [vector] applicative_pure: OK
  9336. 692.31 s [vector] +++ OK, passed 100 tests.
  9337. 692.33 s [vector] applicative_appl: OK (0.03s)
  9338. 692.33 s [vector] +++ OK, passed 100 tests.
  9339. 692.33 s [vector] alternative_empty: OK
  9340. 692.33 s [vector] +++ OK, passed 100 tests.
  9341. 692.33 s [vector] alternative_or: OK
  9342. 692.33 s [vector] +++ OK, passed 100 tests.
  9343. 692.38 s [vector] sequence: OK (0.04s)
  9344. 692.38 s [vector] +++ OK, passed 100 tests.
  9345. 692.38 s [vector] sequence_: OK
  9346. 692.38 s [vector] +++ OK, passed 100 tests.
  9347. 692.38 s [vector] glength: OK
  9348. 692.38 s [vector] +++ OK, passed 100 tests.
  9349. 692.38 s [vector] sum: OK
  9350. 692.38 s [vector] +++ OK, passed 100 tests.
  9351. 692.38 s [vector] product: OK
  9352. 692.38 s [vector] +++ OK, passed 100 tests.
  9353. 692.38 s [vector] enumFromN: OK
  9354. 692.38 s [vector] +++ OK, passed 100 tests.
  9355. 692.38 s [vector] enumFromThenN: OK
  9356. 692.38 s [vector] +++ OK, passed 100 tests.
  9357. 692.38 s [vector] enumFromTo: OK
  9358. 692.38 s [vector] +++ OK, passed 100 tests.
  9359. 692.38 s [vector] enumFromThenTo: OK
  9360. 692.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9361. 692.38 s [vector] unstream
  9362. 692.38 s [vector] unstream == vunstream (exact): OK
  9363. 692.38 s [vector] +++ OK, passed 100 tests.
  9364. 692.38 s [vector] unstream == vunstream (unknown): OK
  9365. 692.39 s [vector] +++ OK, passed 100 tests.
  9366. 692.39 s [vector] unstreamR ~= vunstream (exact): OK
  9367. 692.39 s [vector] +++ OK, passed 100 tests.
  9368. 692.39 s [vector] unstreamR ~= vunstream (unknown): OK
  9369. 692.39 s [vector] +++ OK, passed 100 tests.
  9370. 692.39 s [vector] Tests.Vector.Primitive
  9371. 692.39 s [vector] Int
  9372. 692.39 s [vector] fromList.toList == id: OK
  9373. 692.39 s [vector] +++ OK, passed 100 tests.
  9374. 692.39 s [vector] toList.fromList == id: OK
  9375. 692.39 s [vector] +++ OK, passed 100 tests.
  9376. 692.39 s [vector] unstream.stream == id: OK
  9377. 692.39 s [vector] +++ OK, passed 100 tests.
  9378. 692.39 s [vector] stream.unstream == id: OK
  9379. 692.39 s [vector] +++ OK, passed 100 tests.
  9380. 692.39 s [vector] eq: OK
  9381. 692.39 s [vector] +++ OK, passed 100 tests.
  9382. 692.39 s [vector] length: OK
  9383. 692.39 s [vector] +++ OK, passed 100 tests.
  9384. 692.39 s [vector] null: OK
  9385. 692.39 s [vector] +++ OK, passed 100 tests.
  9386. 692.39 s [vector] index: OK
  9387. 692.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9388. 692.39 s [vector] safeIndex: OK
  9389. 692.39 s [vector] +++ OK, passed 100 tests.
  9390. 692.39 s [vector] head: OK
  9391. 692.39 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9392. 692.39 s [vector] last: OK
  9393. 692.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9394. 692.39 s [vector] unsafeIndex: OK
  9395. 692.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9396. 692.39 s [vector] unsafeHead: OK
  9397. 692.39 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9398. 692.39 s [vector] unsafeLast: OK
  9399. 692.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9400. 692.39 s [vector] slice: OK
  9401. 692.39 s [vector] +++ OK, passed 100 tests.
  9402. 692.39 s [vector] init: OK
  9403. 692.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9404. 692.40 s [vector] tail: OK
  9405. 692.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9406. 692.40 s [vector] take: OK
  9407. 692.40 s [vector] +++ OK, passed 100 tests.
  9408. 692.40 s [vector] drop: OK
  9409. 692.40 s [vector] +++ OK, passed 100 tests.
  9410. 692.40 s [vector] splitAt: OK
  9411. 692.40 s [vector] +++ OK, passed 100 tests.
  9412. 692.40 s [vector] empty: OK
  9413. 692.40 s [vector] +++ OK, passed 100 tests.
  9414. 692.40 s [vector] singleton: OK
  9415. 692.40 s [vector] +++ OK, passed 100 tests.
  9416. 692.40 s [vector] replicate: OK
  9417. 692.40 s [vector] +++ OK, passed 100 tests.
  9418. 692.40 s [vector] generate: OK
  9419. 692.41 s [vector] +++ OK, passed 100 tests.
  9420. 692.41 s [vector] iterateN: OK
  9421. 692.41 s [vector] +++ OK, passed 100 tests.
  9422. 692.43 s [vector] iterateNM: OK (0.02s)
  9423. 692.43 s [vector] +++ OK, passed 100 tests.
  9424. 692.45 s [vector] generateM: OK (0.02s)
  9425. 692.45 s [vector] +++ OK, passed 100 tests.
  9426. 692.45 s [vector] replicateM: OK
  9427. 692.45 s [vector] +++ OK, passed 100 tests.
  9428. 692.45 s [vector] create: OK
  9429. 692.45 s [vector] +++ OK, passed 100 tests.
  9430. 692.45 s [vector] createT: OK
  9431. 692.45 s [vector] +++ OK, passed 100 tests.
  9432. 692.45 s [vector] unfoldr: OK
  9433. 692.45 s [vector] +++ OK, passed 100 tests.
  9434. 692.45 s [vector] unfoldrN: OK
  9435. 692.45 s [vector] +++ OK, passed 100 tests.
  9436. 692.45 s [vector] unfoldrExactN: OK
  9437. 692.46 s [vector] +++ OK, passed 100 tests.
  9438. 692.46 s [vector] unfoldrM: OK
  9439. 692.46 s [vector] +++ OK, passed 100 tests.
  9440. 692.46 s [vector] unfoldrNM: OK
  9441. 692.47 s [vector] +++ OK, passed 100 tests.
  9442. 692.48 s [vector] unfoldrExactNM: OK (0.01s)
  9443. 692.48 s [vector] +++ OK, passed 100 tests.
  9444. 692.48 s [vector] constructN: OK
  9445. 692.48 s [vector] +++ OK, passed 100 tests.
  9446. 692.48 s [vector] constructrN: OK
  9447. 692.48 s [vector] +++ OK, passed 100 tests.
  9448. 692.48 s [vector] cons: OK
  9449. 692.48 s [vector] +++ OK, passed 100 tests.
  9450. 692.48 s [vector] snoc: OK
  9451. 692.48 s [vector] +++ OK, passed 100 tests.
  9452. 692.48 s [vector] append: OK
  9453. 692.49 s [vector] +++ OK, passed 100 tests.
  9454. 692.50 s [vector] concat: OK (0.02s)
  9455. 692.50 s [vector] +++ OK, passed 100 tests.
  9456. 692.51 s [vector] force: OK
  9457. 692.51 s [vector] +++ OK, passed 100 tests.
  9458. 692.51 s [vector] upd: OK
  9459. 692.51 s [vector] +++ OK, passed 100 tests.
  9460. 692.51 s [vector] accum: OK
  9461. 692.51 s [vector] +++ OK, passed 100 tests.
  9462. 692.51 s [vector] reverse: OK
  9463. 692.51 s [vector] +++ OK, passed 100 tests.
  9464. 692.51 s [vector] backpermute: OK
  9465. 692.51 s [vector] +++ OK, passed 100 tests.
  9466. 692.52 s [vector] map: OK
  9467. 692.52 s [vector] +++ OK, passed 100 tests.
  9468. 692.53 s [vector] imap: OK
  9469. 692.53 s [vector] +++ OK, passed 100 tests.
  9470. 692.53 s [vector] concatMap: OK
  9471. 692.53 s [vector] +++ OK, passed 100 tests.
  9472. 692.53 s [vector] mapM: OK
  9473. 692.53 s [vector] +++ OK, passed 100 tests.
  9474. 692.54 s [vector] mapM_: OK (0.02s)
  9475. 692.55 s [vector] +++ OK, passed 100 tests.
  9476. 692.55 s [vector] forM: OK
  9477. 692.55 s [vector] +++ OK, passed 100 tests.
  9478. 692.55 s [vector] forM_: OK (0.01s)
  9479. 692.55 s [vector] +++ OK, passed 100 tests.
  9480. 692.57 s [vector] imapM: OK
  9481. 692.57 s [vector] +++ OK, passed 100 tests.
  9482. 692.57 s [vector] imapM_: OK (0.02s)
  9483. 692.57 s [vector] +++ OK, passed 100 tests.
  9484. 692.57 s [vector] zipWith: OK
  9485. 692.57 s [vector] +++ OK, passed 100 tests.
  9486. 692.58 s [vector] zipWith3: OK
  9487. 692.58 s [vector] +++ OK, passed 100 tests.
  9488. 692.58 s [vector] izipWith: OK
  9489. 692.58 s [vector] +++ OK, passed 100 tests.
  9490. 692.58 s [vector] izipWith3: OK
  9491. 692.58 s [vector] +++ OK, passed 100 tests.
  9492. 692.59 s [vector] izipWithM: OK
  9493. 692.59 s [vector] +++ OK, passed 100 tests.
  9494. 692.60 s [vector] izipWithM_: OK (0.01s)
  9495. 692.61 s [vector] +++ OK, passed 100 tests.
  9496. 692.61 s [vector] zipWithM: OK
  9497. 692.61 s [vector] +++ OK, passed 100 tests.
  9498. 692.61 s [vector] zipWithM_: OK (0.01s)
  9499. 692.62 s [vector] +++ OK, passed 100 tests.
  9500. 692.63 s [vector] filter: OK
  9501. 692.63 s [vector] +++ OK, passed 100 tests.
  9502. 692.63 s [vector] ifilter: OK
  9503. 692.63 s [vector] +++ OK, passed 100 tests.
  9504. 692.64 s [vector] filterM: OK (0.03s)
  9505. 692.64 s [vector] +++ OK, passed 100 tests.
  9506. 692.64 s [vector] uniq: OK
  9507. 692.64 s [vector] +++ OK, passed 100 tests.
  9508. 692.65 s [vector] mapMaybe: OK
  9509. 692.65 s [vector] +++ OK, passed 100 tests.
  9510. 692.65 s [vector] imapMaybe: OK
  9511. 692.65 s [vector] +++ OK, passed 100 tests.
  9512. 692.66 s [vector] takeWhile: OK
  9513. 692.66 s [vector] +++ OK, passed 100 tests.
  9514. 692.66 s [vector] dropWhile: OK
  9515. 692.66 s [vector] +++ OK, passed 100 tests.
  9516. 692.66 s [vector] partition: OK
  9517. 692.66 s [vector] +++ OK, passed 100 tests.
  9518. 692.66 s [vector] partitionWith: OK
  9519. 692.67 s [vector] +++ OK, passed 100 tests.
  9520. 692.67 s [vector] span: OK
  9521. 692.67 s [vector] +++ OK, passed 100 tests.
  9522. 692.67 s [vector] break: OK
  9523. 692.67 s [vector] +++ OK, passed 100 tests.
  9524. 692.67 s [vector] spanR: OK
  9525. 692.67 s [vector] +++ OK, passed 100 tests.
  9526. 692.67 s [vector] breakR: OK
  9527. 692.67 s [vector] +++ OK, passed 100 tests.
  9528. 692.67 s [vector] groupBy: OK
  9529. 692.67 s [vector] +++ OK, passed 100 tests.
  9530. 692.67 s [vector] elem: OK
  9531. 692.67 s [vector] +++ OK, passed 100 tests.
  9532. 692.67 s [vector] notElem: OK
  9533. 692.67 s [vector] +++ OK, passed 100 tests.
  9534. 692.67 s [vector] find: OK
  9535. 692.67 s [vector] +++ OK, passed 100 tests.
  9536. 692.67 s [vector] findIndex: OK
  9537. 692.67 s [vector] +++ OK, passed 100 tests.
  9538. 692.67 s [vector] findIndexR: OK
  9539. 692.67 s [vector] +++ OK, passed 100 tests.
  9540. 692.68 s [vector] findIndices: OK
  9541. 692.68 s [vector] +++ OK, passed 100 tests.
  9542. 692.68 s [vector] elemIndex: OK
  9543. 692.68 s [vector] +++ OK, passed 100 tests.
  9544. 692.68 s [vector] elemIndices: OK
  9545. 692.68 s [vector] +++ OK, passed 100 tests.
  9546. 692.68 s [vector] foldl: OK
  9547. 692.68 s [vector] +++ OK, passed 100 tests.
  9548. 692.69 s [vector] foldl1: OK
  9549. 692.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9550. 692.69 s [vector] foldl': OK
  9551. 692.69 s [vector] +++ OK, passed 100 tests.
  9552. 692.69 s [vector] foldl1': OK
  9553. 692.69 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9554. 692.70 s [vector] foldr: OK
  9555. 692.70 s [vector] +++ OK, passed 100 tests.
  9556. 692.70 s [vector] foldr1: OK
  9557. 692.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9558. 692.70 s [vector] foldr': OK
  9559. 692.71 s [vector] +++ OK, passed 100 tests.
  9560. 692.71 s [vector] foldr1': OK
  9561. 692.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9562. 692.71 s [vector] ifoldl: OK
  9563. 692.71 s [vector] +++ OK, passed 100 tests.
  9564. 692.71 s [vector] ifoldl': OK
  9565. 692.71 s [vector] +++ OK, passed 100 tests.
  9566. 692.72 s [vector] ifoldr: OK
  9567. 692.72 s [vector] +++ OK, passed 100 tests.
  9568. 692.72 s [vector] ifoldr': OK
  9569. 692.73 s [vector] +++ OK, passed 100 tests.
  9570. 692.73 s [vector] ifoldM: OK
  9571. 692.73 s [vector] +++ OK, passed 100 tests.
  9572. 692.75 s [vector] ifoldM': OK
  9573. 692.75 s [vector] +++ OK, passed 100 tests.
  9574. 692.77 s [vector] ifoldM_: OK (0.02s)
  9575. 692.77 s [vector] +++ OK, passed 100 tests.
  9576. 692.78 s [vector] ifoldM'_: OK (0.02s)
  9577. 692.78 s [vector] +++ OK, passed 100 tests.
  9578. 692.78 s [vector] all: OK
  9579. 692.78 s [vector] +++ OK, passed 100 tests.
  9580. 692.78 s [vector] any: OK
  9581. 692.78 s [vector] +++ OK, passed 100 tests.
  9582. 692.78 s [vector] prescanl: OK
  9583. 692.79 s [vector] +++ OK, passed 100 tests.
  9584. 692.79 s [vector] prescanl': OK
  9585. 692.79 s [vector] +++ OK, passed 100 tests.
  9586. 692.79 s [vector] postscanl: OK
  9587. 692.79 s [vector] +++ OK, passed 100 tests.
  9588. 692.79 s [vector] postscanl': OK
  9589. 692.79 s [vector] +++ OK, passed 100 tests.
  9590. 692.79 s [vector] scanl: OK
  9591. 692.79 s [vector] +++ OK, passed 100 tests.
  9592. 692.79 s [vector] scanl': OK
  9593. 692.79 s [vector] +++ OK, passed 100 tests.
  9594. 692.79 s [vector] scanl1: OK
  9595. 692.80 s [vector] +++ OK, passed 100 tests.
  9596. 692.80 s [vector] scanl1': OK
  9597. 692.80 s [vector] +++ OK, passed 100 tests.
  9598. 692.80 s [vector] iscanl: OK
  9599. 692.80 s [vector] +++ OK, passed 100 tests.
  9600. 692.81 s [vector] iscanl': OK
  9601. 692.81 s [vector] +++ OK, passed 100 tests.
  9602. 692.81 s [vector] prescanr: OK
  9603. 692.81 s [vector] +++ OK, passed 100 tests.
  9604. 692.81 s [vector] prescanr': OK
  9605. 692.81 s [vector] +++ OK, passed 100 tests.
  9606. 692.82 s [vector] postscanr: OK
  9607. 692.82 s [vector] +++ OK, passed 100 tests.
  9608. 692.82 s [vector] postscanr': OK
  9609. 692.82 s [vector] +++ OK, passed 100 tests.
  9610. 692.83 s [vector] scanr: OK
  9611. 692.83 s [vector] +++ OK, passed 100 tests.
  9612. 692.83 s [vector] scanr': OK
  9613. 692.83 s [vector] +++ OK, passed 100 tests.
  9614. 692.83 s [vector] scanr1: OK
  9615. 692.83 s [vector] +++ OK, passed 100 tests.
  9616. 692.83 s [vector] scanr1': OK
  9617. 692.83 s [vector] +++ OK, passed 100 tests.
  9618. 692.83 s [vector] iscanr: OK
  9619. 692.84 s [vector] +++ OK, passed 100 tests.
  9620. 692.84 s [vector] iscanr': OK
  9621. 692.84 s [vector] +++ OK, passed 100 tests.
  9622. 692.84 s [vector] mut_read: OK
  9623. 692.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9624. 692.84 s [vector] mut_write: OK
  9625. 692.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9626. 692.85 s [vector] mut_modify: OK
  9627. 692.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9628. 692.85 s [vector] mut_generate: OK
  9629. 692.85 s [vector] +++ OK, passed 100 tests.
  9630. 692.85 s [vector] mut_generateM: OK
  9631. 692.85 s [vector] +++ OK, passed 100 tests.
  9632. 692.87 s [vector] mut_mapM_: OK (0.01s)
  9633. 692.87 s [vector] +++ OK, passed 100 tests.
  9634. 692.87 s [vector] mut_imapM_: OK (0.01s)
  9635. 692.87 s [vector] +++ OK, passed 100 tests.
  9636. 692.89 s [vector] mut_forM_: OK
  9637. 692.89 s [vector] +++ OK, passed 100 tests.
  9638. 692.90 s [vector] mut_iforM_: OK (0.01s)
  9639. 692.91 s [vector] +++ OK, passed 100 tests.
  9640. 692.91 s [vector] mut_foldr: OK
  9641. 692.91 s [vector] +++ OK, passed 100 tests.
  9642. 692.91 s [vector] mut_foldr': OK
  9643. 692.91 s [vector] +++ OK, passed 100 tests.
  9644. 692.91 s [vector] mut_foldl: OK
  9645. 692.91 s [vector] +++ OK, passed 100 tests.
  9646. 692.91 s [vector] mut_foldl': OK
  9647. 692.92 s [vector] +++ OK, passed 100 tests.
  9648. 692.92 s [vector] mut_ifoldr: OK
  9649. 692.92 s [vector] +++ OK, passed 100 tests.
  9650. 692.92 s [vector] mut_ifoldr': OK
  9651. 692.92 s [vector] +++ OK, passed 100 tests.
  9652. 692.92 s [vector] mut_ifoldl: OK
  9653. 692.92 s [vector] +++ OK, passed 100 tests.
  9654. 692.93 s [vector] mut_ifoldl': OK
  9655. 692.93 s [vector] +++ OK, passed 100 tests.
  9656. 692.93 s [vector] mut_foldM: OK
  9657. 692.94 s [vector] +++ OK, passed 100 tests.
  9658. 692.94 s [vector] mut_foldM': OK
  9659. 692.94 s [vector] +++ OK, passed 100 tests.
  9660. 692.94 s [vector] mut_foldrM: OK
  9661. 692.95 s [vector] +++ OK, passed 100 tests.
  9662. 692.95 s [vector] mut_foldrM': OK
  9663. 692.95 s [vector] +++ OK, passed 100 tests.
  9664. 692.95 s [vector] mut_ifoldM: OK
  9665. 692.96 s [vector] +++ OK, passed 100 tests.
  9666. 692.96 s [vector] mut_ifoldM': OK
  9667. 692.96 s [vector] +++ OK, passed 100 tests.
  9668. 692.96 s [vector] mut_ifoldrM: OK
  9669. 692.96 s [vector] +++ OK, passed 100 tests.
  9670. 692.96 s [vector] mut_ifoldrM': OK
  9671. 692.96 s [vector] +++ OK, passed 100 tests.
  9672. 692.96 s [vector] compare: OK
  9673. 692.96 s [vector] +++ OK, passed 100 tests.
  9674. 692.96 s [vector] maximum: OK
  9675. 692.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9676. 692.96 s [vector] minimum: OK
  9677. 692.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9678. 692.96 s [vector] minIndex: OK
  9679. 692.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9680. 692.96 s [vector] maxIndex: OK
  9681. 692.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9682. 692.97 s [vector] maximumBy: OK
  9683. 692.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9684. 692.97 s [vector] minimumBy: OK
  9685. 692.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9686. 692.97 s [vector] maximumOn: OK
  9687. 692.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9688. 692.97 s [vector] minimumOn: OK
  9689. 692.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9690. 692.97 s [vector] maxIndexBy: OK
  9691. 692.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9692. 692.97 s [vector] minIndexBy: OK
  9693. 692.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9694. 692.97 s [vector] ListFirstMaxIndexWins: OK
  9695. 692.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9696. 692.97 s [vector] FalseListFirstMaxIndexWins: OK
  9697. 692.97 s [vector] +++ OK, failed as expected. (after 1 test):
  9698. 692.97 s [vector] Exception:
  9699. 692.97 s [vector] Prelude.foldr1: empty list
  9700. 692.97 s [vector] CallStack (from HasCallStack):
  9701. 692.98 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9702. 692.98 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9703. 692.98 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9704. 692.98 s [vector] []
  9705. 692.98 s [vector] mempty: OK
  9706. 692.99 s [vector] +++ OK, passed 100 tests.
  9707. 692.99 s [vector] mappend: OK
  9708. 692.99 s [vector] +++ OK, passed 100 tests.
  9709. 693.00 s [vector] mconcat: OK (0.02s)
  9710. 693.00 s [vector] +++ OK, passed 100 tests.
  9711. 693.00 s [vector] glength: OK
  9712. 693.00 s [vector] +++ OK, passed 100 tests.
  9713. 693.00 s [vector] sum: OK
  9714. 693.00 s [vector] +++ OK, passed 100 tests.
  9715. 693.00 s [vector] product: OK
  9716. 693.00 s [vector] +++ OK, passed 100 tests.
  9717. 693.00 s [vector] enumFromN: OK
  9718. 693.00 s [vector] +++ OK, passed 100 tests.
  9719. 693.00 s [vector] enumFromThenN: OK
  9720. 693.00 s [vector] +++ OK, passed 100 tests.
  9721. 693.00 s [vector] enumFromTo: OK
  9722. 693.00 s [vector] +++ OK, passed 100 tests.
  9723. 693.00 s [vector] enumFromThenTo: OK
  9724. 693.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9725. 693.00 s [vector] Double
  9726. 693.00 s [vector] fromList.toList == id: OK
  9727. 693.00 s [vector] +++ OK, passed 100 tests.
  9728. 693.01 s [vector] toList.fromList == id: OK
  9729. 693.01 s [vector] +++ OK, passed 100 tests.
  9730. 693.01 s [vector] unstream.stream == id: OK
  9731. 693.01 s [vector] +++ OK, passed 100 tests.
  9732. 693.01 s [vector] stream.unstream == id: OK
  9733. 693.01 s [vector] +++ OK, passed 100 tests.
  9734. 693.01 s [vector] eq: OK
  9735. 693.01 s [vector] +++ OK, passed 100 tests.
  9736. 693.01 s [vector] length: OK
  9737. 693.01 s [vector] +++ OK, passed 100 tests.
  9738. 693.01 s [vector] null: OK
  9739. 693.01 s [vector] +++ OK, passed 100 tests.
  9740. 693.01 s [vector] index: OK
  9741. 693.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9742. 693.01 s [vector] safeIndex: OK
  9743. 693.01 s [vector] +++ OK, passed 100 tests.
  9744. 693.01 s [vector] head: OK
  9745. 693.01 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9746. 693.01 s [vector] last: OK
  9747. 693.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9748. 693.02 s [vector] unsafeIndex: OK
  9749. 693.02 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9750. 693.02 s [vector] unsafeHead: OK
  9751. 693.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9752. 693.02 s [vector] unsafeLast: OK
  9753. 693.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9754. 693.02 s [vector] slice: OK
  9755. 693.02 s [vector] +++ OK, passed 100 tests.
  9756. 693.02 s [vector] init: OK
  9757. 693.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9758. 693.02 s [vector] tail: OK
  9759. 693.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9760. 693.03 s [vector] take: OK
  9761. 693.03 s [vector] +++ OK, passed 100 tests.
  9762. 693.03 s [vector] drop: OK
  9763. 693.03 s [vector] +++ OK, passed 100 tests.
  9764. 693.03 s [vector] splitAt: OK
  9765. 693.03 s [vector] +++ OK, passed 100 tests.
  9766. 693.03 s [vector] empty: OK
  9767. 693.03 s [vector] +++ OK, passed 100 tests.
  9768. 693.03 s [vector] singleton: OK
  9769. 693.03 s [vector] +++ OK, passed 100 tests.
  9770. 693.03 s [vector] replicate: OK
  9771. 693.03 s [vector] +++ OK, passed 100 tests.
  9772. 693.03 s [vector] generate: OK
  9773. 693.05 s [vector] +++ OK, passed 100 tests.
  9774. 693.05 s [vector] iterateN: OK
  9775. 693.05 s [vector] +++ OK, passed 100 tests.
  9776. 693.05 s [vector] iterateNM: OK (0.02s)
  9777. 693.06 s [vector] +++ OK, passed 100 tests.
  9778. 693.09 s [vector] generateM: OK (0.02s)
  9779. 693.09 s [vector] +++ OK, passed 100 tests.
  9780. 693.09 s [vector] replicateM: OK
  9781. 693.09 s [vector] +++ OK, passed 100 tests.
  9782. 693.10 s [vector] create: OK
  9783. 693.10 s [vector] +++ OK, passed 100 tests.
  9784. 693.10 s [vector] createT: OK
  9785. 693.10 s [vector] +++ OK, passed 100 tests.
  9786. 693.10 s [vector] unfoldr: OK
  9787. 693.10 s [vector] +++ OK, passed 100 tests.
  9788. 693.10 s [vector] unfoldrN: OK
  9789. 693.10 s [vector] +++ OK, passed 100 tests.
  9790. 693.10 s [vector] unfoldrExactN: OK
  9791. 693.10 s [vector] +++ OK, passed 100 tests.
  9792. 693.10 s [vector] unfoldrM: OK
  9793. 693.10 s [vector] +++ OK, passed 100 tests.
  9794. 693.11 s [vector] unfoldrNM: OK
  9795. 693.11 s [vector] +++ OK, passed 100 tests.
  9796. 693.15 s [vector] unfoldrExactNM: OK (0.03s)
  9797. 693.15 s [vector] +++ OK, passed 100 tests.
  9798. 693.15 s [vector] constructN: OK (0.01s)
  9799. 693.15 s [vector] +++ OK, passed 100 tests.
  9800. 693.16 s [vector] constructrN: OK (0.01s)
  9801. 693.16 s [vector] +++ OK, passed 100 tests.
  9802. 693.16 s [vector] cons: OK
  9803. 693.16 s [vector] +++ OK, passed 100 tests.
  9804. 693.16 s [vector] snoc: OK
  9805. 693.16 s [vector] +++ OK, passed 100 tests.
  9806. 693.17 s [vector] append: OK
  9807. 693.17 s [vector] +++ OK, passed 100 tests.
  9808. 693.19 s [vector] concat: OK (0.02s)
  9809. 693.19 s [vector] +++ OK, passed 100 tests.
  9810. 693.20 s [vector] force: OK
  9811. 693.20 s [vector] +++ OK, passed 100 tests.
  9812. 693.21 s [vector] upd: OK
  9813. 693.21 s [vector] +++ OK, passed 100 tests.
  9814. 693.22 s [vector] accum: OK (0.01s)
  9815. 693.22 s [vector] +++ OK, passed 100 tests.
  9816. 693.23 s [vector] reverse: OK
  9817. 693.23 s [vector] +++ OK, passed 100 tests.
  9818. 693.23 s [vector] backpermute: OK
  9819. 693.23 s [vector] +++ OK, passed 100 tests.
  9820. 693.23 s [vector] map: OK
  9821. 693.23 s [vector] +++ OK, passed 100 tests.
  9822. 693.23 s [vector] imap: OK
  9823. 693.23 s [vector] +++ OK, passed 100 tests.
  9824. 693.23 s [vector] concatMap: OK
  9825. 693.23 s [vector] +++ OK, passed 100 tests.
  9826. 693.23 s [vector] mapM: OK
  9827. 693.23 s [vector] +++ OK, passed 100 tests.
  9828. 693.27 s [vector] mapM_: OK (0.03s)
  9829. 693.27 s [vector] +++ OK, passed 100 tests.
  9830. 693.29 s [vector] forM: OK
  9831. 693.29 s [vector] +++ OK, passed 100 tests.
  9832. 693.32 s [vector] forM_: OK (0.04s)
  9833. 693.33 s [vector] +++ OK, passed 100 tests.
  9834. 693.33 s [vector] imapM: OK
  9835. 693.33 s [vector] +++ OK, passed 100 tests.
  9836. 693.36 s [vector] imapM_: OK (0.03s)
  9837. 693.36 s [vector] +++ OK, passed 100 tests.
  9838. 693.37 s [vector] zipWith: OK
  9839. 693.37 s [vector] +++ OK, passed 100 tests.
  9840. 693.69 s [vector] zipWith3: OK
  9841. 693.69 s [vector] +++ OK, passed 100 tests.
  9842. 693.69 s [vector] izipWith: OK
  9843. 693.69 s [vector] +++ OK, passed 100 tests.
  9844. 693.69 s [vector] izipWith3: OK (0.01s)
  9845. 693.69 s [vector] +++ OK, passed 100 tests.
  9846. 693.69 s [vector] izipWithM: OK
  9847. 693.69 s [vector] +++ OK, passed 100 tests.
  9848. 693.69 s [vector] izipWithM_: OK (0.02s)
  9849. 693.69 s [vector] +++ OK, passed 100 tests.
  9850. 693.69 s [vector] zipWithM: OK
  9851. 693.69 s [vector] +++ OK, passed 100 tests.
  9852. 693.69 s [vector] zipWithM_: OK (0.03s)
  9853. 693.69 s [vector] +++ OK, passed 100 tests.
  9854. 693.69 s [vector] filter: OK
  9855. 693.69 s [vector] +++ OK, passed 100 tests.
  9856. 693.69 s [vector] ifilter: OK
  9857. 693.69 s [vector] +++ OK, passed 100 tests.
  9858. 693.69 s [vector] filterM: OK (0.04s)
  9859. 693.69 s [vector] +++ OK, passed 100 tests.
  9860. 693.69 s [vector] uniq: OK
  9861. 693.69 s [vector] +++ OK, passed 100 tests.
  9862. 693.69 s [vector] mapMaybe: OK
  9863. 693.69 s [vector] +++ OK, passed 100 tests.
  9864. 693.69 s [vector] imapMaybe: OK
  9865. 693.69 s [vector] +++ OK, passed 100 tests.
  9866. 693.69 s [vector] takeWhile: OK
  9867. 693.69 s [vector] +++ OK, passed 100 tests.
  9868. 693.69 s [vector] dropWhile: OK
  9869. 693.69 s [vector] +++ OK, passed 100 tests.
  9870. 693.69 s [vector] partition: OK
  9871. 693.69 s [vector] +++ OK, passed 100 tests.
  9872. 693.69 s [vector] partitionWith: OK
  9873. 693.69 s [vector] +++ OK, passed 100 tests.
  9874. 693.69 s [vector] span: OK
  9875. 693.69 s [vector] +++ OK, passed 100 tests.
  9876. 693.69 s [vector] break: OK
  9877. 693.69 s [vector] +++ OK, passed 100 tests.
  9878. 693.69 s [vector] spanR: OK
  9879. 693.69 s [vector] +++ OK, passed 100 tests.
  9880. 693.69 s [vector] breakR: OK
  9881. 693.69 s [vector] +++ OK, passed 100 tests.
  9882. 693.69 s [vector] groupBy: OK
  9883. 693.69 s [vector] +++ OK, passed 100 tests.
  9884. 693.69 s [vector] elem: OK
  9885. 693.69 s [vector] +++ OK, passed 100 tests.
  9886. 693.69 s [vector] notElem: OK
  9887. 693.69 s [vector] +++ OK, passed 100 tests.
  9888. 693.69 s [vector] find: OK
  9889. 693.69 s [vector] +++ OK, passed 100 tests.
  9890. 693.69 s [vector] findIndex: OK
  9891. 693.69 s [vector] +++ OK, passed 100 tests.
  9892. 693.69 s [vector] findIndexR: OK
  9893. 693.69 s [vector] +++ OK, passed 100 tests.
  9894. 693.69 s [vector] findIndices: OK
  9895. 693.69 s [vector] +++ OK, passed 100 tests.
  9896. 693.69 s [vector] elemIndex: OK
  9897. 693.69 s [vector] +++ OK, passed 100 tests.
  9898. 693.69 s [vector] elemIndices: OK
  9899. 693.69 s [vector] +++ OK, passed 100 tests.
  9900. 693.69 s [vector] foldl: OK (0.01s)
  9901. 693.69 s [vector] +++ OK, passed 100 tests.
  9902. 693.69 s [vector] foldl1: OK (0.01s)
  9903. 693.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9904. 693.69 s [vector] foldl': OK (0.01s)
  9905. 693.69 s [vector] +++ OK, passed 100 tests.
  9906. 693.69 s [vector] foldl1': OK
  9907. 693.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9908. 693.69 s [vector] foldr: OK (0.02s)
  9909. 693.69 s [vector] +++ OK, passed 100 tests.
  9910. 693.69 s [vector] foldr1: OK (0.02s)
  9911. 693.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9912. 693.69 s [vector] foldr': OK (0.02s)
  9913. 693.70 s [vector] +++ OK, passed 100 tests.
  9914. 693.71 s [vector] foldr1': OK (0.01s)
  9915. 693.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9916. 693.71 s [vector] ifoldl: OK (0.01s)
  9917. 693.71 s [vector] +++ OK, passed 100 tests.
  9918. 693.72 s [vector] ifoldl': OK (0.01s)
  9919. 693.72 s [vector] +++ OK, passed 100 tests.
  9920. 693.72 s [vector] ifoldr: OK (0.01s)
  9921. 693.72 s [vector] +++ OK, passed 100 tests.
  9922. 693.73 s [vector] ifoldr': OK
  9923. 693.73 s [vector] +++ OK, passed 100 tests.
  9924. 693.75 s [vector] ifoldM: OK (0.01s)
  9925. 693.75 s [vector] +++ OK, passed 100 tests.
  9926. 693.77 s [vector] ifoldM': OK (0.01s)
  9927. 693.77 s [vector] +++ OK, passed 100 tests.
  9928. 693.79 s [vector] ifoldM_: OK (0.03s)
  9929. 693.79 s [vector] +++ OK, passed 100 tests.
  9930. 693.82 s [vector] ifoldM'_: OK (0.03s)
  9931. 693.82 s [vector] +++ OK, passed 100 tests.
  9932. 693.82 s [vector] all: OK
  9933. 693.82 s [vector] +++ OK, passed 100 tests.
  9934. 693.83 s [vector] any: OK
  9935. 693.83 s [vector] +++ OK, passed 100 tests.
  9936. 693.84 s [vector] prescanl: OK (0.01s)
  9937. 693.84 s [vector] +++ OK, passed 100 tests.
  9938. 693.85 s [vector] prescanl': OK (0.01s)
  9939. 693.85 s [vector] +++ OK, passed 100 tests.
  9940. 693.87 s [vector] postscanl: OK (0.01s)
  9941. 693.87 s [vector] +++ OK, passed 100 tests.
  9942. 693.87 s [vector] postscanl': OK (0.01s)
  9943. 693.87 s [vector] +++ OK, passed 100 tests.
  9944. 693.89 s [vector] scanl: OK (0.01s)
  9945. 693.89 s [vector] +++ OK, passed 100 tests.
  9946. 693.90 s [vector] scanl': OK (0.01s)
  9947. 693.91 s [vector] +++ OK, passed 100 tests.
  9948. 693.91 s [vector] scanl1: OK (0.01s)
  9949. 693.91 s [vector] +++ OK, passed 100 tests.
  9950. 693.93 s [vector] scanl1': OK (0.01s)
  9951. 693.93 s [vector] +++ OK, passed 100 tests.
  9952. 693.93 s [vector] iscanl: OK (0.01s)
  9953. 693.94 s [vector] +++ OK, passed 100 tests.
  9954. 693.95 s [vector] iscanl': OK (0.01s)
  9955. 693.95 s [vector] +++ OK, passed 100 tests.
  9956. 693.95 s [vector] prescanr: OK
  9957. 693.95 s [vector] +++ OK, passed 100 tests.
  9958. 693.97 s [vector] prescanr': OK (0.01s)
  9959. 693.97 s [vector] +++ OK, passed 100 tests.
  9960. 693.98 s [vector] postscanr: OK (0.01s)
  9961. 693.99 s [vector] +++ OK, passed 100 tests.
  9962. 693.99 s [vector] postscanr': OK (0.01s)
  9963. 693.99 s [vector] +++ OK, passed 100 tests.
  9964. 694.01 s [vector] scanr: OK (0.02s)
  9965. 694.01 s [vector] +++ OK, passed 100 tests.
  9966. 694.02 s [vector] scanr': OK (0.02s)
  9967. 694.02 s [vector] +++ OK, passed 100 tests.
  9968. 694.03 s [vector] scanr1: OK
  9969. 694.03 s [vector] +++ OK, passed 100 tests.
  9970. 694.05 s [vector] scanr1': OK (0.02s)
  9971. 694.05 s [vector] +++ OK, passed 100 tests.
  9972. 694.07 s [vector] iscanr: OK (0.01s)
  9973. 694.07 s [vector] +++ OK, passed 100 tests.
  9974. 694.07 s [vector] iscanr': OK (0.01s)
  9975. 694.07 s [vector] +++ OK, passed 100 tests.
  9976. 694.07 s [vector] mut_read: OK
  9977. 694.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9978. 694.08 s [vector] mut_write: OK
  9979. 694.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9980. 694.09 s [vector] mut_modify: OK
  9981. 694.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9982. 694.09 s [vector] mut_generate: OK
  9983. 694.09 s [vector] +++ OK, passed 100 tests.
  9984. 694.11 s [vector] mut_generateM: OK (0.02s)
  9985. 694.11 s [vector] +++ OK, passed 100 tests.
  9986. 694.13 s [vector] mut_mapM_: OK (0.03s)
  9987. 694.13 s [vector] +++ OK, passed 100 tests.
  9988. 694.16 s [vector] mut_imapM_: OK (0.03s)
  9989. 694.16 s [vector] +++ OK, passed 100 tests.
  9990. 694.21 s [vector] mut_forM_: OK (0.03s)
  9991. 694.21 s [vector] +++ OK, passed 100 tests.
  9992. 694.24 s [vector] mut_iforM_: OK (0.03s)
  9993. 694.25 s [vector] +++ OK, passed 100 tests.
  9994. 694.25 s [vector] mut_foldr: OK (0.01s)
  9995. 694.25 s [vector] +++ OK, passed 100 tests.
  9996. 694.28 s [vector] mut_foldr': OK (0.01s)
  9997. 694.29 s [vector] +++ OK, passed 100 tests.
  9998. 694.29 s [vector] mut_foldl: OK (0.01s)
  9999. 694.29 s [vector] +++ OK, passed 100 tests.
  10000. 694.29 s [vector] mut_foldl': OK (0.01s)
  10001. 694.29 s [vector] +++ OK, passed 100 tests.
  10002. 694.31 s [vector] mut_ifoldr: OK (0.01s)
  10003. 694.31 s [vector] +++ OK, passed 100 tests.
  10004. 694.31 s [vector] mut_ifoldr': OK (0.01s)
  10005. 694.31 s [vector] +++ OK, passed 100 tests.
  10006. 694.33 s [vector] mut_ifoldl: OK (0.01s)
  10007. 694.33 s [vector] +++ OK, passed 100 tests.
  10008. 694.34 s [vector] mut_ifoldl': OK (0.01s)
  10009. 694.35 s [vector] +++ OK, passed 100 tests.
  10010. 694.35 s [vector] mut_foldM: OK (0.01s)
  10011. 694.35 s [vector] +++ OK, passed 100 tests.
  10012. 694.37 s [vector] mut_foldM': OK (0.01s)
  10013. 694.37 s [vector] +++ OK, passed 100 tests.
  10014. 694.37 s [vector] mut_foldrM: OK (0.01s)
  10015. 694.37 s [vector] +++ OK, passed 100 tests.
  10016. 694.39 s [vector] mut_foldrM': OK (0.02s)
  10017. 694.39 s [vector] +++ OK, passed 100 tests.
  10018. 694.41 s [vector] mut_ifoldM: OK (0.02s)
  10019. 694.41 s [vector] +++ OK, passed 100 tests.
  10020. 694.43 s [vector] mut_ifoldM': OK (0.01s)
  10021. 694.43 s [vector] +++ OK, passed 100 tests.
  10022. 694.43 s [vector] mut_ifoldrM: OK (0.01s)
  10023. 694.43 s [vector] +++ OK, passed 100 tests.
  10024. 694.44 s [vector] mut_ifoldrM': OK (0.01s)
  10025. 694.44 s [vector] +++ OK, passed 100 tests.
  10026. 694.44 s [vector] compare: OK
  10027. 694.44 s [vector] +++ OK, passed 100 tests.
  10028. 694.44 s [vector] maximum: OK
  10029. 694.44 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10030. 694.44 s [vector] minimum: OK
  10031. 694.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10032. 694.44 s [vector] minIndex: OK
  10033. 694.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10034. 694.44 s [vector] maxIndex: OK
  10035. 694.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10036. 694.44 s [vector] maximumBy: OK
  10037. 694.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10038. 694.45 s [vector] minimumBy: OK
  10039. 694.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10040. 694.45 s [vector] maximumOn: OK
  10041. 694.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10042. 694.45 s [vector] minimumOn: OK
  10043. 694.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10044. 694.45 s [vector] maxIndexBy: OK
  10045. 694.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10046. 694.45 s [vector] minIndexBy: OK
  10047. 694.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10048. 694.45 s [vector] ListFirstMaxIndexWins: OK
  10049. 694.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10050. 694.45 s [vector] FalseListFirstMaxIndexWins: OK
  10051. 694.45 s [vector] +++ OK, failed as expected. (after 1 test):
  10052. 694.45 s [vector] Exception:
  10053. 694.45 s [vector] Prelude.foldr1: empty list
  10054. 694.45 s [vector] CallStack (from HasCallStack):
  10055. 694.45 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10056. 694.45 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10057. 694.45 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10058. 694.45 s [vector] []
  10059. 694.45 s [vector] mempty: OK
  10060. 694.45 s [vector] +++ OK, passed 100 tests.
  10061. 694.45 s [vector] mappend: OK
  10062. 694.45 s [vector] +++ OK, passed 100 tests.
  10063. 694.48 s [vector] mconcat: OK
  10064. 694.48 s [vector] +++ OK, passed 100 tests.
  10065. 694.48 s [vector] glength: OK
  10066. 694.48 s [vector] +++ OK, passed 100 tests.
  10067. 694.48 s [vector] sum: OK
  10068. 694.48 s [vector] +++ OK, passed 100 tests.
  10069. 694.48 s [vector] product: OK
  10070. 694.48 s [vector] +++ OK, passed 100 tests.
  10071. 694.48 s [vector] enumFromN: OK
  10072. 694.48 s [vector] +++ OK, passed 100 tests.
  10073. 694.48 s [vector] enumFromThenN: OK
  10074. 694.48 s [vector] +++ OK, passed 100 tests.
  10075. 694.48 s [vector] enumFromTo: OK
  10076. 694.48 s [vector] +++ OK, passed 100 tests.
  10077. 694.48 s [vector] enumFromThenTo: OK
  10078. 694.48 s [vector] +++ OK, passed 100 tests.
  10079. 694.48 s [vector] unstream
  10080. 694.48 s [vector] unstream == vunstream (exact): OK
  10081. 694.48 s [vector] +++ OK, passed 100 tests.
  10082. 694.48 s [vector] unstream == vunstream (unknown): OK
  10083. 694.48 s [vector] +++ OK, passed 100 tests.
  10084. 694.48 s [vector] unstreamR ~= vunstream (exact): OK
  10085. 694.48 s [vector] +++ OK, passed 100 tests.
  10086. 694.48 s [vector] unstreamR ~= vunstream (unknown): OK
  10087. 694.48 s [vector] +++ OK, passed 100 tests.
  10088. 694.48 s [vector] Tests.Vector.Storable
  10089. 694.48 s [vector] Data.Vector.Storable.Vector (Int)
  10090. 694.48 s [vector] fromList.toList == id: OK
  10091. 694.48 s [vector] +++ OK, passed 100 tests.
  10092. 694.48 s [vector] toList.fromList == id: OK
  10093. 694.48 s [vector] +++ OK, passed 100 tests.
  10094. 694.48 s [vector] unstream.stream == id: OK
  10095. 694.48 s [vector] +++ OK, passed 100 tests.
  10096. 694.48 s [vector] stream.unstream == id: OK
  10097. 694.48 s [vector] +++ OK, passed 100 tests.
  10098. 694.48 s [vector] eq: OK
  10099. 694.48 s [vector] +++ OK, passed 100 tests.
  10100. 694.48 s [vector] length: OK
  10101. 694.48 s [vector] +++ OK, passed 100 tests.
  10102. 694.48 s [vector] null: OK
  10103. 694.48 s [vector] +++ OK, passed 100 tests.
  10104. 694.48 s [vector] index: OK
  10105. 694.48 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10106. 694.48 s [vector] safeIndex: OK
  10107. 694.48 s [vector] +++ OK, passed 100 tests.
  10108. 694.49 s [vector] head: OK
  10109. 694.49 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10110. 694.49 s [vector] last: OK
  10111. 694.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10112. 694.49 s [vector] unsafeIndex: OK
  10113. 694.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10114. 694.49 s [vector] unsafeHead: OK
  10115. 694.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10116. 694.49 s [vector] unsafeLast: OK
  10117. 694.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10118. 694.49 s [vector] slice: OK
  10119. 694.49 s [vector] +++ OK, passed 100 tests.
  10120. 694.49 s [vector] init: OK
  10121. 694.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10122. 694.49 s [vector] tail: OK
  10123. 694.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10124. 694.49 s [vector] take: OK
  10125. 694.49 s [vector] +++ OK, passed 100 tests.
  10126. 694.49 s [vector] drop: OK
  10127. 694.49 s [vector] +++ OK, passed 100 tests.
  10128. 694.49 s [vector] splitAt: OK
  10129. 694.49 s [vector] +++ OK, passed 100 tests.
  10130. 694.49 s [vector] empty: OK
  10131. 694.49 s [vector] +++ OK, passed 100 tests.
  10132. 694.49 s [vector] singleton: OK
  10133. 694.49 s [vector] +++ OK, passed 100 tests.
  10134. 694.49 s [vector] replicate: OK
  10135. 694.49 s [vector] +++ OK, passed 100 tests.
  10136. 694.49 s [vector] generate: OK
  10137. 694.49 s [vector] +++ OK, passed 100 tests.
  10138. 694.49 s [vector] iterateN: OK
  10139. 694.49 s [vector] +++ OK, passed 100 tests.
  10140. 694.53 s [vector] iterateNM: OK (0.03s)
  10141. 694.53 s [vector] +++ OK, passed 100 tests.
  10142. 694.55 s [vector] generateM: OK (0.02s)
  10143. 694.55 s [vector] +++ OK, passed 100 tests.
  10144. 694.55 s [vector] replicateM: OK
  10145. 694.55 s [vector] +++ OK, passed 100 tests.
  10146. 694.55 s [vector] create: OK
  10147. 694.55 s [vector] +++ OK, passed 100 tests.
  10148. 694.55 s [vector] createT: OK
  10149. 694.55 s [vector] +++ OK, passed 100 tests.
  10150. 694.55 s [vector] unfoldr: OK
  10151. 694.55 s [vector] +++ OK, passed 100 tests.
  10152. 694.55 s [vector] unfoldrN: OK
  10153. 694.55 s [vector] +++ OK, passed 100 tests.
  10154. 694.56 s [vector] unfoldrExactN: OK
  10155. 694.56 s [vector] +++ OK, passed 100 tests.
  10156. 694.57 s [vector] unfoldrM: OK
  10157. 694.58 s [vector] +++ OK, passed 100 tests.
  10158. 694.58 s [vector] unfoldrNM: OK
  10159. 694.58 s [vector] +++ OK, passed 100 tests.
  10160. 694.59 s [vector] unfoldrExactNM: OK (0.03s)
  10161. 694.59 s [vector] +++ OK, passed 100 tests.
  10162. 694.59 s [vector] constructN: OK
  10163. 694.59 s [vector] +++ OK, passed 100 tests.
  10164. 694.60 s [vector] constructrN: OK
  10165. 694.60 s [vector] +++ OK, passed 100 tests.
  10166. 694.61 s [vector] cons: OK
  10167. 694.61 s [vector] +++ OK, passed 100 tests.
  10168. 694.61 s [vector] snoc: OK
  10169. 694.61 s [vector] +++ OK, passed 100 tests.
  10170. 694.61 s [vector] append: OK
  10171. 694.61 s [vector] +++ OK, passed 100 tests.
  10172. 694.62 s [vector] concat: OK (0.02s)
  10173. 694.62 s [vector] +++ OK, passed 100 tests.
  10174. 694.63 s [vector] force: OK
  10175. 694.63 s [vector] +++ OK, passed 100 tests.
  10176. 694.63 s [vector] upd: OK
  10177. 694.63 s [vector] +++ OK, passed 100 tests.
  10178. 694.63 s [vector] accum: OK
  10179. 694.63 s [vector] +++ OK, passed 100 tests.
  10180. 694.63 s [vector] reverse: OK
  10181. 694.63 s [vector] +++ OK, passed 100 tests.
  10182. 694.63 s [vector] backpermute: OK
  10183. 694.63 s [vector] +++ OK, passed 100 tests.
  10184. 694.64 s [vector] map: OK
  10185. 694.64 s [vector] +++ OK, passed 100 tests.
  10186. 694.64 s [vector] imap: OK
  10187. 694.64 s [vector] +++ OK, passed 100 tests.
  10188. 694.64 s [vector] concatMap: OK
  10189. 694.65 s [vector] +++ OK, passed 100 tests.
  10190. 694.65 s [vector] mapM: OK
  10191. 694.65 s [vector] +++ OK, passed 100 tests.
  10192. 694.66 s [vector] mapM_: OK (0.02s)
  10193. 694.66 s [vector] +++ OK, passed 100 tests.
  10194. 694.66 s [vector] forM: OK
  10195. 694.67 s [vector] +++ OK, passed 100 tests.
  10196. 694.68 s [vector] forM_: OK (0.02s)
  10197. 694.68 s [vector] +++ OK, passed 100 tests.
  10198. 694.68 s [vector] imapM: OK
  10199. 694.68 s [vector] +++ OK, passed 100 tests.
  10200. 694.71 s [vector] imapM_: OK (0.02s)
  10201. 694.71 s [vector] +++ OK, passed 100 tests.
  10202. 694.71 s [vector] zipWith: OK
  10203. 694.71 s [vector] +++ OK, passed 100 tests.
  10204. 694.71 s [vector] zipWith3: OK
  10205. 694.71 s [vector] +++ OK, passed 100 tests.
  10206. 694.72 s [vector] izipWith: OK
  10207. 694.73 s [vector] +++ OK, passed 100 tests.
  10208. 694.73 s [vector] izipWith3: OK
  10209. 694.73 s [vector] +++ OK, passed 100 tests.
  10210. 694.73 s [vector] izipWithM: OK
  10211. 694.73 s [vector] +++ OK, passed 100 tests.
  10212. 694.73 s [vector] izipWithM_: OK (0.02s)
  10213. 694.73 s [vector] +++ OK, passed 100 tests.
  10214. 694.73 s [vector] zipWithM: OK
  10215. 694.74 s [vector] +++ OK, passed 100 tests.
  10216. 694.75 s [vector] zipWithM_: OK (0.01s)
  10217. 694.75 s [vector] +++ OK, passed 100 tests.
  10218. 694.77 s [vector] filter: OK
  10219. 694.77 s [vector] +++ OK, passed 100 tests.
  10220. 694.77 s [vector] ifilter: OK
  10221. 694.77 s [vector] +++ OK, passed 100 tests.
  10222. 694.79 s [vector] filterM: OK (0.04s)
  10223. 694.79 s [vector] +++ OK, passed 100 tests.
  10224. 694.79 s [vector] uniq: OK
  10225. 694.79 s [vector] +++ OK, passed 100 tests.
  10226. 694.79 s [vector] mapMaybe: OK
  10227. 694.79 s [vector] +++ OK, passed 100 tests.
  10228. 694.79 s [vector] imapMaybe: OK
  10229. 694.79 s [vector] +++ OK, passed 100 tests.
  10230. 694.79 s [vector] takeWhile: OK
  10231. 694.79 s [vector] +++ OK, passed 100 tests.
  10232. 694.79 s [vector] dropWhile: OK
  10233. 694.79 s [vector] +++ OK, passed 100 tests.
  10234. 694.79 s [vector] partition: OK
  10235. 694.79 s [vector] +++ OK, passed 100 tests.
  10236. 694.80 s [vector] partitionWith: OK
  10237. 694.80 s [vector] +++ OK, passed 100 tests.
  10238. 694.80 s [vector] span: OK
  10239. 694.80 s [vector] +++ OK, passed 100 tests.
  10240. 694.80 s [vector] break: OK
  10241. 694.80 s [vector] +++ OK, passed 100 tests.
  10242. 694.80 s [vector] spanR: OK
  10243. 694.80 s [vector] +++ OK, passed 100 tests.
  10244. 694.80 s [vector] breakR: OK
  10245. 694.80 s [vector] +++ OK, passed 100 tests.
  10246. 694.80 s [vector] groupBy: OK
  10247. 694.80 s [vector] +++ OK, passed 100 tests.
  10248. 694.80 s [vector] elem: OK
  10249. 694.80 s [vector] +++ OK, passed 100 tests.
  10250. 694.81 s [vector] notElem: OK
  10251. 694.81 s [vector] +++ OK, passed 100 tests.
  10252. 694.81 s [vector] find: OK
  10253. 694.81 s [vector] +++ OK, passed 100 tests.
  10254. 694.81 s [vector] findIndex: OK
  10255. 694.81 s [vector] +++ OK, passed 100 tests.
  10256. 694.81 s [vector] findIndexR: OK
  10257. 694.82 s [vector] +++ OK, passed 100 tests.
  10258. 694.82 s [vector] findIndices: OK
  10259. 694.82 s [vector] +++ OK, passed 100 tests.
  10260. 694.83 s [vector] elemIndex: OK
  10261. 694.83 s [vector] +++ OK, passed 100 tests.
  10262. 694.83 s [vector] elemIndices: OK
  10263. 694.83 s [vector] +++ OK, passed 100 tests.
  10264. 694.83 s [vector] foldl: OK
  10265. 694.83 s [vector] +++ OK, passed 100 tests.
  10266. 694.83 s [vector] foldl1: OK
  10267. 694.83 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10268. 694.83 s [vector] foldl': OK
  10269. 694.83 s [vector] +++ OK, passed 100 tests.
  10270. 694.83 s [vector] foldl1': OK
  10271. 694.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10272. 694.83 s [vector] foldr: OK
  10273. 694.83 s [vector] +++ OK, passed 100 tests.
  10274. 694.83 s [vector] foldr1: OK
  10275. 694.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10276. 694.83 s [vector] foldr': OK
  10277. 694.83 s [vector] +++ OK, passed 100 tests.
  10278. 694.84 s [vector] foldr1': OK
  10279. 694.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10280. 694.84 s [vector] ifoldl: OK
  10281. 694.84 s [vector] +++ OK, passed 100 tests.
  10282. 694.84 s [vector] ifoldl': OK
  10283. 694.84 s [vector] +++ OK, passed 100 tests.
  10284. 694.84 s [vector] ifoldr: OK
  10285. 694.84 s [vector] +++ OK, passed 100 tests.
  10286. 694.85 s [vector] ifoldr': OK
  10287. 694.85 s [vector] +++ OK, passed 100 tests.
  10288. 694.85 s [vector] ifoldM: OK
  10289. 694.85 s [vector] +++ OK, passed 100 tests.
  10290. 694.85 s [vector] ifoldM': OK
  10291. 694.85 s [vector] +++ OK, passed 100 tests.
  10292. 694.87 s [vector] ifoldM_: OK (0.02s)
  10293. 694.87 s [vector] +++ OK, passed 100 tests.
  10294. 694.88 s [vector] ifoldM'_: OK (0.02s)
  10295. 694.88 s [vector] +++ OK, passed 100 tests.
  10296. 694.88 s [vector] all: OK
  10297. 694.88 s [vector] +++ OK, passed 100 tests.
  10298. 694.88 s [vector] any: OK
  10299. 694.88 s [vector] +++ OK, passed 100 tests.
  10300. 694.89 s [vector] prescanl: OK
  10301. 694.89 s [vector] +++ OK, passed 100 tests.
  10302. 694.89 s [vector] prescanl': OK
  10303. 694.89 s [vector] +++ OK, passed 100 tests.
  10304. 694.90 s [vector] postscanl: OK
  10305. 694.90 s [vector] +++ OK, passed 100 tests.
  10306. 694.90 s [vector] postscanl': OK
  10307. 694.90 s [vector] +++ OK, passed 100 tests.
  10308. 694.90 s [vector] scanl: OK
  10309. 694.90 s [vector] +++ OK, passed 100 tests.
  10310. 694.90 s [vector] scanl': OK
  10311. 694.90 s [vector] +++ OK, passed 100 tests.
  10312. 694.90 s [vector] scanl1: OK
  10313. 694.90 s [vector] +++ OK, passed 100 tests.
  10314. 694.90 s [vector] scanl1': OK
  10315. 694.90 s [vector] +++ OK, passed 100 tests.
  10316. 694.91 s [vector] iscanl: OK
  10317. 694.91 s [vector] +++ OK, passed 100 tests.
  10318. 694.91 s [vector] iscanl': OK
  10319. 694.91 s [vector] +++ OK, passed 100 tests.
  10320. 694.91 s [vector] prescanr: OK
  10321. 694.91 s [vector] +++ OK, passed 100 tests.
  10322. 694.91 s [vector] prescanr': OK
  10323. 694.91 s [vector] +++ OK, passed 100 tests.
  10324. 694.91 s [vector] postscanr: OK
  10325. 694.91 s [vector] +++ OK, passed 100 tests.
  10326. 694.92 s [vector] postscanr': OK
  10327. 694.92 s [vector] +++ OK, passed 100 tests.
  10328. 694.92 s [vector] scanr: OK
  10329. 694.92 s [vector] +++ OK, passed 100 tests.
  10330. 694.92 s [vector] scanr': OK
  10331. 694.92 s [vector] +++ OK, passed 100 tests.
  10332. 694.93 s [vector] scanr1: OK
  10333. 694.93 s [vector] +++ OK, passed 100 tests.
  10334. 694.93 s [vector] scanr1': OK
  10335. 694.93 s [vector] +++ OK, passed 100 tests.
  10336. 694.93 s [vector] iscanr: OK
  10337. 694.94 s [vector] +++ OK, passed 100 tests.
  10338. 694.95 s [vector] iscanr': OK
  10339. 694.95 s [vector] +++ OK, passed 100 tests.
  10340. 694.95 s [vector] mut_read: OK
  10341. 694.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10342. 694.95 s [vector] mut_write: OK
  10343. 694.95 s [vector] +++ OK, passed 100 tests; 29 discarded.
  10344. 694.95 s [vector] mut_modify: OK
  10345. 694.95 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10346. 694.95 s [vector] mut_generate: OK
  10347. 694.95 s [vector] +++ OK, passed 100 tests.
  10348. 694.95 s [vector] mut_generateM: OK (0.01s)
  10349. 694.95 s [vector] +++ OK, passed 100 tests.
  10350. 694.97 s [vector] mut_mapM_: OK (0.02s)
  10351. 694.97 s [vector] +++ OK, passed 100 tests.
  10352. 694.99 s [vector] mut_imapM_: OK (0.02s)
  10353. 694.99 s [vector] +++ OK, passed 100 tests.
  10354. 695.01 s [vector] mut_forM_: OK (0.02s)
  10355. 695.01 s [vector] +++ OK, passed 100 tests.
  10356. 695.02 s [vector] mut_iforM_: OK (0.02s)
  10357. 695.02 s [vector] +++ OK, passed 100 tests.
  10358. 695.02 s [vector] mut_foldr: OK
  10359. 695.02 s [vector] +++ OK, passed 100 tests.
  10360. 695.02 s [vector] mut_foldr': OK
  10361. 695.02 s [vector] +++ OK, passed 100 tests.
  10362. 695.03 s [vector] mut_foldl: OK
  10363. 695.03 s [vector] +++ OK, passed 100 tests.
  10364. 695.03 s [vector] mut_foldl': OK
  10365. 695.04 s [vector] +++ OK, passed 100 tests.
  10366. 695.04 s [vector] mut_ifoldr: OK
  10367. 695.04 s [vector] +++ OK, passed 100 tests.
  10368. 695.04 s [vector] mut_ifoldr': OK
  10369. 695.04 s [vector] +++ OK, passed 100 tests.
  10370. 695.04 s [vector] mut_ifoldl: OK
  10371. 695.04 s [vector] +++ OK, passed 100 tests.
  10372. 695.04 s [vector] mut_ifoldl': OK
  10373. 695.04 s [vector] +++ OK, passed 100 tests.
  10374. 695.04 s [vector] mut_foldM: OK
  10375. 695.04 s [vector] +++ OK, passed 100 tests.
  10376. 695.04 s [vector] mut_foldM': OK
  10377. 695.04 s [vector] +++ OK, passed 100 tests.
  10378. 695.05 s [vector] mut_foldrM: OK
  10379. 695.05 s [vector] +++ OK, passed 100 tests.
  10380. 695.05 s [vector] mut_foldrM': OK
  10381. 695.05 s [vector] +++ OK, passed 100 tests.
  10382. 695.05 s [vector] mut_ifoldM: OK
  10383. 695.05 s [vector] +++ OK, passed 100 tests.
  10384. 695.05 s [vector] mut_ifoldM': OK
  10385. 695.05 s [vector] +++ OK, passed 100 tests.
  10386. 695.06 s [vector] mut_ifoldrM: OK
  10387. 695.06 s [vector] +++ OK, passed 100 tests.
  10388. 695.06 s [vector] mut_ifoldrM': OK
  10389. 695.06 s [vector] +++ OK, passed 100 tests.
  10390. 695.06 s [vector] compare: OK
  10391. 695.06 s [vector] +++ OK, passed 100 tests.
  10392. 695.06 s [vector] maximum: OK
  10393. 695.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10394. 695.06 s [vector] minimum: OK
  10395. 695.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10396. 695.07 s [vector] minIndex: OK
  10397. 695.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10398. 695.07 s [vector] maxIndex: OK
  10399. 695.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10400. 695.07 s [vector] maximumBy: OK
  10401. 695.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10402. 695.07 s [vector] minimumBy: OK
  10403. 695.07 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10404. 695.07 s [vector] maximumOn: OK
  10405. 695.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10406. 695.07 s [vector] minimumOn: OK
  10407. 695.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10408. 695.07 s [vector] maxIndexBy: OK
  10409. 695.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10410. 695.07 s [vector] minIndexBy: OK
  10411. 695.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10412. 695.07 s [vector] ListFirstMaxIndexWins: OK
  10413. 695.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10414. 695.08 s [vector] FalseListFirstMaxIndexWins: OK
  10415. 695.08 s [vector] +++ OK, failed as expected. (after 1 test):
  10416. 695.08 s [vector] Exception:
  10417. 695.08 s [vector] Prelude.foldr1: empty list
  10418. 695.08 s [vector] CallStack (from HasCallStack):
  10419. 695.08 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10420. 695.08 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10421. 695.08 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10422. 695.08 s [vector] []
  10423. 695.08 s [vector] mempty: OK
  10424. 695.08 s [vector] +++ OK, passed 100 tests.
  10425. 695.08 s [vector] mappend: OK
  10426. 695.08 s [vector] +++ OK, passed 100 tests.
  10427. 695.08 s [vector] mconcat: OK (0.01s)
  10428. 695.09 s [vector] +++ OK, passed 100 tests.
  10429. 695.09 s [vector] glength: OK
  10430. 695.09 s [vector] +++ OK, passed 100 tests.
  10431. 695.09 s [vector] sum: OK
  10432. 695.09 s [vector] +++ OK, passed 100 tests.
  10433. 695.09 s [vector] product: OK
  10434. 695.09 s [vector] +++ OK, passed 100 tests.
  10435. 695.09 s [vector] enumFromN: OK
  10436. 695.09 s [vector] +++ OK, passed 100 tests.
  10437. 695.09 s [vector] enumFromThenN: OK
  10438. 695.09 s [vector] +++ OK, passed 100 tests.
  10439. 695.09 s [vector] enumFromTo: OK
  10440. 695.09 s [vector] +++ OK, passed 100 tests.
  10441. 695.09 s [vector] enumFromThenTo: OK
  10442. 695.09 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10443. 695.09 s [vector] Data.Vector.Storable.Vector (Double)
  10444. 695.09 s [vector] fromList.toList == id: OK
  10445. 695.09 s [vector] +++ OK, passed 100 tests.
  10446. 695.09 s [vector] toList.fromList == id: OK
  10447. 695.09 s [vector] +++ OK, passed 100 tests.
  10448. 695.09 s [vector] unstream.stream == id: OK
  10449. 695.09 s [vector] +++ OK, passed 100 tests.
  10450. 695.09 s [vector] stream.unstream == id: OK
  10451. 695.09 s [vector] +++ OK, passed 100 tests.
  10452. 695.09 s [vector] eq: OK
  10453. 695.09 s [vector] +++ OK, passed 100 tests.
  10454. 695.10 s [vector] length: OK
  10455. 695.10 s [vector] +++ OK, passed 100 tests.
  10456. 695.10 s [vector] null: OK
  10457. 695.10 s [vector] +++ OK, passed 100 tests.
  10458. 695.10 s [vector] index: OK
  10459. 695.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10460. 695.10 s [vector] safeIndex: OK
  10461. 695.10 s [vector] +++ OK, passed 100 tests.
  10462. 695.10 s [vector] head: OK
  10463. 695.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10464. 695.10 s [vector] last: OK
  10465. 695.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10466. 695.10 s [vector] unsafeIndex: OK
  10467. 695.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10468. 695.10 s [vector] unsafeHead: OK
  10469. 695.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10470. 695.10 s [vector] unsafeLast: OK
  10471. 695.10 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10472. 695.10 s [vector] slice: OK
  10473. 695.10 s [vector] +++ OK, passed 100 tests.
  10474. 695.10 s [vector] init: OK
  10475. 695.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10476. 695.10 s [vector] tail: OK
  10477. 695.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10478. 695.10 s [vector] take: OK
  10479. 695.10 s [vector] +++ OK, passed 100 tests.
  10480. 695.10 s [vector] drop: OK
  10481. 695.10 s [vector] +++ OK, passed 100 tests.
  10482. 695.10 s [vector] splitAt: OK
  10483. 695.10 s [vector] +++ OK, passed 100 tests.
  10484. 695.10 s [vector] empty: OK
  10485. 695.10 s [vector] +++ OK, passed 100 tests.
  10486. 695.10 s [vector] singleton: OK
  10487. 695.10 s [vector] +++ OK, passed 100 tests.
  10488. 695.10 s [vector] replicate: OK
  10489. 695.10 s [vector] +++ OK, passed 100 tests.
  10490. 695.11 s [vector] generate: OK
  10491. 695.11 s [vector] +++ OK, passed 100 tests.
  10492. 695.13 s [vector] iterateN: OK
  10493. 695.13 s [vector] +++ OK, passed 100 tests.
  10494. 695.15 s [vector] iterateNM: OK (0.02s)
  10495. 695.15 s [vector] +++ OK, passed 100 tests.
  10496. 695.17 s [vector] generateM: OK (0.03s)
  10497. 695.17 s [vector] +++ OK, passed 100 tests.
  10498. 695.17 s [vector] replicateM: OK (0.01s)
  10499. 695.17 s [vector] +++ OK, passed 100 tests.
  10500. 695.17 s [vector] create: OK
  10501. 695.17 s [vector] +++ OK, passed 100 tests.
  10502. 695.17 s [vector] createT: OK
  10503. 695.17 s [vector] +++ OK, passed 100 tests.
  10504. 695.17 s [vector] unfoldr: OK
  10505. 695.18 s [vector] +++ OK, passed 100 tests.
  10506. 695.18 s [vector] unfoldrN: OK
  10507. 695.18 s [vector] +++ OK, passed 100 tests.
  10508. 695.18 s [vector] unfoldrExactN: OK
  10509. 695.18 s [vector] +++ OK, passed 100 tests.
  10510. 695.18 s [vector] unfoldrM: OK
  10511. 695.18 s [vector] +++ OK, passed 100 tests.
  10512. 695.18 s [vector] unfoldrNM: OK
  10513. 695.18 s [vector] +++ OK, passed 100 tests.
  10514. 695.21 s [vector] unfoldrExactNM: OK (0.02s)
  10515. 695.21 s [vector] +++ OK, passed 100 tests.
  10516. 695.23 s [vector] constructN: OK (0.02s)
  10517. 695.23 s [vector] +++ OK, passed 100 tests.
  10518. 695.25 s [vector] constructrN: OK (0.02s)
  10519. 695.25 s [vector] +++ OK, passed 100 tests.
  10520. 695.25 s [vector] cons: OK
  10521. 695.27 s [vector] +++ OK, passed 100 tests.
  10522. 695.27 s [vector] snoc: OK
  10523. 695.27 s [vector] +++ OK, passed 100 tests.
  10524. 695.27 s [vector] append: OK
  10525. 695.27 s [vector] +++ OK, passed 100 tests.
  10526. 695.28 s [vector] concat: OK (0.02s)
  10527. 695.28 s [vector] +++ OK, passed 100 tests.
  10528. 695.28 s [vector] force: OK
  10529. 695.28 s [vector] +++ OK, passed 100 tests.
  10530. 695.28 s [vector] upd: OK
  10531. 695.29 s [vector] +++ OK, passed 100 tests.
  10532. 695.31 s [vector] accum: OK (0.02s)
  10533. 695.31 s [vector] +++ OK, passed 100 tests.
  10534. 695.31 s [vector] reverse: OK
  10535. 695.31 s [vector] +++ OK, passed 100 tests.
  10536. 695.32 s [vector] backpermute: OK
  10537. 695.32 s [vector] +++ OK, passed 100 tests.
  10538. 695.33 s [vector] map: OK (0.01s)
  10539. 695.33 s [vector] +++ OK, passed 100 tests.
  10540. 695.35 s [vector] imap: OK (0.01s)
  10541. 695.35 s [vector] +++ OK, passed 100 tests.
  10542. 695.37 s [vector] concatMap: OK (0.02s)
  10543. 695.37 s [vector] +++ OK, passed 100 tests.
  10544. 695.37 s [vector] mapM: OK (0.01s)
  10545. 695.37 s [vector] +++ OK, passed 100 tests.
  10546. 695.42 s [vector] mapM_: OK (0.04s)
  10547. 695.43 s [vector] +++ OK, passed 100 tests.
  10548. 695.43 s [vector] forM: OK
  10549. 695.43 s [vector] +++ OK, passed 100 tests.
  10550. 695.47 s [vector] forM_: OK (0.04s)
  10551. 695.47 s [vector] +++ OK, passed 100 tests.
  10552. 695.47 s [vector] imapM: OK
  10553. 695.47 s [vector] +++ OK, passed 100 tests.
  10554. 695.51 s [vector] imapM_: OK (0.04s)
  10555. 695.51 s [vector] +++ OK, passed 100 tests.
  10556. 695.51 s [vector] zipWith: OK
  10557. 695.51 s [vector] +++ OK, passed 100 tests.
  10558. 695.53 s [vector] zipWith3: OK (0.01s)
  10559. 695.53 s [vector] +++ OK, passed 100 tests.
  10560. 695.54 s [vector] izipWith: OK (0.01s)
  10561. 695.55 s [vector] +++ OK, passed 100 tests.
  10562. 695.55 s [vector] izipWith3: OK
  10563. 695.55 s [vector] +++ OK, passed 100 tests.
  10564. 695.57 s [vector] izipWithM: OK (0.01s)
  10565. 695.57 s [vector] +++ OK, passed 100 tests.
  10566. 695.59 s [vector] izipWithM_: OK (0.03s)
  10567. 695.59 s [vector] +++ OK, passed 100 tests.
  10568. 695.61 s [vector] zipWithM: OK (0.01s)
  10569. 695.61 s [vector] +++ OK, passed 100 tests.
  10570. 695.65 s [vector] zipWithM_: OK (0.04s)
  10571. 695.65 s [vector] +++ OK, passed 100 tests.
  10572. 695.65 s [vector] filter: OK (0.01s)
  10573. 695.66 s [vector] +++ OK, passed 100 tests.
  10574. 695.66 s [vector] ifilter: OK
  10575. 695.66 s [vector] +++ OK, passed 100 tests.
  10576. 695.70 s [vector] filterM: OK (0.04s)
  10577. 695.70 s [vector] +++ OK, passed 100 tests.
  10578. 695.71 s [vector] uniq: OK
  10579. 695.71 s [vector] +++ OK, passed 100 tests.
  10580. 695.73 s [vector] mapMaybe: OK (0.02s)
  10581. 695.73 s [vector] +++ OK, passed 100 tests.
  10582. 695.73 s [vector] imapMaybe: OK (0.01s)
  10583. 695.74 s [vector] +++ OK, passed 100 tests.
  10584. 695.75 s [vector] takeWhile: OK
  10585. 695.75 s [vector] +++ OK, passed 100 tests.
  10586. 695.75 s [vector] dropWhile: OK
  10587. 695.75 s [vector] +++ OK, passed 100 tests.
  10588. 695.75 s [vector] partition: OK
  10589. 695.75 s [vector] +++ OK, passed 100 tests.
  10590. 695.75 s [vector] partitionWith: OK
  10591. 695.75 s [vector] +++ OK, passed 100 tests.
  10592. 695.75 s [vector] span: OK
  10593. 695.75 s [vector] +++ OK, passed 100 tests.
  10594. 695.76 s [vector] break: OK
  10595. 695.76 s [vector] +++ OK, passed 100 tests.
  10596. 695.76 s [vector] spanR: OK
  10597. 695.76 s [vector] +++ OK, passed 100 tests.
  10598. 695.76 s [vector] breakR: OK
  10599. 695.76 s [vector] +++ OK, passed 100 tests.
  10600. 695.77 s [vector] groupBy: OK (0.01s)
  10601. 695.77 s [vector] +++ OK, passed 100 tests.
  10602. 695.77 s [vector] elem: OK
  10603. 695.77 s [vector] +++ OK, passed 100 tests.
  10604. 695.77 s [vector] notElem: OK
  10605. 695.77 s [vector] +++ OK, passed 100 tests.
  10606. 695.77 s [vector] find: OK
  10607. 695.77 s [vector] +++ OK, passed 100 tests.
  10608. 695.78 s [vector] findIndex: OK
  10609. 695.78 s [vector] +++ OK, passed 100 tests.
  10610. 695.78 s [vector] findIndexR: OK
  10611. 695.78 s [vector] +++ OK, passed 100 tests.
  10612. 695.78 s [vector] findIndices: OK
  10613. 695.78 s [vector] +++ OK, passed 100 tests.
  10614. 695.78 s [vector] elemIndex: OK
  10615. 695.79 s [vector] +++ OK, passed 100 tests.
  10616. 695.79 s [vector] elemIndices: OK
  10617. 695.79 s [vector] +++ OK, passed 100 tests.
  10618. 695.81 s [vector] foldl: OK (0.01s)
  10619. 695.81 s [vector] +++ OK, passed 100 tests.
  10620. 695.82 s [vector] foldl1: OK (0.01s)
  10621. 695.83 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10622. 695.83 s [vector] foldl': OK (0.01s)
  10623. 695.83 s [vector] +++ OK, passed 100 tests.
  10624. 695.84 s [vector] foldl1': OK (0.01s)
  10625. 695.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10626. 695.85 s [vector] foldr: OK (0.01s)
  10627. 695.85 s [vector] +++ OK, passed 100 tests.
  10628. 695.87 s [vector] foldr1: OK (0.01s)
  10629. 695.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10630. 695.87 s [vector] foldr': OK (0.01s)
  10631. 695.88 s [vector] +++ OK, passed 100 tests.
  10632. 695.89 s [vector] foldr1': OK (0.01s)
  10633. 695.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10634. 695.90 s [vector] ifoldl: OK (0.01s)
  10635. 695.90 s [vector] +++ OK, passed 100 tests.
  10636. 695.92 s [vector] ifoldl': OK
  10637. 695.93 s [vector] +++ OK, passed 100 tests.
  10638. 695.93 s [vector] ifoldr: OK (0.01s)
  10639. 695.94 s [vector] +++ OK, passed 100 tests.
  10640. 695.95 s [vector] ifoldr': OK (0.01s)
  10641. 695.95 s [vector] +++ OK, passed 100 tests.
  10642. 695.96 s [vector] ifoldM: OK (0.01s)
  10643. 695.97 s [vector] +++ OK, passed 100 tests.
  10644. 695.97 s [vector] ifoldM': OK (0.01s)
  10645. 695.97 s [vector] +++ OK, passed 100 tests.
  10646. 696.01 s [vector] ifoldM_: OK (0.03s)
  10647. 696.01 s [vector] +++ OK, passed 100 tests.
  10648. 696.04 s [vector] ifoldM'_: OK (0.04s)
  10649. 696.04 s [vector] +++ OK, passed 100 tests.
  10650. 696.05 s [vector] all: OK
  10651. 696.05 s [vector] +++ OK, passed 100 tests.
  10652. 696.07 s [vector] any: OK
  10653. 696.07 s [vector] +++ OK, passed 100 tests.
  10654. 696.08 s [vector] prescanl: OK (0.01s)
  10655. 696.08 s [vector] +++ OK, passed 100 tests.
  10656. 696.09 s [vector] prescanl': OK (0.01s)
  10657. 696.09 s [vector] +++ OK, passed 100 tests.
  10658. 696.09 s [vector] postscanl: OK (0.02s)
  10659. 696.09 s [vector] +++ OK, passed 100 tests.
  10660. 696.11 s [vector] postscanl': OK (0.02s)
  10661. 696.11 s [vector] +++ OK, passed 100 tests.
  10662. 696.13 s [vector] scanl: OK (0.02s)
  10663. 696.13 s [vector] +++ OK, passed 100 tests.
  10664. 696.13 s [vector] scanl': OK (0.01s)
  10665. 696.13 s [vector] +++ OK, passed 100 tests.
  10666. 696.14 s [vector] scanl1: OK
  10667. 696.14 s [vector] +++ OK, passed 100 tests.
  10668. 696.17 s [vector] scanl1': OK (0.01s)
  10669. 696.17 s [vector] +++ OK, passed 100 tests.
  10670. 696.17 s [vector] iscanl: OK (0.02s)
  10671. 696.17 s [vector] +++ OK, passed 100 tests.
  10672. 696.19 s [vector] iscanl': OK (0.01s)
  10673. 696.19 s [vector] +++ OK, passed 100 tests.
  10674. 696.21 s [vector] prescanr: OK (0.01s)
  10675. 696.21 s [vector] +++ OK, passed 100 tests.
  10676. 696.22 s [vector] prescanr': OK (0.01s)
  10677. 696.22 s [vector] +++ OK, passed 100 tests.
  10678. 696.22 s [vector] postscanr: OK (0.01s)
  10679. 696.22 s [vector] +++ OK, passed 100 tests.
  10680. 696.24 s [vector] postscanr': OK
  10681. 696.25 s [vector] +++ OK, passed 100 tests.
  10682. 696.25 s [vector] scanr: OK (0.01s)
  10683. 696.26 s [vector] +++ OK, passed 100 tests.
  10684. 696.27 s [vector] scanr': OK (0.02s)
  10685. 696.27 s [vector] +++ OK, passed 100 tests.
  10686. 696.28 s [vector] scanr1: OK (0.01s)
  10687. 696.29 s [vector] +++ OK, passed 100 tests.
  10688. 696.29 s [vector] scanr1': OK
  10689. 696.29 s [vector] +++ OK, passed 100 tests.
  10690. 696.29 s [vector] iscanr: OK (0.01s)
  10691. 696.30 s [vector] +++ OK, passed 100 tests.
  10692. 696.31 s [vector] iscanr': OK
  10693. 696.31 s [vector] +++ OK, passed 100 tests.
  10694. 696.31 s [vector] mut_read: OK
  10695. 696.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10696. 696.33 s [vector] mut_write: OK
  10697. 696.33 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10698. 696.33 s [vector] mut_modify: OK
  10699. 696.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10700. 696.33 s [vector] mut_generate: OK
  10701. 696.33 s [vector] +++ OK, passed 100 tests.
  10702. 696.35 s [vector] mut_generateM: OK (0.02s)
  10703. 696.35 s [vector] +++ OK, passed 100 tests.
  10704. 696.37 s [vector] mut_mapM_: OK (0.03s)
  10705. 696.37 s [vector] +++ OK, passed 100 tests.
  10706. 696.39 s [vector] mut_imapM_: OK (0.03s)
  10707. 696.39 s [vector] +++ OK, passed 100 tests.
  10708. 696.43 s [vector] mut_forM_: OK (0.03s)
  10709. 696.43 s [vector] +++ OK, passed 100 tests.
  10710. 696.47 s [vector] mut_iforM_: OK (0.03s)
  10711. 696.47 s [vector] +++ OK, passed 100 tests.
  10712. 696.47 s [vector] mut_foldr: OK (0.01s)
  10713. 696.47 s [vector] +++ OK, passed 100 tests.
  10714. 696.48 s [vector] mut_foldr': OK (0.01s)
  10715. 696.48 s [vector] +++ OK, passed 100 tests.
  10716. 696.50 s [vector] mut_foldl: OK
  10717. 696.51 s [vector] +++ OK, passed 100 tests.
  10718. 696.51 s [vector] mut_foldl': OK (0.01s)
  10719. 696.51 s [vector] +++ OK, passed 100 tests.
  10720. 696.53 s [vector] mut_ifoldr: OK (0.01s)
  10721. 696.53 s [vector] +++ OK, passed 100 tests.
  10722. 696.54 s [vector] mut_ifoldr': OK (0.01s)
  10723. 696.55 s [vector] +++ OK, passed 100 tests.
  10724. 696.55 s [vector] mut_ifoldl: OK (0.01s)
  10725. 696.56 s [vector] +++ OK, passed 100 tests.
  10726. 696.57 s [vector] mut_ifoldl': OK (0.01s)
  10727. 696.57 s [vector] +++ OK, passed 100 tests.
  10728. 696.57 s [vector] mut_foldM: OK (0.01s)
  10729. 696.57 s [vector] +++ OK, passed 100 tests.
  10730. 696.59 s [vector] mut_foldM': OK (0.01s)
  10731. 696.59 s [vector] +++ OK, passed 100 tests.
  10732. 696.59 s [vector] mut_foldrM: OK (0.01s)
  10733. 696.59 s [vector] +++ OK, passed 100 tests.
  10734. 696.61 s [vector] mut_foldrM': OK (0.01s)
  10735. 696.61 s [vector] +++ OK, passed 100 tests.
  10736. 696.62 s [vector] mut_ifoldM: OK (0.01s)
  10737. 696.62 s [vector] +++ OK, passed 100 tests.
  10738. 696.62 s [vector] mut_ifoldM': OK (0.01s)
  10739. 696.62 s [vector] +++ OK, passed 100 tests.
  10740. 696.65 s [vector] mut_ifoldrM: OK (0.01s)
  10741. 696.65 s [vector] +++ OK, passed 100 tests.
  10742. 696.65 s [vector] mut_ifoldrM': OK (0.01s)
  10743. 696.65 s [vector] +++ OK, passed 100 tests.
  10744. 696.65 s [vector] compare: OK
  10745. 696.65 s [vector] +++ OK, passed 100 tests.
  10746. 696.65 s [vector] maximum: OK
  10747. 696.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10748. 696.66 s [vector] minimum: OK
  10749. 696.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10750. 696.66 s [vector] minIndex: OK
  10751. 696.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10752. 696.66 s [vector] maxIndex: OK
  10753. 696.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10754. 696.66 s [vector] maximumBy: OK
  10755. 696.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10756. 696.66 s [vector] minimumBy: OK
  10757. 696.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10758. 696.66 s [vector] maximumOn: OK
  10759. 696.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10760. 696.67 s [vector] minimumOn: OK
  10761. 696.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10762. 696.67 s [vector] maxIndexBy: OK
  10763. 696.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10764. 696.68 s [vector] minIndexBy: OK
  10765. 696.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10766. 696.68 s [vector] ListFirstMaxIndexWins: OK
  10767. 696.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10768. 696.68 s [vector] FalseListFirstMaxIndexWins: OK
  10769. 696.68 s [vector] +++ OK, failed as expected. (after 1 test):
  10770. 696.68 s [vector] Exception:
  10771. 696.69 s [vector] Prelude.foldr1: empty list
  10772. 696.69 s [vector] CallStack (from HasCallStack):
  10773. 696.69 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10774. 696.69 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10775. 696.69 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10776. 696.69 s [vector] []
  10777. 696.69 s [vector] mempty: OK
  10778. 696.69 s [vector] +++ OK, passed 100 tests.
  10779. 696.69 s [vector] mappend: OK
  10780. 696.69 s [vector] +++ OK, passed 100 tests.
  10781. 696.69 s [vector] mconcat: OK (0.02s)
  10782. 696.69 s [vector] +++ OK, passed 100 tests.
  10783. 696.69 s [vector] glength: OK
  10784. 696.69 s [vector] +++ OK, passed 100 tests.
  10785. 696.69 s [vector] sum: OK
  10786. 696.69 s [vector] +++ OK, passed 100 tests.
  10787. 696.69 s [vector] product: OK
  10788. 696.69 s [vector] +++ OK, passed 100 tests.
  10789. 696.69 s [vector] enumFromN: OK
  10790. 696.69 s [vector] +++ OK, passed 100 tests.
  10791. 696.69 s [vector] enumFromThenN: OK
  10792. 696.69 s [vector] +++ OK, passed 100 tests.
  10793. 696.69 s [vector] enumFromTo: OK
  10794. 696.69 s [vector] +++ OK, passed 100 tests.
  10795. 696.69 s [vector] enumFromThenTo: OK
  10796. 696.69 s [vector] +++ OK, passed 100 tests; 1 discarded.
  10797. 696.69 s [vector] unstream
  10798. 696.69 s [vector] unstream == vunstream (exact): OK
  10799. 696.69 s [vector] +++ OK, passed 100 tests.
  10800. 696.69 s [vector] unstream == vunstream (unknown): OK
  10801. 696.69 s [vector] +++ OK, passed 100 tests.
  10802. 696.69 s [vector] unstreamR ~= vunstream (exact): OK
  10803. 696.69 s [vector] +++ OK, passed 100 tests.
  10804. 696.69 s [vector] unstreamR ~= vunstream (unknown): OK
  10805. 696.69 s [vector] +++ OK, passed 100 tests.
  10806. 696.69 s [vector] Tests.Vector.Strict
  10807. 696.69 s [vector] Bool
  10808. 696.69 s [vector] fromList.toList == id: OK
  10809. 696.69 s [vector] +++ OK, passed 100 tests.
  10810. 696.69 s [vector] toList.fromList == id: OK
  10811. 696.69 s [vector] +++ OK, passed 100 tests.
  10812. 696.69 s [vector] unstream.stream == id: OK
  10813. 696.69 s [vector] +++ OK, passed 100 tests.
  10814. 696.70 s [vector] stream.unstream == id: OK
  10815. 696.70 s [vector] +++ OK, passed 100 tests.
  10816. 696.70 s [vector] eq: OK
  10817. 696.70 s [vector] +++ OK, passed 100 tests.
  10818. 696.70 s [vector] length: OK
  10819. 696.70 s [vector] +++ OK, passed 100 tests.
  10820. 696.70 s [vector] null: OK
  10821. 696.70 s [vector] +++ OK, passed 100 tests.
  10822. 696.70 s [vector] index: OK
  10823. 696.70 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10824. 696.71 s [vector] safeIndex: OK
  10825. 696.71 s [vector] +++ OK, passed 100 tests.
  10826. 696.71 s [vector] head: OK
  10827. 696.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10828. 696.71 s [vector] last: OK
  10829. 696.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10830. 696.71 s [vector] unsafeIndex: OK
  10831. 696.72 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10832. 696.73 s [vector] unsafeHead: OK
  10833. 696.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10834. 696.73 s [vector] unsafeLast: OK
  10835. 696.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10836. 696.74 s [vector] slice: OK
  10837. 696.74 s [vector] +++ OK, passed 100 tests.
  10838. 696.74 s [vector] init: OK
  10839. 696.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10840. 696.74 s [vector] tail: OK
  10841. 696.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10842. 696.74 s [vector] take: OK
  10843. 696.74 s [vector] +++ OK, passed 100 tests.
  10844. 696.74 s [vector] drop: OK
  10845. 696.74 s [vector] +++ OK, passed 100 tests.
  10846. 696.74 s [vector] splitAt: OK
  10847. 696.75 s [vector] +++ OK, passed 100 tests.
  10848. 696.75 s [vector] empty: OK
  10849. 696.75 s [vector] +++ OK, passed 100 tests.
  10850. 696.76 s [vector] singleton: OK
  10851. 696.76 s [vector] +++ OK, passed 100 tests.
  10852. 696.76 s [vector] replicate: OK
  10853. 696.76 s [vector] +++ OK, passed 100 tests.
  10854. 696.76 s [vector] generate: OK
  10855. 696.76 s [vector] +++ OK, passed 100 tests.
  10856. 696.76 s [vector] iterateN: OK
  10857. 696.77 s [vector] +++ OK, passed 100 tests.
  10858. 696.77 s [vector] iterateNM: OK (0.02s)
  10859. 696.77 s [vector] +++ OK, passed 100 tests.
  10860. 696.77 s [vector] generateM: OK (0.02s)
  10861. 696.77 s [vector] +++ OK, passed 100 tests.
  10862. 696.77 s [vector] replicateM: OK (0.01s)
  10863. 696.77 s [vector] +++ OK, passed 100 tests.
  10864. 696.77 s [vector] create: OK
  10865. 696.77 s [vector] +++ OK, passed 100 tests.
  10866. 696.77 s [vector] createT: OK
  10867. 696.77 s [vector] +++ OK, passed 100 tests.
  10868. 696.77 s [vector] unfoldr: OK
  10869. 696.77 s [vector] +++ OK, passed 100 tests.
  10870. 696.77 s [vector] unfoldrN: OK
  10871. 696.77 s [vector] +++ OK, passed 100 tests.
  10872. 696.77 s [vector] unfoldrExactN: OK
  10873. 696.77 s [vector] +++ OK, passed 100 tests.
  10874. 696.77 s [vector] unfoldrM: OK
  10875. 696.77 s [vector] +++ OK, passed 100 tests.
  10876. 696.77 s [vector] unfoldrNM: OK
  10877. 696.77 s [vector] +++ OK, passed 100 tests.
  10878. 696.77 s [vector] unfoldrExactNM: OK (0.01s)
  10879. 696.77 s [vector] +++ OK, passed 100 tests.
  10880. 696.78 s [vector] constructN: OK
  10881. 696.78 s [vector] +++ OK, passed 100 tests.
  10882. 696.78 s [vector] constructrN: OK
  10883. 696.78 s [vector] +++ OK, passed 100 tests.
  10884. 696.78 s [vector] cons: OK
  10885. 696.78 s [vector] +++ OK, passed 100 tests.
  10886. 696.78 s [vector] snoc: OK
  10887. 696.78 s [vector] +++ OK, passed 100 tests.
  10888. 696.78 s [vector] append: OK
  10889. 696.78 s [vector] +++ OK, passed 100 tests.
  10890. 696.78 s [vector] concat: OK
  10891. 696.78 s [vector] +++ OK, passed 100 tests.
  10892. 696.79 s [vector] force: OK
  10893. 696.79 s [vector] +++ OK, passed 100 tests.
  10894. 696.79 s [vector] upd: OK
  10895. 696.79 s [vector] +++ OK, passed 100 tests.
  10896. 696.79 s [vector] accum: OK
  10897. 696.79 s [vector] +++ OK, passed 100 tests.
  10898. 696.80 s [vector] reverse: OK
  10899. 696.80 s [vector] +++ OK, passed 100 tests.
  10900. 696.81 s [vector] backpermute: OK
  10901. 696.81 s [vector] +++ OK, passed 100 tests.
  10902. 696.81 s [vector] map: OK
  10903. 696.81 s [vector] +++ OK, passed 100 tests.
  10904. 696.81 s [vector] imap: OK
  10905. 696.81 s [vector] +++ OK, passed 100 tests.
  10906. 696.81 s [vector] concatMap: OK
  10907. 696.81 s [vector] +++ OK, passed 100 tests.
  10908. 696.82 s [vector] mapM: OK
  10909. 696.82 s [vector] +++ OK, passed 100 tests.
  10910. 696.82 s [vector] mapM_: OK
  10911. 696.83 s [vector] +++ OK, passed 100 tests.
  10912. 696.83 s [vector] forM: OK
  10913. 696.83 s [vector] +++ OK, passed 100 tests.
  10914. 696.84 s [vector] forM_: OK
  10915. 696.84 s [vector] +++ OK, passed 100 tests.
  10916. 696.85 s [vector] imapM: OK
  10917. 696.85 s [vector] +++ OK, passed 100 tests.
  10918. 696.86 s [vector] imapM_: OK (0.01s)
  10919. 696.86 s [vector] +++ OK, passed 100 tests.
  10920. 696.86 s [vector] zipWith: OK
  10921. 696.86 s [vector] +++ OK, passed 100 tests.
  10922. 696.86 s [vector] zipWith3: OK
  10923. 696.86 s [vector] +++ OK, passed 100 tests.
  10924. 696.86 s [vector] izipWith: OK
  10925. 696.86 s [vector] +++ OK, passed 100 tests.
  10926. 696.86 s [vector] izipWith3: OK
  10927. 696.87 s [vector] +++ OK, passed 100 tests.
  10928. 696.87 s [vector] izipWithM: OK
  10929. 696.87 s [vector] +++ OK, passed 100 tests.
  10930. 696.87 s [vector] izipWithM_: OK
  10931. 696.87 s [vector] +++ OK, passed 100 tests.
  10932. 696.87 s [vector] zipWithM: OK
  10933. 696.87 s [vector] +++ OK, passed 100 tests.
  10934. 696.87 s [vector] zipWithM_: OK
  10935. 696.87 s [vector] +++ OK, passed 100 tests.
  10936. 696.87 s [vector] filter: OK
  10937. 696.87 s [vector] +++ OK, passed 100 tests.
  10938. 696.87 s [vector] ifilter: OK
  10939. 696.87 s [vector] +++ OK, passed 100 tests.
  10940. 696.87 s [vector] filterM: OK (0.03s)
  10941. 696.87 s [vector] +++ OK, passed 100 tests.
  10942. 696.87 s [vector] uniq: OK
  10943. 696.87 s [vector] +++ OK, passed 100 tests.
  10944. 696.87 s [vector] mapMaybe: OK
  10945. 696.87 s [vector] +++ OK, passed 100 tests.
  10946. 696.87 s [vector] imapMaybe: OK
  10947. 696.87 s [vector] +++ OK, passed 100 tests.
  10948. 696.87 s [vector] takeWhile: OK
  10949. 696.87 s [vector] +++ OK, passed 100 tests.
  10950. 696.87 s [vector] dropWhile: OK
  10951. 696.87 s [vector] +++ OK, passed 100 tests.
  10952. 696.87 s [vector] partition: OK
  10953. 696.87 s [vector] +++ OK, passed 100 tests.
  10954. 696.87 s [vector] partitionWith: OK
  10955. 696.87 s [vector] +++ OK, passed 100 tests.
  10956. 696.87 s [vector] span: OK
  10957. 696.87 s [vector] +++ OK, passed 100 tests.
  10958. 696.87 s [vector] break: OK
  10959. 696.87 s [vector] +++ OK, passed 100 tests.
  10960. 696.87 s [vector] spanR: OK
  10961. 696.87 s [vector] +++ OK, passed 100 tests.
  10962. 696.87 s [vector] breakR: OK
  10963. 696.88 s [vector] +++ OK, passed 100 tests.
  10964. 696.88 s [vector] groupBy: OK
  10965. 696.88 s [vector] +++ OK, passed 100 tests.
  10966. 696.88 s [vector] elem: OK
  10967. 696.88 s [vector] +++ OK, passed 100 tests.
  10968. 696.88 s [vector] notElem: OK
  10969. 696.88 s [vector] +++ OK, passed 100 tests.
  10970. 696.88 s [vector] find: OK
  10971. 696.88 s [vector] +++ OK, passed 100 tests.
  10972. 696.88 s [vector] findIndex: OK
  10973. 696.88 s [vector] +++ OK, passed 100 tests.
  10974. 696.88 s [vector] findIndexR: OK
  10975. 696.88 s [vector] +++ OK, passed 100 tests.
  10976. 696.88 s [vector] findIndices: OK
  10977. 696.88 s [vector] +++ OK, passed 100 tests.
  10978. 696.88 s [vector] elemIndex: OK
  10979. 696.88 s [vector] +++ OK, passed 100 tests.
  10980. 696.88 s [vector] elemIndices: OK
  10981. 696.88 s [vector] +++ OK, passed 100 tests.
  10982. 696.88 s [vector] foldl: OK
  10983. 696.88 s [vector] +++ OK, passed 100 tests.
  10984. 696.88 s [vector] foldl1: OK
  10985. 696.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10986. 696.88 s [vector] foldl': OK
  10987. 696.88 s [vector] +++ OK, passed 100 tests.
  10988. 696.88 s [vector] foldl1': OK
  10989. 696.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10990. 696.89 s [vector] foldr: OK
  10991. 696.89 s [vector] +++ OK, passed 100 tests.
  10992. 696.89 s [vector] foldr1: OK
  10993. 696.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10994. 696.89 s [vector] foldr': OK
  10995. 696.89 s [vector] +++ OK, passed 100 tests.
  10996. 696.89 s [vector] foldr1': OK
  10997. 696.89 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10998. 696.89 s [vector] ifoldl: OK
  10999. 696.89 s [vector] +++ OK, passed 100 tests.
  11000. 696.89 s [vector] ifoldl': OK
  11001. 696.89 s [vector] +++ OK, passed 100 tests.
  11002. 696.89 s [vector] ifoldr: OK
  11003. 696.89 s [vector] +++ OK, passed 100 tests.
  11004. 696.89 s [vector] ifoldr': OK
  11005. 696.89 s [vector] +++ OK, passed 100 tests.
  11006. 696.90 s [vector] ifoldM: OK
  11007. 696.90 s [vector] +++ OK, passed 100 tests.
  11008. 696.91 s [vector] ifoldM': OK
  11009. 696.91 s [vector] +++ OK, passed 100 tests.
  11010. 696.91 s [vector] ifoldM_: OK
  11011. 696.91 s [vector] +++ OK, passed 100 tests.
  11012. 696.92 s [vector] ifoldM'_: OK
  11013. 696.92 s [vector] +++ OK, passed 100 tests.
  11014. 696.92 s [vector] all: OK
  11015. 696.92 s [vector] +++ OK, passed 100 tests.
  11016. 696.92 s [vector] any: OK
  11017. 696.92 s [vector] +++ OK, passed 100 tests.
  11018. 696.92 s [vector] prescanl: OK
  11019. 696.92 s [vector] +++ OK, passed 100 tests.
  11020. 696.92 s [vector] prescanl': OK
  11021. 696.92 s [vector] +++ OK, passed 100 tests.
  11022. 696.92 s [vector] postscanl: OK
  11023. 696.92 s [vector] +++ OK, passed 100 tests.
  11024. 696.92 s [vector] postscanl': OK
  11025. 696.93 s [vector] +++ OK, passed 100 tests.
  11026. 696.93 s [vector] scanl: OK
  11027. 696.93 s [vector] +++ OK, passed 100 tests.
  11028. 696.93 s [vector] scanl': OK
  11029. 696.93 s [vector] +++ OK, passed 100 tests.
  11030. 696.93 s [vector] scanl1: OK
  11031. 696.93 s [vector] +++ OK, passed 100 tests.
  11032. 696.93 s [vector] scanl1': OK
  11033. 696.93 s [vector] +++ OK, passed 100 tests.
  11034. 696.93 s [vector] iscanl: OK
  11035. 696.93 s [vector] +++ OK, passed 100 tests.
  11036. 696.93 s [vector] iscanl': OK
  11037. 696.93 s [vector] +++ OK, passed 100 tests.
  11038. 696.93 s [vector] prescanr: OK
  11039. 696.93 s [vector] +++ OK, passed 100 tests.
  11040. 696.93 s [vector] prescanr': OK
  11041. 696.93 s [vector] +++ OK, passed 100 tests.
  11042. 696.93 s [vector] postscanr: OK
  11043. 696.93 s [vector] +++ OK, passed 100 tests.
  11044. 696.93 s [vector] postscanr': OK
  11045. 696.94 s [vector] +++ OK, passed 100 tests.
  11046. 696.94 s [vector] scanr: OK
  11047. 696.94 s [vector] +++ OK, passed 100 tests.
  11048. 696.94 s [vector] scanr': OK
  11049. 696.94 s [vector] +++ OK, passed 100 tests.
  11050. 696.94 s [vector] scanr1: OK
  11051. 696.94 s [vector] +++ OK, passed 100 tests.
  11052. 696.94 s [vector] scanr1': OK
  11053. 696.94 s [vector] +++ OK, passed 100 tests.
  11054. 696.94 s [vector] iscanr: OK
  11055. 696.94 s [vector] +++ OK, passed 100 tests.
  11056. 696.94 s [vector] iscanr': OK
  11057. 696.94 s [vector] +++ OK, passed 100 tests.
  11058. 696.94 s [vector] mut_read: OK
  11059. 696.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11060. 696.95 s [vector] mut_write: OK
  11061. 696.95 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11062. 696.96 s [vector] mut_modify: OK
  11063. 696.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11064. 696.96 s [vector] mut_generate: OK
  11065. 696.96 s [vector] +++ OK, passed 100 tests.
  11066. 696.96 s [vector] mut_generateM: OK
  11067. 696.96 s [vector] +++ OK, passed 100 tests.
  11068. 696.96 s [vector] mut_mapM_: OK
  11069. 696.96 s [vector] +++ OK, passed 100 tests.
  11070. 696.97 s [vector] mut_imapM_: OK
  11071. 696.97 s [vector] +++ OK, passed 100 tests.
  11072. 696.98 s [vector] mut_forM_: OK
  11073. 696.98 s [vector] +++ OK, passed 100 tests.
  11074. 696.98 s [vector] mut_iforM_: OK
  11075. 696.98 s [vector] +++ OK, passed 100 tests.
  11076. 696.99 s [vector] mut_foldr: OK
  11077. 696.99 s [vector] +++ OK, passed 100 tests.
  11078. 696.99 s [vector] mut_foldr': OK
  11079. 696.99 s [vector] +++ OK, passed 100 tests.
  11080. 696.99 s [vector] mut_foldl: OK
  11081. 696.99 s [vector] +++ OK, passed 100 tests.
  11082. 696.99 s [vector] mut_foldl': OK
  11083. 696.99 s [vector] +++ OK, passed 100 tests.
  11084. 696.99 s [vector] mut_ifoldr: OK
  11085. 696.99 s [vector] +++ OK, passed 100 tests.
  11086. 696.99 s [vector] mut_ifoldr': OK
  11087. 697.00 s [vector] +++ OK, passed 100 tests.
  11088. 697.00 s [vector] mut_ifoldl: OK
  11089. 697.00 s [vector] +++ OK, passed 100 tests.
  11090. 697.00 s [vector] mut_ifoldl': OK
  11091. 697.00 s [vector] +++ OK, passed 100 tests.
  11092. 697.00 s [vector] mut_foldM: OK
  11093. 697.00 s [vector] +++ OK, passed 100 tests.
  11094. 697.00 s [vector] mut_foldM': OK
  11095. 697.00 s [vector] +++ OK, passed 100 tests.
  11096. 697.00 s [vector] mut_foldrM: OK
  11097. 697.00 s [vector] +++ OK, passed 100 tests.
  11098. 697.00 s [vector] mut_foldrM': OK
  11099. 697.00 s [vector] +++ OK, passed 100 tests.
  11100. 697.01 s [vector] mut_ifoldM: OK
  11101. 697.01 s [vector] +++ OK, passed 100 tests.
  11102. 697.01 s [vector] mut_ifoldM': OK
  11103. 697.01 s [vector] +++ OK, passed 100 tests.
  11104. 697.01 s [vector] mut_ifoldrM: OK
  11105. 697.01 s [vector] +++ OK, passed 100 tests.
  11106. 697.01 s [vector] mut_ifoldrM': OK
  11107. 697.01 s [vector] +++ OK, passed 100 tests.
  11108. 697.01 s [vector] compare: OK
  11109. 697.01 s [vector] +++ OK, passed 100 tests.
  11110. 697.01 s [vector] maximum: OK
  11111. 697.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11112. 697.01 s [vector] minimum: OK
  11113. 697.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11114. 697.01 s [vector] minIndex: OK
  11115. 697.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11116. 697.01 s [vector] maxIndex: OK
  11117. 697.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11118. 697.01 s [vector] maximumBy: OK
  11119. 697.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11120. 697.01 s [vector] minimumBy: OK
  11121. 697.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11122. 697.01 s [vector] maximumOn: OK
  11123. 697.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11124. 697.01 s [vector] minimumOn: OK
  11125. 697.01 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11126. 697.01 s [vector] maxIndexBy: OK
  11127. 697.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11128. 697.01 s [vector] minIndexBy: OK
  11129. 697.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11130. 697.02 s [vector] ListFirstMaxIndexWins: OK
  11131. 697.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11132. 697.02 s [vector] FalseListFirstMaxIndexWins: OK
  11133. 697.02 s [vector] +++ OK, failed as expected. (after 1 test):
  11134. 697.02 s [vector] Exception:
  11135. 697.02 s [vector] Prelude.foldr1: empty list
  11136. 697.02 s [vector] CallStack (from HasCallStack):
  11137. 697.02 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11138. 697.02 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11139. 697.02 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11140. 697.02 s [vector] []
  11141. 697.02 s [vector] zip: OK
  11142. 697.02 s [vector] +++ OK, passed 100 tests.
  11143. 697.02 s [vector] zip3: OK
  11144. 697.02 s [vector] +++ OK, passed 100 tests.
  11145. 697.02 s [vector] unzip: OK
  11146. 697.02 s [vector] +++ OK, passed 100 tests.
  11147. 697.02 s [vector] unzip3: OK
  11148. 697.02 s [vector] +++ OK, passed 100 tests.
  11149. 697.02 s [vector] indexed: OK
  11150. 697.02 s [vector] +++ OK, passed 100 tests.
  11151. 697.02 s [vector] update: OK
  11152. 697.02 s [vector] +++ OK, passed 100 tests.
  11153. 697.02 s [vector] concat: OK
  11154. 697.02 s [vector] +++ OK, passed 100 tests.
  11155. 697.02 s [vector] mempty: OK
  11156. 697.02 s [vector] +++ OK, passed 100 tests.
  11157. 697.03 s [vector] mappend: OK
  11158. 697.03 s [vector] +++ OK, passed 100 tests.
  11159. 697.03 s [vector] mconcat: OK
  11160. 697.03 s [vector] +++ OK, passed 100 tests.
  11161. 697.05 s [vector] fmap: OK
  11162. 697.05 s [vector] +++ OK, passed 100 tests.
  11163. 697.05 s [vector] return: OK
  11164. 697.05 s [vector] +++ OK, passed 100 tests.
  11165. 697.07 s [vector] bind: OK (0.02s)
  11166. 697.07 s [vector] +++ OK, passed 100 tests.
  11167. 697.07 s [vector] mzip: OK
  11168. 697.09 s [vector] +++ OK, passed 100 tests.
  11169. 697.09 s [vector] munzip: OK
  11170. 697.09 s [vector] +++ OK, passed 100 tests.
  11171. 697.09 s [vector] applicative_pure: OK
  11172. 697.09 s [vector] +++ OK, passed 100 tests.
  11173. 697.09 s [vector] applicative_appl: OK (0.02s)
  11174. 697.09 s [vector] +++ OK, passed 100 tests.
  11175. 697.09 s [vector] alternative_empty: OK
  11176. 697.09 s [vector] +++ OK, passed 100 tests.
  11177. 697.09 s [vector] alternative_or: OK
  11178. 697.09 s [vector] +++ OK, passed 100 tests.
  11179. 697.10 s [vector] sequence: OK (0.02s)
  11180. 697.10 s [vector] +++ OK, passed 100 tests.
  11181. 697.10 s [vector] sequence_: OK
  11182. 697.10 s [vector] +++ OK, passed 100 tests.
  11183. 697.10 s [vector] glength: OK
  11184. 697.10 s [vector] +++ OK, passed 100 tests.
  11185. 697.11 s [vector] and: OK
  11186. 697.11 s [vector] +++ OK, passed 100 tests.
  11187. 697.11 s [vector] or: OK
  11188. 697.11 s [vector] +++ OK, passed 100 tests.
  11189. 697.11 s [vector] Int
  11190. 697.11 s [vector] fromList.toList == id: OK
  11191. 697.11 s [vector] +++ OK, passed 100 tests.
  11192. 697.11 s [vector] toList.fromList == id: OK
  11193. 697.11 s [vector] +++ OK, passed 100 tests.
  11194. 697.11 s [vector] unstream.stream == id: OK
  11195. 697.11 s [vector] +++ OK, passed 100 tests.
  11196. 697.11 s [vector] stream.unstream == id: OK
  11197. 697.11 s [vector] +++ OK, passed 100 tests.
  11198. 697.11 s [vector] eq: OK
  11199. 697.11 s [vector] +++ OK, passed 100 tests.
  11200. 697.11 s [vector] length: OK
  11201. 697.11 s [vector] +++ OK, passed 100 tests.
  11202. 697.11 s [vector] null: OK
  11203. 697.11 s [vector] +++ OK, passed 100 tests.
  11204. 697.11 s [vector] index: OK
  11205. 697.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11206. 697.11 s [vector] safeIndex: OK
  11207. 697.11 s [vector] +++ OK, passed 100 tests.
  11208. 697.11 s [vector] head: OK
  11209. 697.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11210. 697.11 s [vector] last: OK
  11211. 697.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11212. 697.11 s [vector] unsafeIndex: OK
  11213. 697.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11214. 697.11 s [vector] unsafeHead: OK
  11215. 697.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11216. 697.11 s [vector] unsafeLast: OK
  11217. 697.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11218. 697.11 s [vector] slice: OK
  11219. 697.11 s [vector] +++ OK, passed 100 tests.
  11220. 697.11 s [vector] init: OK
  11221. 697.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11222. 697.11 s [vector] tail: OK
  11223. 697.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11224. 697.11 s [vector] take: OK
  11225. 697.11 s [vector] +++ OK, passed 100 tests.
  11226. 697.11 s [vector] drop: OK
  11227. 697.11 s [vector] +++ OK, passed 100 tests.
  11228. 697.11 s [vector] splitAt: OK
  11229. 697.11 s [vector] +++ OK, passed 100 tests.
  11230. 697.12 s [vector] empty: OK
  11231. 697.12 s [vector] +++ OK, passed 100 tests.
  11232. 697.12 s [vector] singleton: OK
  11233. 697.12 s [vector] +++ OK, passed 100 tests.
  11234. 697.12 s [vector] replicate: OK
  11235. 697.12 s [vector] +++ OK, passed 100 tests.
  11236. 697.12 s [vector] generate: OK
  11237. 697.12 s [vector] +++ OK, passed 100 tests.
  11238. 697.12 s [vector] iterateN: OK
  11239. 697.12 s [vector] +++ OK, passed 100 tests.
  11240. 697.15 s [vector] iterateNM: OK
  11241. 697.15 s [vector] +++ OK, passed 100 tests.
  11242. 697.16 s [vector] generateM: OK (0.02s)
  11243. 697.16 s [vector] +++ OK, passed 100 tests.
  11244. 697.16 s [vector] replicateM: OK
  11245. 697.16 s [vector] +++ OK, passed 100 tests.
  11246. 697.16 s [vector] create: OK
  11247. 697.16 s [vector] +++ OK, passed 100 tests.
  11248. 697.16 s [vector] createT: OK
  11249. 697.16 s [vector] +++ OK, passed 100 tests.
  11250. 697.17 s [vector] unfoldr: OK
  11251. 697.17 s [vector] +++ OK, passed 100 tests.
  11252. 697.17 s [vector] unfoldrN: OK
  11253. 697.17 s [vector] +++ OK, passed 100 tests.
  11254. 697.17 s [vector] unfoldrExactN: OK
  11255. 697.17 s [vector] +++ OK, passed 100 tests.
  11256. 697.17 s [vector] unfoldrM: OK
  11257. 697.17 s [vector] +++ OK, passed 100 tests.
  11258. 697.18 s [vector] unfoldrNM: OK
  11259. 697.18 s [vector] +++ OK, passed 100 tests.
  11260. 697.18 s [vector] unfoldrExactNM: OK (0.01s)
  11261. 697.18 s [vector] +++ OK, passed 100 tests.
  11262. 697.18 s [vector] constructN: OK
  11263. 697.18 s [vector] +++ OK, passed 100 tests.
  11264. 697.18 s [vector] constructrN: OK
  11265. 697.18 s [vector] +++ OK, passed 100 tests.
  11266. 697.18 s [vector] cons: OK
  11267. 697.19 s [vector] +++ OK, passed 100 tests.
  11268. 697.19 s [vector] snoc: OK
  11269. 697.19 s [vector] +++ OK, passed 100 tests.
  11270. 697.19 s [vector] append: OK
  11271. 697.19 s [vector] +++ OK, passed 100 tests.
  11272. 697.20 s [vector] concat: OK (0.01s)
  11273. 697.20 s [vector] +++ OK, passed 100 tests.
  11274. 697.20 s [vector] force: OK
  11275. 697.20 s [vector] +++ OK, passed 100 tests.
  11276. 697.20 s [vector] upd: OK
  11277. 697.20 s [vector] +++ OK, passed 100 tests.
  11278. 697.21 s [vector] accum: OK
  11279. 697.21 s [vector] +++ OK, passed 100 tests.
  11280. 697.21 s [vector] reverse: OK
  11281. 697.21 s [vector] +++ OK, passed 100 tests.
  11282. 697.21 s [vector] backpermute: OK
  11283. 697.21 s [vector] +++ OK, passed 100 tests.
  11284. 697.22 s [vector] map: OK
  11285. 697.22 s [vector] +++ OK, passed 100 tests.
  11286. 697.22 s [vector] imap: OK
  11287. 697.22 s [vector] +++ OK, passed 100 tests.
  11288. 697.22 s [vector] concatMap: OK
  11289. 697.23 s [vector] +++ OK, passed 100 tests.
  11290. 697.23 s [vector] mapM: OK
  11291. 697.23 s [vector] +++ OK, passed 100 tests.
  11292. 697.25 s [vector] mapM_: OK (0.03s)
  11293. 697.25 s [vector] +++ OK, passed 100 tests.
  11294. 697.25 s [vector] forM: OK
  11295. 697.27 s [vector] +++ OK, passed 100 tests.
  11296. 697.29 s [vector] forM_: OK (0.03s)
  11297. 697.29 s [vector] +++ OK, passed 100 tests.
  11298. 697.29 s [vector] imapM: OK
  11299. 697.29 s [vector] +++ OK, passed 100 tests.
  11300. 697.32 s [vector] imapM_: OK (0.03s)
  11301. 697.32 s [vector] +++ OK, passed 100 tests.
  11302. 697.33 s [vector] zipWith: OK
  11303. 697.33 s [vector] +++ OK, passed 100 tests.
  11304. 697.33 s [vector] zipWith3: OK
  11305. 697.33 s [vector] +++ OK, passed 100 tests.
  11306. 697.33 s [vector] izipWith: OK
  11307. 697.34 s [vector] +++ OK, passed 100 tests.
  11308. 697.34 s [vector] izipWith3: OK
  11309. 697.34 s [vector] +++ OK, passed 100 tests.
  11310. 697.35 s [vector] izipWithM: OK
  11311. 697.35 s [vector] +++ OK, passed 100 tests.
  11312. 697.37 s [vector] izipWithM_: OK (0.02s)
  11313. 697.37 s [vector] +++ OK, passed 100 tests.
  11314. 697.37 s [vector] zipWithM: OK
  11315. 697.37 s [vector] +++ OK, passed 100 tests.
  11316. 697.40 s [vector] zipWithM_: OK (0.02s)
  11317. 697.40 s [vector] +++ OK, passed 100 tests.
  11318. 697.40 s [vector] filter: OK
  11319. 697.40 s [vector] +++ OK, passed 100 tests.
  11320. 697.41 s [vector] ifilter: OK
  11321. 697.41 s [vector] +++ OK, passed 100 tests.
  11322. 697.44 s [vector] filterM: OK (0.04s)
  11323. 697.45 s [vector] +++ OK, passed 100 tests.
  11324. 697.45 s [vector] uniq: OK
  11325. 697.45 s [vector] +++ OK, passed 100 tests.
  11326. 697.45 s [vector] mapMaybe: OK
  11327. 697.45 s [vector] +++ OK, passed 100 tests.
  11328. 697.45 s [vector] imapMaybe: OK
  11329. 697.45 s [vector] +++ OK, passed 100 tests.
  11330. 697.45 s [vector] takeWhile: OK
  11331. 697.46 s [vector] +++ OK, passed 100 tests.
  11332. 697.46 s [vector] dropWhile: OK
  11333. 697.46 s [vector] +++ OK, passed 100 tests.
  11334. 697.46 s [vector] partition: OK
  11335. 697.46 s [vector] +++ OK, passed 100 tests.
  11336. 697.46 s [vector] partitionWith: OK
  11337. 697.46 s [vector] +++ OK, passed 100 tests.
  11338. 697.46 s [vector] span: OK
  11339. 697.46 s [vector] +++ OK, passed 100 tests.
  11340. 697.46 s [vector] break: OK
  11341. 697.46 s [vector] +++ OK, passed 100 tests.
  11342. 697.46 s [vector] spanR: OK
  11343. 697.46 s [vector] +++ OK, passed 100 tests.
  11344. 697.47 s [vector] breakR: OK
  11345. 697.47 s [vector] +++ OK, passed 100 tests.
  11346. 697.47 s [vector] groupBy: OK
  11347. 697.47 s [vector] +++ OK, passed 100 tests.
  11348. 697.47 s [vector] elem: OK
  11349. 697.47 s [vector] +++ OK, passed 100 tests.
  11350. 697.47 s [vector] notElem: OK
  11351. 697.47 s [vector] +++ OK, passed 100 tests.
  11352. 697.47 s [vector] find: OK
  11353. 697.47 s [vector] +++ OK, passed 100 tests.
  11354. 697.47 s [vector] findIndex: OK
  11355. 697.47 s [vector] +++ OK, passed 100 tests.
  11356. 697.48 s [vector] findIndexR: OK
  11357. 697.48 s [vector] +++ OK, passed 100 tests.
  11358. 697.48 s [vector] findIndices: OK
  11359. 697.48 s [vector] +++ OK, passed 100 tests.
  11360. 697.48 s [vector] elemIndex: OK
  11361. 697.48 s [vector] +++ OK, passed 100 tests.
  11362. 697.48 s [vector] elemIndices: OK
  11363. 697.48 s [vector] +++ OK, passed 100 tests.
  11364. 697.48 s [vector] foldl: OK
  11365. 697.48 s [vector] +++ OK, passed 100 tests.
  11366. 697.48 s [vector] foldl1: OK
  11367. 697.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11368. 697.49 s [vector] foldl': OK
  11369. 697.49 s [vector] +++ OK, passed 100 tests.
  11370. 697.49 s [vector] foldl1': OK
  11371. 697.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11372. 697.50 s [vector] foldr: OK
  11373. 697.51 s [vector] +++ OK, passed 100 tests.
  11374. 697.51 s [vector] foldr1: OK
  11375. 697.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11376. 697.51 s [vector] foldr': OK
  11377. 697.51 s [vector] +++ OK, passed 100 tests.
  11378. 697.51 s [vector] foldr1': OK
  11379. 697.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11380. 697.51 s [vector] ifoldl: OK
  11381. 697.51 s [vector] +++ OK, passed 100 tests.
  11382. 697.52 s [vector] ifoldl': OK
  11383. 697.53 s [vector] +++ OK, passed 100 tests.
  11384. 697.53 s [vector] ifoldr: OK
  11385. 697.53 s [vector] +++ OK, passed 100 tests.
  11386. 697.53 s [vector] ifoldr': OK
  11387. 697.53 s [vector] +++ OK, passed 100 tests.
  11388. 697.53 s [vector] ifoldM: OK
  11389. 697.53 s [vector] +++ OK, passed 100 tests.
  11390. 697.53 s [vector] ifoldM': OK
  11391. 697.55 s [vector] +++ OK, passed 100 tests.
  11392. 697.57 s [vector] ifoldM_: OK (0.03s)
  11393. 697.57 s [vector] +++ OK, passed 100 tests.
  11394. 697.59 s [vector] ifoldM'_: OK (0.03s)
  11395. 697.59 s [vector] +++ OK, passed 100 tests.
  11396. 697.59 s [vector] all: OK
  11397. 697.59 s [vector] +++ OK, passed 100 tests.
  11398. 697.59 s [vector] any: OK
  11399. 697.59 s [vector] +++ OK, passed 100 tests.
  11400. 697.59 s [vector] prescanl: OK
  11401. 697.59 s [vector] +++ OK, passed 100 tests.
  11402. 697.60 s [vector] prescanl': OK
  11403. 697.60 s [vector] +++ OK, passed 100 tests.
  11404. 697.60 s [vector] postscanl: OK
  11405. 697.60 s [vector] +++ OK, passed 100 tests.
  11406. 697.60 s [vector] postscanl': OK
  11407. 697.60 s [vector] +++ OK, passed 100 tests.
  11408. 697.61 s [vector] scanl: OK
  11409. 697.61 s [vector] +++ OK, passed 100 tests.
  11410. 697.61 s [vector] scanl': OK
  11411. 697.61 s [vector] +++ OK, passed 100 tests.
  11412. 697.62 s [vector] scanl1: OK
  11413. 697.62 s [vector] +++ OK, passed 100 tests.
  11414. 697.62 s [vector] scanl1': OK
  11415. 697.62 s [vector] +++ OK, passed 100 tests.
  11416. 697.62 s [vector] iscanl: OK
  11417. 697.62 s [vector] +++ OK, passed 100 tests.
  11418. 697.62 s [vector] iscanl': OK
  11419. 697.62 s [vector] +++ OK, passed 100 tests.
  11420. 697.62 s [vector] prescanr: OK
  11421. 697.62 s [vector] +++ OK, passed 100 tests.
  11422. 697.62 s [vector] prescanr': OK
  11423. 697.62 s [vector] +++ OK, passed 100 tests.
  11424. 697.63 s [vector] postscanr: OK
  11425. 697.63 s [vector] +++ OK, passed 100 tests.
  11426. 697.63 s [vector] postscanr': OK
  11427. 697.63 s [vector] +++ OK, passed 100 tests.
  11428. 697.63 s [vector] scanr: OK
  11429. 697.63 s [vector] +++ OK, passed 100 tests.
  11430. 697.63 s [vector] scanr': OK
  11431. 697.64 s [vector] +++ OK, passed 100 tests.
  11432. 697.64 s [vector] scanr1: OK
  11433. 697.64 s [vector] +++ OK, passed 100 tests.
  11434. 697.64 s [vector] scanr1': OK
  11435. 697.64 s [vector] +++ OK, passed 100 tests.
  11436. 697.64 s [vector] iscanr: OK
  11437. 697.64 s [vector] +++ OK, passed 100 tests.
  11438. 697.64 s [vector] iscanr': OK
  11439. 697.64 s [vector] +++ OK, passed 100 tests.
  11440. 697.65 s [vector] mut_read: OK
  11441. 697.65 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11442. 697.65 s [vector] mut_write: OK
  11443. 697.65 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11444. 697.65 s [vector] mut_modify: OK
  11445. 697.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11446. 697.67 s [vector] mut_generate: OK
  11447. 697.67 s [vector] +++ OK, passed 100 tests.
  11448. 697.67 s [vector] mut_generateM: OK
  11449. 697.67 s [vector] +++ OK, passed 100 tests.
  11450. 697.67 s [vector] mut_mapM_: OK (0.01s)
  11451. 697.67 s [vector] +++ OK, passed 100 tests.
  11452. 697.69 s [vector] mut_imapM_: OK (0.02s)
  11453. 697.69 s [vector] +++ OK, passed 100 tests.
  11454. 697.71 s [vector] mut_forM_: OK (0.01s)
  11455. 697.71 s [vector] +++ OK, passed 100 tests.
  11456. 697.71 s [vector] mut_iforM_: OK (0.01s)
  11457. 697.71 s [vector] +++ OK, passed 100 tests.
  11458. 697.71 s [vector] mut_foldr: OK
  11459. 697.71 s [vector] +++ OK, passed 100 tests.
  11460. 697.72 s [vector] mut_foldr': OK
  11461. 697.72 s [vector] +++ OK, passed 100 tests.
  11462. 697.72 s [vector] mut_foldl: OK
  11463. 697.72 s [vector] +++ OK, passed 100 tests.
  11464. 697.73 s [vector] mut_foldl': OK
  11465. 697.73 s [vector] +++ OK, passed 100 tests.
  11466. 697.73 s [vector] mut_ifoldr: OK
  11467. 697.73 s [vector] +++ OK, passed 100 tests.
  11468. 697.73 s [vector] mut_ifoldr': OK
  11469. 697.73 s [vector] +++ OK, passed 100 tests.
  11470. 697.73 s [vector] mut_ifoldl: OK
  11471. 697.73 s [vector] +++ OK, passed 100 tests.
  11472. 697.73 s [vector] mut_ifoldl': OK
  11473. 697.73 s [vector] +++ OK, passed 100 tests.
  11474. 697.73 s [vector] mut_foldM: OK
  11475. 697.74 s [vector] +++ OK, passed 100 tests.
  11476. 697.74 s [vector] mut_foldM': OK
  11477. 697.74 s [vector] +++ OK, passed 100 tests.
  11478. 697.74 s [vector] mut_foldrM: OK
  11479. 697.74 s [vector] +++ OK, passed 100 tests.
  11480. 697.74 s [vector] mut_foldrM': OK
  11481. 697.74 s [vector] +++ OK, passed 100 tests.
  11482. 697.74 s [vector] mut_ifoldM: OK
  11483. 697.74 s [vector] +++ OK, passed 100 tests.
  11484. 697.75 s [vector] mut_ifoldM': OK
  11485. 697.75 s [vector] +++ OK, passed 100 tests.
  11486. 697.75 s [vector] mut_ifoldrM: OK
  11487. 697.75 s [vector] +++ OK, passed 100 tests.
  11488. 697.75 s [vector] mut_ifoldrM': OK
  11489. 697.75 s [vector] +++ OK, passed 100 tests.
  11490. 697.75 s [vector] compare: OK
  11491. 697.75 s [vector] +++ OK, passed 100 tests.
  11492. 697.75 s [vector] maximum: OK
  11493. 697.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11494. 697.75 s [vector] minimum: OK
  11495. 697.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11496. 697.75 s [vector] minIndex: OK
  11497. 697.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11498. 697.75 s [vector] maxIndex: OK
  11499. 697.76 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11500. 697.76 s [vector] maximumBy: OK
  11501. 697.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11502. 697.76 s [vector] minimumBy: OK
  11503. 697.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11504. 697.76 s [vector] maximumOn: OK
  11505. 697.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11506. 697.76 s [vector] minimumOn: OK
  11507. 697.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11508. 697.76 s [vector] maxIndexBy: OK
  11509. 697.76 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11510. 697.76 s [vector] minIndexBy: OK
  11511. 697.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11512. 697.76 s [vector] ListFirstMaxIndexWins: OK
  11513. 697.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11514. 697.76 s [vector] FalseListFirstMaxIndexWins: OK
  11515. 697.76 s [vector] +++ OK, failed as expected. (after 1 test):
  11516. 697.76 s [vector] Exception:
  11517. 697.76 s [vector] Prelude.foldr1: empty list
  11518. 697.76 s [vector] CallStack (from HasCallStack):
  11519. 697.76 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11520. 697.76 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11521. 697.76 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11522. 697.76 s [vector] []
  11523. 697.76 s [vector] zip: OK
  11524. 697.76 s [vector] +++ OK, passed 100 tests.
  11525. 697.76 s [vector] zip3: OK
  11526. 697.76 s [vector] +++ OK, passed 100 tests.
  11527. 697.76 s [vector] unzip: OK
  11528. 697.76 s [vector] +++ OK, passed 100 tests.
  11529. 697.76 s [vector] unzip3: OK
  11530. 697.76 s [vector] +++ OK, passed 100 tests.
  11531. 697.76 s [vector] indexed: OK
  11532. 697.76 s [vector] +++ OK, passed 100 tests.
  11533. 697.76 s [vector] update: OK
  11534. 697.76 s [vector] +++ OK, passed 100 tests.
  11535. 697.77 s [vector] concat: OK
  11536. 697.77 s [vector] +++ OK, passed 100 tests.
  11537. 697.77 s [vector] mempty: OK
  11538. 697.77 s [vector] +++ OK, passed 100 tests.
  11539. 697.78 s [vector] mappend: OK
  11540. 697.78 s [vector] +++ OK, passed 100 tests.
  11541. 697.78 s [vector] mconcat: OK
  11542. 697.78 s [vector] +++ OK, passed 100 tests.
  11543. 697.78 s [vector] fmap: OK
  11544. 697.78 s [vector] +++ OK, passed 100 tests.
  11545. 697.78 s [vector] return: OK
  11546. 697.78 s [vector] +++ OK, passed 100 tests.
  11547. 697.80 s [vector] bind: OK (0.01s)
  11548. 697.80 s [vector] +++ OK, passed 100 tests.
  11549. 697.80 s [vector] mzip: OK
  11550. 697.80 s [vector] +++ OK, passed 100 tests.
  11551. 697.80 s [vector] munzip: OK
  11552. 697.81 s [vector] +++ OK, passed 100 tests.
  11553. 697.81 s [vector] applicative_pure: OK
  11554. 697.81 s [vector] +++ OK, passed 100 tests.
  11555. 697.84 s [vector] applicative_appl: OK (0.04s)
  11556. 697.84 s [vector] +++ OK, passed 100 tests.
  11557. 697.84 s [vector] alternative_empty: OK
  11558. 697.84 s [vector] +++ OK, passed 100 tests.
  11559. 697.85 s [vector] alternative_or: OK
  11560. 697.85 s [vector] +++ OK, passed 100 tests.
  11561. 697.87 s [vector] sequence: OK (0.02s)
  11562. 697.87 s [vector] +++ OK, passed 100 tests.
  11563. 697.87 s [vector] sequence_: OK (0.01s)
  11564. 697.87 s [vector] +++ OK, passed 100 tests.
  11565. 697.87 s [vector] glength: OK
  11566. 697.87 s [vector] +++ OK, passed 100 tests.
  11567. 697.87 s [vector] sum: OK
  11568. 697.87 s [vector] +++ OK, passed 100 tests.
  11569. 697.87 s [vector] product: OK
  11570. 697.87 s [vector] +++ OK, passed 100 tests.
  11571. 697.87 s [vector] enumFromN: OK
  11572. 697.87 s [vector] +++ OK, passed 100 tests.
  11573. 697.87 s [vector] enumFromThenN: OK
  11574. 697.87 s [vector] +++ OK, passed 100 tests.
  11575. 697.87 s [vector] enumFromTo: OK
  11576. 697.87 s [vector] +++ OK, passed 100 tests.
  11577. 697.87 s [vector] enumFromThenTo: OK
  11578. 697.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11579. 697.87 s [vector] unstream
  11580. 697.88 s [vector] unstream == vunstream (exact): OK
  11581. 697.88 s [vector] +++ OK, passed 100 tests.
  11582. 697.88 s [vector] unstream == vunstream (unknown): OK
  11583. 697.88 s [vector] +++ OK, passed 100 tests.
  11584. 697.88 s [vector] unstreamR ~= vunstream (exact): OK
  11585. 697.88 s [vector] +++ OK, passed 100 tests.
  11586. 697.88 s [vector] unstreamR ~= vunstream (unknown): OK
  11587. 697.88 s [vector] +++ OK, passed 100 tests.
  11588. 697.88 s [vector] Tests.Vector.Unboxed
  11589. 697.88 s [vector] ()
  11590. 697.88 s [vector] fromList.toList == id: OK
  11591. 697.88 s [vector] +++ OK, passed 100 tests.
  11592. 697.88 s [vector] toList.fromList == id: OK
  11593. 697.88 s [vector] +++ OK, passed 100 tests.
  11594. 697.88 s [vector] unstream.stream == id: OK
  11595. 697.88 s [vector] +++ OK, passed 100 tests.
  11596. 697.88 s [vector] stream.unstream == id: OK
  11597. 697.88 s [vector] +++ OK, passed 100 tests.
  11598. 697.88 s [vector] eq: OK
  11599. 697.88 s [vector] +++ OK, passed 100 tests.
  11600. 697.88 s [vector] length: OK
  11601. 697.88 s [vector] +++ OK, passed 100 tests.
  11602. 697.88 s [vector] null: OK
  11603. 697.88 s [vector] +++ OK, passed 100 tests.
  11604. 697.88 s [vector] index: OK
  11605. 697.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11606. 697.88 s [vector] safeIndex: OK
  11607. 697.88 s [vector] +++ OK, passed 100 tests.
  11608. 697.88 s [vector] head: OK
  11609. 697.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11610. 697.88 s [vector] last: OK
  11611. 697.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11612. 697.88 s [vector] unsafeIndex: OK
  11613. 697.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11614. 697.88 s [vector] unsafeHead: OK
  11615. 697.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11616. 697.88 s [vector] unsafeLast: OK
  11617. 697.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11618. 697.88 s [vector] slice: OK
  11619. 697.88 s [vector] +++ OK, passed 100 tests.
  11620. 697.88 s [vector] init: OK
  11621. 697.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11622. 697.88 s [vector] tail: OK
  11623. 697.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11624. 697.88 s [vector] take: OK
  11625. 697.88 s [vector] +++ OK, passed 100 tests.
  11626. 697.88 s [vector] drop: OK
  11627. 697.88 s [vector] +++ OK, passed 100 tests.
  11628. 697.88 s [vector] splitAt: OK
  11629. 697.88 s [vector] +++ OK, passed 100 tests.
  11630. 697.88 s [vector] empty: OK
  11631. 697.88 s [vector] +++ OK, passed 100 tests.
  11632. 697.88 s [vector] singleton: OK
  11633. 697.88 s [vector] +++ OK, passed 100 tests.
  11634. 697.88 s [vector] replicate: OK
  11635. 697.88 s [vector] +++ OK, passed 100 tests.
  11636. 697.88 s [vector] generate: OK
  11637. 697.88 s [vector] +++ OK, passed 100 tests.
  11638. 697.89 s [vector] iterateN: OK
  11639. 697.89 s [vector] +++ OK, passed 100 tests.
  11640. 697.91 s [vector] iterateNM: OK (0.01s)
  11641. 697.91 s [vector] +++ OK, passed 100 tests.
  11642. 697.93 s [vector] generateM: OK (0.02s)
  11643. 697.93 s [vector] +++ OK, passed 100 tests.
  11644. 697.93 s [vector] replicateM: OK (0.01s)
  11645. 697.93 s [vector] +++ OK, passed 100 tests.
  11646. 697.93 s [vector] create: OK
  11647. 697.93 s [vector] +++ OK, passed 100 tests.
  11648. 697.93 s [vector] createT: OK
  11649. 697.93 s [vector] +++ OK, passed 100 tests.
  11650. 697.93 s [vector] unfoldr: OK
  11651. 697.93 s [vector] +++ OK, passed 100 tests.
  11652. 697.93 s [vector] unfoldrN: OK
  11653. 697.93 s [vector] +++ OK, passed 100 tests.
  11654. 697.93 s [vector] unfoldrExactN: OK
  11655. 697.93 s [vector] +++ OK, passed 100 tests.
  11656. 697.94 s [vector] unfoldrM: OK
  11657. 697.94 s [vector] +++ OK, passed 100 tests.
  11658. 697.95 s [vector] unfoldrNM: OK
  11659. 697.95 s [vector] +++ OK, passed 100 tests.
  11660. 697.95 s [vector] unfoldrExactNM: OK
  11661. 697.95 s [vector] +++ OK, passed 100 tests.
  11662. 697.95 s [vector] constructN: OK
  11663. 697.95 s [vector] +++ OK, passed 100 tests.
  11664. 697.95 s [vector] constructrN: OK
  11665. 697.95 s [vector] +++ OK, passed 100 tests.
  11666. 697.95 s [vector] cons: OK
  11667. 697.95 s [vector] +++ OK, passed 100 tests.
  11668. 697.95 s [vector] snoc: OK
  11669. 697.96 s [vector] +++ OK, passed 100 tests.
  11670. 697.96 s [vector] append: OK
  11671. 697.96 s [vector] +++ OK, passed 100 tests.
  11672. 697.96 s [vector] concat: OK
  11673. 697.96 s [vector] +++ OK, passed 100 tests.
  11674. 697.96 s [vector] force: OK
  11675. 697.96 s [vector] +++ OK, passed 100 tests.
  11676. 697.96 s [vector] upd: OK
  11677. 697.96 s [vector] +++ OK, passed 100 tests.
  11678. 697.97 s [vector] accum: OK
  11679. 697.97 s [vector] +++ OK, passed 100 tests.
  11680. 697.97 s [vector] reverse: OK
  11681. 697.97 s [vector] +++ OK, passed 100 tests.
  11682. 697.97 s [vector] backpermute: OK
  11683. 697.97 s [vector] +++ OK, passed 100 tests.
  11684. 697.97 s [vector] map: OK
  11685. 697.97 s [vector] +++ OK, passed 100 tests.
  11686. 697.97 s [vector] imap: OK
  11687. 697.97 s [vector] +++ OK, passed 100 tests.
  11688. 697.97 s [vector] concatMap: OK
  11689. 697.97 s [vector] +++ OK, passed 100 tests.
  11690. 697.97 s [vector] mapM: OK
  11691. 697.97 s [vector] +++ OK, passed 100 tests.
  11692. 697.98 s [vector] mapM_: OK
  11693. 697.98 s [vector] +++ OK, passed 100 tests.
  11694. 697.99 s [vector] forM: OK
  11695. 697.99 s [vector] +++ OK, passed 100 tests.
  11696. 698.00 s [vector] forM_: OK
  11697. 698.00 s [vector] +++ OK, passed 100 tests.
  11698. 698.00 s [vector] imapM: OK
  11699. 698.00 s [vector] +++ OK, passed 100 tests.
  11700. 698.00 s [vector] imapM_: OK
  11701. 698.00 s [vector] +++ OK, passed 100 tests.
  11702. 698.00 s [vector] zipWith: OK
  11703. 698.00 s [vector] +++ OK, passed 100 tests.
  11704. 698.00 s [vector] zipWith3: OK
  11705. 698.00 s [vector] +++ OK, passed 100 tests.
  11706. 698.01 s [vector] izipWith: OK
  11707. 698.01 s [vector] +++ OK, passed 100 tests.
  11708. 698.01 s [vector] izipWith3: OK
  11709. 698.01 s [vector] +++ OK, passed 100 tests.
  11710. 698.01 s [vector] izipWithM: OK
  11711. 698.02 s [vector] +++ OK, passed 100 tests.
  11712. 698.02 s [vector] izipWithM_: OK
  11713. 698.02 s [vector] +++ OK, passed 100 tests.
  11714. 698.02 s [vector] zipWithM: OK
  11715. 698.02 s [vector] +++ OK, passed 100 tests.
  11716. 698.02 s [vector] zipWithM_: OK
  11717. 698.02 s [vector] +++ OK, passed 100 tests.
  11718. 698.02 s [vector] filter: OK
  11719. 698.02 s [vector] +++ OK, passed 100 tests.
  11720. 698.02 s [vector] ifilter: OK
  11721. 698.03 s [vector] +++ OK, passed 100 tests.
  11722. 698.04 s [vector] filterM: OK (0.02s)
  11723. 698.04 s [vector] +++ OK, passed 100 tests.
  11724. 698.04 s [vector] uniq: OK
  11725. 698.04 s [vector] +++ OK, passed 100 tests.
  11726. 698.04 s [vector] mapMaybe: OK
  11727. 698.04 s [vector] +++ OK, passed 100 tests.
  11728. 698.04 s [vector] imapMaybe: OK
  11729. 698.04 s [vector] +++ OK, passed 100 tests.
  11730. 698.04 s [vector] takeWhile: OK
  11731. 698.04 s [vector] +++ OK, passed 100 tests.
  11732. 698.04 s [vector] dropWhile: OK
  11733. 698.04 s [vector] +++ OK, passed 100 tests.
  11734. 698.04 s [vector] partition: OK
  11735. 698.04 s [vector] +++ OK, passed 100 tests.
  11736. 698.04 s [vector] partitionWith: OK
  11737. 698.04 s [vector] +++ OK, passed 100 tests.
  11738. 698.04 s [vector] span: OK
  11739. 698.04 s [vector] +++ OK, passed 100 tests.
  11740. 698.04 s [vector] break: OK
  11741. 698.04 s [vector] +++ OK, passed 100 tests.
  11742. 698.04 s [vector] spanR: OK
  11743. 698.04 s [vector] +++ OK, passed 100 tests.
  11744. 698.04 s [vector] breakR: OK
  11745. 698.04 s [vector] +++ OK, passed 100 tests.
  11746. 698.04 s [vector] groupBy: OK
  11747. 698.05 s [vector] +++ OK, passed 100 tests.
  11748. 698.05 s [vector] elem: OK
  11749. 698.05 s [vector] +++ OK, passed 100 tests.
  11750. 698.05 s [vector] notElem: OK
  11751. 698.05 s [vector] +++ OK, passed 100 tests.
  11752. 698.05 s [vector] find: OK
  11753. 698.05 s [vector] +++ OK, passed 100 tests.
  11754. 698.05 s [vector] findIndex: OK
  11755. 698.05 s [vector] +++ OK, passed 100 tests.
  11756. 698.05 s [vector] findIndexR: OK
  11757. 698.05 s [vector] +++ OK, passed 100 tests.
  11758. 698.05 s [vector] findIndices: OK
  11759. 698.05 s [vector] +++ OK, passed 100 tests.
  11760. 698.05 s [vector] elemIndex: OK
  11761. 698.05 s [vector] +++ OK, passed 100 tests.
  11762. 698.05 s [vector] elemIndices: OK
  11763. 698.05 s [vector] +++ OK, passed 100 tests.
  11764. 698.05 s [vector] foldl: OK
  11765. 698.05 s [vector] +++ OK, passed 100 tests.
  11766. 698.05 s [vector] foldl1: OK
  11767. 698.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11768. 698.05 s [vector] foldl': OK
  11769. 698.05 s [vector] +++ OK, passed 100 tests.
  11770. 698.05 s [vector] foldl1': OK
  11771. 698.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11772. 698.05 s [vector] foldr: OK
  11773. 698.05 s [vector] +++ OK, passed 100 tests.
  11774. 698.05 s [vector] foldr1: OK
  11775. 698.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11776. 698.05 s [vector] foldr': OK
  11777. 698.05 s [vector] +++ OK, passed 100 tests.
  11778. 698.05 s [vector] foldr1': OK
  11779. 698.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11780. 698.06 s [vector] ifoldl: OK
  11781. 698.06 s [vector] +++ OK, passed 100 tests.
  11782. 698.06 s [vector] ifoldl': OK
  11783. 698.06 s [vector] +++ OK, passed 100 tests.
  11784. 698.06 s [vector] ifoldr: OK
  11785. 698.07 s [vector] +++ OK, passed 100 tests.
  11786. 698.07 s [vector] ifoldr': OK
  11787. 698.07 s [vector] +++ OK, passed 100 tests.
  11788. 698.07 s [vector] ifoldM: OK
  11789. 698.07 s [vector] +++ OK, passed 100 tests.
  11790. 698.07 s [vector] ifoldM': OK
  11791. 698.07 s [vector] +++ OK, passed 100 tests.
  11792. 698.07 s [vector] ifoldM_: OK
  11793. 698.07 s [vector] +++ OK, passed 100 tests.
  11794. 698.07 s [vector] ifoldM'_: OK
  11795. 698.07 s [vector] +++ OK, passed 100 tests.
  11796. 698.07 s [vector] all: OK
  11797. 698.07 s [vector] +++ OK, passed 100 tests.
  11798. 698.08 s [vector] any: OK
  11799. 698.08 s [vector] +++ OK, passed 100 tests.
  11800. 698.08 s [vector] prescanl: OK
  11801. 698.08 s [vector] +++ OK, passed 100 tests.
  11802. 698.08 s [vector] prescanl': OK
  11803. 698.08 s [vector] +++ OK, passed 100 tests.
  11804. 698.08 s [vector] postscanl: OK
  11805. 698.08 s [vector] +++ OK, passed 100 tests.
  11806. 698.08 s [vector] postscanl': OK
  11807. 698.08 s [vector] +++ OK, passed 100 tests.
  11808. 698.08 s [vector] scanl: OK
  11809. 698.08 s [vector] +++ OK, passed 100 tests.
  11810. 698.08 s [vector] scanl': OK
  11811. 698.08 s [vector] +++ OK, passed 100 tests.
  11812. 698.08 s [vector] scanl1: OK
  11813. 698.08 s [vector] +++ OK, passed 100 tests.
  11814. 698.08 s [vector] scanl1': OK
  11815. 698.08 s [vector] +++ OK, passed 100 tests.
  11816. 698.08 s [vector] iscanl: OK
  11817. 698.08 s [vector] +++ OK, passed 100 tests.
  11818. 698.08 s [vector] iscanl': OK
  11819. 698.08 s [vector] +++ OK, passed 100 tests.
  11820. 698.08 s [vector] prescanr: OK
  11821. 698.08 s [vector] +++ OK, passed 100 tests.
  11822. 698.08 s [vector] prescanr': OK
  11823. 698.08 s [vector] +++ OK, passed 100 tests.
  11824. 698.09 s [vector] postscanr: OK
  11825. 698.09 s [vector] +++ OK, passed 100 tests.
  11826. 698.09 s [vector] postscanr': OK
  11827. 698.09 s [vector] +++ OK, passed 100 tests.
  11828. 698.09 s [vector] scanr: OK
  11829. 698.09 s [vector] +++ OK, passed 100 tests.
  11830. 698.09 s [vector] scanr': OK
  11831. 698.09 s [vector] +++ OK, passed 100 tests.
  11832. 698.09 s [vector] scanr1: OK
  11833. 698.09 s [vector] +++ OK, passed 100 tests.
  11834. 698.09 s [vector] scanr1': OK
  11835. 698.09 s [vector] +++ OK, passed 100 tests.
  11836. 698.09 s [vector] iscanr: OK
  11837. 698.10 s [vector] +++ OK, passed 100 tests.
  11838. 698.11 s [vector] iscanr': OK
  11839. 698.11 s [vector] +++ OK, passed 100 tests.
  11840. 698.11 s [vector] mut_read: OK
  11841. 698.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11842. 698.11 s [vector] mut_write: OK
  11843. 698.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11844. 698.11 s [vector] mut_modify: OK
  11845. 698.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11846. 698.11 s [vector] mut_generate: OK
  11847. 698.11 s [vector] +++ OK, passed 100 tests.
  11848. 698.11 s [vector] mut_generateM: OK
  11849. 698.11 s [vector] +++ OK, passed 100 tests.
  11850. 698.11 s [vector] mut_mapM_: OK
  11851. 698.11 s [vector] +++ OK, passed 100 tests.
  11852. 698.11 s [vector] mut_imapM_: OK
  11853. 698.11 s [vector] +++ OK, passed 100 tests.
  11854. 698.12 s [vector] mut_forM_: OK
  11855. 698.12 s [vector] +++ OK, passed 100 tests.
  11856. 698.13 s [vector] mut_iforM_: OK
  11857. 698.13 s [vector] +++ OK, passed 100 tests.
  11858. 698.13 s [vector] mut_foldr: OK
  11859. 698.13 s [vector] +++ OK, passed 100 tests.
  11860. 698.13 s [vector] mut_foldr': OK
  11861. 698.13 s [vector] +++ OK, passed 100 tests.
  11862. 698.13 s [vector] mut_foldl: OK
  11863. 698.13 s [vector] +++ OK, passed 100 tests.
  11864. 698.13 s [vector] mut_foldl': OK
  11865. 698.13 s [vector] +++ OK, passed 100 tests.
  11866. 698.13 s [vector] mut_ifoldr: OK
  11867. 698.13 s [vector] +++ OK, passed 100 tests.
  11868. 698.13 s [vector] mut_ifoldr': OK
  11869. 698.13 s [vector] +++ OK, passed 100 tests.
  11870. 698.13 s [vector] mut_ifoldl: OK
  11871. 698.13 s [vector] +++ OK, passed 100 tests.
  11872. 698.14 s [vector] mut_ifoldl': OK
  11873. 698.14 s [vector] +++ OK, passed 100 tests.
  11874. 698.14 s [vector] mut_foldM: OK
  11875. 698.14 s [vector] +++ OK, passed 100 tests.
  11876. 698.14 s [vector] mut_foldM': OK
  11877. 698.14 s [vector] +++ OK, passed 100 tests.
  11878. 698.14 s [vector] mut_foldrM: OK
  11879. 698.14 s [vector] +++ OK, passed 100 tests.
  11880. 698.14 s [vector] mut_foldrM': OK
  11881. 698.14 s [vector] +++ OK, passed 100 tests.
  11882. 698.14 s [vector] mut_ifoldM: OK
  11883. 698.14 s [vector] +++ OK, passed 100 tests.
  11884. 698.14 s [vector] mut_ifoldM': OK
  11885. 698.14 s [vector] +++ OK, passed 100 tests.
  11886. 698.14 s [vector] mut_ifoldrM: OK
  11887. 698.14 s [vector] +++ OK, passed 100 tests.
  11888. 698.14 s [vector] mut_ifoldrM': OK
  11889. 698.14 s [vector] +++ OK, passed 100 tests.
  11890. 698.14 s [vector] compare: OK
  11891. 698.14 s [vector] +++ OK, passed 100 tests.
  11892. 698.14 s [vector] maximum: OK
  11893. 698.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11894. 698.14 s [vector] minimum: OK
  11895. 698.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11896. 698.14 s [vector] minIndex: OK
  11897. 698.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11898. 698.14 s [vector] maxIndex: OK
  11899. 698.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11900. 698.14 s [vector] maximumBy: OK
  11901. 698.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11902. 698.14 s [vector] minimumBy: OK
  11903. 698.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11904. 698.14 s [vector] maximumOn: OK
  11905. 698.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11906. 698.14 s [vector] minimumOn: OK
  11907. 698.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11908. 698.14 s [vector] maxIndexBy: OK
  11909. 698.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11910. 698.14 s [vector] minIndexBy: OK
  11911. 698.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11912. 698.14 s [vector] ListFirstMaxIndexWins: OK
  11913. 698.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11914. 698.14 s [vector] FalseListFirstMaxIndexWins: OK
  11915. 698.15 s [vector] +++ OK, failed as expected. (after 1 test):
  11916. 698.15 s [vector] Exception:
  11917. 698.15 s [vector] Prelude.foldr1: empty list
  11918. 698.15 s [vector] CallStack (from HasCallStack):
  11919. 698.15 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11920. 698.15 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11921. 698.15 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11922. 698.15 s [vector] []
  11923. 698.15 s [vector] zip: OK
  11924. 698.15 s [vector] +++ OK, passed 100 tests.
  11925. 698.15 s [vector] zip3: OK
  11926. 698.15 s [vector] +++ OK, passed 100 tests.
  11927. 698.15 s [vector] unzip: OK
  11928. 698.15 s [vector] +++ OK, passed 100 tests.
  11929. 698.15 s [vector] unzip3: OK
  11930. 698.15 s [vector] +++ OK, passed 100 tests.
  11931. 698.15 s [vector] indexed: OK
  11932. 698.15 s [vector] +++ OK, passed 100 tests.
  11933. 698.15 s [vector] update: OK
  11934. 698.15 s [vector] +++ OK, passed 100 tests.
  11935. 698.15 s [vector] mempty: OK
  11936. 698.15 s [vector] +++ OK, passed 100 tests.
  11937. 698.16 s [vector] mappend: OK
  11938. 698.16 s [vector] +++ OK, passed 100 tests.
  11939. 698.16 s [vector] mconcat: OK
  11940. 698.16 s [vector] +++ OK, passed 100 tests.
  11941. 698.16 s [vector] glength: OK
  11942. 698.16 s [vector] +++ OK, passed 100 tests.
  11943. 698.16 s [vector] (Bool)
  11944. 698.16 s [vector] fromList.toList == id: OK
  11945. 698.16 s [vector] +++ OK, passed 100 tests.
  11946. 698.16 s [vector] toList.fromList == id: OK
  11947. 698.16 s [vector] +++ OK, passed 100 tests.
  11948. 698.16 s [vector] unstream.stream == id: OK
  11949. 698.16 s [vector] +++ OK, passed 100 tests.
  11950. 698.16 s [vector] stream.unstream == id: OK
  11951. 698.16 s [vector] +++ OK, passed 100 tests.
  11952. 698.16 s [vector] eq: OK
  11953. 698.16 s [vector] +++ OK, passed 100 tests.
  11954. 698.16 s [vector] length: OK
  11955. 698.16 s [vector] +++ OK, passed 100 tests.
  11956. 698.17 s [vector] null: OK
  11957. 698.17 s [vector] +++ OK, passed 100 tests.
  11958. 698.17 s [vector] index: OK
  11959. 698.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11960. 698.17 s [vector] safeIndex: OK
  11961. 698.17 s [vector] +++ OK, passed 100 tests.
  11962. 698.17 s [vector] head: OK
  11963. 698.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11964. 698.17 s [vector] last: OK
  11965. 698.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11966. 698.17 s [vector] unsafeIndex: OK
  11967. 698.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11968. 698.17 s [vector] unsafeHead: OK
  11969. 698.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11970. 698.17 s [vector] unsafeLast: OK
  11971. 698.17 s [vector] +++ OK, passed 100 tests; 25 discarded.
  11972. 698.17 s [vector] slice: OK
  11973. 698.17 s [vector] +++ OK, passed 100 tests.
  11974. 698.17 s [vector] init: OK
  11975. 698.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11976. 698.17 s [vector] tail: OK
  11977. 698.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11978. 698.17 s [vector] take: OK
  11979. 698.17 s [vector] +++ OK, passed 100 tests.
  11980. 698.17 s [vector] drop: OK
  11981. 698.17 s [vector] +++ OK, passed 100 tests.
  11982. 698.17 s [vector] splitAt: OK
  11983. 698.17 s [vector] +++ OK, passed 100 tests.
  11984. 698.17 s [vector] empty: OK
  11985. 698.17 s [vector] +++ OK, passed 100 tests.
  11986. 698.19 s [vector] singleton: OK
  11987. 698.19 s [vector] +++ OK, passed 100 tests.
  11988. 698.19 s [vector] replicate: OK
  11989. 698.19 s [vector] +++ OK, passed 100 tests.
  11990. 698.19 s [vector] generate: OK
  11991. 698.19 s [vector] +++ OK, passed 100 tests.
  11992. 698.19 s [vector] iterateN: OK
  11993. 698.19 s [vector] +++ OK, passed 100 tests.
  11994. 698.20 s [vector] iterateNM: OK (0.03s)
  11995. 698.20 s [vector] +++ OK, passed 100 tests.
  11996. 698.23 s [vector] generateM: OK (0.01s)
  11997. 698.23 s [vector] +++ OK, passed 100 tests.
  11998. 698.23 s [vector] replicateM: OK
  11999. 698.23 s [vector] +++ OK, passed 100 tests.
  12000. 698.23 s [vector] create: OK
  12001. 698.23 s [vector] +++ OK, passed 100 tests.
  12002. 698.23 s [vector] createT: OK
  12003. 698.23 s [vector] +++ OK, passed 100 tests.
  12004. 698.23 s [vector] unfoldr: OK
  12005. 698.23 s [vector] +++ OK, passed 100 tests.
  12006. 698.23 s [vector] unfoldrN: OK
  12007. 698.23 s [vector] +++ OK, passed 100 tests.
  12008. 698.23 s [vector] unfoldrExactN: OK
  12009. 698.23 s [vector] +++ OK, passed 100 tests.
  12010. 698.24 s [vector] unfoldrM: OK
  12011. 698.24 s [vector] +++ OK, passed 100 tests.
  12012. 698.24 s [vector] unfoldrNM: OK
  12013. 698.25 s [vector] +++ OK, passed 100 tests.
  12014. 698.25 s [vector] unfoldrExactNM: OK (0.01s)
  12015. 698.25 s [vector] +++ OK, passed 100 tests.
  12016. 698.25 s [vector] constructN: OK
  12017. 698.25 s [vector] +++ OK, passed 100 tests.
  12018. 698.25 s [vector] constructrN: OK
  12019. 698.25 s [vector] +++ OK, passed 100 tests.
  12020. 698.25 s [vector] cons: OK
  12021. 698.25 s [vector] +++ OK, passed 100 tests.
  12022. 698.25 s [vector] snoc: OK
  12023. 698.25 s [vector] +++ OK, passed 100 tests.
  12024. 698.27 s [vector] append: OK
  12025. 698.27 s [vector] +++ OK, passed 100 tests.
  12026. 698.27 s [vector] concat: OK (0.01s)
  12027. 698.27 s [vector] +++ OK, passed 100 tests.
  12028. 698.27 s [vector] force: OK
  12029. 698.27 s [vector] +++ OK, passed 100 tests.
  12030. 698.27 s [vector] upd: OK
  12031. 698.27 s [vector] +++ OK, passed 100 tests.
  12032. 698.27 s [vector] accum: OK
  12033. 698.27 s [vector] +++ OK, passed 100 tests.
  12034. 698.28 s [vector] reverse: OK
  12035. 698.28 s [vector] +++ OK, passed 100 tests.
  12036. 698.28 s [vector] backpermute: OK
  12037. 698.28 s [vector] +++ OK, passed 100 tests.
  12038. 698.28 s [vector] map: OK
  12039. 698.28 s [vector] +++ OK, passed 100 tests.
  12040. 698.28 s [vector] imap: OK
  12041. 698.28 s [vector] +++ OK, passed 100 tests.
  12042. 698.28 s [vector] concatMap: OK
  12043. 698.28 s [vector] +++ OK, passed 100 tests.
  12044. 698.28 s [vector] mapM: OK
  12045. 698.28 s [vector] +++ OK, passed 100 tests.
  12046. 698.29 s [vector] mapM_: OK
  12047. 698.29 s [vector] +++ OK, passed 100 tests.
  12048. 698.30 s [vector] forM: OK
  12049. 698.30 s [vector] +++ OK, passed 100 tests.
  12050. 698.31 s [vector] forM_: OK (0.01s)
  12051. 698.31 s [vector] +++ OK, passed 100 tests.
  12052. 698.31 s [vector] imapM: OK
  12053. 698.31 s [vector] +++ OK, passed 100 tests.
  12054. 698.31 s [vector] imapM_: OK
  12055. 698.31 s [vector] +++ OK, passed 100 tests.
  12056. 698.31 s [vector] zipWith: OK
  12057. 698.31 s [vector] +++ OK, passed 100 tests.
  12058. 698.31 s [vector] zipWith3: OK
  12059. 698.32 s [vector] +++ OK, passed 100 tests.
  12060. 698.32 s [vector] izipWith: OK
  12061. 698.32 s [vector] +++ OK, passed 100 tests.
  12062. 698.32 s [vector] izipWith3: OK
  12063. 698.32 s [vector] +++ OK, passed 100 tests.
  12064. 698.32 s [vector] izipWithM: OK
  12065. 698.33 s [vector] +++ OK, passed 100 tests.
  12066. 698.33 s [vector] izipWithM_: OK
  12067. 698.33 s [vector] +++ OK, passed 100 tests.
  12068. 698.34 s [vector] zipWithM: OK
  12069. 698.34 s [vector] +++ OK, passed 100 tests.
  12070. 698.34 s [vector] zipWithM_: OK
  12071. 698.34 s [vector] +++ OK, passed 100 tests.
  12072. 698.34 s [vector] filter: OK
  12073. 698.34 s [vector] +++ OK, passed 100 tests.
  12074. 698.34 s [vector] ifilter: OK
  12075. 698.35 s [vector] +++ OK, passed 100 tests.
  12076. 698.37 s [vector] filterM: OK (0.03s)
  12077. 698.37 s [vector] +++ OK, passed 100 tests.
  12078. 698.37 s [vector] uniq: OK
  12079. 698.37 s [vector] +++ OK, passed 100 tests.
  12080. 698.37 s [vector] mapMaybe: OK
  12081. 698.37 s [vector] +++ OK, passed 100 tests.
  12082. 698.37 s [vector] imapMaybe: OK
  12083. 698.67 s [vector] +++ OK, passed 100 tests.
  12084. 698.67 s [vector] takeWhile: OK
  12085. 698.67 s [vector] +++ OK, passed 100 tests.
  12086. 698.67 s [vector] dropWhile: OK
  12087. 698.67 s [vector] +++ OK, passed 100 tests.
  12088. 698.67 s [vector] partition: OK
  12089. 698.67 s [vector] +++ OK, passed 100 tests.
  12090. 698.67 s [vector] partitionWith: OK
  12091. 698.67 s [vector] +++ OK, passed 100 tests.
  12092. 698.67 s [vector] span: OK
  12093. 698.67 s [vector] +++ OK, passed 100 tests.
  12094. 698.67 s [vector] break: OK
  12095. 698.67 s [vector] +++ OK, passed 100 tests.
  12096. 698.67 s [vector] spanR: OK
  12097. 698.67 s [vector] +++ OK, passed 100 tests.
  12098. 698.67 s [vector] breakR: OK
  12099. 698.67 s [vector] +++ OK, passed 100 tests.
  12100. 698.67 s [vector] groupBy: OK
  12101. 698.67 s [vector] +++ OK, passed 100 tests.
  12102. 698.68 s [vector] elem: OK
  12103. 698.68 s [vector] +++ OK, passed 100 tests.
  12104. 698.68 s [vector] notElem: OK
  12105. 698.68 s [vector] +++ OK, passed 100 tests.
  12106. 698.68 s [vector] find: OK
  12107. 698.68 s [vector] +++ OK, passed 100 tests.
  12108. 698.68 s [vector] findIndex: OK
  12109. 698.68 s [vector] +++ OK, passed 100 tests.
  12110. 698.68 s [vector] findIndexR: OK
  12111. 698.68 s [vector] +++ OK, passed 100 tests.
  12112. 698.68 s [vector] findIndices: OK
  12113. 698.68 s [vector] +++ OK, passed 100 tests.
  12114. 698.68 s [vector] elemIndex: OK
  12115. 698.68 s [vector] +++ OK, passed 100 tests.
  12116. 698.68 s [vector] elemIndices: OK
  12117. 698.68 s [vector] +++ OK, passed 100 tests.
  12118. 698.68 s [vector] foldl: OK
  12119. 698.68 s [vector] +++ OK, passed 100 tests.
  12120. 698.68 s [vector] foldl1: OK
  12121. 698.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12122. 698.68 s [vector] foldl': OK
  12123. 698.68 s [vector] +++ OK, passed 100 tests.
  12124. 698.68 s [vector] foldl1': OK
  12125. 698.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12126. 698.68 s [vector] foldr: OK
  12127. 698.68 s [vector] +++ OK, passed 100 tests.
  12128. 698.68 s [vector] foldr1: OK
  12129. 698.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12130. 698.68 s [vector] foldr': OK
  12131. 698.68 s [vector] +++ OK, passed 100 tests.
  12132. 698.68 s [vector] foldr1': OK
  12133. 698.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12134. 698.68 s [vector] ifoldl: OK
  12135. 698.68 s [vector] +++ OK, passed 100 tests.
  12136. 698.68 s [vector] ifoldl': OK
  12137. 698.68 s [vector] +++ OK, passed 100 tests.
  12138. 698.68 s [vector] ifoldr: OK
  12139. 698.68 s [vector] +++ OK, passed 100 tests.
  12140. 698.68 s [vector] ifoldr': OK
  12141. 698.68 s [vector] +++ OK, passed 100 tests.
  12142. 698.68 s [vector] ifoldM: OK
  12143. 698.68 s [vector] +++ OK, passed 100 tests.
  12144. 698.68 s [vector] ifoldM': OK
  12145. 698.68 s [vector] +++ OK, passed 100 tests.
  12146. 698.68 s [vector] ifoldM_: OK (0.01s)
  12147. 698.68 s [vector] +++ OK, passed 100 tests.
  12148. 698.68 s [vector] ifoldM'_: OK
  12149. 698.68 s [vector] +++ OK, passed 100 tests.
  12150. 698.68 s [vector] all: OK
  12151. 698.68 s [vector] +++ OK, passed 100 tests.
  12152. 698.68 s [vector] any: OK
  12153. 698.68 s [vector] +++ OK, passed 100 tests.
  12154. 698.68 s [vector] prescanl: OK
  12155. 698.68 s [vector] +++ OK, passed 100 tests.
  12156. 698.68 s [vector] prescanl': OK
  12157. 698.68 s [vector] +++ OK, passed 100 tests.
  12158. 698.68 s [vector] postscanl: OK
  12159. 698.68 s [vector] +++ OK, passed 100 tests.
  12160. 698.68 s [vector] postscanl': OK
  12161. 698.68 s [vector] +++ OK, passed 100 tests.
  12162. 698.68 s [vector] scanl: OK
  12163. 698.68 s [vector] +++ OK, passed 100 tests.
  12164. 698.68 s [vector] scanl': OK
  12165. 698.68 s [vector] +++ OK, passed 100 tests.
  12166. 698.68 s [vector] scanl1: OK
  12167. 698.68 s [vector] +++ OK, passed 100 tests.
  12168. 698.68 s [vector] scanl1': OK
  12169. 698.68 s [vector] +++ OK, passed 100 tests.
  12170. 698.68 s [vector] iscanl: OK
  12171. 698.68 s [vector] +++ OK, passed 100 tests.
  12172. 698.68 s [vector] iscanl': OK
  12173. 698.68 s [vector] +++ OK, passed 100 tests.
  12174. 698.68 s [vector] prescanr: OK
  12175. 698.68 s [vector] +++ OK, passed 100 tests.
  12176. 698.68 s [vector] prescanr': OK
  12177. 698.68 s [vector] +++ OK, passed 100 tests.
  12178. 698.68 s [vector] postscanr: OK
  12179. 698.68 s [vector] +++ OK, passed 100 tests.
  12180. 698.68 s [vector] postscanr': OK
  12181. 698.68 s [vector] +++ OK, passed 100 tests.
  12182. 698.68 s [vector] scanr: OK
  12183. 698.68 s [vector] +++ OK, passed 100 tests.
  12184. 698.68 s [vector] scanr': OK
  12185. 698.68 s [vector] +++ OK, passed 100 tests.
  12186. 698.68 s [vector] scanr1: OK
  12187. 698.68 s [vector] +++ OK, passed 100 tests.
  12188. 698.68 s [vector] scanr1': OK
  12189. 698.68 s [vector] +++ OK, passed 100 tests.
  12190. 698.68 s [vector] iscanr: OK
  12191. 698.68 s [vector] +++ OK, passed 100 tests.
  12192. 698.68 s [vector] iscanr': OK
  12193. 698.68 s [vector] +++ OK, passed 100 tests.
  12194. 698.68 s [vector] mut_read: OK
  12195. 698.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12196. 698.68 s [vector] mut_write: OK
  12197. 698.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12198. 698.68 s [vector] mut_modify: OK
  12199. 698.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12200. 698.68 s [vector] mut_generate: OK
  12201. 698.68 s [vector] +++ OK, passed 100 tests.
  12202. 698.68 s [vector] mut_generateM: OK
  12203. 698.68 s [vector] +++ OK, passed 100 tests.
  12204. 698.68 s [vector] mut_mapM_: OK (0.01s)
  12205. 698.68 s [vector] +++ OK, passed 100 tests.
  12206. 698.68 s [vector] mut_imapM_: OK (0.01s)
  12207. 698.68 s [vector] +++ OK, passed 100 tests.
  12208. 698.68 s [vector] mut_forM_: OK
  12209. 698.68 s [vector] +++ OK, passed 100 tests.
  12210. 698.68 s [vector] mut_iforM_: OK
  12211. 698.68 s [vector] +++ OK, passed 100 tests.
  12212. 698.68 s [vector] mut_foldr: OK
  12213. 698.68 s [vector] +++ OK, passed 100 tests.
  12214. 698.68 s [vector] mut_foldr': OK
  12215. 698.68 s [vector] +++ OK, passed 100 tests.
  12216. 698.68 s [vector] mut_foldl: OK
  12217. 698.68 s [vector] +++ OK, passed 100 tests.
  12218. 698.68 s [vector] mut_foldl': OK
  12219. 698.68 s [vector] +++ OK, passed 100 tests.
  12220. 698.68 s [vector] mut_ifoldr: OK
  12221. 698.68 s [vector] +++ OK, passed 100 tests.
  12222. 698.68 s [vector] mut_ifoldr': OK
  12223. 698.68 s [vector] +++ OK, passed 100 tests.
  12224. 698.68 s [vector] mut_ifoldl: OK
  12225. 698.68 s [vector] +++ OK, passed 100 tests.
  12226. 698.68 s [vector] mut_ifoldl': OK
  12227. 698.68 s [vector] +++ OK, passed 100 tests.
  12228. 698.68 s [vector] mut_foldM: OK
  12229. 698.68 s [vector] +++ OK, passed 100 tests.
  12230. 698.68 s [vector] mut_foldM': OK
  12231. 698.68 s [vector] +++ OK, passed 100 tests.
  12232. 698.68 s [vector] mut_foldrM: OK
  12233. 698.68 s [vector] +++ OK, passed 100 tests.
  12234. 698.68 s [vector] mut_foldrM': OK
  12235. 698.68 s [vector] +++ OK, passed 100 tests.
  12236. 698.68 s [vector] mut_ifoldM: OK
  12237. 698.68 s [vector] +++ OK, passed 100 tests.
  12238. 698.68 s [vector] mut_ifoldM': OK
  12239. 698.68 s [vector] +++ OK, passed 100 tests.
  12240. 698.68 s [vector] mut_ifoldrM: OK
  12241. 698.68 s [vector] +++ OK, passed 100 tests.
  12242. 698.68 s [vector] mut_ifoldrM': OK
  12243. 698.68 s [vector] +++ OK, passed 100 tests.
  12244. 698.68 s [vector] compare: OK
  12245. 698.68 s [vector] +++ OK, passed 100 tests.
  12246. 698.68 s [vector] maximum: OK
  12247. 698.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12248. 698.68 s [vector] minimum: OK
  12249. 698.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12250. 698.68 s [vector] minIndex: OK
  12251. 698.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12252. 698.68 s [vector] maxIndex: OK
  12253. 698.68 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12254. 698.68 s [vector] maximumBy: OK
  12255. 698.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12256. 698.68 s [vector] minimumBy: OK
  12257. 698.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12258. 698.68 s [vector] maximumOn: OK
  12259. 698.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12260. 698.68 s [vector] minimumOn: OK
  12261. 698.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12262. 698.68 s [vector] maxIndexBy: OK
  12263. 698.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12264. 698.68 s [vector] minIndexBy: OK
  12265. 698.68 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12266. 698.68 s [vector] ListFirstMaxIndexWins: OK
  12267. 698.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12268. 698.68 s [vector] FalseListFirstMaxIndexWins: OK
  12269. 698.68 s [vector] +++ OK, failed as expected. (after 1 test):
  12270. 698.68 s [vector] Exception:
  12271. 698.68 s [vector] Prelude.foldr1: empty list
  12272. 698.68 s [vector] CallStack (from HasCallStack):
  12273. 698.68 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12274. 698.68 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12275. 698.68 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12276. 698.68 s [vector] []
  12277. 698.68 s [vector] zip: OK
  12278. 698.68 s [vector] +++ OK, passed 100 tests.
  12279. 698.68 s [vector] zip3: OK
  12280. 698.68 s [vector] +++ OK, passed 100 tests.
  12281. 698.68 s [vector] unzip: OK
  12282. 698.68 s [vector] +++ OK, passed 100 tests.
  12283. 698.68 s [vector] unzip3: OK
  12284. 698.68 s [vector] +++ OK, passed 100 tests.
  12285. 698.68 s [vector] indexed: OK
  12286. 698.68 s [vector] +++ OK, passed 100 tests.
  12287. 698.68 s [vector] update: OK
  12288. 698.68 s [vector] +++ OK, passed 100 tests.
  12289. 698.68 s [vector] mempty: OK
  12290. 698.68 s [vector] +++ OK, passed 100 tests.
  12291. 698.68 s [vector] mappend: OK
  12292. 698.68 s [vector] +++ OK, passed 100 tests.
  12293. 698.68 s [vector] mconcat: OK (0.01s)
  12294. 698.68 s [vector] +++ OK, passed 100 tests.
  12295. 698.68 s [vector] glength: OK
  12296. 698.68 s [vector] +++ OK, passed 100 tests.
  12297. 698.68 s [vector] and: OK
  12298. 698.68 s [vector] +++ OK, passed 100 tests.
  12299. 698.68 s [vector] or: OK
  12300. 698.68 s [vector] +++ OK, passed 100 tests.
  12301. 698.68 s [vector] (Int)
  12302. 698.68 s [vector] fromList.toList == id: OK
  12303. 698.68 s [vector] +++ OK, passed 100 tests.
  12304. 698.68 s [vector] toList.fromList == id: OK
  12305. 698.68 s [vector] +++ OK, passed 100 tests.
  12306. 698.68 s [vector] unstream.stream == id: OK
  12307. 698.68 s [vector] +++ OK, passed 100 tests.
  12308. 698.68 s [vector] stream.unstream == id: OK
  12309. 698.68 s [vector] +++ OK, passed 100 tests.
  12310. 698.68 s [vector] eq: OK
  12311. 698.68 s [vector] +++ OK, passed 100 tests.
  12312. 698.68 s [vector] length: OK
  12313. 698.68 s [vector] +++ OK, passed 100 tests.
  12314. 698.68 s [vector] null: OK
  12315. 698.68 s [vector] +++ OK, passed 100 tests.
  12316. 698.68 s [vector] index: OK
  12317. 698.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12318. 698.68 s [vector] safeIndex: OK
  12319. 698.68 s [vector] +++ OK, passed 100 tests.
  12320. 698.68 s [vector] head: OK
  12321. 698.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12322. 698.68 s [vector] last: OK
  12323. 698.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12324. 698.68 s [vector] unsafeIndex: OK
  12325. 698.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12326. 698.68 s [vector] unsafeHead: OK
  12327. 698.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12328. 698.68 s [vector] unsafeLast: OK
  12329. 698.68 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12330. 698.68 s [vector] slice: OK
  12331. 698.68 s [vector] +++ OK, passed 100 tests.
  12332. 698.68 s [vector] init: OK
  12333. 698.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12334. 698.68 s [vector] tail: OK
  12335. 698.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12336. 698.68 s [vector] take: OK
  12337. 698.68 s [vector] +++ OK, passed 100 tests.
  12338. 698.68 s [vector] drop: OK
  12339. 698.68 s [vector] +++ OK, passed 100 tests.
  12340. 698.68 s [vector] splitAt: OK
  12341. 698.68 s [vector] +++ OK, passed 100 tests.
  12342. 698.68 s [vector] empty: OK
  12343. 698.68 s [vector] +++ OK, passed 100 tests.
  12344. 698.68 s [vector] singleton: OK
  12345. 698.68 s [vector] +++ OK, passed 100 tests.
  12346. 698.68 s [vector] replicate: OK
  12347. 698.68 s [vector] +++ OK, passed 100 tests.
  12348. 698.68 s [vector] generate: OK
  12349. 698.68 s [vector] +++ OK, passed 100 tests.
  12350. 698.68 s [vector] iterateN: OK
  12351. 698.68 s [vector] +++ OK, passed 100 tests.
  12352. 698.68 s [vector] iterateNM: OK (0.02s)
  12353. 698.68 s [vector] +++ OK, passed 100 tests.
  12354. 698.68 s [vector] generateM: OK (0.01s)
  12355. 698.68 s [vector] +++ OK, passed 100 tests.
  12356. 698.68 s [vector] replicateM: OK
  12357. 698.68 s [vector] +++ OK, passed 100 tests.
  12358. 698.68 s [vector] create: OK
  12359. 698.68 s [vector] +++ OK, passed 100 tests.
  12360. 698.68 s [vector] createT: OK
  12361. 698.68 s [vector] +++ OK, passed 100 tests.
  12362. 698.69 s [vector] unfoldr: OK
  12363. 698.69 s [vector] +++ OK, passed 100 tests.
  12364. 698.69 s [vector] unfoldrN: OK
  12365. 698.69 s [vector] +++ OK, passed 100 tests.
  12366. 698.69 s [vector] unfoldrExactN: OK
  12367. 698.69 s [vector] +++ OK, passed 100 tests.
  12368. 698.69 s [vector] unfoldrM: OK
  12369. 698.69 s [vector] +++ OK, passed 100 tests.
  12370. 698.69 s [vector] unfoldrNM: OK
  12371. 698.69 s [vector] +++ OK, passed 100 tests.
  12372. 698.69 s [vector] unfoldrExactNM: OK (0.02s)
  12373. 698.69 s [vector] +++ OK, passed 100 tests.
  12374. 698.69 s [vector] constructN: OK
  12375. 698.69 s [vector] +++ OK, passed 100 tests.
  12376. 698.69 s [vector] constructrN: OK
  12377. 698.69 s [vector] +++ OK, passed 100 tests.
  12378. 698.69 s [vector] cons: OK
  12379. 698.69 s [vector] +++ OK, passed 100 tests.
  12380. 698.69 s [vector] snoc: OK
  12381. 698.69 s [vector] +++ OK, passed 100 tests.
  12382. 698.69 s [vector] append: OK
  12383. 698.69 s [vector] +++ OK, passed 100 tests.
  12384. 698.69 s [vector] concat: OK (0.02s)
  12385. 698.69 s [vector] +++ OK, passed 100 tests.
  12386. 698.69 s [vector] force: OK
  12387. 698.69 s [vector] +++ OK, passed 100 tests.
  12388. 698.69 s [vector] upd: OK
  12389. 698.69 s [vector] +++ OK, passed 100 tests.
  12390. 698.69 s [vector] accum: OK
  12391. 698.69 s [vector] +++ OK, passed 100 tests.
  12392. 698.69 s [vector] reverse: OK
  12393. 698.69 s [vector] +++ OK, passed 100 tests.
  12394. 698.69 s [vector] backpermute: OK
  12395. 698.69 s [vector] +++ OK, passed 100 tests.
  12396. 698.70 s [vector] map: OK
  12397. 698.70 s [vector] +++ OK, passed 100 tests.
  12398. 698.71 s [vector] imap: OK
  12399. 698.71 s [vector] +++ OK, passed 100 tests.
  12400. 698.71 s [vector] concatMap: OK
  12401. 698.71 s [vector] +++ OK, passed 100 tests.
  12402. 698.71 s [vector] mapM: OK
  12403. 698.71 s [vector] +++ OK, passed 100 tests.
  12404. 698.72 s [vector] mapM_: OK (0.02s)
  12405. 698.73 s [vector] +++ OK, passed 100 tests.
  12406. 698.73 s [vector] forM: OK
  12407. 698.73 s [vector] +++ OK, passed 100 tests.
  12408. 698.73 s [vector] forM_: OK (0.01s)
  12409. 698.75 s [vector] +++ OK, passed 100 tests.
  12410. 698.75 s [vector] imapM: OK
  12411. 698.75 s [vector] +++ OK, passed 100 tests.
  12412. 698.76 s [vector] imapM_: OK (0.03s)
  12413. 698.76 s [vector] +++ OK, passed 100 tests.
  12414. 698.76 s [vector] zipWith: OK
  12415. 698.76 s [vector] +++ OK, passed 100 tests.
  12416. 698.76 s [vector] zipWith3: OK
  12417. 698.76 s [vector] +++ OK, passed 100 tests.
  12418. 698.77 s [vector] izipWith: OK
  12419. 698.77 s [vector] +++ OK, passed 100 tests.
  12420. 698.77 s [vector] izipWith3: OK
  12421. 698.77 s [vector] +++ OK, passed 100 tests.
  12422. 698.79 s [vector] izipWithM: OK
  12423. 698.79 s [vector] +++ OK, passed 100 tests.
  12424. 698.79 s [vector] izipWithM_: OK (0.01s)
  12425. 698.79 s [vector] +++ OK, passed 100 tests.
  12426. 698.79 s [vector] zipWithM: OK
  12427. 698.79 s [vector] +++ OK, passed 100 tests.
  12428. 698.80 s [vector] zipWithM_: OK (0.01s)
  12429. 698.80 s [vector] +++ OK, passed 100 tests.
  12430. 698.80 s [vector] filter: OK
  12431. 698.80 s [vector] +++ OK, passed 100 tests.
  12432. 698.80 s [vector] ifilter: OK
  12433. 698.80 s [vector] +++ OK, passed 100 tests.
  12434. 698.83 s [vector] filterM: OK (0.02s)
  12435. 698.83 s [vector] +++ OK, passed 100 tests.
  12436. 698.83 s [vector] uniq: OK
  12437. 698.83 s [vector] +++ OK, passed 100 tests.
  12438. 698.83 s [vector] mapMaybe: OK
  12439. 698.84 s [vector] +++ OK, passed 100 tests.
  12440. 698.84 s [vector] imapMaybe: OK
  12441. 698.84 s [vector] +++ OK, passed 100 tests.
  12442. 698.84 s [vector] takeWhile: OK
  12443. 698.84 s [vector] +++ OK, passed 100 tests.
  12444. 698.84 s [vector] dropWhile: OK
  12445. 698.84 s [vector] +++ OK, passed 100 tests.
  12446. 698.84 s [vector] partition: OK
  12447. 698.85 s [vector] +++ OK, passed 100 tests.
  12448. 698.85 s [vector] partitionWith: OK
  12449. 698.85 s [vector] +++ OK, passed 100 tests.
  12450. 698.85 s [vector] span: OK
  12451. 698.85 s [vector] +++ OK, passed 100 tests.
  12452. 698.86 s [vector] break: OK
  12453. 698.86 s [vector] +++ OK, passed 100 tests.
  12454. 698.86 s [vector] spanR: OK
  12455. 698.87 s [vector] +++ OK, passed 100 tests.
  12456. 698.87 s [vector] breakR: OK
  12457. 698.87 s [vector] +++ OK, passed 100 tests.
  12458. 698.87 s [vector] groupBy: OK
  12459. 698.88 s [vector] +++ OK, passed 100 tests.
  12460. 698.88 s [vector] elem: OK
  12461. 698.88 s [vector] +++ OK, passed 100 tests.
  12462. 698.89 s [vector] notElem: OK
  12463. 698.89 s [vector] +++ OK, passed 100 tests.
  12464. 698.89 s [vector] find: OK
  12465. 698.89 s [vector] +++ OK, passed 100 tests.
  12466. 698.89 s [vector] findIndex: OK
  12467. 698.89 s [vector] +++ OK, passed 100 tests.
  12468. 698.90 s [vector] findIndexR: OK
  12469. 698.90 s [vector] +++ OK, passed 100 tests.
  12470. 698.90 s [vector] findIndices: OK
  12471. 698.90 s [vector] +++ OK, passed 100 tests.
  12472. 698.90 s [vector] elemIndex: OK
  12473. 698.90 s [vector] +++ OK, passed 100 tests.
  12474. 698.90 s [vector] elemIndices: OK
  12475. 698.90 s [vector] +++ OK, passed 100 tests.
  12476. 698.90 s [vector] foldl: OK
  12477. 698.90 s [vector] +++ OK, passed 100 tests.
  12478. 698.91 s [vector] foldl1: OK
  12479. 698.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12480. 698.91 s [vector] foldl': OK
  12481. 698.91 s [vector] +++ OK, passed 100 tests.
  12482. 698.91 s [vector] foldl1': OK
  12483. 698.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12484. 698.91 s [vector] foldr: OK
  12485. 698.91 s [vector] +++ OK, passed 100 tests.
  12486. 698.92 s [vector] foldr1: OK
  12487. 698.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12488. 698.93 s [vector] foldr': OK
  12489. 698.93 s [vector] +++ OK, passed 100 tests.
  12490. 698.93 s [vector] foldr1': OK
  12491. 698.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12492. 698.93 s [vector] ifoldl: OK
  12493. 698.93 s [vector] +++ OK, passed 100 tests.
  12494. 698.94 s [vector] ifoldl': OK
  12495. 698.94 s [vector] +++ OK, passed 100 tests.
  12496. 698.94 s [vector] ifoldr: OK
  12497. 698.94 s [vector] +++ OK, passed 100 tests.
  12498. 698.94 s [vector] ifoldr': OK
  12499. 698.94 s [vector] +++ OK, passed 100 tests.
  12500. 698.94 s [vector] ifoldM: OK
  12501. 698.94 s [vector] +++ OK, passed 100 tests.
  12502. 698.94 s [vector] ifoldM': OK
  12503. 698.94 s [vector] +++ OK, passed 100 tests.
  12504. 698.94 s [vector] ifoldM_: OK (0.02s)
  12505. 698.94 s [vector] +++ OK, passed 100 tests.
  12506. 698.94 s [vector] ifoldM'_: OK (0.02s)
  12507. 698.94 s [vector] +++ OK, passed 100 tests.
  12508. 698.94 s [vector] all: OK
  12509. 698.94 s [vector] +++ OK, passed 100 tests.
  12510. 698.94 s [vector] any: OK
  12511. 698.94 s [vector] +++ OK, passed 100 tests.
  12512. 698.94 s [vector] prescanl: OK
  12513. 698.94 s [vector] +++ OK, passed 100 tests.
  12514. 698.94 s [vector] prescanl': OK
  12515. 698.94 s [vector] +++ OK, passed 100 tests.
  12516. 698.94 s [vector] postscanl: OK
  12517. 698.94 s [vector] +++ OK, passed 100 tests.
  12518. 698.94 s [vector] postscanl': OK
  12519. 698.94 s [vector] +++ OK, passed 100 tests.
  12520. 698.95 s [vector] scanl: OK
  12521. 698.95 s [vector] +++ OK, passed 100 tests.
  12522. 698.95 s [vector] scanl': OK
  12523. 698.95 s [vector] +++ OK, passed 100 tests.
  12524. 698.95 s [vector] scanl1: OK
  12525. 698.95 s [vector] +++ OK, passed 100 tests.
  12526. 698.95 s [vector] scanl1': OK
  12527. 698.95 s [vector] +++ OK, passed 100 tests.
  12528. 698.95 s [vector] iscanl: OK
  12529. 698.95 s [vector] +++ OK, passed 100 tests.
  12530. 698.95 s [vector] iscanl': OK
  12531. 698.96 s [vector] +++ OK, passed 100 tests.
  12532. 698.96 s [vector] prescanr: OK
  12533. 698.96 s [vector] +++ OK, passed 100 tests.
  12534. 698.97 s [vector] prescanr': OK
  12535. 698.97 s [vector] +++ OK, passed 100 tests.
  12536. 698.97 s [vector] postscanr: OK
  12537. 698.97 s [vector] +++ OK, passed 100 tests.
  12538. 698.97 s [vector] postscanr': OK
  12539. 698.98 s [vector] +++ OK, passed 100 tests.
  12540. 698.99 s [vector] scanr: OK
  12541. 698.99 s [vector] +++ OK, passed 100 tests.
  12542. 698.99 s [vector] scanr': OK
  12543. 698.99 s [vector] +++ OK, passed 100 tests.
  12544. 698.99 s [vector] scanr1: OK
  12545. 698.99 s [vector] +++ OK, passed 100 tests.
  12546. 698.99 s [vector] scanr1': OK
  12547. 698.99 s [vector] +++ OK, passed 100 tests.
  12548. 698.99 s [vector] iscanr: OK
  12549. 698.99 s [vector] +++ OK, passed 100 tests.
  12550. 698.99 s [vector] iscanr': OK
  12551. 698.99 s [vector] +++ OK, passed 100 tests.
  12552. 698.99 s [vector] mut_read: OK
  12553. 698.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12554. 698.99 s [vector] mut_write: OK
  12555. 698.99 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12556. 698.99 s [vector] mut_modify: OK
  12557. 698.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12558. 698.99 s [vector] mut_generate: OK
  12559. 698.99 s [vector] +++ OK, passed 100 tests.
  12560. 698.99 s [vector] mut_generateM: OK (0.01s)
  12561. 698.99 s [vector] +++ OK, passed 100 tests.
  12562. 699.01 s [vector] mut_mapM_: OK (0.02s)
  12563. 699.01 s [vector] +++ OK, passed 100 tests.
  12564. 699.03 s [vector] mut_imapM_: OK (0.02s)
  12565. 699.03 s [vector] +++ OK, passed 100 tests.
  12566. 699.05 s [vector] mut_forM_: OK (0.02s)
  12567. 699.05 s [vector] +++ OK, passed 100 tests.
  12568. 699.05 s [vector] mut_iforM_: OK (0.02s)
  12569. 699.05 s [vector] +++ OK, passed 100 tests.
  12570. 699.05 s [vector] mut_foldr: OK
  12571. 699.05 s [vector] +++ OK, passed 100 tests.
  12572. 699.05 s [vector] mut_foldr': OK
  12573. 699.06 s [vector] +++ OK, passed 100 tests.
  12574. 699.06 s [vector] mut_foldl: OK
  12575. 699.06 s [vector] +++ OK, passed 100 tests.
  12576. 699.06 s [vector] mut_foldl': OK
  12577. 699.06 s [vector] +++ OK, passed 100 tests.
  12578. 699.06 s [vector] mut_ifoldr: OK
  12579. 699.06 s [vector] +++ OK, passed 100 tests.
  12580. 699.06 s [vector] mut_ifoldr': OK
  12581. 699.07 s [vector] +++ OK, passed 100 tests.
  12582. 699.07 s [vector] mut_ifoldl: OK
  12583. 699.07 s [vector] +++ OK, passed 100 tests.
  12584. 699.07 s [vector] mut_ifoldl': OK
  12585. 699.07 s [vector] +++ OK, passed 100 tests.
  12586. 699.07 s [vector] mut_foldM: OK
  12587. 699.07 s [vector] +++ OK, passed 100 tests.
  12588. 699.08 s [vector] mut_foldM': OK
  12589. 699.08 s [vector] +++ OK, passed 100 tests.
  12590. 699.08 s [vector] mut_foldrM: OK
  12591. 699.08 s [vector] +++ OK, passed 100 tests.
  12592. 699.08 s [vector] mut_foldrM': OK
  12593. 699.08 s [vector] +++ OK, passed 100 tests.
  12594. 699.09 s [vector] mut_ifoldM: OK
  12595. 699.09 s [vector] +++ OK, passed 100 tests.
  12596. 699.09 s [vector] mut_ifoldM': OK
  12597. 699.09 s [vector] +++ OK, passed 100 tests.
  12598. 699.09 s [vector] mut_ifoldrM: OK
  12599. 699.09 s [vector] +++ OK, passed 100 tests.
  12600. 699.09 s [vector] mut_ifoldrM': OK
  12601. 699.09 s [vector] +++ OK, passed 100 tests.
  12602. 699.09 s [vector] compare: OK
  12603. 699.09 s [vector] +++ OK, passed 100 tests.
  12604. 699.09 s [vector] maximum: OK
  12605. 699.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12606. 699.09 s [vector] minimum: OK
  12607. 699.09 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12608. 699.09 s [vector] minIndex: OK
  12609. 699.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12610. 699.10 s [vector] maxIndex: OK
  12611. 699.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12612. 699.10 s [vector] maximumBy: OK
  12613. 699.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12614. 699.10 s [vector] minimumBy: OK
  12615. 699.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12616. 699.10 s [vector] maximumOn: OK
  12617. 699.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12618. 699.10 s [vector] minimumOn: OK
  12619. 699.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12620. 699.10 s [vector] maxIndexBy: OK
  12621. 699.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12622. 699.10 s [vector] minIndexBy: OK
  12623. 699.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12624. 699.10 s [vector] ListFirstMaxIndexWins: OK
  12625. 699.10 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12626. 699.10 s [vector] FalseListFirstMaxIndexWins: OK
  12627. 699.10 s [vector] +++ OK, failed as expected. (after 1 test):
  12628. 699.10 s [vector] Exception:
  12629. 699.10 s [vector] Prelude.foldr1: empty list
  12630. 699.10 s [vector] CallStack (from HasCallStack):
  12631. 699.10 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12632. 699.10 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12633. 699.10 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12634. 699.10 s [vector] []
  12635. 699.10 s [vector] zip: OK
  12636. 699.10 s [vector] +++ OK, passed 100 tests.
  12637. 699.11 s [vector] zip3: OK
  12638. 699.11 s [vector] +++ OK, passed 100 tests.
  12639. 699.11 s [vector] unzip: OK
  12640. 699.11 s [vector] +++ OK, passed 100 tests.
  12641. 699.11 s [vector] unzip3: OK
  12642. 699.11 s [vector] +++ OK, passed 100 tests.
  12643. 699.11 s [vector] indexed: OK
  12644. 699.11 s [vector] +++ OK, passed 100 tests.
  12645. 699.11 s [vector] update: OK
  12646. 699.11 s [vector] +++ OK, passed 100 tests.
  12647. 699.11 s [vector] mempty: OK
  12648. 699.11 s [vector] +++ OK, passed 100 tests.
  12649. 699.13 s [vector] mappend: OK
  12650. 699.13 s [vector] +++ OK, passed 100 tests.
  12651. 699.13 s [vector] mconcat: OK (0.02s)
  12652. 699.13 s [vector] +++ OK, passed 100 tests.
  12653. 699.13 s [vector] glength: OK
  12654. 699.13 s [vector] +++ OK, passed 100 tests.
  12655. 699.13 s [vector] sum: OK
  12656. 699.13 s [vector] +++ OK, passed 100 tests.
  12657. 699.13 s [vector] product: OK
  12658. 699.13 s [vector] +++ OK, passed 100 tests.
  12659. 699.13 s [vector] enumFromN: OK
  12660. 699.13 s [vector] +++ OK, passed 100 tests.
  12661. 699.13 s [vector] enumFromThenN: OK
  12662. 699.13 s [vector] +++ OK, passed 100 tests.
  12663. 699.13 s [vector] enumFromTo: OK
  12664. 699.13 s [vector] +++ OK, passed 100 tests.
  12665. 699.13 s [vector] enumFromThenTo: OK
  12666. 699.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12667. 699.13 s [vector] (Float)
  12668. 699.13 s [vector] fromList.toList == id: OK
  12669. 699.13 s [vector] +++ OK, passed 100 tests.
  12670. 699.13 s [vector] toList.fromList == id: OK
  12671. 699.13 s [vector] +++ OK, passed 100 tests.
  12672. 699.13 s [vector] unstream.stream == id: OK
  12673. 699.14 s [vector] +++ OK, passed 100 tests.
  12674. 699.14 s [vector] stream.unstream == id: OK
  12675. 699.14 s [vector] +++ OK, passed 100 tests.
  12676. 699.14 s [vector] eq: OK
  12677. 699.14 s [vector] +++ OK, passed 100 tests.
  12678. 699.14 s [vector] length: OK
  12679. 699.14 s [vector] +++ OK, passed 100 tests.
  12680. 699.14 s [vector] null: OK
  12681. 699.14 s [vector] +++ OK, passed 100 tests.
  12682. 699.14 s [vector] index: OK
  12683. 699.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12684. 699.14 s [vector] safeIndex: OK
  12685. 699.14 s [vector] +++ OK, passed 100 tests.
  12686. 699.14 s [vector] head: OK
  12687. 699.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12688. 699.14 s [vector] last: OK
  12689. 699.14 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12690. 699.14 s [vector] unsafeIndex: OK
  12691. 699.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12692. 699.14 s [vector] unsafeHead: OK
  12693. 699.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12694. 699.14 s [vector] unsafeLast: OK
  12695. 699.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12696. 699.15 s [vector] slice: OK
  12697. 699.15 s [vector] +++ OK, passed 100 tests.
  12698. 699.15 s [vector] init: OK
  12699. 699.15 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12700. 699.15 s [vector] tail: OK
  12701. 699.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12702. 699.15 s [vector] take: OK
  12703. 699.15 s [vector] +++ OK, passed 100 tests.
  12704. 699.15 s [vector] drop: OK
  12705. 699.15 s [vector] +++ OK, passed 100 tests.
  12706. 699.15 s [vector] splitAt: OK
  12707. 699.15 s [vector] +++ OK, passed 100 tests.
  12708. 699.15 s [vector] empty: OK
  12709. 699.15 s [vector] +++ OK, passed 100 tests.
  12710. 699.15 s [vector] singleton: OK
  12711. 699.15 s [vector] +++ OK, passed 100 tests.
  12712. 699.15 s [vector] replicate: OK
  12713. 699.15 s [vector] +++ OK, passed 100 tests.
  12714. 699.15 s [vector] generate: OK
  12715. 699.15 s [vector] +++ OK, passed 100 tests.
  12716. 699.17 s [vector] iterateN: OK
  12717. 699.17 s [vector] +++ OK, passed 100 tests.
  12718. 699.19 s [vector] iterateNM: OK (0.03s)
  12719. 699.19 s [vector] +++ OK, passed 100 tests.
  12720. 699.24 s [vector] generateM: OK (0.05s)
  12721. 699.24 s [vector] +++ OK, passed 100 tests.
  12722. 699.24 s [vector] replicateM: OK
  12723. 699.24 s [vector] +++ OK, passed 100 tests.
  12724. 699.24 s [vector] create: OK
  12725. 699.24 s [vector] +++ OK, passed 100 tests.
  12726. 699.24 s [vector] createT: OK
  12727. 699.24 s [vector] +++ OK, passed 100 tests.
  12728. 699.24 s [vector] unfoldr: OK
  12729. 699.25 s [vector] +++ OK, passed 100 tests.
  12730. 699.25 s [vector] unfoldrN: OK
  12731. 699.25 s [vector] +++ OK, passed 100 tests.
  12732. 699.25 s [vector] unfoldrExactN: OK
  12733. 699.25 s [vector] +++ OK, passed 100 tests.
  12734. 699.25 s [vector] unfoldrM: OK
  12735. 699.25 s [vector] +++ OK, passed 100 tests.
  12736. 699.25 s [vector] unfoldrNM: OK
  12737. 699.25 s [vector] +++ OK, passed 100 tests.
  12738. 699.28 s [vector] unfoldrExactNM: OK
  12739. 699.28 s [vector] +++ OK, passed 100 tests.
  12740. 699.29 s [vector] constructN: OK
  12741. 699.29 s [vector] +++ OK, passed 100 tests.
  12742. 699.30 s [vector] constructrN: OK (0.01s)
  12743. 699.30 s [vector] +++ OK, passed 100 tests.
  12744. 699.30 s [vector] cons: OK
  12745. 699.30 s [vector] +++ OK, passed 100 tests.
  12746. 699.30 s [vector] snoc: OK
  12747. 699.30 s [vector] +++ OK, passed 100 tests.
  12748. 699.30 s [vector] append: OK
  12749. 699.30 s [vector] +++ OK, passed 100 tests.
  12750. 699.33 s [vector] concat: OK (0.02s)
  12751. 699.33 s [vector] +++ OK, passed 100 tests.
  12752. 699.34 s [vector] force: OK
  12753. 699.34 s [vector] +++ OK, passed 100 tests.
  12754. 699.34 s [vector] upd: OK
  12755. 699.35 s [vector] +++ OK, passed 100 tests.
  12756. 699.35 s [vector] accum: OK
  12757. 699.36 s [vector] +++ OK, passed 100 tests.
  12758. 699.37 s [vector] reverse: OK
  12759. 699.37 s [vector] +++ OK, passed 100 tests.
  12760. 699.39 s [vector] backpermute: OK
  12761. 699.39 s [vector] +++ OK, passed 100 tests.
  12762. 699.39 s [vector] map: OK
  12763. 699.39 s [vector] +++ OK, passed 100 tests.
  12764. 699.39 s [vector] imap: OK
  12765. 699.39 s [vector] +++ OK, passed 100 tests.
  12766. 699.39 s [vector] concatMap: OK
  12767. 699.39 s [vector] +++ OK, passed 100 tests.
  12768. 699.39 s [vector] mapM: OK
  12769. 699.39 s [vector] +++ OK, passed 100 tests.
  12770. 699.41 s [vector] mapM_: OK (0.03s)
  12771. 699.41 s [vector] +++ OK, passed 100 tests.
  12772. 699.41 s [vector] forM: OK
  12773. 699.41 s [vector] +++ OK, passed 100 tests.
  12774. 699.44 s [vector] forM_: OK (0.03s)
  12775. 699.45 s [vector] +++ OK, passed 100 tests.
  12776. 699.45 s [vector] imapM: OK
  12777. 699.45 s [vector] +++ OK, passed 100 tests.
  12778. 699.48 s [vector] imapM_: OK (0.03s)
  12779. 699.49 s [vector] +++ OK, passed 100 tests.
  12780. 699.49 s [vector] zipWith: OK
  12781. 699.50 s [vector] +++ OK, passed 100 tests.
  12782. 699.51 s [vector] zipWith3: OK
  12783. 699.51 s [vector] +++ OK, passed 100 tests.
  12784. 699.51 s [vector] izipWith: OK
  12785. 699.51 s [vector] +++ OK, passed 100 tests.
  12786. 699.53 s [vector] izipWith3: OK
  12787. 699.53 s [vector] +++ OK, passed 100 tests.
  12788. 699.53 s [vector] izipWithM: OK
  12789. 699.53 s [vector] +++ OK, passed 100 tests.
  12790. 699.54 s [vector] izipWithM_: OK (0.03s)
  12791. 699.54 s [vector] +++ OK, passed 100 tests.
  12792. 699.54 s [vector] zipWithM: OK
  12793. 699.55 s [vector] +++ OK, passed 100 tests.
  12794. 699.57 s [vector] zipWithM_: OK (0.02s)
  12795. 699.57 s [vector] +++ OK, passed 100 tests.
  12796. 699.58 s [vector] filter: OK
  12797. 699.59 s [vector] +++ OK, passed 100 tests.
  12798. 699.59 s [vector] ifilter: OK
  12799. 699.59 s [vector] +++ OK, passed 100 tests.
  12800. 699.62 s [vector] filterM: OK (0.05s)
  12801. 699.63 s [vector] +++ OK, passed 100 tests.
  12802. 699.64 s [vector] uniq: OK
  12803. 699.64 s [vector] +++ OK, passed 100 tests.
  12804. 699.64 s [vector] mapMaybe: OK
  12805. 699.64 s [vector] +++ OK, passed 100 tests.
  12806. 699.64 s [vector] imapMaybe: OK
  12807. 699.64 s [vector] +++ OK, passed 100 tests.
  12808. 699.64 s [vector] takeWhile: OK
  12809. 699.64 s [vector] +++ OK, passed 100 tests.
  12810. 699.64 s [vector] dropWhile: OK
  12811. 699.64 s [vector] +++ OK, passed 100 tests.
  12812. 699.64 s [vector] partition: OK
  12813. 699.64 s [vector] +++ OK, passed 100 tests.
  12814. 699.65 s [vector] partitionWith: OK
  12815. 699.65 s [vector] +++ OK, passed 100 tests.
  12816. 699.65 s [vector] span: OK
  12817. 699.65 s [vector] +++ OK, passed 100 tests.
  12818. 699.65 s [vector] break: OK
  12819. 699.65 s [vector] +++ OK, passed 100 tests.
  12820. 699.65 s [vector] spanR: OK
  12821. 699.66 s [vector] +++ OK, passed 100 tests.
  12822. 699.66 s [vector] breakR: OK
  12823. 699.66 s [vector] +++ OK, passed 100 tests.
  12824. 699.66 s [vector] groupBy: OK
  12825. 699.66 s [vector] +++ OK, passed 100 tests.
  12826. 699.67 s [vector] elem: OK
  12827. 699.67 s [vector] +++ OK, passed 100 tests.
  12828. 699.67 s [vector] notElem: OK
  12829. 699.67 s [vector] +++ OK, passed 100 tests.
  12830. 699.67 s [vector] find: OK
  12831. 699.67 s [vector] +++ OK, passed 100 tests.
  12832. 699.67 s [vector] findIndex: OK
  12833. 699.67 s [vector] +++ OK, passed 100 tests.
  12834. 699.67 s [vector] findIndexR: OK
  12835. 699.68 s [vector] +++ OK, passed 100 tests.
  12836. 699.69 s [vector] findIndices: OK
  12837. 699.70 s [vector] +++ OK, passed 100 tests.
  12838. 699.71 s [vector] elemIndex: OK
  12839. 699.71 s [vector] +++ OK, passed 100 tests.
  12840. 699.71 s [vector] elemIndices: OK
  12841. 699.71 s [vector] +++ OK, passed 100 tests.
  12842. 699.71 s [vector] foldl: OK (0.01s)
  12843. 699.71 s [vector] +++ OK, passed 100 tests.
  12844. 699.71 s [vector] foldl1: OK
  12845. 699.72 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12846. 699.73 s [vector] foldl': OK
  12847. 699.73 s [vector] +++ OK, passed 100 tests.
  12848. 699.75 s [vector] foldl1': OK
  12849. 699.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12850. 699.75 s [vector] foldr: OK
  12851. 699.75 s [vector] +++ OK, passed 100 tests.
  12852. 699.75 s [vector] foldr1: OK
  12853. 699.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12854. 699.75 s [vector] foldr': OK
  12855. 699.75 s [vector] +++ OK, passed 100 tests.
  12856. 699.75 s [vector] foldr1': OK
  12857. 699.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12858. 699.75 s [vector] ifoldl: OK
  12859. 699.75 s [vector] +++ OK, passed 100 tests.
  12860. 699.75 s [vector] ifoldl': OK
  12861. 699.75 s [vector] +++ OK, passed 100 tests.
  12862. 699.76 s [vector] ifoldr: OK
  12863. 699.76 s [vector] +++ OK, passed 100 tests.
  12864. 699.77 s [vector] ifoldr': OK
  12865. 699.77 s [vector] +++ OK, passed 100 tests.
  12866. 699.78 s [vector] ifoldM: OK
  12867. 699.78 s [vector] +++ OK, passed 100 tests.
  12868. 699.79 s [vector] ifoldM': OK
  12869. 699.79 s [vector] +++ OK, passed 100 tests.
  12870. 699.83 s [vector] ifoldM_: OK (0.03s)
  12871. 699.83 s [vector] +++ OK, passed 100 tests.
  12872. 699.85 s [vector] ifoldM'_: OK (0.03s)
  12873. 699.85 s [vector] +++ OK, passed 100 tests.
  12874. 699.85 s [vector] all: OK
  12875. 699.85 s [vector] +++ OK, passed 100 tests.
  12876. 699.85 s [vector] any: OK
  12877. 699.85 s [vector] +++ OK, passed 100 tests.
  12878. 699.86 s [vector] prescanl: OK
  12879. 699.87 s [vector] +++ OK, passed 100 tests.
  12880. 699.87 s [vector] prescanl': OK
  12881. 699.88 s [vector] +++ OK, passed 100 tests.
  12882. 699.89 s [vector] postscanl: OK
  12883. 699.89 s [vector] +++ OK, passed 100 tests.
  12884. 699.89 s [vector] postscanl': OK
  12885. 699.89 s [vector] +++ OK, passed 100 tests.
  12886. 699.90 s [vector] scanl: OK
  12887. 699.91 s [vector] +++ OK, passed 100 tests.
  12888. 699.91 s [vector] scanl': OK
  12889. 699.92 s [vector] +++ OK, passed 100 tests.
  12890. 699.93 s [vector] scanl1: OK
  12891. 699.93 s [vector] +++ OK, passed 100 tests.
  12892. 699.93 s [vector] scanl1': OK
  12893. 699.93 s [vector] +++ OK, passed 100 tests.
  12894. 699.93 s [vector] iscanl: OK
  12895. 699.93 s [vector] +++ OK, passed 100 tests.
  12896. 699.93 s [vector] iscanl': OK
  12897. 699.93 s [vector] +++ OK, passed 100 tests.
  12898. 699.93 s [vector] prescanr: OK
  12899. 699.94 s [vector] +++ OK, passed 100 tests.
  12900. 699.95 s [vector] prescanr': OK
  12901. 699.96 s [vector] +++ OK, passed 100 tests.
  12902. 699.97 s [vector] postscanr: OK
  12903. 699.97 s [vector] +++ OK, passed 100 tests.
  12904. 699.97 s [vector] postscanr': OK
  12905. 699.98 s [vector] +++ OK, passed 100 tests.
  12906. 699.99 s [vector] scanr: OK
  12907. 699.99 s [vector] +++ OK, passed 100 tests.
  12908. 700.00 s [vector] scanr': OK
  12909. 700.01 s [vector] +++ OK, passed 100 tests.
  12910. 700.01 s [vector] scanr1: OK
  12911. 700.01 s [vector] +++ OK, passed 100 tests.
  12912. 700.01 s [vector] scanr1': OK
  12913. 700.01 s [vector] +++ OK, passed 100 tests.
  12914. 700.01 s [vector] iscanr: OK
  12915. 700.01 s [vector] +++ OK, passed 100 tests.
  12916. 700.01 s [vector] iscanr': OK (0.01s)
  12917. 700.01 s [vector] +++ OK, passed 100 tests.
  12918. 700.02 s [vector] mut_read: OK
  12919. 700.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12920. 700.03 s [vector] mut_write: OK
  12921. 700.05 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12922. 700.05 s [vector] mut_modify: OK
  12923. 700.05 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12924. 700.05 s [vector] mut_generate: OK
  12925. 700.06 s [vector] +++ OK, passed 100 tests.
  12926. 700.06 s [vector] mut_generateM: OK (0.01s)
  12927. 700.06 s [vector] +++ OK, passed 100 tests.
  12928. 700.07 s [vector] mut_mapM_: OK (0.03s)
  12929. 700.07 s [vector] +++ OK, passed 100 tests.
  12930. 700.11 s [vector] mut_imapM_: OK (0.03s)
  12931. 700.11 s [vector] +++ OK, passed 100 tests.
  12932. 700.13 s [vector] mut_forM_: OK (0.03s)
  12933. 700.13 s [vector] +++ OK, passed 100 tests.
  12934. 700.16 s [vector] mut_iforM_: OK (0.03s)
  12935. 700.16 s [vector] +++ OK, passed 100 tests.
  12936. 700.16 s [vector] mut_foldr: OK
  12937. 700.16 s [vector] +++ OK, passed 100 tests.
  12938. 700.16 s [vector] mut_foldr': OK
  12939. 700.16 s [vector] +++ OK, passed 100 tests.
  12940. 700.18 s [vector] mut_foldl: OK
  12941. 700.19 s [vector] +++ OK, passed 100 tests.
  12942. 700.19 s [vector] mut_foldl': OK
  12943. 700.20 s [vector] +++ OK, passed 100 tests.
  12944. 700.20 s [vector] mut_ifoldr: OK
  12945. 700.20 s [vector] +++ OK, passed 100 tests.
  12946. 700.20 s [vector] mut_ifoldr': OK
  12947. 700.21 s [vector] +++ OK, passed 100 tests.
  12948. 700.21 s [vector] mut_ifoldl: OK
  12949. 700.21 s [vector] +++ OK, passed 100 tests.
  12950. 700.22 s [vector] mut_ifoldl': OK
  12951. 700.23 s [vector] +++ OK, passed 100 tests.
  12952. 700.23 s [vector] mut_foldM: OK
  12953. 700.23 s [vector] +++ OK, passed 100 tests.
  12954. 700.25 s [vector] mut_foldM': OK
  12955. 700.25 s [vector] +++ OK, passed 100 tests.
  12956. 700.25 s [vector] mut_foldrM: OK
  12957. 700.25 s [vector] +++ OK, passed 100 tests.
  12958. 700.25 s [vector] mut_foldrM': OK
  12959. 700.26 s [vector] +++ OK, passed 100 tests.
  12960. 700.26 s [vector] mut_ifoldM: OK
  12961. 700.27 s [vector] +++ OK, passed 100 tests.
  12962. 700.27 s [vector] mut_ifoldM': OK
  12963. 700.27 s [vector] +++ OK, passed 100 tests.
  12964. 700.27 s [vector] mut_ifoldrM: OK
  12965. 700.27 s [vector] +++ OK, passed 100 tests.
  12966. 700.27 s [vector] mut_ifoldrM': OK
  12967. 700.27 s [vector] +++ OK, passed 100 tests.
  12968. 700.27 s [vector] compare: OK
  12969. 700.27 s [vector] +++ OK, passed 100 tests.
  12970. 700.27 s [vector] maximum: OK
  12971. 700.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12972. 700.27 s [vector] minimum: OK
  12973. 700.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12974. 700.28 s [vector] minIndex: OK
  12975. 700.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12976. 700.28 s [vector] maxIndex: OK
  12977. 700.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12978. 700.28 s [vector] maximumBy: OK
  12979. 700.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12980. 700.28 s [vector] minimumBy: OK
  12981. 700.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12982. 700.28 s [vector] maximumOn: OK
  12983. 700.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12984. 700.28 s [vector] minimumOn: OK
  12985. 700.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12986. 700.28 s [vector] maxIndexBy: OK
  12987. 700.28 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12988. 700.29 s [vector] minIndexBy: OK
  12989. 700.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12990. 700.29 s [vector] ListFirstMaxIndexWins: OK
  12991. 700.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12992. 700.29 s [vector] FalseListFirstMaxIndexWins: OK
  12993. 700.29 s [vector] +++ OK, failed as expected. (after 1 test):
  12994. 700.29 s [vector] Exception:
  12995. 700.29 s [vector] Prelude.foldr1: empty list
  12996. 700.29 s [vector] CallStack (from HasCallStack):
  12997. 700.29 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12998. 700.29 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12999. 700.29 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13000. 700.29 s [vector] []
  13001. 700.31 s [vector] zip: OK
  13002. 700.31 s [vector] +++ OK, passed 100 tests.
  13003. 700.31 s [vector] zip3: OK
  13004. 700.31 s [vector] +++ OK, passed 100 tests.
  13005. 700.31 s [vector] unzip: OK
  13006. 700.31 s [vector] +++ OK, passed 100 tests.
  13007. 700.31 s [vector] unzip3: OK
  13008. 700.31 s [vector] +++ OK, passed 100 tests.
  13009. 700.31 s [vector] indexed: OK
  13010. 700.31 s [vector] +++ OK, passed 100 tests.
  13011. 700.31 s [vector] update: OK
  13012. 700.31 s [vector] +++ OK, passed 100 tests.
  13013. 700.31 s [vector] mempty: OK
  13014. 700.31 s [vector] +++ OK, passed 100 tests.
  13015. 700.32 s [vector] mappend: OK
  13016. 700.32 s [vector] +++ OK, passed 100 tests.
  13017. 700.32 s [vector] mconcat: OK (0.03s)
  13018. 700.32 s [vector] +++ OK, passed 100 tests.
  13019. 700.32 s [vector] glength: OK
  13020. 700.33 s [vector] +++ OK, passed 100 tests.
  13021. 700.33 s [vector] sum: OK
  13022. 700.33 s [vector] +++ OK, passed 100 tests.
  13023. 700.33 s [vector] product: OK
  13024. 700.33 s [vector] +++ OK, passed 100 tests.
  13025. 700.33 s [vector] enumFromN: OK
  13026. 700.33 s [vector] +++ OK, passed 100 tests.
  13027. 700.33 s [vector] enumFromThenN: OK
  13028. 700.33 s [vector] +++ OK, passed 100 tests.
  13029. 700.33 s [vector] enumFromTo: OK
  13030. 700.33 s [vector] +++ OK, passed 100 tests.
  13031. 700.33 s [vector] enumFromThenTo: OK
  13032. 700.33 s [vector] +++ OK, passed 100 tests; 1 discarded.
  13033. 700.33 s [vector] (Double)
  13034. 700.33 s [vector] fromList.toList == id: OK
  13035. 700.33 s [vector] +++ OK, passed 100 tests.
  13036. 700.33 s [vector] toList.fromList == id: OK
  13037. 700.33 s [vector] +++ OK, passed 100 tests.
  13038. 700.33 s [vector] unstream.stream == id: OK
  13039. 700.33 s [vector] +++ OK, passed 100 tests.
  13040. 700.33 s [vector] stream.unstream == id: OK
  13041. 700.33 s [vector] +++ OK, passed 100 tests.
  13042. 700.33 s [vector] eq: OK
  13043. 700.33 s [vector] +++ OK, passed 100 tests.
  13044. 700.33 s [vector] length: OK
  13045. 700.33 s [vector] +++ OK, passed 100 tests.
  13046. 700.33 s [vector] null: OK
  13047. 700.34 s [vector] +++ OK, passed 100 tests.
  13048. 700.34 s [vector] index: OK
  13049. 700.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13050. 700.34 s [vector] safeIndex: OK
  13051. 700.34 s [vector] +++ OK, passed 100 tests.
  13052. 700.34 s [vector] head: OK
  13053. 700.34 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13054. 700.34 s [vector] last: OK
  13055. 700.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13056. 700.34 s [vector] unsafeIndex: OK
  13057. 700.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13058. 700.34 s [vector] unsafeHead: OK
  13059. 700.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13060. 700.34 s [vector] unsafeLast: OK
  13061. 700.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13062. 700.34 s [vector] slice: OK
  13063. 700.34 s [vector] +++ OK, passed 100 tests.
  13064. 700.34 s [vector] init: OK
  13065. 700.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13066. 700.34 s [vector] tail: OK
  13067. 700.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13068. 700.34 s [vector] take: OK
  13069. 700.34 s [vector] +++ OK, passed 100 tests.
  13070. 700.34 s [vector] drop: OK
  13071. 700.34 s [vector] +++ OK, passed 100 tests.
  13072. 700.34 s [vector] splitAt: OK
  13073. 700.34 s [vector] +++ OK, passed 100 tests.
  13074. 700.34 s [vector] empty: OK
  13075. 700.34 s [vector] +++ OK, passed 100 tests.
  13076. 700.35 s [vector] singleton: OK
  13077. 700.35 s [vector] +++ OK, passed 100 tests.
  13078. 700.35 s [vector] replicate: OK
  13079. 700.35 s [vector] +++ OK, passed 100 tests.
  13080. 700.35 s [vector] generate: OK
  13081. 700.35 s [vector] +++ OK, passed 100 tests.
  13082. 700.35 s [vector] iterateN: OK
  13083. 700.35 s [vector] +++ OK, passed 100 tests.
  13084. 700.37 s [vector] iterateNM: OK (0.02s)
  13085. 700.37 s [vector] +++ OK, passed 100 tests.
  13086. 700.39 s [vector] generateM: OK (0.02s)
  13087. 700.39 s [vector] +++ OK, passed 100 tests.
  13088. 700.40 s [vector] replicateM: OK (0.02s)
  13089. 700.40 s [vector] +++ OK, passed 100 tests.
  13090. 700.40 s [vector] create: OK
  13091. 700.40 s [vector] +++ OK, passed 100 tests.
  13092. 700.40 s [vector] createT: OK
  13093. 700.41 s [vector] +++ OK, passed 100 tests.
  13094. 700.41 s [vector] unfoldr: OK
  13095. 700.41 s [vector] +++ OK, passed 100 tests.
  13096. 700.41 s [vector] unfoldrN: OK
  13097. 700.41 s [vector] +++ OK, passed 100 tests.
  13098. 700.42 s [vector] unfoldrExactN: OK
  13099. 700.43 s [vector] +++ OK, passed 100 tests.
  13100. 700.43 s [vector] unfoldrM: OK
  13101. 700.43 s [vector] +++ OK, passed 100 tests.
  13102. 700.44 s [vector] unfoldrNM: OK
  13103. 700.45 s [vector] +++ OK, passed 100 tests.
  13104. 700.45 s [vector] unfoldrExactNM: OK (0.01s)
  13105. 700.45 s [vector] +++ OK, passed 100 tests.
  13106. 700.45 s [vector] constructN: OK (0.01s)
  13107. 700.45 s [vector] +++ OK, passed 100 tests.
  13108. 700.45 s [vector] constructrN: OK (0.02s)
  13109. 700.45 s [vector] +++ OK, passed 100 tests.
  13110. 700.45 s [vector] cons: OK
  13111. 700.45 s [vector] +++ OK, passed 100 tests.
  13112. 700.47 s [vector] snoc: OK
  13113. 700.47 s [vector] +++ OK, passed 100 tests.
  13114. 700.47 s [vector] append: OK
  13115. 700.47 s [vector] +++ OK, passed 100 tests.
  13116. 700.48 s [vector] concat: OK (0.03s)
  13117. 700.49 s [vector] +++ OK, passed 100 tests.
  13118. 700.49 s [vector] force: OK
  13119. 700.49 s [vector] +++ OK, passed 100 tests.
  13120. 700.49 s [vector] upd: OK
  13121. 700.49 s [vector] +++ OK, passed 100 tests.
  13122. 700.50 s [vector] accum: OK
  13123. 700.50 s [vector] +++ OK, passed 100 tests.
  13124. 700.50 s [vector] reverse: OK
  13125. 700.50 s [vector] +++ OK, passed 100 tests.
  13126. 700.51 s [vector] backpermute: OK
  13127. 700.51 s [vector] +++ OK, passed 100 tests.
  13128. 700.51 s [vector] map: OK
  13129. 700.51 s [vector] +++ OK, passed 100 tests.
  13130. 700.52 s [vector] imap: OK
  13131. 700.53 s [vector] +++ OK, passed 100 tests.
  13132. 700.55 s [vector] concatMap: OK
  13133. 700.55 s [vector] +++ OK, passed 100 tests.
  13134. 700.55 s [vector] mapM: OK
  13135. 700.55 s [vector] +++ OK, passed 100 tests.
  13136. 700.57 s [vector] mapM_: OK (0.03s)
  13137. 700.57 s [vector] +++ OK, passed 100 tests.
  13138. 700.57 s [vector] forM: OK
  13139. 700.57 s [vector] +++ OK, passed 100 tests.
  13140. 700.61 s [vector] forM_: OK (0.03s)
  13141. 700.61 s [vector] +++ OK, passed 100 tests.
  13142. 700.63 s [vector] imapM: OK (0.01s)
  13143. 700.63 s [vector] +++ OK, passed 100 tests.
  13144. 700.65 s [vector] imapM_: OK (0.03s)
  13145. 700.65 s [vector] +++ OK, passed 100 tests.
  13146. 700.67 s [vector] zipWith: OK
  13147. 700.67 s [vector] +++ OK, passed 100 tests.
  13148. 700.67 s [vector] zipWith3: OK (0.01s)
  13149. 700.67 s [vector] +++ OK, passed 100 tests.
  13150. 700.67 s [vector] izipWith: OK
  13151. 700.67 s [vector] +++ OK, passed 100 tests.
  13152. 700.68 s [vector] izipWith3: OK
  13153. 700.68 s [vector] +++ OK, passed 100 tests.
  13154. 700.71 s [vector] izipWithM: OK (0.01s)
  13155. 700.71 s [vector] +++ OK, passed 100 tests.
  13156. 700.73 s [vector] izipWithM_: OK (0.03s)
  13157. 700.73 s [vector] +++ OK, passed 100 tests.
  13158. 700.75 s [vector] zipWithM: OK (0.01s)
  13159. 700.75 s [vector] +++ OK, passed 100 tests.
  13160. 700.77 s [vector] zipWithM_: OK (0.02s)
  13161. 700.77 s [vector] +++ OK, passed 100 tests.
  13162. 700.77 s [vector] filter: OK
  13163. 700.77 s [vector] +++ OK, passed 100 tests.
  13164. 700.77 s [vector] ifilter: OK
  13165. 700.77 s [vector] +++ OK, passed 100 tests.
  13166. 700.82 s [vector] filterM: OK (0.04s)
  13167. 700.82 s [vector] +++ OK, passed 100 tests.
  13168. 700.82 s [vector] uniq: OK
  13169. 700.82 s [vector] +++ OK, passed 100 tests.
  13170. 700.82 s [vector] mapMaybe: OK
  13171. 700.82 s [vector] +++ OK, passed 100 tests.
  13172. 700.83 s [vector] imapMaybe: OK
  13173. 700.83 s [vector] +++ OK, passed 100 tests.
  13174. 700.85 s [vector] takeWhile: OK
  13175. 700.85 s [vector] +++ OK, passed 100 tests.
  13176. 700.85 s [vector] dropWhile: OK
  13177. 700.85 s [vector] +++ OK, passed 100 tests.
  13178. 700.86 s [vector] partition: OK
  13179. 700.86 s [vector] +++ OK, passed 100 tests.
  13180. 700.86 s [vector] partitionWith: OK
  13181. 700.86 s [vector] +++ OK, passed 100 tests.
  13182. 700.86 s [vector] span: OK
  13183. 700.87 s [vector] +++ OK, passed 100 tests.
  13184. 700.87 s [vector] break: OK
  13185. 700.87 s [vector] +++ OK, passed 100 tests.
  13186. 700.88 s [vector] spanR: OK
  13187. 700.89 s [vector] +++ OK, passed 100 tests.
  13188. 700.89 s [vector] breakR: OK
  13189. 700.90 s [vector] +++ OK, passed 100 tests.
  13190. 700.90 s [vector] groupBy: OK
  13191. 700.91 s [vector] +++ OK, passed 100 tests.
  13192. 700.92 s [vector] elem: OK
  13193. 700.92 s [vector] +++ OK, passed 100 tests.
  13194. 700.92 s [vector] notElem: OK
  13195. 700.93 s [vector] +++ OK, passed 100 tests.
  13196. 700.93 s [vector] find: OK
  13197. 700.93 s [vector] +++ OK, passed 100 tests.
  13198. 700.93 s [vector] findIndex: OK
  13199. 700.93 s [vector] +++ OK, passed 100 tests.
  13200. 700.93 s [vector] findIndexR: OK
  13201. 700.93 s [vector] +++ OK, passed 100 tests.
  13202. 700.93 s [vector] findIndices: OK
  13203. 700.93 s [vector] +++ OK, passed 100 tests.
  13204. 700.93 s [vector] elemIndex: OK
  13205. 700.94 s [vector] +++ OK, passed 100 tests.
  13206. 700.94 s [vector] elemIndices: OK
  13207. 700.95 s [vector] +++ OK, passed 100 tests.
  13208. 700.96 s [vector] foldl: OK (0.01s)
  13209. 700.97 s [vector] +++ OK, passed 100 tests.
  13210. 700.97 s [vector] foldl1: OK (0.01s)
  13211. 700.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13212. 700.99 s [vector] foldl': OK (0.01s)
  13213. 700.99 s [vector] +++ OK, passed 100 tests.
  13214. 701.01 s [vector] foldl1': OK (0.01s)
  13215. 701.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13216. 701.01 s [vector] foldr: OK
  13217. 701.03 s [vector] +++ OK, passed 100 tests.
  13218. 701.03 s [vector] foldr1: OK (0.01s)
  13219. 701.03 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13220. 701.04 s [vector] foldr': OK (0.01s)
  13221. 701.04 s [vector] +++ OK, passed 100 tests.
  13222. 701.04 s [vector] foldr1': OK (0.01s)
  13223. 701.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13224. 701.04 s [vector] ifoldl: OK (0.01s)
  13225. 701.04 s [vector] +++ OK, passed 100 tests.
  13226. 701.04 s [vector] ifoldl': OK (0.01s)
  13227. 701.05 s [vector] +++ OK, passed 100 tests.
  13228. 701.07 s [vector] ifoldr: OK (0.01s)
  13229. 701.07 s [vector] +++ OK, passed 100 tests.
  13230. 701.07 s [vector] ifoldr': OK (0.01s)
  13231. 701.08 s [vector] +++ OK, passed 100 tests.
  13232. 701.08 s [vector] ifoldM: OK (0.01s)
  13233. 701.08 s [vector] +++ OK, passed 100 tests.
  13234. 701.08 s [vector] ifoldM': OK (0.01s)
  13235. 701.09 s [vector] +++ OK, passed 100 tests.
  13236. 701.09 s [vector] ifoldM_: OK (0.03s)
  13237. 701.09 s [vector] +++ OK, passed 100 tests.
  13238. 701.12 s [vector] ifoldM'_: OK (0.04s)
  13239. 701.12 s [vector] +++ OK, passed 100 tests.
  13240. 701.12 s [vector] all: OK
  13241. 701.12 s [vector] +++ OK, passed 100 tests.
  13242. 701.12 s [vector] any: OK
  13243. 701.12 s [vector] +++ OK, passed 100 tests.
  13244. 701.13 s [vector] prescanl: OK (0.01s)
  13245. 701.13 s [vector] +++ OK, passed 100 tests.
  13246. 701.15 s [vector] prescanl': OK
  13247. 701.15 s [vector] +++ OK, passed 100 tests.
  13248. 701.17 s [vector] postscanl: OK (0.01s)
  13249. 701.17 s [vector] +++ OK, passed 100 tests.
  13250. 701.18 s [vector] postscanl': OK (0.01s)
  13251. 701.19 s [vector] +++ OK, passed 100 tests.
  13252. 701.19 s [vector] scanl: OK (0.01s)
  13253. 701.19 s [vector] +++ OK, passed 100 tests.
  13254. 701.21 s [vector] scanl': OK (0.01s)
  13255. 701.21 s [vector] +++ OK, passed 100 tests.
  13256. 701.21 s [vector] scanl1: OK (0.01s)
  13257. 701.22 s [vector] +++ OK, passed 100 tests.
  13258. 701.23 s [vector] scanl1': OK (0.01s)
  13259. 701.23 s [vector] +++ OK, passed 100 tests.
  13260. 701.23 s [vector] iscanl: OK (0.01s)
  13261. 701.24 s [vector] +++ OK, passed 100 tests.
  13262. 701.25 s [vector] iscanl': OK (0.01s)
  13263. 701.25 s [vector] +++ OK, passed 100 tests.
  13264. 701.25 s [vector] prescanr: OK (0.01s)
  13265. 701.26 s [vector] +++ OK, passed 100 tests.
  13266. 701.27 s [vector] prescanr': OK (0.01s)
  13267. 701.27 s [vector] +++ OK, passed 100 tests.
  13268. 701.29 s [vector] postscanr: OK (0.01s)
  13269. 701.29 s [vector] +++ OK, passed 100 tests.
  13270. 701.31 s [vector] postscanr': OK (0.01s)
  13271. 701.31 s [vector] +++ OK, passed 100 tests.
  13272. 701.31 s [vector] scanr: OK (0.01s)
  13273. 701.33 s [vector] +++ OK, passed 100 tests.
  13274. 701.33 s [vector] scanr': OK (0.01s)
  13275. 701.33 s [vector] +++ OK, passed 100 tests.
  13276. 701.34 s [vector] scanr1: OK (0.01s)
  13277. 701.35 s [vector] +++ OK, passed 100 tests.
  13278. 701.35 s [vector] scanr1': OK (0.01s)
  13279. 701.35 s [vector] +++ OK, passed 100 tests.
  13280. 701.35 s [vector] iscanr: OK (0.01s)
  13281. 701.35 s [vector] +++ OK, passed 100 tests.
  13282. 701.36 s [vector] iscanr': OK
  13283. 701.36 s [vector] +++ OK, passed 100 tests.
  13284. 701.37 s [vector] mut_read: OK
  13285. 701.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13286. 701.37 s [vector] mut_write: OK
  13287. 701.37 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13288. 701.37 s [vector] mut_modify: OK
  13289. 701.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13290. 701.38 s [vector] mut_generate: OK
  13291. 701.39 s [vector] +++ OK, passed 100 tests.
  13292. 701.39 s [vector] mut_generateM: OK (0.01s)
  13293. 701.39 s [vector] +++ OK, passed 100 tests.
  13294. 701.43 s [vector] mut_mapM_: OK (0.03s)
  13295. 701.43 s [vector] +++ OK, passed 100 tests.
  13296. 701.45 s [vector] mut_imapM_: OK (0.03s)
  13297. 701.45 s [vector] +++ OK, passed 100 tests.
  13298. 701.47 s [vector] mut_forM_: OK (0.03s)
  13299. 701.47 s [vector] +++ OK, passed 100 tests.
  13300. 701.51 s [vector] mut_iforM_: OK (0.02s)
  13301. 701.51 s [vector] +++ OK, passed 100 tests.
  13302. 701.53 s [vector] mut_foldr: OK (0.01s)
  13303. 701.53 s [vector] +++ OK, passed 100 tests.
  13304. 701.54 s [vector] mut_foldr': OK (0.01s)
  13305. 701.55 s [vector] +++ OK, passed 100 tests.
  13306. 701.55 s [vector] mut_foldl: OK (0.01s)
  13307. 701.56 s [vector] +++ OK, passed 100 tests.
  13308. 701.57 s [vector] mut_foldl': OK (0.01s)
  13309. 701.57 s [vector] +++ OK, passed 100 tests.
  13310. 701.58 s [vector] mut_ifoldr: OK (0.01s)
  13311. 701.59 s [vector] +++ OK, passed 100 tests.
  13312. 701.59 s [vector] mut_ifoldr': OK (0.01s)
  13313. 701.59 s [vector] +++ OK, passed 100 tests.
  13314. 701.61 s [vector] mut_ifoldl: OK (0.01s)
  13315. 701.61 s [vector] +++ OK, passed 100 tests.
  13316. 701.61 s [vector] mut_ifoldl': OK (0.01s)
  13317. 701.62 s [vector] +++ OK, passed 100 tests.
  13318. 701.63 s [vector] mut_foldM: OK (0.01s)
  13319. 701.63 s [vector] +++ OK, passed 100 tests.
  13320. 701.64 s [vector] mut_foldM': OK (0.01s)
  13321. 701.65 s [vector] +++ OK, passed 100 tests.
  13322. 701.65 s [vector] mut_foldrM: OK (0.01s)
  13323. 701.65 s [vector] +++ OK, passed 100 tests.
  13324. 701.67 s [vector] mut_foldrM': OK (0.01s)
  13325. 701.67 s [vector] +++ OK, passed 100 tests.
  13326. 701.67 s [vector] mut_ifoldM: OK (0.01s)
  13327. 701.68 s [vector] +++ OK, passed 100 tests.
  13328. 701.69 s [vector] mut_ifoldM': OK (0.01s)
  13329. 701.69 s [vector] +++ OK, passed 100 tests.
  13330. 701.70 s [vector] mut_ifoldrM: OK (0.01s)
  13331. 701.70 s [vector] +++ OK, passed 100 tests.
  13332. 701.71 s [vector] mut_ifoldrM': OK (0.01s)
  13333. 701.71 s [vector] +++ OK, passed 100 tests.
  13334. 701.71 s [vector] compare: OK
  13335. 701.71 s [vector] +++ OK, passed 100 tests.
  13336. 701.71 s [vector] maximum: OK
  13337. 701.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13338. 701.71 s [vector] minimum: OK
  13339. 701.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13340. 701.71 s [vector] minIndex: OK
  13341. 701.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13342. 701.71 s [vector] maxIndex: OK
  13343. 701.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13344. 701.72 s [vector] maximumBy: OK
  13345. 701.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13346. 701.72 s [vector] minimumBy: OK
  13347. 701.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13348. 701.72 s [vector] maximumOn: OK
  13349. 701.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13350. 701.72 s [vector] minimumOn: OK
  13351. 701.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13352. 701.72 s [vector] maxIndexBy: OK
  13353. 701.72 s [vector] +++ OK, passed 100 tests; 25 discarded.
  13354. 701.73 s [vector] minIndexBy: OK
  13355. 701.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13356. 701.73 s [vector] ListFirstMaxIndexWins: OK
  13357. 701.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13358. 701.73 s [vector] FalseListFirstMaxIndexWins: OK
  13359. 701.73 s [vector] +++ OK, failed as expected. (after 1 test):
  13360. 701.73 s [vector] Exception:
  13361. 701.73 s [vector] Prelude.foldr1: empty list
  13362. 701.73 s [vector] CallStack (from HasCallStack):
  13363. 701.73 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13364. 701.73 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13365. 701.73 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13366. 701.73 s [vector] []
  13367. 701.73 s [vector] zip: OK
  13368. 701.73 s [vector] +++ OK, passed 100 tests.
  13369. 701.75 s [vector] zip3: OK
  13370. 701.75 s [vector] +++ OK, passed 100 tests.
  13371. 701.75 s [vector] unzip: OK
  13372. 701.75 s [vector] +++ OK, passed 100 tests.
  13373. 701.76 s [vector] unzip3: OK
  13374. 701.76 s [vector] +++ OK, passed 100 tests.
  13375. 701.76 s [vector] indexed: OK
  13376. 701.76 s [vector] +++ OK, passed 100 tests.
  13377. 701.76 s [vector] update: OK
  13378. 701.76 s [vector] +++ OK, passed 100 tests.
  13379. 701.76 s [vector] mempty: OK
  13380. 701.76 s [vector] +++ OK, passed 100 tests.
  13381. 701.76 s [vector] mappend: OK
  13382. 701.76 s [vector] +++ OK, passed 100 tests.
  13383. 701.76 s [vector] mconcat: OK (0.02s)
  13384. 701.76 s [vector] +++ OK, passed 100 tests.
  13385. 701.76 s [vector] glength: OK
  13386. 701.76 s [vector] +++ OK, passed 100 tests.
  13387. 701.76 s [vector] sum: OK
  13388. 701.76 s [vector] +++ OK, passed 100 tests.
  13389. 701.76 s [vector] product: OK
  13390. 701.76 s [vector] +++ OK, passed 100 tests.
  13391. 701.76 s [vector] enumFromN: OK
  13392. 701.76 s [vector] +++ OK, passed 100 tests.
  13393. 701.76 s [vector] enumFromThenN: OK
  13394. 701.76 s [vector] +++ OK, passed 100 tests.
  13395. 701.76 s [vector] enumFromTo: OK
  13396. 701.76 s [vector] +++ OK, passed 100 tests.
  13397. 701.76 s [vector] enumFromThenTo: OK
  13398. 701.76 s [vector] +++ OK, passed 100 tests; 1 discarded.
  13399. 701.76 s [vector] (Int,Bool)
  13400. 701.76 s [vector] fromList.toList == id: OK
  13401. 701.76 s [vector] +++ OK, passed 100 tests.
  13402. 701.76 s [vector] toList.fromList == id: OK
  13403. 701.76 s [vector] +++ OK, passed 100 tests.
  13404. 701.76 s [vector] unstream.stream == id: OK
  13405. 701.77 s [vector] +++ OK, passed 100 tests.
  13406. 701.77 s [vector] stream.unstream == id: OK
  13407. 701.77 s [vector] +++ OK, passed 100 tests.
  13408. 701.77 s [vector] eq: OK
  13409. 701.77 s [vector] +++ OK, passed 100 tests.
  13410. 701.77 s [vector] length: OK
  13411. 701.77 s [vector] +++ OK, passed 100 tests.
  13412. 701.77 s [vector] null: OK
  13413. 701.77 s [vector] +++ OK, passed 100 tests.
  13414. 701.77 s [vector] index: OK
  13415. 701.77 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13416. 701.77 s [vector] safeIndex: OK
  13417. 701.77 s [vector] +++ OK, passed 100 tests.
  13418. 701.77 s [vector] head: OK
  13419. 701.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13420. 701.77 s [vector] last: OK
  13421. 701.77 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13422. 701.78 s [vector] unsafeIndex: OK
  13423. 701.78 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13424. 701.78 s [vector] unsafeHead: OK
  13425. 701.78 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13426. 701.78 s [vector] unsafeLast: OK
  13427. 701.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13428. 701.78 s [vector] slice: OK
  13429. 701.78 s [vector] +++ OK, passed 100 tests.
  13430. 701.78 s [vector] init: OK
  13431. 701.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13432. 701.78 s [vector] tail: OK
  13433. 701.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13434. 701.78 s [vector] take: OK
  13435. 701.78 s [vector] +++ OK, passed 100 tests.
  13436. 701.78 s [vector] drop: OK
  13437. 701.78 s [vector] +++ OK, passed 100 tests.
  13438. 701.78 s [vector] splitAt: OK
  13439. 701.78 s [vector] +++ OK, passed 100 tests.
  13440. 701.78 s [vector] empty: OK
  13441. 701.78 s [vector] +++ OK, passed 100 tests.
  13442. 701.78 s [vector] singleton: OK
  13443. 701.78 s [vector] +++ OK, passed 100 tests.
  13444. 701.78 s [vector] replicate: OK
  13445. 701.78 s [vector] +++ OK, passed 100 tests.
  13446. 701.79 s [vector] generate: OK
  13447. 701.79 s [vector] +++ OK, passed 100 tests.
  13448. 701.79 s [vector] iterateN: OK
  13449. 701.79 s [vector] +++ OK, passed 100 tests.
  13450. 701.81 s [vector] iterateNM: OK (0.01s)
  13451. 701.81 s [vector] +++ OK, passed 100 tests.
  13452. 701.83 s [vector] generateM: OK (0.02s)
  13453. 701.83 s [vector] +++ OK, passed 100 tests.
  13454. 701.83 s [vector] replicateM: OK (0.01s)
  13455. 701.83 s [vector] +++ OK, passed 100 tests.
  13456. 701.83 s [vector] create: OK
  13457. 701.84 s [vector] +++ OK, passed 100 tests.
  13458. 701.84 s [vector] createT: OK
  13459. 701.84 s [vector] +++ OK, passed 100 tests.
  13460. 701.84 s [vector] unfoldr: OK
  13461. 701.84 s [vector] +++ OK, passed 100 tests.
  13462. 701.84 s [vector] unfoldrN: OK
  13463. 701.84 s [vector] +++ OK, passed 100 tests.
  13464. 701.84 s [vector] unfoldrExactN: OK
  13465. 701.84 s [vector] +++ OK, passed 100 tests.
  13466. 701.85 s [vector] unfoldrM: OK
  13467. 701.85 s [vector] +++ OK, passed 100 tests.
  13468. 701.85 s [vector] unfoldrNM: OK
  13469. 701.85 s [vector] +++ OK, passed 100 tests.
  13470. 701.87 s [vector] unfoldrExactNM: OK (0.02s)
  13471. 701.87 s [vector] +++ OK, passed 100 tests.
  13472. 701.87 s [vector] constructN: OK
  13473. 701.88 s [vector] +++ OK, passed 100 tests.
  13474. 701.88 s [vector] constructrN: OK
  13475. 701.88 s [vector] +++ OK, passed 100 tests.
  13476. 701.89 s [vector] cons: OK
  13477. 701.89 s [vector] +++ OK, passed 100 tests.
  13478. 701.89 s [vector] snoc: OK
  13479. 701.89 s [vector] +++ OK, passed 100 tests.
  13480. 701.90 s [vector] append: OK
  13481. 701.90 s [vector] +++ OK, passed 100 tests.
  13482. 701.92 s [vector] concat: OK (0.04s)
  13483. 701.92 s [vector] +++ OK, passed 100 tests.
  13484. 701.92 s [vector] force: OK
  13485. 701.92 s [vector] +++ OK, passed 100 tests.
  13486. 701.92 s [vector] upd: OK
  13487. 701.92 s [vector] +++ OK, passed 100 tests.
  13488. 701.93 s [vector] accum: OK
  13489. 701.93 s [vector] +++ OK, passed 100 tests.
  13490. 701.93 s [vector] reverse: OK
  13491. 701.93 s [vector] +++ OK, passed 100 tests.
  13492. 701.94 s [vector] backpermute: OK
  13493. 701.94 s [vector] +++ OK, passed 100 tests.
  13494. 701.94 s [vector] map: OK
  13495. 701.94 s [vector] +++ OK, passed 100 tests.
  13496. 701.94 s [vector] imap: OK
  13497. 701.95 s [vector] +++ OK, passed 100 tests.
  13498. 701.95 s [vector] concatMap: OK
  13499. 701.95 s [vector] +++ OK, passed 100 tests.
  13500. 701.95 s [vector] mapM: OK
  13501. 701.95 s [vector] +++ OK, passed 100 tests.
  13502. 701.97 s [vector] mapM_: OK (0.02s)
  13503. 701.97 s [vector] +++ OK, passed 100 tests.
  13504. 701.97 s [vector] forM: OK
  13505. 701.97 s [vector] +++ OK, passed 100 tests.
  13506. 702.00 s [vector] forM_: OK (0.02s)
  13507. 702.00 s [vector] +++ OK, passed 100 tests.
  13508. 702.00 s [vector] imapM: OK
  13509. 702.00 s [vector] +++ OK, passed 100 tests.
  13510. 702.03 s [vector] imapM_: OK (0.02s)
  13511. 702.03 s [vector] +++ OK, passed 100 tests.
  13512. 702.04 s [vector] zipWith: OK
  13513. 702.04 s [vector] +++ OK, passed 100 tests.
  13514. 702.05 s [vector] zipWith3: OK
  13515. 702.05 s [vector] +++ OK, passed 100 tests.
  13516. 702.05 s [vector] izipWith: OK
  13517. 702.05 s [vector] +++ OK, passed 100 tests.
  13518. 702.05 s [vector] izipWith3: OK
  13519. 702.05 s [vector] +++ OK, passed 100 tests.
  13520. 702.05 s [vector] izipWithM: OK
  13521. 702.05 s [vector] +++ OK, passed 100 tests.
  13522. 702.07 s [vector] izipWithM_: OK (0.02s)
  13523. 702.07 s [vector] +++ OK, passed 100 tests.
  13524. 702.07 s [vector] zipWithM: OK
  13525. 702.07 s [vector] +++ OK, passed 100 tests.
  13526. 702.09 s [vector] zipWithM_: OK (0.02s)
  13527. 702.09 s [vector] +++ OK, passed 100 tests.
  13528. 702.09 s [vector] filter: OK
  13529. 702.09 s [vector] +++ OK, passed 100 tests.
  13530. 702.09 s [vector] ifilter: OK
  13531. 702.09 s [vector] +++ OK, passed 100 tests.
  13532. 702.12 s [vector] filterM: OK (0.02s)
  13533. 702.12 s [vector] +++ OK, passed 100 tests.
  13534. 702.12 s [vector] uniq: OK
  13535. 702.13 s [vector] +++ OK, passed 100 tests.
  13536. 702.13 s [vector] mapMaybe: OK
  13537. 702.13 s [vector] +++ OK, passed 100 tests.
  13538. 702.13 s [vector] imapMaybe: OK
  13539. 702.13 s [vector] +++ OK, passed 100 tests.
  13540. 702.13 s [vector] takeWhile: OK
  13541. 702.13 s [vector] +++ OK, passed 100 tests.
  13542. 702.13 s [vector] dropWhile: OK
  13543. 702.13 s [vector] +++ OK, passed 100 tests.
  13544. 702.13 s [vector] partition: OK
  13545. 702.13 s [vector] +++ OK, passed 100 tests.
  13546. 702.14 s [vector] partitionWith: OK
  13547. 702.14 s [vector] +++ OK, passed 100 tests.
  13548. 702.14 s [vector] span: OK
  13549. 702.14 s [vector] +++ OK, passed 100 tests.
  13550. 702.14 s [vector] break: OK
  13551. 702.14 s [vector] +++ OK, passed 100 tests.
  13552. 702.14 s [vector] spanR: OK
  13553. 702.14 s [vector] +++ OK, passed 100 tests.
  13554. 702.15 s [vector] breakR: OK
  13555. 702.15 s [vector] +++ OK, passed 100 tests.
  13556. 702.15 s [vector] groupBy: OK
  13557. 702.15 s [vector] +++ OK, passed 100 tests.
  13558. 702.15 s [vector] elem: OK
  13559. 702.15 s [vector] +++ OK, passed 100 tests.
  13560. 702.15 s [vector] notElem: OK
  13561. 702.15 s [vector] +++ OK, passed 100 tests.
  13562. 702.15 s [vector] find: OK
  13563. 702.15 s [vector] +++ OK, passed 100 tests.
  13564. 702.15 s [vector] findIndex: OK
  13565. 702.15 s [vector] +++ OK, passed 100 tests.
  13566. 702.16 s [vector] findIndexR: OK
  13567. 702.16 s [vector] +++ OK, passed 100 tests.
  13568. 702.16 s [vector] findIndices: OK
  13569. 702.16 s [vector] +++ OK, passed 100 tests.
  13570. 702.16 s [vector] elemIndex: OK
  13571. 702.16 s [vector] +++ OK, passed 100 tests.
  13572. 702.16 s [vector] elemIndices: OK
  13573. 702.17 s [vector] +++ OK, passed 100 tests.
  13574. 702.17 s [vector] foldl: OK
  13575. 702.17 s [vector] +++ OK, passed 100 tests.
  13576. 702.17 s [vector] foldl1: OK
  13577. 702.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13578. 702.17 s [vector] foldl': OK
  13579. 702.18 s [vector] +++ OK, passed 100 tests.
  13580. 702.18 s [vector] foldl1': OK
  13581. 702.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13582. 702.18 s [vector] foldr: OK
  13583. 702.18 s [vector] +++ OK, passed 100 tests.
  13584. 702.18 s [vector] foldr1: OK
  13585. 702.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13586. 702.18 s [vector] foldr': OK
  13587. 702.18 s [vector] +++ OK, passed 100 tests.
  13588. 702.19 s [vector] foldr1': OK
  13589. 702.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13590. 702.19 s [vector] ifoldl: OK
  13591. 702.20 s [vector] +++ OK, passed 100 tests.
  13592. 702.21 s [vector] ifoldl': OK
  13593. 702.21 s [vector] +++ OK, passed 100 tests.
  13594. 702.21 s [vector] ifoldr: OK
  13595. 702.21 s [vector] +++ OK, passed 100 tests.
  13596. 702.21 s [vector] ifoldr': OK
  13597. 702.21 s [vector] +++ OK, passed 100 tests.
  13598. 702.21 s [vector] ifoldM: OK
  13599. 702.21 s [vector] +++ OK, passed 100 tests.
  13600. 702.21 s [vector] ifoldM': OK
  13601. 702.21 s [vector] +++ OK, passed 100 tests.
  13602. 702.25 s [vector] ifoldM_: OK (0.03s)
  13603. 702.25 s [vector] +++ OK, passed 100 tests.
  13604. 702.26 s [vector] ifoldM'_: OK (0.03s)
  13605. 702.26 s [vector] +++ OK, passed 100 tests.
  13606. 702.26 s [vector] all: OK
  13607. 702.26 s [vector] +++ OK, passed 100 tests.
  13608. 702.27 s [vector] any: OK
  13609. 702.27 s [vector] +++ OK, passed 100 tests.
  13610. 702.27 s [vector] prescanl: OK
  13611. 702.27 s [vector] +++ OK, passed 100 tests.
  13612. 702.27 s [vector] prescanl': OK
  13613. 702.27 s [vector] +++ OK, passed 100 tests.
  13614. 702.29 s [vector] postscanl: OK (0.01s)
  13615. 702.29 s [vector] +++ OK, passed 100 tests.
  13616. 702.29 s [vector] postscanl': OK
  13617. 702.29 s [vector] +++ OK, passed 100 tests.
  13618. 702.29 s [vector] scanl: OK
  13619. 702.29 s [vector] +++ OK, passed 100 tests.
  13620. 702.30 s [vector] scanl': OK
  13621. 702.30 s [vector] +++ OK, passed 100 tests.
  13622. 702.30 s [vector] scanl1: OK
  13623. 702.30 s [vector] +++ OK, passed 100 tests.
  13624. 702.31 s [vector] scanl1': OK
  13625. 702.31 s [vector] +++ OK, passed 100 tests.
  13626. 702.31 s [vector] iscanl: OK
  13627. 702.31 s [vector] +++ OK, passed 100 tests.
  13628. 702.32 s [vector] iscanl': OK
  13629. 702.32 s [vector] +++ OK, passed 100 tests.
  13630. 702.33 s [vector] prescanr: OK
  13631. 702.33 s [vector] +++ OK, passed 100 tests.
  13632. 702.33 s [vector] prescanr': OK
  13633. 702.33 s [vector] +++ OK, passed 100 tests.
  13634. 702.33 s [vector] postscanr: OK
  13635. 702.33 s [vector] +++ OK, passed 100 tests.
  13636. 702.33 s [vector] postscanr': OK
  13637. 702.33 s [vector] +++ OK, passed 100 tests.
  13638. 702.33 s [vector] scanr: OK
  13639. 702.34 s [vector] +++ OK, passed 100 tests.
  13640. 702.34 s [vector] scanr': OK
  13641. 702.34 s [vector] +++ OK, passed 100 tests.
  13642. 702.35 s [vector] scanr1: OK
  13643. 702.35 s [vector] +++ OK, passed 100 tests.
  13644. 702.35 s [vector] scanr1': OK
  13645. 702.35 s [vector] +++ OK, passed 100 tests.
  13646. 702.36 s [vector] iscanr: OK
  13647. 702.36 s [vector] +++ OK, passed 100 tests.
  13648. 702.36 s [vector] iscanr': OK
  13649. 702.36 s [vector] +++ OK, passed 100 tests.
  13650. 702.36 s [vector] mut_read: OK
  13651. 702.36 s [vector] +++ OK, passed 100 tests; 26 discarded.
  13652. 702.36 s [vector] mut_write: OK
  13653. 702.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13654. 702.36 s [vector] mut_modify: OK
  13655. 702.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13656. 702.37 s [vector] mut_generate: OK
  13657. 702.37 s [vector] +++ OK, passed 100 tests.
  13658. 702.38 s [vector] mut_generateM: OK (0.02s)
  13659. 702.38 s [vector] +++ OK, passed 100 tests.
  13660. 702.41 s [vector] mut_mapM_: OK (0.01s)
  13661. 702.41 s [vector] +++ OK, passed 100 tests.
  13662. 702.43 s [vector] mut_imapM_: OK (0.02s)
  13663. 702.43 s [vector] +++ OK, passed 100 tests.
  13664. 702.45 s [vector] mut_forM_: OK (0.02s)
  13665. 702.45 s [vector] +++ OK, passed 100 tests.
  13666. 702.47 s [vector] mut_iforM_: OK (0.02s)
  13667. 702.48 s [vector] +++ OK, passed 100 tests.
  13668. 702.48 s [vector] mut_foldr: OK
  13669. 702.48 s [vector] +++ OK, passed 100 tests.
  13670. 702.48 s [vector] mut_foldr': OK
  13671. 702.48 s [vector] +++ OK, passed 100 tests.
  13672. 702.48 s [vector] mut_foldl: OK
  13673. 702.48 s [vector] +++ OK, passed 100 tests.
  13674. 702.48 s [vector] mut_foldl': OK
  13675. 702.48 s [vector] +++ OK, passed 100 tests.
  13676. 702.49 s [vector] mut_ifoldr: OK
  13677. 702.49 s [vector] +++ OK, passed 100 tests.
  13678. 702.49 s [vector] mut_ifoldr': OK
  13679. 702.49 s [vector] +++ OK, passed 100 tests.
  13680. 702.50 s [vector] mut_ifoldl: OK
  13681. 702.50 s [vector] +++ OK, passed 100 tests.
  13682. 702.50 s [vector] mut_ifoldl': OK
  13683. 702.50 s [vector] +++ OK, passed 100 tests.
  13684. 702.51 s [vector] mut_foldM: OK
  13685. 702.51 s [vector] +++ OK, passed 100 tests.
  13686. 702.51 s [vector] mut_foldM': OK
  13687. 702.51 s [vector] +++ OK, passed 100 tests.
  13688. 702.52 s [vector] mut_foldrM: OK
  13689. 702.52 s [vector] +++ OK, passed 100 tests.
  13690. 702.52 s [vector] mut_foldrM': OK
  13691. 702.52 s [vector] +++ OK, passed 100 tests.
  13692. 702.52 s [vector] mut_ifoldM: OK
  13693. 702.52 s [vector] +++ OK, passed 100 tests.
  13694. 702.52 s [vector] mut_ifoldM': OK
  13695. 702.52 s [vector] +++ OK, passed 100 tests.
  13696. 702.52 s [vector] mut_ifoldrM: OK
  13697. 702.52 s [vector] +++ OK, passed 100 tests.
  13698. 702.53 s [vector] mut_ifoldrM': OK
  13699. 702.53 s [vector] +++ OK, passed 100 tests.
  13700. 702.53 s [vector] compare: OK
  13701. 702.53 s [vector] +++ OK, passed 100 tests.
  13702. 702.53 s [vector] maximum: OK
  13703. 702.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13704. 702.53 s [vector] minimum: OK
  13705. 702.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13706. 702.54 s [vector] minIndex: OK
  13707. 702.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13708. 702.54 s [vector] maxIndex: OK
  13709. 702.54 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13710. 702.54 s [vector] maximumBy: OK
  13711. 702.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13712. 702.54 s [vector] minimumBy: OK
  13713. 702.54 s [vector] +++ OK, passed 100 tests; 10 discarded.
  13714. 702.54 s [vector] maximumOn: OK
  13715. 702.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13716. 702.54 s [vector] minimumOn: OK
  13717. 702.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13718. 702.54 s [vector] maxIndexBy: OK
  13719. 702.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13720. 702.54 s [vector] minIndexBy: OK
  13721. 702.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13722. 702.54 s [vector] ListFirstMaxIndexWins: OK
  13723. 702.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13724. 702.54 s [vector] FalseListFirstMaxIndexWins: OK
  13725. 702.54 s [vector] +++ OK, failed as expected. (after 1 test):
  13726. 702.54 s [vector] Exception:
  13727. 702.54 s [vector] Prelude.foldr1: empty list
  13728. 702.54 s [vector] CallStack (from HasCallStack):
  13729. 702.54 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13730. 702.54 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13731. 702.54 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13732. 702.54 s [vector] []
  13733. 702.55 s [vector] zip: OK
  13734. 702.55 s [vector] +++ OK, passed 100 tests.
  13735. 702.55 s [vector] zip3: OK
  13736. 702.55 s [vector] +++ OK, passed 100 tests.
  13737. 702.55 s [vector] unzip: OK
  13738. 702.55 s [vector] +++ OK, passed 100 tests.
  13739. 702.56 s [vector] unzip3: OK
  13740. 702.56 s [vector] +++ OK, passed 100 tests.
  13741. 702.56 s [vector] indexed: OK
  13742. 702.57 s [vector] +++ OK, passed 100 tests.
  13743. 702.57 s [vector] update: OK
  13744. 702.57 s [vector] +++ OK, passed 100 tests.
  13745. 702.57 s [vector] mempty: OK
  13746. 702.57 s [vector] +++ OK, passed 100 tests.
  13747. 702.58 s [vector] mappend: OK
  13748. 702.58 s [vector] +++ OK, passed 100 tests.
  13749. 702.60 s [vector] mconcat: OK (0.04s)
  13750. 702.60 s [vector] +++ OK, passed 100 tests.
  13751. 702.60 s [vector] glength: OK
  13752. 702.60 s [vector] +++ OK, passed 100 tests.
  13753. 702.60 s [vector] (Int,Bool,Int)
  13754. 702.60 s [vector] fromList.toList == id: OK
  13755. 702.60 s [vector] +++ OK, passed 100 tests.
  13756. 702.60 s [vector] toList.fromList == id: OK
  13757. 702.60 s [vector] +++ OK, passed 100 tests.
  13758. 702.61 s [vector] unstream.stream == id: OK
  13759. 702.61 s [vector] +++ OK, passed 100 tests.
  13760. 702.61 s [vector] stream.unstream == id: OK
  13761. 702.61 s [vector] +++ OK, passed 100 tests.
  13762. 702.61 s [vector] eq: OK
  13763. 702.61 s [vector] +++ OK, passed 100 tests.
  13764. 702.61 s [vector] length: OK
  13765. 702.61 s [vector] +++ OK, passed 100 tests.
  13766. 702.61 s [vector] null: OK
  13767. 702.61 s [vector] +++ OK, passed 100 tests.
  13768. 702.61 s [vector] index: OK
  13769. 702.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13770. 702.61 s [vector] safeIndex: OK
  13771. 702.61 s [vector] +++ OK, passed 100 tests.
  13772. 702.61 s [vector] head: OK
  13773. 702.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13774. 702.61 s [vector] last: OK
  13775. 702.61 s [vector] +++ OK, passed 100 tests; 24 discarded.
  13776. 702.61 s [vector] unsafeIndex: OK
  13777. 702.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13778. 702.61 s [vector] unsafeHead: OK
  13779. 702.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13780. 702.61 s [vector] unsafeLast: OK
  13781. 702.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13782. 702.61 s [vector] slice: OK
  13783. 702.61 s [vector] +++ OK, passed 100 tests.
  13784. 702.62 s [vector] init: OK
  13785. 702.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13786. 702.62 s [vector] tail: OK
  13787. 702.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13788. 702.62 s [vector] take: OK
  13789. 702.62 s [vector] +++ OK, passed 100 tests.
  13790. 702.62 s [vector] drop: OK
  13791. 702.62 s [vector] +++ OK, passed 100 tests.
  13792. 702.62 s [vector] splitAt: OK
  13793. 702.62 s [vector] +++ OK, passed 100 tests.
  13794. 702.62 s [vector] empty: OK
  13795. 702.62 s [vector] +++ OK, passed 100 tests.
  13796. 702.62 s [vector] singleton: OK
  13797. 702.62 s [vector] +++ OK, passed 100 tests.
  13798. 702.62 s [vector] replicate: OK
  13799. 702.63 s [vector] +++ OK, passed 100 tests.
  13800. 702.63 s [vector] generate: OK
  13801. 702.63 s [vector] +++ OK, passed 100 tests.
  13802. 702.63 s [vector] iterateN: OK
  13803. 702.63 s [vector] +++ OK, passed 100 tests.
  13804. 702.65 s [vector] iterateNM: OK (0.02s)
  13805. 702.65 s [vector] +++ OK, passed 100 tests.
  13806. 702.69 s [vector] generateM: OK (0.04s)
  13807. 702.69 s [vector] +++ OK, passed 100 tests.
  13808. 702.70 s [vector] replicateM: OK (0.01s)
  13809. 702.70 s [vector] +++ OK, passed 100 tests.
  13810. 702.70 s [vector] create: OK
  13811. 702.70 s [vector] +++ OK, passed 100 tests.
  13812. 702.70 s [vector] createT: OK
  13813. 702.70 s [vector] +++ OK, passed 100 tests.
  13814. 702.70 s [vector] unfoldr: OK
  13815. 702.70 s [vector] +++ OK, passed 100 tests.
  13816. 702.70 s [vector] unfoldrN: OK
  13817. 702.70 s [vector] +++ OK, passed 100 tests.
  13818. 702.70 s [vector] unfoldrExactN: OK
  13819. 702.70 s [vector] +++ OK, passed 100 tests.
  13820. 702.70 s [vector] unfoldrM: OK
  13821. 702.70 s [vector] +++ OK, passed 100 tests.
  13822. 702.71 s [vector] unfoldrNM: OK
  13823. 702.71 s [vector] +++ OK, passed 100 tests.
  13824. 702.73 s [vector] unfoldrExactNM: OK (0.02s)
  13825. 702.73 s [vector] +++ OK, passed 100 tests.
  13826. 702.74 s [vector] constructN: OK
  13827. 702.74 s [vector] +++ OK, passed 100 tests.
  13828. 702.74 s [vector] constructrN: OK
  13829. 702.74 s [vector] +++ OK, passed 100 tests.
  13830. 702.74 s [vector] cons: OK
  13831. 702.74 s [vector] +++ OK, passed 100 tests.
  13832. 702.74 s [vector] snoc: OK
  13833. 702.75 s [vector] +++ OK, passed 100 tests.
  13834. 702.75 s [vector] append: OK
  13835. 702.75 s [vector] +++ OK, passed 100 tests.
  13836. 702.80 s [vector] concat: OK (0.05s)
  13837. 702.80 s [vector] +++ OK, passed 100 tests.
  13838. 702.80 s [vector] force: OK
  13839. 702.80 s [vector] +++ OK, passed 100 tests.
  13840. 702.80 s [vector] upd: OK
  13841. 702.80 s [vector] +++ OK, passed 100 tests.
  13842. 702.81 s [vector] accum: OK
  13843. 702.81 s [vector] +++ OK, passed 100 tests.
  13844. 702.81 s [vector] reverse: OK
  13845. 702.81 s [vector] +++ OK, passed 100 tests.
  13846. 702.81 s [vector] backpermute: OK
  13847. 702.81 s [vector] +++ OK, passed 100 tests.
  13848. 702.82 s [vector] map: OK
  13849. 702.82 s [vector] +++ OK, passed 100 tests.
  13850. 702.82 s [vector] imap: OK
  13851. 702.82 s [vector] +++ OK, passed 100 tests.
  13852. 702.84 s [vector] concatMap: OK
  13853. 702.84 s [vector] +++ OK, passed 100 tests.
  13854. 702.84 s [vector] mapM: OK
  13855. 702.84 s [vector] +++ OK, passed 100 tests.
  13856. 702.89 s [vector] mapM_: OK (0.05s)
  13857. 702.89 s [vector] +++ OK, passed 100 tests.
  13858. 702.89 s [vector] forM: OK
  13859. 702.89 s [vector] +++ OK, passed 100 tests.
  13860. 702.92 s [vector] forM_: OK (0.03s)
  13861. 702.93 s [vector] +++ OK, passed 100 tests.
  13862. 702.93 s [vector] imapM: OK
  13863. 702.93 s [vector] +++ OK, passed 100 tests.
  13864. 702.97 s [vector] imapM_: OK (0.04s)
  13865. 702.97 s [vector] +++ OK, passed 100 tests.
  13866. 702.97 s [vector] zipWith: OK
  13867. 702.97 s [vector] +++ OK, passed 100 tests.
  13868. 702.98 s [vector] zipWith3: OK
  13869. 702.98 s [vector] +++ OK, passed 100 tests.
  13870. 702.98 s [vector] izipWith: OK
  13871. 702.98 s [vector] +++ OK, passed 100 tests.
  13872. 702.99 s [vector] izipWith3: OK
  13873. 702.99 s [vector] +++ OK, passed 100 tests.
  13874. 702.99 s [vector] izipWithM: OK
  13875. 702.99 s [vector] +++ OK, passed 100 tests.
  13876. 703.03 s [vector] izipWithM_: OK (0.03s)
  13877. 703.03 s [vector] +++ OK, passed 100 tests.
  13878. 703.03 s [vector] zipWithM: OK
  13879. 703.03 s [vector] +++ OK, passed 100 tests.
  13880. 703.06 s [vector] zipWithM_: OK (0.03s)
  13881. 703.06 s [vector] +++ OK, passed 100 tests.
  13882. 703.07 s [vector] filter: OK
  13883. 703.07 s [vector] +++ OK, passed 100 tests.
  13884. 703.07 s [vector] ifilter: OK
  13885. 703.07 s [vector] +++ OK, passed 100 tests.
  13886. 703.11 s [vector] filterM: OK (0.05s)
  13887. 703.12 s [vector] +++ OK, passed 100 tests.
  13888. 703.12 s [vector] uniq: OK
  13889. 703.13 s [vector] +++ OK, passed 100 tests.
  13890. 703.13 s [vector] mapMaybe: OK
  13891. 703.13 s [vector] +++ OK, passed 100 tests.
  13892. 703.13 s [vector] imapMaybe: OK
  13893. 703.13 s [vector] +++ OK, passed 100 tests.
  13894. 703.13 s [vector] takeWhile: OK
  13895. 703.13 s [vector] +++ OK, passed 100 tests.
  13896. 703.14 s [vector] dropWhile: OK
  13897. 703.14 s [vector] +++ OK, passed 100 tests.
  13898. 703.14 s [vector] partition: OK
  13899. 703.15 s [vector] +++ OK, passed 100 tests.
  13900. 703.15 s [vector] partitionWith: OK
  13901. 703.15 s [vector] +++ OK, passed 100 tests.
  13902. 703.15 s [vector] span: OK
  13903. 703.15 s [vector] +++ OK, passed 100 tests.
  13904. 703.15 s [vector] break: OK
  13905. 703.15 s [vector] +++ OK, passed 100 tests.
  13906. 703.15 s [vector] spanR: OK
  13907. 703.15 s [vector] +++ OK, passed 100 tests.
  13908. 703.15 s [vector] breakR: OK
  13909. 703.15 s [vector] +++ OK, passed 100 tests.
  13910. 703.15 s [vector] groupBy: OK
  13911. 703.15 s [vector] +++ OK, passed 100 tests.
  13912. 703.15 s [vector] elem: OK
  13913. 703.15 s [vector] +++ OK, passed 100 tests.
  13914. 703.16 s [vector] notElem: OK
  13915. 703.16 s [vector] +++ OK, passed 100 tests.
  13916. 703.16 s [vector] find: OK
  13917. 703.16 s [vector] +++ OK, passed 100 tests.
  13918. 703.16 s [vector] findIndex: OK
  13919. 703.16 s [vector] +++ OK, passed 100 tests.
  13920. 703.16 s [vector] findIndexR: OK
  13921. 703.16 s [vector] +++ OK, passed 100 tests.
  13922. 703.16 s [vector] findIndices: OK
  13923. 703.16 s [vector] +++ OK, passed 100 tests.
  13924. 703.16 s [vector] elemIndex: OK
  13925. 703.17 s [vector] +++ OK, passed 100 tests.
  13926. 703.17 s [vector] elemIndices: OK
  13927. 703.18 s [vector] +++ OK, passed 100 tests.
  13928. 703.19 s [vector] foldl: OK
  13929. 703.19 s [vector] +++ OK, passed 100 tests.
  13930. 703.19 s [vector] foldl1: OK
  13931. 703.19 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13932. 703.19 s [vector] foldl': OK
  13933. 703.19 s [vector] +++ OK, passed 100 tests.
  13934. 703.19 s [vector] foldl1': OK
  13935. 703.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13936. 703.19 s [vector] foldr: OK
  13937. 703.19 s [vector] +++ OK, passed 100 tests.
  13938. 703.20 s [vector] foldr1: OK
  13939. 703.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13940. 703.20 s [vector] foldr': OK
  13941. 703.20 s [vector] +++ OK, passed 100 tests.
  13942. 703.21 s [vector] foldr1': OK
  13943. 703.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13944. 703.22 s [vector] ifoldl: OK
  13945. 703.22 s [vector] +++ OK, passed 100 tests.
  13946. 703.22 s [vector] ifoldl': OK
  13947. 703.22 s [vector] +++ OK, passed 100 tests.
  13948. 703.23 s [vector] ifoldr: OK
  13949. 703.23 s [vector] +++ OK, passed 100 tests.
  13950. 703.24 s [vector] ifoldr': OK
  13951. 703.24 s [vector] +++ OK, passed 100 tests.
  13952. 703.24 s [vector] ifoldM: OK
  13953. 703.24 s [vector] +++ OK, passed 100 tests.
  13954. 703.25 s [vector] ifoldM': OK
  13955. 703.25 s [vector] +++ OK, passed 100 tests.
  13956. 703.29 s [vector] ifoldM_: OK (0.04s)
  13957. 703.29 s [vector] +++ OK, passed 100 tests.
  13958. 703.32 s [vector] ifoldM'_: OK (0.04s)
  13959. 703.32 s [vector] +++ OK, passed 100 tests.
  13960. 703.32 s [vector] all: OK
  13961. 703.32 s [vector] +++ OK, passed 100 tests.
  13962. 703.33 s [vector] any: OK
  13963. 703.33 s [vector] +++ OK, passed 100 tests.
  13964. 703.33 s [vector] prescanl: OK
  13965. 703.34 s [vector] +++ OK, passed 100 tests.
  13966. 703.34 s [vector] prescanl': OK
  13967. 703.34 s [vector] +++ OK, passed 100 tests.
  13968. 703.35 s [vector] postscanl: OK
  13969. 703.35 s [vector] +++ OK, passed 100 tests.
  13970. 703.35 s [vector] postscanl': OK
  13971. 703.35 s [vector] +++ OK, passed 100 tests.
  13972. 703.35 s [vector] scanl: OK
  13973. 703.35 s [vector] +++ OK, passed 100 tests.
  13974. 703.37 s [vector] scanl': OK
  13975. 703.37 s [vector] +++ OK, passed 100 tests.
  13976. 703.37 s [vector] scanl1: OK
  13977. 703.63 s [vector] +++ OK, passed 100 tests.
  13978. 703.63 s [vector] scanl1': OK
  13979. 703.63 s [vector] +++ OK, passed 100 tests.
  13980. 703.63 s [vector] iscanl: OK
  13981. 703.63 s [vector] +++ OK, passed 100 tests.
  13982. 703.63 s [vector] iscanl': OK
  13983. 703.63 s [vector] +++ OK, passed 100 tests.
  13984. 703.63 s [vector] prescanr: OK
  13985. 703.63 s [vector] +++ OK, passed 100 tests.
  13986. 703.63 s [vector] prescanr': OK
  13987. 703.63 s [vector] +++ OK, passed 100 tests.
  13988. 703.63 s [vector] postscanr: OK
  13989. 703.63 s [vector] +++ OK, passed 100 tests.
  13990. 703.63 s [vector] postscanr': OK
  13991. 703.63 s [vector] +++ OK, passed 100 tests.
  13992. 703.63 s [vector] scanr: OK
  13993. 703.63 s [vector] +++ OK, passed 100 tests.
  13994. 703.63 s [vector] scanr': OK
  13995. 703.63 s [vector] +++ OK, passed 100 tests.
  13996. 703.63 s [vector] scanr1: OK
  13997. 703.63 s [vector] +++ OK, passed 100 tests.
  13998. 703.63 s [vector] scanr1': OK
  13999. 703.63 s [vector] +++ OK, passed 100 tests.
  14000. 703.63 s [vector] iscanr: OK
  14001. 703.63 s [vector] +++ OK, passed 100 tests.
  14002. 703.63 s [vector] iscanr': OK
  14003. 703.63 s [vector] +++ OK, passed 100 tests.
  14004. 703.63 s [vector] mut_read: OK
  14005. 703.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14006. 703.63 s [vector] mut_write: OK
  14007. 703.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14008. 703.63 s [vector] mut_modify: OK
  14009. 703.63 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14010. 703.63 s [vector] mut_generate: OK
  14011. 703.63 s [vector] +++ OK, passed 100 tests.
  14012. 703.63 s [vector] mut_generateM: OK (0.03s)
  14013. 703.63 s [vector] +++ OK, passed 100 tests.
  14014. 703.63 s [vector] mut_mapM_: OK (0.02s)
  14015. 703.63 s [vector] +++ OK, passed 100 tests.
  14016. 703.63 s [vector] mut_imapM_: OK (0.04s)
  14017. 703.63 s [vector] +++ OK, passed 100 tests.
  14018. 703.63 s [vector] mut_forM_: OK (0.04s)
  14019. 703.63 s [vector] +++ OK, passed 100 tests.
  14020. 703.64 s [vector] mut_iforM_: OK (0.03s)
  14021. 703.65 s [vector] +++ OK, passed 100 tests.
  14022. 703.65 s [vector] mut_foldr: OK
  14023. 703.65 s [vector] +++ OK, passed 100 tests.
  14024. 703.65 s [vector] mut_foldr': OK
  14025. 703.65 s [vector] +++ OK, passed 100 tests.
  14026. 703.65 s [vector] mut_foldl: OK
  14027. 703.65 s [vector] +++ OK, passed 100 tests.
  14028. 703.66 s [vector] mut_foldl': OK
  14029. 703.66 s [vector] +++ OK, passed 100 tests.
  14030. 703.67 s [vector] mut_ifoldr: OK
  14031. 703.67 s [vector] +++ OK, passed 100 tests.
  14032. 703.67 s [vector] mut_ifoldr': OK
  14033. 703.67 s [vector] +++ OK, passed 100 tests.
  14034. 703.68 s [vector] mut_ifoldl: OK
  14035. 703.68 s [vector] +++ OK, passed 100 tests.
  14036. 703.68 s [vector] mut_ifoldl': OK
  14037. 703.68 s [vector] +++ OK, passed 100 tests.
  14038. 703.69 s [vector] mut_foldM: OK
  14039. 703.69 s [vector] +++ OK, passed 100 tests.
  14040. 703.69 s [vector] mut_foldM': OK
  14041. 703.70 s [vector] +++ OK, passed 100 tests.
  14042. 703.71 s [vector] mut_foldrM: OK
  14043. 703.71 s [vector] +++ OK, passed 100 tests.
  14044. 703.71 s [vector] mut_foldrM': OK
  14045. 703.71 s [vector] +++ OK, passed 100 tests.
  14046. 703.71 s [vector] mut_ifoldM: OK
  14047. 703.71 s [vector] +++ OK, passed 100 tests.
  14048. 703.71 s [vector] mut_ifoldM': OK
  14049. 703.71 s [vector] +++ OK, passed 100 tests.
  14050. 703.72 s [vector] mut_ifoldrM: OK
  14051. 703.72 s [vector] +++ OK, passed 100 tests.
  14052. 703.72 s [vector] mut_ifoldrM': OK
  14053. 703.72 s [vector] +++ OK, passed 100 tests.
  14054. 703.72 s [vector] compare: OK
  14055. 703.73 s [vector] +++ OK, passed 100 tests.
  14056. 703.73 s [vector] maximum: OK
  14057. 703.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14058. 703.73 s [vector] minimum: OK
  14059. 703.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14060. 703.73 s [vector] minIndex: OK
  14061. 703.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14062. 703.73 s [vector] maxIndex: OK
  14063. 703.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14064. 703.73 s [vector] maximumBy: OK
  14065. 703.73 s [vector] +++ OK, passed 100 tests; 28 discarded.
  14066. 703.73 s [vector] minimumBy: OK
  14067. 703.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14068. 703.73 s [vector] maximumOn: OK
  14069. 703.73 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14070. 703.73 s [vector] minimumOn: OK
  14071. 703.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14072. 703.74 s [vector] maxIndexBy: OK
  14073. 703.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14074. 703.74 s [vector] minIndexBy: OK
  14075. 703.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14076. 703.74 s [vector] ListFirstMaxIndexWins: OK
  14077. 703.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14078. 703.74 s [vector] FalseListFirstMaxIndexWins: OK
  14079. 703.74 s [vector] +++ OK, failed as expected. (after 1 test):
  14080. 703.74 s [vector] Exception:
  14081. 703.74 s [vector] Prelude.foldr1: empty list
  14082. 703.74 s [vector] CallStack (from HasCallStack):
  14083. 703.74 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  14084. 703.74 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  14085. 703.74 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  14086. 703.74 s [vector] []
  14087. 703.75 s [vector] zip: OK
  14088. 703.75 s [vector] +++ OK, passed 100 tests.
  14089. 703.75 s [vector] zip3: OK
  14090. 703.75 s [vector] +++ OK, passed 100 tests.
  14091. 703.75 s [vector] unzip: OK
  14092. 703.75 s [vector] +++ OK, passed 100 tests.
  14093. 703.75 s [vector] unzip3: OK
  14094. 703.75 s [vector] +++ OK, passed 100 tests.
  14095. 703.75 s [vector] indexed: OK
  14096. 703.75 s [vector] +++ OK, passed 100 tests.
  14097. 703.76 s [vector] update: OK
  14098. 703.76 s [vector] +++ OK, passed 100 tests.
  14099. 703.76 s [vector] mempty: OK
  14100. 703.76 s [vector] +++ OK, passed 100 tests.
  14101. 703.76 s [vector] mappend: OK
  14102. 703.77 s [vector] +++ OK, passed 100 tests.
  14103. 703.81 s [vector] mconcat: OK (0.05s)
  14104. 703.81 s [vector] +++ OK, passed 100 tests.
  14105. 703.81 s [vector] glength: OK
  14106. 703.81 s [vector] +++ OK, passed 100 tests.
  14107. 703.81 s [vector] unstream
  14108. 703.81 s [vector] unstream == vunstream (exact): OK
  14109. 703.81 s [vector] +++ OK, passed 100 tests.
  14110. 703.81 s [vector] unstream == vunstream (unknown): OK
  14111. 703.81 s [vector] +++ OK, passed 100 tests.
  14112. 703.81 s [vector] unstreamR ~= vunstream (exact): OK
  14113. 703.81 s [vector] +++ OK, passed 100 tests.
  14114. 703.81 s [vector] unstreamR ~= vunstream (unknown): OK
  14115. 703.81 s [vector] +++ OK, passed 100 tests.
  14116. 703.81 s [vector] Data.Vector.Storable.Vector Alignment
  14117. 703.81 s [vector] Aligned Double: OK
  14118. 703.81 s [vector] Aligned Int: OK
  14119. 703.81 s [vector] Regression tests
  14120. 703.81 s [vector] enumFromTo crash #188
  14121. 703.81 s [vector] Word8: OK
  14122. 703.81 s [vector] Word16: OK
  14123. 703.81 s [vector] Word32: OK
  14124. 703.81 s [vector] Word64: OK
  14125. 703.81 s [vector] Word: OK
  14126. 703.81 s [vector] Int8: OK
  14127. 703.81 s [vector] Int16: OK
  14128. 703.81 s [vector] Int32: OK
  14129. 703.81 s [vector] Int64: OK
  14130. 703.81 s [vector] Int: OK
  14131. 703.81 s [vector] Char: OK
  14132. 703.81 s [vector] Negative tests
  14133. 703.81 s [vector] slice out of bounds #257
  14134. 703.81 s [vector] Boxed
  14135. 703.81 s [vector] Negative ix: OK
  14136. 703.81 s [vector] Negative size: OK
  14137. 703.81 s [vector] Negative ix and size: OK
  14138. 703.81 s [vector] Too large ix: OK
  14139. 703.81 s [vector] Too large size: OK
  14140. 703.81 s [vector] Too large ix and size: OK
  14141. 703.81 s [vector] Overflow: OK
  14142. 703.81 s [vector] OutOfMemory: OK
  14143. 703.81 s [vector] Primitive
  14144. 703.81 s [vector] Negative ix: OK
  14145. 703.81 s [vector] Negative size: OK
  14146. 703.82 s [vector] Negative ix and size: OK
  14147. 703.82 s [vector] Too large ix: OK
  14148. 703.82 s [vector] Too large size: OK
  14149. 703.82 s [vector] Too large ix and size: OK
  14150. 703.82 s [vector] Overflow: OK
  14151. 703.82 s [vector] OutOfMemory: OK
  14152. 703.82 s [vector] Storable
  14153. 703.82 s [vector] Negative ix: OK
  14154. 703.82 s [vector] Negative size: OK
  14155. 703.82 s [vector] Negative ix and size: OK
  14156. 703.82 s [vector] Too large ix: OK
  14157. 703.82 s [vector] Too large size: OK
  14158. 703.82 s [vector] Too large ix and size: OK
  14159. 703.82 s [vector] Overflow: OK
  14160. 703.82 s [vector] OutOfMemory: OK
  14161. 703.82 s [vector] Unboxed
  14162. 703.82 s [vector] Negative ix: OK
  14163. 703.82 s [vector] Negative size: OK
  14164. 703.82 s [vector] Negative ix and size: OK
  14165. 703.82 s [vector] Too large ix: OK
  14166. 703.82 s [vector] Too large size: OK
  14167. 703.82 s [vector] Too large ix and size: OK
  14168. 703.82 s [vector] Overflow: OK
  14169. 703.82 s [vector] OutOfMemory: OK
  14170. 703.82 s [vector] take #282
  14171. 703.82 s [vector] Boxed: OK
  14172. 703.82 s [vector] Primitive: OK
  14173. 703.82 s [vector] Storable: OK
  14174. 703.82 s [vector] Unboxed: OK
  14175. 703.82 s [vector] Data.Vector
  14176. 703.82 s [vector] MonadFix: OK
  14177. 703.82 s [vector] toFromArray: OK
  14178. 703.82 s [vector] toFromArraySlice: OK
  14179. 703.82 s [vector] toFromArraySliceUnsafe: OK
  14180. 703.82 s [vector] toFromMutableArray: OK
  14181. 703.82 s [vector] Data.Vector.Mutable (Move): OK
  14182. 703.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14183. 703.82 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  14184. 703.82 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14185. 703.82 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  14186. 703.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14187. 703.83 s [vector] Data.Vector.Storable.Mutable (Move): OK
  14188. 703.83 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14189. 703.83 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  14190. 703.83 s [vector] +++ OK, passed 100 tests.
  14191. 703.83 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  14192. 703.83 s [vector] +++ OK, passed 100 tests.
  14193. 703.83 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  14194. 703.83 s [vector] +++ OK, passed 100 tests.
  14195. 703.83 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  14196. 703.83 s [vector] +++ OK, passed 100 tests.
  14197. 703.83 s [vector]
  14198. 703.83 s [vector] All 2808 tests passed (12.62s)
  14199. 703.84 s [vector] Test suite vector-tests-O2: PASS
  14200. 703.84 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  14201. 703.84 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  14202. 703.85 s [vector] checkPhase completed in 30 seconds
  14203. 703.85 s [vector] Phase: haddockPhase
  14204. 703.86 s [vector] Phase: installPhase
  14205. 703.92 s [vector] Installing library in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  14206. 704.54 s [vector] Installing internal library benchmarks-O2 in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/vector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2
  14207. 704.84 s [vector] Phase: fixupPhase
  14208. 704.86 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  14209. 704.88 s [vector] shrinking /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSvector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg-ghc9.10.3.so
  14210. 704.90 s [vector] shrinking /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSvector-0.13.2.0-KREhi8TUkc2JuN3baN4oSD-benchmarks-O2-ghc9.10.3.so
  14211. 704.91 s [vector] checking for references to /build/ in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0...
  14212. 704.97 s [vector] patching script interpreter paths in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  14213. 704.98 s [vector] stripping (with command strip and flags -S -p) in /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0/lib
  14214. 705.76 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  14215. 706.25 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  14216. 706.28 s [post-build-hook] Uploading to the NixCI cache: /nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0
  14217. 706.33 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14218. 706.35 s [post-build-hook] copying 1 paths...
  14219. 706.35 s [post-build-hook] copying path '/nix/store/ppxz7w3870sr2csi04dx9bdx16kq2rcw-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  14220. 720.16 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14221. 720.31 s [post-build-hook] copying 0 paths...
  14222. 720.34 s Progress: 9 of 19 built, 193 of 193 downloaded from cache
  14223. 720.40 s Building nothunks
  14224. 720.59 s [nothunks] Phase: setupCompilerEnvironmentPhase
  14225. 720.60 s [nothunks] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  14226. 720.99 s [nothunks] Phase: unpackPhase
  14227. 721.00 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  14228. 721.01 s [nothunks] source root is nothunks-0.3.1
  14229. 721.02 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  14230. 721.02 s [nothunks] Phase: patchPhase
  14231. 721.03 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  14232. 721.04 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  14233. 721.05 s [nothunks] Phase: compileBuildDriverPhase
  14234. 721.06 s [nothunks] setupCompileFlags: -package-db=/build/tmp.RS2orJ0NtP/setup-package.conf.d -threaded
  14235. 721.14 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.RS2orJ0NtP/Main.o )
  14236. 721.20 s [nothunks] [2 of 2] Linking Setup
  14237. 722.60 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  14238. 722.62 s [nothunks] Phase: configurePhase
  14239. 722.62 s [nothunks] configureFlags: --verbose --prefix=/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.RS2orJ0NtP/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  14240. 722.63 s [nothunks] Using Parsec parser
  14241. 722.63 s [nothunks] Configuring nothunks-0.3.1...
  14242. 722.99 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  14243. 723.27 s [nothunks] Dependency base: using base-4.20.2.0
  14244. 723.27 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  14245. 723.27 s [nothunks] Dependency containers: using containers-0.7
  14246. 723.27 s [nothunks] Dependency ghc-heap: using ghc-heap-9.10.3
  14247. 723.27 s [nothunks] Dependency stm: using stm-2.5.3.1
  14248. 723.27 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.3
  14249. 723.27 s [nothunks] Dependency time: using time-1.12.2
  14250. 723.27 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  14251. 723.27 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  14252. 723.27 s [nothunks] Dependency base: using base-4.20.2.0
  14253. 723.27 s [nothunks] Dependency containers: using containers-0.7
  14254. 723.27 s [nothunks] Dependency ghc-prim: using ghc-prim-0.12.0
  14255. 723.27 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  14256. 723.27 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  14257. 723.27 s [nothunks] Dependency random: using random-1.2.1.3
  14258. 723.27 s [nothunks] Dependency stm: using stm-2.5.3.1
  14259. 723.27 s [nothunks] Dependency tasty: using tasty-1.5.3
  14260. 723.27 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  14261. 723.27 s [nothunks] Source component graph:
  14262. 723.27 s [nothunks] component lib
  14263. 723.27 s [nothunks] component test:nothunks-test dependency lib
  14264. 723.27 s [nothunks] Configured component graph:
  14265. 723.27 s [nothunks] component nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14266. 723.27 s [nothunks] include base-4.20.2.0-acb8
  14267. 723.27 s [nothunks] include bytestring-0.12.2.0-04d5
  14268. 723.27 s [nothunks] include containers-0.7-a3f6
  14269. 723.27 s [nothunks] include ghc-heap-9.10.3-30e2
  14270. 723.27 s [nothunks] include stm-2.5.3.1-62de
  14271. 723.27 s [nothunks] include text-2.1.3-e138
  14272. 723.27 s [nothunks] include time-1.12.2-befd
  14273. 723.27 s [nothunks] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  14274. 723.27 s [nothunks] include wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
  14275. 723.27 s [nothunks] component nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
  14276. 723.27 s [nothunks] include base-4.20.2.0-acb8
  14277. 723.27 s [nothunks] include containers-0.7-a3f6
  14278. 723.27 s [nothunks] include ghc-prim-0.12.0-f1e7
  14279. 723.27 s [nothunks] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  14280. 723.27 s [nothunks] include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14281. 723.27 s [nothunks] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14282. 723.27 s [nothunks] include stm-2.5.3.1-62de
  14283. 723.27 s [nothunks] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14284. 723.27 s [nothunks] include tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
  14285. 723.27 s [nothunks] Linked component graph:
  14286. 723.27 s [nothunks] unit nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14287. 723.27 s [nothunks] include base-4.20.2.0-acb8
  14288. 723.27 s [nothunks] include bytestring-0.12.2.0-04d5
  14289. 723.27 s [nothunks] include containers-0.7-a3f6
  14290. 723.27 s [nothunks] include ghc-heap-9.10.3-30e2
  14291. 723.27 s [nothunks] include stm-2.5.3.1-62de
  14292. 723.27 s [nothunks] include text-2.1.3-e138
  14293. 723.27 s [nothunks] include time-1.12.2-befd
  14294. 723.27 s [nothunks] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  14295. 723.27 s [nothunks] include wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
  14296. 723.27 s [nothunks] NoThunks.Class=nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw:NoThunks.Class
  14297. 723.27 s [nothunks] unit nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
  14298. 723.27 s [nothunks] include base-4.20.2.0-acb8
  14299. 723.28 s [nothunks] include containers-0.7-a3f6
  14300. 723.28 s [nothunks] include ghc-prim-0.12.0-f1e7
  14301. 723.28 s [nothunks] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  14302. 723.28 s [nothunks] include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14303. 723.28 s [nothunks] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14304. 723.28 s [nothunks] include stm-2.5.3.1-62de
  14305. 723.28 s [nothunks] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14306. 723.28 s [nothunks] include tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
  14307. 723.28 s [nothunks] Ready component graph:
  14308. 723.28 s [nothunks] definite nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14309. 723.28 s [nothunks] depends base-4.20.2.0-acb8
  14310. 723.28 s [nothunks] depends bytestring-0.12.2.0-04d5
  14311. 723.28 s [nothunks] depends containers-0.7-a3f6
  14312. 723.28 s [nothunks] depends ghc-heap-9.10.3-30e2
  14313. 723.28 s [nothunks] depends stm-2.5.3.1-62de
  14314. 723.28 s [nothunks] depends text-2.1.3-e138
  14315. 723.28 s [nothunks] depends time-1.12.2-befd
  14316. 723.28 s [nothunks] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  14317. 723.28 s [nothunks] depends wherefrom-compat-0.1.1.1-76NaIyY2BhzAJrXOXpAjzp
  14318. 723.28 s [nothunks] definite nothunks-0.3.1-7bNIEWEBdl4BRnTdh3zIDH-nothunks-test
  14319. 723.28 s [nothunks] depends base-4.20.2.0-acb8
  14320. 723.28 s [nothunks] depends containers-0.7-a3f6
  14321. 723.28 s [nothunks] depends ghc-prim-0.12.0-f1e7
  14322. 723.28 s [nothunks] depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  14323. 723.28 s [nothunks] depends nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14324. 723.28 s [nothunks] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14325. 723.28 s [nothunks] depends stm-2.5.3.1-62de
  14326. 723.28 s [nothunks] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14327. 723.28 s [nothunks] depends tasty-hedgehog-1.4.0.2-BmGQwjkJFIgK336SkPT5li
  14328. 723.28 s [nothunks] Using Cabal-3.12.1.0 compiled by ghc-9.10
  14329. 723.28 s [nothunks] Using compiler: ghc-9.10.3
  14330. 723.28 s [nothunks] Using install prefix:
  14331. 723.28 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
  14332. 723.28 s [nothunks] Executables installed in:
  14333. 723.28 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/bin
  14334. 723.28 s [nothunks] Libraries installed in:
  14335. 723.28 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14336. 723.28 s [nothunks] Dynamic Libraries installed in:
  14337. 723.28 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  14338. 723.28 s [nothunks] Private executables installed in:
  14339. 723.28 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1
  14340. 723.28 s [nothunks] Data files installed in:
  14341. 723.28 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/share/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1
  14342. 723.28 s [nothunks] Documentation installed in:
  14343. 723.28 s [nothunks] /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  14344. 723.28 s [nothunks] Configuration files installed in:
  14345. 723.28 s [nothunks] /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/etc
  14346. 723.28 s [nothunks] No alex found
  14347. 723.28 s [nothunks] Using ar found on system at:
  14348. 723.28 s [nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  14349. 723.28 s [nothunks] No c2hs found
  14350. 723.28 s [nothunks] No cpphs found
  14351. 723.28 s [nothunks] No doctest found
  14352. 723.28 s [nothunks] Using gcc version 14.3.0 given by user at:
  14353. 723.28 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  14354. 723.28 s [nothunks] Using ghc version 9.10.3 found on system at:
  14355. 723.28 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  14356. 723.28 s [nothunks] Using ghc-pkg version 9.10.3 found on system at:
  14357. 723.28 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  14358. 723.28 s [nothunks] No ghcjs found
  14359. 723.28 s [nothunks] No ghcjs-pkg found
  14360. 723.28 s [nothunks] No greencard found
  14361. 723.28 s [nothunks] Using haddock version 2.31.1 found on system at:
  14362. 723.28 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  14363. 723.28 s [nothunks] No happy found
  14364. 723.28 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  14365. 723.28 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14366. 723.28 s [nothunks] No hmake found
  14367. 723.28 s [nothunks] Using hpc version 0.69 found on system at:
  14368. 723.28 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  14369. 723.28 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  14370. 723.28 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  14371. 723.28 s [nothunks] Using hscolour version 1.25 found on system at:
  14372. 723.28 s [nothunks] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  14373. 723.28 s [nothunks] No jhc found
  14374. 723.28 s [nothunks] Using ld found on system at:
  14375. 723.28 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  14376. 723.28 s [nothunks] No pkg-config found
  14377. 723.28 s [nothunks] Using runghc version 9.10.3 found on system at:
  14378. 723.28 s [nothunks] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  14379. 723.28 s [nothunks] Using strip version 2.44 found on system at:
  14380. 723.28 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  14381. 723.28 s [nothunks] Using tar found on system at:
  14382. 723.28 s [nothunks] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  14383. 723.28 s [nothunks] No uhc found
  14384. 723.45 s [nothunks] Phase: buildPhase
  14385. 723.53 s [nothunks] Preprocessing library for nothunks-0.3.1...
  14386. 723.53 s [nothunks] Building library for nothunks-0.3.1...
  14387. 723.62 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  14388. 726.34 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  14389. 730.42 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  14390. 730.42 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  14391. 730.61 s [nothunks] [1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
  14392. 735.53 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  14393. 736.19 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  14394. 738.06 s [nothunks] Phase: checkPhase
  14395. 738.62 s [nothunks] Running 1 test suites...
  14396. 738.62 s [nothunks] Test suite nothunks-test: RUNNING...
  14397. 738.62 s [nothunks] Tests
  14398. 738.62 s [nothunks] NoThunks.Class
  14399. 738.62 s [nothunks] Sanity
  14400. 738.62 s [nothunks] IntNotNF: OK
  14401. 738.62 s [nothunks] ✓ <interactive> passed 1 test.
  14402. 738.62 s [nothunks] IntIsNF: OK
  14403. 738.62 s [nothunks] ✓ <interactive> passed 1 test.
  14404. 738.62 s [nothunks] Pair: OK
  14405. 738.62 s [nothunks] ✓ <interactive> passed 1 test.
  14406. 738.62 s [nothunks] Sum: OK
  14407. 738.62 s [nothunks] ✓ <interactive> passed 1 test.
  14408. 738.62 s [nothunks] Fn: OK
  14409. 738.62 s [nothunks] ✓ <interactive> passed 1 test.
  14410. 738.62 s [nothunks] IO: OK
  14411. 738.63 s [nothunks] ✓ <interactive> passed 1 test.
  14412. 738.63 s [nothunks] InspectHeap
  14413. 738.65 s [nothunks] Int: OK (0.02s)
  14414. 738.65 s [nothunks] ✓ <interactive> passed 1000 tests.
  14415. 738.65 s [nothunks] Just ["Int"] 48% █████████▌··········
  14416. 738.65 s [nothunks] Nothing 52% ██████████▍·········
  14417. 738.69 s [nothunks] IntInt: OK (0.03s)
  14418. 738.69 s [nothunks] ✓ <interactive> passed 1000 tests.
  14419. 738.69 s [nothunks] Just ["Int","Tuple2"] 38% ███████▋············
  14420. 738.69 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  14421. 738.69 s [nothunks] Nothing 12% ██▎·················
  14422. 738.71 s [nothunks] SumInt: OK (0.03s)
  14423. 738.71 s [nothunks] ✓ <interactive> passed 1000 tests.
  14424. 738.71 s [nothunks] Just ["Either"] 32% ██████▍·············
  14425. 738.71 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  14426. 738.71 s [nothunks] Nothing 33% ██████▋·············
  14427. 738.75 s [nothunks] ListInt: OK (0.03s)
  14428. 738.75 s [nothunks] ✓ <interactive> passed 1000 tests.
  14429. 738.75 s [nothunks] Just ["Int","List"] 22% ████▎···············
  14430. 738.75 s [nothunks] Just ["List"] 43% ████████▌···········
  14431. 738.75 s [nothunks] Nothing 35% ███████·············
  14432. 738.76 s [nothunks] IntListInt: OK (0.03s)
  14433. 738.76 s [nothunks] ✓ <interactive> passed 1000 tests.
  14434. 738.76 s [nothunks] Just ["Int","List","Tuple2"] 4% ▉···················
  14435. 738.76 s [nothunks] Just ["Int","Tuple2"] 22% ████▍···············
  14436. 738.76 s [nothunks] Just ["List","Tuple2"] 13% ██▌·················
  14437. 738.76 s [nothunks] Just ["Tuple2"] 52% ██████████▍·········
  14438. 738.76 s [nothunks] Nothing 8% █▋··················
  14439. 738.81 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  14440. 738.81 s [nothunks] after 7 tests.
  14441. 738.81 s [nothunks] shrink path: 7:
  14442. 738.81 s [nothunks] Just ["Int","Seq"] 14% ██▊·················
  14443. 738.81 s [nothunks] Nothing 71% ██████████████▎·····
  14444. 738.81 s [nothunks]
  14445. 738.81 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  14446. 738.81 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  14447. 738.81 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  14448. 738.81 s [nothunks] 168 ┃ -> Proxy a
  14449. 738.81 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  14450. 738.81 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  14451. 738.81 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  14452. 738.81 s [nothunks] 172 ┃ -> Property
  14453. 738.81 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  14454. 738.81 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  14455. 738.81 s [nothunks] ┃ │ Wrap
  14456. 738.81 s [nothunks] ┃ │ { unwrap =
  14457. 738.81 s [nothunks] ┃ │ SeqEnqueue
  14458. 738.81 s [nothunks] ┃ │ (IntValue 0)
  14459. 738.81 s [nothunks] ┃ │ (SeqEnqueue
  14460. 738.81 s [nothunks] ┃ │ (IntValue 0)
  14461. 738.81 s [nothunks] ┃ │ (SeqEnqueue
  14462. 738.81 s [nothunks] ┃ │ (IntValue 0)
  14463. 738.81 s [nothunks] ┃ │ (SeqEnqueue
  14464. 738.81 s [nothunks] ┃ │ (IntValue 0)
  14465. 738.81 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  14466. 738.81 s [nothunks] ┃ │ }
  14467. 738.81 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  14468. 738.81 s [nothunks] 176 ┃ fromModel m $ \a -> do
  14469. 738.81 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  14470. 738.81 s [nothunks] ┃ │ IsNF
  14471. 738.81 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  14472. 738.81 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  14473. 738.81 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14474. 738.81 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  14475. 738.81 s [nothunks] ┃ │ - Just
  14476. 738.81 s [nothunks] ┃ │ - ThunkInfo
  14477. 738.81 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  14478. 738.81 s [nothunks] ┃ │ + Nothing
  14479. 738.81 s [nothunks]
  14480. 738.81 s [nothunks] This failure can be reproduced by running:
  14481. 738.81 s [nothunks] > recheckAt (Seed 13008510239585982016 11746708039700392783) "7:" EXPECTED FAILURE
  14482. 738.81 s [nothunks]
  14483. 738.81 s [nothunks] OK (0.05s)
  14484. 738.81 s [nothunks] ✓ <interactive> passed 1 test.
  14485. 738.81 s [nothunks] Model
  14486. 738.83 s [nothunks] Int: OK (0.01s)
  14487. 738.83 s [nothunks] ✓ <interactive> passed 1000 tests.
  14488. 738.83 s [nothunks] Just ["Int"] 51% ██████████▏·········
  14489. 738.83 s [nothunks] Nothing 49% █████████▊··········
  14490. 738.85 s [nothunks] IntInt: OK (0.02s)
  14491. 738.85 s [nothunks] ✓ <interactive> passed 1000 tests.
  14492. 738.85 s [nothunks] Just ["Int","Tuple2"] 37% ███████▍············
  14493. 738.85 s [nothunks] Just ["Tuple2"] 49% █████████▊··········
  14494. 738.85 s [nothunks] Nothing 13% ██▋·················
  14495. 738.87 s [nothunks] SumInt: OK (0.02s)
  14496. 738.87 s [nothunks] ✓ <interactive> passed 1000 tests.
  14497. 738.87 s [nothunks] Just ["Either"] 33% ██████▌·············
  14498. 738.87 s [nothunks] Just ["Int","Either"] 33% ██████▋·············
  14499. 738.87 s [nothunks] Nothing 34% ██████▋·············
  14500. 738.89 s [nothunks] ListInt: OK (0.02s)
  14501. 738.89 s [nothunks] ✓ <interactive> passed 1000 tests.
  14502. 738.89 s [nothunks] Just ["Int","List"] 22% ████▍···············
  14503. 738.89 s [nothunks] Just ["List"] 41% ████████▎···········
  14504. 738.89 s [nothunks] Nothing 36% ███████▎············
  14505. 738.93 s [nothunks] IntListInt: OK (0.03s)
  14506. 738.93 s [nothunks] ✓ <interactive> passed 1000 tests.
  14507. 738.93 s [nothunks] Just ["Int","List","Tuple2"] 5% █···················
  14508. 738.93 s [nothunks] Just ["Int","Tuple2"] 26% █████▏··············
  14509. 738.93 s [nothunks] Just ["List","Tuple2"] 11% ██▎·················
  14510. 738.93 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  14511. 738.93 s [nothunks] Nothing 8% █▋··················
  14512. 739.03 s [nothunks] SeqInt: OK (0.10s)
  14513. 739.03 s [nothunks] ✓ <interactive> passed 1000 tests.
  14514. 739.03 s [nothunks] Just ["Int","Seq"] 46% █████████···········
  14515. 739.03 s [nothunks] Nothing 54% ██████████▉·········
  14516. 739.05 s [nothunks] AllowThunksIn: OK (0.03s)
  14517. 739.05 s [nothunks] ✓ <interactive> passed 1000 tests.
  14518. 739.05 s [nothunks] Just ["Int","field2","Record"] 24% ████▊···············
  14519. 739.05 s [nothunks] Just ["Record"] 51% ██████████··········
  14520. 739.05 s [nothunks] Nothing 25% █████···············
  14521. 739.07 s [nothunks] Fn: OK (0.01s)
  14522. 739.07 s [nothunks] ✓ <interactive> passed 1000 tests.
  14523. 739.07 s [nothunks] Just ["->"] 24% ████▊···············
  14524. 739.07 s [nothunks] Nothing 76% ███████████████▏····
  14525. 739.07 s [nothunks] IO: OK (0.01s)
  14526. 739.07 s [nothunks] ✓ <interactive> passed 1000 tests.
  14527. 739.07 s [nothunks] Just ["IO"] 28% █████▋··············
  14528. 739.07 s [nothunks] Nothing 72% ██████████████▎·····
  14529. 739.09 s [nothunks] ThunkFreeFn: OK (0.01s)
  14530. 739.09 s [nothunks] ✓ <interactive> passed 1000 tests.
  14531. 739.09 s [nothunks] Just ["->"] 25% ████▉···············
  14532. 739.09 s [nothunks] Just ["...","->"] 36% ███████▎············
  14533. 739.09 s [nothunks] Nothing 39% ███████▊············
  14534. 739.09 s [nothunks] ThunkFreeIO: OK (0.01s)
  14535. 739.09 s [nothunks] ✓ <interactive> passed 1000 tests.
  14536. 739.09 s [nothunks] Just ["...","IO"] 40% ███████▉············
  14537. 739.09 s [nothunks] Just ["IO"] 25% ████▉···············
  14538. 739.09 s [nothunks] Nothing 36% ███████▏············
  14539. 739.09 s [nothunks] MutableVars
  14540. 739.09 s [nothunks] IORef
  14541. 739.09 s [nothunks] NotNF: OK
  14542. 739.09 s [nothunks] ✓ <interactive> passed 1 test.
  14543. 739.09 s [nothunks] NF: OK
  14544. 739.09 s [nothunks] ✓ <interactive> passed 1 test.
  14545. 739.09 s [nothunks] NotNFPure: OK
  14546. 739.09 s [nothunks] ✓ <interactive> passed 1 test.
  14547. 739.09 s [nothunks] NFPure: OK
  14548. 739.09 s [nothunks] ✓ <interactive> passed 1 test.
  14549. 739.09 s [nothunks] NotNFAtomically: OK
  14550. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14551. 739.10 s [nothunks] NFAtomically: OK
  14552. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14553. 739.10 s [nothunks] MVar
  14554. 739.10 s [nothunks] NotNF: OK
  14555. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14556. 739.10 s [nothunks] NF: OK
  14557. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14558. 739.10 s [nothunks] NotNFPure: OK
  14559. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14560. 739.10 s [nothunks] NFPure: OK
  14561. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14562. 739.10 s [nothunks] NotNFAtomically: OK
  14563. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14564. 739.10 s [nothunks] NFAtomically: OK
  14565. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14566. 739.10 s [nothunks] TVar
  14567. 739.10 s [nothunks] NotNF: OK
  14568. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14569. 739.10 s [nothunks] NF: OK
  14570. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14571. 739.10 s [nothunks] NotNFPure: OK
  14572. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14573. 739.10 s [nothunks] NFPure: OK
  14574. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14575. 739.10 s [nothunks] NotNFAtomically: OK
  14576. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14577. 739.10 s [nothunks] NFAtomically: OK
  14578. 739.10 s [nothunks] ✓ <interactive> passed 1 test.
  14579. 739.10 s [nothunks]
  14580. 739.10 s [nothunks] All 41 tests passed (0.47s)
  14581. 739.10 s [nothunks] Test suite nothunks-test: PASS
  14582. 739.10 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  14583. 739.10 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  14584. 739.18 s [nothunks] Phase: haddockPhase
  14585. 739.49 s [nothunks] Preprocessing library for nothunks-0.3.1...
  14586. 739.49 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  14587. 739.49 s [nothunks] Warning: The documentation for the following packages are not installed. No
  14588. 739.49 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  14589. 739.86 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  14590. 741.01 s [nothunks] Haddock coverage:
  14591. 741.02 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  14592. 741.02 s [nothunks] * at src/NoThunks/Class.hs:334:48
  14593. 741.02 s [nothunks] * at src/NoThunks/Class.hs:334:1
  14594. 741.02 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14595. 741.02 s [nothunks] by specifying the type/value namespace explicitly.
  14596. 741.02 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  14597. 741.02 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  14598. 741.02 s [nothunks] * at src/NoThunks/Class.hs:353:25
  14599. 741.02 s [nothunks] * at src/NoThunks/Class.hs:353:1
  14600. 741.02 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14601. 741.02 s [nothunks] by specifying the type/value namespace explicitly.
  14602. 741.02 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  14603. 741.02 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  14604. 741.02 s [nothunks] * at src/NoThunks/Class.hs:358:47
  14605. 741.02 s [nothunks] * at src/NoThunks/Class.hs:358:1
  14606. 741.02 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14607. 741.02 s [nothunks] by specifying the type/value namespace explicitly.
  14608. 741.02 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  14609. 741.02 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  14610. 741.02 s [nothunks] * at src/NoThunks/Class.hs:308:27
  14611. 741.02 s [nothunks] * at src/NoThunks/Class.hs:308:1
  14612. 741.02 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14613. 741.02 s [nothunks] by specifying the type/value namespace explicitly.
  14614. 741.02 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  14615. 741.03 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  14616. 741.03 s [nothunks] * at src/NoThunks/Class.hs:230:18
  14617. 741.03 s [nothunks] * at src/NoThunks/Class.hs:230:1
  14618. 741.03 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14619. 741.03 s [nothunks] by specifying the type/value namespace explicitly.
  14620. 741.03 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  14621. 741.03 s [nothunks] Warning: 'GHC' is out of scope.
  14622. 741.03 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  14623. 741.03 s [nothunks] Warning: 'a' is out of scope.
  14624. 741.03 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  14625. 741.04 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  14626. 741.04 s [nothunks] Missing documentation for:
  14627. 741.04 s [nothunks] Module header
  14628. 741.92 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  14629. 742.00 s [nothunks] - Data.Vector.Vector
  14630. 742.00 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  14631. 742.00 s [nothunks] - NoThunks.Class.HasFields
  14632. 742.00 s [nothunks] - NoThunks.Class.Elem
  14633. 742.01 s [nothunks] - NoThunks.Class.GShowTypeOf
  14634. 742.01 s [nothunks] - NoThunks.Class.GWRecordField
  14635. 742.01 s [nothunks] - NoThunks.Class.checkContainsThunks
  14636. 753.25 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  14637. 753.25 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  14638. 753.48 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  14639. 753.51 s [nothunks] Phase: installPhase
  14640. 753.90 s [nothunks] Installing library in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14641. 754.42 s [nothunks] Phase: fixupPhase
  14642. 754.45 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
  14643. 754.46 s [nothunks] shrinking /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSnothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw-ghc9.10.3.so
  14644. 754.47 s [nothunks] checking for references to /build/ in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1...
  14645. 754.49 s [nothunks] patching script interpreter paths in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1
  14646. 754.50 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1/lib
  14647. 754.61 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
  14648. 754.62 s [nothunks] checking for references to /build/ in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc...
  14649. 754.64 s [nothunks] patching script interpreter paths in /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
  14650. 754.87 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
  14651. 755.50 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  14652. 755.53 s [post-build-hook] Uploading to the NixCI cache: /nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1 /nix/store/bvhgrjg93mh2k3x1aq7gi6c4shilcaj4-nothunks-0.3.1-doc
  14653. 755.59 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14654. 755.71 s [post-build-hook] copying 1 paths...
  14655. 755.71 s [post-build-hook] copying path '/nix/store/9k9igq9hmwk576871xcmy6asml5mpf84-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  14656. 757.28 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14657. 757.45 s [post-build-hook] copying 0 paths...
  14658. 757.50 s Progress: 10 of 19 built, 193 of 193 downloaded from cache
  14659. 757.60 s Building unordered-containers
  14660. 757.83 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  14661. 757.84 s [unordered-containers] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  14662. 758.26 s [unordered-containers] Phase: unpackPhase
  14663. 758.26 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  14664. 758.27 s [unordered-containers] source root is unordered-containers-0.2.20.1
  14665. 758.28 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  14666. 758.29 s [unordered-containers] Phase: patchPhase
  14667. 758.30 s [unordered-containers] Phase: compileBuildDriverPhase
  14668. 758.30 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.n5QL0i7Kxe/setup-package.conf.d -threaded
  14669. 758.42 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.n5QL0i7Kxe/Main.o )
  14670. 758.64 s [unordered-containers] [2 of 2] Linking Setup
  14671. 760.57 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  14672. 760.59 s [unordered-containers] Phase: configurePhase
  14673. 760.60 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.n5QL0i7Kxe/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  14674. 760.61 s [unordered-containers] Using Parsec parser
  14675. 760.61 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  14676. 761.06 s [unordered-containers] Flags chosen: debug=False
  14677. 761.44 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.20.2.0
  14678. 761.44 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
  14679. 761.44 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  14680. 761.44 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.22.0.0
  14681. 761.44 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  14682. 761.44 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  14683. 761.44 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  14684. 761.44 s [unordered-containers] Dependency base: using base-4.20.2.0
  14685. 761.44 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  14686. 761.44 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  14687. 761.44 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  14688. 761.44 s [unordered-containers] Dependency random: using random-1.2.1.3
  14689. 761.44 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  14690. 761.44 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  14691. 761.44 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  14692. 761.44 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  14693. 761.44 s [unordered-containers] Source component graph:
  14694. 761.44 s [unordered-containers] component lib
  14695. 761.44 s [unordered-containers] component test:unordered-containers-tests dependency lib
  14696. 761.44 s [unordered-containers] Configured component graph:
  14697. 761.44 s [unordered-containers] component unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14698. 761.44 s [unordered-containers] include base-4.20.2.0-acb8
  14699. 761.44 s [unordered-containers] include deepseq-1.5.0.0-7e72
  14700. 761.44 s [unordered-containers] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14701. 761.44 s [unordered-containers] include template-haskell-2.22.0.0-af3f
  14702. 761.44 s [unordered-containers] component unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
  14703. 761.44 s [unordered-containers] include ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
  14704. 761.44 s [unordered-containers] include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  14705. 761.44 s [unordered-containers] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  14706. 761.44 s [unordered-containers] include base-4.20.2.0-acb8
  14707. 761.44 s [unordered-containers] include containers-0.7-a3f6
  14708. 761.44 s [unordered-containers] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14709. 761.44 s [unordered-containers] include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14710. 761.44 s [unordered-containers] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14711. 761.44 s [unordered-containers] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14712. 761.44 s [unordered-containers] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  14713. 761.44 s [unordered-containers] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  14714. 761.44 s [unordered-containers] include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14715. 761.44 s [unordered-containers] Linked component graph:
  14716. 761.44 s [unordered-containers] unit unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14717. 761.44 s [unordered-containers] include base-4.20.2.0-acb8
  14718. 761.44 s [unordered-containers] include deepseq-1.5.0.0-7e72
  14719. 761.44 s [unordered-containers] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14720. 761.44 s [unordered-containers] include template-haskell-2.22.0.0-af3f
  14721. 761.44 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf:Data.HashSet.Internal
  14722. 761.44 s [unordered-containers] unit unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
  14723. 761.44 s [unordered-containers] include ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
  14724. 761.44 s [unordered-containers] include HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  14725. 761.44 s [unordered-containers] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  14726. 761.44 s [unordered-containers] include base-4.20.2.0-acb8
  14727. 761.44 s [unordered-containers] include containers-0.7-a3f6
  14728. 761.44 s [unordered-containers] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14729. 761.44 s [unordered-containers] include nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14730. 761.44 s [unordered-containers] include random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14731. 761.44 s [unordered-containers] include tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14732. 761.44 s [unordered-containers] include tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  14733. 761.44 s [unordered-containers] include tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  14734. 761.44 s [unordered-containers] include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14735. 761.44 s [unordered-containers] Ready component graph:
  14736. 761.44 s [unordered-containers] definite unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14737. 761.44 s [unordered-containers] depends base-4.20.2.0-acb8
  14738. 761.44 s [unordered-containers] depends deepseq-1.5.0.0-7e72
  14739. 761.44 s [unordered-containers] depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14740. 761.44 s [unordered-containers] depends template-haskell-2.22.0.0-af3f
  14741. 761.44 s [unordered-containers] definite unordered-containers-0.2.20.1-JZdOX0D8V0nEwlQSGrk4Ru-unordered-containers-tests
  14742. 761.44 s [unordered-containers] depends ChasingBottoms-1.3.1.17-9Ou18h7tNTBCFMwCxYVCQZ
  14743. 761.44 s [unordered-containers] depends HUnit-1.6.2.0-DAl88OZhORF5tEe8jDORqh
  14744. 761.44 s [unordered-containers] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  14745. 761.44 s [unordered-containers] depends base-4.20.2.0-acb8
  14746. 761.44 s [unordered-containers] depends containers-0.7-a3f6
  14747. 761.44 s [unordered-containers] depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  14748. 761.44 s [unordered-containers] depends nothunks-0.3.1-KvKZpAC4SdU4WmlwLzzLpw
  14749. 761.44 s [unordered-containers] depends random-1.2.1.3-L6E5fTaPoCA1FYvVkjhQhJ
  14750. 761.44 s [unordered-containers] depends tasty-1.5.3-6VVnV2MAaEEboaUHJkYU4
  14751. 761.44 s [unordered-containers] depends tasty-hunit-0.10.2-2JVNHJhSfnl5p1jLlZfoyf
  14752. 761.44 s [unordered-containers] depends tasty-quickcheck-0.11.1-DVleGteNHvy4GOLXZpTqTG
  14753. 761.44 s [unordered-containers] depends unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14754. 761.44 s [unordered-containers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  14755. 761.44 s [unordered-containers] Using compiler: ghc-9.10.3
  14756. 761.44 s [unordered-containers] Using install prefix:
  14757. 761.44 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  14758. 761.44 s [unordered-containers] Executables installed in:
  14759. 761.44 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/bin
  14760. 761.44 s [unordered-containers] Libraries installed in:
  14761. 761.44 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  14762. 761.44 s [unordered-containers] Dynamic Libraries installed in:
  14763. 761.44 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  14764. 761.44 s [unordered-containers] Private executables installed in:
  14765. 761.44 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1
  14766. 761.44 s [unordered-containers] Data files installed in:
  14767. 761.44 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1
  14768. 761.44 s [unordered-containers] Documentation installed in:
  14769. 761.44 s [unordered-containers] /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  14770. 761.44 s [unordered-containers] Configuration files installed in:
  14771. 761.44 s [unordered-containers] /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/etc
  14772. 761.44 s [unordered-containers] No alex found
  14773. 761.44 s [unordered-containers] Using ar found on system at:
  14774. 761.44 s [unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  14775. 761.44 s [unordered-containers] No c2hs found
  14776. 761.44 s [unordered-containers] No cpphs found
  14777. 761.44 s [unordered-containers] No doctest found
  14778. 761.44 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  14779. 761.44 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  14780. 761.44 s [unordered-containers] Using ghc version 9.10.3 found on system at:
  14781. 761.44 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  14782. 761.44 s [unordered-containers] Using ghc-pkg version 9.10.3 found on system at:
  14783. 761.44 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  14784. 761.44 s [unordered-containers] No ghcjs found
  14785. 761.44 s [unordered-containers] No ghcjs-pkg found
  14786. 761.44 s [unordered-containers] No greencard found
  14787. 761.44 s [unordered-containers] Using haddock version 2.31.1 found on system at:
  14788. 761.44 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  14789. 761.44 s [unordered-containers] No happy found
  14790. 761.44 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  14791. 761.44 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14792. 761.44 s [unordered-containers] No hmake found
  14793. 761.44 s [unordered-containers] Using hpc version 0.69 found on system at:
  14794. 761.44 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  14795. 761.45 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  14796. 761.45 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  14797. 761.45 s [unordered-containers] Using hscolour version 1.25 found on system at:
  14798. 761.45 s [unordered-containers] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  14799. 761.45 s [unordered-containers] No jhc found
  14800. 761.45 s [unordered-containers] Using ld found on system at:
  14801. 761.45 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  14802. 761.45 s [unordered-containers] No pkg-config found
  14803. 761.45 s [unordered-containers] Using runghc version 9.10.3 found on system at:
  14804. 761.45 s [unordered-containers] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  14805. 761.45 s [unordered-containers] Using strip version 2.44 found on system at:
  14806. 761.45 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  14807. 761.45 s [unordered-containers] Using tar found on system at:
  14808. 761.45 s [unordered-containers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  14809. 761.45 s [unordered-containers] No uhc found
  14810. 761.63 s [unordered-containers] Phase: buildPhase
  14811. 761.75 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  14812. 761.77 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  14813. 761.88 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14814. 761.88 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14815. 761.88 s [unordered-containers] |
  14816. 761.88 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14817. 761.88 s [unordered-containers] | ^^^^^^^^^^
  14818. 761.88 s [unordered-containers]
  14819. 762.17 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.o, dist/build/Data/HashMap/Internal/Array.dyn_o )
  14820. 762.48 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14821. 762.48 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14822. 762.48 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14823. 762.48 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14824. 762.48 s [unordered-containers] |
  14825. 762.48 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14826. 762.48 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14827. 762.48 s [unordered-containers]
  14828. 763.53 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.o, dist/build/Data/HashMap/Internal/List.dyn_o )
  14829. 763.53 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
  14830. 780.90 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.o, dist/build/Data/HashMap/Internal/Debug.dyn_o )
  14831. 781.86 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.o, dist/build/Data/HashMap/Internal/Strict.dyn_o )
  14832. 785.85 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
  14833. 785.85 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  14834. 785.86 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
  14835. 785.91 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
  14836. 786.39 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14837. 786.39 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14838. 786.39 s [unordered-containers] |
  14839. 786.39 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14840. 786.39 s [unordered-containers] | ^^^^^^^^^^
  14841. 786.39 s [unordered-containers]
  14842. 786.84 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  14843. 787.26 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14844. 787.26 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14845. 787.26 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14846. 787.26 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14847. 787.26 s [unordered-containers] |
  14848. 787.26 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14849. 787.26 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14850. 787.26 s [unordered-containers]
  14851. 788.36 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  14852. 788.36 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  14853. 812.45 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  14854. 814.18 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  14855. 821.03 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  14856. 821.03 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  14857. 821.07 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  14858. 821.33 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  14859. 826.01 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14860. 826.01 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14861. 826.49 s [unordered-containers] [1 of 9] Compiling Properties.List ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
  14862. 827.83 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  14863. 827.83 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  14864. 827.83 s [unordered-containers] In the use of ‘head’
  14865. 827.83 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  14866. 827.83 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  14867. 827.83 s [unordered-containers] |
  14868. 827.84 s [unordered-containers] 93 | k = head keys
  14869. 827.84 s [unordered-containers] | ^^^^
  14870. 827.84 s [unordered-containers]
  14871. 835.14 s [unordered-containers] [3 of 9] Compiling Util.Key ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
  14872. 835.17 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  14873. 835.17 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  14874. 835.17 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  14875. 835.17 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  14876. 835.17 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  14877. 835.17 s [unordered-containers] |
  14878. 835.17 s [unordered-containers] 7 | import Data.Foldable (foldl')
  14879. 835.17 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14880. 835.17 s [unordered-containers]
  14881. 835.17 s [unordered-containers] [5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
  14882. 835.17 s [unordered-containers] [6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
  14883. 852.27 s [unordered-containers] [7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
  14884. 852.30 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  14885. 852.30 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  14886. 853.49 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  14887. 856.01 s [unordered-containers] buildPhase completed in 1 minutes 35 seconds
  14888. 856.01 s [unordered-containers] Phase: checkPhase
  14889. 856.72 s [unordered-containers] Running 1 test suites...
  14890. 856.72 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  14891. 856.78 s [unordered-containers] All
  14892. 856.78 s [unordered-containers] Properties
  14893. 856.78 s [unordered-containers] Data.HashMap.Lazy
  14894. 856.78 s [unordered-containers] instances
  14895. 856.78 s [unordered-containers] Eq
  14896. 856.90 s [unordered-containers] ==: OK (0.07s)
  14897. 856.90 s [unordered-containers] +++ OK, passed 100 tests.
  14898. 856.90 s [unordered-containers] /=: OK (0.11s)
  14899. 856.90 s [unordered-containers] +++ OK, passed 100 tests.
  14900. 856.90 s [unordered-containers] Ord
  14901. 856.90 s [unordered-containers] compare reflexive: OK (0.06s)
  14902. 856.90 s [unordered-containers] +++ OK, passed 100 tests.
  14903. 856.90 s [unordered-containers] compare transitive: OK (0.08s)
  14904. 856.90 s [unordered-containers] +++ OK, passed 100 tests.
  14905. 856.90 s [unordered-containers] compare antisymmetric: OK (0.11s)
  14906. 856.90 s [unordered-containers] +++ OK, passed 100 tests.
  14907. 856.90 s [unordered-containers] Ord => Eq: OK (0.07s)
  14908. 856.90 s [unordered-containers] +++ OK, passed 100 tests.
  14909. 857.26 s [unordered-containers] Read/Show: OK (0.49s)
  14910. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14911. 857.26 s [unordered-containers] Functor: OK (0.23s)
  14912. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14913. 857.26 s [unordered-containers] Foldable: OK (0.08s)
  14914. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14915. 857.26 s [unordered-containers] Bifoldable
  14916. 857.26 s [unordered-containers] bifoldMap: OK (0.05s)
  14917. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14918. 857.26 s [unordered-containers] bifoldr: OK (0.05s)
  14919. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14920. 857.26 s [unordered-containers] bifoldl: OK (0.07s)
  14921. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14922. 857.26 s [unordered-containers] Hashable: OK (0.04s)
  14923. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14924. 857.26 s [unordered-containers] empty
  14925. 857.26 s [unordered-containers] valid: OK
  14926. 857.26 s [unordered-containers] +++ OK, passed 1 test.
  14927. 857.26 s [unordered-containers] singleton
  14928. 857.26 s [unordered-containers] valid: OK
  14929. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14930. 857.26 s [unordered-containers] size: OK (0.01s)
  14931. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14932. 857.26 s [unordered-containers] member: OK (0.05s)
  14933. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14934. 857.26 s [unordered-containers] lookup: OK (0.04s)
  14935. 857.26 s [unordered-containers] +++ OK, passed 100 tests.
  14936. 857.27 s [unordered-containers] !?: OK (0.03s)
  14937. 857.27 s [unordered-containers] +++ OK, passed 100 tests.
  14938. 857.27 s [unordered-containers] insert
  14939. 857.27 s [unordered-containers] model: OK (0.05s)
  14940. 857.27 s [unordered-containers] +++ OK, passed 100 tests.
  14941. 857.27 s [unordered-containers] valid: OK (0.05s)
  14942. 857.27 s [unordered-containers] +++ OK, passed 100 tests.
  14943. 857.27 s [unordered-containers] insertWith
  14944. 857.27 s [unordered-containers] insertWith: OK (0.05s)
  14945. 857.27 s [unordered-containers] +++ OK, passed 100 tests.
  14946. 857.32 s [unordered-containers] valid: OK (0.05s)
  14947. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14948. 857.32 s [unordered-containers] delete
  14949. 857.32 s [unordered-containers] model: OK (0.06s)
  14950. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14951. 857.32 s [unordered-containers] valid: OK (0.02s)
  14952. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14953. 857.32 s [unordered-containers] adjust
  14954. 857.32 s [unordered-containers] model: OK (0.04s)
  14955. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14956. 857.32 s [unordered-containers] valid: OK (0.02s)
  14957. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14958. 857.32 s [unordered-containers] update
  14959. 857.32 s [unordered-containers] model: OK (0.04s)
  14960. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14961. 857.32 s [unordered-containers] valid: OK (0.02s)
  14962. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14963. 857.32 s [unordered-containers] alter
  14964. 857.32 s [unordered-containers] model: OK (0.05s)
  14965. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14966. 857.32 s [unordered-containers] valid: OK (0.05s)
  14967. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14968. 857.32 s [unordered-containers] alterF
  14969. 857.32 s [unordered-containers] model
  14970. 857.32 s [unordered-containers] []: OK (0.28s)
  14971. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14972. 857.32 s [unordered-containers] adjust: OK (0.04s)
  14973. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14974. 857.32 s [unordered-containers] insert: OK (0.04s)
  14975. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14976. 857.32 s [unordered-containers] insertWith: OK (0.04s)
  14977. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14978. 857.32 s [unordered-containers] delete: OK (0.04s)
  14979. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14980. 857.32 s [unordered-containers] lookup: OK (0.02s)
  14981. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14982. 857.32 s [unordered-containers] valid: OK (0.06s)
  14983. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14984. 857.32 s [unordered-containers] isSubmapOf
  14985. 857.32 s [unordered-containers] model: OK (0.07s)
  14986. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14987. 857.32 s [unordered-containers] m ⊆ m: OK (0.02s)
  14988. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14989. 857.32 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.08s)
  14990. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14991. 857.32 s [unordered-containers] m1\m2 ⊆ m1: OK (0.08s)
  14992. 857.32 s [unordered-containers] +++ OK, passed 100 tests.
  14993. 857.32 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.07s)
  14994. 857.32 s [unordered-containers] +++ OK, passed 100 tests; 115 discarded.
  14995. 857.32 s [unordered-containers] delete k m ⊆ m: OK (0.04s)
  14996. 857.32 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  14997. 857.32 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  14998. 857.32 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  14999. 857.32 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.05s)
  15000. 857.32 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  15001. 857.32 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.03s)
  15002. 857.32 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  15003. 857.32 s [unordered-containers] union
  15004. 857.32 s [unordered-containers] model: OK (0.13s)
  15005. 857.33 s [unordered-containers] +++ OK, passed 100 tests.
  15006. 857.33 s [unordered-containers] valid: OK (0.05s)
  15007. 857.33 s [unordered-containers] +++ OK, passed 100 tests.
  15008. 857.33 s [unordered-containers] unionWith
  15009. 857.33 s [unordered-containers] model: OK (0.10s)
  15010. 857.33 s [unordered-containers] +++ OK, passed 100 tests.
  15011. 857.33 s [unordered-containers] valid: OK (0.05s)
  15012. 857.33 s [unordered-containers] +++ OK, passed 100 tests.
  15013. 857.33 s [unordered-containers] unionWithKey
  15014. 857.33 s [unordered-containers] model: OK (0.16s)
  15015. 857.33 s [unordered-containers] +++ OK, passed 100 tests.
  15016. 857.33 s [unordered-containers] valid: OK (0.06s)
  15017. 857.33 s [unordered-containers] +++ OK, passed 100 tests.
  15018. 857.33 s [unordered-containers] unions
  15019. 859.15 s [unordered-containers] model: OK (2.16s)
  15020. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15021. 859.19 s [unordered-containers] valid: OK (1.09s)
  15022. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15023. 859.19 s [unordered-containers] difference
  15024. 859.19 s [unordered-containers] model: OK (0.06s)
  15025. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15026. 859.19 s [unordered-containers] valid: OK (0.03s)
  15027. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15028. 859.19 s [unordered-containers] differenceWith
  15029. 859.19 s [unordered-containers] model: OK (0.09s)
  15030. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15031. 859.19 s [unordered-containers] valid: OK (0.09s)
  15032. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15033. 859.19 s [unordered-containers] intersection
  15034. 859.19 s [unordered-containers] model: OK (0.06s)
  15035. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15036. 859.19 s [unordered-containers] valid: OK (0.02s)
  15037. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15038. 859.19 s [unordered-containers] intersectionWith
  15039. 859.19 s [unordered-containers] model: OK (0.10s)
  15040. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15041. 859.19 s [unordered-containers] valid: OK
  15042. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15043. 859.19 s [unordered-containers] intersectionWithKey
  15044. 859.19 s [unordered-containers] model: OK (0.11s)
  15045. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15046. 859.19 s [unordered-containers] valid: OK (0.03s)
  15047. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15048. 859.19 s [unordered-containers] compose
  15049. 859.19 s [unordered-containers] valid: OK (0.03s)
  15050. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15051. 859.19 s [unordered-containers] map
  15052. 859.19 s [unordered-containers] model: OK (0.08s)
  15053. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15054. 859.19 s [unordered-containers] valid: OK (0.03s)
  15055. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15056. 859.19 s [unordered-containers] traverseWithKey
  15057. 859.19 s [unordered-containers] model: OK (0.32s)
  15058. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15059. 859.19 s [unordered-containers] valid: OK (0.04s)
  15060. 859.19 s [unordered-containers] +++ OK, passed 100 tests.
  15061. 859.19 s [unordered-containers] mapKeys
  15062. 859.20 s [unordered-containers] model: OK (0.04s)
  15063. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15064. 859.20 s [unordered-containers] valid: OK (0.66s)
  15065. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15066. 859.20 s [unordered-containers] foldr: OK
  15067. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15068. 859.20 s [unordered-containers] foldl: OK (0.03s)
  15069. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15070. 859.20 s [unordered-containers] foldrWithKey: OK (0.01s)
  15071. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15072. 859.20 s [unordered-containers] foldlWithKey: OK
  15073. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15074. 859.20 s [unordered-containers] foldrWithKey': OK (0.01s)
  15075. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15076. 859.20 s [unordered-containers] foldlWithKey': OK (0.01s)
  15077. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15078. 859.20 s [unordered-containers] foldl': OK (0.02s)
  15079. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15080. 859.20 s [unordered-containers] foldr': OK (0.01s)
  15081. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15082. 859.20 s [unordered-containers] foldMapWithKey: OK (0.02s)
  15083. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15084. 859.20 s [unordered-containers] filter
  15085. 859.20 s [unordered-containers] model: OK (0.16s)
  15086. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15087. 859.20 s [unordered-containers] valid: OK (0.06s)
  15088. 859.20 s [unordered-containers] +++ OK, passed 100 tests.
  15089. 859.20 s [unordered-containers] filterWithKey
  15090. 860.56 s [unordered-containers] model: OK (3.49s)
  15091. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15092. 860.56 s [unordered-containers] valid: OK (2.28s)
  15093. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15094. 860.56 s [unordered-containers] mapMaybe
  15095. 860.56 s [unordered-containers] model: OK (0.12s)
  15096. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15097. 860.56 s [unordered-containers] valid: OK (0.04s)
  15098. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15099. 860.56 s [unordered-containers] mapMaybeWithKey
  15100. 860.56 s [unordered-containers] model: OK (3.35s)
  15101. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15102. 860.56 s [unordered-containers] valid: OK (1.83s)
  15103. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15104. 860.56 s [unordered-containers] elems: OK (0.04s)
  15105. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15106. 860.56 s [unordered-containers] keys: OK (0.05s)
  15107. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15108. 860.56 s [unordered-containers] fromList
  15109. 860.56 s [unordered-containers] model: OK (0.04s)
  15110. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15111. 860.56 s [unordered-containers] valid: OK (0.04s)
  15112. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15113. 860.56 s [unordered-containers] fromListWith
  15114. 860.56 s [unordered-containers] model: OK (0.04s)
  15115. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15116. 860.56 s [unordered-containers] valid: OK (0.04s)
  15117. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15118. 860.56 s [unordered-containers] fromListWithKey
  15119. 860.56 s [unordered-containers] model: OK (0.02s)
  15120. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15121. 860.56 s [unordered-containers] valid: OK (0.01s)
  15122. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15123. 860.56 s [unordered-containers] toList: OK (0.03s)
  15124. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15125. 860.56 s [unordered-containers] Data.HashMap.Strict
  15126. 860.56 s [unordered-containers] instances
  15127. 860.56 s [unordered-containers] Eq
  15128. 860.56 s [unordered-containers] ==: OK (0.03s)
  15129. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15130. 860.56 s [unordered-containers] /=: OK (0.06s)
  15131. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15132. 860.56 s [unordered-containers] Ord
  15133. 860.56 s [unordered-containers] compare reflexive: OK (0.02s)
  15134. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15135. 860.56 s [unordered-containers] compare transitive: OK (0.13s)
  15136. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15137. 860.56 s [unordered-containers] compare antisymmetric: OK (0.02s)
  15138. 860.56 s [unordered-containers] +++ OK, passed 100 tests.
  15139. 860.57 s [unordered-containers] Ord => Eq: OK (0.03s)
  15140. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15141. 860.57 s [unordered-containers] Read/Show: OK (1.01s)
  15142. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15143. 860.57 s [unordered-containers] Functor: OK (0.22s)
  15144. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15145. 860.57 s [unordered-containers] Foldable: OK (0.07s)
  15146. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15147. 860.57 s [unordered-containers] Bifoldable
  15148. 860.57 s [unordered-containers] bifoldMap: OK (0.07s)
  15149. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15150. 860.57 s [unordered-containers] bifoldr: OK (0.03s)
  15151. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15152. 860.57 s [unordered-containers] bifoldl: OK (0.05s)
  15153. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15154. 860.57 s [unordered-containers] Hashable: OK (0.07s)
  15155. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15156. 860.57 s [unordered-containers] empty
  15157. 860.57 s [unordered-containers] valid: OK
  15158. 860.57 s [unordered-containers] +++ OK, passed 1 test.
  15159. 860.57 s [unordered-containers] singleton
  15160. 860.57 s [unordered-containers] valid: OK (0.02s)
  15161. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15162. 860.57 s [unordered-containers] size: OK (0.03s)
  15163. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15164. 860.57 s [unordered-containers] member: OK (0.08s)
  15165. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15166. 860.57 s [unordered-containers] lookup: OK (0.03s)
  15167. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15168. 860.57 s [unordered-containers] !?: OK (0.03s)
  15169. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15170. 860.57 s [unordered-containers] insert
  15171. 860.57 s [unordered-containers] model: OK (0.07s)
  15172. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15173. 860.57 s [unordered-containers] valid: OK (0.04s)
  15174. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15175. 860.57 s [unordered-containers] insertWith
  15176. 860.57 s [unordered-containers] insertWith: OK (0.05s)
  15177. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15178. 860.57 s [unordered-containers] valid: OK (0.02s)
  15179. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15180. 860.57 s [unordered-containers] delete
  15181. 860.57 s [unordered-containers] model: OK (0.02s)
  15182. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15183. 860.57 s [unordered-containers] valid: OK (0.02s)
  15184. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15185. 860.57 s [unordered-containers] adjust
  15186. 860.57 s [unordered-containers] model: OK (0.04s)
  15187. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15188. 860.57 s [unordered-containers] valid: OK (0.06s)
  15189. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15190. 860.57 s [unordered-containers] update
  15191. 860.57 s [unordered-containers] model: OK (0.05s)
  15192. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15193. 860.57 s [unordered-containers] valid: OK (0.04s)
  15194. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15195. 860.57 s [unordered-containers] alter
  15196. 860.57 s [unordered-containers] model: OK (0.03s)
  15197. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15198. 860.57 s [unordered-containers] valid: OK (0.03s)
  15199. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15200. 860.57 s [unordered-containers] alterF
  15201. 860.57 s [unordered-containers] model
  15202. 860.57 s [unordered-containers] []: OK (0.41s)
  15203. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15204. 860.57 s [unordered-containers] adjust: OK (0.07s)
  15205. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15206. 860.57 s [unordered-containers] insert: OK (0.06s)
  15207. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15208. 860.57 s [unordered-containers] insertWith: OK (0.05s)
  15209. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15210. 860.57 s [unordered-containers] delete: OK (0.05s)
  15211. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15212. 860.57 s [unordered-containers] lookup: OK (0.12s)
  15213. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15214. 860.57 s [unordered-containers] valid: OK (0.09s)
  15215. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15216. 860.57 s [unordered-containers] isSubmapOf
  15217. 860.57 s [unordered-containers] model: OK (0.10s)
  15218. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15219. 860.57 s [unordered-containers] m ⊆ m: OK (0.02s)
  15220. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15221. 860.57 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.10s)
  15222. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15223. 860.57 s [unordered-containers] m1\m2 ⊆ m1: OK (0.04s)
  15224. 860.57 s [unordered-containers] +++ OK, passed 100 tests.
  15225. 860.57 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.13s)
  15226. 860.57 s [unordered-containers] +++ OK, passed 100 tests; 150 discarded.
  15227. 860.57 s [unordered-containers] delete k m ⊆ m: OK (0.06s)
  15228. 860.57 s [unordered-containers] +++ OK, passed 100 tests; 19 discarded.
  15229. 860.57 s [unordered-containers] m ⊈ delete k m : OK (0.05s)
  15230. 860.57 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  15231. 860.57 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.04s)
  15232. 860.57 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  15233. 860.58 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.03s)
  15234. 860.58 s [unordered-containers] +++ OK, passed 100 tests; 9 discarded.
  15235. 860.58 s [unordered-containers] union
  15236. 860.58 s [unordered-containers] model: OK (0.08s)
  15237. 860.59 s [unordered-containers] +++ OK, passed 100 tests.
  15238. 860.60 s [unordered-containers] valid: OK
  15239. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15240. 860.60 s [unordered-containers] unionWith
  15241. 860.60 s [unordered-containers] model: OK (0.10s)
  15242. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15243. 860.60 s [unordered-containers] valid: OK (0.07s)
  15244. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15245. 860.60 s [unordered-containers] unionWithKey
  15246. 860.60 s [unordered-containers] model: OK (0.32s)
  15247. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15248. 860.60 s [unordered-containers] valid: OK (0.21s)
  15249. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15250. 860.60 s [unordered-containers] unions
  15251. 860.60 s [unordered-containers] model: OK (2.52s)
  15252. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15253. 860.60 s [unordered-containers] valid: OK (1.27s)
  15254. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15255. 860.60 s [unordered-containers] difference
  15256. 860.60 s [unordered-containers] model: OK (0.04s)
  15257. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15258. 860.60 s [unordered-containers] valid: OK (0.10s)
  15259. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15260. 860.60 s [unordered-containers] differenceWith
  15261. 860.60 s [unordered-containers] model: OK (0.19s)
  15262. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15263. 860.60 s [unordered-containers] valid: OK (0.11s)
  15264. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15265. 860.60 s [unordered-containers] intersection
  15266. 860.60 s [unordered-containers] model: OK (0.06s)
  15267. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15268. 860.60 s [unordered-containers] valid: OK (0.03s)
  15269. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15270. 860.60 s [unordered-containers] intersectionWith
  15271. 860.60 s [unordered-containers] model: OK (0.11s)
  15272. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15273. 860.60 s [unordered-containers] valid: OK (0.15s)
  15274. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15275. 860.60 s [unordered-containers] intersectionWithKey
  15276. 860.60 s [unordered-containers] model: OK (0.38s)
  15277. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15278. 860.60 s [unordered-containers] valid: OK (0.25s)
  15279. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15280. 860.60 s [unordered-containers] compose
  15281. 860.60 s [unordered-containers] valid: OK (0.09s)
  15282. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15283. 860.60 s [unordered-containers] map
  15284. 860.60 s [unordered-containers] model: OK (0.27s)
  15285. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15286. 860.60 s [unordered-containers] valid: OK (0.18s)
  15287. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15288. 860.60 s [unordered-containers] traverseWithKey
  15289. 860.60 s [unordered-containers] model: OK (1.92s)
  15290. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15291. 860.60 s [unordered-containers] valid: OK (0.07s)
  15292. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15293. 860.60 s [unordered-containers] mapKeys
  15294. 860.60 s [unordered-containers] model: OK (0.05s)
  15295. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15296. 860.60 s [unordered-containers] valid: OK (1.62s)
  15297. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15298. 860.60 s [unordered-containers] foldr: OK (0.06s)
  15299. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15300. 860.60 s [unordered-containers] foldl: OK (0.05s)
  15301. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15302. 860.60 s [unordered-containers] foldrWithKey: OK (0.02s)
  15303. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15304. 860.60 s [unordered-containers] foldlWithKey: OK (0.08s)
  15305. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15306. 860.60 s [unordered-containers] foldrWithKey': OK (0.04s)
  15307. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15308. 860.60 s [unordered-containers] foldlWithKey': OK (0.05s)
  15309. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15310. 860.60 s [unordered-containers] foldl': OK (0.06s)
  15311. 860.60 s [unordered-containers] +++ OK, passed 100 tests.
  15312. 860.60 s [unordered-containers] foldr': OK (0.03s)
  15313. 860.61 s [unordered-containers] +++ OK, passed 100 tests.
  15314. 860.61 s [unordered-containers] foldMapWithKey: OK (0.10s)
  15315. 860.61 s [unordered-containers] +++ OK, passed 100 tests.
  15316. 860.61 s [unordered-containers] filter
  15317. 860.61 s [unordered-containers] model: OK (0.32s)
  15318. 860.61 s [unordered-containers] +++ OK, passed 100 tests.
  15319. 860.61 s [unordered-containers] valid: OK (0.06s)
  15320. 860.61 s [unordered-containers] +++ OK, passed 100 tests.
  15321. 860.61 s [unordered-containers] filterWithKey
  15322. 861.35 s [unordered-containers] model: OK (3.23s)
  15323. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15324. 861.35 s [unordered-containers] valid: OK (2.01s)
  15325. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15326. 861.35 s [unordered-containers] mapMaybe
  15327. 861.35 s [unordered-containers] model: OK (0.46s)
  15328. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15329. 861.35 s [unordered-containers] valid: OK (0.23s)
  15330. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15331. 861.35 s [unordered-containers] mapMaybeWithKey
  15332. 861.35 s [unordered-containers] model: OK (3.15s)
  15333. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15334. 861.35 s [unordered-containers] valid: OK (2.20s)
  15335. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15336. 861.35 s [unordered-containers] elems: OK (0.10s)
  15337. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15338. 861.35 s [unordered-containers] keys: OK (0.03s)
  15339. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15340. 861.35 s [unordered-containers] fromList
  15341. 861.35 s [unordered-containers] model: OK (0.10s)
  15342. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15343. 861.35 s [unordered-containers] valid: OK (0.09s)
  15344. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15345. 861.35 s [unordered-containers] fromListWith
  15346. 861.35 s [unordered-containers] model: OK (0.05s)
  15347. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15348. 861.35 s [unordered-containers] valid: OK (0.14s)
  15349. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15350. 861.35 s [unordered-containers] fromListWithKey
  15351. 861.35 s [unordered-containers] model: OK (0.02s)
  15352. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15353. 861.35 s [unordered-containers] valid: OK (0.14s)
  15354. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15355. 861.35 s [unordered-containers] toList: OK (0.04s)
  15356. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15357. 861.35 s [unordered-containers] Data.HashSet
  15358. 861.35 s [unordered-containers] instances
  15359. 861.35 s [unordered-containers] Eq
  15360. 861.35 s [unordered-containers] ==: OK (0.06s)
  15361. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15362. 861.35 s [unordered-containers] == permutations: OK (0.06s)
  15363. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15364. 861.35 s [unordered-containers] /=: OK (0.04s)
  15365. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15366. 861.35 s [unordered-containers] Ord
  15367. 861.35 s [unordered-containers] compare reflexive: OK (0.05s)
  15368. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15369. 861.35 s [unordered-containers] compare transitive: OK (0.08s)
  15370. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15371. 861.35 s [unordered-containers] compare antisymmetric: OK (0.06s)
  15372. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15373. 861.35 s [unordered-containers] Ord => Eq: OK (0.04s)
  15374. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15375. 861.35 s [unordered-containers] Read/Show: OK (0.69s)
  15376. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15377. 861.35 s [unordered-containers] Foldable: OK (0.03s)
  15378. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15379. 861.35 s [unordered-containers] Hashable: OK (0.03s)
  15380. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15381. 861.35 s [unordered-containers] size: OK (0.03s)
  15382. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15383. 861.35 s [unordered-containers] member: OK (0.02s)
  15384. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15385. 861.35 s [unordered-containers] insert: OK (0.05s)
  15386. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15387. 861.35 s [unordered-containers] delete: OK (0.07s)
  15388. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15389. 861.35 s [unordered-containers] union: OK (0.10s)
  15390. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15391. 861.35 s [unordered-containers] map: OK (2.08s)
  15392. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15393. 861.35 s [unordered-containers] foldr: OK (0.03s)
  15394. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15395. 861.35 s [unordered-containers] foldl': OK (0.08s)
  15396. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15397. 861.35 s [unordered-containers] filter: OK (1.89s)
  15398. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15399. 861.35 s [unordered-containers] toList: OK (0.04s)
  15400. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15401. 861.35 s [unordered-containers] Data.HashMap.Internal.List
  15402. 861.35 s [unordered-containers] isPermutationBy: OK (0.16s)
  15403. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15404. 861.35 s [unordered-containers] isPermutationBy of different length: OK
  15405. 861.35 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  15406. 861.35 s [unordered-containers] pUnorderedCompare: OK (0.15s)
  15407. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15408. 861.35 s [unordered-containers] modelUnorderedCompare
  15409. 861.35 s [unordered-containers] reflexive: OK
  15410. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15411. 861.35 s [unordered-containers] anti-symmetric: OK (0.08s)
  15412. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15413. 861.35 s [unordered-containers] transitive: OK (0.08s)
  15414. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15415. 861.35 s [unordered-containers] Regression tests
  15416. 861.35 s [unordered-containers] issue32: OK
  15417. 861.35 s [unordered-containers] issue39a: OK
  15418. 861.35 s [unordered-containers] issue39b: OK (0.13s)
  15419. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15420. 861.35 s [unordered-containers] issue254 lazy: OK (0.08s)
  15421. 861.35 s [unordered-containers] issue254 strict: OK (0.04s)
  15422. 861.35 s [unordered-containers] issue379
  15423. 861.35 s [unordered-containers] Lazy.unionWith: OK (0.01s)
  15424. 861.35 s [unordered-containers] union: OK
  15425. 861.35 s [unordered-containers] Strict.unionWith: OK
  15426. 861.35 s [unordered-containers] Strict.unionWithKey: OK
  15427. 861.35 s [unordered-containers] issue381
  15428. 861.35 s [unordered-containers] mapMaybe: OK
  15429. 861.35 s [unordered-containers] mapMaybeWithKey: OK
  15430. 861.35 s [unordered-containers] issue382: OK (0.02s)
  15431. 861.35 s [unordered-containers] issue383: OK (0.02s)
  15432. 861.35 s [unordered-containers] issue420: OK
  15433. 861.35 s [unordered-containers] issue491
  15434. 861.35 s [unordered-containers] 1: OK
  15435. 861.35 s [unordered-containers] 2: OK
  15436. 861.35 s [unordered-containers] 3: OK
  15437. 861.35 s [unordered-containers] Strictness
  15438. 861.35 s [unordered-containers] HashMap.Strict
  15439. 861.35 s [unordered-containers] singleton is key-strict: OK
  15440. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15441. 861.35 s [unordered-containers] singleton is value-strict: OK
  15442. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15443. 861.35 s [unordered-containers] member is key-strict: OK
  15444. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15445. 861.35 s [unordered-containers] lookup is key-strict: OK
  15446. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15447. 861.35 s [unordered-containers] lookupDefault is key-strict: OK
  15448. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15449. 861.35 s [unordered-containers] findWithDefault is key-strict: OK (0.01s)
  15450. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15451. 861.35 s [unordered-containers] ! is key-strict: OK
  15452. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15453. 861.35 s [unordered-containers] delete is key-strict: OK (0.02s)
  15454. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15455. 861.35 s [unordered-containers] adjust is key-strict: OK
  15456. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15457. 861.35 s [unordered-containers] adjust is value-strict: OK (0.03s)
  15458. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15459. 861.35 s [unordered-containers] insert is key-strict: OK
  15460. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15461. 861.35 s [unordered-containers] insert is value-strict: OK
  15462. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15463. 861.35 s [unordered-containers] insertWith is key-strict: OK
  15464. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15465. 861.35 s [unordered-containers] insertWith is value-strict: OK (0.03s)
  15466. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15467. 861.35 s [unordered-containers] fromList is key-strict: OK
  15468. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15469. 861.35 s [unordered-containers] fromList is value-strict: OK
  15470. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15471. 861.35 s [unordered-containers] fromListWith is key-strict: OK
  15472. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15473. 861.35 s [unordered-containers] fromListWith is value-strict: OK (0.03s)
  15474. 861.35 s [unordered-containers] +++ OK, passed 100 tests.
  15475. 861.35 s [unordered-containers]
  15476. 861.35 s [unordered-containers] All 257 tests passed (4.59s)
  15477. 861.40 s [unordered-containers] Test suite unordered-containers-tests: PASS
  15478. 861.40 s [unordered-containers] Test suite logged to:
  15479. 861.40 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  15480. 861.40 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  15481. 861.42 s [unordered-containers] Phase: haddockPhase
  15482. 861.95 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  15483. 861.95 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  15484. 862.74 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  15485. 862.88 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  15486. 862.88 s [unordered-containers] |
  15487. 862.88 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  15488. 862.88 s [unordered-containers] | ^^^^^^^^^^
  15489. 862.88 s [unordered-containers]
  15490. 863.14 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  15491. 864.20 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  15492. 864.20 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  15493. 864.20 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  15494. 864.20 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  15495. 864.20 s [unordered-containers] |
  15496. 864.20 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  15497. 864.20 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15498. 864.20 s [unordered-containers]
  15499. 864.22 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  15500. 864.30 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  15501. 867.92 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  15502. 868.09 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  15503. 868.61 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  15504. 868.87 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  15505. 868.88 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  15506. 868.89 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  15507. 868.91 s [unordered-containers] Haddock coverage:
  15508. 868.91 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  15509. 868.91 s [unordered-containers] Missing documentation for:
  15510. 868.91 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  15511. 868.91 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  15512. 868.91 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  15513. 868.92 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  15514. 868.92 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  15515. 868.92 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  15516. 868.92 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  15517. 868.92 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  15518. 868.92 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  15519. 868.92 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  15520. 868.92 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  15521. 868.92 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  15522. 868.92 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  15523. 868.92 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  15524. 868.92 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  15525. 868.92 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  15526. 868.92 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  15527. 868.92 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  15528. 868.92 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  15529. 868.92 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  15530. 868.92 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  15531. 868.92 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  15532. 868.92 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  15533. 868.92 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  15534. 868.92 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  15535. 868.92 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  15536. 868.92 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  15537. 868.92 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  15538. 868.92 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  15539. 868.92 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  15540. 868.92 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  15541. 868.92 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  15542. 868.92 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  15543. 868.92 s [unordered-containers] Missing documentation for:
  15544. 868.92 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  15545. 868.92 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  15546. 868.92 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  15547. 868.92 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  15548. 868.92 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  15549. 868.92 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  15550. 868.92 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15551. 868.92 s [unordered-containers] by specifying the type/value namespace explicitly.
  15552. 868.92 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  15553. 868.93 s [unordered-containers] Warning: 'at' is out of scope.
  15554. 868.93 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15555. 868.94 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  15556. 868.94 s [unordered-containers] Missing documentation for:
  15557. 868.94 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  15558. 868.94 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  15559. 868.94 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  15560. 868.94 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  15561. 868.94 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  15562. 868.94 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  15563. 868.94 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  15564. 868.94 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  15565. 868.94 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  15566. 868.94 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  15567. 868.94 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  15568. 868.94 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  15569. 868.95 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  15570. 868.95 s [unordered-containers] Missing documentation for:
  15571. 868.95 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  15572. 868.95 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  15573. 868.95 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  15574. 868.95 s [unordered-containers] Warning: 'lookup' is out of scope.
  15575. 868.95 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15576. 868.95 s [unordered-containers] Warning: 'at' is out of scope.
  15577. 868.95 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  15578. 868.96 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  15579. 868.96 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  15580. 868.96 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  15581. 868.96 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  15582. 868.96 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15583. 868.96 s [unordered-containers] by specifying the type/value namespace explicitly.
  15584. 868.96 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  15585. 868.97 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  15586. 868.98 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  15587. 868.98 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  15588. 868.98 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  15589. 868.98 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  15590. 868.98 s [unordered-containers] by specifying the type/value namespace explicitly.
  15591. 868.98 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  15592. 868.98 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  15593. 868.98 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  15594. 868.99 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  15595. 884.44 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  15596. 884.44 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  15597. 884.58 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  15598. 884.60 s [unordered-containers] Phase: installPhase
  15599. 884.79 s [unordered-containers] Installing library in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  15600. 885.58 s [unordered-containers] Phase: fixupPhase
  15601. 885.61 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  15602. 885.63 s [unordered-containers] shrinking /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSunordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf-ghc9.10.3.so
  15603. 885.64 s [unordered-containers] checking for references to /build/ in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1...
  15604. 885.68 s [unordered-containers] patching script interpreter paths in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  15605. 885.69 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1/lib
  15606. 885.95 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc
  15607. 885.97 s [unordered-containers] checking for references to /build/ in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc...
  15608. 886.00 s [unordered-containers] patching script interpreter paths in /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc
  15609. 886.26 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  15610. 886.97 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  15611. 887.01 s [post-build-hook] Uploading to the NixCI cache: /nix/store/5mmx8gm8jsg9rh4w354js5i8am1gw13p-unordered-containers-0.2.20.1-doc /nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1
  15612. 887.10 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15613. 887.26 s [post-build-hook] copying 1 paths...
  15614. 887.26 s [post-build-hook] copying path '/nix/store/anvw6q6502w539fmmxkj9ypzh19nldni-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  15615. 892.02 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15616. 892.18 s [post-build-hook] copying 0 paths...
  15617. 892.23 s Progress: 11 of 19 built, 193 of 193 downloaded from cache
  15618. 892.33 s Building quickcheck-instances
  15619. 892.54 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  15620. 892.70 s [quickcheck-instances] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  15621. 893.15 s [quickcheck-instances] Phase: unpackPhase
  15622. 893.25 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  15623. 893.27 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  15624. 893.28 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  15625. 893.29 s [quickcheck-instances] Phase: patchPhase
  15626. 893.34 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  15627. 893.41 s [quickcheck-instances] Phase: compileBuildDriverPhase
  15628. 893.44 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.1qCjQhikhk/setup-package.conf.d -threaded
  15629. 893.57 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.1qCjQhikhk/Main.o )
  15630. 893.98 s [quickcheck-instances] [2 of 2] Linking Setup
  15631. 896.81 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  15632. 896.83 s [quickcheck-instances] Phase: configurePhase
  15633. 896.84 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.1qCjQhikhk/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  15634. 896.85 s [quickcheck-instances] Using Parsec parser
  15635. 896.85 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  15636. 898.30 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  15637. 898.34 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  15638. 898.34 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  15639. 898.34 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.20.2.0
  15640. 898.34 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  15641. 898.34 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  15642. 898.34 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  15643. 898.34 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  15644. 898.34 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  15645. 898.34 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  15646. 898.34 s [quickcheck-instances] integer-logarithms-1.0.4
  15647. 898.34 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  15648. 898.34 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  15649. 898.34 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  15650. 898.34 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  15651. 898.34 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  15652. 898.34 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  15653. 898.34 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.3
  15654. 898.34 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  15655. 898.34 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  15656. 898.34 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  15657. 898.34 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.1
  15658. 898.34 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  15659. 898.34 s [quickcheck-instances] unordered-containers-0.2.20.1
  15660. 898.34 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  15661. 898.34 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  15662. 898.34 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  15663. 898.34 s [quickcheck-instances] Dependency base: using base-4.20.2.0
  15664. 898.34 s [quickcheck-instances] Dependency containers: using containers-0.7
  15665. 898.34 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  15666. 898.34 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  15667. 898.34 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  15668. 898.34 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  15669. 898.34 s [quickcheck-instances] Source component graph:
  15670. 898.34 s [quickcheck-instances] component lib
  15671. 898.34 s [quickcheck-instances] component test:self-test dependency lib
  15672. 898.34 s [quickcheck-instances] Configured component graph:
  15673. 898.34 s [quickcheck-instances] component quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15674. 898.34 s [quickcheck-instances] include OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
  15675. 898.34 s [quickcheck-instances] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15676. 898.34 s [quickcheck-instances] include array-0.5.8.0-78a1
  15677. 898.34 s [quickcheck-instances] include base-4.20.2.0-acb8
  15678. 898.34 s [quickcheck-instances] include bytestring-0.12.2.0-04d5
  15679. 898.34 s [quickcheck-instances] include case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
  15680. 898.34 s [quickcheck-instances] include containers-0.7-a3f6
  15681. 898.34 s [quickcheck-instances] include data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
  15682. 898.34 s [quickcheck-instances] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  15683. 898.34 s [quickcheck-instances] include integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
  15684. 898.34 s [quickcheck-instances] include old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
  15685. 898.34 s [quickcheck-instances] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15686. 898.34 s [quickcheck-instances] include scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
  15687. 898.34 s [quickcheck-instances] include splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
  15688. 898.34 s [quickcheck-instances] include strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
  15689. 898.34 s [quickcheck-instances] include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15690. 898.34 s [quickcheck-instances] include text-2.1.3-e138
  15691. 898.34 s [quickcheck-instances] include text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
  15692. 898.34 s [quickcheck-instances] include these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
  15693. 898.34 s [quickcheck-instances] include time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
  15694. 898.34 s [quickcheck-instances] include transformers-0.6.1.1-74e0
  15695. 898.34 s [quickcheck-instances] include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  15696. 898.34 s [quickcheck-instances] include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15697. 898.34 s [quickcheck-instances] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  15698. 898.35 s [quickcheck-instances] component quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
  15699. 898.35 s [quickcheck-instances] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15700. 898.35 s [quickcheck-instances] include base-4.20.2.0-acb8
  15701. 898.35 s [quickcheck-instances] include containers-0.7-a3f6
  15702. 898.35 s [quickcheck-instances] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15703. 898.35 s [quickcheck-instances] include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15704. 898.35 s [quickcheck-instances] include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15705. 898.35 s [quickcheck-instances] include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15706. 898.35 s [quickcheck-instances] Linked component graph:
  15707. 898.35 s [quickcheck-instances] unit quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15708. 898.35 s [quickcheck-instances] include OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
  15709. 898.35 s [quickcheck-instances] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15710. 898.35 s [quickcheck-instances] include array-0.5.8.0-78a1
  15711. 898.35 s [quickcheck-instances] include base-4.20.2.0-acb8
  15712. 898.35 s [quickcheck-instances] include bytestring-0.12.2.0-04d5
  15713. 898.35 s [quickcheck-instances] include case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
  15714. 898.35 s [quickcheck-instances] include containers-0.7-a3f6
  15715. 898.35 s [quickcheck-instances] include data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
  15716. 898.35 s [quickcheck-instances] include hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  15717. 898.35 s [quickcheck-instances] include integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
  15718. 898.35 s [quickcheck-instances] include old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
  15719. 898.35 s [quickcheck-instances] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15720. 898.35 s [quickcheck-instances] include scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
  15721. 898.35 s [quickcheck-instances] include splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
  15722. 898.35 s [quickcheck-instances] include strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
  15723. 898.35 s [quickcheck-instances] include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15724. 898.35 s [quickcheck-instances] include text-2.1.3-e138
  15725. 898.35 s [quickcheck-instances] include text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
  15726. 898.35 s [quickcheck-instances] include these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
  15727. 898.35 s [quickcheck-instances] include time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
  15728. 898.35 s [quickcheck-instances] include transformers-0.6.1.1-74e0
  15729. 898.35 s [quickcheck-instances] include unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  15730. 898.35 s [quickcheck-instances] include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15731. 898.35 s [quickcheck-instances] include vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  15732. 898.35 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH:Test.QuickCheck.Instances.Void
  15733. 898.35 s [quickcheck-instances] unit quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
  15734. 898.35 s [quickcheck-instances] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15735. 898.35 s [quickcheck-instances] include base-4.20.2.0-acb8
  15736. 898.35 s [quickcheck-instances] include containers-0.7-a3f6
  15737. 898.35 s [quickcheck-instances] include primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15738. 898.35 s [quickcheck-instances] include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15739. 898.35 s [quickcheck-instances] include tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15740. 898.35 s [quickcheck-instances] include uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15741. 898.35 s [quickcheck-instances] Ready component graph:
  15742. 898.35 s [quickcheck-instances] definite quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15743. 898.35 s [quickcheck-instances] depends OneTuple-0.4.2-FyDXXJxd68Y9jTC7VxsRZq
  15744. 898.35 s [quickcheck-instances] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15745. 898.35 s [quickcheck-instances] depends array-0.5.8.0-78a1
  15746. 898.35 s [quickcheck-instances] depends base-4.20.2.0-acb8
  15747. 898.35 s [quickcheck-instances] depends bytestring-0.12.2.0-04d5
  15748. 898.35 s [quickcheck-instances] depends case-insensitive-1.2.1.0-Ctc9JutduFF2D0dK2Xysr7
  15749. 898.35 s [quickcheck-instances] depends containers-0.7-a3f6
  15750. 898.35 s [quickcheck-instances] depends data-fix-0.3.4-9yERijClVHm7aLi2wKvMUx
  15751. 898.35 s [quickcheck-instances] depends hashable-1.5.0.0-2Qh22RqWcWZLH1ENrPtkux
  15752. 898.35 s [quickcheck-instances] depends integer-logarithms-1.0.4-JAvo9izUTxA8wBq9muGdU8
  15753. 898.35 s [quickcheck-instances] depends old-time-1.1.0.4-KdoNf3UNdMG7Q2AiOvfcA8
  15754. 898.35 s [quickcheck-instances] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15755. 898.35 s [quickcheck-instances] depends scientific-0.3.8.0-IpVOxD0V8927oVTYb6GgE
  15756. 898.35 s [quickcheck-instances] depends splitmix-0.1.3.1-1NkY18pzkc6CKWzhmiYn4u
  15757. 898.35 s [quickcheck-instances] depends strict-0.5.1-JyokuSJrXwYGeFesEkaEwG
  15758. 898.35 s [quickcheck-instances] depends tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15759. 898.35 s [quickcheck-instances] depends text-2.1.3-e138
  15760. 898.35 s [quickcheck-instances] depends text-short-0.1.6-r1vhOAgHHr3TnFZaYcqZr
  15761. 898.35 s [quickcheck-instances] depends these-1.2.1-J38nvrZc9Pg6DEkxcKUfl5
  15762. 898.35 s [quickcheck-instances] depends time-compat-1.9.8-7kyDhbeIppD4AgHq2X4xCx
  15763. 898.35 s [quickcheck-instances] depends transformers-0.6.1.1-74e0
  15764. 898.35 s [quickcheck-instances] depends unordered-containers-0.2.20.1-IsJ5aT5jnQ3KSsNAnBcjlf
  15765. 898.35 s [quickcheck-instances] depends uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15766. 898.35 s [quickcheck-instances] depends vector-0.13.2.0-C7udN8tjbRJSFYBuRqTlg
  15767. 898.35 s [quickcheck-instances] definite quickcheck-instances-0.3.33-CWXsN6DMjs1E6LMHqJuRhG-self-test
  15768. 898.35 s [quickcheck-instances] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  15769. 898.35 s [quickcheck-instances] depends base-4.20.2.0-acb8
  15770. 898.35 s [quickcheck-instances] depends containers-0.7-a3f6
  15771. 898.35 s [quickcheck-instances] depends primitive-0.9.1.0-IS5mNjix18uGyoj1SAdDIy
  15772. 898.35 s [quickcheck-instances] depends quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15773. 898.36 s [quickcheck-instances] depends tagged-0.8.9-C6nZztreY4T8aonnaC6mrs
  15774. 898.36 s [quickcheck-instances] depends uuid-types-1.0.6-1jxbkc1uSfzG2mjp9WkBtZ
  15775. 898.36 s [quickcheck-instances] Using Cabal-3.12.1.0 compiled by ghc-9.10
  15776. 898.36 s [quickcheck-instances] Using compiler: ghc-9.10.3
  15777. 898.36 s [quickcheck-instances] Using install prefix:
  15778. 898.36 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
  15779. 898.36 s [quickcheck-instances] Executables installed in:
  15780. 898.36 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/bin
  15781. 898.36 s [quickcheck-instances] Libraries installed in:
  15782. 898.36 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  15783. 898.36 s [quickcheck-instances] Dynamic Libraries installed in:
  15784. 898.36 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  15785. 898.36 s [quickcheck-instances] Private executables installed in:
  15786. 898.36 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33
  15787. 898.36 s [quickcheck-instances] Data files installed in:
  15788. 898.36 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33
  15789. 898.36 s [quickcheck-instances] Documentation installed in:
  15790. 898.36 s [quickcheck-instances] /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  15791. 898.36 s [quickcheck-instances] Configuration files installed in:
  15792. 898.36 s [quickcheck-instances] /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/etc
  15793. 898.36 s [quickcheck-instances] No alex found
  15794. 898.36 s [quickcheck-instances] Using ar found on system at:
  15795. 898.36 s [quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  15796. 898.36 s [quickcheck-instances] No c2hs found
  15797. 898.36 s [quickcheck-instances] No cpphs found
  15798. 898.36 s [quickcheck-instances] No doctest found
  15799. 898.36 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  15800. 898.36 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  15801. 898.36 s [quickcheck-instances] Using ghc version 9.10.3 found on system at:
  15802. 898.36 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  15803. 898.36 s [quickcheck-instances] Using ghc-pkg version 9.10.3 found on system at:
  15804. 898.36 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  15805. 898.36 s [quickcheck-instances] No ghcjs found
  15806. 898.36 s [quickcheck-instances] No ghcjs-pkg found
  15807. 898.36 s [quickcheck-instances] No greencard found
  15808. 898.36 s [quickcheck-instances] Using haddock version 2.31.1 found on system at:
  15809. 898.36 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  15810. 898.36 s [quickcheck-instances] No happy found
  15811. 898.36 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  15812. 898.36 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15813. 898.36 s [quickcheck-instances] No hmake found
  15814. 898.36 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  15815. 898.36 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  15816. 898.36 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  15817. 898.36 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  15818. 898.36 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  15819. 898.36 s [quickcheck-instances] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  15820. 898.36 s [quickcheck-instances] No jhc found
  15821. 898.36 s [quickcheck-instances] Using ld found on system at:
  15822. 898.36 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  15823. 898.36 s [quickcheck-instances] No pkg-config found
  15824. 898.36 s [quickcheck-instances] Using runghc version 9.10.3 found on system at:
  15825. 898.36 s [quickcheck-instances] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  15826. 898.36 s [quickcheck-instances] Using strip version 2.44 found on system at:
  15827. 898.36 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  15828. 898.36 s [quickcheck-instances] Using tar found on system at:
  15829. 898.36 s [quickcheck-instances] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  15830. 898.36 s [quickcheck-instances] No uhc found
  15831. 898.60 s [quickcheck-instances] Phase: buildPhase
  15832. 898.77 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  15833. 898.81 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  15834. 899.06 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.o, dist/build/Test/QuickCheck/Instances/Containers.dyn_o )
  15835. 899.14 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.o, dist/build/Test/QuickCheck/Instances/CustomPrelude.dyn_o )
  15836. 899.17 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.o, dist/build/Test/QuickCheck/Instances/CaseInsensitive.dyn_o )
  15837. 899.69 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.o, dist/build/Test/QuickCheck/Instances/ByteString.dyn_o )
  15838. 899.72 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.o, dist/build/Test/QuickCheck/Instances/Array.dyn_o )
  15839. 900.16 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.o, dist/build/Test/QuickCheck/Instances/DataFix.dyn_o )
  15840. 900.16 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.o, dist/build/Test/QuickCheck/Instances/Hashable.dyn_o )
  15841. 900.16 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.o, dist/build/Test/QuickCheck/Instances/Natural.dyn_o )
  15842. 900.16 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.o, dist/build/Test/QuickCheck/Instances/OldTime.dyn_o )
  15843. 900.16 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.o, dist/build/Test/QuickCheck/Instances/Primitive.dyn_o )
  15844. 900.16 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.o, dist/build/Test/QuickCheck/Instances/Array/Byte.dyn_o )
  15845. 900.16 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.o, dist/build/Test/QuickCheck/Instances/Scientific.dyn_o )
  15846. 900.16 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.o, dist/build/Test/QuickCheck/Instances/Semigroup.dyn_o )
  15847. 900.16 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.o, dist/build/Test/QuickCheck/Instances/Solo.dyn_o )
  15848. 900.16 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.o, dist/build/Test/QuickCheck/Instances/Strict.dyn_o )
  15849. 900.44 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.o, dist/build/Test/QuickCheck/Instances/Tagged.dyn_o )
  15850. 900.44 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.o, dist/build/Test/QuickCheck/Instances/Text.dyn_o )
  15851. 900.44 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.o, dist/build/Test/QuickCheck/Instances/Text/Short.dyn_o )
  15852. 900.44 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.o, dist/build/Test/QuickCheck/Instances/These.dyn_o )
  15853. 900.44 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.o, dist/build/Test/QuickCheck/Instances/Time.dyn_o )
  15854. 901.39 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.o, dist/build/Test/QuickCheck/Instances/Transformer.dyn_o )
  15855. 901.39 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.o, dist/build/Test/QuickCheck/Instances/UUID.dyn_o )
  15856. 901.39 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.o, dist/build/Test/QuickCheck/Instances/UnorderedContainers.dyn_o )
  15857. 901.39 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.o, dist/build/Test/QuickCheck/Instances/Vector.dyn_o )
  15858. 901.39 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.o, dist/build/Test/QuickCheck/Instances/Void.dyn_o )
  15859. 901.39 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.o, dist/build/Test/QuickCheck/Instances.dyn_o )
  15860. 902.39 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
  15861. 902.93 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
  15862. 903.89 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
  15863. 904.22 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
  15864. 904.22 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
  15865. 904.22 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
  15866. 904.22 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
  15867. 904.22 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
  15868. 904.22 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
  15869. 904.22 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
  15870. 904.22 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.p_o )
  15871. 904.22 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
  15872. 904.22 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
  15873. 904.22 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
  15874. 904.22 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
  15875. 904.41 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
  15876. 904.41 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
  15877. 904.41 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.p_o )
  15878. 904.41 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
  15879. 904.54 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
  15880. 905.43 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
  15881. 905.43 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
  15882. 905.43 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
  15883. 905.43 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
  15884. 905.43 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
  15885. 905.43 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  15886. 909.29 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  15887. 909.29 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  15888. 909.46 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  15889. 910.05 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  15890. 911.45 s [quickcheck-instances] Phase: checkPhase
  15891. 912.03 s [quickcheck-instances] Running 1 test suites...
  15892. 912.03 s [quickcheck-instances] Test suite self-test: RUNNING...
  15893. 912.05 s [quickcheck-instances] +++ OK, passed 100 tests.
  15894. 912.05 s [quickcheck-instances] +++ OK, passed 100 tests.
  15895. 912.05 s [quickcheck-instances] +++ OK, passed 100 tests.
  15896. 912.05 s [quickcheck-instances] +++ OK, passed 100 tests.
  15897. 912.06 s [quickcheck-instances] +++ OK, passed 100 tests.
  15898. 912.06 s [quickcheck-instances] Test suite self-test: PASS
  15899. 912.06 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  15900. 912.06 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  15901. 912.08 s [quickcheck-instances] Phase: haddockPhase
  15902. 912.41 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  15903. 912.42 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  15904. 912.43 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  15905. 912.43 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  15906. 913.08 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  15907. 913.12 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  15908. 913.15 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  15909. 913.43 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  15910. 913.53 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  15911. 913.59 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  15912. 913.63 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  15913. 913.66 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  15914. 913.67 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  15915. 913.74 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  15916. 913.84 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  15917. 913.85 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  15918. 914.02 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  15919. 914.11 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  15920. 914.13 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  15921. 914.28 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  15922. 914.39 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  15923. 914.45 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  15924. 914.45 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  15925. 914.50 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  15926. 914.74 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  15927. 914.80 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  15928. 914.83 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  15929. 914.87 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  15930. 915.21 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  15931. 915.23 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  15932. 915.24 s [quickcheck-instances] Haddock coverage:
  15933. 915.24 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  15934. 915.24 s [quickcheck-instances] Missing documentation for:
  15935. 915.24 s [quickcheck-instances] Module header
  15936. 915.26 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  15937. 915.27 s [quickcheck-instances] Missing documentation for:
  15938. 915.27 s [quickcheck-instances] Module header
  15939. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  15940. 915.27 s [quickcheck-instances] Missing documentation for:
  15941. 915.27 s [quickcheck-instances] Module header
  15942. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  15943. 915.27 s [quickcheck-instances] Missing documentation for:
  15944. 915.27 s [quickcheck-instances] Module header
  15945. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  15946. 915.27 s [quickcheck-instances] Missing documentation for:
  15947. 915.27 s [quickcheck-instances] Module header
  15948. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  15949. 915.27 s [quickcheck-instances] Missing documentation for:
  15950. 915.27 s [quickcheck-instances] Module header
  15951. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  15952. 915.27 s [quickcheck-instances] Missing documentation for:
  15953. 915.27 s [quickcheck-instances] Module header
  15954. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  15955. 915.27 s [quickcheck-instances] Missing documentation for:
  15956. 915.27 s [quickcheck-instances] Module header
  15957. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  15958. 915.27 s [quickcheck-instances] Missing documentation for:
  15959. 915.27 s [quickcheck-instances] Module header
  15960. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  15961. 915.27 s [quickcheck-instances] Missing documentation for:
  15962. 915.27 s [quickcheck-instances] Module header
  15963. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  15964. 915.27 s [quickcheck-instances] Missing documentation for:
  15965. 915.27 s [quickcheck-instances] Module header
  15966. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  15967. 915.27 s [quickcheck-instances] Missing documentation for:
  15968. 915.27 s [quickcheck-instances] Module header
  15969. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  15970. 915.27 s [quickcheck-instances] Missing documentation for:
  15971. 915.27 s [quickcheck-instances] Module header
  15972. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  15973. 915.27 s [quickcheck-instances] Missing documentation for:
  15974. 915.27 s [quickcheck-instances] Module header
  15975. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  15976. 915.27 s [quickcheck-instances] Missing documentation for:
  15977. 915.27 s [quickcheck-instances] Module header
  15978. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  15979. 915.27 s [quickcheck-instances] Missing documentation for:
  15980. 915.27 s [quickcheck-instances] Module header
  15981. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  15982. 915.27 s [quickcheck-instances] Missing documentation for:
  15983. 915.27 s [quickcheck-instances] Module header
  15984. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  15985. 915.27 s [quickcheck-instances] Missing documentation for:
  15986. 915.27 s [quickcheck-instances] Module header
  15987. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  15988. 915.27 s [quickcheck-instances] Missing documentation for:
  15989. 915.27 s [quickcheck-instances] Module header
  15990. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  15991. 915.27 s [quickcheck-instances] Missing documentation for:
  15992. 915.27 s [quickcheck-instances] Module header
  15993. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  15994. 915.27 s [quickcheck-instances] Missing documentation for:
  15995. 915.27 s [quickcheck-instances] Module header
  15996. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  15997. 915.27 s [quickcheck-instances] Missing documentation for:
  15998. 915.27 s [quickcheck-instances] Module header
  15999. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  16000. 915.27 s [quickcheck-instances] Missing documentation for:
  16001. 915.27 s [quickcheck-instances] Module header
  16002. 915.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  16003. 915.27 s [quickcheck-instances] Missing documentation for:
  16004. 915.27 s [quickcheck-instances] Module header
  16005. 915.28 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  16006. 916.95 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  16007. 916.95 s [quickcheck-instances] - Data.Vector.Vector
  16008. 916.95 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  16009. 916.95 s [quickcheck-instances] - Data.Vector.Storable.Vector
  16010. 916.95 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  16011. 916.95 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  16012. 916.95 s [quickcheck-instances] - Data.Vector.Strict.Vector
  16013. 927.37 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  16014. 927.37 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  16015. 927.49 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  16016. 927.50 s [quickcheck-instances] Phase: installPhase
  16017. 927.66 s [quickcheck-instances] Installing library in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  16018. 928.42 s [quickcheck-instances] Phase: fixupPhase
  16019. 928.46 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
  16020. 928.48 s [quickcheck-instances] shrinking /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSquickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH-ghc9.10.3.so
  16021. 928.49 s [quickcheck-instances] checking for references to /build/ in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33...
  16022. 928.54 s [quickcheck-instances] patching script interpreter paths in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33
  16023. 928.55 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33/lib
  16024. 928.71 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
  16025. 928.72 s [quickcheck-instances] checking for references to /build/ in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc...
  16026. 928.76 s [quickcheck-instances] patching script interpreter paths in /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
  16027. 928.94 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
  16028. 938.39 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  16029. 938.43 s [post-build-hook] Uploading to the NixCI cache: /nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33 /nix/store/cak7xz9nkl9jzqfvvyycx9md4cyvj1xi-quickcheck-instances-0.3.33-doc
  16030. 938.50 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16031. 938.61 s [post-build-hook] copying 1 paths...
  16032. 938.61 s [post-build-hook] copying path '/nix/store/2cfapk9r5921y38hziw37119dc7k715z-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  16033. 941.26 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16034. 941.43 s [post-build-hook] copying 0 paths...
  16035. 941.47 s Progress: 12 of 19 built, 193 of 193 downloaded from cache
  16036. 941.54 s Building extra
  16037. 941.72 s [extra] Phase: setupCompilerEnvironmentPhase
  16038. 941.73 s [extra] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  16039. 942.03 s [extra] Phase: unpackPhase
  16040. 942.04 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  16041. 942.05 s [extra] source root is extra-1.8.1
  16042. 942.06 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  16043. 942.07 s [extra] Phase: patchPhase
  16044. 942.08 s [extra] Phase: compileBuildDriverPhase
  16045. 942.08 s [extra] setupCompileFlags: -package-db=/build/tmp.HJOpzyPRmt/setup-package.conf.d -threaded
  16046. 942.17 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.HJOpzyPRmt/Main.o )
  16047. 942.25 s [extra] [2 of 2] Linking Setup
  16048. 944.16 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  16049. 944.20 s [extra] Phase: configurePhase
  16050. 944.20 s [extra] configureFlags: --verbose --prefix=/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.HJOpzyPRmt/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  16051. 944.20 s [extra] Using Parsec parser
  16052. 944.20 s [extra] Configuring extra-1.8.1...
  16053. 944.94 s [extra] Dependency base >=4.9 && <5: using base-4.20.2.0
  16054. 944.94 s [extra] Dependency clock >=0.7: using clock-0.8.4
  16055. 944.94 s [extra] Dependency directory: using directory-1.3.8.5
  16056. 944.94 s [extra] Dependency filepath: using filepath-1.5.4.0
  16057. 944.94 s [extra] Dependency process: using process-1.6.26.1
  16058. 944.94 s [extra] Dependency time: using time-1.12.2
  16059. 944.94 s [extra] Dependency unix: using unix-2.8.7.0
  16060. 944.94 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  16061. 944.94 s [extra] Dependency base >=4 && <5: using base-4.20.2.0
  16062. 944.94 s [extra] Dependency directory: using directory-1.3.8.5
  16063. 944.94 s [extra] Dependency extra: using extra-1.8.1
  16064. 944.94 s [extra] Dependency filepath: using filepath-1.5.4.0
  16065. 944.94 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  16066. 944.94 s [extra] Dependency unix: using unix-2.8.7.0
  16067. 944.94 s [extra] Source component graph:
  16068. 944.94 s [extra] component lib
  16069. 944.94 s [extra] component test:extra-test dependency lib
  16070. 944.94 s [extra] Configured component graph:
  16071. 944.94 s [extra] component extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16072. 944.94 s [extra] include base-4.20.2.0-acb8
  16073. 944.94 s [extra] include clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
  16074. 944.94 s [extra] include directory-1.3.8.5-e377
  16075. 944.94 s [extra] include filepath-1.5.4.0-c4eb
  16076. 944.94 s [extra] include process-1.6.26.1-c5d9
  16077. 944.94 s [extra] include time-1.12.2-befd
  16078. 944.94 s [extra] include unix-2.8.7.0-61f9
  16079. 944.94 s [extra] component extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
  16080. 944.94 s [extra] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  16081. 944.94 s [extra] include base-4.20.2.0-acb8
  16082. 944.94 s [extra] include directory-1.3.8.5-e377
  16083. 944.94 s [extra] include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16084. 944.94 s [extra] include filepath-1.5.4.0-c4eb
  16085. 944.94 s [extra] include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  16086. 944.94 s [extra] include unix-2.8.7.0-61f9
  16087. 944.94 s [extra] Linked component graph:
  16088. 944.94 s [extra] unit extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16089. 944.94 s [extra] include base-4.20.2.0-acb8
  16090. 944.94 s [extra] include clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
  16091. 944.94 s [extra] include directory-1.3.8.5-e377
  16092. 944.94 s [extra] include filepath-1.5.4.0-c4eb
  16093. 944.94 s [extra] include process-1.6.26.1-c5d9
  16094. 944.94 s [extra] include time-1.12.2-befd
  16095. 944.94 s [extra] include unix-2.8.7.0-61f9
  16096. 944.94 s [extra] Control.Concurrent.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Data.Version.Extra,Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Extra,Numeric.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Numeric.Extra,System.Directory.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Environment.Extra,System.IO.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.IO.Extra,System.Info.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Info.Extra,System.Process.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Process.Extra,System.Time.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:System.Time.Extra,Text.Read.Extra=extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp:Text.Read.Extra
  16097. 944.94 s [extra] unit extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
  16098. 944.94 s [extra] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  16099. 944.94 s [extra] include base-4.20.2.0-acb8
  16100. 944.94 s [extra] include directory-1.3.8.5-e377
  16101. 944.94 s [extra] include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16102. 944.94 s [extra] include filepath-1.5.4.0-c4eb
  16103. 944.94 s [extra] include quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  16104. 944.94 s [extra] include unix-2.8.7.0-61f9
  16105. 944.94 s [extra] Ready component graph:
  16106. 944.94 s [extra] definite extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16107. 944.94 s [extra] depends base-4.20.2.0-acb8
  16108. 944.94 s [extra] depends clock-0.8.4-2xr44ThigeC8PNOcnMLGAS
  16109. 944.94 s [extra] depends directory-1.3.8.5-e377
  16110. 944.94 s [extra] depends filepath-1.5.4.0-c4eb
  16111. 944.94 s [extra] depends process-1.6.26.1-c5d9
  16112. 944.94 s [extra] depends time-1.12.2-befd
  16113. 944.94 s [extra] depends unix-2.8.7.0-61f9
  16114. 944.94 s [extra] definite extra-1.8.1-LEgS7m2yLxk9dspNzVXQGb-extra-test
  16115. 944.94 s [extra] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  16116. 944.94 s [extra] depends base-4.20.2.0-acb8
  16117. 944.94 s [extra] depends directory-1.3.8.5-e377
  16118. 944.94 s [extra] depends extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16119. 944.94 s [extra] depends filepath-1.5.4.0-c4eb
  16120. 944.94 s [extra] depends quickcheck-instances-0.3.33-3eFKN7WZHQsLajXQM30KdH
  16121. 944.94 s [extra] depends unix-2.8.7.0-61f9
  16122. 944.94 s [extra] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16123. 944.94 s [extra] Using compiler: ghc-9.10.3
  16124. 944.94 s [extra] Using install prefix: /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
  16125. 944.94 s [extra] Executables installed in:
  16126. 944.94 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/bin
  16127. 944.94 s [extra] Libraries installed in:
  16128. 944.94 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  16129. 944.94 s [extra] Dynamic Libraries installed in:
  16130. 944.94 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  16131. 944.94 s [extra] Private executables installed in:
  16132. 944.94 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/libexec/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1
  16133. 944.94 s [extra] Data files installed in:
  16134. 944.94 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/share/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1
  16135. 944.94 s [extra] Documentation installed in:
  16136. 944.94 s [extra] /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc/share/doc/extra-1.8.1
  16137. 944.94 s [extra] Configuration files installed in:
  16138. 944.94 s [extra] /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/etc
  16139. 944.94 s [extra] No alex found
  16140. 944.94 s [extra] Using ar found on system at:
  16141. 944.94 s [extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  16142. 944.94 s [extra] No c2hs found
  16143. 944.94 s [extra] No cpphs found
  16144. 944.94 s [extra] No doctest found
  16145. 944.94 s [extra] Using gcc version 14.3.0 given by user at:
  16146. 944.94 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  16147. 944.94 s [extra] Using ghc version 9.10.3 found on system at:
  16148. 944.94 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  16149. 944.94 s [extra] Using ghc-pkg version 9.10.3 found on system at:
  16150. 944.94 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  16151. 944.94 s [extra] No ghcjs found
  16152. 944.94 s [extra] No ghcjs-pkg found
  16153. 944.94 s [extra] No greencard found
  16154. 944.94 s [extra] Using haddock version 2.31.1 found on system at:
  16155. 944.94 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  16156. 944.94 s [extra] No happy found
  16157. 944.94 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  16158. 944.94 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16159. 944.94 s [extra] No hmake found
  16160. 944.94 s [extra] Using hpc version 0.69 found on system at:
  16161. 944.94 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  16162. 944.94 s [extra] Using hsc2hs version 0.68.10 found on system at:
  16163. 944.94 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  16164. 944.94 s [extra] Using hscolour version 1.25 found on system at:
  16165. 944.94 s [extra] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  16166. 944.94 s [extra] No jhc found
  16167. 944.94 s [extra] Using ld found on system at:
  16168. 944.94 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  16169. 944.94 s [extra] No pkg-config found
  16170. 944.94 s [extra] Using runghc version 9.10.3 found on system at:
  16171. 944.94 s [extra] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  16172. 944.94 s [extra] Using strip version 2.44 found on system at:
  16173. 944.94 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  16174. 944.94 s [extra] Using tar found on system at:
  16175. 944.94 s [extra] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  16176. 944.94 s [extra] No uhc found
  16177. 945.10 s [extra] Phase: buildPhase
  16178. 945.17 s [extra] Preprocessing library for extra-1.8.1...
  16179. 945.18 s [extra] Building library for extra-1.8.1...
  16180. 945.54 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.o, dist/build/Data/IORef/Extra.dyn_o )
  16181. 945.65 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.o, dist/build/Data/Monoid/Extra.dyn_o )
  16182. 945.65 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.o, dist/build/Data/Tuple/Extra.dyn_o )
  16183. 945.68 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.o, dist/build/Data/Typeable/Extra.dyn_o )
  16184. 945.68 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  16185. 945.68 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  16186. 945.68 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.o, dist/build/Data/List/Extra.dyn_o )
  16187. 946.89 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.o, dist/build/Data/Version/Extra.dyn_o )
  16188. 946.96 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.o, dist/build/Data/List/NonEmpty/Extra.dyn_o )
  16189. 947.17 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.o, dist/build/Data/Either/Extra.dyn_o )
  16190. 947.17 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.o, dist/build/Control/Exception/Extra.dyn_o )
  16191. 947.17 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.o, dist/build/Control/Monad/Extra.dyn_o )
  16192. 947.44 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.o, dist/build/Data/Foldable/Extra.dyn_o )
  16193. 947.70 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.o, dist/build/Control/Concurrent/Extra.dyn_o )
  16194. 947.84 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.o, dist/build/System/Directory/Extra.dyn_o )
  16195. 947.84 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.o, dist/build/System/Environment/Extra.dyn_o )
  16196. 947.84 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.o, dist/build/System/IO/Extra.dyn_o )
  16197. 948.12 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.o, dist/build/System/Info/Extra.dyn_o )
  16198. 948.12 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.o, dist/build/System/Process/Extra.dyn_o )
  16199. 948.20 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.o, dist/build/System/Time/Extra.dyn_o )
  16200. 948.20 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  16201. 948.30 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.o, dist/build/Text/Read/Extra.dyn_o )
  16202. 948.98 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  16203. 949.26 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  16204. 949.32 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  16205. 949.32 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  16206. 949.32 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  16207. 949.32 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  16208. 949.32 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  16209. 950.72 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  16210. 950.92 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  16211. 951.03 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  16212. 951.03 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  16213. 951.03 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  16214. 951.49 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  16215. 951.89 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  16216. 952.02 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  16217. 952.02 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  16218. 952.02 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  16219. 952.34 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  16220. 952.34 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  16221. 952.51 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  16222. 952.51 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  16223. 952.65 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  16224. 954.16 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  16225. 954.16 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  16226. 954.24 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  16227. 954.64 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  16228. 956.56 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  16229. 957.26 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  16230. 957.26 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  16231. 957.87 s [extra] Phase: checkPhase
  16232. 958.24 s [extra] Running 1 test suites...
  16233. 958.24 s [extra] Test suite extra-test: RUNNING...
  16234. 958.25 s [extra] withTempFile
  16235. 958.25 s [extra] +++ OK, passed 100 tests.
  16236. 958.25 s [extra] captureOutput
  16237. 958.25 s [extra] +++ OK, passed 100 tests.
  16238. 958.25 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  16239. 958.29 s [extra] +++ OK, passed 100 tests.
  16240. 958.29 s [extra] \(x :: IO Int) -> join (once x) == x
  16241. 958.34 s [extra] +++ OK, passed 100 tests.
  16242. 958.34 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  16243. 958.37 s [extra] +++ OK, passed 100 tests.
  16244. 958.37 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  16245. 958.41 s [extra] +++ OK, passed 100 tests.
  16246. 958.41 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  16247. 958.46 s [extra] +++ OK, passed 100 tests.
  16248. 958.46 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  16249. 958.50 s [extra] +++ OK, passed 100 tests.
  16250. 958.50 s [extra] stringException "test" == pure "test"
  16251. 958.50 s [extra] +++ OK, passed 100 tests.
  16252. 958.50 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  16253. 958.50 s [extra] +++ OK, passed 100 tests.
  16254. 958.50 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  16255. 958.50 s [extra] +++ OK, passed 100 tests.
  16256. 958.50 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  16257. 958.50 s [extra] +++ OK, passed 100 tests.
  16258. 958.50 s [extra] ignore (print 1) == print 1
  16259. 958.50 s [extra] +++ OK, passed 100 tests.
  16260. 958.50 s [extra] ignore (fail "die") == pure ()
  16261. 958.50 s [extra] +++ OK, passed 100 tests.
  16262. 958.50 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  16263. 958.51 s [extra] +++ OK, passed 100 tests.
  16264. 958.51 s [extra] seq (errorIO "foo") (print 1) == print 1
  16265. 958.51 s [extra] +++ OK, passed 100 tests.
  16266. 958.51 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  16267. 958.51 s [extra] +++ OK, passed 100 tests.
  16268. 958.51 s [extra] seq (assertIO False) (print 1) == print 1
  16269. 958.51 s [extra] +++ OK, passed 100 tests.
  16270. 958.51 s [extra] retry 1 (print "x") == print "x"
  16271. 958.51 s [extra] +++ OK, passed 100 tests.
  16272. 958.51 s [extra] retry 3 (fail "die") == fail "die"
  16273. 958.51 s [extra] +++ OK, passed 100 tests.
  16274. 958.51 s [extra] whenJust Nothing print == pure ()
  16275. 958.51 s [extra] +++ OK, passed 100 tests.
  16276. 958.51 s [extra] whenJust (Just 1) print == print 1
  16277. 958.51 s [extra] +++ OK, passed 100 tests.
  16278. 958.51 s [extra] pureIf @Maybe True 5 == Just 5
  16279. 958.51 s [extra] +++ OK, passed 100 tests.
  16280. 958.51 s [extra] pureIf @Maybe False 5 == Nothing
  16281. 958.51 s [extra] +++ OK, passed 100 tests.
  16282. 958.51 s [extra] pureIf @[] True 5 == [5]
  16283. 958.51 s [extra] +++ OK, passed 100 tests.
  16284. 958.51 s [extra] pureIf @[] False 5 == []
  16285. 958.51 s [extra] +++ OK, passed 100 tests.
  16286. 958.51 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  16287. 958.51 s [extra] +++ OK, passed 100 tests.
  16288. 958.51 s [extra] whenMaybe False (print 1) == pure Nothing
  16289. 958.51 s [extra] +++ OK, passed 100 tests.
  16290. 958.51 s [extra] \(x :: Maybe ()) -> unit x == x
  16291. 958.51 s [extra] +++ OK, passed 100 tests.
  16292. 958.51 s [extra] guarded even 2 == [2]
  16293. 958.51 s [extra] +++ OK, passed 100 tests.
  16294. 958.51 s [extra] guarded odd 2 == Nothing
  16295. 958.51 s [extra] +++ OK, passed 100 tests.
  16296. 958.51 s [extra] guarded (not.null) "My Name" == Just "My Name"
  16297. 958.51 s [extra] +++ OK, passed 100 tests.
  16298. 958.51 s [extra] guardedA (return . even) 42 == Just [42]
  16299. 958.51 s [extra] +++ OK, passed 100 tests.
  16300. 958.51 s [extra] guardedA (return . odd) 42 == Just []
  16301. 958.51 s [extra] +++ OK, passed 100 tests.
  16302. 958.51 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  16303. 958.51 s [extra] +++ OK, passed 100 tests.
  16304. 958.51 s [extra] fold1M (\x y -> Just x) [] == undefined
  16305. 958.51 s [extra] +++ OK, passed 100 tests.
  16306. 958.51 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  16307. 958.51 s [extra] +++ OK, passed 100 tests.
  16308. 958.51 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  16309. 958.51 s [extra] +++ OK, passed 100 tests.
  16310. 958.51 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  16311. 958.51 s [extra] +++ OK, passed 100 tests.
  16312. 958.51 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  16313. 958.51 s [extra] +++ OK, passed 100 tests.
  16314. 958.51 s [extra] Just True ||^ undefined == Just True
  16315. 958.51 s [extra] +++ OK, passed 100 tests.
  16316. 958.52 s [extra] Just False ||^ Just True == Just True
  16317. 958.52 s [extra] +++ OK, passed 100 tests.
  16318. 958.52 s [extra] Just False ||^ Just False == Just False
  16319. 958.52 s [extra] +++ OK, passed 100 tests.
  16320. 958.52 s [extra] Just False &&^ undefined == Just False
  16321. 958.52 s [extra] +++ OK, passed 100 tests.
  16322. 958.52 s [extra] Just True &&^ Just True == Just True
  16323. 958.52 s [extra] +++ OK, passed 100 tests.
  16324. 958.52 s [extra] Just True &&^ Just False == Just False
  16325. 958.52 s [extra] +++ OK, passed 100 tests.
  16326. 958.52 s [extra] anyM Just [False,True ,undefined] == Just True
  16327. 958.52 s [extra] +++ OK, passed 100 tests.
  16328. 958.52 s [extra] anyM Just [False,False,undefined] == undefined
  16329. 958.52 s [extra] +++ OK, passed 100 tests.
  16330. 958.52 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  16331. 958.52 s [extra] +++ OK, passed 100 tests.
  16332. 958.52 s [extra] allM Just [True,False,undefined] == Just False
  16333. 958.52 s [extra] +++ OK, passed 100 tests.
  16334. 958.52 s [extra] allM Just [True,True ,undefined] == undefined
  16335. 958.52 s [extra] +++ OK, passed 100 tests.
  16336. 958.52 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  16337. 958.52 s [extra] +++ OK, passed 100 tests.
  16338. 958.52 s [extra] orM [Just False,Just True ,undefined] == Just True
  16339. 958.52 s [extra] +++ OK, passed 100 tests.
  16340. 958.52 s [extra] orM [Just False,Just False,undefined] == undefined
  16341. 958.52 s [extra] +++ OK, passed 100 tests.
  16342. 958.52 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  16343. 958.52 s [extra] +++ OK, passed 100 tests.
  16344. 958.52 s [extra] andM [Just True,Just False,undefined] == Just False
  16345. 958.52 s [extra] +++ OK, passed 100 tests.
  16346. 958.52 s [extra] andM [Just True,Just True ,undefined] == undefined
  16347. 958.52 s [extra] +++ OK, passed 100 tests.
  16348. 958.52 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  16349. 958.52 s [extra] +++ OK, passed 100 tests.
  16350. 958.52 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  16351. 958.52 s [extra] +++ OK, passed 100 tests.
  16352. 958.52 s [extra] findM (Just . isUpper) "test" == Just Nothing
  16353. 958.52 s [extra] +++ OK, passed 100 tests.
  16354. 958.52 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  16355. 958.52 s [extra] +++ OK, passed 100 tests.
  16356. 958.52 s [extra] fromLeft 1 (Left 3) == 3
  16357. 958.52 s [extra] +++ OK, passed 100 tests.
  16358. 958.52 s [extra] fromLeft 1 (Right "foo") == 1
  16359. 958.52 s [extra] +++ OK, passed 100 tests.
  16360. 958.52 s [extra] fromRight 1 (Right 3) == 3
  16361. 958.52 s [extra] +++ OK, passed 100 tests.
  16362. 958.52 s [extra] fromRight 1 (Left "foo") == 1
  16363. 958.52 s [extra] +++ OK, passed 100 tests.
  16364. 958.52 s [extra] \x -> fromLeft' (Left x) == x
  16365. 958.53 s [extra] +++ OK, passed 100 tests.
  16366. 958.53 s [extra] \x -> fromLeft' (Right x) == undefined
  16367. 958.53 s [extra] +++ OK, passed 100 tests.
  16368. 958.53 s [extra] \x -> fromRight' (Right x) == x
  16369. 958.53 s [extra] +++ OK, passed 100 tests.
  16370. 958.53 s [extra] \x -> fromRight' (Left x) == undefined
  16371. 958.53 s [extra] +++ OK, passed 100 tests.
  16372. 958.53 s [extra] \x -> fromEither (Left x ) == x
  16373. 958.53 s [extra] +++ OK, passed 100 tests.
  16374. 958.53 s [extra] \x -> fromEither (Right x) == x
  16375. 958.53 s [extra] +++ OK, passed 100 tests.
  16376. 958.53 s [extra] \a b -> maybeToEither a (Just b) == Right b
  16377. 958.53 s [extra] +++ OK, passed 100 tests.
  16378. 958.53 s [extra] \a -> maybeToEither a Nothing == Left a
  16379. 958.53 s [extra] +++ OK, passed 100 tests.
  16380. 958.53 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  16381. 958.53 s [extra] +++ OK, passed 100 tests.
  16382. 958.53 s [extra] \x -> eitherToMaybe (Right x) == Just x
  16383. 958.53 s [extra] +++ OK, passed 100 tests.
  16384. 958.53 s [extra] mapLeft show (Left 1) == Left "1"
  16385. 958.53 s [extra] +++ OK, passed 100 tests.
  16386. 958.53 s [extra] mapLeft show (Right True) == Right True
  16387. 958.53 s [extra] +++ OK, passed 100 tests.
  16388. 958.53 s [extra] mapRight show (Left 1) == Left 1
  16389. 958.53 s [extra] +++ OK, passed 100 tests.
  16390. 958.53 s [extra] mapRight show (Right True) == Right "True"
  16391. 958.53 s [extra] +++ OK, passed 100 tests.
  16392. 958.53 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  16393. 958.54 s [extra] +++ OK, passed 100 tests.
  16394. 958.54 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  16395. 958.54 s [extra] +++ OK, passed 100 tests.
  16396. 958.54 s [extra] \xs -> repeatedly line1 xs == lines xs
  16397. 958.54 s [extra] +++ OK, passed 100 tests.
  16398. 958.54 s [extra] disjoint [1,2,3] [4,5] == True
  16399. 958.54 s [extra] +++ OK, passed 100 tests.
  16400. 958.54 s [extra] disjoint [1,2,3] [4,1] == False
  16401. 958.54 s [extra] +++ OK, passed 100 tests.
  16402. 958.54 s [extra] disjointOrd [1,2,3] [4,5] == True
  16403. 958.54 s [extra] +++ OK, passed 100 tests.
  16404. 958.54 s [extra] disjointOrd [1,2,3] [4,1] == False
  16405. 958.54 s [extra] +++ OK, passed 100 tests.
  16406. 958.54 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  16407. 958.54 s [extra] +++ OK, passed 100 tests.
  16408. 958.54 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  16409. 958.54 s [extra] +++ OK, passed 100 tests.
  16410. 958.54 s [extra] anySame [1,1,2] == True
  16411. 958.54 s [extra] +++ OK, passed 100 tests.
  16412. 958.54 s [extra] anySame [1,2,3] == False
  16413. 958.54 s [extra] +++ OK, passed 100 tests.
  16414. 958.54 s [extra] anySame (1:2:1:undefined) == True
  16415. 958.54 s [extra] +++ OK, passed 100 tests.
  16416. 958.54 s [extra] anySame [] == False
  16417. 958.54 s [extra] +++ OK, passed 100 tests.
  16418. 958.54 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  16419. 958.54 s [extra] +++ OK, passed 100 tests.
  16420. 958.54 s [extra] allSame [1,1,2] == False
  16421. 958.54 s [extra] +++ OK, passed 100 tests.
  16422. 958.54 s [extra] allSame [1,1,1] == True
  16423. 958.54 s [extra] +++ OK, passed 100 tests.
  16424. 958.54 s [extra] allSame [1] == True
  16425. 958.54 s [extra] +++ OK, passed 100 tests.
  16426. 958.54 s [extra] allSame [] == True
  16427. 958.54 s [extra] +++ OK, passed 100 tests.
  16428. 958.54 s [extra] allSame (1:1:2:undefined) == False
  16429. 958.54 s [extra] +++ OK, passed 100 tests.
  16430. 958.54 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  16431. 958.54 s [extra] +++ OK, passed 100 tests.
  16432. 958.54 s [extra] headDef 1 [] == 1
  16433. 958.54 s [extra] +++ OK, passed 100 tests.
  16434. 958.54 s [extra] headDef 1 [2,3,4] == 2
  16435. 958.54 s [extra] +++ OK, passed 100 tests.
  16436. 958.54 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  16437. 958.54 s [extra] +++ OK, passed 100 tests.
  16438. 958.54 s [extra] lastDef 1 [] == 1
  16439. 958.54 s [extra] +++ OK, passed 100 tests.
  16440. 958.54 s [extra] lastDef 1 [2,3,4] == 4
  16441. 958.54 s [extra] +++ OK, passed 100 tests.
  16442. 958.54 s [extra] \x xs -> lastDef x xs == last (x:xs)
  16443. 958.54 s [extra] +++ OK, passed 100 tests.
  16444. 958.54 s [extra] [2,3,4] !? 1 == Just 3
  16445. 958.54 s [extra] +++ OK, passed 100 tests.
  16446. 958.54 s [extra] [2,3,4] !? (-1) == Nothing
  16447. 958.54 s [extra] +++ OK, passed 100 tests.
  16448. 958.54 s [extra] [] !? 0 == Nothing
  16449. 958.54 s [extra] +++ OK, passed 100 tests.
  16450. 958.54 s [extra] notNull [] == False
  16451. 958.54 s [extra] +++ OK, passed 100 tests.
  16452. 958.54 s [extra] notNull [1] == True
  16453. 958.54 s [extra] +++ OK, passed 100 tests.
  16454. 958.54 s [extra] \xs -> notNull xs == not (null xs)
  16455. 958.54 s [extra] +++ OK, passed 100 tests.
  16456. 958.54 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  16457. 958.54 s [extra] +++ OK, passed 100 tests.
  16458. 958.54 s [extra] list 1 (\v _ -> v - 2) [] == 1
  16459. 958.54 s [extra] +++ OK, passed 100 tests.
  16460. 958.54 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  16461. 958.55 s [extra] +++ OK, passed 100 tests.
  16462. 958.55 s [extra] unsnoc "test" == Just ("tes",'t')
  16463. 958.55 s [extra] +++ OK, passed 100 tests.
  16464. 958.55 s [extra] unsnoc "" == Nothing
  16465. 958.55 s [extra] +++ OK, passed 100 tests.
  16466. 958.55 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  16467. 958.55 s [extra] +++ OK, passed 100 tests.
  16468. 958.55 s [extra] cons 't' "est" == "test"
  16469. 958.55 s [extra] +++ OK, passed 100 tests.
  16470. 958.55 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  16471. 958.55 s [extra] +++ OK, passed 100 tests.
  16472. 958.55 s [extra] snoc "tes" 't' == "test"
  16473. 958.55 s [extra] +++ OK, passed 100 tests.
  16474. 958.55 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  16475. 958.55 s [extra] +++ OK, passed 100 tests.
  16476. 958.55 s [extra] enumerate == [False, True]
  16477. 958.55 s [extra] +++ OK, passed 100 tests.
  16478. 958.55 s [extra] takeEnd 3 "hello" == "llo"
  16479. 958.55 s [extra] +++ OK, passed 100 tests.
  16480. 958.55 s [extra] takeEnd 5 "bye" == "bye"
  16481. 958.55 s [extra] +++ OK, passed 100 tests.
  16482. 958.55 s [extra] takeEnd (-1) "bye" == ""
  16483. 958.55 s [extra] +++ OK, passed 100 tests.
  16484. 958.55 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  16485. 958.55 s [extra] +++ OK, passed 100 tests.
  16486. 958.55 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  16487. 958.55 s [extra] +++ OK, passed 100 tests.
  16488. 958.55 s [extra] dropEnd 3 "hello" == "he"
  16489. 958.55 s [extra] +++ OK, passed 100 tests.
  16490. 958.55 s [extra] dropEnd 5 "bye" == ""
  16491. 958.55 s [extra] +++ OK, passed 100 tests.
  16492. 958.55 s [extra] dropEnd (-1) "bye" == "bye"
  16493. 958.55 s [extra] +++ OK, passed 100 tests.
  16494. 958.55 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  16495. 958.55 s [extra] +++ OK, passed 100 tests.
  16496. 958.55 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  16497. 958.55 s [extra] +++ OK, passed 100 tests.
  16498. 958.55 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  16499. 958.55 s [extra] +++ OK, passed 100 tests.
  16500. 958.55 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  16501. 958.55 s [extra] +++ OK, passed 100 tests.
  16502. 958.55 s [extra] splitAtEnd 3 "he" == ("", "he")
  16503. 958.55 s [extra] +++ OK, passed 100 tests.
  16504. 958.55 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  16505. 958.55 s [extra] +++ OK, passed 100 tests.
  16506. 958.55 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  16507. 958.55 s [extra] +++ OK, passed 100 tests.
  16508. 958.55 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  16509. 958.55 s [extra] +++ OK, passed 100 tests.
  16510. 958.55 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  16511. 958.55 s [extra] +++ OK, passed 100 tests.
  16512. 958.55 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  16513. 958.55 s [extra] +++ OK, passed 100 tests.
  16514. 958.55 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  16515. 958.55 s [extra] +++ OK, passed 100 tests.
  16516. 958.55 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  16517. 958.55 s [extra] +++ OK, passed 100 tests.
  16518. 958.56 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  16519. 958.56 s [extra] +++ OK, passed 100 tests.
  16520. 958.56 s [extra] trim " hello " == "hello"
  16521. 958.56 s [extra] +++ OK, passed 100 tests.
  16522. 958.56 s [extra] trimStart " hello " == "hello "
  16523. 958.56 s [extra] +++ OK, passed 100 tests.
  16524. 958.56 s [extra] trimEnd " hello " == " hello"
  16525. 958.56 s [extra] +++ OK, passed 100 tests.
  16526. 958.56 s [extra] \s -> trim s == trimEnd (trimStart s)
  16527. 958.56 s [extra] +++ OK, passed 100 tests.
  16528. 958.56 s [extra] lower "This is A TEST" == "this is a test"
  16529. 958.56 s [extra] +++ OK, passed 100 tests.
  16530. 958.56 s [extra] lower "" == ""
  16531. 958.56 s [extra] +++ OK, passed 100 tests.
  16532. 958.56 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  16533. 958.56 s [extra] +++ OK, passed 100 tests.
  16534. 958.56 s [extra] upper "" == ""
  16535. 958.56 s [extra] +++ OK, passed 100 tests.
  16536. 958.56 s [extra] word1 "" == ("", "")
  16537. 958.56 s [extra] +++ OK, passed 100 tests.
  16538. 958.56 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  16539. 958.56 s [extra] +++ OK, passed 100 tests.
  16540. 958.56 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  16541. 958.56 s [extra] +++ OK, passed 100 tests.
  16542. 958.56 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  16543. 958.56 s [extra] +++ OK, passed 100 tests.
  16544. 958.56 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  16545. 958.56 s [extra] +++ OK, passed 100 tests.
  16546. 958.56 s [extra] line1 "" == ("", "")
  16547. 958.56 s [extra] +++ OK, passed 100 tests.
  16548. 958.56 s [extra] line1 "test" == ("test","")
  16549. 958.56 s [extra] +++ OK, passed 100 tests.
  16550. 958.56 s [extra] line1 "test\n" == ("test","")
  16551. 958.56 s [extra] +++ OK, passed 100 tests.
  16552. 958.56 s [extra] line1 "test\nrest" == ("test","rest")
  16553. 958.56 s [extra] +++ OK, passed 100 tests.
  16554. 958.56 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  16555. 958.56 s [extra] +++ OK, passed 100 tests.
  16556. 958.56 s [extra] escapeHTML "this is a test" == "this is a test"
  16557. 958.56 s [extra] +++ OK, passed 100 tests.
  16558. 958.56 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  16559. 958.56 s [extra] +++ OK, passed 100 tests.
  16560. 958.56 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  16561. 958.56 s [extra] +++ OK, passed 100 tests.
  16562. 958.56 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  16563. 958.56 s [extra] +++ OK, passed 100 tests.
  16564. 958.56 s [extra] escapeJSON "this is a test" == "this is a test"
  16565. 958.56 s [extra] +++ OK, passed 100 tests.
  16566. 958.56 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  16567. 958.56 s [extra] +++ OK, passed 100 tests.
  16568. 958.56 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  16569. 958.56 s [extra] +++ OK, passed 100 tests.
  16570. 958.56 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  16571. 958.56 s [extra] +++ OK, passed 100 tests.
  16572. 958.56 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  16573. 958.56 s [extra] +++ OK, passed 100 tests.
  16574. 958.56 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  16575. 958.57 s [extra] +++ OK, passed 100 tests.
  16576. 958.57 s [extra] maximumOn id [] == undefined
  16577. 958.57 s [extra] +++ OK, passed 100 tests.
  16578. 958.57 s [extra] maximumOn length ["test","extra","a"] == "extra"
  16579. 958.57 s [extra] +++ OK, passed 100 tests.
  16580. 958.57 s [extra] minimumOn id [] == undefined
  16581. 958.57 s [extra] +++ OK, passed 100 tests.
  16582. 958.57 s [extra] minimumOn length ["test","extra","a"] == "a"
  16583. 958.57 s [extra] +++ OK, passed 100 tests.
  16584. 958.57 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  16585. 958.57 s [extra] +++ OK, passed 100 tests.
  16586. 958.57 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  16587. 958.57 s [extra] +++ OK, passed 100 tests.
  16588. 958.57 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  16589. 958.57 s [extra] +++ OK, passed 100 tests.
  16590. 958.57 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  16591. 958.57 s [extra] +++ OK, passed 100 tests.
  16592. 958.57 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  16593. 958.57 s [extra] +++ OK, passed 100 tests.
  16594. 958.57 s [extra] sum' [1, 2, 3] == 6
  16595. 958.57 s [extra] +++ OK, passed 100 tests.
  16596. 958.57 s [extra] sumOn' read ["1", "2", "3"] == 6
  16597. 958.57 s [extra] +++ OK, passed 100 tests.
  16598. 958.57 s [extra] product' [1, 2, 4] == 8
  16599. 958.57 s [extra] +++ OK, passed 100 tests.
  16600. 958.57 s [extra] productOn' read ["1", "2", "4"] == 8
  16601. 958.57 s [extra] +++ OK, passed 100 tests.
  16602. 958.57 s [extra] merge "ace" "bd" == "abcde"
  16603. 958.57 s [extra] +++ OK, passed 100 tests.
  16604. 958.57 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  16605. 958.57 s [extra] +++ OK, passed 100 tests.
  16606. 958.57 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  16607. 958.57 s [extra] +++ OK, passed 100 tests.
  16608. 958.57 s [extra] replace "el" "e" "Hello" == "Helo"
  16609. 958.57 s [extra] +++ OK, passed 100 tests.
  16610. 958.58 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  16611. 958.58 s [extra] +++ OK, passed 100 tests.
  16612. 958.58 s [extra] replace "" "x" "" == "x"
  16613. 958.58 s [extra] +++ OK, passed 100 tests.
  16614. 958.58 s [extra] \xs ys -> replace xs xs ys == ys
  16615. 958.58 s [extra] +++ OK, passed 100 tests.
  16616. 958.58 s [extra] breakEnd isLower "youRE" == ("you","RE")
  16617. 958.58 s [extra] +++ OK, passed 100 tests.
  16618. 958.58 s [extra] breakEnd isLower "youre" == ("youre","")
  16619. 958.58 s [extra] +++ OK, passed 100 tests.
  16620. 958.58 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  16621. 958.58 s [extra] +++ OK, passed 100 tests.
  16622. 958.58 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  16623. 958.58 s [extra] +++ OK, passed 100 tests.
  16624. 958.58 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  16625. 958.58 s [extra] +++ OK, passed 100 tests.
  16626. 958.58 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  16627. 958.58 s [extra] +++ OK, passed 100 tests.
  16628. 958.58 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  16629. 958.58 s [extra] +++ OK, passed 100 tests.
  16630. 958.58 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  16631. 958.58 s [extra] +++ OK, passed 100 tests.
  16632. 958.58 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  16633. 958.58 s [extra] +++ OK, passed 100 tests.
  16634. 958.58 s [extra] \s -> wordsBy isSpace s == words s
  16635. 958.58 s [extra] +++ OK, passed 100 tests.
  16636. 958.58 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  16637. 958.58 s [extra] +++ OK, passed 100 tests.
  16638. 958.58 s [extra] \s -> linesBy (== '\n') s == lines s
  16639. 958.58 s [extra] +++ OK, passed 100 tests.
  16640. 958.58 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  16641. 958.58 s [extra] +++ OK, passed 100 tests.
  16642. 958.58 s [extra] firstJust id [Nothing,Just 3] == Just 3
  16643. 958.58 s [extra] +++ OK, passed 100 tests.
  16644. 958.58 s [extra] firstJust id [Nothing,Nothing] == Nothing
  16645. 958.58 s [extra] +++ OK, passed 100 tests.
  16646. 958.58 s [extra] drop1 "" == ""
  16647. 958.58 s [extra] +++ OK, passed 100 tests.
  16648. 958.58 s [extra] drop1 "test" == "est"
  16649. 958.58 s [extra] +++ OK, passed 100 tests.
  16650. 958.58 s [extra] \xs -> drop 1 xs == drop1 xs
  16651. 958.58 s [extra] +++ OK, passed 100 tests.
  16652. 958.58 s [extra] dropEnd1 "" == ""
  16653. 958.58 s [extra] +++ OK, passed 100 tests.
  16654. 958.58 s [extra] dropEnd1 "test" == "tes"
  16655. 958.58 s [extra] +++ OK, passed 100 tests.
  16656. 958.58 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  16657. 958.58 s [extra] +++ OK, passed 100 tests.
  16658. 958.58 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  16659. 958.58 s [extra] +++ OK, passed 100 tests.
  16660. 958.58 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  16661. 958.60 s [extra] +++ OK, passed 100 tests.
  16662. 958.60 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  16663. 958.60 s [extra] +++ OK, passed 100 tests.
  16664. 958.60 s [extra] breakOn "/" "foobar" == ("foobar", "")
  16665. 958.60 s [extra] +++ OK, passed 100 tests.
  16666. 958.60 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  16667. 958.60 s [extra] +++ OK, passed 100 tests.
  16668. 958.60 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  16669. 958.60 s [extra] +++ OK, passed 100 tests.
  16670. 958.60 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  16671. 958.60 s [extra] +++ OK, passed 100 tests.
  16672. 958.60 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  16673. 958.60 s [extra] +++ OK, passed 100 tests.
  16674. 958.60 s [extra] splitOn "x" "x" == ["",""]
  16675. 958.60 s [extra] +++ OK, passed 100 tests.
  16676. 958.60 s [extra] splitOn "x" "" == [""]
  16677. 958.60 s [extra] +++ OK, passed 100 tests.
  16678. 958.60 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  16679. 958.60 s [extra] +++ OK, passed 100 tests; 12 discarded.
  16680. 958.60 s [extra] \c x -> splitOn [c] x == split (==c) x
  16681. 958.60 s [extra] +++ OK, passed 100 tests.
  16682. 958.60 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  16683. 958.60 s [extra] +++ OK, passed 100 tests.
  16684. 958.60 s [extra] split (== 'a') "" == [""]
  16685. 958.60 s [extra] +++ OK, passed 100 tests.
  16686. 958.60 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  16687. 958.60 s [extra] +++ OK, passed 100 tests.
  16688. 958.60 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  16689. 958.60 s [extra] +++ OK, passed 100 tests.
  16690. 958.60 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  16691. 958.60 s [extra] +++ OK, passed 100 tests.
  16692. 958.60 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  16693. 958.60 s [extra] +++ OK, passed 100 tests.
  16694. 958.60 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  16695. 958.60 s [extra] +++ OK, passed 100 tests.
  16696. 958.60 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  16697. 958.60 s [extra] +++ OK, passed 100 tests.
  16698. 958.60 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  16699. 958.60 s [extra] +++ OK, passed 100 tests.
  16700. 958.60 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  16701. 958.60 s [extra] +++ OK, passed 100 tests.
  16702. 958.60 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  16703. 958.61 s [extra] +++ OK, passed 100 tests.
  16704. 958.61 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  16705. 958.61 s [extra] +++ OK, passed 100 tests.
  16706. 958.61 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  16707. 958.61 s [extra] +++ OK, passed 100 tests.
  16708. 958.61 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  16709. 958.61 s [extra] +++ OK, passed 100 tests.
  16710. 958.61 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  16711. 958.61 s [extra] +++ OK, passed 100 tests.
  16712. 958.61 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  16713. 958.61 s [extra] +++ OK, passed 100 tests.
  16714. 958.61 s [extra] stripSuffix "" "baz" == Just "baz"
  16715. 958.61 s [extra] +++ OK, passed 100 tests.
  16716. 958.61 s [extra] stripSuffix "foo" "quux" == Nothing
  16717. 958.61 s [extra] +++ OK, passed 100 tests.
  16718. 958.61 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  16719. 958.61 s [extra] +++ OK, passed 100 tests.
  16720. 958.61 s [extra] stripInfix "/" "foobar" == Nothing
  16721. 958.61 s [extra] +++ OK, passed 100 tests.
  16722. 958.61 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  16723. 958.61 s [extra] +++ OK, passed 100 tests.
  16724. 958.61 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  16725. 958.61 s [extra] +++ OK, passed 100 tests.
  16726. 958.61 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  16727. 958.61 s [extra] +++ OK, passed 100 tests.
  16728. 958.61 s [extra] chunksOf 8 "" == []
  16729. 958.61 s [extra] +++ OK, passed 100 tests.
  16730. 958.61 s [extra] chunksOf 0 "test" == undefined
  16731. 958.61 s [extra] +++ OK, passed 100 tests.
  16732. 958.61 s [extra] nubSort "this is a test" == " aehist"
  16733. 958.61 s [extra] +++ OK, passed 100 tests.
  16734. 958.61 s [extra] \xs -> nubSort xs == nub (sort xs)
  16735. 958.61 s [extra] +++ OK, passed 100 tests.
  16736. 958.61 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  16737. 958.61 s [extra] +++ OK, passed 100 tests.
  16738. 958.61 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  16739. 958.61 s [extra] +++ OK, passed 100 tests.
  16740. 958.61 s [extra] nubOrd "this is a test" == "this ae"
  16741. 958.61 s [extra] +++ OK, passed 100 tests.
  16742. 958.61 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  16743. 958.61 s [extra] +++ OK, passed 100 tests.
  16744. 958.61 s [extra] \xs -> nubOrd xs == nub xs
  16745. 958.61 s [extra] +++ OK, passed 100 tests.
  16746. 958.61 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  16747. 958.61 s [extra] +++ OK, passed 100 tests.
  16748. 958.61 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  16749. 958.61 s [extra] +++ OK, passed 100 tests.
  16750. 958.61 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  16751. 958.61 s [extra] +++ OK, passed 100 tests.
  16752. 958.61 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  16753. 958.61 s [extra] +++ OK, passed 100 tests.
  16754. 958.61 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  16755. 958.61 s [extra] +++ OK, passed 100 tests.
  16756. 958.61 s [extra] comparingLength [1,2,3] [False] == GT
  16757. 958.61 s [extra] +++ OK, passed 100 tests.
  16758. 958.61 s [extra] comparingLength [1,2] "ab" == EQ
  16759. 958.61 s [extra] +++ OK, passed 100 tests.
  16760. 958.61 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  16761. 958.61 s [extra] +++ OK, passed 100 tests.
  16762. 958.61 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  16763. 958.61 s [extra] +++ OK, passed 100 tests.
  16764. 958.61 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  16765. 958.61 s [extra] +++ OK, passed 100 tests.
  16766. 958.61 s [extra] mwhen True "test" == "test"
  16767. 958.61 s [extra] +++ OK, passed 100 tests.
  16768. 958.61 s [extra] mwhen False "test" == ""
  16769. 958.61 s [extra] +++ OK, passed 100 tests.
  16770. 958.61 s [extra] first succ (1,"test") == (2,"test")
  16771. 958.61 s [extra] +++ OK, passed 100 tests.
  16772. 958.61 s [extra] second reverse (1,"test") == (1,"tset")
  16773. 958.61 s [extra] +++ OK, passed 100 tests.
  16774. 958.61 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  16775. 958.61 s [extra] +++ OK, passed 100 tests.
  16776. 958.61 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  16777. 958.61 s [extra] +++ OK, passed 100 tests.
  16778. 958.61 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  16779. 958.61 s [extra] +++ OK, passed 100 tests.
  16780. 958.61 s [extra] (succ &&& pred) 1 == (2,0)
  16781. 958.61 s [extra] +++ OK, passed 100 tests.
  16782. 958.61 s [extra] dupe 12 == (12, 12)
  16783. 958.61 s [extra] +++ OK, passed 100 tests.
  16784. 958.61 s [extra] both succ (1,2) == (2,3)
  16785. 958.61 s [extra] +++ OK, passed 100 tests.
  16786. 958.61 s [extra] first3 succ (1,1,1) == (2,1,1)
  16787. 958.61 s [extra] +++ OK, passed 100 tests.
  16788. 958.61 s [extra] second3 succ (1,1,1) == (1,2,1)
  16789. 958.61 s [extra] +++ OK, passed 100 tests.
  16790. 958.61 s [extra] third3 succ (1,1,1) == (1,1,2)
  16791. 958.61 s [extra] +++ OK, passed 100 tests.
  16792. 958.61 s [extra] \x -> readVersion (showVersion x) == x
  16793. 958.62 s [extra] +++ OK, passed 100 tests.
  16794. 958.62 s [extra] readVersion "hello" == undefined
  16795. 958.62 s [extra] +++ OK, passed 100 tests.
  16796. 958.62 s [extra] showDP 4 pi == "3.1416"
  16797. 958.62 s [extra] +++ OK, passed 100 tests.
  16798. 958.62 s [extra] showDP 0 pi == "3"
  16799. 958.62 s [extra] +++ OK, passed 100 tests.
  16800. 958.62 s [extra] showDP 2 3 == "3.00"
  16801. 958.62 s [extra] +++ OK, passed 100 tests.
  16802. 958.62 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  16803. 958.62 s [extra] +++ OK, passed 100 tests.
  16804. 958.62 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  16805. 958.62 s [extra] +++ OK, passed 100 tests.
  16806. 958.62 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  16807. 958.62 s [extra] +++ OK, passed 100 tests.
  16808. 958.62 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  16809. 958.62 s [extra] +++ OK, passed 100 tests.
  16810. 958.62 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  16811. 958.62 s [extra] +++ OK, passed 100 tests.
  16812. 958.62 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16813. 958.62 s [extra] +++ OK, passed 100 tests.
  16814. 958.62 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16815. 958.62 s [extra] +++ OK, passed 100 tests.
  16816. 958.62 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  16817. 958.62 s [extra] +++ OK, passed 100 tests.
  16818. 958.62 s [extra] isWindows == (os == "mingw32")
  16819. 958.62 s [extra] +++ OK, passed 100 tests.
  16820. 958.62 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  16821. 958.64 s [extra] +++ OK, passed 100 tests.
  16822. 958.64 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  16823. 958.67 s [extra] +++ OK, passed 100 tests.
  16824. 958.67 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  16825. 958.69 s [extra] +++ OK, passed 100 tests.
  16826. 958.69 s [extra] captureOutput (print 1) == pure ("1\n",())
  16827. 958.69 s [extra] +++ OK, passed 100 tests.
  16828. 958.69 s [extra] withTempFile doesFileExist == pure True
  16829. 958.69 s [extra] +++ OK, passed 100 tests.
  16830. 958.69 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  16831. 958.69 s [extra] +++ OK, passed 100 tests.
  16832. 958.69 s [extra] withTempFile readFile' == pure ""
  16833. 958.69 s [extra] +++ OK, passed 100 tests.
  16834. 958.69 s [extra] withTempDir doesDirectoryExist == pure True
  16835. 958.69 s [extra] +++ OK, passed 100 tests.
  16836. 958.69 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  16837. 958.69 s [extra] +++ OK, passed 100 tests.
  16838. 958.69 s [extra] withTempDir listFiles == pure []
  16839. 958.69 s [extra] +++ OK, passed 100 tests.
  16840. 958.69 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  16841. 958.69 s [extra] +++ OK, passed 100 tests.
  16842. 958.69 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  16843. 958.69 s [extra] +++ OK, passed 100 tests.
  16844. 958.69 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  16845. 958.69 s [extra] +++ OK, passed 100 tests.
  16846. 958.69 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  16847. 958.69 s [extra] +++ OK, passed 100 tests.
  16848. 958.69 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  16849. 958.69 s [extra] +++ OK, passed 100 tests.
  16850. 958.69 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  16851. 958.69 s [extra] +++ OK, passed 100 tests.
  16852. 958.69 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  16853. 959.69 s [extra] +++ OK, passed 100 tests.
  16854. 959.69 s [extra] timeout (-3) (print 1) == pure Nothing
  16855. 959.69 s [extra] +++ OK, passed 100 tests.
  16856. 959.69 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  16857. 959.69 s [extra] +++ OK, passed 100 tests.
  16858. 959.69 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  16859. 959.79 s [extra] 0.100385732
  16860. 959.79 s [extra] +++ OK, passed 100 tests.
  16861. 959.80 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  16862. 959.90 s [extra] +++ OK, passed 100 tests.
  16863. 959.90 s [extra] showDuration 3.435 == "3.44s"
  16864. 959.90 s [extra] +++ OK, passed 100 tests.
  16865. 959.90 s [extra] showDuration 623.8 == "10m24s"
  16866. 959.90 s [extra] +++ OK, passed 100 tests.
  16867. 959.90 s [extra] showDuration 62003.8 == "17h13m"
  16868. 959.90 s [extra] +++ OK, passed 100 tests.
  16869. 959.90 s [extra] showDuration 1e8 == "27777h47m"
  16870. 959.90 s [extra] +++ OK, passed 100 tests.
  16871. 959.90 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  16872. 959.90 s [extra] +++ OK, passed 100 tests.
  16873. 959.90 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  16874. 960.90 s [extra] +++ OK, passed 100 tests.
  16875. 960.90 s [extra] Extra export
  16876. 960.90 s [extra] +++ OK, passed 100 tests.
  16877. 960.90 s [extra] withTempFile
  16878. 960.91 s [extra] ....done
  16879. 960.91 s [extra] withTempDir
  16880. 960.93 s [extra] ....done
  16881. 960.93 s [extra] retry
  16882. 960.93 s [extra] +++ OK, passed 100 tests.
  16883. 960.93 s [extra] barrier
  16884. 960.93 s [extra] Success (325 tests)
  16885. 960.96 s [extra] Test suite extra-test: PASS
  16886. 960.96 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  16887. 960.96 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  16888. 960.97 s [extra] Phase: haddockPhase
  16889. 961.26 s [extra] Preprocessing library for extra-1.8.1...
  16890. 961.26 s [extra] Running Haddock on library for extra-1.8.1...
  16891. 962.43 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  16892. 962.46 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  16893. 962.60 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  16894. 962.60 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  16895. 962.60 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  16896. 962.63 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  16897. 962.63 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  16898. 962.90 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  16899. 962.90 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  16900. 963.00 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  16901. 963.01 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  16902. 963.06 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  16903. 963.13 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  16904. 963.14 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  16905. 963.18 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  16906. 963.21 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  16907. 963.21 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  16908. 963.39 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  16909. 963.40 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  16910. 963.41 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  16911. 963.46 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  16912. 963.55 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  16913. 963.56 s [extra] Haddock coverage:
  16914. 963.56 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  16915. 963.56 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  16916. 963.57 s [extra] Warning: 'Arrow' is out of scope.
  16917. 963.57 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16918. 963.57 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  16919. 963.57 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  16920. 963.57 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  16921. 963.57 s [extra] Warning: '(:)' is out of scope.
  16922. 963.57 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16923. 963.57 s [extra] Warning: 'unzip' is ambiguous. It is defined
  16924. 963.57 s [extra] * in ‘GHC.Internal.Data.Functor’
  16925. 963.57 s [extra] * in ‘GHC.Internal.List’
  16926. 963.57 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16927. 963.57 s [extra] by specifying the type/value namespace explicitly.
  16928. 963.57 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  16929. 963.58 s [extra] Warning: 'firstJustM' is out of scope.
  16930. 963.58 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16931. 963.59 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  16932. 963.59 s [extra] Warning: 'Version' is ambiguous. It is defined
  16933. 963.59 s [extra] * in ‘GHC.Internal.Data.Version’
  16934. 963.59 s [extra] * in ‘GHC.Internal.Data.Version’
  16935. 963.59 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16936. 963.59 s [extra] by specifying the type/value namespace explicitly.
  16937. 963.59 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  16938. 963.59 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  16939. 963.59 s [extra] Warning: 'length' is ambiguous. It is defined
  16940. 963.59 s [extra] * in ‘Data.List.NonEmpty’
  16941. 963.59 s [extra] * in ‘GHC.Internal.Data.Foldable’
  16942. 963.59 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16943. 963.59 s [extra] by specifying the type/value namespace explicitly.
  16944. 963.59 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Foldable’
  16945. 963.59 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  16946. 963.60 s [extra] Warning: 'fromJust' is out of scope.
  16947. 963.60 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16948. 963.60 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  16949. 963.60 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  16950. 963.60 s [extra] * in ‘GHC.Internal.Exception’
  16951. 963.60 s [extra] * in ‘GHC.Internal.Exception’
  16952. 963.60 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16953. 963.60 s [extra] by specifying the type/value namespace explicitly.
  16954. 963.60 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  16955. 963.60 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  16956. 963.60 s [extra] * in ‘GHC.Internal.IO.Exception’
  16957. 963.60 s [extra] * in ‘GHC.Internal.IO.Exception’
  16958. 963.60 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16959. 963.60 s [extra] by specifying the type/value namespace explicitly.
  16960. 963.60 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  16961. 963.60 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  16962. 963.60 s [extra] * in ‘GHC.Internal.Exception.Type’
  16963. 963.60 s [extra] * in ‘GHC.Internal.Exception.Type’
  16964. 963.60 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16965. 963.60 s [extra] by specifying the type/value namespace explicitly.
  16966. 963.60 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  16967. 963.60 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  16968. 963.60 s [extra] Warning: 'partition' is out of scope.
  16969. 963.61 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16970. 963.61 s [extra] Warning: 'mconcatMap' is out of scope.
  16971. 963.61 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16972. 963.61 s [extra] Warning: 'find' is out of scope.
  16973. 963.61 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16974. 963.61 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  16975. 963.61 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  16976. 963.61 s [extra] Missing documentation for:
  16977. 963.61 s [extra] Module header
  16978. 963.61 s [extra] Warning: 'Lock' is ambiguous. It is defined
  16979. 963.61 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  16980. 963.61 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  16981. 963.61 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16982. 963.61 s [extra] by specifying the type/value namespace explicitly.
  16983. 963.61 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  16984. 963.61 s [extra] Warning: 'Var' is ambiguous. It is defined
  16985. 963.61 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  16986. 963.61 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  16987. 963.61 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16988. 963.61 s [extra] by specifying the type/value namespace explicitly.
  16989. 963.61 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  16990. 963.61 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  16991. 963.61 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  16992. 963.61 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  16993. 963.61 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16994. 963.61 s [extra] by specifying the type/value namespace explicitly.
  16995. 963.61 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  16996. 963.62 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  16997. 963.62 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  16998. 963.62 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  16999. 963.62 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  17000. 963.62 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  17001. 963.62 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  17002. 963.62 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  17003. 963.63 s [extra] 100% (270 /270) in 'Extra'
  17004. 963.63 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  17005. 970.52 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  17006. 970.65 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  17007. 970.69 s [extra] Phase: installPhase
  17008. 970.84 s [extra] Installing library in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  17009. 971.49 s [extra] Phase: fixupPhase
  17010. 971.52 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
  17011. 971.54 s [extra] shrinking /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSextra-1.8.1-6dBP7svJ0dU8qAqNvDulTp-ghc9.10.3.so
  17012. 971.54 s [extra] checking for references to /build/ in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1...
  17013. 971.59 s [extra] patching script interpreter paths in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1
  17014. 971.60 s [extra] stripping (with command strip and flags -S -p) in /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1/lib
  17015. 971.72 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
  17016. 971.75 s [extra] checking for references to /build/ in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc...
  17017. 971.79 s [extra] patching script interpreter paths in /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
  17018. 971.97 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
  17019. 972.61 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  17020. 972.64 s [post-build-hook] Uploading to the NixCI cache: /nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1 /nix/store/xl87s3zj8l5q6nqj44y3sjia0lh1xk1n-extra-1.8.1-doc
  17021. 972.71 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17022. 972.85 s [post-build-hook] copying 1 paths...
  17023. 972.85 s [post-build-hook] copying path '/nix/store/3fij2i6yj9mimssh8rvq82af9aj1g4d9-extra-1.8.1' to 'https://cache.nix-ci.com'...
  17024. 974.78 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17025. 974.97 s [post-build-hook] copying 0 paths...
  17026. 975.01 s Progress: 13 of 19 built, 193 of 193 downloaded from cache
  17027. 975.08 s Building algebraic-graphs
  17028. 975.20 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  17029. 975.20 s [algebraic-graphs] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  17030. 975.46 s [algebraic-graphs] Phase: unpackPhase
  17031. 975.47 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  17032. 975.48 s [algebraic-graphs] source root is algebraic-graphs-0.7
  17033. 975.49 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  17034. 975.50 s [algebraic-graphs] Phase: patchPhase
  17035. 975.50 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  17036. 975.51 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  17037. 975.51 s [algebraic-graphs] patching file algebraic-graphs.cabal
  17038. 975.52 s [algebraic-graphs] Phase: compileBuildDriverPhase
  17039. 975.52 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.X3u7kzHKZh/setup-package.conf.d -threaded
  17040. 975.59 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.X3u7kzHKZh/Main.o )
  17041. 975.66 s [algebraic-graphs] [2 of 2] Linking Setup
  17042. 977.54 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  17043. 977.56 s [algebraic-graphs] Phase: configurePhase
  17044. 977.56 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.X3u7kzHKZh/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  17045. 977.57 s [algebraic-graphs] Using Parsec parser
  17046. 977.57 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  17047. 978.19 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  17048. 978.19 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.2.0
  17049. 978.19 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  17050. 978.19 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  17051. 978.19 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  17052. 978.19 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  17053. 978.19 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  17054. 978.19 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  17055. 978.19 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.2.0
  17056. 978.19 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  17057. 978.19 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  17058. 978.19 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  17059. 978.19 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  17060. 978.19 s [algebraic-graphs] inspection-testing-0.6.2
  17061. 978.19 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  17062. 978.19 s [algebraic-graphs] Source component graph:
  17063. 978.19 s [algebraic-graphs] component lib
  17064. 978.19 s [algebraic-graphs] component test:main dependency lib
  17065. 978.19 s [algebraic-graphs] Configured component graph:
  17066. 978.19 s [algebraic-graphs] component algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17067. 978.19 s [algebraic-graphs] include array-0.5.8.0-78a1
  17068. 978.19 s [algebraic-graphs] include base-4.20.2.0-acb8
  17069. 978.19 s [algebraic-graphs] include containers-0.7-a3f6
  17070. 978.19 s [algebraic-graphs] include deepseq-1.5.0.0-7e72
  17071. 978.19 s [algebraic-graphs] include transformers-0.6.1.1-74e0
  17072. 978.19 s [algebraic-graphs] component algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
  17073. 978.19 s [algebraic-graphs] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  17074. 978.19 s [algebraic-graphs] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17075. 978.19 s [algebraic-graphs] include array-0.5.8.0-78a1
  17076. 978.19 s [algebraic-graphs] include base-4.20.2.0-acb8
  17077. 978.19 s [algebraic-graphs] include containers-0.7-a3f6
  17078. 978.19 s [algebraic-graphs] include deepseq-1.5.0.0-7e72
  17079. 978.19 s [algebraic-graphs] include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  17080. 978.19 s [algebraic-graphs] include inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
  17081. 978.19 s [algebraic-graphs] include transformers-0.6.1.1-74e0
  17082. 978.19 s [algebraic-graphs] Linked component graph:
  17083. 978.19 s [algebraic-graphs] unit algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17084. 978.19 s [algebraic-graphs] include array-0.5.8.0-78a1
  17085. 978.19 s [algebraic-graphs] include base-4.20.2.0-acb8
  17086. 978.19 s [algebraic-graphs] include containers-0.7-a3f6
  17087. 978.19 s [algebraic-graphs] include deepseq-1.5.0.0-7e72
  17088. 978.19 s [algebraic-graphs] include transformers-0.6.1.1-74e0
  17089. 978.19 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW:Data.Graph.Typed
  17090. 978.19 s [algebraic-graphs] unit algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
  17091. 978.19 s [algebraic-graphs] include QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  17092. 978.19 s [algebraic-graphs] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17093. 978.19 s [algebraic-graphs] include array-0.5.8.0-78a1
  17094. 978.19 s [algebraic-graphs] include base-4.20.2.0-acb8
  17095. 978.19 s [algebraic-graphs] include containers-0.7-a3f6
  17096. 978.19 s [algebraic-graphs] include deepseq-1.5.0.0-7e72
  17097. 978.19 s [algebraic-graphs] include extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  17098. 978.19 s [algebraic-graphs] include inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
  17099. 978.19 s [algebraic-graphs] include transformers-0.6.1.1-74e0
  17100. 978.19 s [algebraic-graphs] Ready component graph:
  17101. 978.19 s [algebraic-graphs] definite algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17102. 978.19 s [algebraic-graphs] depends array-0.5.8.0-78a1
  17103. 978.19 s [algebraic-graphs] depends base-4.20.2.0-acb8
  17104. 978.19 s [algebraic-graphs] depends containers-0.7-a3f6
  17105. 978.19 s [algebraic-graphs] depends deepseq-1.5.0.0-7e72
  17106. 978.19 s [algebraic-graphs] depends transformers-0.6.1.1-74e0
  17107. 978.19 s [algebraic-graphs] definite algebraic-graphs-0.7-HpZp3e1XogHtfWLbBhV75-main
  17108. 978.19 s [algebraic-graphs] depends QuickCheck-2.15.0.1-5qqrNw9iI8fH7J9EyrDE
  17109. 978.19 s [algebraic-graphs] depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17110. 978.19 s [algebraic-graphs] depends array-0.5.8.0-78a1
  17111. 978.19 s [algebraic-graphs] depends base-4.20.2.0-acb8
  17112. 978.19 s [algebraic-graphs] depends containers-0.7-a3f6
  17113. 978.19 s [algebraic-graphs] depends deepseq-1.5.0.0-7e72
  17114. 978.19 s [algebraic-graphs] depends extra-1.8.1-6dBP7svJ0dU8qAqNvDulTp
  17115. 978.19 s [algebraic-graphs] depends inspection-testing-0.6.2-3gcuTx3N9ZQ9Hfgft9cZtB
  17116. 978.19 s [algebraic-graphs] depends transformers-0.6.1.1-74e0
  17117. 978.19 s [algebraic-graphs] Using Cabal-3.12.1.0 compiled by ghc-9.10
  17118. 978.19 s [algebraic-graphs] Using compiler: ghc-9.10.3
  17119. 978.19 s [algebraic-graphs] Using install prefix:
  17120. 978.19 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
  17121. 978.19 s [algebraic-graphs] Executables installed in:
  17122. 978.19 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/bin
  17123. 978.19 s [algebraic-graphs] Libraries installed in:
  17124. 978.19 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  17125. 978.19 s [algebraic-graphs] Dynamic Libraries installed in:
  17126. 978.19 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  17127. 978.19 s [algebraic-graphs] Private executables installed in:
  17128. 978.19 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7
  17129. 978.19 s [algebraic-graphs] Data files installed in:
  17130. 978.20 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7
  17131. 978.20 s [algebraic-graphs] Documentation installed in:
  17132. 978.20 s [algebraic-graphs] /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  17133. 978.20 s [algebraic-graphs] Configuration files installed in:
  17134. 978.20 s [algebraic-graphs] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/etc
  17135. 978.20 s [algebraic-graphs] No alex found
  17136. 978.20 s [algebraic-graphs] Using ar found on system at:
  17137. 978.20 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  17138. 978.20 s [algebraic-graphs] No c2hs found
  17139. 978.20 s [algebraic-graphs] No cpphs found
  17140. 978.20 s [algebraic-graphs] No doctest found
  17141. 978.20 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  17142. 978.20 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  17143. 978.20 s [algebraic-graphs] Using ghc version 9.10.3 found on system at:
  17144. 978.20 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  17145. 978.20 s [algebraic-graphs] Using ghc-pkg version 9.10.3 found on system at:
  17146. 978.20 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  17147. 978.20 s [algebraic-graphs] No ghcjs found
  17148. 978.20 s [algebraic-graphs] No ghcjs-pkg found
  17149. 978.20 s [algebraic-graphs] No greencard found
  17150. 978.20 s [algebraic-graphs] Using haddock version 2.31.1 found on system at:
  17151. 978.20 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  17152. 978.20 s [algebraic-graphs] No happy found
  17153. 978.20 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  17154. 978.20 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17155. 978.20 s [algebraic-graphs] No hmake found
  17156. 978.20 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  17157. 978.20 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  17158. 978.20 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  17159. 978.20 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  17160. 978.20 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  17161. 978.20 s [algebraic-graphs] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  17162. 978.20 s [algebraic-graphs] No jhc found
  17163. 978.20 s [algebraic-graphs] Using ld found on system at:
  17164. 978.20 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  17165. 978.20 s [algebraic-graphs] No pkg-config found
  17166. 978.20 s [algebraic-graphs] Using runghc version 9.10.3 found on system at:
  17167. 978.20 s [algebraic-graphs] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  17168. 978.20 s [algebraic-graphs] Using strip version 2.44 found on system at:
  17169. 978.20 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  17170. 978.20 s [algebraic-graphs] Using tar found on system at:
  17171. 978.20 s [algebraic-graphs] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  17172. 978.20 s [algebraic-graphs] No uhc found
  17173. 978.37 s [algebraic-graphs] Phase: buildPhase
  17174. 978.42 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  17175. 978.43 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  17176. 978.57 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o )
  17177. 979.56 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
  17178. 980.32 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
  17179. 980.66 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o )
  17180. 980.74 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  17181. 981.92 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o )
  17182. 982.18 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
  17183. 982.97 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
  17184. 983.77 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o )
  17185. 983.77 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
  17186. 983.77 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
  17187. 983.77 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  17188. 983.77 s [algebraic-graphs] In the use of ‘head’
  17189. 983.77 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17190. 983.77 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17191. 983.77 s [algebraic-graphs] |
  17192. 983.78 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  17193. 983.78 s [algebraic-graphs] | ^^^^
  17194. 983.78 s [algebraic-graphs]
  17195. 983.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  17196. 983.78 s [algebraic-graphs] In the use of ‘tail’
  17197. 983.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17198. 983.78 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17199. 983.78 s [algebraic-graphs] |
  17200. 983.78 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  17201. 983.78 s [algebraic-graphs] | ^^^^
  17202. 983.78 s [algebraic-graphs]
  17203. 983.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  17204. 983.78 s [algebraic-graphs] In the use of ‘head’
  17205. 983.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17206. 983.78 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17207. 983.78 s [algebraic-graphs] |
  17208. 983.78 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  17209. 983.78 s [algebraic-graphs] | ^^^^
  17210. 983.78 s [algebraic-graphs]
  17211. 983.78 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  17212. 983.78 s [algebraic-graphs] In the use of ‘tail’
  17213. 983.78 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17214. 983.78 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17215. 983.78 s [algebraic-graphs] |
  17216. 983.78 s [algebraic-graphs] 397 | bnd' = tail bnd
  17217. 983.78 s [algebraic-graphs] | ^^^^
  17218. 983.78 s [algebraic-graphs]
  17219. 983.78 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
  17220. 983.78 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
  17221. 983.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17222. 983.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17223. 983.78 s [algebraic-graphs] will become an error in a future GHC release.
  17224. 983.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17225. 983.78 s [algebraic-graphs] |
  17226. 983.78 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  17227. 983.78 s [algebraic-graphs] | ^
  17228. 983.78 s [algebraic-graphs]
  17229. 983.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17230. 983.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17231. 983.78 s [algebraic-graphs] will become an error in a future GHC release.
  17232. 983.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17233. 983.78 s [algebraic-graphs] |
  17234. 983.78 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17235. 983.78 s [algebraic-graphs] | ^
  17236. 983.78 s [algebraic-graphs]
  17237. 983.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17238. 983.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17239. 983.78 s [algebraic-graphs] will become an error in a future GHC release.
  17240. 983.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17241. 983.78 s [algebraic-graphs] |
  17242. 983.78 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17243. 983.78 s [algebraic-graphs] | ^
  17244. 983.78 s [algebraic-graphs]
  17245. 983.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17246. 983.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17247. 983.78 s [algebraic-graphs] will become an error in a future GHC release.
  17248. 983.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17249. 983.78 s [algebraic-graphs] |
  17250. 983.78 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17251. 983.78 s [algebraic-graphs] | ^
  17252. 983.78 s [algebraic-graphs]
  17253. 983.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17254. 983.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17255. 983.78 s [algebraic-graphs] will become an error in a future GHC release.
  17256. 983.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17257. 983.78 s [algebraic-graphs] |
  17258. 983.78 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17259. 983.78 s [algebraic-graphs] | ^
  17260. 983.78 s [algebraic-graphs]
  17261. 983.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17262. 983.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17263. 983.78 s [algebraic-graphs] will become an error in a future GHC release.
  17264. 983.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17265. 983.78 s [algebraic-graphs] |
  17266. 983.78 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17267. 983.78 s [algebraic-graphs] | ^
  17268. 983.78 s [algebraic-graphs]
  17269. 983.78 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17270. 983.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17271. 983.78 s [algebraic-graphs] will become an error in a future GHC release.
  17272. 983.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17273. 983.78 s [algebraic-graphs] |
  17274. 983.78 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17275. 983.78 s [algebraic-graphs] | ^
  17276. 983.78 s [algebraic-graphs]
  17277. 983.78 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o )
  17278. 983.78 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o )
  17279. 984.16 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o )
  17280. 984.18 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
  17281. 984.18 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o )
  17282. 984.74 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
  17283. 984.89 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
  17284. 985.12 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o )
  17285. 985.12 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17286. 985.12 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17287. 985.12 s [algebraic-graphs] will become an error in a future GHC release.
  17288. 985.12 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17289. 985.12 s [algebraic-graphs] |
  17290. 985.12 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  17291. 985.12 s [algebraic-graphs] | ^
  17292. 985.12 s [algebraic-graphs]
  17293. 985.12 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o )
  17294. 985.12 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17295. 985.12 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17296. 985.12 s [algebraic-graphs] will become an error in a future GHC release.
  17297. 985.12 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17298. 985.12 s [algebraic-graphs] |
  17299. 985.12 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  17300. 985.12 s [algebraic-graphs] | ^
  17301. 985.12 s [algebraic-graphs]
  17302. 985.12 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17303. 985.12 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17304. 985.12 s [algebraic-graphs] will become an error in a future GHC release.
  17305. 985.12 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17306. 985.12 s [algebraic-graphs] |
  17307. 985.12 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  17308. 985.12 s [algebraic-graphs] | ^
  17309. 985.12 s [algebraic-graphs]
  17310. 985.12 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o )
  17311. 985.12 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o )
  17312. 985.12 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o )
  17313. 985.12 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o )
  17314. 985.12 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o )
  17315. 985.12 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o )
  17316. 985.13 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
  17317. 985.56 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  17318. 986.97 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  17319. 987.91 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
  17320. 988.39 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  17321. 988.39 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  17322. 990.21 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
  17323. 990.73 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
  17324. 991.44 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
  17325. 992.41 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  17326. 992.41 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
  17327. 992.44 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
  17328. 992.44 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  17329. 992.44 s [algebraic-graphs] In the use of ‘head’
  17330. 992.44 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17331. 992.44 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17332. 992.44 s [algebraic-graphs] |
  17333. 992.44 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  17334. 992.44 s [algebraic-graphs] | ^^^^
  17335. 992.44 s [algebraic-graphs]
  17336. 992.44 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  17337. 992.44 s [algebraic-graphs] In the use of ‘tail’
  17338. 992.44 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17339. 992.44 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17340. 992.44 s [algebraic-graphs] |
  17341. 992.44 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  17342. 992.44 s [algebraic-graphs] | ^^^^
  17343. 992.44 s [algebraic-graphs]
  17344. 992.44 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  17345. 992.44 s [algebraic-graphs] In the use of ‘head’
  17346. 992.44 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17347. 992.44 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17348. 992.44 s [algebraic-graphs] |
  17349. 992.44 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  17350. 992.44 s [algebraic-graphs] | ^^^^
  17351. 992.44 s [algebraic-graphs]
  17352. 992.44 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  17353. 992.44 s [algebraic-graphs] In the use of ‘tail’
  17354. 992.44 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  17355. 992.44 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17356. 992.44 s [algebraic-graphs] |
  17357. 992.44 s [algebraic-graphs] 397 | bnd' = tail bnd
  17358. 992.44 s [algebraic-graphs] | ^^^^
  17359. 992.44 s [algebraic-graphs]
  17360. 992.44 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
  17361. 992.44 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  17362. 992.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17363. 992.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17364. 992.44 s [algebraic-graphs] will become an error in a future GHC release.
  17365. 992.44 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17366. 992.44 s [algebraic-graphs] |
  17367. 992.44 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  17368. 992.44 s [algebraic-graphs] | ^
  17369. 992.44 s [algebraic-graphs]
  17370. 992.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17371. 992.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17372. 992.45 s [algebraic-graphs] will become an error in a future GHC release.
  17373. 992.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17374. 992.45 s [algebraic-graphs] |
  17375. 992.45 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17376. 992.45 s [algebraic-graphs] | ^
  17377. 992.45 s [algebraic-graphs]
  17378. 992.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17379. 992.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17380. 992.45 s [algebraic-graphs] will become an error in a future GHC release.
  17381. 992.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17382. 992.45 s [algebraic-graphs] |
  17383. 992.45 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  17384. 992.45 s [algebraic-graphs] | ^
  17385. 992.45 s [algebraic-graphs]
  17386. 992.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17387. 992.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17388. 992.45 s [algebraic-graphs] will become an error in a future GHC release.
  17389. 992.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17390. 992.45 s [algebraic-graphs] |
  17391. 992.45 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17392. 992.45 s [algebraic-graphs] | ^
  17393. 992.45 s [algebraic-graphs]
  17394. 992.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17395. 992.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17396. 992.45 s [algebraic-graphs] will become an error in a future GHC release.
  17397. 992.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17398. 992.45 s [algebraic-graphs] |
  17399. 992.45 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  17400. 992.45 s [algebraic-graphs] | ^
  17401. 992.45 s [algebraic-graphs]
  17402. 992.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17403. 992.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17404. 992.45 s [algebraic-graphs] will become an error in a future GHC release.
  17405. 992.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17406. 992.45 s [algebraic-graphs] |
  17407. 992.45 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17408. 992.45 s [algebraic-graphs] | ^
  17409. 992.45 s [algebraic-graphs]
  17410. 992.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17411. 992.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17412. 992.45 s [algebraic-graphs] will become an error in a future GHC release.
  17413. 992.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17414. 992.45 s [algebraic-graphs] |
  17415. 992.45 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  17416. 992.45 s [algebraic-graphs] | ^
  17417. 992.45 s [algebraic-graphs]
  17418. 992.45 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  17419. 992.83 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
  17420. 993.48 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  17421. 993.48 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
  17422. 993.48 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  17423. 994.03 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.p_o )
  17424. 994.41 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.p_o )
  17425. 994.60 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  17426. 994.60 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17427. 994.60 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17428. 994.60 s [algebraic-graphs] will become an error in a future GHC release.
  17429. 994.60 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17430. 994.60 s [algebraic-graphs] |
  17431. 994.60 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  17432. 994.60 s [algebraic-graphs] | ^
  17433. 994.60 s [algebraic-graphs]
  17434. 994.60 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
  17435. 994.61 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17436. 994.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17437. 994.61 s [algebraic-graphs] will become an error in a future GHC release.
  17438. 994.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17439. 994.61 s [algebraic-graphs] |
  17440. 994.61 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  17441. 994.61 s [algebraic-graphs] | ^
  17442. 994.61 s [algebraic-graphs]
  17443. 994.61 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  17444. 994.61 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  17445. 994.61 s [algebraic-graphs] will become an error in a future GHC release.
  17446. 994.61 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  17447. 994.61 s [algebraic-graphs] |
  17448. 994.61 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  17449. 994.61 s [algebraic-graphs] | ^
  17450. 994.61 s [algebraic-graphs]
  17451. 994.61 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  17452. 994.61 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  17453. 994.61 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
  17454. 994.71 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
  17455. 994.73 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
  17456. 994.76 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
  17457. 994.78 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  17458. 996.75 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  17459. 996.77 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  17460. 997.04 s [algebraic-graphs] [ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o )
  17461. 999.35 s [algebraic-graphs] [ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, dist/build/main/main-tmp/Algebra/Graph/Test/API.o, dist/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o )
  17462. 1003.64 s [algebraic-graphs] [ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, dist/build/main/main-tmp/Algebra/Graph/Test.o, dist/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
  17463. 1003.64 s [algebraic-graphs] [ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
  17464. 1003.88 s [algebraic-graphs] [ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
  17465. 1006.52 s [algebraic-graphs] [ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
  17466. 1006.57 s [algebraic-graphs] [ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Export.o, dist/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o )
  17467. 1006.57 s [algebraic-graphs] [ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.o, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o )
  17468. 1013.52 s [algebraic-graphs] [ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o )
  17469. 1014.02 s [algebraic-graphs] [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
  17470. 1014.02 s [algebraic-graphs] [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
  17471. 1015.15 s [algebraic-graphs] [12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.o, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o )
  17472. 1015.15 s [algebraic-graphs] [13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Label.o, dist/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o )
  17473. 1015.15 s [algebraic-graphs] [14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o )
  17474. 1016.33 s [algebraic-graphs] [15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o )
  17475. 1016.33 s [algebraic-graphs] [16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
  17476. 1016.33 s [algebraic-graphs] [17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
  17477. 1016.33 s [algebraic-graphs] [18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
  17478. 1016.33 s [algebraic-graphs] [19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
  17479. 1016.33 s [algebraic-graphs] [20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o )
  17480. 1016.33 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  17481. 1016.33 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  17482. 1016.33 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  17483. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  17484. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  17485. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  17486. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  17487. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  17488. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  17489. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  17490. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  17491. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  17492. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  17493. 1016.34 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  17494. 1016.35 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  17495. 1016.35 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  17496. 1016.35 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  17497. 1016.35 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  17498. 1016.35 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  17499. 1016.35 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  17500. 1016.35 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  17501. 1016.35 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  17502. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  17503. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17504. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  17505. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17506. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  17507. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  17508. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  17509. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  17510. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  17511. 1016.36 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  17512. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  17513. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  17514. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  17515. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  17516. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  17517. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17518. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  17519. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  17520. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17521. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  17522. 1016.37 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  17523. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  17524. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  17525. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  17526. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  17527. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  17528. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  17529. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  17530. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  17531. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  17532. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  17533. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  17534. 1016.38 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  17535. 1016.39 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  17536. 1016.39 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  17537. 1016.39 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  17538. 1016.39 s [algebraic-graphs] inspection testing successful
  17539. 1016.39 s [algebraic-graphs] expected successes: 58
  17540. 1016.39 s [algebraic-graphs] [21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o )
  17541. 1016.39 s [algebraic-graphs] [22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, dist/build/main/main-tmp/Data/Graph/Test/Typed.o, dist/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o )
  17542. 1016.39 s [algebraic-graphs] [23 of 23] Compiling Main ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
  17543. 1018.05 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  17544. 1020.01 s [algebraic-graphs] buildPhase completed in 42 seconds
  17545. 1020.01 s [algebraic-graphs] Phase: checkPhase
  17546. 1020.81 s [algebraic-graphs] Running 1 test suites...
  17547. 1020.81 s [algebraic-graphs] Test suite main: RUNNING...
  17548. 1044.12 s [algebraic-graphs]
  17549. 1044.12 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  17550. 1044.16 s [algebraic-graphs] OK: show empty == "empty"
  17551. 1044.16 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  17552. 1044.16 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  17553. 1044.16 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  17554. 1044.16 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  17555. 1044.16 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  17556. 1044.16 s [algebraic-graphs]
  17557. 1044.16 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  17558. 1044.16 s [algebraic-graphs] OK: fromAcyclic empty == empty
  17559. 1044.16 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  17560. 1044.16 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  17561. 1044.17 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  17562. 1044.17 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  17563. 1044.17 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  17564. 1044.17 s [algebraic-graphs]
  17565. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  17566. 1044.17 s [algebraic-graphs] OK: isEmpty empty == True
  17567. 1044.17 s [algebraic-graphs] OK: hasVertex x empty == False
  17568. 1044.17 s [algebraic-graphs] OK: vertexCount empty == 0
  17569. 1044.17 s [algebraic-graphs] OK: edgeCount empty == 0
  17570. 1044.17 s [algebraic-graphs]
  17571. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  17572. 1044.17 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17573. 1044.17 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17574. 1044.17 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17575. 1044.17 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17576. 1044.17 s [algebraic-graphs]
  17577. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  17578. 1044.17 s [algebraic-graphs] OK: vertices [] == empty
  17579. 1044.17 s [algebraic-graphs] OK: vertices [x] == vertex x
  17580. 1044.17 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17581. 1044.17 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17582. 1044.17 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17583. 1044.17 s [algebraic-graphs]
  17584. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  17585. 1044.17 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  17586. 1044.17 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  17587. 1044.17 s [algebraic-graphs]
  17588. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  17589. 1044.17 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  17590. 1044.17 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  17591. 1044.17 s [algebraic-graphs]
  17592. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  17593. 1044.17 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17594. 1044.17 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17595. 1044.17 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17596. 1044.17 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  17597. 1044.17 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17598. 1044.17 s [algebraic-graphs]
  17599. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  17600. 1044.17 s [algebraic-graphs] OK: isEmpty empty == True
  17601. 1044.17 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17602. 1044.17 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17603. 1044.17 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  17604. 1044.17 s [algebraic-graphs]
  17605. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  17606. 1044.17 s [algebraic-graphs] OK: hasVertex x empty == False
  17607. 1044.17 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17608. 1044.17 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17609. 1044.17 s [algebraic-graphs]
  17610. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  17611. 1044.17 s [algebraic-graphs] OK: hasEdge x y empty == False
  17612. 1044.17 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17613. 1044.17 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  17614. 1044.17 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17615. 1044.17 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17616. 1044.17 s [algebraic-graphs]
  17617. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  17618. 1044.17 s [algebraic-graphs] OK: vertexCount empty == 0
  17619. 1044.17 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17620. 1044.17 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17621. 1044.17 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17622. 1044.17 s [algebraic-graphs]
  17623. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  17624. 1044.17 s [algebraic-graphs] OK: edgeCount empty == 0
  17625. 1044.17 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17626. 1044.17 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  17627. 1044.17 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17628. 1044.17 s [algebraic-graphs]
  17629. 1044.17 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  17630. 1044.17 s [algebraic-graphs] OK: vertexList empty == []
  17631. 1044.17 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17632. 1044.17 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17633. 1044.17 s [algebraic-graphs]
  17634. 1044.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  17635. 1044.18 s [algebraic-graphs] OK: edgeList empty == []
  17636. 1044.18 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17637. 1044.18 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  17638. 1044.18 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17639. 1044.18 s [algebraic-graphs]
  17640. 1044.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  17641. 1044.18 s [algebraic-graphs] OK: adjacencyList empty == []
  17642. 1044.18 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17643. 1044.18 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  17644. 1044.18 s [algebraic-graphs]
  17645. 1044.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  17646. 1044.18 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17647. 1044.18 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17648. 1044.18 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17649. 1044.18 s [algebraic-graphs]
  17650. 1044.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  17651. 1044.18 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17652. 1044.18 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17653. 1044.18 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  17654. 1044.18 s [algebraic-graphs]
  17655. 1044.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  17656. 1044.18 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17657. 1044.18 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17658. 1044.18 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  17659. 1044.18 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  17660. 1044.18 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  17661. 1044.18 s [algebraic-graphs]
  17662. 1044.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  17663. 1044.18 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17664. 1044.18 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17665. 1044.18 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  17666. 1044.18 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  17667. 1044.18 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  17668. 1044.18 s [algebraic-graphs]
  17669. 1044.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  17670. 1044.18 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17671. 1044.18 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17672. 1044.18 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  17673. 1044.18 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17674. 1044.18 s [algebraic-graphs]
  17675. 1044.18 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  17676. 1044.18 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  17677. 1044.18 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17678. 1044.18 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17679. 1044.18 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  17680. 1044.19 s [algebraic-graphs]
  17681. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  17682. 1044.19 s [algebraic-graphs] OK: transpose empty == empty
  17683. 1044.19 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17684. 1044.19 s [algebraic-graphs] OK: transpose . transpose == id
  17685. 1044.19 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17686. 1044.19 s [algebraic-graphs]
  17687. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  17688. 1044.19 s [algebraic-graphs] OK: induce (const True ) x == x
  17689. 1044.19 s [algebraic-graphs] OK: induce (const False) x == empty
  17690. 1044.19 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17691. 1044.19 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17692. 1044.19 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17693. 1044.19 s [algebraic-graphs]
  17694. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  17695. 1044.19 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17696. 1044.19 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  17697. 1044.19 s [algebraic-graphs]
  17698. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  17699. 1044.19 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  17700. 1044.19 s [algebraic-graphs]
  17701. 1044.19 s [algebraic-graphs] OK: box x y ~~ box y x
  17702. 1044.19 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17703. 1044.19 s [algebraic-graphs] OK: box x empty ~~ empty
  17704. 1044.19 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17705. 1044.19 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17706. 1044.19 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17707. 1044.19 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17708. 1044.19 s [algebraic-graphs]
  17709. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  17710. 1044.19 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17711. 1044.19 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17712. 1044.19 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  17713. 1044.19 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17714. 1044.19 s [algebraic-graphs]
  17715. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  17716. 1044.19 s [algebraic-graphs] OK: topSort empty == []
  17717. 1044.19 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  17718. 1044.19 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  17719. 1044.19 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  17720. 1044.19 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  17721. 1044.19 s [algebraic-graphs]
  17722. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  17723. 1044.19 s [algebraic-graphs] OK: scc empty == empty
  17724. 1044.19 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  17725. 1044.19 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  17726. 1044.19 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  17727. 1044.19 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  17728. 1044.19 s [algebraic-graphs]
  17729. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  17730. 1044.19 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  17731. 1044.19 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  17732. 1044.19 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  17733. 1044.19 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  17734. 1044.19 s [algebraic-graphs]
  17735. 1044.19 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  17736. 1044.19 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  17737. 1044.19 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  17738. 1044.19 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  17739. 1044.19 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  17740. 1044.19 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  17741. 1044.19 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  17742. 1055.23 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  17743. 1055.24 s [algebraic-graphs]
  17744. 1055.24 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  17745. 1055.27 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  17746. 1055.27 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  17747. 1055.28 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  17748. 1055.28 s [algebraic-graphs]
  17749. 1055.28 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  17750. 1055.28 s [algebraic-graphs] OK: Arbitrary
  17751. 1055.28 s [algebraic-graphs] OK: empty
  17752. 1055.28 s [algebraic-graphs] OK: vertex
  17753. 1055.28 s [algebraic-graphs] OK: vertices
  17754. 1055.28 s [algebraic-graphs] OK: union
  17755. 1055.28 s [algebraic-graphs] OK: join
  17756. 1055.28 s [algebraic-graphs] OK: transpose
  17757. 1055.28 s [algebraic-graphs] OK: box
  17758. 1055.28 s [algebraic-graphs] OK: transitiveClosure
  17759. 1055.28 s [algebraic-graphs] OK: scc
  17760. 1055.28 s [algebraic-graphs] OK: toAcyclic
  17761. 1055.28 s [algebraic-graphs] OK: toAcyclicOrd
  17762. 1055.28 s [algebraic-graphs]
  17763. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap ============
  17764. 1055.28 s [algebraic-graphs] OK: Axioms of graphs
  17765. 1055.28 s [algebraic-graphs]
  17766. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  17767. 1055.28 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  17768. 1055.28 s [algebraic-graphs]
  17769. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  17770. 1055.28 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17771. 1055.28 s [algebraic-graphs]
  17772. 1055.28 s [algebraic-graphs] OK: consistent empty == True
  17773. 1055.28 s [algebraic-graphs] OK: consistent (vertex x) == True
  17774. 1055.28 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17775. 1055.28 s [algebraic-graphs] OK: consistent (connect x y) == True
  17776. 1055.28 s [algebraic-graphs] OK: consistent (edge x y) == True
  17777. 1055.28 s [algebraic-graphs] OK: consistent (edges xs) == True
  17778. 1055.28 s [algebraic-graphs] OK: consistent (stars xs) == True
  17779. 1055.28 s [algebraic-graphs]
  17780. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  17781. 1055.28 s [algebraic-graphs] OK: show (empty ) == "empty"
  17782. 1055.28 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17783. 1055.28 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17784. 1055.28 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17785. 1055.28 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17786. 1055.28 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17787. 1055.28 s [algebraic-graphs]
  17788. 1055.28 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17789. 1055.28 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17790. 1055.28 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17791. 1055.28 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17792. 1055.28 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17793. 1055.28 s [algebraic-graphs]
  17794. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  17795. 1055.28 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17796. 1055.28 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17797. 1055.28 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17798. 1055.28 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17799. 1055.28 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17800. 1055.28 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17801. 1055.28 s [algebraic-graphs] OK: x <= x + y
  17802. 1055.28 s [algebraic-graphs] OK: x + y <= x * y
  17803. 1055.28 s [algebraic-graphs]
  17804. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  17805. 1055.28 s [algebraic-graphs] OK: isEmpty empty == True
  17806. 1055.28 s [algebraic-graphs] OK: hasVertex x empty == False
  17807. 1055.28 s [algebraic-graphs] OK: vertexCount empty == 0
  17808. 1055.28 s [algebraic-graphs] OK: edgeCount empty == 0
  17809. 1055.28 s [algebraic-graphs]
  17810. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  17811. 1055.28 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17812. 1055.28 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17813. 1055.28 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17814. 1055.28 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17815. 1055.28 s [algebraic-graphs]
  17816. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  17817. 1055.28 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17818. 1055.28 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17819. 1055.28 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17820. 1055.28 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17821. 1055.28 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17822. 1055.28 s [algebraic-graphs]
  17823. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  17824. 1055.28 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17825. 1055.28 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17826. 1055.28 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17827. 1055.28 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17828. 1055.28 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17829. 1055.28 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17830. 1055.28 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17831. 1055.28 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17832. 1055.28 s [algebraic-graphs]
  17833. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  17834. 1055.28 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17835. 1055.28 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17836. 1055.28 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17837. 1055.28 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17838. 1055.28 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17839. 1055.28 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17840. 1055.28 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17841. 1055.28 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17842. 1055.28 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17843. 1055.28 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17844. 1055.28 s [algebraic-graphs]
  17845. 1055.28 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  17846. 1055.28 s [algebraic-graphs] OK: vertices [] == empty
  17847. 1055.28 s [algebraic-graphs] OK: vertices [x] == vertex x
  17848. 1055.29 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17849. 1055.29 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17850. 1055.29 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17851. 1055.29 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17852. 1055.29 s [algebraic-graphs]
  17853. 1055.29 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  17854. 1055.29 s [algebraic-graphs] OK: edges [] == empty
  17855. 1055.29 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17856. 1055.29 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17857. 1055.29 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17858. 1055.29 s [algebraic-graphs]
  17859. 1055.29 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  17860. 1055.29 s [algebraic-graphs] OK: overlays [] == empty
  17861. 1055.29 s [algebraic-graphs] OK: overlays [x] == x
  17862. 1055.29 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17863. 1055.29 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17864. 1055.29 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17865. 1055.29 s [algebraic-graphs]
  17866. 1055.29 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  17867. 1055.29 s [algebraic-graphs] OK: connects [] == empty
  17868. 1055.29 s [algebraic-graphs] OK: connects [x] == x
  17869. 1055.29 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17870. 1055.29 s [algebraic-graphs] OK: connects == foldr connect empty
  17871. 1055.29 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17872. 1055.29 s [algebraic-graphs]
  17873. 1055.29 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  17874. 1055.29 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  17875. 1055.29 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  17876. 1055.29 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  17877. 1055.29 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  17878. 1055.29 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  17879. 1055.29 s [algebraic-graphs]
  17880. 1055.29 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  17881. 1055.29 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17882. 1055.29 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17883. 1055.29 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17884. 1055.29 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17885. 1055.29 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17886. 1055.29 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17887. 1055.29 s [algebraic-graphs]
  17888. 1055.29 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  17889. 1055.29 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17890. 1055.29 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17891. 1055.29 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17892. 1055.29 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17893. 1055.29 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17894. 1055.29 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17895. 1055.29 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17896. 1055.29 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17897. 1055.29 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17898. 1055.29 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17899. 1055.29 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17900. 1055.29 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17901. 1055.29 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17902. 1055.29 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17903. 1055.29 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17904. 1055.29 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17905. 1055.29 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17906. 1055.29 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17907. 1055.29 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17908. 1055.29 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17909. 1055.29 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17910. 1055.29 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17911. 1055.29 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17912. 1055.29 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17913. 1055.29 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17914. 1055.29 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17915. 1055.29 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17916. 1055.29 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17917. 1055.29 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17918. 1055.30 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17919. 1055.30 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17920. 1055.30 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17921. 1055.30 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17922. 1055.30 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17923. 1056.55 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17924. 1056.55 s [algebraic-graphs]
  17925. 1056.55 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  17926. 1056.55 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17927. 1056.55 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17928. 1056.55 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17929. 1056.55 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17930. 1056.55 s [algebraic-graphs]
  17931. 1056.55 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  17932. 1056.55 s [algebraic-graphs] OK: isEmpty empty == True
  17933. 1056.55 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17934. 1056.55 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17935. 1056.55 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17936. 1056.55 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17937. 1056.55 s [algebraic-graphs]
  17938. 1056.55 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  17939. 1056.55 s [algebraic-graphs] OK: hasVertex x empty == False
  17940. 1056.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17941. 1056.55 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17942. 1056.55 s [algebraic-graphs]
  17943. 1056.55 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  17944. 1056.55 s [algebraic-graphs] OK: hasEdge x y empty == False
  17945. 1056.55 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17946. 1056.55 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17947. 1056.55 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17948. 1056.55 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17949. 1056.55 s [algebraic-graphs]
  17950. 1056.55 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  17951. 1056.55 s [algebraic-graphs] OK: vertexCount empty == 0
  17952. 1056.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17953. 1056.55 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17954. 1056.55 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17955. 1056.55 s [algebraic-graphs]
  17956. 1056.55 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  17957. 1056.55 s [algebraic-graphs] OK: edgeCount empty == 0
  17958. 1056.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17959. 1056.55 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17960. 1056.55 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17961. 1056.55 s [algebraic-graphs]
  17962. 1056.55 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  17963. 1056.55 s [algebraic-graphs] OK: vertexList empty == []
  17964. 1056.55 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17965. 1056.55 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17966. 1056.56 s [algebraic-graphs]
  17967. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  17968. 1056.56 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17969. 1056.56 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17970. 1056.56 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17971. 1056.56 s [algebraic-graphs]
  17972. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  17973. 1056.56 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17974. 1056.56 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17975. 1056.56 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17976. 1056.56 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17977. 1056.56 s [algebraic-graphs]
  17978. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  17979. 1056.56 s [algebraic-graphs] OK: edgeList empty == []
  17980. 1056.56 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17981. 1056.56 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17982. 1056.56 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17983. 1056.56 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17984. 1056.56 s [algebraic-graphs]
  17985. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  17986. 1056.56 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17987. 1056.56 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17988. 1056.56 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17989. 1056.56 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17990. 1056.56 s [algebraic-graphs]
  17991. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  17992. 1056.56 s [algebraic-graphs] OK: adjacencyList empty == []
  17993. 1056.56 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17994. 1056.56 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17995. 1056.56 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17996. 1056.56 s [algebraic-graphs]
  17997. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  17998. 1056.56 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17999. 1056.56 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18000. 1056.56 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18001. 1056.56 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18002. 1056.56 s [algebraic-graphs]
  18003. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  18004. 1056.56 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18005. 1056.56 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18006. 1056.56 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18007. 1056.56 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18008. 1056.56 s [algebraic-graphs]
  18009. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  18010. 1056.56 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18011. 1056.56 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18012. 1056.56 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18013. 1056.56 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18014. 1056.56 s [algebraic-graphs]
  18015. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  18016. 1056.56 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18017. 1056.56 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18018. 1056.56 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18019. 1056.56 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18020. 1056.56 s [algebraic-graphs]
  18021. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  18022. 1056.56 s [algebraic-graphs] OK: path [] == empty
  18023. 1056.56 s [algebraic-graphs] OK: path [x] == vertex x
  18024. 1056.56 s [algebraic-graphs] OK: path [x,y] == edge x y
  18025. 1056.56 s [algebraic-graphs]
  18026. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  18027. 1056.56 s [algebraic-graphs] OK: circuit [] == empty
  18028. 1056.56 s [algebraic-graphs] OK: circuit [x] == edge x x
  18029. 1056.56 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18030. 1056.56 s [algebraic-graphs]
  18031. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  18032. 1056.56 s [algebraic-graphs] OK: clique [] == empty
  18033. 1056.56 s [algebraic-graphs] OK: clique [x] == vertex x
  18034. 1056.56 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18035. 1056.56 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18036. 1056.56 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18037. 1056.56 s [algebraic-graphs]
  18038. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  18039. 1056.56 s [algebraic-graphs] OK: biclique [] [] == empty
  18040. 1056.56 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18041. 1056.56 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18042. 1056.56 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18043. 1056.56 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18044. 1056.56 s [algebraic-graphs]
  18045. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  18046. 1056.56 s [algebraic-graphs] OK: star x [] == vertex x
  18047. 1056.56 s [algebraic-graphs] OK: star x [y] == edge x y
  18048. 1056.56 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18049. 1056.56 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18050. 1056.56 s [algebraic-graphs]
  18051. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  18052. 1056.56 s [algebraic-graphs] OK: stars [] == empty
  18053. 1056.56 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18054. 1056.56 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18055. 1056.56 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18056. 1056.56 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18057. 1056.56 s [algebraic-graphs] OK: stars . adjacencyList == id
  18058. 1056.56 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18059. 1056.56 s [algebraic-graphs]
  18060. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  18061. 1056.56 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18062. 1056.56 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18063. 1056.56 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18064. 1056.56 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18065. 1056.56 s [algebraic-graphs]
  18066. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  18067. 1056.56 s [algebraic-graphs] OK: forest [] == empty
  18068. 1056.56 s [algebraic-graphs] OK: forest [x] == tree x
  18069. 1056.56 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18070. 1056.56 s [algebraic-graphs] OK: forest == overlays . map tree
  18071. 1056.56 s [algebraic-graphs]
  18072. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  18073. 1056.56 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18074. 1056.56 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18075. 1056.56 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18076. 1056.56 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18077. 1056.56 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18078. 1056.56 s [algebraic-graphs]
  18079. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  18080. 1056.56 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18081. 1056.56 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18082. 1056.56 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18083. 1056.56 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18084. 1056.56 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18085. 1056.56 s [algebraic-graphs]
  18086. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  18087. 1056.56 s [algebraic-graphs] OK: replaceVertex x x == id
  18088. 1056.56 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18089. 1056.56 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18090. 1056.56 s [algebraic-graphs]
  18091. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  18092. 1056.56 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18093. 1056.56 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18094. 1056.56 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18095. 1056.56 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18096. 1056.56 s [algebraic-graphs]
  18097. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  18098. 1056.56 s [algebraic-graphs] OK: transpose empty == empty
  18099. 1056.56 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18100. 1056.56 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18101. 1056.56 s [algebraic-graphs] OK: transpose . transpose == id
  18102. 1056.56 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18103. 1056.56 s [algebraic-graphs]
  18104. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  18105. 1056.56 s [algebraic-graphs] OK: gmap f empty == empty
  18106. 1056.56 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18107. 1056.56 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18108. 1056.56 s [algebraic-graphs] OK: gmap id == id
  18109. 1056.56 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18110. 1056.56 s [algebraic-graphs]
  18111. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  18112. 1056.56 s [algebraic-graphs] OK: induce (const True ) x == x
  18113. 1056.56 s [algebraic-graphs] OK: induce (const False) x == empty
  18114. 1056.56 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18115. 1056.56 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18116. 1056.56 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18117. 1056.56 s [algebraic-graphs]
  18118. 1056.56 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  18119. 1056.56 s [algebraic-graphs] OK: compose empty x == empty
  18120. 1056.56 s [algebraic-graphs] OK: compose x empty == empty
  18121. 1056.57 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18122. 1056.57 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18123. 1056.57 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18124. 1056.57 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18125. 1056.86 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18126. 1056.86 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18127. 1056.86 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18128. 1056.86 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18129. 1056.86 s [algebraic-graphs]
  18130. 1056.86 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  18131. 1056.86 s [algebraic-graphs] OK: closure empty == empty
  18132. 1056.86 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18133. 1056.86 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18134. 1056.86 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18135. 1056.86 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  18136. 1056.86 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18137. 1056.86 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18138. 1056.86 s [algebraic-graphs] OK: closure . closure == closure
  18139. 1056.86 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18140. 1056.86 s [algebraic-graphs]
  18141. 1056.86 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  18142. 1056.86 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18143. 1056.86 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18144. 1056.86 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18145. 1056.86 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18146. 1056.86 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18147. 1056.86 s [algebraic-graphs]
  18148. 1056.86 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  18149. 1056.86 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18150. 1056.86 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18151. 1056.86 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  18152. 1056.86 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18153. 1056.86 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18154. 1056.86 s [algebraic-graphs]
  18155. 1056.86 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  18156. 1056.86 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18157. 1056.86 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18158. 1056.86 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18159. 1056.86 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  18160. 1056.86 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18161. 1056.86 s [algebraic-graphs]
  18162. 1056.86 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  18163. 1056.86 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  18164. 1056.86 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  18165. 1056.86 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  18166. 1056.86 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  18167. 1056.86 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  18168. 1056.86 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  18169. 1056.86 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  18170. 1056.86 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  18171. 1056.86 s [algebraic-graphs] OK: bfsForest x [] == []
  18172. 1056.86 s [algebraic-graphs] OK: bfsForest empty vs == []
  18173. 1056.86 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18174. 1056.86 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  18175. 1056.86 s [algebraic-graphs]
  18176. 1056.86 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  18177. 1056.86 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  18178. 1056.86 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  18179. 1056.86 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  18180. 1056.86 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  18181. 1056.86 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  18182. 1056.86 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  18183. 1056.86 s [algebraic-graphs] OK: bfs empty vs == []
  18184. 1056.86 s [algebraic-graphs] OK: bfs x [] == []
  18185. 1056.86 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  18186. 1056.86 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  18187. 1056.86 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  18188. 1056.86 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  18189. 1056.86 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  18190. 1056.86 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  18191. 1056.86 s [algebraic-graphs]
  18192. 1056.86 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  18193. 1056.86 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  18194. 1056.86 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  18195. 1056.86 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  18196. 1056.86 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  18197. 1056.86 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  18198. 1056.86 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  18199. 1056.86 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  18200. 1056.86 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  18201. 1056.86 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  18202. 1056.86 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  18203. 1056.86 s [algebraic-graphs]
  18204. 1056.86 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  18205. 1056.87 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  18206. 1056.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  18207. 1056.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  18208. 1056.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  18209. 1056.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  18210. 1056.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  18211. 1056.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  18212. 1056.87 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  18213. 1056.87 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  18214. 1056.87 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  18215. 1056.87 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  18216. 1056.87 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18217. 1056.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  18218. 1056.87 s [algebraic-graphs]
  18219. 1056.87 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  18220. 1056.87 s [algebraic-graphs] OK: dfs empty vs == []
  18221. 1056.87 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  18222. 1056.87 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  18223. 1056.87 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  18224. 1056.87 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  18225. 1056.87 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  18226. 1056.87 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  18227. 1056.87 s [algebraic-graphs] OK: dfs x [] == []
  18228. 1056.87 s [algebraic-graphs]
  18229. 1056.87 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  18230. 1056.87 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  18231. 1056.87 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  18232. 1056.87 s [algebraic-graphs]
  18233. 1056.87 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  18234. 1056.87 s [algebraic-graphs] OK: reachable empty x == []
  18235. 1056.87 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  18236. 1056.87 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  18237. 1056.87 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  18238. 1056.87 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  18239. 1056.87 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  18240. 1056.87 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  18241. 1056.87 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  18242. 1056.87 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  18243. 1056.87 s [algebraic-graphs]
  18244. 1056.87 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  18245. 1056.87 s [algebraic-graphs]
  18246. 1056.87 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  18247. 1056.87 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  18248. 1056.87 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  18249. 1056.87 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  18250. 1056.87 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  18251. 1056.87 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  18252. 1056.87 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  18253. 1056.87 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  18254. 1056.87 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  18255. 1056.87 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  18256. 1056.87 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  18257. 1056.87 s [algebraic-graphs]
  18258. 1056.87 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  18259. 1056.87 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  18260. 1056.87 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  18261. 1056.87 s [algebraic-graphs] OK: isAcyclic . circuit == null
  18262. 1056.87 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  18263. 1056.87 s [algebraic-graphs]
  18264. 1056.87 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  18265. 1056.87 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  18266. 1056.87 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  18267. 1056.87 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  18268. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  18269. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  18270. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  18271. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  18272. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  18273. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  18274. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  18275. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  18276. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  18277. 1056.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  18278. 1069.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  18279. 1069.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  18280. 1069.63 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  18281. 1069.63 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  18282. 1069.63 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  18283. 1069.63 s [algebraic-graphs]
  18284. 1069.63 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  18285. 1069.63 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  18286. 1069.63 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  18287. 1069.63 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  18288. 1069.63 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  18289. 1069.63 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  18290. 1069.63 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18291. 1069.63 s [algebraic-graphs]
  18292. 1069.63 s [algebraic-graphs] ============ AdjacencyMap ============
  18293. 1069.63 s [algebraic-graphs] OK: Axioms of graphs
  18294. 1069.63 s [algebraic-graphs]
  18295. 1069.63 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  18296. 1069.63 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  18297. 1069.63 s [algebraic-graphs]
  18298. 1069.63 s [algebraic-graphs] OK: consistent empty == True
  18299. 1069.63 s [algebraic-graphs] OK: consistent (vertex x) == True
  18300. 1069.63 s [algebraic-graphs] OK: consistent (overlay x y) == True
  18301. 1069.63 s [algebraic-graphs] OK: consistent (connect x y) == True
  18302. 1069.63 s [algebraic-graphs] OK: consistent (edge x y) == True
  18303. 1069.63 s [algebraic-graphs] OK: consistent (edges xs) == True
  18304. 1069.63 s [algebraic-graphs] OK: consistent (stars xs) == True
  18305. 1069.63 s [algebraic-graphs]
  18306. 1069.63 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  18307. 1069.63 s [algebraic-graphs] OK: show (empty ) == "empty"
  18308. 1069.63 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  18309. 1069.63 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  18310. 1069.63 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  18311. 1069.63 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  18312. 1069.63 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  18313. 1069.63 s [algebraic-graphs]
  18314. 1069.63 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  18315. 1069.63 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  18316. 1069.64 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  18317. 1069.64 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  18318. 1069.64 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  18319. 1069.64 s [algebraic-graphs]
  18320. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  18321. 1069.64 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18322. 1069.64 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18323. 1069.64 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18324. 1069.64 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18325. 1069.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18326. 1069.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18327. 1069.64 s [algebraic-graphs] OK: x <= x + y
  18328. 1069.64 s [algebraic-graphs] OK: x + y <= x * y
  18329. 1069.64 s [algebraic-graphs]
  18330. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  18331. 1069.64 s [algebraic-graphs] OK: isEmpty empty == True
  18332. 1069.64 s [algebraic-graphs] OK: hasVertex x empty == False
  18333. 1069.64 s [algebraic-graphs] OK: vertexCount empty == 0
  18334. 1069.64 s [algebraic-graphs] OK: edgeCount empty == 0
  18335. 1069.64 s [algebraic-graphs]
  18336. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  18337. 1069.64 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18338. 1069.64 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18339. 1069.64 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18340. 1069.64 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18341. 1069.64 s [algebraic-graphs]
  18342. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  18343. 1069.64 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18344. 1069.64 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18345. 1069.64 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18346. 1069.64 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18347. 1069.64 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18348. 1069.64 s [algebraic-graphs]
  18349. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  18350. 1069.64 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18351. 1069.64 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18352. 1069.64 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18353. 1069.64 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18354. 1069.64 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18355. 1069.64 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18356. 1069.64 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18357. 1069.64 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18358. 1069.64 s [algebraic-graphs]
  18359. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  18360. 1069.64 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18361. 1069.64 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18362. 1069.64 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18363. 1069.64 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18364. 1069.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18365. 1069.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18366. 1069.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18367. 1069.64 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18368. 1069.64 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18369. 1069.64 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18370. 1069.64 s [algebraic-graphs]
  18371. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  18372. 1069.64 s [algebraic-graphs] OK: vertices [] == empty
  18373. 1069.64 s [algebraic-graphs] OK: vertices [x] == vertex x
  18374. 1069.64 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18375. 1069.64 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18376. 1069.64 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18377. 1069.64 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18378. 1069.64 s [algebraic-graphs]
  18379. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  18380. 1069.64 s [algebraic-graphs] OK: edges [] == empty
  18381. 1069.64 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18382. 1069.64 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18383. 1069.64 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18384. 1069.64 s [algebraic-graphs]
  18385. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  18386. 1069.64 s [algebraic-graphs] OK: overlays [] == empty
  18387. 1069.64 s [algebraic-graphs] OK: overlays [x] == x
  18388. 1069.64 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18389. 1069.64 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18390. 1069.64 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18391. 1069.64 s [algebraic-graphs]
  18392. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  18393. 1069.64 s [algebraic-graphs] OK: connects [] == empty
  18394. 1069.64 s [algebraic-graphs] OK: connects [x] == x
  18395. 1069.64 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18396. 1069.64 s [algebraic-graphs] OK: connects == foldr connect empty
  18397. 1069.64 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18398. 1069.64 s [algebraic-graphs]
  18399. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  18400. 1069.64 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  18401. 1069.64 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  18402. 1069.64 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  18403. 1069.64 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  18404. 1069.64 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  18405. 1069.64 s [algebraic-graphs]
  18406. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  18407. 1069.64 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18408. 1069.64 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18409. 1069.64 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18410. 1069.64 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18411. 1069.64 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18412. 1069.64 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18413. 1069.64 s [algebraic-graphs]
  18414. 1069.64 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  18415. 1069.64 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18416. 1069.64 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18417. 1069.64 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18418. 1069.64 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18419. 1069.64 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18420. 1069.64 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18421. 1069.64 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18422. 1069.64 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18423. 1069.64 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18424. 1069.64 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18425. 1069.64 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18426. 1069.64 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18427. 1069.64 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18428. 1069.64 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18429. 1069.64 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18430. 1069.64 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18431. 1069.64 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18432. 1069.64 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18433. 1069.64 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18434. 1069.64 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18435. 1069.64 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18436. 1069.64 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18437. 1069.64 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18438. 1069.64 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18439. 1069.64 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18440. 1069.64 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18441. 1069.64 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18442. 1069.64 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18443. 1069.64 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18444. 1069.64 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18445. 1069.64 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18446. 1069.64 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18447. 1069.64 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18448. 1072.50 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18449. 1072.50 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18450. 1072.50 s [algebraic-graphs]
  18451. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  18452. 1072.50 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18453. 1072.50 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18454. 1072.50 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18455. 1072.50 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18456. 1072.50 s [algebraic-graphs]
  18457. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  18458. 1072.50 s [algebraic-graphs] OK: isEmpty empty == True
  18459. 1072.50 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18460. 1072.50 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18461. 1072.50 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18462. 1072.50 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18463. 1072.50 s [algebraic-graphs]
  18464. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  18465. 1072.50 s [algebraic-graphs] OK: hasVertex x empty == False
  18466. 1072.50 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18467. 1072.50 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18468. 1072.50 s [algebraic-graphs]
  18469. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  18470. 1072.50 s [algebraic-graphs] OK: hasEdge x y empty == False
  18471. 1072.50 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18472. 1072.50 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18473. 1072.50 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18474. 1072.50 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18475. 1072.50 s [algebraic-graphs]
  18476. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  18477. 1072.50 s [algebraic-graphs] OK: vertexCount empty == 0
  18478. 1072.50 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18479. 1072.50 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18480. 1072.50 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18481. 1072.50 s [algebraic-graphs]
  18482. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  18483. 1072.50 s [algebraic-graphs] OK: edgeCount empty == 0
  18484. 1072.50 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18485. 1072.50 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18486. 1072.50 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18487. 1072.50 s [algebraic-graphs]
  18488. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  18489. 1072.50 s [algebraic-graphs] OK: vertexList empty == []
  18490. 1072.50 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18491. 1072.50 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18492. 1072.50 s [algebraic-graphs]
  18493. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  18494. 1072.50 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18495. 1072.50 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18496. 1072.50 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18497. 1072.50 s [algebraic-graphs]
  18498. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  18499. 1072.50 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18500. 1072.50 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18501. 1072.50 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18502. 1072.50 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18503. 1072.50 s [algebraic-graphs]
  18504. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  18505. 1072.50 s [algebraic-graphs] OK: edgeList empty == []
  18506. 1072.50 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18507. 1072.50 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18508. 1072.50 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18509. 1072.50 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18510. 1072.50 s [algebraic-graphs]
  18511. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  18512. 1072.50 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18513. 1072.50 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18514. 1072.50 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18515. 1072.50 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18516. 1072.50 s [algebraic-graphs]
  18517. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  18518. 1072.50 s [algebraic-graphs] OK: adjacencyList empty == []
  18519. 1072.50 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18520. 1072.50 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18521. 1072.50 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18522. 1072.50 s [algebraic-graphs]
  18523. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  18524. 1072.50 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18525. 1072.50 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18526. 1072.50 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18527. 1072.50 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18528. 1072.50 s [algebraic-graphs]
  18529. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  18530. 1072.50 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18531. 1072.50 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18532. 1072.50 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18533. 1072.50 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18534. 1072.50 s [algebraic-graphs]
  18535. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  18536. 1072.50 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18537. 1072.50 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18538. 1072.50 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18539. 1072.50 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18540. 1072.50 s [algebraic-graphs]
  18541. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  18542. 1072.50 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18543. 1072.50 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18544. 1072.50 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18545. 1072.50 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18546. 1072.50 s [algebraic-graphs]
  18547. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.path ============
  18548. 1072.50 s [algebraic-graphs] OK: path [] == empty
  18549. 1072.50 s [algebraic-graphs] OK: path [x] == vertex x
  18550. 1072.50 s [algebraic-graphs] OK: path [x,y] == edge x y
  18551. 1072.50 s [algebraic-graphs]
  18552. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  18553. 1072.50 s [algebraic-graphs] OK: circuit [] == empty
  18554. 1072.50 s [algebraic-graphs] OK: circuit [x] == edge x x
  18555. 1072.50 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18556. 1072.50 s [algebraic-graphs]
  18557. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  18558. 1072.50 s [algebraic-graphs] OK: clique [] == empty
  18559. 1072.50 s [algebraic-graphs] OK: clique [x] == vertex x
  18560. 1072.50 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18561. 1072.50 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18562. 1072.50 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18563. 1072.50 s [algebraic-graphs]
  18564. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  18565. 1072.50 s [algebraic-graphs] OK: biclique [] [] == empty
  18566. 1072.50 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18567. 1072.50 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18568. 1072.50 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18569. 1072.50 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18570. 1072.50 s [algebraic-graphs]
  18571. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.star ============
  18572. 1072.50 s [algebraic-graphs] OK: star x [] == vertex x
  18573. 1072.50 s [algebraic-graphs] OK: star x [y] == edge x y
  18574. 1072.50 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18575. 1072.50 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18576. 1072.50 s [algebraic-graphs]
  18577. 1072.50 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  18578. 1072.50 s [algebraic-graphs] OK: stars [] == empty
  18579. 1072.50 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18580. 1072.50 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18581. 1072.50 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18582. 1072.50 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18583. 1072.51 s [algebraic-graphs] OK: stars . adjacencyList == id
  18584. 1072.51 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18585. 1072.51 s [algebraic-graphs]
  18586. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  18587. 1072.51 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18588. 1072.51 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18589. 1072.51 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18590. 1072.51 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18591. 1072.51 s [algebraic-graphs]
  18592. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  18593. 1072.51 s [algebraic-graphs] OK: forest [] == empty
  18594. 1072.51 s [algebraic-graphs] OK: forest [x] == tree x
  18595. 1072.51 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18596. 1072.51 s [algebraic-graphs] OK: forest == overlays . map tree
  18597. 1072.51 s [algebraic-graphs]
  18598. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  18599. 1072.51 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18600. 1072.51 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18601. 1072.51 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18602. 1072.51 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18603. 1072.51 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18604. 1072.51 s [algebraic-graphs]
  18605. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  18606. 1072.51 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18607. 1072.51 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18608. 1072.51 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18609. 1072.51 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18610. 1072.51 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18611. 1072.51 s [algebraic-graphs]
  18612. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  18613. 1072.51 s [algebraic-graphs] OK: replaceVertex x x == id
  18614. 1072.51 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18615. 1072.51 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18616. 1072.51 s [algebraic-graphs]
  18617. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  18618. 1072.51 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18619. 1072.51 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18620. 1072.51 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18621. 1072.51 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18622. 1072.51 s [algebraic-graphs]
  18623. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  18624. 1072.51 s [algebraic-graphs] OK: transpose empty == empty
  18625. 1072.51 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18626. 1072.51 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18627. 1072.51 s [algebraic-graphs] OK: transpose . transpose == id
  18628. 1072.51 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18629. 1072.51 s [algebraic-graphs]
  18630. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  18631. 1072.51 s [algebraic-graphs] OK: gmap f empty == empty
  18632. 1072.51 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18633. 1072.51 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18634. 1072.51 s [algebraic-graphs] OK: gmap id == id
  18635. 1072.51 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18636. 1072.51 s [algebraic-graphs]
  18637. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  18638. 1072.51 s [algebraic-graphs] OK: induce (const True ) x == x
  18639. 1072.51 s [algebraic-graphs] OK: induce (const False) x == empty
  18640. 1072.51 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18641. 1072.51 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18642. 1072.51 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18643. 1072.51 s [algebraic-graphs]
  18644. 1072.51 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  18645. 1072.51 s [algebraic-graphs] OK: compose empty x == empty
  18646. 1072.51 s [algebraic-graphs] OK: compose x empty == empty
  18647. 1072.51 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18648. 1072.51 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18649. 1072.51 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18650. 1072.51 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18651. 1078.61 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18652. 1078.61 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18653. 1078.64 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18654. 1078.64 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18655. 1078.64 s [algebraic-graphs]
  18656. 1078.64 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  18657. 1078.64 s [algebraic-graphs] OK: closure empty == empty
  18658. 1078.64 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18659. 1078.65 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18660. 1078.65 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18661. 1078.65 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  18662. 1078.65 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18663. 1078.65 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18664. 1078.65 s [algebraic-graphs] OK: closure . closure == closure
  18665. 1078.65 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18666. 1078.65 s [algebraic-graphs]
  18667. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  18668. 1078.65 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18669. 1078.65 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18670. 1078.65 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18671. 1078.65 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18672. 1078.65 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18673. 1078.65 s [algebraic-graphs]
  18674. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  18675. 1078.65 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18676. 1078.65 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18677. 1078.65 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  18678. 1078.65 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18679. 1078.65 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18680. 1078.65 s [algebraic-graphs]
  18681. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  18682. 1078.65 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18683. 1078.65 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18684. 1078.65 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18685. 1078.65 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  18686. 1078.65 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18687. 1078.65 s [algebraic-graphs]
  18688. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.box ============
  18689. 1078.65 s [algebraic-graphs] OK: box x y ~~ box y x
  18690. 1078.65 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18691. 1078.65 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18692. 1078.65 s [algebraic-graphs] OK: box x empty ~~ empty
  18693. 1078.65 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18694. 1078.65 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18695. 1078.65 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18696. 1078.65 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18697. 1078.65 s [algebraic-graphs]
  18698. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  18699. 1078.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  18700. 1078.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  18701. 1078.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  18702. 1078.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  18703. 1078.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  18704. 1078.65 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  18705. 1078.65 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  18706. 1078.65 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  18707. 1078.65 s [algebraic-graphs] OK: bfsForest x [] == []
  18708. 1078.65 s [algebraic-graphs] OK: bfsForest empty vs == []
  18709. 1078.65 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18710. 1078.65 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  18711. 1078.65 s [algebraic-graphs]
  18712. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  18713. 1078.65 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  18714. 1078.65 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  18715. 1078.65 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  18716. 1078.65 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  18717. 1078.65 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  18718. 1078.65 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  18719. 1078.65 s [algebraic-graphs] OK: bfs empty vs == []
  18720. 1078.65 s [algebraic-graphs] OK: bfs x [] == []
  18721. 1078.65 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  18722. 1078.65 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  18723. 1078.65 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  18724. 1078.65 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  18725. 1078.65 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  18726. 1078.65 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  18727. 1078.65 s [algebraic-graphs]
  18728. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  18729. 1078.65 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  18730. 1078.65 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  18731. 1078.65 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  18732. 1078.65 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  18733. 1078.65 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  18734. 1078.65 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  18735. 1078.65 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  18736. 1078.65 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  18737. 1078.65 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  18738. 1078.65 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  18739. 1078.65 s [algebraic-graphs]
  18740. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  18741. 1078.65 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  18742. 1078.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  18743. 1078.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  18744. 1078.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  18745. 1078.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  18746. 1078.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  18747. 1078.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  18748. 1078.65 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  18749. 1078.65 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  18750. 1078.65 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  18751. 1078.65 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  18752. 1078.65 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18753. 1078.65 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  18754. 1078.65 s [algebraic-graphs]
  18755. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18756. 1078.65 s [algebraic-graphs] OK: dfs empty vs == []
  18757. 1078.65 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  18758. 1078.65 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  18759. 1078.65 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  18760. 1078.65 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  18761. 1078.65 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  18762. 1078.65 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  18763. 1078.65 s [algebraic-graphs] OK: dfs x [] == []
  18764. 1078.65 s [algebraic-graphs]
  18765. 1078.65 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  18766. 1078.65 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  18767. 1078.65 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  18768. 1078.65 s [algebraic-graphs]
  18769. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18770. 1078.65 s [algebraic-graphs] OK: reachable empty x == []
  18771. 1078.65 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  18772. 1078.65 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  18773. 1078.65 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  18774. 1078.65 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  18775. 1078.65 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  18776. 1078.65 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  18777. 1078.65 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  18778. 1078.65 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  18779. 1078.65 s [algebraic-graphs]
  18780. 1078.65 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  18781. 1078.65 s [algebraic-graphs]
  18782. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  18783. 1078.65 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  18784. 1078.65 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  18785. 1078.65 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  18786. 1078.65 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  18787. 1078.65 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  18788. 1078.65 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  18789. 1078.65 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  18790. 1078.65 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  18791. 1078.65 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  18792. 1078.65 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  18793. 1078.65 s [algebraic-graphs]
  18794. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  18795. 1078.65 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  18796. 1078.65 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  18797. 1078.65 s [algebraic-graphs] OK: isAcyclic . circuit == null
  18798. 1078.65 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  18799. 1078.65 s [algebraic-graphs]
  18800. 1078.65 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  18801. 1078.65 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  18802. 1078.65 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  18803. 1078.65 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  18804. 1078.65 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  18805. 1078.65 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  18806. 1078.65 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  18807. 1078.65 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  18808. 1094.06 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  18809. 1094.06 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  18810. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  18811. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  18812. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  18813. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  18814. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  18815. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  18816. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  18817. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  18818. 1094.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  18819. 1094.10 s [algebraic-graphs]
  18820. 1094.10 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  18821. 1094.10 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  18822. 1094.10 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  18823. 1094.10 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  18824. 1094.10 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  18825. 1094.10 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  18826. 1094.10 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18827. 1094.10 s [algebraic-graphs]
  18828. 1094.10 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  18829. 1094.10 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18830. 1094.10 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18831. 1094.10 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18832. 1094.10 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18833. 1094.10 s [algebraic-graphs]
  18834. 1094.10 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  18835. 1094.10 s [algebraic-graphs] OK: scc empty == empty
  18836. 1094.10 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  18837. 1094.10 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  18838. 1094.10 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  18839. 1094.10 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  18840. 1094.10 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  18841. 1094.10 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  18842. 1094.10 s [algebraic-graphs] OK: isAcyclic . scc == const True
  18843. 1094.10 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  18844. 1094.10 s [algebraic-graphs] OK: scc g == KL.scc g
  18845. 1094.10 s [algebraic-graphs]
  18846. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  18847. 1094.10 s [algebraic-graphs] OK: 0 == rightVertex 0
  18848. 1094.10 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  18849. 1094.10 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  18850. 1094.10 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  18851. 1094.10 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  18852. 1094.10 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  18853. 1094.10 s [algebraic-graphs]
  18854. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  18855. 1094.10 s [algebraic-graphs] OK: show empty == "empty"
  18856. 1094.10 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  18857. 1094.10 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  18858. 1094.10 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  18859. 1094.10 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  18860. 1094.10 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  18861. 1094.10 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  18862. 1094.10 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  18863. 1094.10 s [algebraic-graphs]
  18864. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  18865. 1094.10 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  18866. 1094.10 s [algebraic-graphs]
  18867. 1094.10 s [algebraic-graphs] OK: x + y == y + x
  18868. 1094.10 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  18869. 1094.10 s [algebraic-graphs] OK: x * empty == x
  18870. 1094.10 s [algebraic-graphs] OK: empty * x == x
  18871. 1094.10 s [algebraic-graphs] OK: x * y == y * x
  18872. 1094.10 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  18873. 1094.10 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  18874. 1094.10 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  18875. 1094.10 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  18876. 1094.10 s [algebraic-graphs] OK: x + empty == x
  18877. 1094.10 s [algebraic-graphs] OK: empty + x == x
  18878. 1094.10 s [algebraic-graphs] OK: x + x == x
  18879. 1094.10 s [algebraic-graphs] OK: x * y + x + y == x * y
  18880. 1094.10 s [algebraic-graphs] OK: x * x * x == x * x
  18881. 1094.10 s [algebraic-graphs]
  18882. 1094.10 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  18883. 1094.10 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  18884. 1094.10 s [algebraic-graphs]
  18885. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  18886. 1094.10 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18887. 1094.10 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18888. 1094.10 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18889. 1094.10 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18890. 1094.10 s [algebraic-graphs]
  18891. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  18892. 1094.10 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18893. 1094.10 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18894. 1094.10 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18895. 1094.10 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18896. 1094.10 s [algebraic-graphs]
  18897. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  18898. 1094.10 s [algebraic-graphs] OK: isEmpty empty == True
  18899. 1094.10 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18900. 1094.10 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18901. 1094.10 s [algebraic-graphs] OK: hasVertex x empty == False
  18902. 1094.10 s [algebraic-graphs]
  18903. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  18904. 1094.10 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18905. 1094.10 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18906. 1094.10 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18907. 1094.10 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18908. 1094.10 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  18909. 1094.10 s [algebraic-graphs]
  18910. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  18911. 1094.10 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18912. 1094.10 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18913. 1094.10 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18914. 1094.10 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18915. 1094.10 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  18916. 1094.10 s [algebraic-graphs]
  18917. 1094.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  18918. 1094.10 s [algebraic-graphs] OK: vertex . Left == leftVertex
  18919. 1094.10 s [algebraic-graphs] OK: vertex . Right == rightVertex
  18920. 1094.10 s [algebraic-graphs]
  18921. 1094.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  18922. 1094.11 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  18923. 1094.11 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18924. 1094.11 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18925. 1094.11 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18926. 1094.11 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  18927. 1094.11 s [algebraic-graphs]
  18928. 1094.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  18929. 1094.11 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18930. 1094.11 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18931. 1094.11 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18932. 1094.11 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18933. 1094.11 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18934. 1094.11 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18935. 1094.11 s [algebraic-graphs]
  18936. 1094.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  18937. 1094.11 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  18938. 1094.11 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  18939. 1094.11 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  18940. 1094.11 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  18941. 1094.11 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  18942. 1094.11 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18943. 1094.11 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18944. 1094.11 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18945. 1094.11 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18946. 1094.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18947. 1094.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  18948. 1094.11 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  18949. 1094.11 s [algebraic-graphs]
  18950. 1094.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  18951. 1094.11 s [algebraic-graphs] OK: vertices [] [] == empty
  18952. 1094.11 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  18953. 1094.11 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  18954. 1094.11 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  18955. 1094.11 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  18956. 1094.11 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  18957. 1094.11 s [algebraic-graphs]
  18958. 1094.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  18959. 1094.11 s [algebraic-graphs] OK: edges [] == empty
  18960. 1094.11 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18961. 1094.11 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18962. 1094.11 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  18963. 1094.11 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18964. 1094.11 s [algebraic-graphs]
  18965. 1094.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  18966. 1094.11 s [algebraic-graphs] OK: overlays [] == empty
  18967. 1094.11 s [algebraic-graphs] OK: overlays [x] == x
  18968. 1094.11 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18969. 1094.11 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18970. 1094.11 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18971. 1094.11 s [algebraic-graphs]
  18972. 1094.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  18973. 1094.11 s [algebraic-graphs] OK: connects [] == empty
  18974. 1094.11 s [algebraic-graphs] OK: connects [x] == x
  18975. 1094.11 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18976. 1094.11 s [algebraic-graphs] OK: connects == foldr connect empty
  18977. 1094.11 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18978. 1094.11 s [algebraic-graphs]
  18979. 1094.11 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  18980. 1097.80 s [algebraic-graphs] OK: swap empty == empty
  18981. 1097.80 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  18982. 1097.80 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  18983. 1097.80 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  18984. 1097.80 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  18985. 1097.80 s [algebraic-graphs] OK: swap . swap == id
  18986. 1097.80 s [algebraic-graphs]
  18987. 1097.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  18988. 1097.80 s [algebraic-graphs] OK: toBipartite empty == empty
  18989. 1097.80 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  18990. 1097.80 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  18991. 1097.81 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  18992. 1097.81 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  18993. 1097.81 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  18994. 1097.81 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  18995. 1097.81 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  18996. 1097.81 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  18997. 1097.81 s [algebraic-graphs]
  18998. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  18999. 1097.81 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  19000. 1097.81 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  19001. 1097.81 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  19002. 1097.81 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  19003. 1097.81 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  19004. 1097.81 s [algebraic-graphs]
  19005. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  19006. 1097.81 s [algebraic-graphs] OK: fromBipartite empty == empty
  19007. 1097.81 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  19008. 1097.81 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  19009. 1097.81 s [algebraic-graphs]
  19010. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  19011. 1097.81 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  19012. 1097.81 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  19013. 1097.81 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  19014. 1097.81 s [algebraic-graphs]
  19015. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  19016. 1097.81 s [algebraic-graphs] OK: isEmpty empty == True
  19017. 1097.81 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19018. 1097.81 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19019. 1097.81 s [algebraic-graphs] OK: isEmpty == (==) empty
  19020. 1097.81 s [algebraic-graphs]
  19021. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  19022. 1097.81 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  19023. 1097.81 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  19024. 1097.81 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  19025. 1097.81 s [algebraic-graphs]
  19026. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  19027. 1097.81 s [algebraic-graphs] OK: hasRightVertex x empty == False
  19028. 1097.81 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  19029. 1097.81 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  19030. 1097.81 s [algebraic-graphs]
  19031. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  19032. 1097.81 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  19033. 1097.81 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  19034. 1097.81 s [algebraic-graphs]
  19035. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  19036. 1097.81 s [algebraic-graphs] OK: hasEdge x y empty == False
  19037. 1097.81 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19038. 1097.81 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19039. 1097.81 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19040. 1097.81 s [algebraic-graphs]
  19041. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  19042. 1097.81 s [algebraic-graphs] OK: leftVertexCount empty == 0
  19043. 1097.81 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  19044. 1097.81 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  19045. 1097.81 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  19046. 1097.81 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  19047. 1097.81 s [algebraic-graphs]
  19048. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  19049. 1097.81 s [algebraic-graphs] OK: rightVertexCount empty == 0
  19050. 1097.81 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  19051. 1097.81 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  19052. 1097.81 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  19053. 1097.81 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  19054. 1097.81 s [algebraic-graphs]
  19055. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  19056. 1097.81 s [algebraic-graphs] OK: vertexCount empty == 0
  19057. 1097.81 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19058. 1097.81 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  19059. 1097.81 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  19060. 1097.81 s [algebraic-graphs]
  19061. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  19062. 1097.81 s [algebraic-graphs] OK: edgeCount empty == 0
  19063. 1097.81 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19064. 1097.81 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19065. 1097.81 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19066. 1097.81 s [algebraic-graphs]
  19067. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  19068. 1097.81 s [algebraic-graphs] OK: leftVertexList empty == []
  19069. 1097.81 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  19070. 1097.81 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  19071. 1097.81 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  19072. 1097.81 s [algebraic-graphs]
  19073. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  19074. 1097.81 s [algebraic-graphs] OK: rightVertexList empty == []
  19075. 1097.81 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  19076. 1097.81 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  19077. 1097.81 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  19078. 1097.81 s [algebraic-graphs]
  19079. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  19080. 1097.81 s [algebraic-graphs] OK: vertexList empty == []
  19081. 1097.81 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19082. 1097.81 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  19083. 1097.81 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  19084. 1097.81 s [algebraic-graphs]
  19085. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  19086. 1097.81 s [algebraic-graphs] OK: edgeList empty == []
  19087. 1097.81 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19088. 1097.81 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19089. 1097.81 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  19090. 1097.81 s [algebraic-graphs]
  19091. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  19092. 1097.81 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  19093. 1097.81 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  19094. 1097.81 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  19095. 1097.81 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  19096. 1097.81 s [algebraic-graphs]
  19097. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  19098. 1097.81 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  19099. 1097.81 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  19100. 1097.81 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  19101. 1097.81 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  19102. 1097.81 s [algebraic-graphs]
  19103. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  19104. 1097.81 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19105. 1097.81 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19106. 1097.81 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  19107. 1097.81 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  19108. 1097.81 s [algebraic-graphs]
  19109. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  19110. 1097.81 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19111. 1097.81 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19112. 1097.81 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19113. 1097.81 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19114. 1097.81 s [algebraic-graphs]
  19115. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  19116. 1097.81 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  19117. 1097.81 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  19118. 1097.81 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  19119. 1097.81 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  19120. 1097.81 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  19121. 1097.81 s [algebraic-graphs]
  19122. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  19123. 1097.81 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  19124. 1097.81 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  19125. 1097.81 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  19126. 1097.81 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  19127. 1097.81 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  19128. 1097.81 s [algebraic-graphs]
  19129. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  19130. 1097.81 s [algebraic-graphs] OK: evenList [] == Nil
  19131. 1097.81 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  19132. 1097.81 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  19133. 1097.81 s [algebraic-graphs]
  19134. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  19135. 1097.81 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  19136. 1097.81 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  19137. 1097.81 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  19138. 1097.81 s [algebraic-graphs]
  19139. 1097.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  19140. 1097.81 s [algebraic-graphs] OK: path Nil == empty
  19141. 1097.82 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  19142. 1097.82 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  19143. 1097.82 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  19144. 1097.82 s [algebraic-graphs]
  19145. 1097.82 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  19146. 1097.82 s [algebraic-graphs] OK: circuit [] == empty
  19147. 1097.82 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  19148. 1097.82 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  19149. 1097.82 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  19150. 1097.82 s [algebraic-graphs]
  19151. 1097.82 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  19152. 1097.82 s [algebraic-graphs] OK: biclique [] [] == empty
  19153. 1097.82 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  19154. 1097.82 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  19155. 1097.82 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  19156. 1097.82 s [algebraic-graphs]
  19157. 1097.82 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  19158. 1097.82 s [algebraic-graphs] OK: star x [] == leftVertex x
  19159. 1097.82 s [algebraic-graphs] OK: star x [y] == edge x y
  19160. 1097.82 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19161. 1097.82 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  19162. 1097.82 s [algebraic-graphs]
  19163. 1097.82 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  19164. 1097.82 s [algebraic-graphs] OK: stars [] == empty
  19165. 1097.82 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  19166. 1097.82 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19167. 1097.82 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19168. 1145.59 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19169. 1145.63 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19170. 1145.63 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19171. 1145.63 s [algebraic-graphs]
  19172. 1145.63 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  19173. 1145.63 s [algebraic-graphs] OK: mesh xs [] == empty
  19174. 1145.63 s [algebraic-graphs] OK: mesh [] ys == empty
  19175. 1145.63 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  19176. 1145.63 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  19177. 1145.63 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  19178. 1145.63 s [algebraic-graphs]
  19179. 1145.63 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  19180. 1145.63 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  19181. 1145.63 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  19182. 1145.63 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  19183. 1145.63 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  19184. 1145.63 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  19185. 1145.63 s [algebraic-graphs]
  19186. 1145.63 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  19187. 1145.63 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  19188. 1145.63 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  19189. 1145.63 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  19190. 1145.63 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  19191. 1145.63 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  19192. 1145.63 s [algebraic-graphs]
  19193. 1145.63 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  19194. 1145.63 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  19195. 1145.63 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19196. 1145.63 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  19197. 1145.63 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  19198. 1145.63 s [algebraic-graphs]
  19199. 1145.63 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  19200. 1145.63 s [algebraic-graphs] OK: bimap f g empty == empty
  19201. 1145.63 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  19202. 1145.63 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  19203. 1145.63 s [algebraic-graphs] OK: bimap id id == id
  19204. 1145.63 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  19205. 1145.63 s [algebraic-graphs]
  19206. 1145.63 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  19207. 1145.63 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  19208. 1145.63 s [algebraic-graphs]
  19209. 1145.63 s [algebraic-graphs] OK: box x y ~~ box y x
  19210. 1145.63 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19211. 1145.63 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19212. 1145.63 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  19213. 1145.63 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  19214. 1145.63 s [algebraic-graphs] OK: box x empty ~~ empty
  19215. 1145.63 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  19216. 1145.63 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19217. 1145.63 s [algebraic-graphs]
  19218. 1145.63 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  19219. 1145.63 s [algebraic-graphs]
  19220. 1145.63 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  19221. 1145.63 s [algebraic-graphs] OK: consistent empty == True
  19222. 1145.63 s [algebraic-graphs] OK: consistent (vertex x) == True
  19223. 1145.63 s [algebraic-graphs] OK: consistent (edge x y) == True
  19224. 1145.63 s [algebraic-graphs] OK: consistent (edges x) == True
  19225. 1145.63 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  19226. 1145.63 s [algebraic-graphs] OK: consistent (swap x) == True
  19227. 1145.63 s [algebraic-graphs] OK: consistent (circuit xs) == True
  19228. 1145.63 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  19229. 1145.63 s [algebraic-graphs]
  19230. 1145.63 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  19231. 1145.63 s [algebraic-graphs] OK: detectParts empty == Right empty
  19232. 1145.63 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  19233. 1145.63 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  19234. 1145.63 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  19235. 1145.63 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  19236. 1145.63 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  19237. 1145.63 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  19238. 1145.63 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  19239. 1145.63 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  19240. 1145.63 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  19241. 1145.63 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  19242. 1145.63 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  19243. 1145.63 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  19244. 1145.63 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  19245. 1145.63 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  19246. 1145.63 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  19247. 1145.64 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  19248. 1145.64 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  19249. 1145.64 s [algebraic-graphs]
  19250. 1145.64 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  19251. 1145.64 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  19252. 1145.64 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  19253. 1145.64 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  19254. 1145.64 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  19255. 1145.64 s [algebraic-graphs]
  19256. 1145.64 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  19257. 1145.64 s [algebraic-graphs] OK: show (matching []) == "matching []"
  19258. 1145.64 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  19259. 1145.64 s [algebraic-graphs]
  19260. 1145.64 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  19261. 1145.64 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  19262. 1145.64 s [algebraic-graphs]
  19263. 1145.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  19264. 1145.64 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  19265. 1145.64 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  19266. 1145.64 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  19267. 1145.64 s [algebraic-graphs]
  19268. 1145.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  19269. 1145.64 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  19270. 1145.64 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  19271. 1145.64 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  19272. 1145.64 s [algebraic-graphs]
  19273. 1145.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  19274. 1145.64 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  19275. 1145.64 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  19276. 1145.64 s [algebraic-graphs]
  19277. 1145.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  19278. 1145.64 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  19279. 1145.64 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  19280. 1145.64 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  19281. 1145.64 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  19282. 1145.64 s [algebraic-graphs]
  19283. 1145.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  19284. 1145.64 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  19285. 1145.64 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  19286. 1145.64 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  19287. 1145.64 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  19288. 1145.64 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  19289. 1145.64 s [algebraic-graphs]
  19290. 1145.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  19291. 1145.64 s [algebraic-graphs] OK: maxMatching empty == matching []
  19292. 1145.64 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  19293. 1145.64 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  19294. 1145.64 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  19295. 1145.64 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  19296. 1145.64 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  19297. 1145.64 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  19298. 1145.64 s [algebraic-graphs]
  19299. 1145.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  19300. 1145.64 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  19301. 1145.64 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  19302. 1145.64 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  19303. 1145.64 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  19304. 1145.64 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  19305. 1145.64 s [algebraic-graphs]
  19306. 1145.64 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  19307. 1145.64 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  19308. 1149.41 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  19309. 1149.41 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  19310. 1149.41 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  19311. 1149.41 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  19312. 1149.41 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  19313. 1149.41 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  19314. 1149.42 s [algebraic-graphs]
  19315. 1149.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  19316. 1149.42 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  19317. 1149.42 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  19318. 1149.42 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  19319. 1149.42 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  19320. 1149.42 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  19321. 1149.42 s [algebraic-graphs]
  19322. 1149.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  19323. 1149.42 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  19324. 1149.42 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  19325. 1149.42 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  19326. 1149.42 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  19327. 1149.42 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  19328. 1149.42 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  19329. 1149.42 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  19330. 1149.42 s [algebraic-graphs]
  19331. 1149.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  19332. 1149.42 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  19333. 1149.42 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  19334. 1149.42 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  19335. 1149.42 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  19336. 1149.42 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  19337. 1149.42 s [algebraic-graphs]
  19338. 1149.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  19339. 1149.42 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  19340. 1149.42 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  19341. 1149.42 s [algebraic-graphs]
  19342. 1149.42 s [algebraic-graphs] ============ Export.Eq ============
  19343. 1149.42 s [algebraic-graphs] OK: mempty /= literal ""
  19344. 1149.42 s [algebraic-graphs]
  19345. 1149.42 s [algebraic-graphs] ============ Export.Ord ============
  19346. 1149.42 s [algebraic-graphs] OK: mempty < literal ""
  19347. 1149.42 s [algebraic-graphs]
  19348. 1149.42 s [algebraic-graphs] ============ Export.isEmpty ============
  19349. 1149.42 s [algebraic-graphs] OK: isEmpty mempty == True
  19350. 1149.42 s [algebraic-graphs] OK: isEmpty (literal "") == False
  19351. 1149.42 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  19352. 1149.42 s [algebraic-graphs]
  19353. 1149.42 s [algebraic-graphs] ============ Export.literal ============
  19354. 1149.42 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  19355. 1149.42 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  19356. 1149.42 s [algebraic-graphs] OK: render . literal == id
  19357. 1149.42 s [algebraic-graphs]
  19358. 1149.42 s [algebraic-graphs] ============ Export.render ============
  19359. 1149.42 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  19360. 1149.42 s [algebraic-graphs] OK: render mempty == mempty
  19361. 1149.42 s [algebraic-graphs]
  19362. 1149.42 s [algebraic-graphs] ============ Export.<+> ============
  19363. 1149.42 s [algebraic-graphs] OK: x <+> mempty == x
  19364. 1149.42 s [algebraic-graphs] OK: mempty <+> x == x
  19365. 1149.42 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  19366. 1149.42 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  19367. 1149.42 s [algebraic-graphs]
  19368. 1149.42 s [algebraic-graphs] ============ Export.brackets ============
  19369. 1149.42 s [algebraic-graphs] OK: brackets "i" == "[i]"
  19370. 1149.42 s [algebraic-graphs] OK: brackets mempty == "[]"
  19371. 1149.42 s [algebraic-graphs]
  19372. 1149.42 s [algebraic-graphs] ============ Export.doubleQuotes ============
  19373. 1149.42 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  19374. 1149.42 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  19375. 1149.42 s [algebraic-graphs]
  19376. 1149.42 s [algebraic-graphs] ============ Export.indent ============
  19377. 1149.42 s [algebraic-graphs] OK: indent 0 == id
  19378. 1149.42 s [algebraic-graphs] OK: indent 1 mempty == " "
  19379. 1149.42 s [algebraic-graphs]
  19380. 1149.42 s [algebraic-graphs] ============ Export.unlines ============
  19381. 1149.42 s [algebraic-graphs] OK: unlines [] == mempty
  19382. 1149.42 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  19383. 1149.42 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  19384. 1149.42 s [algebraic-graphs]
  19385. 1149.42 s [algebraic-graphs] ============ Export.export ============
  19386. 1149.42 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  19387. 1149.42 s [algebraic-graphs]
  19388. 1149.42 s [algebraic-graphs] ============ Export.Dot.export ============
  19389. 1149.42 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  19390. 1149.42 s [algebraic-graphs]
  19391. 1149.42 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  19392. 1149.42 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  19393. 1149.43 s [algebraic-graphs]
  19394. 1149.43 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  19395. 1149.43 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  19396. 1149.43 s [algebraic-graphs]
  19397. 1149.43 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  19398. 1149.43 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  19399. 1149.43 s [algebraic-graphs]
  19400. 1149.43 s [algebraic-graphs] ============ Graph ============
  19401. 1149.43 s [algebraic-graphs] OK: Axioms of graphs
  19402. 1149.43 s [algebraic-graphs] OK: Theorems of graphs
  19403. 1149.43 s [algebraic-graphs]
  19404. 1149.43 s [algebraic-graphs] ============ Graph.Ord ============
  19405. 1149.43 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19406. 1149.43 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19407. 1149.43 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19408. 1149.43 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19409. 1149.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19410. 1149.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19411. 1149.43 s [algebraic-graphs] OK: x <= x + y
  19412. 1149.43 s [algebraic-graphs] OK: x + y <= x * y
  19413. 1149.43 s [algebraic-graphs]
  19414. 1149.43 s [algebraic-graphs] ============ Graph.empty ============
  19415. 1149.43 s [algebraic-graphs] OK: isEmpty empty == True
  19416. 1149.43 s [algebraic-graphs] OK: hasVertex x empty == False
  19417. 1149.43 s [algebraic-graphs] OK: vertexCount empty == 0
  19418. 1149.43 s [algebraic-graphs] OK: edgeCount empty == 0
  19419. 1149.43 s [algebraic-graphs]
  19420. 1149.43 s [algebraic-graphs] ============ Graph.vertex ============
  19421. 1149.43 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19422. 1149.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19423. 1149.43 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19424. 1149.43 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19425. 1149.43 s [algebraic-graphs]
  19426. 1149.43 s [algebraic-graphs] ============ Graph.edge ============
  19427. 1149.43 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19428. 1149.43 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19429. 1149.43 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19430. 1149.43 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19431. 1149.43 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19432. 1149.43 s [algebraic-graphs]
  19433. 1149.43 s [algebraic-graphs] ============ Graph.overlay ============
  19434. 1149.43 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19435. 1149.43 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19436. 1149.43 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19437. 1149.43 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19438. 1149.43 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19439. 1149.43 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19440. 1149.43 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19441. 1149.43 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19442. 1149.43 s [algebraic-graphs]
  19443. 1149.43 s [algebraic-graphs] ============ Graph.connect ============
  19444. 1149.43 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19445. 1149.43 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19446. 1149.43 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19447. 1149.43 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19448. 1149.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19449. 1149.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19450. 1149.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19451. 1149.43 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19452. 1149.43 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19453. 1149.43 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19454. 1149.43 s [algebraic-graphs]
  19455. 1149.43 s [algebraic-graphs] ============ Graph.vertices ============
  19456. 1149.43 s [algebraic-graphs] OK: vertices [] == empty
  19457. 1149.43 s [algebraic-graphs] OK: vertices [x] == vertex x
  19458. 1149.43 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19459. 1149.43 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19460. 1149.43 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19461. 1149.43 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19462. 1149.43 s [algebraic-graphs]
  19463. 1149.43 s [algebraic-graphs] ============ Graph.edges ============
  19464. 1149.43 s [algebraic-graphs] OK: edges [] == empty
  19465. 1149.43 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19466. 1149.43 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  19467. 1149.43 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19468. 1149.43 s [algebraic-graphs]
  19469. 1149.43 s [algebraic-graphs] ============ Graph.overlays ============
  19470. 1149.43 s [algebraic-graphs] OK: overlays [] == empty
  19471. 1149.43 s [algebraic-graphs] OK: overlays [x] == x
  19472. 1149.43 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19473. 1149.43 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19474. 1149.43 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19475. 1149.43 s [algebraic-graphs]
  19476. 1149.43 s [algebraic-graphs] ============ Graph.connects ============
  19477. 1149.43 s [algebraic-graphs] OK: connects [] == empty
  19478. 1149.43 s [algebraic-graphs] OK: connects [x] == x
  19479. 1149.43 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19480. 1149.43 s [algebraic-graphs] OK: connects == foldr connect empty
  19481. 1149.43 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19482. 1149.43 s [algebraic-graphs]
  19483. 1149.43 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  19484. 1149.43 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19485. 1149.43 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19486. 1149.43 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19487. 1149.43 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19488. 1149.43 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19489. 1149.43 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19490. 1149.43 s [algebraic-graphs]
  19491. 1149.43 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  19492. 1149.43 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19493. 1149.43 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19494. 1149.43 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19495. 1149.43 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19496. 1149.43 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19497. 1149.43 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19498. 1149.43 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19499. 1149.43 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19500. 1149.43 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19501. 1150.28 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19502. 1150.28 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19503. 1150.28 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19504. 1150.28 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19505. 1150.28 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19506. 1150.28 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19507. 1150.28 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19508. 1150.28 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19509. 1150.28 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19510. 1150.28 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19511. 1150.28 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19512. 1150.28 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19513. 1150.28 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19514. 1150.28 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19515. 1150.28 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19516. 1150.28 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19517. 1150.28 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19518. 1150.28 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19519. 1150.28 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19520. 1150.28 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19521. 1150.28 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19522. 1150.28 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19523. 1150.28 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19524. 1150.28 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19525. 1150.28 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19526. 1150.28 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19527. 1150.28 s [algebraic-graphs]
  19528. 1150.28 s [algebraic-graphs] ============ Graph.foldg ============
  19529. 1150.28 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19530. 1150.28 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19531. 1150.28 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19532. 1150.28 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19533. 1150.28 s [algebraic-graphs]
  19534. 1150.28 s [algebraic-graphs] ============ Graph.isEmpty ============
  19535. 1150.28 s [algebraic-graphs] OK: isEmpty empty == True
  19536. 1150.28 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19537. 1150.28 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19538. 1150.28 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19539. 1150.28 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19540. 1150.28 s [algebraic-graphs]
  19541. 1150.28 s [algebraic-graphs] ============ Graph.hasVertex ============
  19542. 1150.28 s [algebraic-graphs] OK: hasVertex x empty == False
  19543. 1150.28 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19544. 1150.28 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19545. 1150.28 s [algebraic-graphs]
  19546. 1150.28 s [algebraic-graphs] ============ Graph.hasEdge ============
  19547. 1150.28 s [algebraic-graphs] OK: hasEdge x y empty == False
  19548. 1150.28 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19549. 1150.28 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19550. 1150.28 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19551. 1150.28 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19552. 1150.28 s [algebraic-graphs]
  19553. 1150.28 s [algebraic-graphs] ============ Graph.vertexCount ============
  19554. 1150.28 s [algebraic-graphs] OK: vertexCount empty == 0
  19555. 1150.28 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19556. 1150.28 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19557. 1150.28 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19558. 1150.28 s [algebraic-graphs]
  19559. 1150.28 s [algebraic-graphs] ============ Graph.edgeCount ============
  19560. 1150.28 s [algebraic-graphs] OK: edgeCount empty == 0
  19561. 1150.28 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19562. 1150.28 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19563. 1150.28 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19564. 1150.28 s [algebraic-graphs]
  19565. 1150.28 s [algebraic-graphs] ============ Graph.vertexList ============
  19566. 1150.28 s [algebraic-graphs] OK: vertexList empty == []
  19567. 1150.28 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19568. 1150.28 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19569. 1150.28 s [algebraic-graphs]
  19570. 1150.28 s [algebraic-graphs] ============ Graph.vertexSet ============
  19571. 1150.28 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19572. 1150.28 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19573. 1150.28 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19574. 1150.28 s [algebraic-graphs]
  19575. 1150.28 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  19576. 1150.28 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  19577. 1150.28 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  19578. 1150.28 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  19579. 1150.28 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  19580. 1150.28 s [algebraic-graphs]
  19581. 1150.28 s [algebraic-graphs] ============ Graph.edgeList ============
  19582. 1150.28 s [algebraic-graphs] OK: edgeList empty == []
  19583. 1150.28 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19584. 1150.28 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19585. 1150.28 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19586. 1150.28 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  19587. 1150.28 s [algebraic-graphs]
  19588. 1150.28 s [algebraic-graphs] ============ Graph.edgeSet ============
  19589. 1150.28 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19590. 1150.28 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19591. 1150.28 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19592. 1150.28 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19593. 1150.29 s [algebraic-graphs]
  19594. 1150.29 s [algebraic-graphs] ============ Graph.adjacencyList ============
  19595. 1150.29 s [algebraic-graphs] OK: adjacencyList empty == []
  19596. 1150.29 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19597. 1150.29 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  19598. 1150.29 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  19599. 1150.29 s [algebraic-graphs]
  19600. 1150.29 s [algebraic-graphs] ============ Graph.preSet ============
  19601. 1150.29 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19602. 1150.29 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19603. 1150.29 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19604. 1150.29 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19605. 1150.29 s [algebraic-graphs]
  19606. 1150.29 s [algebraic-graphs] ============ Graph.preIntSet ============
  19607. 1150.29 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  19608. 1150.29 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  19609. 1150.29 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  19610. 1150.29 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  19611. 1150.29 s [algebraic-graphs]
  19612. 1150.29 s [algebraic-graphs] ============ Graph.postSet ============
  19613. 1150.29 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19614. 1150.29 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19615. 1150.29 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19616. 1150.29 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19617. 1150.29 s [algebraic-graphs]
  19618. 1150.29 s [algebraic-graphs] ============ Graph.postIntSet ============
  19619. 1150.29 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  19620. 1150.29 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  19621. 1150.29 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  19622. 1150.29 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  19623. 1150.29 s [algebraic-graphs]
  19624. 1150.29 s [algebraic-graphs] ============ Graph.size ============
  19625. 1150.29 s [algebraic-graphs] OK: size empty == 1
  19626. 1150.29 s [algebraic-graphs] OK: size (vertex x) == 1
  19627. 1150.29 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19628. 1150.29 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19629. 1150.29 s [algebraic-graphs] OK: size x >= 1
  19630. 1150.29 s [algebraic-graphs] OK: size x >= vertexCount x
  19631. 1150.29 s [algebraic-graphs]
  19632. 1150.29 s [algebraic-graphs] ============ Graph.path ============
  19633. 1150.29 s [algebraic-graphs] OK: path [] == empty
  19634. 1150.29 s [algebraic-graphs] OK: path [x] == vertex x
  19635. 1150.29 s [algebraic-graphs] OK: path [x,y] == edge x y
  19636. 1150.29 s [algebraic-graphs]
  19637. 1150.29 s [algebraic-graphs] ============ Graph.circuit ============
  19638. 1150.29 s [algebraic-graphs] OK: circuit [] == empty
  19639. 1150.29 s [algebraic-graphs] OK: circuit [x] == edge x x
  19640. 1150.29 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  19641. 1150.29 s [algebraic-graphs]
  19642. 1150.29 s [algebraic-graphs] ============ Graph.clique ============
  19643. 1150.29 s [algebraic-graphs] OK: clique [] == empty
  19644. 1150.29 s [algebraic-graphs] OK: clique [x] == vertex x
  19645. 1150.29 s [algebraic-graphs] OK: clique [x,y] == edge x y
  19646. 1150.29 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  19647. 1150.29 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  19648. 1150.29 s [algebraic-graphs]
  19649. 1150.29 s [algebraic-graphs] ============ Graph.biclique ============
  19650. 1150.29 s [algebraic-graphs] OK: biclique [] [] == empty
  19651. 1150.29 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  19652. 1150.29 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  19653. 1150.29 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19654. 1150.29 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  19655. 1150.29 s [algebraic-graphs]
  19656. 1150.29 s [algebraic-graphs] ============ Graph.star ============
  19657. 1150.29 s [algebraic-graphs] OK: star x [] == vertex x
  19658. 1150.29 s [algebraic-graphs] OK: star x [y] == edge x y
  19659. 1150.29 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19660. 1150.29 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  19661. 1150.29 s [algebraic-graphs]
  19662. 1150.29 s [algebraic-graphs] ============ Graph.stars ============
  19663. 1150.29 s [algebraic-graphs] OK: stars [] == empty
  19664. 1150.29 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  19665. 1150.29 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19666. 1150.29 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19667. 1150.29 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19668. 1150.29 s [algebraic-graphs] OK: stars . adjacencyList == id
  19669. 1150.29 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19670. 1150.29 s [algebraic-graphs]
  19671. 1150.29 s [algebraic-graphs] ============ Graph.tree ============
  19672. 1150.29 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19673. 1150.29 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  19674. 1150.29 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19675. 1150.29 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19676. 1150.29 s [algebraic-graphs]
  19677. 1150.29 s [algebraic-graphs] ============ Graph.forest ============
  19678. 1150.29 s [algebraic-graphs] OK: forest [] == empty
  19679. 1150.29 s [algebraic-graphs] OK: forest [x] == tree x
  19680. 1150.29 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19681. 1150.29 s [algebraic-graphs] OK: forest == overlays . map tree
  19682. 1150.29 s [algebraic-graphs]
  19683. 1150.29 s [algebraic-graphs] ============ Graph.removeVertex ============
  19684. 1157.33 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19685. 1157.33 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19686. 1157.33 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19687. 1157.37 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19688. 1157.37 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19689. 1157.37 s [algebraic-graphs]
  19690. 1157.37 s [algebraic-graphs] ============ Graph.removeEdge ============
  19691. 1157.37 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19692. 1157.37 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19693. 1157.37 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19694. 1157.37 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19695. 1157.38 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19696. 1157.38 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  19697. 1157.38 s [algebraic-graphs]
  19698. 1157.38 s [algebraic-graphs] ============ Graph.replaceVertex ============
  19699. 1157.38 s [algebraic-graphs] OK: replaceVertex x x == id
  19700. 1157.38 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19701. 1157.38 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19702. 1157.38 s [algebraic-graphs]
  19703. 1157.38 s [algebraic-graphs] ============ Graph.mergeVertices ============
  19704. 1157.38 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19705. 1157.38 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19706. 1157.38 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19707. 1157.38 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19708. 1157.38 s [algebraic-graphs]
  19709. 1157.38 s [algebraic-graphs] ============ Graph.transpose ============
  19710. 1157.38 s [algebraic-graphs] OK: transpose empty == empty
  19711. 1157.38 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19712. 1157.38 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19713. 1157.38 s [algebraic-graphs] OK: transpose . transpose == id
  19714. 1157.38 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19715. 1157.38 s [algebraic-graphs]
  19716. 1157.38 s [algebraic-graphs] ============ Graph.gmap ============
  19717. 1157.38 s [algebraic-graphs] OK: gmap f empty == empty
  19718. 1157.38 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19719. 1157.38 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19720. 1157.38 s [algebraic-graphs] OK: gmap id == id
  19721. 1157.38 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19722. 1157.38 s [algebraic-graphs]
  19723. 1157.38 s [algebraic-graphs] ============ Graph.induce ============
  19724. 1157.38 s [algebraic-graphs] OK: induce (const True ) x == x
  19725. 1157.38 s [algebraic-graphs] OK: induce (const False) x == empty
  19726. 1157.38 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19727. 1157.38 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19728. 1157.38 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19729. 1157.38 s [algebraic-graphs]
  19730. 1157.38 s [algebraic-graphs] ============ Graph.induceJust ============
  19731. 1157.38 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19732. 1157.38 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19733. 1157.38 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19734. 1157.38 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19735. 1157.38 s [algebraic-graphs]
  19736. 1157.38 s [algebraic-graphs] ============ Graph.compose ============
  19737. 1157.38 s [algebraic-graphs] OK: compose empty x == empty
  19738. 1157.38 s [algebraic-graphs] OK: compose x empty == empty
  19739. 1157.38 s [algebraic-graphs] OK: compose (vertex x) y == empty
  19740. 1157.38 s [algebraic-graphs] OK: compose x (vertex y) == empty
  19741. 1157.38 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  19742. 1157.38 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  19743. 1157.38 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  19744. 1157.38 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  19745. 1157.38 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  19746. 1157.38 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  19747. 1157.38 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  19748. 1157.38 s [algebraic-graphs]
  19749. 1157.38 s [algebraic-graphs] ============ Graph.(===) ============
  19750. 1157.38 s [algebraic-graphs] OK: x === x == True
  19751. 1157.38 s [algebraic-graphs] OK: x === x + empty == False
  19752. 1157.38 s [algebraic-graphs] OK: x + y === x + y == True
  19753. 1157.38 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19754. 1157.38 s [algebraic-graphs] OK: x + y === x * y == False
  19755. 1157.38 s [algebraic-graphs]
  19756. 1157.38 s [algebraic-graphs] ============ Graph.mesh ============
  19757. 1157.38 s [algebraic-graphs] OK: mesh xs [] == empty
  19758. 1157.38 s [algebraic-graphs] OK: mesh [] ys == empty
  19759. 1157.38 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  19760. 1157.38 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  19761. 1157.38 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  19762. 1157.38 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  19763. 1157.38 s [algebraic-graphs]
  19764. 1157.38 s [algebraic-graphs] ============ Graph.torus ============
  19765. 1157.38 s [algebraic-graphs] OK: torus xs [] == empty
  19766. 1157.38 s [algebraic-graphs] OK: torus [] ys == empty
  19767. 1157.38 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  19768. 1157.38 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  19769. 1157.38 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  19770. 1157.38 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  19771. 1157.38 s [algebraic-graphs]
  19772. 1157.38 s [algebraic-graphs] ============ Graph.deBruijn ============
  19773. 1157.38 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  19774. 1157.38 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  19775. 1157.38 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  19776. 1157.38 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  19777. 1157.38 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  19778. 1157.38 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  19779. 1157.38 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  19780. 1157.38 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  19781. 1157.38 s [algebraic-graphs]
  19782. 1157.38 s [algebraic-graphs] ============ Graph.splitVertex ============
  19783. 1157.38 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  19784. 1157.38 s [algebraic-graphs] OK: splitVertex x [x] == id
  19785. 1157.38 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  19786. 1157.38 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  19787. 1157.38 s [algebraic-graphs]
  19788. 1157.38 s [algebraic-graphs] ============ Graph.bind ============
  19789. 1157.38 s [algebraic-graphs] OK: bind empty f == empty
  19790. 1157.38 s [algebraic-graphs] OK: bind (vertex x) f == f x
  19791. 1157.38 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  19792. 1157.38 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  19793. 1157.38 s [algebraic-graphs] OK: bind x (const empty) == empty
  19794. 1157.38 s [algebraic-graphs] OK: bind x vertex == x
  19795. 1157.38 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  19796. 1157.38 s [algebraic-graphs]
  19797. 1157.38 s [algebraic-graphs] ============ Graph.simplify ============
  19798. 1157.38 s [algebraic-graphs] OK: simplify == id
  19799. 1157.38 s [algebraic-graphs] OK: size (simplify x) <= size x
  19800. 1157.38 s [algebraic-graphs]
  19801. 1157.38 s [algebraic-graphs] ============ Graph.box ============
  19802. 1157.38 s [algebraic-graphs] OK: box x y ~~ box y x
  19803. 1157.38 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  19804. 1157.38 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19805. 1157.38 s [algebraic-graphs] OK: box x empty ~~ empty
  19806. 1157.38 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19807. 1157.38 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19808. 1157.38 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19809. 1157.38 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19810. 1157.38 s [algebraic-graphs]
  19811. 1157.38 s [algebraic-graphs] ============ Graph.sparsify ============
  19812. 1157.38 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  19813. 1157.38 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  19814. 1157.38 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  19815. 1157.38 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  19816. 1157.38 s [algebraic-graphs]
  19817. 1157.38 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  19818. 1157.38 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  19819. 1157.38 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  19820. 1157.38 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  19821. 1157.38 s [algebraic-graphs]
  19822. 1157.38 s [algebraic-graphs] ============ Graph.context ============
  19823. 1157.38 s [algebraic-graphs] OK: context (const False) x == Nothing
  19824. 1157.38 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  19825. 1157.39 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  19826. 1157.39 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  19827. 1157.39 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  19828. 1157.39 s [algebraic-graphs]
  19829. 1157.39 s [algebraic-graphs] ============ Graph.buildg ============
  19830. 1157.39 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  19831. 1157.39 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  19832. 1157.39 s [algebraic-graphs] OK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
  19833. 1157.39 s [algebraic-graphs] OK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
  19834. 1157.39 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  19835. 1157.39 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  19836. 1157.39 s [algebraic-graphs]
  19837. 1157.39 s [algebraic-graphs] ============ Internal.List ============
  19838. 1157.39 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  19839. 1157.39 s [algebraic-graphs]
  19840. 1157.39 s [algebraic-graphs] ============ Graph.Label ============
  19841. 1157.39 s [algebraic-graphs]
  19842. 1157.39 s [algebraic-graphs] ============ Any: instances ============
  19843. 1157.39 s [algebraic-graphs] OK: Semiring
  19844. 1157.39 s [algebraic-graphs] OK: StarSemiring
  19845. 1157.39 s [algebraic-graphs] OK: Dioid
  19846. 1157.39 s [algebraic-graphs]
  19847. 1157.39 s [algebraic-graphs] ============ Distance Int: instances ============
  19848. 1157.39 s [algebraic-graphs] OK: Semiring
  19849. 1157.39 s [algebraic-graphs] OK: StarSemiring
  19850. 1157.39 s [algebraic-graphs] OK: Dioid
  19851. 1157.39 s [algebraic-graphs]
  19852. 1157.39 s [algebraic-graphs] ============ Capacity Int: instances ============
  19853. 1157.39 s [algebraic-graphs] OK: Semiring
  19854. 1157.39 s [algebraic-graphs] OK: StarSemiring
  19855. 1157.39 s [algebraic-graphs] OK: Dioid
  19856. 1157.39 s [algebraic-graphs]
  19857. 1157.39 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  19858. 1157.39 s [algebraic-graphs] OK: LeftNearRing
  19859. 1157.39 s [algebraic-graphs]
  19860. 1157.39 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  19861. 1157.39 s [algebraic-graphs] OK: Semiring
  19862. 1157.39 s [algebraic-graphs] OK: Dioid
  19863. 1157.39 s [algebraic-graphs]
  19864. 1157.39 s [algebraic-graphs] ============ Count Int: instances ============
  19865. 1157.39 s [algebraic-graphs] OK: Semiring
  19866. 1157.39 s [algebraic-graphs] OK: StarSemiring
  19867. 1157.39 s [algebraic-graphs]
  19868. 1157.39 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  19869. 1157.39 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  19870. 1157.39 s [algebraic-graphs] OK: empty
  19871. 1157.39 s [algebraic-graphs] OK: vertex
  19872. 1157.39 s [algebraic-graphs] OK: edge
  19873. 1157.39 s [algebraic-graphs] OK: overlay
  19874. 1157.39 s [algebraic-graphs] OK: connect
  19875. 1157.39 s [algebraic-graphs] OK: vertices
  19876. 1157.39 s [algebraic-graphs] OK: edges
  19877. 1157.39 s [algebraic-graphs] OK: overlays
  19878. 1157.39 s [algebraic-graphs] OK: fromAdjacencyMaps
  19879. 1157.39 s [algebraic-graphs] OK: removeVertex
  19880. 1157.39 s [algebraic-graphs] OK: removeEdge
  19881. 1157.39 s [algebraic-graphs] OK: replaceVertex
  19882. 1157.39 s [algebraic-graphs] OK: replaceEdge
  19883. 1157.39 s [algebraic-graphs] OK: transpose
  19884. 1157.39 s [algebraic-graphs] OK: gmap
  19885. 1157.39 s [algebraic-graphs] OK: emap
  19886. 1157.39 s [algebraic-graphs] OK: induce
  19887. 1157.39 s [algebraic-graphs] OK: closure
  19888. 1157.39 s [algebraic-graphs] OK: reflexiveClosure
  19889. 1157.39 s [algebraic-graphs] OK: symmetricClosure
  19890. 1157.39 s [algebraic-graphs] OK: transitiveClosure
  19891. 1157.39 s [algebraic-graphs]
  19892. 1157.39 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  19893. 1157.39 s [algebraic-graphs] OK: isEmpty empty == True
  19894. 1157.39 s [algebraic-graphs] OK: hasVertex x empty == False
  19895. 1157.39 s [algebraic-graphs] OK: vertexCount empty == 0
  19896. 1157.39 s [algebraic-graphs] OK: edgeCount empty == 0
  19897. 1157.39 s [algebraic-graphs]
  19898. 1157.39 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  19899. 1157.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19900. 1157.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19901. 1157.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19902. 1157.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19903. 1157.39 s [algebraic-graphs]
  19904. 1162.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  19905. 1162.99 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19906. 1162.99 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19907. 1162.99 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19908. 1162.99 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19909. 1162.99 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19910. 1162.99 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19911. 1162.99 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19912. 1162.99 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19913. 1162.99 s [algebraic-graphs]
  19914. 1162.99 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  19915. 1162.99 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19916. 1162.99 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19917. 1162.99 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19918. 1162.99 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19919. 1162.99 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19920. 1162.99 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19921. 1162.99 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19922. 1162.99 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19923. 1162.99 s [algebraic-graphs]
  19924. 1162.99 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19925. 1163.00 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19926. 1163.00 s [algebraic-graphs]
  19927. 1163.00 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19928. 1163.00 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19929. 1163.00 s [algebraic-graphs]
  19930. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  19931. 1163.00 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19932. 1163.00 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19933. 1163.00 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19934. 1163.00 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19935. 1163.00 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19936. 1163.00 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19937. 1163.00 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19938. 1163.00 s [algebraic-graphs]
  19939. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  19940. 1163.00 s [algebraic-graphs] OK: vertices [] == empty
  19941. 1163.00 s [algebraic-graphs] OK: vertices [x] == vertex x
  19942. 1163.00 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19943. 1163.00 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19944. 1163.00 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19945. 1163.00 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19946. 1163.00 s [algebraic-graphs]
  19947. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  19948. 1163.00 s [algebraic-graphs] OK: edges [] == empty
  19949. 1163.00 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19950. 1163.00 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19951. 1163.00 s [algebraic-graphs]
  19952. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  19953. 1163.00 s [algebraic-graphs] OK: overlays [] == empty
  19954. 1163.00 s [algebraic-graphs] OK: overlays [x] == x
  19955. 1163.00 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19956. 1163.00 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19957. 1163.00 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19958. 1163.00 s [algebraic-graphs]
  19959. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  19960. 1163.00 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  19961. 1163.00 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  19962. 1163.00 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  19963. 1163.00 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  19964. 1163.00 s [algebraic-graphs]
  19965. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  19966. 1163.00 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19967. 1163.00 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19968. 1163.00 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19969. 1163.00 s [algebraic-graphs]
  19970. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  19971. 1163.00 s [algebraic-graphs] OK: isEmpty empty == True
  19972. 1163.00 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19973. 1163.00 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19974. 1163.00 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19975. 1163.00 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19976. 1163.00 s [algebraic-graphs]
  19977. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  19978. 1163.00 s [algebraic-graphs] OK: hasVertex x empty == False
  19979. 1163.00 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19980. 1163.00 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19981. 1163.00 s [algebraic-graphs]
  19982. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  19983. 1163.00 s [algebraic-graphs] OK: hasEdge x y empty == False
  19984. 1163.00 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19985. 1163.00 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19986. 1163.00 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19987. 1163.00 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19988. 1163.00 s [algebraic-graphs]
  19989. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  19990. 1163.00 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19991. 1163.00 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19992. 1163.00 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19993. 1163.00 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19994. 1163.00 s [algebraic-graphs]
  19995. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  19996. 1163.00 s [algebraic-graphs] OK: vertexCount empty == 0
  19997. 1163.00 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19998. 1163.00 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19999. 1163.00 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20000. 1163.00 s [algebraic-graphs]
  20001. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  20002. 1163.00 s [algebraic-graphs] OK: edgeCount empty == 0
  20003. 1163.00 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20004. 1163.00 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  20005. 1163.00 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20006. 1163.00 s [algebraic-graphs]
  20007. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  20008. 1163.00 s [algebraic-graphs] OK: vertexList empty == []
  20009. 1163.00 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20010. 1163.00 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20011. 1163.00 s [algebraic-graphs]
  20012. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  20013. 1163.00 s [algebraic-graphs] OK: edgeList empty == []
  20014. 1163.00 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20015. 1163.00 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  20016. 1163.00 s [algebraic-graphs]
  20017. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  20018. 1163.00 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20019. 1163.00 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20020. 1163.00 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20021. 1163.00 s [algebraic-graphs]
  20022. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  20023. 1163.00 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20024. 1163.00 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20025. 1163.00 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  20026. 1163.00 s [algebraic-graphs]
  20027. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  20028. 1163.00 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20029. 1163.00 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20030. 1163.00 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  20031. 1163.00 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  20032. 1163.00 s [algebraic-graphs]
  20033. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  20034. 1163.00 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20035. 1163.00 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20036. 1163.00 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  20037. 1163.00 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  20038. 1163.00 s [algebraic-graphs]
  20039. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  20040. 1163.00 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  20041. 1163.00 s [algebraic-graphs]
  20042. 1163.00 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  20043. 1163.00 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20044. 1163.00 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20045. 1163.00 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  20046. 1163.01 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  20047. 1163.01 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20048. 1163.01 s [algebraic-graphs]
  20049. 1163.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  20050. 1163.01 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  20051. 1163.01 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20052. 1163.01 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20053. 1163.01 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20054. 1163.01 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20055. 1163.01 s [algebraic-graphs]
  20056. 1163.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  20057. 1163.01 s [algebraic-graphs] OK: replaceVertex x x == id
  20058. 1163.01 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20059. 1163.01 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  20060. 1163.01 s [algebraic-graphs]
  20061. 1163.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  20062. 1163.01 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  20063. 1163.01 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  20064. 1163.01 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  20065. 1163.01 s [algebraic-graphs]
  20066. 1163.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  20067. 1163.01 s [algebraic-graphs] OK: transpose empty == empty
  20068. 1163.01 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20069. 1163.01 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  20070. 1163.01 s [algebraic-graphs] OK: transpose . transpose == id
  20071. 1163.01 s [algebraic-graphs]
  20072. 1163.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  20073. 1163.01 s [algebraic-graphs] OK: gmap f empty == empty
  20074. 1163.01 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20075. 1163.01 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  20076. 1163.01 s [algebraic-graphs] OK: gmap id == id
  20077. 1163.01 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20078. 1163.01 s [algebraic-graphs]
  20079. 1163.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  20080. 1163.01 s [algebraic-graphs] OK: emap h empty == empty
  20081. 1163.01 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  20082. 1163.01 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  20083. 1163.01 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  20084. 1163.01 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  20085. 1163.01 s [algebraic-graphs] OK: emap id == id
  20086. 1163.01 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  20087. 1163.01 s [algebraic-graphs]
  20088. 1163.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  20089. 1163.01 s [algebraic-graphs] OK: induce (const True ) x == x
  20090. 1163.01 s [algebraic-graphs] OK: induce (const False) x == empty
  20091. 1163.01 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20092. 1163.01 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20093. 1163.01 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20094. 1163.01 s [algebraic-graphs]
  20095. 1163.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  20096. 1165.39 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20097. 1165.39 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20098. 1165.39 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20099. 1165.39 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20100. 1165.39 s [algebraic-graphs]
  20101. 1165.39 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  20102. 1165.39 s [algebraic-graphs] OK: closure empty == empty
  20103. 1165.39 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  20104. 1165.39 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  20105. 1165.39 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  20106. 1165.39 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20107. 1165.39 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20108. 1165.39 s [algebraic-graphs] OK: closure . closure == closure
  20109. 1165.39 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20110. 1165.39 s [algebraic-graphs]
  20111. 1165.39 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  20112. 1165.39 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20113. 1165.39 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  20114. 1165.39 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  20115. 1165.39 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  20116. 1165.39 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20117. 1165.39 s [algebraic-graphs]
  20118. 1165.39 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  20119. 1165.39 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20120. 1165.39 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20121. 1165.39 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  20122. 1165.39 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20123. 1165.39 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20124. 1165.39 s [algebraic-graphs]
  20125. 1165.39 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  20126. 1165.39 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20127. 1165.39 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20128. 1165.39 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  20129. 1165.39 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20130. 1165.39 s [algebraic-graphs]
  20131. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  20132. 1165.39 s [algebraic-graphs] OK: isEmpty empty == True
  20133. 1165.39 s [algebraic-graphs] OK: hasVertex x empty == False
  20134. 1165.39 s [algebraic-graphs] OK: vertexCount empty == 0
  20135. 1165.39 s [algebraic-graphs] OK: edgeCount empty == 0
  20136. 1165.39 s [algebraic-graphs]
  20137. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  20138. 1165.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20139. 1165.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20140. 1165.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20141. 1165.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20142. 1165.39 s [algebraic-graphs]
  20143. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  20144. 1165.39 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  20145. 1165.39 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  20146. 1165.39 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  20147. 1165.39 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  20148. 1165.39 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  20149. 1165.39 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  20150. 1165.39 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  20151. 1165.39 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  20152. 1165.39 s [algebraic-graphs]
  20153. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  20154. 1165.39 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20155. 1165.39 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20156. 1165.39 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20157. 1165.39 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20158. 1165.39 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20159. 1165.39 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20160. 1165.39 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20161. 1165.39 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20162. 1165.39 s [algebraic-graphs]
  20163. 1165.39 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  20164. 1165.39 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  20165. 1165.39 s [algebraic-graphs]
  20166. 1165.39 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  20167. 1165.39 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  20168. 1165.39 s [algebraic-graphs]
  20169. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  20170. 1165.39 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  20171. 1165.39 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  20172. 1165.39 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  20173. 1165.39 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  20174. 1165.39 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20175. 1165.39 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  20176. 1165.39 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  20177. 1165.39 s [algebraic-graphs]
  20178. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  20179. 1165.39 s [algebraic-graphs] OK: vertices [] == empty
  20180. 1165.39 s [algebraic-graphs] OK: vertices [x] == vertex x
  20181. 1165.39 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20182. 1165.39 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20183. 1165.39 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20184. 1165.39 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20185. 1165.39 s [algebraic-graphs]
  20186. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  20187. 1165.39 s [algebraic-graphs] OK: edges [] == empty
  20188. 1165.39 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  20189. 1165.39 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  20190. 1165.39 s [algebraic-graphs]
  20191. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  20192. 1165.39 s [algebraic-graphs] OK: overlays [] == empty
  20193. 1165.39 s [algebraic-graphs] OK: overlays [x] == x
  20194. 1165.39 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20195. 1165.39 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20196. 1165.39 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20197. 1165.39 s [algebraic-graphs]
  20198. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  20199. 1165.39 s [algebraic-graphs] OK: foldg empty vertex connect == id
  20200. 1165.39 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  20201. 1165.39 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  20202. 1165.39 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  20203. 1165.39 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  20204. 1165.39 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  20205. 1165.39 s [algebraic-graphs]
  20206. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  20207. 1165.39 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  20208. 1165.39 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  20209. 1165.39 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  20210. 1165.39 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  20211. 1165.39 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  20212. 1165.39 s [algebraic-graphs]
  20213. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  20214. 1165.39 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20215. 1165.39 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20216. 1165.39 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20217. 1165.39 s [algebraic-graphs]
  20218. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  20219. 1165.39 s [algebraic-graphs] OK: isEmpty empty == True
  20220. 1165.39 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20221. 1165.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20222. 1165.39 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20223. 1165.39 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  20224. 1165.39 s [algebraic-graphs]
  20225. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.size ============
  20226. 1165.39 s [algebraic-graphs] OK: size empty == 1
  20227. 1165.39 s [algebraic-graphs] OK: size (vertex x) == 1
  20228. 1165.39 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20229. 1165.39 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20230. 1165.39 s [algebraic-graphs] OK: size x >= 1
  20231. 1165.39 s [algebraic-graphs] OK: size x >= vertexCount x
  20232. 1165.39 s [algebraic-graphs]
  20233. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  20234. 1165.39 s [algebraic-graphs] OK: hasVertex x empty == False
  20235. 1165.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20236. 1165.39 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20237. 1165.39 s [algebraic-graphs]
  20238. 1165.39 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  20239. 1165.39 s [algebraic-graphs] OK: hasEdge x y empty == False
  20240. 1165.39 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20241. 1165.40 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  20242. 1165.40 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20243. 1165.40 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  20244. 1165.40 s [algebraic-graphs]
  20245. 1165.40 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  20246. 1165.40 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  20247. 1165.40 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  20248. 1165.40 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  20249. 1165.40 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  20250. 1165.40 s [algebraic-graphs]
  20251. 1165.40 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  20252. 1165.40 s [algebraic-graphs] OK: vertexCount empty == 0
  20253. 1165.40 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20254. 1165.40 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20255. 1165.40 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20256. 1165.40 s [algebraic-graphs]
  20257. 1165.40 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  20258. 1165.40 s [algebraic-graphs] OK: edgeCount empty == 0
  20259. 1165.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20260. 1165.40 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  20261. 1165.40 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20262. 1165.40 s [algebraic-graphs]
  20263. 1165.40 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  20264. 1165.40 s [algebraic-graphs] OK: vertexList empty == []
  20265. 1165.40 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20266. 1165.40 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20267. 1165.40 s [algebraic-graphs]
  20268. 1165.40 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  20269. 1165.40 s [algebraic-graphs] OK: edgeList empty == []
  20270. 1165.40 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20271. 1165.40 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  20272. 1165.40 s [algebraic-graphs]
  20273. 1165.40 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  20274. 1165.40 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20275. 1165.40 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20276. 1165.40 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20277. 1165.40 s [algebraic-graphs]
  20278. 1165.40 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  20279. 1165.40 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20280. 1165.40 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20281. 1165.40 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  20282. 1165.40 s [algebraic-graphs]
  20283. 1165.40 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  20284. 1165.40 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20285. 1165.40 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20286. 1174.17 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  20287. 1174.21 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  20288. 1174.21 s [algebraic-graphs]
  20289. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  20290. 1174.21 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20291. 1174.21 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20292. 1174.21 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  20293. 1174.21 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  20294. 1174.21 s [algebraic-graphs]
  20295. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  20296. 1174.21 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20297. 1174.21 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20298. 1174.21 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  20299. 1174.21 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  20300. 1174.21 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20301. 1174.21 s [algebraic-graphs]
  20302. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  20303. 1174.21 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  20304. 1174.21 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20305. 1174.21 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20306. 1174.21 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20307. 1174.21 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20308. 1174.21 s [algebraic-graphs]
  20309. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  20310. 1174.21 s [algebraic-graphs] OK: replaceVertex x x == id
  20311. 1174.21 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20312. 1174.21 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  20313. 1174.21 s [algebraic-graphs]
  20314. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  20315. 1174.21 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  20316. 1174.21 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  20317. 1174.21 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  20318. 1174.21 s [algebraic-graphs]
  20319. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  20320. 1174.21 s [algebraic-graphs] OK: transpose empty == empty
  20321. 1174.21 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20322. 1174.21 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  20323. 1174.21 s [algebraic-graphs] OK: transpose . transpose == id
  20324. 1174.21 s [algebraic-graphs]
  20325. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  20326. 1174.21 s [algebraic-graphs] OK: fmap f empty == empty
  20327. 1174.21 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  20328. 1174.21 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  20329. 1174.21 s [algebraic-graphs] OK: fmap id == id
  20330. 1174.21 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  20331. 1174.21 s [algebraic-graphs]
  20332. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  20333. 1174.21 s [algebraic-graphs] OK: emap h empty == empty
  20334. 1174.21 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  20335. 1174.21 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  20336. 1174.21 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  20337. 1174.21 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  20338. 1174.21 s [algebraic-graphs] OK: emap id == id
  20339. 1174.21 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  20340. 1174.21 s [algebraic-graphs]
  20341. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  20342. 1174.21 s [algebraic-graphs] OK: induce (const True ) x == x
  20343. 1174.21 s [algebraic-graphs] OK: induce (const False) x == empty
  20344. 1174.21 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20345. 1174.21 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20346. 1174.21 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20347. 1174.21 s [algebraic-graphs]
  20348. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  20349. 1174.21 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20350. 1174.21 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20351. 1174.21 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20352. 1174.21 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20353. 1174.21 s [algebraic-graphs]
  20354. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  20355. 1174.21 s [algebraic-graphs] OK: closure empty == empty
  20356. 1174.21 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  20357. 1174.21 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  20358. 1174.21 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  20359. 1174.21 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20360. 1174.21 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20361. 1174.21 s [algebraic-graphs] OK: closure . closure == closure
  20362. 1174.21 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20363. 1174.21 s [algebraic-graphs]
  20364. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  20365. 1174.21 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20366. 1174.21 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  20367. 1174.21 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  20368. 1174.21 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  20369. 1174.21 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20370. 1174.21 s [algebraic-graphs]
  20371. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  20372. 1174.21 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20373. 1174.21 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20374. 1174.21 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  20375. 1174.21 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20376. 1174.21 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20377. 1174.21 s [algebraic-graphs]
  20378. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  20379. 1174.21 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20380. 1174.21 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20381. 1174.21 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  20382. 1174.21 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20383. 1174.21 s [algebraic-graphs]
  20384. 1174.21 s [algebraic-graphs] ============ Labelled.Graph.context ============
  20385. 1174.21 s [algebraic-graphs] OK: context (const False) x == Nothing
  20386. 1174.21 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  20387. 1174.21 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  20388. 1174.21 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  20389. 1174.21 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  20390. 1174.21 s [algebraic-graphs]
  20391. 1174.21 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  20392. 1174.21 s [algebraic-graphs] OK: Axioms of non-empty graphs
  20393. 1174.21 s [algebraic-graphs] OK: Theorems of non-empty graphs
  20394. 1174.21 s [algebraic-graphs]
  20395. 1174.21 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  20396. 1174.21 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20397. 1174.21 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20398. 1174.21 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20399. 1174.21 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20400. 1174.21 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20401. 1174.21 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20402. 1174.21 s [algebraic-graphs] OK: x <= x + y
  20403. 1174.21 s [algebraic-graphs] OK: x + y <= x * y
  20404. 1174.21 s [algebraic-graphs]
  20405. 1174.21 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  20406. 1174.21 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  20407. 1174.21 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  20408. 1174.21 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  20409. 1174.21 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  20410. 1174.21 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  20411. 1174.21 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  20412. 1174.21 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  20413. 1174.21 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  20414. 1174.21 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  20415. 1174.21 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  20416. 1174.21 s [algebraic-graphs]
  20417. 1174.21 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  20418. 1174.21 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20419. 1174.21 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  20420. 1174.21 s [algebraic-graphs]
  20421. 1174.21 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  20422. 1174.21 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  20423. 1174.21 s [algebraic-graphs]
  20424. 1174.21 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  20425. 1174.21 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20426. 1174.21 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20427. 1174.21 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20428. 1174.21 s [algebraic-graphs]
  20429. 1174.21 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  20430. 1174.21 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20431. 1174.21 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20432. 1174.21 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20433. 1174.21 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20434. 1174.21 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20435. 1174.21 s [algebraic-graphs]
  20436. 1174.21 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  20437. 1174.21 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20438. 1174.21 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20439. 1174.22 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20440. 1174.22 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20441. 1174.22 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20442. 1174.22 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20443. 1174.22 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20444. 1174.22 s [algebraic-graphs]
  20445. 1174.22 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  20446. 1174.22 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20447. 1174.22 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20448. 1174.22 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20449. 1174.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20450. 1174.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20451. 1174.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20452. 1174.22 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20453. 1174.22 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20454. 1174.22 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20455. 1174.22 s [algebraic-graphs]
  20456. 1174.22 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  20457. 1174.22 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20458. 1174.22 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20459. 1174.22 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20460. 1174.22 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20461. 1174.22 s [algebraic-graphs]
  20462. 1174.22 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  20463. 1174.22 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20464. 1174.22 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20465. 1174.22 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20466. 1174.22 s [algebraic-graphs]
  20467. 1182.48 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  20468. 1182.48 s [algebraic-graphs] OK: overlays1 [x] == x
  20469. 1182.52 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20470. 1182.52 s [algebraic-graphs]
  20471. 1182.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  20472. 1182.52 s [algebraic-graphs] OK: connects1 [x] == x
  20473. 1182.52 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20474. 1182.52 s [algebraic-graphs]
  20475. 1182.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  20476. 1182.52 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20477. 1182.52 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20478. 1182.52 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20479. 1182.52 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20480. 1182.52 s [algebraic-graphs]
  20481. 1182.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  20482. 1182.52 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20483. 1182.52 s [algebraic-graphs]
  20484. 1182.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  20485. 1182.52 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20486. 1182.52 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20487. 1182.52 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20488. 1182.52 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20489. 1182.52 s [algebraic-graphs]
  20490. 1182.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  20491. 1182.52 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20492. 1182.52 s [algebraic-graphs] OK: vertexCount x >= 1
  20493. 1182.52 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20494. 1182.52 s [algebraic-graphs]
  20495. 1182.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  20496. 1182.52 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20497. 1182.52 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20498. 1182.52 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20499. 1182.52 s [algebraic-graphs]
  20500. 1182.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  20501. 1182.52 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20502. 1182.52 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20503. 1182.52 s [algebraic-graphs]
  20504. 1182.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  20505. 1182.52 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20506. 1182.52 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20507. 1182.52 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20508. 1182.53 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20509. 1182.53 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20510. 1182.53 s [algebraic-graphs]
  20511. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  20512. 1182.53 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20513. 1182.53 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20514. 1182.53 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20515. 1182.53 s [algebraic-graphs]
  20516. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  20517. 1182.53 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20518. 1182.53 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20519. 1182.53 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20520. 1182.53 s [algebraic-graphs]
  20521. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  20522. 1182.53 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20523. 1182.53 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20524. 1182.53 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20525. 1182.53 s [algebraic-graphs]
  20526. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  20527. 1182.53 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20528. 1182.53 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20529. 1182.53 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20530. 1182.53 s [algebraic-graphs]
  20531. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  20532. 1182.53 s [algebraic-graphs] OK: path1 [x] == vertex x
  20533. 1182.53 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20534. 1182.53 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20535. 1182.53 s [algebraic-graphs]
  20536. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  20537. 1182.53 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20538. 1182.53 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20539. 1182.53 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20540. 1182.53 s [algebraic-graphs]
  20541. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  20542. 1182.53 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20543. 1182.53 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20544. 1182.53 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20545. 1182.53 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20546. 1182.53 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20547. 1182.53 s [algebraic-graphs]
  20548. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  20549. 1182.53 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20550. 1182.53 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20551. 1182.53 s [algebraic-graphs]
  20552. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  20553. 1182.53 s [algebraic-graphs] OK: star x [] == vertex x
  20554. 1182.53 s [algebraic-graphs] OK: star x [y] == edge x y
  20555. 1182.53 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20556. 1182.53 s [algebraic-graphs]
  20557. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  20558. 1182.53 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20559. 1182.53 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20560. 1182.53 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20561. 1182.53 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20562. 1182.53 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20563. 1182.53 s [algebraic-graphs]
  20564. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  20565. 1182.53 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20566. 1182.53 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20567. 1182.53 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20568. 1182.53 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20569. 1182.53 s [algebraic-graphs]
  20570. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  20571. 1182.53 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20572. 1182.53 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20573. 1182.53 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20574. 1182.53 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20575. 1182.53 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20576. 1182.53 s [algebraic-graphs]
  20577. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  20578. 1182.53 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20579. 1182.53 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20580. 1182.53 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20581. 1182.53 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20582. 1182.53 s [algebraic-graphs]
  20583. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  20584. 1182.53 s [algebraic-graphs] OK: replaceVertex x x == id
  20585. 1182.53 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20586. 1182.53 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20587. 1182.53 s [algebraic-graphs]
  20588. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  20589. 1182.53 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20590. 1182.53 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20591. 1182.53 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20592. 1182.53 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20593. 1182.53 s [algebraic-graphs]
  20594. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  20595. 1182.53 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20596. 1182.53 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20597. 1182.53 s [algebraic-graphs] OK: transpose . transpose == id
  20598. 1182.53 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20599. 1182.53 s [algebraic-graphs]
  20600. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  20601. 1182.53 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20602. 1182.53 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20603. 1182.53 s [algebraic-graphs] OK: gmap id == id
  20604. 1182.53 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20605. 1182.53 s [algebraic-graphs]
  20606. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  20607. 1182.53 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20608. 1182.53 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20609. 1182.53 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20610. 1182.53 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20611. 1182.53 s [algebraic-graphs]
  20612. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  20613. 1182.53 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20614. 1182.53 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20615. 1182.53 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  20616. 1182.53 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  20617. 1182.53 s [algebraic-graphs]
  20618. 1182.53 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  20619. 1182.53 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20620. 1182.54 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20621. 1182.54 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20622. 1182.54 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  20623. 1182.54 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20624. 1182.54 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20625. 1182.54 s [algebraic-graphs] OK: closure . closure == closure
  20626. 1182.54 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20627. 1182.54 s [algebraic-graphs]
  20628. 1182.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  20629. 1182.54 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20630. 1182.54 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20631. 1182.54 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20632. 1182.54 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20633. 1182.54 s [algebraic-graphs]
  20634. 1182.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  20635. 1182.54 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20636. 1182.54 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  20637. 1182.54 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20638. 1182.54 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20639. 1182.54 s [algebraic-graphs]
  20640. 1182.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  20641. 1182.54 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20642. 1182.54 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20643. 1182.54 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  20644. 1182.54 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20645. 1182.54 s [algebraic-graphs]
  20646. 1182.54 s [algebraic-graphs] ============ NonEmpty.Graph.============
  20647. 1182.54 s [algebraic-graphs] OK: Axioms of non-empty graphs
  20648. 1182.54 s [algebraic-graphs] OK: Theorems of non-empty graphs
  20649. 1182.54 s [algebraic-graphs]
  20650. 1182.54 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  20651. 1182.54 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20652. 1182.54 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20653. 1182.54 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20654. 1182.54 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20655. 1182.54 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20656. 1182.54 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20657. 1182.54 s [algebraic-graphs] OK: x <= x + y
  20658. 1182.54 s [algebraic-graphs] OK: x + y <= x * y
  20659. 1182.54 s [algebraic-graphs]
  20660. 1182.54 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  20661. 1182.54 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  20662. 1182.54 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  20663. 1182.54 s [algebraic-graphs] OK: fmap id == id
  20664. 1182.54 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  20665. 1182.54 s [algebraic-graphs]
  20666. 1182.54 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  20667. 1182.54 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  20668. 1186.16 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  20669. 1186.16 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  20670. 1186.16 s [algebraic-graphs] OK: (x >>= vertex) == x
  20671. 1186.16 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  20672. 1186.16 s [algebraic-graphs]
  20673. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  20674. 1186.16 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20675. 1186.16 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  20676. 1186.16 s [algebraic-graphs]
  20677. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  20678. 1186.16 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20679. 1186.16 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20680. 1186.16 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20681. 1186.16 s [algebraic-graphs] OK: size (vertex x) == 1
  20682. 1186.16 s [algebraic-graphs]
  20683. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  20684. 1186.16 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20685. 1186.16 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20686. 1186.16 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20687. 1186.16 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20688. 1186.16 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20689. 1186.16 s [algebraic-graphs]
  20690. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  20691. 1186.16 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20692. 1186.16 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20693. 1186.16 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20694. 1186.16 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20695. 1186.16 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20696. 1186.16 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20697. 1186.16 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20698. 1186.16 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20699. 1186.16 s [algebraic-graphs]
  20700. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  20701. 1186.16 s [algebraic-graphs] OK: overlay1 empty x == x
  20702. 1186.16 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  20703. 1186.16 s [algebraic-graphs]
  20704. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  20705. 1186.16 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20706. 1186.16 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20707. 1186.16 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20708. 1186.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20709. 1186.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20710. 1186.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20711. 1186.16 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20712. 1186.16 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20713. 1186.16 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20714. 1186.16 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20715. 1186.16 s [algebraic-graphs]
  20716. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  20717. 1186.16 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20718. 1186.16 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20719. 1186.16 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20720. 1186.16 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20721. 1186.16 s [algebraic-graphs]
  20722. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  20723. 1186.16 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20724. 1186.16 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20725. 1186.16 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20726. 1186.16 s [algebraic-graphs]
  20727. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  20728. 1186.16 s [algebraic-graphs] OK: overlays1 [x] == x
  20729. 1186.16 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20730. 1186.16 s [algebraic-graphs]
  20731. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  20732. 1186.16 s [algebraic-graphs] OK: connects1 [x] == x
  20733. 1186.16 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20734. 1186.16 s [algebraic-graphs]
  20735. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  20736. 1186.16 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  20737. 1186.16 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  20738. 1186.16 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  20739. 1186.16 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  20740. 1186.16 s [algebraic-graphs]
  20741. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  20742. 1186.16 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20743. 1186.16 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20744. 1186.16 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20745. 1186.16 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20746. 1186.16 s [algebraic-graphs]
  20747. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  20748. 1186.16 s [algebraic-graphs] OK: x === x == True
  20749. 1186.16 s [algebraic-graphs] OK: x + y === x + y == True
  20750. 1186.16 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  20751. 1186.16 s [algebraic-graphs] OK: x + y === x * y == False
  20752. 1186.16 s [algebraic-graphs]
  20753. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  20754. 1186.16 s [algebraic-graphs] OK: size (vertex x) == 1
  20755. 1186.16 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20756. 1186.16 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20757. 1186.16 s [algebraic-graphs] OK: size x >= 1
  20758. 1186.16 s [algebraic-graphs] OK: size x >= vertexCount x
  20759. 1186.16 s [algebraic-graphs]
  20760. 1186.16 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  20761. 1186.16 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20762. 1186.17 s [algebraic-graphs]
  20763. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  20764. 1186.17 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20765. 1186.17 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20766. 1186.17 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20767. 1186.17 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20768. 1186.17 s [algebraic-graphs]
  20769. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  20770. 1186.17 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20771. 1186.17 s [algebraic-graphs] OK: vertexCount x >= 1
  20772. 1186.17 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20773. 1186.17 s [algebraic-graphs]
  20774. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  20775. 1186.17 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20776. 1186.17 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20777. 1186.17 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20778. 1186.17 s [algebraic-graphs]
  20779. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  20780. 1186.17 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20781. 1186.17 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20782. 1186.17 s [algebraic-graphs]
  20783. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  20784. 1186.17 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20785. 1186.17 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20786. 1186.17 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20787. 1186.17 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20788. 1186.17 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20789. 1186.17 s [algebraic-graphs]
  20790. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  20791. 1186.17 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20792. 1186.17 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20793. 1186.17 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20794. 1186.17 s [algebraic-graphs]
  20795. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  20796. 1186.17 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20797. 1186.17 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20798. 1186.17 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20799. 1186.17 s [algebraic-graphs]
  20800. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  20801. 1186.17 s [algebraic-graphs] OK: path1 [x] == vertex x
  20802. 1186.17 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20803. 1186.17 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20804. 1186.17 s [algebraic-graphs]
  20805. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  20806. 1186.17 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20807. 1186.17 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20808. 1186.17 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20809. 1186.17 s [algebraic-graphs]
  20810. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  20811. 1186.17 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20812. 1186.17 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20813. 1186.17 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20814. 1186.17 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20815. 1186.17 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20816. 1186.17 s [algebraic-graphs]
  20817. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  20818. 1186.17 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20819. 1186.17 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20820. 1186.17 s [algebraic-graphs]
  20821. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  20822. 1186.17 s [algebraic-graphs] OK: star x [] == vertex x
  20823. 1186.17 s [algebraic-graphs] OK: star x [y] == edge x y
  20824. 1186.17 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20825. 1186.17 s [algebraic-graphs]
  20826. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  20827. 1186.17 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20828. 1186.17 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20829. 1186.17 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20830. 1186.17 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20831. 1186.17 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20832. 1186.17 s [algebraic-graphs]
  20833. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  20834. 1186.17 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20835. 1186.17 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20836. 1186.17 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20837. 1186.17 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20838. 1186.17 s [algebraic-graphs]
  20839. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  20840. 1186.17 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  20841. 1186.17 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  20842. 1186.17 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  20843. 1186.17 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  20844. 1186.17 s [algebraic-graphs]
  20845. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  20846. 1186.17 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  20847. 1186.17 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  20848. 1186.17 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  20849. 1186.17 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  20850. 1186.17 s [algebraic-graphs]
  20851. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  20852. 1186.17 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20853. 1186.17 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20854. 1186.17 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20855. 1186.17 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20856. 1186.17 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20857. 1186.17 s [algebraic-graphs]
  20858. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  20859. 1186.17 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20860. 1186.17 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20861. 1186.17 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20862. 1186.17 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20863. 1186.17 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  20864. 1186.17 s [algebraic-graphs]
  20865. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  20866. 1186.17 s [algebraic-graphs] OK: replaceVertex x x == id
  20867. 1186.17 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20868. 1186.17 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20869. 1186.17 s [algebraic-graphs]
  20870. 1186.17 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  20871. 1186.17 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20872. 1201.43 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20873. 1201.43 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20874. 1201.58 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20875. 1201.58 s [algebraic-graphs]
  20876. 1201.58 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  20877. 1201.58 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  20878. 1201.58 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  20879. 1201.58 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  20880. 1201.58 s [algebraic-graphs]
  20881. 1201.58 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  20882. 1201.58 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20883. 1201.58 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20884. 1201.58 s [algebraic-graphs] OK: transpose . transpose == id
  20885. 1201.58 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20886. 1201.58 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20887. 1201.58 s [algebraic-graphs]
  20888. 1201.58 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  20889. 1201.58 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20890. 1201.58 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20891. 1201.58 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20892. 1201.58 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20893. 1201.58 s [algebraic-graphs]
  20894. 1201.58 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  20895. 1201.58 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20896. 1201.58 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20897. 1201.58 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  20898. 1201.58 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  20899. 1201.58 s [algebraic-graphs]
  20900. 1201.58 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  20901. 1201.58 s [algebraic-graphs] OK: simplify == id
  20902. 1201.58 s [algebraic-graphs] OK: size (simplify x) <= size x
  20903. 1201.58 s [algebraic-graphs] OK: simplify 1 === 1
  20904. 1201.58 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  20905. 1201.58 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  20906. 1201.58 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  20907. 1201.58 s [algebraic-graphs]
  20908. 1201.58 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  20909. 1201.58 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  20910. 1201.58 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  20911. 1201.58 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  20912. 1201.58 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  20913. 1201.58 s [algebraic-graphs]
  20914. 1201.58 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  20915. 1201.58 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  20916. 1201.58 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  20917. 1201.58 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  20918. 1201.58 s [algebraic-graphs]
  20919. 1201.58 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  20920. 1201.58 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  20921. 1201.58 s [algebraic-graphs] OK: box x y ~~ box y x
  20922. 1201.58 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20923. 1201.58 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20924. 1201.58 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20925. 1201.58 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20926. 1201.58 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20927. 1201.58 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20928. 1201.58 s [algebraic-graphs]
  20929. 1201.58 s [algebraic-graphs] ============ Relation ============
  20930. 1201.58 s [algebraic-graphs] OK: Axioms of graphs
  20931. 1201.58 s [algebraic-graphs]
  20932. 1201.58 s [algebraic-graphs] ============ Relation.consistent ============
  20933. 1201.58 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20934. 1201.58 s [algebraic-graphs]
  20935. 1201.58 s [algebraic-graphs] OK: consistent empty == True
  20936. 1201.58 s [algebraic-graphs] OK: consistent (vertex x) == True
  20937. 1201.58 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20938. 1201.58 s [algebraic-graphs] OK: consistent (connect x y) == True
  20939. 1201.58 s [algebraic-graphs] OK: consistent (edge x y) == True
  20940. 1201.58 s [algebraic-graphs] OK: consistent (edges xs) == True
  20941. 1201.58 s [algebraic-graphs] OK: consistent (stars xs) == True
  20942. 1201.58 s [algebraic-graphs]
  20943. 1201.58 s [algebraic-graphs] ============ Relation.Show ============
  20944. 1201.58 s [algebraic-graphs] OK: show (empty ) == "empty"
  20945. 1201.58 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20946. 1201.58 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20947. 1201.58 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20948. 1201.58 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20949. 1201.58 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20950. 1201.59 s [algebraic-graphs]
  20951. 1201.59 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20952. 1201.59 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20953. 1201.59 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20954. 1201.59 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20955. 1201.59 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20956. 1201.59 s [algebraic-graphs]
  20957. 1201.59 s [algebraic-graphs] ============ Relation.Ord ============
  20958. 1201.59 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20959. 1201.59 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20960. 1201.59 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20961. 1201.59 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20962. 1201.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20963. 1201.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20964. 1201.59 s [algebraic-graphs] OK: x <= x + y
  20965. 1201.59 s [algebraic-graphs] OK: x + y <= x * y
  20966. 1201.59 s [algebraic-graphs]
  20967. 1201.59 s [algebraic-graphs] ============ Relation.empty ============
  20968. 1201.59 s [algebraic-graphs] OK: isEmpty empty == True
  20969. 1201.59 s [algebraic-graphs] OK: hasVertex x empty == False
  20970. 1201.59 s [algebraic-graphs] OK: vertexCount empty == 0
  20971. 1201.59 s [algebraic-graphs] OK: edgeCount empty == 0
  20972. 1201.59 s [algebraic-graphs]
  20973. 1201.59 s [algebraic-graphs] ============ Relation.vertex ============
  20974. 1201.59 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20975. 1201.59 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20976. 1201.59 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20977. 1201.59 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20978. 1201.59 s [algebraic-graphs]
  20979. 1201.59 s [algebraic-graphs] ============ Relation.edge ============
  20980. 1201.59 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20981. 1201.59 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20982. 1201.59 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20983. 1201.59 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20984. 1201.59 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20985. 1201.59 s [algebraic-graphs]
  20986. 1201.59 s [algebraic-graphs] ============ Relation.overlay ============
  20987. 1201.59 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20988. 1201.59 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20989. 1201.59 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20990. 1201.59 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20991. 1201.59 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20992. 1201.59 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20993. 1201.59 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20994. 1201.59 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20995. 1201.59 s [algebraic-graphs]
  20996. 1201.59 s [algebraic-graphs] ============ Relation.connect ============
  20997. 1201.59 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20998. 1201.59 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20999. 1201.59 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21000. 1201.59 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21001. 1201.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21002. 1201.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21003. 1201.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21004. 1201.59 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21005. 1201.59 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21006. 1201.59 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21007. 1201.59 s [algebraic-graphs]
  21008. 1201.59 s [algebraic-graphs] ============ Relation.vertices ============
  21009. 1201.59 s [algebraic-graphs] OK: vertices [] == empty
  21010. 1201.59 s [algebraic-graphs] OK: vertices [x] == vertex x
  21011. 1201.59 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21012. 1201.59 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21013. 1201.59 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21014. 1201.59 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21015. 1201.59 s [algebraic-graphs]
  21016. 1201.59 s [algebraic-graphs] ============ Relation.edges ============
  21017. 1201.59 s [algebraic-graphs] OK: edges [] == empty
  21018. 1201.59 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21019. 1201.59 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21020. 1201.59 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21021. 1201.59 s [algebraic-graphs]
  21022. 1201.59 s [algebraic-graphs] ============ Relation.overlays ============
  21023. 1201.59 s [algebraic-graphs] OK: overlays [] == empty
  21024. 1201.59 s [algebraic-graphs] OK: overlays [x] == x
  21025. 1201.59 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21026. 1201.59 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21027. 1201.59 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21028. 1201.59 s [algebraic-graphs]
  21029. 1201.59 s [algebraic-graphs] ============ Relation.connects ============
  21030. 1201.59 s [algebraic-graphs] OK: connects [] == empty
  21031. 1201.59 s [algebraic-graphs] OK: connects [x] == x
  21032. 1201.59 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21033. 1201.59 s [algebraic-graphs] OK: connects == foldr connect empty
  21034. 1201.59 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21035. 1201.59 s [algebraic-graphs]
  21036. 1201.59 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  21037. 1201.59 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21038. 1201.59 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21039. 1201.59 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21040. 1201.59 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21041. 1201.59 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21042. 1201.59 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21043. 1201.59 s [algebraic-graphs]
  21044. 1201.59 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  21045. 1201.59 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21046. 1201.59 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21047. 1201.59 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21048. 1201.59 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21049. 1201.59 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21050. 1201.59 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21051. 1201.59 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21052. 1201.59 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21053. 1201.59 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21054. 1201.59 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21055. 1201.59 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21056. 1201.59 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21057. 1201.59 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21058. 1201.59 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21059. 1201.59 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21060. 1201.59 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21061. 1201.59 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21062. 1205.42 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21063. 1205.42 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21064. 1205.42 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21065. 1205.42 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21066. 1205.42 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21067. 1205.42 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21068. 1205.42 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21069. 1205.42 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21070. 1205.42 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21071. 1205.42 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21072. 1205.42 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21073. 1205.42 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21074. 1205.42 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21075. 1205.42 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21076. 1205.42 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21077. 1205.42 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21078. 1205.42 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21079. 1205.42 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21080. 1205.42 s [algebraic-graphs]
  21081. 1205.42 s [algebraic-graphs] ============ Relation.foldg ============
  21082. 1205.42 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21083. 1205.42 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21084. 1205.42 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21085. 1205.42 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21086. 1205.42 s [algebraic-graphs]
  21087. 1205.42 s [algebraic-graphs] ============ Relation.isEmpty ============
  21088. 1205.42 s [algebraic-graphs] OK: isEmpty empty == True
  21089. 1205.42 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21090. 1205.42 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21091. 1205.43 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21092. 1205.43 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21093. 1205.43 s [algebraic-graphs]
  21094. 1205.43 s [algebraic-graphs] ============ Relation.hasVertex ============
  21095. 1205.43 s [algebraic-graphs] OK: hasVertex x empty == False
  21096. 1205.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21097. 1205.43 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21098. 1205.43 s [algebraic-graphs]
  21099. 1205.43 s [algebraic-graphs] ============ Relation.hasEdge ============
  21100. 1205.43 s [algebraic-graphs] OK: hasEdge x y empty == False
  21101. 1205.43 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21102. 1205.43 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21103. 1205.43 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21104. 1205.43 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21105. 1205.43 s [algebraic-graphs]
  21106. 1205.43 s [algebraic-graphs] ============ Relation.vertexCount ============
  21107. 1205.43 s [algebraic-graphs] OK: vertexCount empty == 0
  21108. 1205.43 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21109. 1205.43 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21110. 1205.43 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21111. 1205.43 s [algebraic-graphs]
  21112. 1205.43 s [algebraic-graphs] ============ Relation.edgeCount ============
  21113. 1205.43 s [algebraic-graphs] OK: edgeCount empty == 0
  21114. 1205.43 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21115. 1205.43 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21116. 1205.43 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21117. 1205.43 s [algebraic-graphs]
  21118. 1205.43 s [algebraic-graphs] ============ Relation.vertexList ============
  21119. 1205.43 s [algebraic-graphs] OK: vertexList empty == []
  21120. 1205.43 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21121. 1205.43 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21122. 1205.43 s [algebraic-graphs]
  21123. 1205.43 s [algebraic-graphs] ============ Relation.vertexSet ============
  21124. 1205.43 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21125. 1205.43 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21126. 1205.43 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21127. 1205.43 s [algebraic-graphs]
  21128. 1205.43 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  21129. 1205.43 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21130. 1205.43 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21131. 1205.43 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21132. 1205.43 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21133. 1205.43 s [algebraic-graphs]
  21134. 1205.43 s [algebraic-graphs] ============ Relation.edgeList ============
  21135. 1205.43 s [algebraic-graphs] OK: edgeList empty == []
  21136. 1205.43 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21137. 1205.43 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21138. 1205.43 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21139. 1205.43 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21140. 1205.43 s [algebraic-graphs]
  21141. 1205.43 s [algebraic-graphs] ============ Relation.edgeSet ============
  21142. 1205.43 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21143. 1205.43 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21144. 1205.43 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21145. 1205.43 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21146. 1205.43 s [algebraic-graphs]
  21147. 1205.43 s [algebraic-graphs] ============ Relation.adjacencyList ============
  21148. 1205.43 s [algebraic-graphs] OK: adjacencyList empty == []
  21149. 1205.43 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21150. 1205.43 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21151. 1205.43 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21152. 1205.43 s [algebraic-graphs]
  21153. 1205.43 s [algebraic-graphs] ============ Relation.preSet ============
  21154. 1205.43 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21155. 1205.43 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21156. 1205.43 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21157. 1205.43 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21158. 1205.43 s [algebraic-graphs]
  21159. 1205.43 s [algebraic-graphs] ============ Relation.preIntSet ============
  21160. 1205.43 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21161. 1205.43 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21162. 1205.43 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21163. 1205.43 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21164. 1205.43 s [algebraic-graphs]
  21165. 1205.43 s [algebraic-graphs] ============ Relation.postSet ============
  21166. 1205.43 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21167. 1205.43 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21168. 1205.43 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21169. 1205.43 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21170. 1205.43 s [algebraic-graphs]
  21171. 1205.43 s [algebraic-graphs] ============ Relation.postIntSet ============
  21172. 1205.43 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21173. 1205.43 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21174. 1205.43 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21175. 1205.43 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21176. 1205.43 s [algebraic-graphs]
  21177. 1205.43 s [algebraic-graphs] ============ Relation.path ============
  21178. 1205.43 s [algebraic-graphs] OK: path [] == empty
  21179. 1205.43 s [algebraic-graphs] OK: path [x] == vertex x
  21180. 1205.43 s [algebraic-graphs] OK: path [x,y] == edge x y
  21181. 1205.43 s [algebraic-graphs]
  21182. 1205.43 s [algebraic-graphs] ============ Relation.circuit ============
  21183. 1205.43 s [algebraic-graphs] OK: circuit [] == empty
  21184. 1205.43 s [algebraic-graphs] OK: circuit [x] == edge x x
  21185. 1205.43 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21186. 1205.43 s [algebraic-graphs]
  21187. 1205.43 s [algebraic-graphs] ============ Relation.clique ============
  21188. 1205.43 s [algebraic-graphs] OK: clique [] == empty
  21189. 1205.43 s [algebraic-graphs] OK: clique [x] == vertex x
  21190. 1205.43 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21191. 1205.43 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21192. 1205.43 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21193. 1205.43 s [algebraic-graphs]
  21194. 1205.43 s [algebraic-graphs] ============ Relation.biclique ============
  21195. 1205.43 s [algebraic-graphs] OK: biclique [] [] == empty
  21196. 1205.43 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21197. 1205.43 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21198. 1205.43 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21199. 1205.43 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21200. 1205.43 s [algebraic-graphs]
  21201. 1205.43 s [algebraic-graphs] ============ Relation.star ============
  21202. 1205.43 s [algebraic-graphs] OK: star x [] == vertex x
  21203. 1205.43 s [algebraic-graphs] OK: star x [y] == edge x y
  21204. 1205.43 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21205. 1205.43 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21206. 1205.43 s [algebraic-graphs]
  21207. 1205.43 s [algebraic-graphs] ============ Relation.stars ============
  21208. 1205.43 s [algebraic-graphs] OK: stars [] == empty
  21209. 1205.43 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21210. 1205.43 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21211. 1205.43 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21212. 1205.43 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21213. 1205.43 s [algebraic-graphs] OK: stars . adjacencyList == id
  21214. 1205.43 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21215. 1205.43 s [algebraic-graphs]
  21216. 1205.43 s [algebraic-graphs] ============ Relation.tree ============
  21217. 1205.43 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21218. 1205.43 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21219. 1205.43 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21220. 1205.43 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21221. 1205.43 s [algebraic-graphs]
  21222. 1205.43 s [algebraic-graphs] ============ Relation.forest ============
  21223. 1205.43 s [algebraic-graphs] OK: forest [] == empty
  21224. 1205.43 s [algebraic-graphs] OK: forest [x] == tree x
  21225. 1205.43 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21226. 1205.43 s [algebraic-graphs] OK: forest == overlays . map tree
  21227. 1205.43 s [algebraic-graphs]
  21228. 1205.43 s [algebraic-graphs] ============ Relation.removeVertex ============
  21229. 1205.43 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21230. 1205.43 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21231. 1205.43 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21232. 1205.43 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21233. 1205.43 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21234. 1205.43 s [algebraic-graphs]
  21235. 1205.43 s [algebraic-graphs] ============ Relation.removeEdge ============
  21236. 1205.43 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21237. 1205.43 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21238. 1205.43 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21239. 1205.43 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21240. 1205.43 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21241. 1205.43 s [algebraic-graphs]
  21242. 1205.43 s [algebraic-graphs] ============ Relation.replaceVertex ============
  21243. 1205.43 s [algebraic-graphs] OK: replaceVertex x x == id
  21244. 1205.43 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21245. 1205.43 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21246. 1205.43 s [algebraic-graphs]
  21247. 1205.43 s [algebraic-graphs] ============ Relation.mergeVertices ============
  21248. 1205.43 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21249. 1250.14 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21250. 1250.14 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21251. 1250.17 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21252. 1250.17 s [algebraic-graphs]
  21253. 1250.17 s [algebraic-graphs] ============ Relation.transpose ============
  21254. 1250.17 s [algebraic-graphs] OK: transpose empty == empty
  21255. 1250.17 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21256. 1250.17 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21257. 1250.17 s [algebraic-graphs] OK: transpose . transpose == id
  21258. 1250.17 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21259. 1250.18 s [algebraic-graphs]
  21260. 1250.18 s [algebraic-graphs] ============ Relation.gmap ============
  21261. 1250.18 s [algebraic-graphs] OK: gmap f empty == empty
  21262. 1250.18 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21263. 1250.18 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21264. 1250.18 s [algebraic-graphs] OK: gmap id == id
  21265. 1250.18 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21266. 1250.18 s [algebraic-graphs]
  21267. 1250.18 s [algebraic-graphs] ============ Relation.induce ============
  21268. 1250.18 s [algebraic-graphs] OK: induce (const True ) x == x
  21269. 1250.18 s [algebraic-graphs] OK: induce (const False) x == empty
  21270. 1250.18 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21271. 1250.18 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21272. 1250.18 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21273. 1250.18 s [algebraic-graphs]
  21274. 1250.18 s [algebraic-graphs] ============ Relation.compose ============
  21275. 1250.18 s [algebraic-graphs] OK: compose empty x == empty
  21276. 1250.18 s [algebraic-graphs] OK: compose x empty == empty
  21277. 1250.18 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21278. 1250.18 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21279. 1250.18 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21280. 1250.18 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21281. 1250.18 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21282. 1250.18 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21283. 1250.18 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21284. 1250.18 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21285. 1250.18 s [algebraic-graphs]
  21286. 1250.18 s [algebraic-graphs] ============ Relation.closure ============
  21287. 1250.18 s [algebraic-graphs] OK: closure empty == empty
  21288. 1250.18 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  21289. 1250.18 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  21290. 1250.18 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21291. 1250.18 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  21292. 1250.18 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  21293. 1250.18 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  21294. 1250.18 s [algebraic-graphs] OK: closure . closure == closure
  21295. 1250.18 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  21296. 1250.18 s [algebraic-graphs]
  21297. 1250.18 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  21298. 1250.18 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  21299. 1250.18 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  21300. 1250.18 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  21301. 1250.18 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21302. 1250.18 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  21303. 1250.18 s [algebraic-graphs]
  21304. 1250.18 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  21305. 1250.18 s [algebraic-graphs] OK: symmetricClosure empty == empty
  21306. 1250.18 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  21307. 1250.18 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  21308. 1250.18 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  21309. 1250.18 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  21310. 1250.18 s [algebraic-graphs]
  21311. 1250.18 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  21312. 1250.18 s [algebraic-graphs] OK: transitiveClosure empty == empty
  21313. 1250.18 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  21314. 1250.18 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  21315. 1250.18 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  21316. 1250.18 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  21317. 1250.18 s [algebraic-graphs]
  21318. 1250.18 s [algebraic-graphs] ============ Relation.induceJust ============
  21319. 1250.18 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21320. 1250.18 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21321. 1250.18 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21322. 1250.18 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21323. 1250.18 s [algebraic-graphs]
  21324. 1250.18 s [algebraic-graphs] ============ ReflexiveRelation ============
  21325. 1250.18 s [algebraic-graphs] OK: Axioms of reflexive graphs
  21326. 1250.18 s [algebraic-graphs]
  21327. 1250.18 s [algebraic-graphs] ============ TransitiveRelation ============
  21328. 1250.18 s [algebraic-graphs] OK: Axioms of transitive graphs
  21329. 1250.18 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  21330. 1250.18 s [algebraic-graphs]
  21331. 1250.18 s [algebraic-graphs] ============ PreorderRelation ============
  21332. 1250.18 s [algebraic-graphs] OK: Axioms of preorder graphs
  21333. 1250.18 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  21334. 1250.18 s [algebraic-graphs]
  21335. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation ============
  21336. 1250.18 s [algebraic-graphs] OK: Axioms of undirected graphs
  21337. 1250.18 s [algebraic-graphs]
  21338. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  21339. 1250.18 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  21340. 1250.18 s [algebraic-graphs]
  21341. 1250.18 s [algebraic-graphs] OK: consistent empty == True
  21342. 1250.18 s [algebraic-graphs] OK: consistent (vertex x) == True
  21343. 1250.18 s [algebraic-graphs] OK: consistent (overlay x y) == True
  21344. 1250.18 s [algebraic-graphs] OK: consistent (connect x y) == True
  21345. 1250.18 s [algebraic-graphs] OK: consistent (edge x y) == True
  21346. 1250.18 s [algebraic-graphs] OK: consistent (edges xs) == True
  21347. 1250.18 s [algebraic-graphs] OK: consistent (stars xs) == True
  21348. 1250.18 s [algebraic-graphs]
  21349. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  21350. 1250.18 s [algebraic-graphs] OK: show (empty ) == "empty"
  21351. 1250.18 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  21352. 1250.18 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  21353. 1250.18 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  21354. 1250.18 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  21355. 1250.18 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  21356. 1250.18 s [algebraic-graphs]
  21357. 1250.18 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  21358. 1250.18 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  21359. 1250.18 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  21360. 1250.18 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  21361. 1250.18 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  21362. 1250.18 s [algebraic-graphs]
  21363. 1250.18 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  21364. 1250.18 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  21365. 1250.18 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  21366. 1250.18 s [algebraic-graphs]
  21367. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  21368. 1250.18 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  21369. 1250.18 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  21370. 1250.18 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  21371. 1250.18 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  21372. 1250.18 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  21373. 1250.18 s [algebraic-graphs]
  21374. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  21375. 1250.18 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  21376. 1250.18 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  21377. 1250.18 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  21378. 1250.18 s [algebraic-graphs]
  21379. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  21380. 1250.18 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21381. 1250.18 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21382. 1250.18 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21383. 1250.18 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21384. 1250.18 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21385. 1250.18 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21386. 1250.18 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21387. 1250.18 s [algebraic-graphs] OK: x <= x + y
  21388. 1250.18 s [algebraic-graphs] OK: x + y <= x * y
  21389. 1250.18 s [algebraic-graphs]
  21390. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  21391. 1250.18 s [algebraic-graphs] OK: isEmpty empty == True
  21392. 1250.18 s [algebraic-graphs] OK: hasVertex x empty == False
  21393. 1250.18 s [algebraic-graphs] OK: vertexCount empty == 0
  21394. 1250.18 s [algebraic-graphs] OK: edgeCount empty == 0
  21395. 1250.18 s [algebraic-graphs]
  21396. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  21397. 1250.18 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21398. 1250.18 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21399. 1250.18 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21400. 1250.18 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21401. 1250.18 s [algebraic-graphs]
  21402. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  21403. 1250.18 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21404. 1250.18 s [algebraic-graphs] OK: edge x y == edge y x
  21405. 1250.18 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21406. 1250.18 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21407. 1250.18 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21408. 1250.18 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21409. 1250.18 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21410. 1250.18 s [algebraic-graphs]
  21411. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  21412. 1250.18 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21413. 1250.18 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21414. 1250.18 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21415. 1250.18 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21416. 1250.18 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21417. 1250.18 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21418. 1250.18 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21419. 1250.18 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21420. 1250.18 s [algebraic-graphs]
  21421. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  21422. 1250.18 s [algebraic-graphs] OK: connect x y == connect y x
  21423. 1250.18 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21424. 1250.18 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21425. 1250.18 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21426. 1250.18 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21427. 1250.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21428. 1250.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21429. 1250.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21430. 1250.18 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21431. 1250.18 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21432. 1250.18 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21433. 1250.18 s [algebraic-graphs]
  21434. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  21435. 1250.18 s [algebraic-graphs] OK: vertices [] == empty
  21436. 1250.18 s [algebraic-graphs] OK: vertices [x] == vertex x
  21437. 1250.18 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21438. 1250.18 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21439. 1250.18 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21440. 1250.18 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21441. 1250.18 s [algebraic-graphs]
  21442. 1250.18 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  21443. 1250.18 s [algebraic-graphs] OK: edges [] == empty
  21444. 1250.18 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21445. 1250.19 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21446. 1250.19 s [algebraic-graphs]
  21447. 1250.19 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  21448. 1250.19 s [algebraic-graphs] OK: overlays [] == empty
  21449. 1274.26 s [algebraic-graphs] OK: overlays [x] == x
  21450. 1274.30 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21451. 1274.30 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21452. 1274.30 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21453. 1274.30 s [algebraic-graphs]
  21454. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  21455. 1274.30 s [algebraic-graphs] OK: connects [] == empty
  21456. 1274.30 s [algebraic-graphs] OK: connects [x] == x
  21457. 1274.30 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21458. 1274.30 s [algebraic-graphs] OK: connects == foldr connect empty
  21459. 1274.30 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21460. 1274.30 s [algebraic-graphs] OK: connects == connects . reverse
  21461. 1274.30 s [algebraic-graphs]
  21462. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  21463. 1274.30 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21464. 1274.30 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21465. 1274.30 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21466. 1274.30 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21467. 1274.30 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21468. 1274.30 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21469. 1274.30 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21470. 1274.30 s [algebraic-graphs]
  21471. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  21472. 1274.30 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21473. 1274.30 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21474. 1274.30 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21475. 1274.30 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21476. 1274.30 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21477. 1274.30 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21478. 1274.30 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21479. 1274.30 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21480. 1274.30 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21481. 1274.30 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21482. 1274.30 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21483. 1274.30 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21484. 1274.30 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21485. 1274.30 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21486. 1274.30 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21487. 1274.30 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21488. 1274.30 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21489. 1274.30 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21490. 1274.30 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21491. 1274.30 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21492. 1274.30 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21493. 1274.30 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21494. 1274.30 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21495. 1274.30 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21496. 1274.30 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21497. 1274.30 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21498. 1274.30 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21499. 1274.30 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21500. 1274.30 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21501. 1274.30 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21502. 1274.30 s [algebraic-graphs]
  21503. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  21504. 1274.30 s [algebraic-graphs] OK: isEmpty empty == True
  21505. 1274.30 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21506. 1274.30 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21507. 1274.30 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21508. 1274.30 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21509. 1274.30 s [algebraic-graphs]
  21510. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  21511. 1274.30 s [algebraic-graphs] OK: hasVertex x empty == False
  21512. 1274.30 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21513. 1274.30 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21514. 1274.30 s [algebraic-graphs]
  21515. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  21516. 1274.30 s [algebraic-graphs] OK: hasEdge x y empty == False
  21517. 1274.30 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21518. 1274.30 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21519. 1274.30 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  21520. 1274.30 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21521. 1274.30 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  21522. 1274.30 s [algebraic-graphs]
  21523. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  21524. 1274.30 s [algebraic-graphs] OK: vertexCount empty == 0
  21525. 1274.30 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21526. 1274.30 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21527. 1274.30 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21528. 1274.30 s [algebraic-graphs]
  21529. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  21530. 1274.30 s [algebraic-graphs] OK: edgeCount empty == 0
  21531. 1274.30 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21532. 1274.30 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21533. 1274.30 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21534. 1274.30 s [algebraic-graphs]
  21535. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  21536. 1274.30 s [algebraic-graphs] OK: vertexList empty == []
  21537. 1274.30 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21538. 1274.30 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21539. 1274.30 s [algebraic-graphs]
  21540. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  21541. 1274.30 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21542. 1274.30 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21543. 1274.30 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21544. 1274.30 s [algebraic-graphs]
  21545. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  21546. 1274.30 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21547. 1274.30 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21548. 1274.30 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21549. 1274.30 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21550. 1274.30 s [algebraic-graphs]
  21551. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  21552. 1274.30 s [algebraic-graphs] OK: edgeList empty == []
  21553. 1274.30 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21554. 1274.30 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  21555. 1274.30 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  21556. 1274.30 s [algebraic-graphs]
  21557. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  21558. 1274.30 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21559. 1274.30 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21560. 1274.30 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  21561. 1274.30 s [algebraic-graphs]
  21562. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  21563. 1274.30 s [algebraic-graphs] OK: adjacencyList empty == []
  21564. 1274.30 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21565. 1274.30 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  21566. 1274.30 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  21567. 1274.30 s [algebraic-graphs]
  21568. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  21569. 1274.30 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  21570. 1274.30 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  21571. 1274.30 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  21572. 1274.30 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  21573. 1274.30 s [algebraic-graphs]
  21574. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  21575. 1274.30 s [algebraic-graphs] OK: path [] == empty
  21576. 1274.30 s [algebraic-graphs] OK: path [x] == vertex x
  21577. 1274.30 s [algebraic-graphs] OK: path [x,y] == edge x y
  21578. 1274.30 s [algebraic-graphs] OK: path == path . reverse
  21579. 1274.30 s [algebraic-graphs]
  21580. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  21581. 1274.30 s [algebraic-graphs] OK: circuit [] == empty
  21582. 1274.30 s [algebraic-graphs] OK: circuit [x] == edge x x
  21583. 1274.30 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21584. 1274.30 s [algebraic-graphs] OK: circuit == circuit . reverse
  21585. 1274.30 s [algebraic-graphs]
  21586. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  21587. 1274.30 s [algebraic-graphs] OK: clique [] == empty
  21588. 1274.30 s [algebraic-graphs] OK: clique [x] == vertex x
  21589. 1274.30 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21590. 1274.30 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21591. 1274.30 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21592. 1274.30 s [algebraic-graphs] OK: clique == clique . reverse
  21593. 1274.30 s [algebraic-graphs]
  21594. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  21595. 1274.30 s [algebraic-graphs] OK: biclique [] [] == empty
  21596. 1274.30 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21597. 1274.30 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21598. 1274.30 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21599. 1274.30 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21600. 1274.30 s [algebraic-graphs]
  21601. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  21602. 1274.30 s [algebraic-graphs] OK: star x [] == vertex x
  21603. 1274.30 s [algebraic-graphs] OK: star x [y] == edge x y
  21604. 1274.30 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21605. 1274.30 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21606. 1274.30 s [algebraic-graphs]
  21607. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  21608. 1274.30 s [algebraic-graphs] OK: stars [] == empty
  21609. 1274.30 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21610. 1274.30 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21611. 1274.30 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21612. 1274.30 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21613. 1274.30 s [algebraic-graphs] OK: stars . adjacencyList == id
  21614. 1274.30 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21615. 1274.30 s [algebraic-graphs]
  21616. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  21617. 1274.30 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21618. 1274.30 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21619. 1274.30 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21620. 1274.30 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21621. 1274.30 s [algebraic-graphs]
  21622. 1274.30 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  21623. 1274.30 s [algebraic-graphs] OK: forest [] == empty
  21624. 1283.70 s [algebraic-graphs] OK: forest [x] == tree x
  21625. 1283.70 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21626. 1283.73 s [algebraic-graphs] OK: forest == overlays . map tree
  21627. 1283.73 s [algebraic-graphs]
  21628. 1283.73 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  21629. 1283.73 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21630. 1283.73 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21631. 1283.73 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21632. 1283.73 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21633. 1283.73 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21634. 1283.73 s [algebraic-graphs]
  21635. 1283.73 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  21636. 1283.73 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21637. 1283.73 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21638. 1283.73 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21639. 1283.73 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21640. 1283.73 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21641. 1283.73 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21642. 1283.73 s [algebraic-graphs]
  21643. 1283.73 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  21644. 1283.73 s [algebraic-graphs] OK: replaceVertex x x == id
  21645. 1283.73 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21646. 1283.73 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21647. 1283.73 s [algebraic-graphs]
  21648. 1283.73 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  21649. 1283.73 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21650. 1283.74 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21651. 1283.74 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21652. 1283.74 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21653. 1283.74 s [algebraic-graphs]
  21654. 1283.74 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  21655. 1283.74 s [algebraic-graphs] OK: gmap f empty == empty
  21656. 1283.74 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21657. 1283.74 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21658. 1283.74 s [algebraic-graphs] OK: gmap id == id
  21659. 1283.74 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21660. 1283.74 s [algebraic-graphs]
  21661. 1283.74 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  21662. 1283.74 s [algebraic-graphs] OK: induce (const True ) x == x
  21663. 1283.74 s [algebraic-graphs] OK: induce (const False) x == empty
  21664. 1283.74 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21665. 1283.74 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21666. 1283.74 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21667. 1283.74 s [algebraic-graphs]
  21668. 1283.74 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  21669. 1283.74 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21670. 1283.74 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21671. 1283.74 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21672. 1283.74 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21673. 1283.74 s [algebraic-graphs]
  21674. 1283.74 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  21675. 1283.74 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  21676. 1283.74 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  21677. 1283.74 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  21678. 1283.74 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  21679. 1283.74 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  21680. 1283.74 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  21681. 1283.74 s [algebraic-graphs]
  21682. 1283.74 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  21683. 1283.74 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  21684. 1283.74 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  21685. 1283.74 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  21686. 1283.74 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  21687. 1283.74 s [algebraic-graphs]
  21688. 1283.74 s [algebraic-graphs] ============ Typed ============
  21689. 1283.74 s [algebraic-graphs]
  21690. 1283.74 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  21691. 1283.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21692. 1283.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21693. 1283.74 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  21694. 1283.74 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21695. 1283.74 s [algebraic-graphs]
  21696. 1283.74 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  21697. 1283.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21698. 1283.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21699. 1283.74 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  21700. 1283.74 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21701. 1283.74 s [algebraic-graphs]
  21702. 1283.74 s [algebraic-graphs] ============ Typed.dfsForest ============
  21703. 1283.74 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  21704. 1283.74 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  21705. 1283.74 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  21706. 1283.74 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  21707. 1283.74 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  21708. 1283.74 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  21709. 1283.74 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  21710. 1283.74 s [algebraic-graphs]
  21711. 1283.74 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  21712. 1283.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  21713. 1283.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  21714. 1283.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  21715. 1283.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  21716. 1283.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  21717. 1283.74 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  21718. 1283.74 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  21719. 1283.74 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  21720. 1283.74 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  21721. 1283.74 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  21722. 1283.74 s [algebraic-graphs]
  21723. 1283.74 s [algebraic-graphs] ============ Typed.dfs ============
  21724. 1283.74 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  21725. 1283.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  21726. 1283.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  21727. 1283.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  21728. 1283.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  21729. 1283.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  21730. 1283.74 s [algebraic-graphs] OK: dfs % x $ [] == []
  21731. 1283.74 s [algebraic-graphs]
  21732. 1283.74 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  21733. 1283.74 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  21734. 1283.74 s [algebraic-graphs]
  21735. 1283.74 s [algebraic-graphs] ============ Typed.topSort ============
  21736. 1283.74 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  21737. 1283.74 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  21738. 1283.74 s [algebraic-graphs]
  21739. 1283.74 s [algebraic-graphs] ============ Graph.Undirected ============
  21740. 1283.74 s [algebraic-graphs] OK: Axioms of undirected graphs
  21741. 1283.74 s [algebraic-graphs]
  21742. 1283.74 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  21743. 1283.74 s [algebraic-graphs] OK: show (empty ) == "empty"
  21744. 1283.74 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  21745. 1283.74 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  21746. 1283.74 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  21747. 1283.74 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  21748. 1283.74 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  21749. 1283.74 s [algebraic-graphs]
  21750. 1283.74 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  21751. 1283.74 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  21752. 1283.74 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  21753. 1283.74 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  21754. 1283.74 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  21755. 1283.74 s [algebraic-graphs]
  21756. 1283.74 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  21757. 1283.74 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  21758. 1283.74 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  21759. 1283.74 s [algebraic-graphs]
  21760. 1283.74 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  21761. 1283.74 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  21762. 1283.74 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21763. 1283.74 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  21764. 1283.74 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  21765. 1283.74 s [algebraic-graphs]
  21766. 1283.74 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  21767. 1283.74 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  21768. 1283.74 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21769. 1283.74 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  21770. 1283.74 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  21771. 1283.74 s [algebraic-graphs]
  21772. 1283.74 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  21773. 1283.74 s [algebraic-graphs] OK: complement empty == empty
  21774. 1283.74 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  21775. 1283.74 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  21776. 1283.74 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  21777. 1283.74 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  21778. 1283.74 s [algebraic-graphs] OK: complement . complement == id
  21779. 1283.74 s [algebraic-graphs]
  21780. 1283.74 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  21781. 1283.74 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21782. 1283.74 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21783. 1283.74 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21784. 1283.74 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21785. 1283.74 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21786. 1283.74 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21787. 1283.74 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21788. 1283.74 s [algebraic-graphs] OK: x <= x + y
  21789. 1283.74 s [algebraic-graphs] OK: x + y <= x * y
  21790. 1283.74 s [algebraic-graphs]
  21791. 1283.74 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  21792. 1283.74 s [algebraic-graphs] OK: isEmpty empty == True
  21793. 1283.74 s [algebraic-graphs] OK: hasVertex x empty == False
  21794. 1283.74 s [algebraic-graphs] OK: vertexCount empty == 0
  21795. 1283.74 s [algebraic-graphs] OK: edgeCount empty == 0
  21796. 1283.74 s [algebraic-graphs]
  21797. 1283.74 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  21798. 1283.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21799. 1283.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21800. 1283.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21801. 1283.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21802. 1283.74 s [algebraic-graphs]
  21803. 1283.74 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  21804. 1283.74 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21805. 1283.74 s [algebraic-graphs] OK: edge x y == edge y x
  21806. 1303.64 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21807. 1303.64 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21808. 1303.64 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21809. 1303.68 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21810. 1303.68 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21811. 1303.68 s [algebraic-graphs]
  21812. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  21813. 1303.68 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21814. 1303.68 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21815. 1303.68 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21816. 1303.68 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21817. 1303.68 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21818. 1303.68 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21819. 1303.68 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21820. 1303.68 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21821. 1303.68 s [algebraic-graphs]
  21822. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  21823. 1303.68 s [algebraic-graphs] OK: connect x y == connect y x
  21824. 1303.68 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21825. 1303.68 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21826. 1303.68 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21827. 1303.68 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21828. 1303.68 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21829. 1303.68 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21830. 1303.68 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21831. 1303.68 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21832. 1303.68 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21833. 1303.68 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21834. 1303.68 s [algebraic-graphs]
  21835. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  21836. 1303.68 s [algebraic-graphs] OK: vertices [] == empty
  21837. 1303.68 s [algebraic-graphs] OK: vertices [x] == vertex x
  21838. 1303.68 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21839. 1303.68 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21840. 1303.68 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21841. 1303.68 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21842. 1303.68 s [algebraic-graphs]
  21843. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  21844. 1303.68 s [algebraic-graphs] OK: edges [] == empty
  21845. 1303.68 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21846. 1303.68 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21847. 1303.68 s [algebraic-graphs]
  21848. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  21849. 1303.68 s [algebraic-graphs] OK: overlays [] == empty
  21850. 1303.68 s [algebraic-graphs] OK: overlays [x] == x
  21851. 1303.68 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21852. 1303.68 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21853. 1303.68 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21854. 1303.68 s [algebraic-graphs]
  21855. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  21856. 1303.68 s [algebraic-graphs] OK: connects [] == empty
  21857. 1303.68 s [algebraic-graphs] OK: connects [x] == x
  21858. 1303.68 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21859. 1303.68 s [algebraic-graphs] OK: connects == foldr connect empty
  21860. 1303.68 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21861. 1303.68 s [algebraic-graphs] OK: connects == connects . reverse
  21862. 1303.68 s [algebraic-graphs]
  21863. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  21864. 1303.68 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21865. 1303.68 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21866. 1303.68 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21867. 1303.68 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21868. 1303.68 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21869. 1303.68 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21870. 1303.68 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21871. 1303.68 s [algebraic-graphs]
  21872. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.path ============
  21873. 1303.68 s [algebraic-graphs] OK: path [] == empty
  21874. 1303.68 s [algebraic-graphs] OK: path [x] == vertex x
  21875. 1303.68 s [algebraic-graphs] OK: path [x,y] == edge x y
  21876. 1303.68 s [algebraic-graphs] OK: path == path . reverse
  21877. 1303.68 s [algebraic-graphs]
  21878. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  21879. 1303.68 s [algebraic-graphs] OK: circuit [] == empty
  21880. 1303.68 s [algebraic-graphs] OK: circuit [x] == edge x x
  21881. 1303.68 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21882. 1303.68 s [algebraic-graphs] OK: circuit == circuit . reverse
  21883. 1303.68 s [algebraic-graphs]
  21884. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  21885. 1303.68 s [algebraic-graphs] OK: clique [] == empty
  21886. 1303.68 s [algebraic-graphs] OK: clique [x] == vertex x
  21887. 1303.68 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21888. 1303.68 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21889. 1303.68 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21890. 1303.68 s [algebraic-graphs] OK: clique == clique . reverse
  21891. 1303.68 s [algebraic-graphs]
  21892. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  21893. 1303.68 s [algebraic-graphs] OK: biclique [] [] == empty
  21894. 1303.68 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21895. 1303.68 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21896. 1303.68 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21897. 1303.68 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21898. 1303.68 s [algebraic-graphs]
  21899. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.star ============
  21900. 1303.68 s [algebraic-graphs] OK: star x [] == vertex x
  21901. 1303.68 s [algebraic-graphs] OK: star x [y] == edge x y
  21902. 1303.68 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21903. 1303.68 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21904. 1303.68 s [algebraic-graphs]
  21905. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  21906. 1303.68 s [algebraic-graphs] OK: stars [] == empty
  21907. 1303.68 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21908. 1303.68 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21909. 1303.68 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21910. 1303.68 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21911. 1303.68 s [algebraic-graphs] OK: stars . adjacencyList == id
  21912. 1303.68 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21913. 1303.68 s [algebraic-graphs]
  21914. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  21915. 1303.68 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21916. 1303.68 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21917. 1303.68 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21918. 1303.68 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21919. 1303.68 s [algebraic-graphs]
  21920. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  21921. 1303.68 s [algebraic-graphs] OK: forest [] == empty
  21922. 1303.68 s [algebraic-graphs] OK: forest [x] == tree x
  21923. 1303.68 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21924. 1303.68 s [algebraic-graphs] OK: forest == overlays . map tree
  21925. 1303.68 s [algebraic-graphs]
  21926. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  21927. 1303.68 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21928. 1303.68 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21929. 1303.68 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21930. 1303.68 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21931. 1303.68 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21932. 1303.68 s [algebraic-graphs]
  21933. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  21934. 1303.68 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21935. 1303.68 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21936. 1303.68 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21937. 1303.68 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21938. 1303.68 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21939. 1303.68 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21940. 1303.68 s [algebraic-graphs]
  21941. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  21942. 1303.68 s [algebraic-graphs] OK: replaceVertex x x == id
  21943. 1303.68 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21944. 1303.68 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21945. 1303.68 s [algebraic-graphs]
  21946. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  21947. 1303.68 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21948. 1303.68 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21949. 1303.68 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21950. 1303.68 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21951. 1303.68 s [algebraic-graphs]
  21952. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  21953. 1303.68 s [algebraic-graphs] OK: gmap f empty == empty
  21954. 1303.68 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21955. 1303.68 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21956. 1303.68 s [algebraic-graphs] OK: gmap id == id
  21957. 1303.68 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21958. 1303.68 s [algebraic-graphs]
  21959. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  21960. 1303.68 s [algebraic-graphs] OK: induce (const True ) x == x
  21961. 1303.68 s [algebraic-graphs] OK: induce (const False) x == empty
  21962. 1303.68 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21963. 1303.68 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21964. 1303.68 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21965. 1303.68 s [algebraic-graphs]
  21966. 1303.68 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  21967. 1303.68 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21968. 1303.68 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21969. 1303.68 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21970. 1303.68 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21971. 1303.68 s [algebraic-graphs] Test suite main: PASS
  21972. 1303.68 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  21973. 1303.68 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  21974. 1303.68 s [algebraic-graphs] checkPhase completed in 4 minutes 43 seconds
  21975. 1303.68 s [algebraic-graphs] Phase: haddockPhase
  21976. 1303.83 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  21977. 1303.84 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  21978. 1304.05 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  21979. 1304.55 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  21980. 1304.68 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  21981. 1304.85 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  21982. 1304.90 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  21983. 1305.15 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  21984. 1305.28 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  21985. 1305.46 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  21986. 1305.61 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  21987. 1305.94 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  21988. 1306.02 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  21989. 1306.13 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  21990. 1306.13 s [algebraic-graphs] In the use of ‘head’
  21991. 1306.13 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21992. 1306.13 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21993. 1306.13 s [algebraic-graphs] |
  21994. 1306.13 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  21995. 1306.13 s [algebraic-graphs] | ^^^^
  21996. 1306.13 s [algebraic-graphs]
  21997. 1306.14 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  21998. 1306.14 s [algebraic-graphs] In the use of ‘tail’
  21999. 1306.14 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  22000. 1306.14 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  22001. 1306.14 s [algebraic-graphs] |
  22002. 1306.14 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  22003. 1306.14 s [algebraic-graphs] | ^^^^
  22004. 1306.14 s [algebraic-graphs]
  22005. 1306.14 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  22006. 1306.14 s [algebraic-graphs] In the use of ‘head’
  22007. 1306.14 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  22008. 1306.14 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  22009. 1306.14 s [algebraic-graphs] |
  22010. 1306.14 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  22011. 1306.14 s [algebraic-graphs] | ^^^^
  22012. 1306.14 s [algebraic-graphs]
  22013. 1306.14 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  22014. 1306.14 s [algebraic-graphs] In the use of ‘tail’
  22015. 1306.14 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  22016. 1306.14 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  22017. 1306.14 s [algebraic-graphs] |
  22018. 1306.15 s [algebraic-graphs] 397 | bnd' = tail bnd
  22019. 1306.15 s [algebraic-graphs] | ^^^^
  22020. 1306.15 s [algebraic-graphs]
  22021. 1306.15 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  22022. 1306.19 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  22023. 1306.36 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22024. 1306.36 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22025. 1306.36 s [algebraic-graphs] will become an error in a future GHC release.
  22026. 1306.36 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22027. 1306.36 s [algebraic-graphs] |
  22028. 1306.36 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  22029. 1306.36 s [algebraic-graphs] | ^
  22030. 1306.36 s [algebraic-graphs]
  22031. 1306.36 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22032. 1306.36 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22033. 1306.36 s [algebraic-graphs] will become an error in a future GHC release.
  22034. 1306.36 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22035. 1306.36 s [algebraic-graphs] |
  22036. 1306.36 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  22037. 1306.36 s [algebraic-graphs] | ^
  22038. 1306.36 s [algebraic-graphs]
  22039. 1306.36 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22040. 1306.36 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22041. 1306.36 s [algebraic-graphs] will become an error in a future GHC release.
  22042. 1306.36 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22043. 1306.36 s [algebraic-graphs] |
  22044. 1306.36 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  22045. 1306.36 s [algebraic-graphs] | ^
  22046. 1306.36 s [algebraic-graphs]
  22047. 1306.36 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22048. 1306.36 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22049. 1306.36 s [algebraic-graphs] will become an error in a future GHC release.
  22050. 1306.36 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22051. 1306.36 s [algebraic-graphs] |
  22052. 1306.36 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  22053. 1306.36 s [algebraic-graphs] | ^
  22054. 1306.36 s [algebraic-graphs]
  22055. 1306.36 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22056. 1306.36 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22057. 1306.36 s [algebraic-graphs] will become an error in a future GHC release.
  22058. 1306.36 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22059. 1306.36 s [algebraic-graphs] |
  22060. 1306.36 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  22061. 1306.36 s [algebraic-graphs] | ^
  22062. 1306.36 s [algebraic-graphs]
  22063. 1306.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22064. 1306.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22065. 1306.37 s [algebraic-graphs] will become an error in a future GHC release.
  22066. 1306.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22067. 1306.37 s [algebraic-graphs] |
  22068. 1306.37 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  22069. 1306.37 s [algebraic-graphs] | ^
  22070. 1306.37 s [algebraic-graphs]
  22071. 1306.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22072. 1306.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22073. 1306.37 s [algebraic-graphs] will become an error in a future GHC release.
  22074. 1306.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22075. 1306.37 s [algebraic-graphs] |
  22076. 1306.37 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  22077. 1306.37 s [algebraic-graphs] | ^
  22078. 1306.37 s [algebraic-graphs]
  22079. 1306.37 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  22080. 1306.52 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  22081. 1306.59 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  22082. 1306.92 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  22083. 1307.14 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  22084. 1307.33 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  22085. 1307.35 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  22086. 1307.39 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  22087. 1307.45 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22088. 1307.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22089. 1307.45 s [algebraic-graphs] will become an error in a future GHC release.
  22090. 1307.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22091. 1307.45 s [algebraic-graphs] |
  22092. 1307.45 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  22093. 1307.45 s [algebraic-graphs] | ^
  22094. 1307.45 s [algebraic-graphs]
  22095. 1307.45 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  22096. 1307.48 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22097. 1307.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22098. 1307.48 s [algebraic-graphs] will become an error in a future GHC release.
  22099. 1307.48 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22100. 1307.48 s [algebraic-graphs] |
  22101. 1307.49 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  22102. 1307.49 s [algebraic-graphs] | ^
  22103. 1307.49 s [algebraic-graphs]
  22104. 1307.49 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  22105. 1307.49 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  22106. 1307.49 s [algebraic-graphs] will become an error in a future GHC release.
  22107. 1307.49 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  22108. 1307.49 s [algebraic-graphs] |
  22109. 1307.49 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  22110. 1307.49 s [algebraic-graphs] | ^
  22111. 1307.49 s [algebraic-graphs]
  22112. 1307.49 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  22113. 1307.72 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  22114. 1307.87 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  22115. 1307.90 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  22116. 1307.95 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  22117. 1307.99 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  22118. 1308.04 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  22119. 1308.08 s [algebraic-graphs] Haddock coverage:
  22120. 1308.09 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22121. 1308.09 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22122. 1308.09 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22123. 1308.09 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22124. 1308.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22125. 1308.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22126. 1308.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22127. 1308.14 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  22128. 1308.15 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22129. 1308.15 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  22130. 1308.15 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  22131. 1308.15 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  22132. 1308.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22133. 1308.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22134. 1308.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  22135. 1308.18 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  22136. 1308.21 s [algebraic-graphs] Warning: 'nub' is out of scope.
  22137. 1308.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22138. 1308.21 s [algebraic-graphs] Warning: 'sort' is out of scope.
  22139. 1308.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22140. 1308.21 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  22141. 1308.21 s [algebraic-graphs] Missing documentation for:
  22142. 1308.21 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  22143. 1308.22 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  22144. 1308.22 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  22145. 1308.22 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  22146. 1308.22 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22147. 1308.22 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22148. 1308.22 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  22149. 1308.22 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  22150. 1308.22 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22151. 1308.22 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  22152. 1308.22 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  22153. 1308.22 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  22154. 1308.22 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  22155. 1308.22 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22156. 1308.22 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22157. 1308.22 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  22158. 1308.25 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22159. 1308.25 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  22160. 1308.25 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22161. 1308.25 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22162. 1308.25 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22163. 1308.25 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  22164. 1308.28 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  22165. 1308.29 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  22166. 1308.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22167. 1308.29 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  22168. 1308.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22169. 1308.29 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  22170. 1308.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22171. 1308.29 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  22172. 1308.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22173. 1308.29 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  22174. 1308.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22175. 1308.29 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  22176. 1308.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22177. 1308.30 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  22178. 1308.30 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22179. 1308.30 s [algebraic-graphs] Warning: 'box' is out of scope.
  22180. 1308.30 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22181. 1308.30 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  22182. 1308.30 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22183. 1308.31 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  22184. 1308.33 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22185. 1308.33 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22186. 1308.33 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22187. 1308.33 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22188. 1308.33 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22189. 1308.33 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22190. 1308.33 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22191. 1308.34 s [algebraic-graphs] Warning: 'nub' is out of scope.
  22192. 1308.34 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22193. 1308.36 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  22194. 1308.36 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  22195. 1308.36 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  22196. 1308.36 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22197. 1308.36 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22198. 1308.36 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  22199. 1308.37 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  22200. 1308.39 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  22201. 1308.39 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22202. 1308.39 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  22203. 1308.39 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  22204. 1308.39 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  22205. 1308.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22206. 1308.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22207. 1308.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  22208. 1308.40 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22209. 1308.40 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22210. 1308.40 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22211. 1308.40 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22212. 1308.40 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22213. 1308.40 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  22214. 1308.42 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  22215. 1308.42 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  22216. 1308.42 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  22217. 1308.42 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  22218. 1308.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22219. 1308.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22220. 1308.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  22221. 1308.43 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  22222. 1308.43 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  22223. 1308.43 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  22224. 1308.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22225. 1308.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22226. 1308.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  22227. 1308.43 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  22228. 1308.43 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  22229. 1308.43 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  22230. 1308.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22231. 1308.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22232. 1308.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  22233. 1308.43 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  22234. 1308.43 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  22235. 1308.43 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  22236. 1308.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22237. 1308.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22238. 1308.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  22239. 1308.43 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  22240. 1308.43 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  22241. 1308.43 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  22242. 1308.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22243. 1308.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22244. 1308.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  22245. 1308.45 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  22246. 1308.47 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  22247. 1308.47 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  22248. 1308.47 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  22249. 1308.47 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22250. 1308.47 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22251. 1308.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  22252. 1308.47 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  22253. 1308.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22254. 1308.47 s [algebraic-graphs] Warning: 'empty' is out of scope.
  22255. 1308.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22256. 1308.48 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  22257. 1308.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22258. 1308.48 s [algebraic-graphs] Warning: 'edges' is out of scope.
  22259. 1308.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22260. 1308.49 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  22261. 1308.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22262. 1308.50 s [algebraic-graphs] Warning: 'stars' is out of scope.
  22263. 1308.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22264. 1308.50 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  22265. 1308.52 s [algebraic-graphs] Warning: 'nub' is out of scope.
  22266. 1308.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22267. 1308.52 s [algebraic-graphs] Warning: 'sort' is out of scope.
  22268. 1308.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22269. 1308.53 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22270. 1308.53 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22271. 1308.53 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22272. 1308.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22273. 1308.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22274. 1308.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  22275. 1308.53 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  22276. 1308.53 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  22277. 1308.53 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  22278. 1308.53 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22279. 1308.53 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22280. 1308.53 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  22281. 1308.53 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  22282. 1308.53 s [algebraic-graphs] Missing documentation for:
  22283. 1308.53 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  22284. 1308.54 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22285. 1308.54 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  22286. 1308.54 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22287. 1308.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22288. 1308.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22289. 1308.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  22290. 1308.54 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  22291. 1308.54 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  22292. 1308.54 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22293. 1308.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22294. 1308.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22295. 1308.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  22296. 1308.54 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22297. 1308.54 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  22298. 1308.54 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22299. 1308.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22300. 1308.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22301. 1308.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  22302. 1308.54 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  22303. 1308.54 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  22304. 1308.54 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  22305. 1308.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22306. 1308.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22307. 1308.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  22308. 1308.57 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  22309. 1308.57 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  22310. 1308.57 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22311. 1308.57 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22312. 1308.57 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22313. 1308.57 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  22314. 1308.57 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  22315. 1308.58 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  22316. 1308.58 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  22317. 1308.58 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  22318. 1308.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22319. 1308.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22320. 1308.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  22321. 1308.59 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  22322. 1308.60 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  22323. 1308.60 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  22324. 1308.60 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  22325. 1308.60 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22326. 1308.60 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22327. 1308.60 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  22328. 1308.61 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22329. 1308.61 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  22330. 1308.61 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22331. 1308.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22332. 1308.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22333. 1308.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  22334. 1308.62 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  22335. 1308.62 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22336. 1308.63 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  22337. 1308.64 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  22338. 1308.64 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  22339. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  22340. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22341. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22342. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  22343. 1308.78 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  22344. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  22345. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  22346. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22347. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22348. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  22349. 1308.78 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22350. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  22351. 1308.78 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22352. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22353. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22354. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  22355. 1308.78 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  22356. 1308.78 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  22357. 1308.78 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22358. 1308.78 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  22359. 1308.78 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22360. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  22361. 1308.78 s [algebraic-graphs] * in ‘Data.Map.Internal’
  22362. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22363. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22364. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  22365. 1308.78 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  22366. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  22367. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  22368. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22369. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22370. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  22371. 1308.78 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  22372. 1308.78 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  22373. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  22374. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  22375. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22376. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22377. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  22378. 1308.78 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22379. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  22380. 1308.78 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22381. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22382. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22383. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  22384. 1308.78 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  22385. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  22386. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  22387. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22388. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22389. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  22390. 1308.78 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  22391. 1308.78 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  22392. 1308.78 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  22393. 1308.78 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  22394. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  22395. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  22396. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22397. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22398. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  22399. 1308.78 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  22400. 1308.78 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  22401. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  22402. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  22403. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22404. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22405. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  22406. 1308.78 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  22407. 1308.78 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22408. 1308.78 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  22409. 1308.78 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  22410. 1308.78 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  22411. 1308.78 s [algebraic-graphs] * in ‘Data.Set.Internal’
  22412. 1308.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22413. 1308.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22414. 1308.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  22415. 1308.78 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  22416. 1308.93 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  22417. 1308.93 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  22418. 1308.93 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  22419. 1308.93 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  22420. 1308.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22421. 1308.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22422. 1308.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  22423. 1308.93 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  22424. 1308.93 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22425. 1308.93 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  22426. 1308.93 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  22427. 1308.93 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  22428. 1308.93 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  22429. 1308.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22430. 1308.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22431. 1308.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  22432. 1308.93 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  22433. 1308.93 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22434. 1308.93 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  22435. 1308.93 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  22436. 1308.93 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  22437. 1308.93 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  22438. 1308.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22439. 1308.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22440. 1308.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  22441. 1308.93 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  22442. 1308.93 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22443. 1308.93 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  22444. 1308.93 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  22445. 1308.93 s [algebraic-graphs] Missing documentation for:
  22446. 1308.93 s [algebraic-graphs] Module header
  22447. 1308.93 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  22448. 1308.93 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  22449. 1308.93 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  22450. 1308.93 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  22451. 1308.93 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  22452. 1308.93 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  22453. 1308.93 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  22454. 1308.93 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  22455. 1308.93 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  22456. 1308.93 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  22457. 1308.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  22458. 1308.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  22459. 1308.94 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  22460. 1308.94 s [algebraic-graphs] Warning: 'array' is out of scope.
  22461. 1308.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  22462. 1308.94 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  22463. 1308.94 s [algebraic-graphs] Missing documentation for:
  22464. 1308.94 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  22465. 1309.26 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  22466. 1309.26 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  22467. 1309.27 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  22468. 1309.27 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  22469. 1309.28 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  22470. 1309.28 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  22471. 1309.29 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  22472. 1309.29 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  22473. 1309.29 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  22474. 1309.30 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  22475. 1309.30 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  22476. 1309.31 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  22477. 1309.31 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  22478. 1309.38 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  22479. 1309.38 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  22480. 1309.39 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  22481. 1309.39 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  22482. 1309.41 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  22483. 1309.41 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  22484. 1316.54 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  22485. 1316.54 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  22486. 1316.63 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  22487. 1316.65 s [algebraic-graphs] Phase: installPhase
  22488. 1316.74 s [algebraic-graphs] Installing library in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22489. 1317.63 s [algebraic-graphs] Phase: fixupPhase
  22490. 1317.66 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
  22491. 1317.68 s [algebraic-graphs] shrinking /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSalgebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW-ghc9.10.3.so
  22492. 1317.69 s [algebraic-graphs] checking for references to /build/ in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7...
  22493. 1317.74 s [algebraic-graphs] patching script interpreter paths in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7
  22494. 1317.75 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/lib
  22495. 1318.33 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
  22496. 1318.36 s [algebraic-graphs] checking for references to /build/ in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc...
  22497. 1318.41 s [algebraic-graphs] patching script interpreter paths in /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
  22498. 1318.79 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
  22499. 1319.29 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  22500. 1319.32 s [post-build-hook] Uploading to the NixCI cache: /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7 /nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc
  22501. 1319.37 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22502. 1319.40 s [post-build-hook] copying 2 paths...
  22503. 1319.40 s [post-build-hook] copying path '/nix/store/dxizyanc3x23qyq6hnrq1hw4k88rv25h-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  22504. 1321.29 s [post-build-hook] copying path '/nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  22505. 1330.56 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22506. 1330.71 s [post-build-hook] copying 0 paths...
  22507. 1330.73 s Progress: 14 of 19 built, 193 of 193 downloaded from cache
  22508. 1330.80 s Building algebraic-graph-duoids
  22509. 1331.00 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  22510. 1331.00 s [algebraic-graph-duoids] Build with /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3.
  22511. 1331.32 s [algebraic-graph-duoids] Phase: unpackPhase
  22512. 1331.32 s [algebraic-graph-duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./algebraic-graphs
  22513. 1331.33 s [algebraic-graph-duoids] source root is algebraic-graphs
  22514. 1331.35 s [algebraic-graph-duoids] Phase: patchPhase
  22515. 1331.36 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  22516. 1331.36 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.MG94JQgMOv/setup-package.conf.d -threaded
  22517. 1331.43 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.MG94JQgMOv/Main.o )
  22518. 1331.50 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  22519. 1333.39 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  22520. 1333.41 s [algebraic-graph-duoids] Phase: configurePhase
  22521. 1333.41 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.MG94JQgMOv/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/lib
  22522. 1333.43 s [algebraic-graph-duoids] Using Parsec parser
  22523. 1333.43 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  22524. 1334.19 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  22525. 1334.64 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  22526. 1334.64 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22527. 1334.64 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  22528. 1334.64 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  22529. 1334.64 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22530. 1334.64 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  22531. 1334.64 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  22532. 1334.64 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22533. 1334.64 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  22534. 1334.64 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  22535. 1334.64 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22536. 1334.64 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  22537. 1334.64 s [algebraic-graph-duoids] hedgehog-1.5
  22538. 1334.64 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  22539. 1334.64 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22540. 1334.64 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.2.0
  22541. 1334.64 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  22542. 1334.64 s [algebraic-graph-duoids] <0.25: using doctest-0.24.2
  22543. 1334.64 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  22544. 1334.64 s [algebraic-graph-duoids] Source component graph:
  22545. 1334.64 s [algebraic-graph-duoids] component lib
  22546. 1334.64 s [algebraic-graph-duoids] component test:doctests dependency lib
  22547. 1334.64 s [algebraic-graph-duoids] component test:laws dependency lib
  22548. 1334.64 s [algebraic-graph-duoids] Configured component graph:
  22549. 1334.64 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22550. 1334.64 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22551. 1334.64 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22552. 1334.64 s [algebraic-graph-duoids] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  22553. 1334.64 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22554. 1334.64 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
  22555. 1334.64 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22556. 1334.64 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22557. 1334.64 s [algebraic-graph-duoids] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  22558. 1334.64 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22559. 1334.64 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
  22560. 1334.64 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22561. 1334.64 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22562. 1334.64 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22563. 1334.64 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  22564. 1334.64 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22565. 1334.64 s [algebraic-graph-duoids] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  22566. 1334.64 s [algebraic-graph-duoids] Linked component graph:
  22567. 1334.64 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22568. 1334.64 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22569. 1334.64 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22570. 1334.64 s [algebraic-graph-duoids] include duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  22571. 1334.64 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22572. 1334.64 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI:Algebra.Graph.Duoid.Orphans
  22573. 1334.64 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
  22574. 1334.64 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22575. 1334.64 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22576. 1334.64 s [algebraic-graph-duoids] include doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  22577. 1334.64 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22578. 1334.64 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
  22579. 1334.64 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22580. 1334.64 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22581. 1334.64 s [algebraic-graph-duoids] include base-4.20.2.0-acb8
  22582. 1334.64 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  22583. 1334.64 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22584. 1334.64 s [algebraic-graph-duoids] include hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  22585. 1334.64 s [algebraic-graph-duoids] Ready component graph:
  22586. 1334.64 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22587. 1334.64 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22588. 1334.64 s [algebraic-graph-duoids] depends base-4.20.2.0-acb8
  22589. 1334.64 s [algebraic-graph-duoids] depends duoids-0.0.1.0-JQuo8shp0teIRv4kSOfT9c
  22590. 1334.64 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22591. 1334.64 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-IjWb2oI1gcnJxK84yFuagh-laws
  22592. 1334.64 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22593. 1334.64 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Dzdl7vkJHJu5iSqEy4BAAW
  22594. 1334.64 s [algebraic-graph-duoids] depends base-4.20.2.0-acb8
  22595. 1334.64 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-DHpwPjgdpDzDuo5xC7SmPW
  22596. 1334.64 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22597. 1334.64 s [algebraic-graph-duoids] depends hedgehog-1.5-GkwolDBwWusGqoG17DJK3A
  22598. 1334.64 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-BCBiHvpUmmaDfl9bHiyWkI-doctests
  22599. 1334.64 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22600. 1334.64 s [algebraic-graph-duoids] depends base-4.20.2.0-acb8
  22601. 1334.64 s [algebraic-graph-duoids] depends doctest-0.24.2-18dgXXsZmap5NU7dF4zxUR
  22602. 1334.64 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7XMbyPoRQtN6oKZ0kiZSoh
  22603. 1334.64 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  22604. 1334.64 s [algebraic-graph-duoids] Using compiler: ghc-9.10.3
  22605. 1334.64 s [algebraic-graph-duoids] Using install prefix:
  22606. 1334.64 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22607. 1334.64 s [algebraic-graph-duoids] Executables installed in:
  22608. 1334.64 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/bin
  22609. 1334.64 s [algebraic-graph-duoids] Libraries installed in:
  22610. 1334.64 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22611. 1334.64 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  22612. 1334.64 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702
  22613. 1334.64 s [algebraic-graph-duoids] Private executables installed in:
  22614. 1334.64 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0
  22615. 1334.64 s [algebraic-graph-duoids] Data files installed in:
  22616. 1334.64 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0
  22617. 1334.64 s [algebraic-graph-duoids] Documentation installed in:
  22618. 1334.64 s [algebraic-graph-duoids] /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  22619. 1334.64 s [algebraic-graph-duoids] Configuration files installed in:
  22620. 1334.64 s [algebraic-graph-duoids] /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/etc
  22621. 1334.64 s [algebraic-graph-duoids] No alex found
  22622. 1334.64 s [algebraic-graph-duoids] Using ar found on system at:
  22623. 1334.64 s [algebraic-graph-duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  22624. 1334.64 s [algebraic-graph-duoids] No c2hs found
  22625. 1334.64 s [algebraic-graph-duoids] No cpphs found
  22626. 1334.64 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  22627. 1334.64 s [algebraic-graph-duoids] /nix/store/5cywz807jgyxilkmix7rwpy7501a4jr4-doctest-0.24.2/bin/doctest
  22628. 1334.64 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  22629. 1334.64 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  22630. 1334.64 s [algebraic-graph-duoids] Using ghc version 9.10.3 found on system at:
  22631. 1334.64 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc
  22632. 1334.64 s [algebraic-graph-duoids] Using ghc-pkg version 9.10.3 found on system at:
  22633. 1334.64 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/ghc-pkg-9.10.3
  22634. 1334.64 s [algebraic-graph-duoids] No ghcjs found
  22635. 1334.64 s [algebraic-graph-duoids] No ghcjs-pkg found
  22636. 1334.64 s [algebraic-graph-duoids] No greencard found
  22637. 1334.64 s [algebraic-graph-duoids] Using haddock version 2.31.1 found on system at:
  22638. 1334.64 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/haddock-ghc-9.10.3
  22639. 1334.64 s [algebraic-graph-duoids] No happy found
  22640. 1334.64 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  22641. 1334.64 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  22642. 1334.64 s [algebraic-graph-duoids] No hmake found
  22643. 1334.64 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  22644. 1334.64 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hpc-ghc-9.10.3
  22645. 1334.64 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  22646. 1334.64 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  22647. 1334.64 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  22648. 1334.64 s [algebraic-graph-duoids] /nix/store/7bd6y873jzkh9wkxhgl2a0za0kfjv1c7-hscolour-1.25/bin/HsColour
  22649. 1334.64 s [algebraic-graph-duoids] No jhc found
  22650. 1334.64 s [algebraic-graph-duoids] Using ld found on system at:
  22651. 1334.64 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  22652. 1334.64 s [algebraic-graph-duoids] No pkg-config found
  22653. 1334.64 s [algebraic-graph-duoids] Using runghc version 9.10.3 found on system at:
  22654. 1334.64 s [algebraic-graph-duoids] /nix/store/ffg3yf2ypnbz3hc31y7nglrkihz0if01-ghc-9.10.3/bin/runghc-9.10.3
  22655. 1334.64 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  22656. 1334.64 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  22657. 1334.64 s [algebraic-graph-duoids] Using tar found on system at:
  22658. 1334.64 s [algebraic-graph-duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  22659. 1334.64 s [algebraic-graph-duoids] No uhc found
  22660. 1334.87 s [algebraic-graph-duoids] Phase: buildPhase
  22661. 1334.99 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22662. 1334.99 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  22663. 1335.13 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
  22664. 1335.61 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
  22665. 1337.40 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  22666. 1338.04 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
  22667. 1343.87 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22668. 1343.87 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22669. 1344.03 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  22670. 1345.16 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  22671. 1346.36 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22672. 1346.36 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22673. 1346.49 s [algebraic-graph-duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  22674. 1347.01 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  22675. 1347.77 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  22676. 1352.34 s [algebraic-graph-duoids] Phase: checkPhase
  22677. 1352.68 s [algebraic-graph-duoids] Running 2 test suites...
  22678. 1352.68 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  22679. 1352.72 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  22680. 1352.72 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  22681. 1352.72 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  22682. 1352.72 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  22683. 1352.72 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  22684. 1352.72 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  22685. 1352.72 s [algebraic-graph-duoids] ✓ 5 succeeded.
  22686. 1352.72 s [algebraic-graph-duoids] Test suite laws: PASS
  22687. 1352.72 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  22688. 1352.72 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  22689. 1353.49 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  22690. 1353.55 s [algebraic-graph-duoids] NameLib Nothing
  22691. 1353.55 s [algebraic-graph-duoids] ----------------------------------------
  22692. 1353.57 s [algebraic-graph-duoids] Test suite doctests: PASS
  22693. 1353.57 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  22694. 1353.57 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  22695. 1353.60 s [algebraic-graph-duoids] Phase: haddockPhase
  22696. 1353.84 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22697. 1353.84 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  22698. 1354.42 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  22699. 1355.08 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  22700. 1355.20 s [algebraic-graph-duoids] Haddock coverage:
  22701. 1355.20 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  22702. 1355.20 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  22703. 1366.95 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  22704. 1366.95 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  22705. 1367.08 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22706. 1367.08 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22707. 1367.09 s [algebraic-graph-duoids] Phase: installPhase
  22708. 1367.32 s [algebraic-graph-duoids] Installing library in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/algebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI
  22709. 1367.77 s [algebraic-graph-duoids] Phase: fixupPhase
  22710. 1367.79 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22711. 1367.79 s [algebraic-graph-duoids] shrinking /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-5702/libHSalgebraic-graph-duoids-0.0.1.0-KRhIxsSw7OfBzeaotKoRTI-ghc9.10.3.so
  22712. 1367.80 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0...
  22713. 1367.83 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22714. 1367.84 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/lib
  22715. 1367.89 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc
  22716. 1367.90 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc...
  22717. 1367.92 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc
  22718. 1368.19 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22719. 1368.77 s [post-build-hook] Pushing 2 paths (76 are already present) using zstd to cache sellout ⏳
  22720. 1368.77 s [post-build-hook]
  22721. 1369.21 s [post-build-hook] Pushing /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc (539.91 KiB)
  22722. 1369.22 s [post-build-hook] Pushing /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0 (1.23 MiB)
  22723. 1370.47 s [post-build-hook]
  22724. 1370.47 s [post-build-hook] All done.
  22725. 1370.50 s [post-build-hook] Uploading to the NixCI cache: /nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0
  22726. 1370.57 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22727. 1370.59 s [post-build-hook] copying 2 paths...
  22728. 1370.59 s [post-build-hook] copying path '/nix/store/6n5l5cs5rpq31q1vfzm4vby92cdf2iay-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  22729. 1371.04 s [post-build-hook] copying path '/nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  22730. 1371.69 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22731. 1371.98 s [post-build-hook] copying 1 paths...
  22732. 1372.03 s [post-build-hook] copying path '/nix/store/bd7wyicwpjh0a8wfchy92kvmjqv0xd8h-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  22733. 1372.29 s Progress: 15 of 19 built, 193 of 193 downloaded from cache
  22734. 1372.38 s Building ghc-9.10.3-with-packages
  22735. 1372.46 s [ghc-9.10.3-with-packages] /nix/store/wp33qs6b2wdxj74yi76hwclbcawz2q2v-duoidal-transformers-0.0.1.0/nix-support:
  22736. 1372.46 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22737. 1372.46 s [ghc-9.10.3-with-packages] /nix/store/s2yzlz0lg9y3driwv96riwc90023vdff-duoids-0.0.1.0/nix-support:
  22738. 1372.46 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22739. 1372.47 s [ghc-9.10.3-with-packages] /nix/store/3ggwwjsqcpvrk07k3j9fg85ighsm7jrg-duoids-hedgehog-0.0.1.0/nix-support:
  22740. 1372.47 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22741. 1372.47 s [ghc-9.10.3-with-packages] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/nix-support:
  22742. 1372.47 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22743. 1372.48 s [ghc-9.10.3-with-packages] /nix/store/90d89nrwky7gxskpyxfjn6i803dzfh2r-algebraic-graphs-0.7/nix-support:
  22744. 1372.48 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22745. 1372.48 s [ghc-9.10.3-with-packages] /nix/store/q9bmv83s4921kh6z965q0v2glgm742gx-ghc-compat-plugin-0.1.0.1/nix-support:
  22746. 1372.48 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22747. 1372.48 s [ghc-9.10.3-with-packages] /nix/store/q9bmv83s4921kh6z965q0v2glgm742gx-ghc-compat-plugin-0.1.0.1/nix-support:
  22748. 1372.48 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22749. 1372.48 s [ghc-9.10.3-with-packages] /nix/store/6s0czylb98l3w1dfdbw1lz6d0xz5dik2-hedgehog-1.5/nix-support:
  22750. 1372.48 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22751. 1372.49 s [ghc-9.10.3-with-packages] /nix/store/6s0czylb98l3w1dfdbw1lz6d0xz5dik2-hedgehog-1.5/nix-support:
  22752. 1372.49 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22753. 1372.49 s [ghc-9.10.3-with-packages] /nix/store/yv1515y35b5d87px2xnywdrzl57bzj36-ansi-terminal-1.1.3/nix-support:
  22754. 1372.49 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22755. 1372.49 s [ghc-9.10.3-with-packages] /nix/store/yv1515y35b5d87px2xnywdrzl57bzj36-ansi-terminal-1.1.3/nix-support:
  22756. 1372.49 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22757. 1372.50 s [ghc-9.10.3-with-packages] /nix/store/sjm0zblwxqfdk46ck7qrjg10f19k2b3q-async-2.2.5/nix-support:
  22758. 1372.50 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22759. 1372.50 s [ghc-9.10.3-with-packages] /nix/store/sjm0zblwxqfdk46ck7qrjg10f19k2b3q-async-2.2.5/nix-support:
  22760. 1372.50 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22761. 1372.50 s [ghc-9.10.3-with-packages] /nix/store/mrh8y1rc5sfl36wh0q014barx02dk48a-barbies-2.1.1.0/nix-support:
  22762. 1372.50 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22763. 1372.51 s [ghc-9.10.3-with-packages] /nix/store/mrh8y1rc5sfl36wh0q014barx02dk48a-barbies-2.1.1.0/nix-support:
  22764. 1372.51 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22765. 1372.51 s [ghc-9.10.3-with-packages] /nix/store/nwqnn7mc9y6m6qhlf4b04dm8b694ihir-concurrent-output-1.10.21/nix-support:
  22766. 1372.51 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22767. 1372.51 s [ghc-9.10.3-with-packages] /nix/store/nwqnn7mc9y6m6qhlf4b04dm8b694ihir-concurrent-output-1.10.21/nix-support:
  22768. 1372.51 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22769. 1372.52 s [ghc-9.10.3-with-packages] /nix/store/c0kvhsdh044cby9s385kdp6fzrwnx0b2-lifted-async-0.10.2.7/nix-support:
  22770. 1372.52 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22771. 1372.52 s [ghc-9.10.3-with-packages] /nix/store/c0kvhsdh044cby9s385kdp6fzrwnx0b2-lifted-async-0.10.2.7/nix-support:
  22772. 1372.52 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22773. 1372.52 s [ghc-9.10.3-with-packages] /nix/store/88zzrq6z3q2i7raa4bqrfzp2xm1spfzs-mmorph-1.2.1/nix-support:
  22774. 1372.52 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22775. 1372.53 s [ghc-9.10.3-with-packages] /nix/store/88zzrq6z3q2i7raa4bqrfzp2xm1spfzs-mmorph-1.2.1/nix-support:
  22776. 1372.53 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22777. 1372.53 s [ghc-9.10.3-with-packages] /nix/store/g2qvb2hxv61dkd7kcwl314bfkn49w353-monad-control-1.0.3.1/nix-support:
  22778. 1372.53 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22779. 1372.53 s [ghc-9.10.3-with-packages] /nix/store/g2qvb2hxv61dkd7kcwl314bfkn49w353-monad-control-1.0.3.1/nix-support:
  22780. 1372.53 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22781. 1372.53 s [ghc-9.10.3-with-packages] /nix/store/6cndgccwks6pzgpp40sd3yqj1gwrwcpc-pretty-show-1.10/nix-support:
  22782. 1372.53 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22783. 1372.53 s [ghc-9.10.3-with-packages] /nix/store/6cndgccwks6pzgpp40sd3yqj1gwrwcpc-pretty-show-1.10/nix-support:
  22784. 1372.53 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22785. 1372.54 s [ghc-9.10.3-with-packages] /nix/store/cbkpv0a2jd34ji7dmwlcs5079p09clw9-primitive-0.9.1.0/nix-support:
  22786. 1372.54 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22787. 1372.54 s [ghc-9.10.3-with-packages] /nix/store/cbkpv0a2jd34ji7dmwlcs5079p09clw9-primitive-0.9.1.0/nix-support:
  22788. 1372.54 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22789. 1372.54 s [ghc-9.10.3-with-packages] /nix/store/8l34z8pqyxz1a375p2mjy2x9pl7qwv9j-random-1.2.1.3/nix-support:
  22790. 1372.54 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22791. 1372.55 s [ghc-9.10.3-with-packages] /nix/store/8l34z8pqyxz1a375p2mjy2x9pl7qwv9j-random-1.2.1.3/nix-support:
  22792. 1372.55 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22793. 1372.55 s [ghc-9.10.3-with-packages] /nix/store/h9ngfa8xz6vn23w9hbg6hfcciqp1618a-resourcet-1.3.0/nix-support:
  22794. 1372.55 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22795. 1372.55 s [ghc-9.10.3-with-packages] /nix/store/h9ngfa8xz6vn23w9hbg6hfcciqp1618a-resourcet-1.3.0/nix-support:
  22796. 1372.55 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22797. 1372.55 s [ghc-9.10.3-with-packages] /nix/store/7vn9fv3b7f0ajmhrb61h3cnsym1y3n3f-safe-exceptions-0.1.7.4/nix-support:
  22798. 1372.55 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22799. 1372.56 s [ghc-9.10.3-with-packages] /nix/store/7vn9fv3b7f0ajmhrb61h3cnsym1y3n3f-safe-exceptions-0.1.7.4/nix-support:
  22800. 1372.56 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22801. 1372.56 s [ghc-9.10.3-with-packages] /nix/store/na9f6zzz8s1k6g1id7dcffl0gi7r7cjj-transformers-base-0.4.6/nix-support:
  22802. 1372.56 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22803. 1372.56 s [ghc-9.10.3-with-packages] /nix/store/na9f6zzz8s1k6g1id7dcffl0gi7r7cjj-transformers-base-0.4.6/nix-support:
  22804. 1372.56 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22805. 1372.56 s [ghc-9.10.3-with-packages] /nix/store/25k1v3pwwy7x5gym9q9dhviv0csxvvmn-wl-pprint-annotated-0.1.0.1/nix-support:
  22806. 1372.56 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22807. 1372.56 s [ghc-9.10.3-with-packages] /nix/store/25k1v3pwwy7x5gym9q9dhviv0csxvvmn-wl-pprint-annotated-0.1.0.1/nix-support:
  22808. 1372.56 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22809. 1372.57 s [ghc-9.10.3-with-packages] /nix/store/8gj8b8i9s12rdfbqmdph9s03wnpqh44d-ansi-terminal-types-1.1.3/nix-support:
  22810. 1372.57 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22811. 1372.57 s [ghc-9.10.3-with-packages] /nix/store/8gj8b8i9s12rdfbqmdph9s03wnpqh44d-ansi-terminal-types-1.1.3/nix-support:
  22812. 1372.57 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22813. 1372.58 s [ghc-9.10.3-with-packages] /nix/store/m2gbv27qwdgpizs36ysfzkc543z73msp-hashable-1.5.0.0/nix-support:
  22814. 1372.58 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22815. 1372.58 s [ghc-9.10.3-with-packages] /nix/store/m2gbv27qwdgpizs36ysfzkc543z73msp-hashable-1.5.0.0/nix-support:
  22816. 1372.58 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22817. 1372.59 s [ghc-9.10.3-with-packages] /nix/store/k735nrbnq1v6hqj9l4aqf84zvqnc17fb-distributive-0.6.2.1/nix-support:
  22818. 1372.59 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22819. 1372.59 s [ghc-9.10.3-with-packages] /nix/store/k735nrbnq1v6hqj9l4aqf84zvqnc17fb-distributive-0.6.2.1/nix-support:
  22820. 1372.59 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22821. 1372.59 s [ghc-9.10.3-with-packages] /nix/store/qlaran7276vq5yfddk8gjyb0bbl7463d-constraints-0.14.2/nix-support:
  22822. 1372.59 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22823. 1372.60 s [ghc-9.10.3-with-packages] /nix/store/qlaran7276vq5yfddk8gjyb0bbl7463d-constraints-0.14.2/nix-support:
  22824. 1372.60 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22825. 1372.60 s [ghc-9.10.3-with-packages] /nix/store/anslqcpw3nb5ij1vvfxxqb4m5q9x9jkp-lifted-base-0.2.3.12/nix-support:
  22826. 1372.60 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22827. 1372.60 s [ghc-9.10.3-with-packages] /nix/store/anslqcpw3nb5ij1vvfxxqb4m5q9x9jkp-lifted-base-0.2.3.12/nix-support:
  22828. 1372.60 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22829. 1372.61 s [ghc-9.10.3-with-packages] /nix/store/yf7r6nnmfc4mwj08iavfcxpp70mj6mkq-transformers-compat-0.7.2/nix-support:
  22830. 1372.61 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22831. 1372.61 s [ghc-9.10.3-with-packages] /nix/store/yf7r6nnmfc4mwj08iavfcxpp70mj6mkq-transformers-compat-0.7.2/nix-support:
  22832. 1372.61 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22833. 1372.62 s [ghc-9.10.3-with-packages] /nix/store/v6jdycf0p0gypqgg67hc7k45i6p25cwj-splitmix-0.1.3.1/nix-support:
  22834. 1372.62 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22835. 1372.62 s [ghc-9.10.3-with-packages] /nix/store/v6jdycf0p0gypqgg67hc7k45i6p25cwj-splitmix-0.1.3.1/nix-support:
  22836. 1372.62 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22837. 1372.62 s [ghc-9.10.3-with-packages] /nix/store/3d0qs4aijgblg7mvsxzr2b168hmncirn-unliftio-core-0.2.1.0/nix-support:
  22838. 1372.62 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22839. 1372.63 s [ghc-9.10.3-with-packages] /nix/store/3d0qs4aijgblg7mvsxzr2b168hmncirn-unliftio-core-0.2.1.0/nix-support:
  22840. 1372.63 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22841. 1372.63 s [ghc-9.10.3-with-packages] /nix/store/kspxaj152b3jyd5yfwmkb8fi5l571rms-base-orphans-0.9.3/nix-support:
  22842. 1372.63 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22843. 1372.63 s [ghc-9.10.3-with-packages] /nix/store/kspxaj152b3jyd5yfwmkb8fi5l571rms-base-orphans-0.9.3/nix-support:
  22844. 1372.63 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22845. 1372.63 s [ghc-9.10.3-with-packages] /nix/store/c1ickhy1b9cnskfyjr6bhh9xbczy60w0-tagged-0.8.9/nix-support:
  22846. 1372.63 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22847. 1372.63 s [ghc-9.10.3-with-packages] /nix/store/c1ickhy1b9cnskfyjr6bhh9xbczy60w0-tagged-0.8.9/nix-support:
  22848. 1372.63 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22849. 1372.64 s [ghc-9.10.3-with-packages] /nix/store/rwvnxl3wi6qdd2mffsl3rymh0infb7nh-boring-0.2.2/nix-support:
  22850. 1372.64 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22851. 1372.64 s [ghc-9.10.3-with-packages] /nix/store/rwvnxl3wi6qdd2mffsl3rymh0infb7nh-boring-0.2.2/nix-support:
  22852. 1372.64 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/iwgl4r59m0qyijlcvw3arlhnak5s49hi-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22853. 1373.62 s [ghc-9.10.3-with-packages] Warning: include-dirs: /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages/lib/ghc-9.10.3/lib/../lib/x86_64-linux-ghc-9.10.3/directory-1.3.8.5-e377/include doesn't exist or isn't a directory
  22854. 1375.34 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages
  22855. 1376.06 s [post-build-hook] Pushing 1 paths (144 are already present) using zstd to cache sellout ⏳
  22856. 1376.06 s [post-build-hook]
  22857. 1376.47 s [post-build-hook] Pushing /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages (4.95 MiB)
  22858. 1378.43 s [post-build-hook]
  22859. 1378.43 s [post-build-hook] All done.
  22860. 1378.46 s [post-build-hook] Uploading to the NixCI cache: /nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages
  22861. 1378.53 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22862. 1378.77 s [post-build-hook] copying 1 paths...
  22863. 1378.77 s [post-build-hook] copying path '/nix/store/g13gjs94akammcfd33dclh8yznzaibfh-ghc-9.10.3-with-packages' to 'https://cache.nix-ci.com'...
  22864. 1380.30 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22865. 1380.56 s [post-build-hook] copying 1 paths...
  22866. 1380.56 s [post-build-hook] copying path '/nix/store/1xqz88kys42fm6v5qqvp6x8w3qfwdsc4-ghc-9.10.3-with-packages.drv' to 'https://cache.nix-ci.com'...
  22867. 1380.79 s Progress: 16 of 18 built, 193 of 193 downloaded from cache
  22868. 1380.86 s Building all-packages
  22869. 1380.97 s [all-packages] created 3 symlinks in user environment
  22870. 1381.03 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/ixzvjr63jxyv2qcimlscx110zhfd5s9a-all-packages
  22871. 1381.58 s [post-build-hook] Pushing 1 paths (145 are already present) using zstd to cache sellout ⏳
  22872. 1381.58 s [post-build-hook]
  22873. 1382.01 s [post-build-hook] Pushing /nix/store/ixzvjr63jxyv2qcimlscx110zhfd5s9a-all-packages (872.00 B)
  22874. 1383.07 s [post-build-hook]
  22875. 1383.07 s [post-build-hook] All done.
  22876. 1383.09 s [post-build-hook] Uploading to the NixCI cache: /nix/store/ixzvjr63jxyv2qcimlscx110zhfd5s9a-all-packages
  22877. 1383.15 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22878. 1383.38 s [post-build-hook] copying 1 paths...
  22879. 1383.38 s [post-build-hook] copying path '/nix/store/ixzvjr63jxyv2qcimlscx110zhfd5s9a-all-packages' to 'https://cache.nix-ci.com'...
  22880. 1383.68 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22881. 1383.94 s [post-build-hook] copying 1 paths...
  22882. 1383.94 s [post-build-hook] copying path '/nix/store/d05ddk1d5f6khh27jsdqgp9mmmszilqs-all-packages.drv' to 'https://cache.nix-ci.com'...
  22883. 1384.22 s Progress: 17 of 18 built, 193 of 193 downloaded from cache
Tail Raw Logs