1. 626.04 s [async] async_cancel: [OK]
  2. 626.04 s [async] async_cancel: [OK]
  3. 626.04 s [async] async_cancel: [OK]
  4. 626.04 s [async] async_cancel: [OK]
  5. 626.04 s [async] async_cancel: [OK]
  6. 626.04 s [async] async_cancel: [OK]
  7. 626.04 s [async] async_cancel: [OK]
  8. 626.04 s [async] async_cancel: [OK]
  9. 626.04 s [async] async_cancel: [OK]
  10. 626.04 s [async] async_cancel: [OK]
  11. 626.04 s [async] async_cancel: [OK]
  12. 626.04 s [async] async_cancel: [OK]
  13. 626.04 s [async] async_cancel: [OK]
  14. 626.04 s [async] async_cancel: [OK]
  15. 626.04 s [async] async_cancel: [OK]
  16. 626.04 s [async] async_cancel: [OK]
  17. 626.04 s [async] async_cancel: [OK]
  18. 626.04 s [async] async_cancel: [OK]
  19. 626.04 s [async] async_cancel: [OK]
  20. 626.04 s [async] async_cancel: [OK]
  21. 626.04 s [async] async_cancel: [OK]
  22. 626.04 s [async] async_cancel: [OK]
  23. 626.04 s [async] async_cancel: [OK]
  24. 626.04 s [async] async_cancel: [OK]
  25. 626.04 s [async] async_cancel: [OK]
  26. 626.04 s [async] async_cancel: [OK]
  27. 626.04 s [async] async_cancel: [OK]
  28. 626.04 s [async] async_cancel: [OK]
  29. 626.04 s [async] async_cancel: [OK]
  30. 626.04 s [async] async_cancel: [OK]
  31. 626.04 s [async] async_cancel: [OK]
  32. 626.04 s [async] async_cancel: [OK]
  33. 626.04 s [async] async_cancel: [OK]
  34. 626.04 s [async] async_cancel: [OK]
  35. 626.04 s [async] async_cancel: [OK]
  36. 626.04 s [async] async_cancel: [OK]
  37. 626.04 s [async] async_cancel: [OK]
  38. 626.04 s [async] async_cancel: [OK]
  39. 626.04 s [async] async_cancel: [OK]
  40. 626.04 s [async] async_cancel: [OK]
  41. 626.04 s [async] async_cancel: [OK]
  42. 626.04 s [async] async_cancel: [OK]
  43. 626.04 s [async] async_cancel: [OK]
  44. 626.04 s [async] async_cancel: [OK]
  45. 626.04 s [async] async_cancel: [OK]
  46. 626.04 s [async] async_cancel: [OK]
  47. 626.04 s [async] async_cancel: [OK]
  48. 626.04 s [async] async_cancel: [OK]
  49. 626.04 s [async] async_cancel: [OK]
  50. 626.04 s [async] async_cancel: [OK]
  51. 626.04 s [async] async_cancel: [OK]
  52. 626.04 s [async] async_cancel: [OK]
  53. 626.04 s [async] async_cancel: [OK]
  54. 626.04 s [async] async_cancel: [OK]
  55. 626.04 s [async] async_cancel: [OK]
  56. 626.04 s [async] async_cancel: [OK]
  57. 626.04 s [async] async_cancel: [OK]
  58. 626.04 s [async] async_cancel: [OK]
  59. 626.04 s [async] async_cancel: [OK]
  60. 626.04 s [async] async_cancel: [OK]
  61. 626.04 s [async] async_cancel: [OK]
  62. 626.04 s [async] async_cancel: [OK]
  63. 626.04 s [async] async_cancel: [OK]
  64. 626.04 s [async] async_cancel: [OK]
  65. 626.04 s [async] async_cancel: [OK]
  66. 626.04 s [async] async_cancel: [OK]
  67. 626.04 s [async] async_cancel: [OK]
  68. 626.04 s [async] async_cancel: [OK]
  69. 626.04 s [async] async_cancel: [OK]
  70. 626.04 s [async] async_cancel: [OK]
  71. 626.04 s [async] async_cancel: [OK]
  72. 626.04 s [async] async_cancel: [OK]
  73. 626.04 s [async] async_cancel: [OK]
  74. 626.04 s [async] async_cancel: [OK]
  75. 626.04 s [async] async_cancel: [OK]
  76. 626.04 s [async] async_cancel: [OK]
  77. 626.04 s [async] async_cancel: [OK]
  78. 626.04 s [async] async_cancel: [OK]
  79. 626.04 s [async] async_cancel: [OK]
  80. 626.04 s [async] async_cancel: [OK]
  81. 626.04 s [async] async_cancel: [OK]
  82. 626.04 s [async] async_cancel: [OK]
  83. 626.04 s [async] async_cancel: [OK]
  84. 626.04 s [async] async_cancel: [OK]
  85. 626.04 s [async] async_cancel: [OK]
  86. 626.04 s [async] async_cancel: [OK]
  87. 626.04 s [async] async_cancel: [OK]
  88. 626.04 s [async] async_cancel: [OK]
  89. 626.04 s [async] async_cancel: [OK]
  90. 626.04 s [async] async_cancel: [OK]
  91. 626.04 s [async] async_cancel: [OK]
  92. 626.04 s [async] async_cancel: [OK]
  93. 626.04 s [async] async_cancel: [OK]
  94. 626.04 s [async] async_cancel: [OK]
  95. 626.04 s [async] async_cancel: [OK]
  96. 626.04 s [async] async_cancel: [OK]
  97. 626.04 s [async] async_cancel: [OK]
  98. 626.04 s [async] async_cancel: [OK]
  99. 626.04 s [async] async_cancel: [OK]
  100. 626.04 s [async] async_cancel: [OK]
  101. 626.05 s [duoids] Phase: setupCompilerEnvironmentPhase
  102. 626.05 s [duoids] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  103. 626.05 s [duoids] Phase: unpackPhase
  104. 626.05 s [duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./core
  105. 626.05 s [duoids] source root is core
  106. 626.05 s [duoids] Phase: patchPhase
  107. 626.05 s [duoids] Phase: compileBuildDriverPhase
  108. 626.05 s [duoids] setupCompileFlags: -package-db=/build/tmp.6Oj6yTkwdf/setup-package.conf.d -threaded
  109. 626.05 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.6Oj6yTkwdf/Main.o )
  110. 626.05 s [duoids] [2 of 2] Linking Setup
  111. 626.05 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  112. 626.05 s [duoids] Phase: configurePhase
  113. 626.05 s [duoids] configureFlags: --verbose --prefix=/nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.6Oj6yTkwdf/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/lib
  114. 626.05 s [duoids] Using Parsec parser
  115. 626.05 s [duoids] Configuring duoids-0.0.1.0...
  116. 626.05 s [duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  117. 626.05 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  118. 626.05 s [duoids] >=4.21.0 && <4.22: using base-4.18.1.0
  119. 626.05 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  120. 626.05 s [duoids] >=4.21.0 && <4.22: using base-4.18.1.0
  121. 626.05 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  122. 626.05 s [duoids] <0.25: using doctest-0.22.6
  123. 626.05 s [duoids] Dependency duoids: using duoids-0.0.1.0
  124. 626.05 s [duoids] Source component graph:
  125. 626.05 s [duoids] component lib
  126. 626.05 s [duoids] component test:doctests dependency lib
  127. 626.05 s [duoids] Configured component graph:
  128. 626.05 s [duoids] component duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  129. 626.05 s [duoids] include base-4.18.1.0
  130. 626.05 s [duoids] component duoids-0.0.1.0-9psBocfhtdJ8tagOMBUbcl-doctests
  131. 626.05 s [duoids] include base-4.18.1.0
  132. 626.05 s [duoids] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  133. 626.05 s [duoids] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  134. 626.05 s [duoids] Linked component graph:
  135. 626.05 s [duoids] unit duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  136. 626.05 s [duoids] include base-4.18.1.0
  137. 626.05 s [duoids] Control.Duoidal=duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM:Control.Duoidal,Control.Duoidal.Do=duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM:Control.Duoidal.Do,Control.Duoidal.Either=duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM:Control.Duoidal.Either,Control.Duoidal.Fail=duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM:Control.Duoidal.Fail,Control.Duoidal.Fix=duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM:Control.Duoidal.Fix,Control.Duoidal.Laws=duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM:Data.Duoid.Laws
  138. 626.05 s [duoids] unit duoids-0.0.1.0-9psBocfhtdJ8tagOMBUbcl-doctests
  139. 626.05 s [duoids] include base-4.18.1.0
  140. 626.05 s [duoids] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  141. 626.05 s [duoids] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  142. 626.05 s [duoids] Ready component graph:
  143. 626.05 s [duoids] definite duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  144. 626.05 s [duoids] depends base-4.18.1.0
  145. 626.05 s [strict] Phase: setupCompilerEnvironmentPhase
  146. 626.05 s [strict] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  147. 626.05 s [strict] Phase: unpackPhase
  148. 626.05 s [strict] unpacking source archive /nix/store/fsrb31ha52zg847j45yqvbbss2qhks1b-strict-0.5.1.tar.gz
  149. 626.05 s [strict] source root is strict-0.5.1
  150. 626.05 s [strict] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "strict-0.5.1/strict.cabal"
  151. 626.05 s [strict] Phase: patchPhase
  152. 626.05 s [strict] Replace Cabal file with edited version from mirror://hackage/strict-0.5.1/revision/1.cabal.
  153. 626.05 s [strict] Phase: compileBuildDriverPhase
  154. 626.05 s [strict] setupCompileFlags: -package-db=/build/tmp.SrlIqCmJx7/setup-package.conf.d -threaded
  155. 626.05 s [strict] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.SrlIqCmJx7/Main.o )
  156. 626.05 s [strict] [2 of 2] Linking Setup
  157. 626.05 s [strict] Phase: updateAutotoolsGnuConfigScriptsPhase
  158. 626.05 s [strict] Phase: configurePhase
  159. 626.05 s [strict] configureFlags: --verbose --prefix=/nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc/share/doc/strict-0.5.1 --with-gcc=gcc --package-db=/build/tmp.SrlIqCmJx7/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  160. 626.05 s [strict] Using Parsec parser
  161. 626.05 s [strict] Configuring strict-0.5.1...
  162. 626.05 s [strict] Dependency assoc >=1.1.1 && <1.2: using assoc-1.1.1
  163. 626.05 s [strict] Dependency base >=4.12.0.0 && <5: using base-4.18.1.0
  164. 626.05 s [strict] Dependency binary >=0.8.6.0 && <0.9: using binary-0.8.9.1
  165. 626.05 s [strict] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.11.5.2
  166. 626.05 s [strict] Dependency deepseq >=1.4.4.0 && <1.6: using deepseq-1.4.8.1
  167. 626.05 s [strict] Dependency ghc-prim: using ghc-prim-0.10.0
  168. 626.05 s [strict] Dependency hashable >=1.4.7.0 && <1.6: using hashable-1.4.7.0
  169. 626.05 s [strict] Dependency text >=1.2.3.1 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  170. 626.05 s [strict] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  171. 626.05 s [strict] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
  172. 626.05 s [strict] Source component graph: component lib
  173. 626.05 s [strict] Configured component graph:
  174. 626.05 s [strict] component strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a
  175. 626.05 s [strict] include assoc-1.1.1-Drq9QKvUYiAOaSIX2zWsU
  176. 626.05 s [strict] include base-4.18.1.0
  177. 626.05 s [strict] include binary-0.8.9.1
  178. 626.05 s [strict] include bytestring-0.11.5.2
  179. 626.05 s [strict] include deepseq-1.4.8.1
  180. 626.05 s [strict] include ghc-prim-0.10.0
  181. 626.05 s [strict] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  182. 626.05 s [strict] include text-2.0.2
  183. 626.05 s [strict] include these-1.2.1-5P6Fv3Pe7oRFsFG3HrYm87
  184. 626.05 s [strict] include transformers-0.6.1.0
  185. 626.05 s [strict] Linked component graph:
  186. 626.05 s [strict] unit strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a
  187. 626.05 s [strict] include assoc-1.1.1-Drq9QKvUYiAOaSIX2zWsU
  188. 626.05 s [strict] include base-4.18.1.0
  189. 626.05 s [strict] include binary-0.8.9.1
  190. 626.05 s [strict] include bytestring-0.11.5.2
  191. 626.05 s [strict] include deepseq-1.4.8.1
  192. 626.05 s [strict] include ghc-prim-0.10.0
  193. 626.05 s [strict] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  194. 626.05 s [strict] include text-2.0.2
  195. 626.05 s [strict] include these-1.2.1-5P6Fv3Pe7oRFsFG3HrYm87
  196. 626.05 s [strict] include transformers-0.6.1.0
  197. 626.11 s [text-short:post-build] Uploading to cachix cache "sellout": /nix/store/k51fjhx28lpsf1fdcjvidhnqy926ykxq-text-short-0.1.6-doc /nix/store/nxmhcl5a4xn80s1ag7shsydp54qfcgpf-text-short-0.1.6
  198. 626.64 s [text-short:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  199. 626.64 s [text-short:post-build]
  200. 627.00 s [text-short:post-build] Pushing /nix/store/nxmhcl5a4xn80s1ag7shsydp54qfcgpf-text-short-0.1.6 (1.71 MiB)
  201. 627.08 s [text-short:post-build] Pushing /nix/store/k51fjhx28lpsf1fdcjvidhnqy926ykxq-text-short-0.1.6-doc (1.15 MiB)
  202. 628.13 s [text-short:post-build]
  203. 628.28 s [text-short:post-build] All done.
  204. 628.28 s [text-short:post-build] Uploading to the NixCI cache: /nix/store/k51fjhx28lpsf1fdcjvidhnqy926ykxq-text-short-0.1.6-doc /nix/store/nxmhcl5a4xn80s1ag7shsydp54qfcgpf-text-short-0.1.6
  205. 628.28 s [text-short:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  206. 628.45 s [text-short:post-build] copying 2 paths...
  207. 628.45 s [text-short:post-build] copying path '/nix/store/k51fjhx28lpsf1fdcjvidhnqy926ykxq-text-short-0.1.6-doc' to 'https://cache.nix-ci.com'...
  208. 628.88 s [text-short:post-build] copying path '/nix/store/nxmhcl5a4xn80s1ag7shsydp54qfcgpf-text-short-0.1.6' to 'https://cache.nix-ci.com'...
  209. 629.63 s [text-short:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  210. 629.87 s [text-short:post-build] copying 1 paths...
  211. 629.87 s [text-short:post-build] copying path '/nix/store/0h05jwmw2pbw1vfsv7r9v9aa4h62bf77-text-short-0.1.6.drv' to 'https://cache.nix-ci.com'...
  212. 630.12 s Progress: 87 of 116 built (5 building), 172 of 172 downloaded from cache
  213. 630.12 s [time-compat] 1968-0-2 = 1968-01-02: OK
  214. 630.12 s [time-compat] 1968-0-27 = 1968-01-27: OK
  215. 630.12 s [time-compat] 1968-0-28 = 1968-01-28: OK
  216. 630.12 s [time-compat] 1968-0-29 = 1968-01-29: OK
  217. 630.12 s [time-compat] 1968-0-30 = 1968-01-30: OK
  218. 630.12 s [time-compat] 1968-0-31 = 1968-01-31: OK
  219. 630.12 s [time-compat] 1968-0-32 = 1968-01-31: OK
  220. 630.12 s [time-compat] 1968-0-40 = 1968-01-31: OK
  221. 630.12 s [time-compat] 1968-1--7 = 1968-01-01: OK
  222. 630.12 s [time-compat] 1968-1--1 = 1968-01-01: OK
  223. 630.12 s [time-compat] 1968-1-0 = 1968-01-01: OK
  224. 630.12 s [time-compat] 1968-1-1 = 1968-01-01: OK
  225. 630.12 s [time-compat] 1968-1-2 = 1968-01-02: OK
  226. 630.12 s [time-compat] 1968-1-27 = 1968-01-27: OK
  227. 630.12 s [time-compat] 1968-1-28 = 1968-01-28: OK
  228. 630.12 s [time-compat] 1968-1-29 = 1968-01-29: OK
  229. 630.12 s [time-compat] 1968-1-30 = 1968-01-30: OK
  230. 630.12 s [time-compat] 1968-1-31 = 1968-01-31: OK
  231. 630.12 s [time-compat] 1968-1-32 = 1968-01-31: OK
  232. 630.12 s [time-compat] 1968-1-40 = 1968-01-31: OK
  233. 630.12 s [time-compat] 1968-2--7 = 1968-02-01: OK
  234. 630.12 s [time-compat] 1968-2--1 = 1968-02-01: OK
  235. 630.12 s [time-compat] 1968-2-0 = 1968-02-01: OK
  236. 630.12 s [time-compat] 1968-2-1 = 1968-02-01: OK
  237. 630.12 s [time-compat] 1968-2-2 = 1968-02-02: OK
  238. 630.12 s [time-compat] 1968-2-27 = 1968-02-27: OK
  239. 630.12 s [time-compat] 1968-2-28 = 1968-02-28: OK
  240. 630.12 s [time-compat] 1968-2-29 = 1968-02-29: OK
  241. 630.12 s [time-compat] 1968-2-30 = 1968-02-29: OK
  242. 630.12 s [time-compat] 1968-2-31 = 1968-02-29: OK
  243. 630.12 s [time-compat] 1968-2-32 = 1968-02-29: OK
  244. 630.12 s [time-compat] 1968-2-40 = 1968-02-29: OK
  245. 630.12 s [time-compat] 1968-12--7 = 1968-12-01: OK
  246. 630.12 s [time-compat] 1968-12--1 = 1968-12-01: OK
  247. 630.12 s [time-compat] 1968-12-0 = 1968-12-01: OK
  248. 630.12 s [time-compat] 1968-12-1 = 1968-12-01: OK
  249. 630.12 s [time-compat] 1968-12-2 = 1968-12-02: OK
  250. 630.12 s [time-compat] 1968-12-27 = 1968-12-27: OK
  251. 630.12 s [time-compat] 1968-12-28 = 1968-12-28: OK
  252. 630.12 s [time-compat] 1968-12-29 = 1968-12-29: OK
  253. 630.12 s [time-compat] 1968-12-30 = 1968-12-30: OK
  254. 630.12 s [time-compat] 1968-12-31 = 1968-12-31: OK
  255. 630.12 s [time-compat] 1968-12-32 = 1968-12-31: OK
  256. 630.12 s [time-compat] 1968-12-40 = 1968-12-31: OK
  257. 630.12 s [time-compat] 1968-13--7 = 1968-12-01: OK
  258. 630.12 s [time-compat] 1968-13--1 = 1968-12-01: OK
  259. 630.12 s [time-compat] 1968-13-0 = 1968-12-01: OK
  260. 630.12 s [time-compat] 1968-13-1 = 1968-12-01: OK
  261. 630.12 s [vector] Phase: setupCompilerEnvironmentPhase
  262. 630.12 s [vector] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  263. 630.12 s [vector] Phase: unpackPhase
  264. 630.12 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  265. 630.12 s [vector] source root is vector-0.13.2.0
  266. 630.12 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  267. 630.12 s [vector] Phase: patchPhase
  268. 630.12 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/1.cabal.
  269. 630.12 s [vector] Phase: compileBuildDriverPhase
  270. 630.12 s [vector] setupCompileFlags: -package-db=/build/tmp.xJCACGhIg0/setup-package.conf.d -threaded
  271. 630.12 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.xJCACGhIg0/Main.o )
  272. 630.12 s [vector] [2 of 2] Linking Setup
  273. 630.12 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  274. 630.12 s [vector] Phase: configurePhase
  275. 630.12 s [vector] configureFlags: --verbose --prefix=/nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.xJCACGhIg0/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/lib
  276. 630.12 s [vector] Using Parsec parser
  277. 630.12 s [vector] Configuring vector-0.13.2.0...
  278. 630.12 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  279. 630.12 s [vector] wall=False
  280. 630.12 s [vector] Dependency base >=4.9 && <4.22: using base-4.18.1.0
  281. 630.12 s [vector] Dependency deepseq >=1.1 && <1.6: using deepseq-1.4.8.1
  282. 630.12 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  283. 630.12 s [vector] Dependency vector-stream >=0.1 && <0.2: using vector-stream-0.1.0.1
  284. 630.12 s [vector] Dependency base: using base-4.18.1.0
  285. 630.12 s [vector] Dependency random >=1.2: using random-1.2.1.3
  286. 630.12 s [vector] Dependency tasty: using tasty-1.5.3
  287. 630.12 s [vector] Dependency vector: using vector-0.13.2.0
  288. 630.12 s [vector] Dependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
  289. 630.13 s [vector] Dependency base >=4.5 && <5: using base-4.18.1.0
  290. 630.13 s [vector] Dependency base-orphans >=0.6: using base-orphans-0.9.3
  291. 630.13 s [vector] Dependency primitive: using primitive-0.9.1.0
  292. 630.13 s [vector] Dependency random: using random-1.2.1.3
  293. 630.13 s [vector] Dependency tasty: using tasty-1.5.3
  294. 630.13 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  295. 630.13 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
  296. 630.13 s [vector] Dependency template-haskell: using template-haskell-2.20.0.0
  297. 630.13 s [vector] Dependency transformers >=0.2.0.0: using transformers-0.6.1.0
  298. 630.13 s [vector] Dependency vector: using vector-0.13.2.0
  299. 630.13 s [vector] Dependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
  300. 630.13 s [vector] Dependency base >=4.5 && <5: using base-4.18.1.0
  301. 630.13 s [vector] Dependency base-orphans >=0.6: using base-orphans-0.9.3
  302. 630.13 s [vector] Dependency primitive: using primitive-0.9.1.0
  303. 630.13 s [vector] Dependency random: using random-1.2.1.3
  304. 630.13 s [vector] Dependency tasty: using tasty-1.5.3
  305. 630.13 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  306. 630.13 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
  307. 630.13 s [vector] Dependency template-haskell: using template-haskell-2.20.0.0
  308. 630.13 s [vector] Dependency transformers >=0.2.0.0: using transformers-0.6.1.0
  309. 630.13 s [vector] Dependency vector: using vector-0.13.2.0
  310. 630.13 s [vector] Dependency base: using base-4.18.1.0
  311. 630.13 s [vector] Dependency doctest >=0.15 && <0.24: using doctest-0.22.6
  312. 630.13 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  313. 630.13 s [vector] Dependency vector: using vector-0.13.2.0
  314. 630.13 s [vector] Dependency base: using base-4.18.1.0
  315. 630.13 s [async] async_cancel: [OK]
  316. 630.13 s [async] async_cancel: [OK]
  317. 630.13 s [async] async_cancel: [OK]
  318. 630.13 s [async] async_cancel: [OK]
  319. 630.13 s [async] async_cancel: [OK]
  320. 630.13 s [async] async_cancel: [OK]
  321. 630.13 s [async] async_cancel: [OK]
  322. 630.13 s [async] async_cancel: [OK]
  323. 630.13 s [async] async_cancel: [OK]
  324. 630.13 s [async] async_cancel: [OK]
  325. 630.13 s [async] async_cancel: [OK]
  326. 630.13 s [async] async_cancel: [OK]
  327. 630.13 s [async] async_cancel: [OK]
  328. 630.13 s [async] async_cancel: [OK]
  329. 630.13 s [async] async_cancel: [OK]
  330. 630.13 s [async] async_cancel: [OK]
  331. 630.13 s [async] async_cancel: [OK]
  332. 630.13 s [async] async_cancel: [OK]
  333. 630.13 s [async] async_cancel: [OK]
  334. 630.13 s [async] async_cancel: [OK]
  335. 630.13 s [async] async_cancel: [OK]
  336. 630.13 s [async] async_cancel: [OK]
  337. 630.13 s [async] async_cancel: [OK]
  338. 630.13 s [async] async_cancel: [OK]
  339. 630.13 s [async] async_cancel: [OK]
  340. 630.13 s [async] async_cancel: [OK]
  341. 630.13 s [async] async_cancel: [OK]
  342. 630.13 s [async] async_cancel: [OK]
  343. 630.13 s [async] async_cancel: [OK]
  344. 630.13 s [async] async_cancel: [OK]
  345. 630.13 s [async] async_cancel: [OK]
  346. 630.13 s [async] async_cancel: [OK]
  347. 630.13 s [async] async_cancel: [OK]
  348. 630.13 s [async] async_cancel: [OK]
  349. 630.13 s [async] async_cancel: [OK]
  350. 630.13 s [async] async_cancel: [OK]
  351. 630.13 s [async] async_cancel: [OK]
  352. 630.13 s [async] async_cancel: [OK]
  353. 630.13 s [async] async_cancel: [OK]
  354. 630.13 s [async] async_cancelmany: [OK]
  355. 630.13 s [async] async_poll: [OK]
  356. 630.13 s [async] async_poll2: [OK]
  357. 630.13 s [async] withasync_waitCatch_blocked: [OK]
  358. 630.13 s [async] withasync_wait_blocked: [OK]
  359. 630.13 s [async] children surviving too long:
  360. 630.13 s [async] concurrently+success: [OK]
  361. 630.13 s [async] concurrently+failure: [OK]
  362. 630.13 s [async] concurrentlyE+success: [OK]
  363. 630.13 s [async] concurrentlyE+failure: [OK]
  364. 630.13 s [async] race+success: [OK]
  365. 630.13 s [async] race+failure: [OK]
  366. 630.13 s [async] cancel: [OK]
  367. 630.13 s [async] withAsync: [OK]
  368. 630.13 s [async] concurrently_: [OK]
  369. 630.13 s [async] replicateConcurrently_: [OK]
  370. 630.13 s [async] replicateConcurrently: [OK]
  371. 630.13 s [async] link1: [OK]
  372. 630.13 s [async] link2: [OK]
  373. 630.13 s [async] link1_cancel: [OK]
  374. 630.13 s [async] concurrently_deadlock: [OK]
  375. 630.13 s [async] concurrentlyE_deadlock: [OK]
  376. 630.13 s [async] concurrentlyE:
  377. 630.13 s [async] concurrentlyE_right: [OK]
  378. 630.13 s [async] concurrentlyE_left1: [OK]
  379. 630.13 s [async] concurrentlyE_left2: [OK]
  380. 630.13 s [async] concurrentlyE_earlyException: [OK]
  381. 630.13 s [async] concurrentlyE_lateException: [OK]
  382. 630.13 s [async] concurrentlyE_Monoid: [OK]
  383. 630.13 s [async] concurrentlyE_Monoid_fail: [OK]
  384. 630.13 s [async]
  385. 630.13 s [async] Test Cases Total
  386. 630.13 s [async] Passed 1034 1034
  387. 630.13 s [async] Failed 0 0
  388. 630.13 s [async] Total 1034 1034
  389. 630.13 s [async] Test suite test-async: PASS
  390. 630.13 s [async] Test suite logged to: dist/test/async-2.2.5-test-async.log
  391. 630.13 s [async] 1 of 1 test suites (1 of 1 test cases) passed.
  392. 630.13 s [async] Phase: haddockPhase
  393. 630.13 s [async] Preprocessing library for async-2.2.5..
  394. 630.13 s [async] Running Haddock on library for async-2.2.5..
  395. 630.13 s [async] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  396. 630.13 s [async] 86% ( 58 / 67) in 'Control.Concurrent.Async.Internal'
  397. 630.13 s [async] Missing documentation for:
  398. 630.13 s [async] asyncUsing (Control/Concurrent/Async/Internal.hs:122)
  399. 630.13 s [async] withAsyncUsing (Control/Concurrent/Async/Internal.hs:174)
  400. 630.13 s [async] ExceptionInLinkedThread (Control/Concurrent/Async/Internal.hs:460)
  401. 630.13 s [async] isCancel (Control/Concurrent/Async/Internal.hs:541)
  402. 630.13 s [async] concurrently' (Control/Concurrent/Async/Internal.hs:646)
  403. 630.13 s [async] catchAll (Control/Concurrent/Async/Internal.hs:857)
  404. 630.13 s [async] tryAll (Control/Concurrent/Async/Internal.hs:860)
  405. 630.13 s [async] rawForkIO (Control/Concurrent/Async/Internal.hs:867)
  406. 630.13 s [async] rawForkOn (Control/Concurrent/Async/Internal.hs:872)
  407. 630.13 s [async]
  408. 630.13 s [async] Control/Concurrent/Async/Internal.hs:50:1: warning: [-Wunused-imports]
  409. 630.13 s [async] The import of ‘Data.Semigroup’ is redundant
  410. 630.13 s [async] except perhaps to import instances from ‘Data.Semigroup’
  411. 630.13 s [async] To import instances alone, use: import Data.Semigroup()
  412. 630.13 s [async] |
  413. 630.13 s [async] 50 | import Data.Semigroup (Semigroup((<>)))
  414. 630.13 s [async] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  415. 630.13 s [async] Warning: 'forkIO' is out of scope.
  416. 630.13 s [async] If you qualify the identifier, haddock can try to link it anyway.
  417. 630.13 s [async] Warning: 'Alternative' is out of scope.
  418. 630.13 s [async] If you qualify the identifier, haddock can try to link it anyway.
  419. 630.13 s [async] 98% ( 70 / 71) in 'Control.Concurrent.Async'
  420. 630.13 s [async] Missing documentation for:
  421. 630.13 s [async] ExceptionInLinkedThread (Control/Concurrent/Async/Internal.hs:460)
  422. 630.13 s [async] Documentation created: dist/doc/html/async/index.html,
  423. 630.13 s [async] dist/doc/html/async/async.txt
  424. 630.13 s [async] Preprocessing test suite 'test-async' for async-2.2.5..
  425. 630.13 s [async] haddockPhase completed in 42 seconds
  426. 630.13 s [async] Phase: installPhase
  427. 630.13 s [async] Installing library in /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  428. 630.13 s [async] Phase: fixupPhase
  429. 630.13 s [duoids] definite duoids-0.0.1.0-9psBocfhtdJ8tagOMBUbcl-doctests
  430. 630.13 s [duoids] depends base-4.18.1.0
  431. 630.13 s [duoids] depends doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  432. 630.13 s [duoids] depends duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  433. 630.13 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.6
  434. 630.13 s [duoids] Using compiler: ghc-9.6.3
  435. 630.13 s [duoids] Using install prefix:
  436. 630.13 s [duoids] /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0
  437. 630.13 s [duoids] Executables installed in:
  438. 630.13 s [duoids] /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/bin
  439. 630.13 s [duoids] Libraries installed in:
  440. 630.13 s [duoids] /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  441. 630.13 s [duoids] Dynamic Libraries installed in:
  442. 630.13 s [duoids] /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  443. 630.13 s [duoids] Private executables installed in:
  444. 630.13 s [duoids] /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.6.3/duoids-0.0.1.0
  445. 630.13 s [duoids] Data files installed in:
  446. 630.13 s [duoids] /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/share/x86_64-linux-ghc-9.6.3/duoids-0.0.1.0
  447. 630.13 s [duoids] Documentation installed in:
  448. 630.13 s [duoids] /nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  449. 630.13 s [duoids] Configuration files installed in:
  450. 630.13 s [duoids] /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/etc
  451. 630.13 s [duoids] No alex found
  452. 630.13 s [duoids] Using ar found on system at:
  453. 630.13 s [duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  454. 630.13 s [duoids] No c2hs found
  455. 630.13 s [duoids] No cpphs found
  456. 630.13 s [duoids] Using doctest version 0.22.6 found on system at:
  457. 630.13 s [duoids] /nix/store/1rhhhdgycbwrgfgqrs5rr0mmh6r4ly3h-doctest-0.22.6/bin/doctest
  458. 630.13 s [duoids] Using gcc version 14.3.0 given by user at:
  459. 630.13 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  460. 630.13 s [duoids] Using ghc version 9.6.3 found on system at:
  461. 630.13 s [duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  462. 630.13 s [duoids] Using ghc-pkg version 9.6.3 found on system at:
  463. 630.13 s [duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  464. 630.13 s [duoids] No ghcjs found
  465. 630.13 s [duoids] No ghcjs-pkg found
  466. 630.13 s [duoids] No greencard found
  467. 630.13 s [duoids] Using haddock version 2.29.1 found on system at:
  468. 630.13 s [duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  469. 630.13 s [duoids] No happy found
  470. 630.13 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  471. 630.13 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  472. 630.13 s [duoids] No hmake found
  473. 630.13 s [duoids] Using hpc version 0.68 found on system at:
  474. 630.13 s [duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  475. 630.13 s [duoids] Using hsc2hs version 0.68.9 found on system at:
  476. 630.13 s [duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  477. 630.13 s [duoids] Using hscolour version 1.25 found on system at:
  478. 630.13 s [duoids] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  479. 630.13 s [duoids] No jhc found
  480. 630.13 s [duoids] Using ld found on system at:
  481. 630.13 s [duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  482. 630.13 s [duoids] No pkg-config found
  483. 630.13 s [duoids] Using runghc version 9.6.3 found on system at:
  484. 630.13 s [duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  485. 630.13 s [duoids] Using strip version 2.44 found on system at:
  486. 630.13 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  487. 630.13 s [duoids] Using tar found on system at:
  488. 630.13 s [duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  489. 630.13 s [duoids] No uhc found
  490. 630.13 s [duoids] Phase: buildPhase
  491. 630.13 s [duoids] Preprocessing library for duoids-0.0.1.0...
  492. 630.13 s [duoids] Building library for duoids-0.0.1.0...
  493. 630.13 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  494. 630.13 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  495. 630.13 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  496. 630.13 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.o, dist/build/Control/Duoidal/Fix.dyn_o )
  497. 630.13 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.o, dist/build/Control/Duoidal/Fail.dyn_o )
  498. 630.13 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  499. 630.13 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.o, dist/build/Control/Duoidal/Do.dyn_o )
  500. 630.13 s [strict] Data.Strict=strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a:Data.Strict,Data.Strict.Classes=strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a:Data.Strict.Classes,Data.Strict.Either=strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a:Data.Strict.Either,Data.Strict.Maybe=strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a:Data.Strict.Maybe,Data.Strict.These=strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a:Data.Strict.These,Data.Strict.Tuple=strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a:Data.Strict.Tuple,System.IO.Strict=strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a:System.IO.Strict
  501. 630.13 s [strict] Ready component graph:
  502. 630.13 s [strict] definite strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a
  503. 630.13 s [strict] depends assoc-1.1.1-Drq9QKvUYiAOaSIX2zWsU
  504. 630.13 s [strict] depends base-4.18.1.0
  505. 630.13 s [strict] depends binary-0.8.9.1
  506. 630.13 s [strict] depends bytestring-0.11.5.2
  507. 630.13 s [strict] depends deepseq-1.4.8.1
  508. 630.13 s [strict] depends ghc-prim-0.10.0
  509. 630.13 s [strict] depends hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  510. 630.13 s [strict] depends text-2.0.2
  511. 630.13 s [strict] depends these-1.2.1-5P6Fv3Pe7oRFsFG3HrYm87
  512. 630.13 s [strict] depends transformers-0.6.1.0
  513. 630.13 s [strict] Using Cabal-3.10.1.0 compiled by ghc-9.6
  514. 630.13 s [strict] Using compiler: ghc-9.6.3
  515. 630.13 s [strict] Using install prefix: /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1
  516. 630.13 s [strict] Executables installed in:
  517. 630.13 s [strict] /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/bin
  518. 630.13 s [strict] Libraries installed in:
  519. 630.13 s [strict] /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a
  520. 630.13 s [strict] Dynamic Libraries installed in:
  521. 630.13 s [strict] /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  522. 630.13 s [strict] Private executables installed in:
  523. 630.13 s [strict] /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/libexec/x86_64-linux-ghc-9.6.3/strict-0.5.1
  524. 630.13 s [strict] Data files installed in:
  525. 630.13 s [strict] /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/share/x86_64-linux-ghc-9.6.3/strict-0.5.1
  526. 630.13 s [strict] Documentation installed in:
  527. 630.13 s [strict] /nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc/share/doc/strict-0.5.1
  528. 630.13 s [strict] Configuration files installed in:
  529. 630.13 s [strict] /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/etc
  530. 630.13 s [strict] No alex found
  531. 630.13 s [strict] Using ar found on system at:
  532. 630.13 s [strict] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  533. 630.13 s [strict] No c2hs found
  534. 630.13 s [strict] No cpphs found
  535. 630.13 s [strict] No doctest found
  536. 630.13 s [strict] Using gcc version 14.3.0 given by user at:
  537. 630.13 s [strict] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  538. 630.13 s [strict] Using ghc version 9.6.3 found on system at:
  539. 630.13 s [strict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  540. 630.13 s [strict] Using ghc-pkg version 9.6.3 found on system at:
  541. 630.13 s [strict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  542. 630.13 s [strict] No ghcjs found
  543. 630.13 s [strict] No ghcjs-pkg found
  544. 630.13 s [strict] No greencard found
  545. 630.13 s [strict] Using haddock version 2.29.1 found on system at:
  546. 630.13 s [strict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  547. 630.13 s [strict] No happy found
  548. 630.13 s [strict] Using haskell-suite found on system at: haskell-suite-dummy-location
  549. 630.13 s [strict] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  550. 630.13 s [strict] No hmake found
  551. 630.13 s [strict] Using hpc version 0.68 found on system at:
  552. 630.13 s [strict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  553. 630.13 s [strict] Using hsc2hs version 0.68.9 found on system at:
  554. 630.13 s [strict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  555. 630.13 s [strict] Using hscolour version 1.25 found on system at:
  556. 630.13 s [strict] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  557. 630.13 s [strict] No jhc found
  558. 630.13 s [strict] Using ld found on system at:
  559. 630.13 s [strict] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  560. 630.13 s [strict] No pkg-config found
  561. 630.13 s [strict] Using runghc version 9.6.3 found on system at:
  562. 630.13 s [strict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  563. 630.13 s [strict] Using strip version 2.44 found on system at:
  564. 630.13 s [strict] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  565. 630.13 s [strict] Using tar found on system at:
  566. 630.13 s [strict] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  567. 630.13 s [strict] No uhc found
  568. 630.13 s [strict] Phase: buildPhase
  569. 630.13 s [strict] Preprocessing library for strict-0.5.1..
  570. 630.13 s [strict] Building library for strict-0.5.1..
  571. 630.13 s [strict] [1 of 7] Compiling Data.Strict.Either ( src/Data/Strict/Either.hs, dist/build/Data/Strict/Either.o, dist/build/Data/Strict/Either.dyn_o )
  572. 630.13 s [strict] [2 of 7] Compiling Data.Strict.Maybe ( src/Data/Strict/Maybe.hs, dist/build/Data/Strict/Maybe.o, dist/build/Data/Strict/Maybe.dyn_o )
  573. 630.13 s [strict] [3 of 7] Compiling Data.Strict.These ( src/Data/Strict/These.hs, dist/build/Data/Strict/These.o, dist/build/Data/Strict/These.dyn_o )
  574. 630.13 s [strict] [4 of 7] Compiling Data.Strict.Tuple ( src/Data/Strict/Tuple.hs, dist/build/Data/Strict/Tuple.o, dist/build/Data/Strict/Tuple.dyn_o )
  575. 630.13 s [strict]
  576. 630.13 s [time-compat] 1968-13-2 = 1968-12-02: OK
  577. 630.13 s [time-compat] 1968-13-27 = 1968-12-27: OK
  578. 630.13 s [time-compat] 1968-13-28 = 1968-12-28: OK
  579. 630.13 s [time-compat] 1968-13-29 = 1968-12-29: OK
  580. 630.13 s [time-compat] 1968-13-30 = 1968-12-30: OK
  581. 630.13 s [time-compat] 1968-13-31 = 1968-12-31: OK
  582. 630.13 s [time-compat] 1968-13-32 = 1968-12-31: OK
  583. 630.13 s [time-compat] 1968-13-40 = 1968-12-31: OK
  584. 630.13 s [time-compat] 1968-17--7 = 1968-12-01: OK
  585. 630.13 s [time-compat] 1968-17--1 = 1968-12-01: OK
  586. 630.13 s [time-compat] 1968-17-0 = 1968-12-01: OK
  587. 630.13 s [time-compat] 1968-17-1 = 1968-12-01: OK
  588. 630.13 s [time-compat] 1968-17-2 = 1968-12-02: OK
  589. 630.13 s [time-compat] 1968-17-27 = 1968-12-27: OK
  590. 630.13 s [time-compat] 1968-17-28 = 1968-12-28: OK
  591. 630.13 s [time-compat] 1968-17-29 = 1968-12-29: OK
  592. 630.13 s [time-compat] 1968-17-30 = 1968-12-30: OK
  593. 630.13 s [time-compat] 1968-17-31 = 1968-12-31: OK
  594. 630.13 s [time-compat] 1968-17-32 = 1968-12-31: OK
  595. 630.13 s [time-compat] 1968-17-40 = 1968-12-31: OK
  596. 630.13 s [time-compat] 1969--20--7 = 1969-01-01: OK
  597. 630.13 s [time-compat] 1969--20--1 = 1969-01-01: OK
  598. 630.13 s [time-compat] 1969--20-0 = 1969-01-01: OK
  599. 630.13 s [time-compat] 1969--20-1 = 1969-01-01: OK
  600. 630.13 s [time-compat] 1969--20-2 = 1969-01-02: OK
  601. 630.13 s [time-compat] 1969--20-27 = 1969-01-27: OK
  602. 630.13 s [time-compat] 1969--20-28 = 1969-01-28: OK
  603. 630.13 s [time-compat] 1969--20-29 = 1969-01-29: OK
  604. 630.13 s [time-compat] 1969--20-30 = 1969-01-30: OK
  605. 630.13 s [time-compat] 1969--20-31 = 1969-01-31: OK
  606. 630.13 s [time-compat] 1969--20-32 = 1969-01-31: OK
  607. 630.13 s [time-compat] 1969--20-40 = 1969-01-31: OK
  608. 630.13 s [time-compat] 1969--1--7 = 1969-01-01: OK
  609. 630.13 s [time-compat] 1969--1--1 = 1969-01-01: OK
  610. 630.13 s [time-compat] 1969--1-0 = 1969-01-01: OK
  611. 630.13 s [time-compat] 1969--1-1 = 1969-01-01: OK
  612. 630.13 s [time-compat] 1969--1-2 = 1969-01-02: OK
  613. 630.13 s [time-compat] 1969--1-27 = 1969-01-27: OK
  614. 630.13 s [time-compat] 1969--1-28 = 1969-01-28: OK
  615. 630.13 s [time-compat] 1969--1-29 = 1969-01-29: OK
  616. 630.13 s [time-compat] 1969--1-30 = 1969-01-30: OK
  617. 630.13 s [time-compat] 1969--1-31 = 1969-01-31: OK
  618. 630.13 s [time-compat] 1969--1-32 = 1969-01-31: OK
  619. 630.13 s [time-compat] 1969--1-40 = 1969-01-31: OK
  620. 630.13 s [time-compat] 1969-0--7 = 1969-01-01: OK
  621. 630.13 s [time-compat] 1969-0--1 = 1969-01-01: OK
  622. 630.13 s [time-compat] 1969-0-0 = 1969-01-01: OK
  623. 630.13 s [time-compat] 1969-0-1 = 1969-01-01: OK
  624. 630.13 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  625. 630.13 s [vector] Dependency tasty: using tasty-1.5.3
  626. 630.13 s [vector] Dependency tasty-inspection-testing >=0.1: using
  627. 630.13 s [vector] tasty-inspection-testing-0.2.1
  628. 630.13 s [vector] Dependency vector: using vector-0.13.2.0
  629. 630.13 s [vector] Source component graph:
  630. 630.13 s [vector] component lib
  631. 630.13 s [vector] component lib:benchmarks-O2 dependency lib
  632. 630.13 s [vector] component test:vector-doctest dependency lib
  633. 630.13 s [vector] component test:vector-inspection dependency lib
  634. 630.13 s [vector] component test:vector-tests-O0 dependency lib
  635. 630.13 s [vector] component test:vector-tests-O2 dependency lib
  636. 630.13 s [vector] Configured component graph:
  637. 630.13 s [vector] component vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  638. 630.13 s [vector] include base-4.18.1.0
  639. 630.13 s [vector] include deepseq-1.4.8.1
  640. 630.13 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  641. 630.13 s [vector] include vector-stream-0.1.0.1-8HdYFATsoFzK6tlcWawv2Z
  642. 630.13 s [vector] component vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2
  643. 630.13 s [vector] include base-4.18.1.0
  644. 630.13 s [vector] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  645. 630.13 s [vector] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  646. 630.13 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  647. 630.13 s [vector] component vector-0.13.2.0-CRobynm6bJiLabBZvGfrog-vector-doctest
  648. 630.13 s [vector] include base-4.18.1.0
  649. 630.13 s [vector] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  650. 630.13 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  651. 630.13 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  652. 630.13 s [vector] component vector-0.13.2.0-CvAqho7y1J6VR1LC60NQa-vector-inspection
  653. 630.13 s [vector] include base-4.18.1.0
  654. 630.13 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  655. 630.13 s [vector] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  656. 630.13 s [vector] include tasty-inspection-testing-0.2.1-3Fz5mlN0rraJusCd1VBvKB
  657. 630.13 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  658. 630.13 s [vector] component vector-0.13.2.0-6DdR4mImORG6TCwRF974f6-vector-tests-O0
  659. 630.13 s [vector] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  660. 630.13 s [vector] include base-4.18.1.0
  661. 630.13 s [vector] include base-orphans-0.9.3-EsfNI13WQjn4lDOQc9i0fL
  662. 630.13 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  663. 630.13 s [vector] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  664. 630.13 s [vector] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  665. 630.13 s [vector] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  666. 630.13 s [vector] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  667. 630.13 s [vector] include template-haskell-2.20.0.0
  668. 630.13 s [vector] include transformers-0.6.1.0
  669. 630.13 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  670. 630.13 s [vector] component vector-0.13.2.0-CkMHNDRGDXT1oa9UpRM2iX-vector-tests-O2
  671. 630.13 s [vector] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  672. 630.13 s [vector] include base-4.18.1.0
  673. 630.13 s [vector] include base-orphans-0.9.3-EsfNI13WQjn4lDOQc9i0fL
  674. 630.13 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  675. 630.13 s [vector] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  676. 630.13 s [vector] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  677. 630.13 s [vector] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  678. 630.13 s [vector] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  679. 630.13 s [vector] include template-haskell-2.20.0.0
  680. 630.13 s [vector] include transformers-0.6.1.0
  681. 630.13 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  682. 630.13 s [vector] Linked component graph:
  683. 630.13 s [vector] unit vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  684. 630.13 s [vector] include base-4.18.1.0
  685. 630.13 s [vector] include deepseq-1.4.8.1
  686. 630.13 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  687. 630.13 s [vector] include vector-stream-0.1.0.1-8HdYFATsoFzK6tlcWawv2Z
  688. 630.13 s [async] shrinking RPATHs of ELF executables and libraries in /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5
  689. 630.13 s [async] shrinking /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSasync-2.2.5-FXUcVAC32Pt4FiCqIp4LhF-ghc9.6.3.so
  690. 630.13 s [async] checking for references to /build/ in /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5...
  691. 630.13 s [async] patching script interpreter paths in /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5
  692. 630.13 s [async] stripping (with command strip and flags -S -p) in /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5/lib
  693. 630.13 s [async] shrinking RPATHs of ELF executables and libraries in /nix/store/ijadch0h13d2mqibwi72jayjyq75ykjf-async-2.2.5-doc
  694. 630.14 s [async] checking for references to /build/ in /nix/store/ijadch0h13d2mqibwi72jayjyq75ykjf-async-2.2.5-doc...
  695. 630.14 s [async] patching script interpreter paths in /nix/store/ijadch0h13d2mqibwi72jayjyq75ykjf-async-2.2.5-doc
  696. 630.14 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  697. 630.14 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  698. 630.14 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  699. 630.14 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  700. 630.14 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  701. 630.14 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.p_o )
  702. 630.14 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.p_o )
  703. 630.14 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  704. 630.14 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.p_o )
  705. 630.14 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  706. 630.14 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  707. 630.14 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  708. 630.14 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  709. 630.14 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  710. 630.14 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  711. 630.14 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  712. 630.14 s [duoids] Phase: checkPhase
  713. 630.14 s [duoids] Running 1 test suites...
  714. 630.14 s [duoids] Test suite doctests: RUNNING...
  715. 630.14 s [duoids]
  716. 630.14 s [duoids] on the commandline: warning:
  717. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  718. 630.14 s [duoids]
  719. 630.14 s [duoids] on the commandline: warning:
  720. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  721. 630.14 s [duoids]
  722. 630.14 s [duoids] on the commandline: warning:
  723. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  724. 630.14 s [duoids]
  725. 630.14 s [duoids] on the commandline: warning:
  726. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  727. 630.14 s [duoids]
  728. 630.14 s [duoids] on the commandline: warning:
  729. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  730. 630.14 s [duoids]
  731. 630.14 s [duoids] on the commandline: warning:
  732. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  733. 630.14 s [duoids]
  734. 630.14 s [duoids] on the commandline: warning:
  735. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  736. 630.14 s [duoids]
  737. 630.14 s [duoids] on the commandline: warning:
  738. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  739. 630.14 s [duoids]
  740. 630.14 s [duoids] on the commandline: warning:
  741. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  742. 630.14 s [duoids]
  743. 630.14 s [duoids] on the commandline: warning:
  744. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  745. 630.14 s [duoids]
  746. 630.14 s [duoids] on the commandline: warning:
  747. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  748. 630.14 s [duoids]
  749. 630.14 s [duoids] on the commandline: warning:
  750. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  751. 630.14 s [duoids]
  752. 630.14 s [duoids] on the commandline: warning:
  753. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  754. 630.14 s [duoids]
  755. 630.14 s [duoids] on the commandline: warning:
  756. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  757. 630.14 s [duoids]
  758. 630.14 s [duoids] on the commandline: warning:
  759. 630.14 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  760. 630.14 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  761. 630.14 s [duoids] Test suite doctests: PASS
  762. 630.14 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  763. 630.14 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  764. 630.14 s [duoids] Phase: haddockPhase
  765. 630.14 s [strict] src/Data/Strict/Tuple.hs:124:3: warning: [-Wnoncanonical-monoid-instances]
  766. 630.14 s [strict] Noncanonical ‘mappend’ definition detected
  767. 630.14 s [strict] in the instance declaration for ‘Monoid (Pair a b)’.
  768. 630.14 s [strict] ‘mappend’ will eventually be removed in favour of ‘(<>)’
  769. 630.14 s [strict] Either remove definition for ‘mappend’ (recommended) or define as ‘mappend = (<>)’
  770. 630.14 s [strict] See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid
  771. 630.14 s [strict] |
  772. 630.14 s [strict] 124 | (x1 :!: y1) `mappend` (x2 :!: y2) = (x1 `mappend` x2) :!: (y1 `mappend` y2)
  773. 630.14 s [strict] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  774. 630.14 s [strict] [5 of 7] Compiling Data.Strict.Classes ( src/Data/Strict/Classes.hs, dist/build/Data/Strict/Classes.o, dist/build/Data/Strict/Classes.dyn_o )
  775. 630.14 s [strict] [6 of 7] Compiling Data.Strict ( src/Data/Strict.hs, dist/build/Data/Strict.o, dist/build/Data/Strict.dyn_o )
  776. 630.14 s [strict] [7 of 7] Compiling System.IO.Strict ( src/System/IO/Strict.hs, dist/build/System/IO/Strict.o, dist/build/System/IO/Strict.dyn_o )
  777. 630.14 s [strict] [1 of 7] Compiling Data.Strict.Either ( src/Data/Strict/Either.hs, dist/build/Data/Strict/Either.p_o )
  778. 630.14 s [strict] [2 of 7] Compiling Data.Strict.Maybe ( src/Data/Strict/Maybe.hs, dist/build/Data/Strict/Maybe.p_o )
  779. 630.14 s [strict] [3 of 7] Compiling Data.Strict.These ( src/Data/Strict/These.hs, dist/build/Data/Strict/These.p_o )
  780. 630.14 s [strict] [4 of 7] Compiling Data.Strict.Tuple ( src/Data/Strict/Tuple.hs, dist/build/Data/Strict/Tuple.p_o )
  781. 630.14 s [strict]
  782. 630.14 s [strict] src/Data/Strict/Tuple.hs:124:3: warning: [-Wnoncanonical-monoid-instances]
  783. 630.14 s [strict] Noncanonical ‘mappend’ definition detected
  784. 630.14 s [strict] in the instance declaration for ‘Monoid (Pair a b)’.
  785. 630.14 s [strict] ‘mappend’ will eventually be removed in favour of ‘(<>)’
  786. 630.14 s [strict] Either remove definition for ‘mappend’ (recommended) or define as ‘mappend = (<>)’
  787. 630.14 s [strict] See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid
  788. 630.14 s [strict] |
  789. 630.14 s [strict] 124 | (x1 :!: y1) `mappend` (x2 :!: y2) = (x1 `mappend` x2) :!: (y1 `mappend` y2)
  790. 630.14 s [strict] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  791. 630.14 s [strict] [5 of 7] Compiling Data.Strict.Classes ( src/Data/Strict/Classes.hs, dist/build/Data/Strict/Classes.p_o )
  792. 630.14 s [strict] [6 of 7] Compiling Data.Strict ( src/Data/Strict.hs, dist/build/Data/Strict.p_o )
  793. 630.14 s [strict] [7 of 7] Compiling System.IO.Strict ( src/System/IO/Strict.hs, dist/build/System/IO/Strict.p_o )
  794. 630.14 s [strict] Phase: checkPhase
  795. 630.14 s [strict] Package has no test suites.
  796. 630.14 s [strict] Phase: haddockPhase
  797. 630.14 s [strict] Preprocessing library for strict-0.5.1..
  798. 630.14 s [strict] Running Haddock on library for strict-0.5.1..
  799. 630.14 s [strict] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  800. 630.14 s [strict] 100% ( 10 / 10) in 'Data.Strict.Either'
  801. 630.14 s [strict] Warning: '<*>' is out of scope.
  802. 630.14 s [strict] If you qualify the identifier, haddock can try to link it anyway.
  803. 630.14 s [strict] 100% ( 11 / 11) in 'Data.Strict.Maybe'
  804. 630.14 s [strict] Warning: 'here' is out of scope.
  805. 630.14 s [strict] If you qualify the identifier, haddock can try to link it anyway.
  806. 630.14 s [strict] Warning: 'there' is out of scope.
  807. 630.14 s [strict] If you qualify the identifier, haddock can try to link it anyway.
  808. 630.14 s [strict] 70% ( 12 / 17) in 'Data.Strict.These'
  809. 630.14 s [strict] Missing documentation for:
  810. 630.14 s [strict] Module header
  811. 630.14 s [strict] distrThesePair (src/Data/Strict/These.hs:155)
  812. 630.14 s [strict] undistrThesePair (src/Data/Strict/These.hs:160)
  813. 630.14 s [strict] distrPairThese (src/Data/Strict/These.hs:172)
  814. 630.14 s [strict] undistrPairThese (src/Data/Strict/These.hs:177)
  815. 630.14 s [strict] 90% ( 9 / 10) in 'Data.Strict.Tuple'
  816. 630.14 s [strict] Missing documentation for:
  817. 630.14 s [strict] :!: (src/Data/Strict/Tuple.hs:69)
  818. 630.14 s [strict]
  819. 630.14 s [strict] src/Data/Strict/Tuple.hs:124:3: warning: [-Wnoncanonical-monoid-instances]
  820. 630.14 s [strict] Noncanonical ‘mappend’ definition detected
  821. 630.14 s [strict] in the instance declaration for ‘Monoid (Pair a b)’.
  822. 630.14 s [strict] ‘mappend’ will eventually be removed in favour of ‘(<>)’
  823. 630.14 s [time-compat] 1969-0-2 = 1969-01-02: OK
  824. 630.14 s [time-compat] 1969-0-27 = 1969-01-27: OK
  825. 630.14 s [time-compat] 1969-0-28 = 1969-01-28: OK
  826. 630.14 s [time-compat] 1969-0-29 = 1969-01-29: OK
  827. 630.14 s [time-compat] 1969-0-30 = 1969-01-30: OK
  828. 630.14 s [time-compat] 1969-0-31 = 1969-01-31: OK
  829. 630.14 s [time-compat] 1969-0-32 = 1969-01-31: OK
  830. 630.14 s [time-compat] 1969-0-40 = 1969-01-31: OK
  831. 630.14 s [time-compat] 1969-1--7 = 1969-01-01: OK
  832. 630.14 s [time-compat] 1969-1--1 = 1969-01-01: OK
  833. 630.14 s [time-compat] 1969-1-0 = 1969-01-01: OK
  834. 630.14 s [time-compat] 1969-1-1 = 1969-01-01: OK
  835. 630.14 s [time-compat] 1969-1-2 = 1969-01-02: OK
  836. 630.14 s [time-compat] 1969-1-27 = 1969-01-27: OK
  837. 630.14 s [time-compat] 1969-1-28 = 1969-01-28: OK
  838. 630.14 s [time-compat] 1969-1-29 = 1969-01-29: OK
  839. 630.14 s [time-compat] 1969-1-30 = 1969-01-30: OK
  840. 630.14 s [time-compat] 1969-1-31 = 1969-01-31: OK
  841. 630.14 s [time-compat] 1969-1-32 = 1969-01-31: OK
  842. 630.14 s [time-compat] 1969-1-40 = 1969-01-31: OK
  843. 630.14 s [time-compat] 1969-2--7 = 1969-02-01: OK
  844. 630.14 s [time-compat] 1969-2--1 = 1969-02-01: OK
  845. 630.14 s [time-compat] 1969-2-0 = 1969-02-01: OK
  846. 630.14 s [time-compat] 1969-2-1 = 1969-02-01: OK
  847. 630.14 s [time-compat] 1969-2-2 = 1969-02-02: OK
  848. 630.14 s [time-compat] 1969-2-27 = 1969-02-27: OK
  849. 630.14 s [time-compat] 1969-2-28 = 1969-02-28: OK
  850. 630.14 s [time-compat] 1969-2-29 = 1969-02-28: OK
  851. 630.14 s [time-compat] 1969-2-30 = 1969-02-28: OK
  852. 630.14 s [time-compat] 1969-2-31 = 1969-02-28: OK
  853. 630.14 s [time-compat] 1969-2-32 = 1969-02-28: OK
  854. 630.14 s [time-compat] 1969-2-40 = 1969-02-28: OK
  855. 630.14 s [time-compat] 1969-12--7 = 1969-12-01: OK
  856. 630.14 s [time-compat] 1969-12--1 = 1969-12-01: OK
  857. 630.14 s [time-compat] 1969-12-0 = 1969-12-01: OK
  858. 630.14 s [time-compat] 1969-12-1 = 1969-12-01: OK
  859. 630.14 s [time-compat] 1969-12-2 = 1969-12-02: OK
  860. 630.14 s [time-compat] 1969-12-27 = 1969-12-27: OK
  861. 630.14 s [time-compat] 1969-12-28 = 1969-12-28: OK
  862. 630.14 s [time-compat] 1969-12-29 = 1969-12-29: OK
  863. 630.14 s [time-compat] 1969-12-30 = 1969-12-30: OK
  864. 630.14 s [time-compat] 1969-12-31 = 1969-12-31: OK
  865. 630.14 s [time-compat] 1969-12-32 = 1969-12-31: OK
  866. 630.14 s [time-compat] 1969-12-40 = 1969-12-31: OK
  867. 630.14 s [time-compat] 1969-13--7 = 1969-12-01: OK
  868. 630.14 s [time-compat] 1969-13--1 = 1969-12-01: OK
  869. 630.14 s [time-compat] 1969-13-0 = 1969-12-01: OK
  870. 630.14 s [time-compat] 1969-13-1 = 1969-12-01: OK
  871. 630.14 s [vector] Data.Vector=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO:Data.Vector.Unboxed.Mutable
  872. 630.14 s [vector] unit vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2
  873. 630.14 s [vector] include base-4.18.1.0
  874. 630.14 s [vector] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  875. 630.14 s [vector] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  876. 630.14 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  877. 630.14 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2:Bench.Vector.TestData.ParenTree
  878. 630.14 s [vector] unit vector-0.13.2.0-CRobynm6bJiLabBZvGfrog-vector-doctest
  879. 630.14 s [vector] include base-4.18.1.0
  880. 630.14 s [vector] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  881. 630.14 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  882. 630.14 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  883. 630.14 s [vector] unit vector-0.13.2.0-CvAqho7y1J6VR1LC60NQa-vector-inspection
  884. 630.14 s [vector] include base-4.18.1.0
  885. 630.14 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  886. 630.14 s [vector] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  887. 630.14 s [vector] include tasty-inspection-testing-0.2.1-3Fz5mlN0rraJusCd1VBvKB
  888. 630.14 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  889. 630.14 s [vector] unit vector-0.13.2.0-6DdR4mImORG6TCwRF974f6-vector-tests-O0
  890. 630.14 s [vector] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  891. 630.14 s [vector] include base-4.18.1.0
  892. 630.14 s [vector] include base-orphans-0.9.3-EsfNI13WQjn4lDOQc9i0fL
  893. 630.14 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  894. 630.14 s [vector] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  895. 630.14 s [vector] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  896. 630.14 s [vector] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  897. 630.14 s [vector] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  898. 630.14 s [vector] include template-haskell-2.20.0.0
  899. 630.14 s [vector] include transformers-0.6.1.0
  900. 630.14 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  901. 630.20 s [async:post-build] Uploading to cachix cache "sellout": /nix/store/ijadch0h13d2mqibwi72jayjyq75ykjf-async-2.2.5-doc /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5
  902. 630.69 s [async:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  903. 630.69 s [async:post-build]
  904. 631.06 s [async:post-build] Pushing /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5 (1.95 MiB)
  905. 631.17 s [async:post-build] Pushing /nix/store/ijadch0h13d2mqibwi72jayjyq75ykjf-async-2.2.5-doc (1.04 MiB)
  906. 632.09 s [async:post-build]
  907. 632.09 s [async:post-build] All done.
  908. 632.12 s [async:post-build] Uploading to the NixCI cache: /nix/store/ijadch0h13d2mqibwi72jayjyq75ykjf-async-2.2.5-doc /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5
  909. 632.18 s [async:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  910. 632.40 s [async:post-build] copying 2 paths...
  911. 632.40 s [async:post-build] copying path '/nix/store/ijadch0h13d2mqibwi72jayjyq75ykjf-async-2.2.5-doc' to 'https://cache.nix-ci.com'...
  912. 632.81 s [async:post-build] copying path '/nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5' to 'https://cache.nix-ci.com'...
  913. 633.56 s [async:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  914. 633.82 s [async:post-build] copying 1 paths...
  915. 633.98 s [async:post-build] copying path '/nix/store/ij71dizg25gfx52gm91avsm36cf6y926-async-2.2.5.drv' to 'https://cache.nix-ci.com'...
  916. 634.06 s Progress: 88 of 116 built (4 building), 172 of 172 downloaded from cache
  917. 634.06 s [strict] Either remove definition for ‘mappend’ (recommended) or define as ‘mappend = (<>)’
  918. 634.06 s [strict] See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid
  919. 634.06 s [strict] |
  920. 634.06 s [strict] 124 | (x1 :!: y1) `mappend` (x2 :!: y2) = (x1 `mappend` x2) :!: (y1 `mappend` y2)
  921. 634.06 s [strict] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  922. 634.06 s [strict] 50% ( 1 / 2) in 'Data.Strict.Classes'
  923. 634.06 s [strict] Missing documentation for:
  924. 634.06 s [strict] Module header
  925. 634.06 s [strict] 100% ( 6 / 6) in 'Data.Strict'
  926. 634.06 s [strict] Warning: 'isEOFError' is out of scope.
  927. 634.06 s [strict] If you qualify the identifier, haddock can try to link it anyway.
  928. 634.06 s [strict] Warning: 'stdin' is out of scope.
  929. 634.06 s [strict] If you qualify the identifier, haddock can try to link it anyway.
  930. 634.06 s [strict] 100% ( 7 / 7) in 'System.IO.Strict'
  931. 634.06 s [strict] Documentation created: dist/doc/html/strict/index.html,
  932. 634.06 s [strict] dist/doc/html/strict/strict.txt
  933. 634.06 s [strict] Phase: installPhase
  934. 634.06 s [strict] Installing library in /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a
  935. 634.06 s [strict] Phase: fixupPhase
  936. 634.06 s [strict] shrinking RPATHs of ELF executables and libraries in /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1
  937. 634.06 s [strict] shrinking /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSstrict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a-ghc9.6.3.so
  938. 634.06 s [strict] checking for references to /build/ in /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1...
  939. 634.06 s [strict] patching script interpreter paths in /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1
  940. 634.06 s [strict] stripping (with command strip and flags -S -p) in /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1/lib
  941. 634.06 s [strict] shrinking RPATHs of ELF executables and libraries in /nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc
  942. 634.06 s [strict] checking for references to /build/ in /nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc...
  943. 634.06 s [strict] patching script interpreter paths in /nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc
  944. 634.06 s [time-compat] 1969-13-2 = 1969-12-02: OK
  945. 634.06 s [time-compat] 1969-13-27 = 1969-12-27: OK
  946. 634.06 s [time-compat] 1969-13-28 = 1969-12-28: OK
  947. 634.06 s [time-compat] 1969-13-29 = 1969-12-29: OK
  948. 634.06 s [time-compat] 1969-13-30 = 1969-12-30: OK
  949. 634.06 s [time-compat] 1969-13-31 = 1969-12-31: OK
  950. 634.06 s [time-compat] 1969-13-32 = 1969-12-31: OK
  951. 634.06 s [time-compat] 1969-13-40 = 1969-12-31: OK
  952. 634.06 s [time-compat] 1969-17--7 = 1969-12-01: OK
  953. 634.06 s [time-compat] 1969-17--1 = 1969-12-01: OK
  954. 634.06 s [time-compat] 1969-17-0 = 1969-12-01: OK
  955. 634.06 s [time-compat] 1969-17-1 = 1969-12-01: OK
  956. 634.06 s [time-compat] 1969-17-2 = 1969-12-02: OK
  957. 634.06 s [time-compat] 1969-17-27 = 1969-12-27: OK
  958. 634.06 s [time-compat] 1969-17-28 = 1969-12-28: OK
  959. 634.06 s [time-compat] 1969-17-29 = 1969-12-29: OK
  960. 634.06 s [time-compat] 1969-17-30 = 1969-12-30: OK
  961. 634.06 s [time-compat] 1969-17-31 = 1969-12-31: OK
  962. 634.06 s [time-compat] 1969-17-32 = 1969-12-31: OK
  963. 634.06 s [time-compat] 1969-17-40 = 1969-12-31: OK
  964. 634.06 s [time-compat] 1971--20--7 = 1971-01-01: OK
  965. 634.06 s [time-compat] 1971--20--1 = 1971-01-01: OK
  966. 634.06 s [time-compat] 1971--20-0 = 1971-01-01: OK
  967. 634.06 s [time-compat] 1971--20-1 = 1971-01-01: OK
  968. 634.06 s [time-compat] 1971--20-2 = 1971-01-02: OK
  969. 634.06 s [time-compat] 1971--20-27 = 1971-01-27: OK
  970. 634.06 s [time-compat] 1971--20-28 = 1971-01-28: OK
  971. 634.06 s [time-compat] 1971--20-29 = 1971-01-29: OK
  972. 634.06 s [time-compat] 1971--20-30 = 1971-01-30: OK
  973. 634.06 s [time-compat] 1971--20-31 = 1971-01-31: OK
  974. 634.06 s [time-compat] 1971--20-32 = 1971-01-31: OK
  975. 634.06 s [time-compat] 1971--20-40 = 1971-01-31: OK
  976. 634.06 s [time-compat] 1971--1--7 = 1971-01-01: OK
  977. 634.06 s [time-compat] 1971--1--1 = 1971-01-01: OK
  978. 634.06 s [time-compat] 1971--1-0 = 1971-01-01: OK
  979. 634.06 s [time-compat] 1971--1-1 = 1971-01-01: OK
  980. 634.06 s [time-compat] 1971--1-2 = 1971-01-02: OK
  981. 634.06 s [time-compat] 1971--1-27 = 1971-01-27: OK
  982. 634.06 s [time-compat] 1971--1-28 = 1971-01-28: OK
  983. 634.06 s [time-compat] 1971--1-29 = 1971-01-29: OK
  984. 634.06 s [time-compat] 1971--1-30 = 1971-01-30: OK
  985. 634.06 s [time-compat] 1971--1-31 = 1971-01-31: OK
  986. 634.06 s [time-compat] 1971--1-32 = 1971-01-31: OK
  987. 634.06 s [time-compat] 1971--1-40 = 1971-01-31: OK
  988. 634.06 s [time-compat] 1971-0--7 = 1971-01-01: OK
  989. 634.06 s [time-compat] 1971-0--1 = 1971-01-01: OK
  990. 634.06 s [time-compat] 1971-0-0 = 1971-01-01: OK
  991. 634.06 s [time-compat] 1971-0-1 = 1971-01-01: OK
  992. 634.06 s [vector] unit vector-0.13.2.0-CkMHNDRGDXT1oa9UpRM2iX-vector-tests-O2
  993. 634.06 s [vector] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  994. 634.06 s [vector] include base-4.18.1.0
  995. 634.06 s [vector] include base-orphans-0.9.3-EsfNI13WQjn4lDOQc9i0fL
  996. 634.06 s [vector] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  997. 634.06 s [vector] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  998. 634.06 s [vector] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  999. 634.06 s [vector] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  1000. 634.06 s [vector] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  1001. 634.06 s [vector] include template-haskell-2.20.0.0
  1002. 634.06 s [vector] include transformers-0.6.1.0
  1003. 634.06 s [vector] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  1004. 634.06 s [vector] Ready component graph:
  1005. 634.06 s [vector] definite vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  1006. 634.06 s [vector] depends base-4.18.1.0
  1007. 634.06 s [vector] depends deepseq-1.4.8.1
  1008. 634.06 s [vector] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  1009. 634.06 s [vector] depends vector-stream-0.1.0.1-8HdYFATsoFzK6tlcWawv2Z
  1010. 634.06 s [vector] definite vector-0.13.2.0-CvAqho7y1J6VR1LC60NQa-vector-inspection
  1011. 634.06 s [vector] depends base-4.18.1.0
  1012. 634.06 s [vector] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  1013. 634.06 s [vector] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  1014. 634.06 s [vector] depends tasty-inspection-testing-0.2.1-3Fz5mlN0rraJusCd1VBvKB
  1015. 634.06 s [vector] depends vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  1016. 634.06 s [vector] definite vector-0.13.2.0-CkMHNDRGDXT1oa9UpRM2iX-vector-tests-O2
  1017. 634.06 s [vector] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  1018. 634.06 s [vector] depends base-4.18.1.0
  1019. 634.06 s [vector] depends base-orphans-0.9.3-EsfNI13WQjn4lDOQc9i0fL
  1020. 634.06 s [vector] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  1021. 634.06 s [vector] depends random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  1022. 634.06 s [vector] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  1023. 634.06 s [vector] depends tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  1024. 634.06 s [vector] depends tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  1025. 634.06 s [vector] depends template-haskell-2.20.0.0
  1026. 634.06 s [vector] depends transformers-0.6.1.0
  1027. 634.06 s [vector] depends vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  1028. 634.06 s [vector] definite vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2
  1029. 634.06 s [vector] depends base-4.18.1.0
  1030. 634.06 s [vector] depends random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  1031. 634.06 s [vector] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  1032. 634.06 s [vector] depends vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  1033. 634.06 s [vector] definite vector-0.13.2.0-CRobynm6bJiLabBZvGfrog-vector-doctest
  1034. 634.06 s [vector] depends base-4.18.1.0
  1035. 634.06 s [vector] depends doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  1036. 634.06 s [vector] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  1037. 634.06 s [vector] depends vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  1038. 634.06 s [vector] definite vector-0.13.2.0-6DdR4mImORG6TCwRF974f6-vector-tests-O0
  1039. 634.06 s [vector] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  1040. 634.06 s [vector] depends base-4.18.1.0
  1041. 634.06 s [vector] depends base-orphans-0.9.3-EsfNI13WQjn4lDOQc9i0fL
  1042. 634.06 s [vector] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  1043. 634.06 s [vector] depends random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  1044. 634.06 s [vector] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  1045. 634.06 s [vector] depends tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  1046. 634.06 s [vector] depends tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  1047. 634.06 s [vector] depends template-haskell-2.20.0.0
  1048. 634.06 s [vector] depends transformers-0.6.1.0
  1049. 634.06 s [vector] depends vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  1050. 634.06 s [vector] Using Cabal-3.10.1.0 compiled by ghc-9.6
  1051. 634.06 s [vector] Using compiler: ghc-9.6.3
  1052. 634.06 s [vector] Using install prefix:
  1053. 634.06 s [vector] /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0
  1054. 634.06 s [vector] Executables installed in:
  1055. 634.06 s [vector] /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/bin
  1056. 634.06 s [vector] Libraries installed in:
  1057. 634.06 s [vector] /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  1058. 634.06 s [vector] Dynamic Libraries installed in:
  1059. 634.06 s [vector] /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  1060. 634.06 s [vector] Private executables installed in:
  1061. 634.06 s [vector] /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.6.3/vector-0.13.2.0
  1062. 634.06 s [vector] Data files installed in:
  1063. 634.06 s [vector] /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/share/x86_64-linux-ghc-9.6.3/vector-0.13.2.0
  1064. 634.06 s [vector] Documentation installed in:
  1065. 634.06 s [vector] /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.6.3/vector-0.13.2.0
  1066. 634.06 s [vector] Configuration files installed in:
  1067. 634.06 s [vector] /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/etc
  1068. 634.06 s [vector] No alex found
  1069. 634.06 s [vector] Using ar found on system at:
  1070. 634.15 s Building /nix/store/vhr5s8kz4z16y9rq7j8cmybrd01yrm0i-concurrent-output-1.10.21.drv
  1071. 634.19 s Building /nix/store/9xv9z5g9gdh25x342s4wxbs2ziymlh5f-lifted-async-0.10.2.7.drv
  1072. 634.23 s Building /nix/store/n5lzhg4lavycx6d6c9ciar6bppdqn8h4-logict-0.8.2.0.drv
  1073. 634.23 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1074. 634.23 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  1075. 634.23 s [duoids] Warning: 'cancel' is out of scope.
  1076. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1077. 634.23 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  1078. 634.23 s [duoids] Warning: 'ExceptT' is out of scope.
  1079. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1080. 634.23 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  1081. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1082. 634.23 s [duoids] Warning: 'Validation' is out of scope.
  1083. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1084. 634.23 s [duoids] Warning: 'fail' is out of scope.
  1085. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1086. 634.23 s [duoids] Warning: 'MonadFail' is out of scope.
  1087. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1088. 634.23 s [duoids] Warning: 'Writer' is out of scope.
  1089. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1090. 634.23 s [duoids] Warning: 'Set' is out of scope.
  1091. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1092. 634.23 s [duoids] Warning: 'Char' is out of scope.
  1093. 634.23 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1094. 634.23 s [duoids] 46% ( 28 / 60) in 'Control.Duoidal'
  1095. 634.23 s [duoids] Missing documentation for:
  1096. 634.23 s [duoids] DuoidalIO (src/Control/Duoidal.hs:470)
  1097. 634.23 s [duoids] Parallel (src/Control/Duoidal.hs:228)
  1098. 634.23 s [duoids] traverse_ (src/Control/Duoidal.hs:394)
  1099. 634.23 s [duoids] for (src/Control/Duoidal.hs:400)
  1100. 634.23 s [duoids] for_ (src/Control/Duoidal.hs:406)
  1101. 634.23 s [duoids] forever (src/Control/Duoidal.hs:426)
  1102. 634.23 s [duoids] Sequential (src/Control/Duoidal.hs:243)
  1103. 634.23 s [duoids] >> (src/Control/Duoidal.hs:338)
  1104. 634.23 s [duoids] >>= (src/Control/Duoidal.hs:449)
  1105. 634.23 s [duoids] >=> (src/Control/Duoidal.hs:459)
  1106. 634.23 s [duoids] =<< (src/Control/Duoidal.hs:454)
  1107. 634.23 s [duoids] <=< (src/Control/Duoidal.hs:464)
  1108. 634.23 s [duoids] join (src/Control/Duoidal.hs:446)
  1109. 634.23 s [duoids] ap (src/Control/Duoidal.hs:313)
  1110. 634.23 s [duoids] return (src/Control/Duoidal.hs:289)
  1111. 634.23 s [duoids] liftM2 (src/Control/Duoidal.hs:296)
  1112. 634.23 s [duoids] liftM3 (src/Control/Duoidal.hs:303)
  1113. 634.23 s [duoids] mapM (src/Control/Duoidal.hs:391)
  1114. 634.23 s [duoids] mapM_ (src/Control/Duoidal.hs:397)
  1115. 634.23 s [duoids] forM (src/Control/Duoidal.hs:403)
  1116. 634.23 s [duoids] forM_ (src/Control/Duoidal.hs:409)
  1117. 634.23 s [duoids] sequence (src/Control/Duoidal.hs:416)
  1118. 634.23 s [duoids] sequence_ (src/Control/Duoidal.hs:423)
  1119. 634.23 s [duoids] forever' (src/Control/Duoidal.hs:429)
  1120. 634.23 s [duoids] unless' (src/Control/Duoidal.hs:436)
  1121. 634.23 s [duoids] when' (src/Control/Duoidal.hs:443)
  1122. 634.23 s [duoids] normalPure (src/Control/Duoidal.hs:473)
  1123. 634.23 s [duoids] sequentialAp (src/Control/Duoidal.hs:488)
  1124. 634.23 s [duoids] sequentialBind (src/Control/Duoidal.hs:492)
  1125. 634.23 s [duoids] sequentialLiftA2 (src/Control/Duoidal.hs:479)
  1126. 634.23 s [duoids] sequentialPure (src/Control/Duoidal.hs:476)
  1127. 634.23 s [duoids] commutativeAp (src/Control/Duoidal.hs:539)
  1128. 634.23 s [duoids] 100% ( 3 / 3) in 'Control.Duoidal.Fix'
  1129. 634.23 s [duoids] 100% ( 3 / 3) in 'Control.Duoidal.Fail'
  1130. 634.23 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  1131. 634.23 s [duoids] 55% ( 5 / 9) in 'Control.Duoidal.Do'
  1132. 634.23 s [duoids] Missing documentation for:
  1133. 634.23 s [duoids] join (src/Control/Duoidal.hs:446)
  1134. 634.23 s [duoids] return (src/Control/Duoidal.hs:289)
  1135. 634.23 s [duoids] >> (src/Control/Duoidal.hs:338)
  1136. 634.23 s [duoids] >>= (src/Control/Duoidal.hs:449)
  1137. 634.23 s [duoids] 16% ( 2 / 12) in 'Data.Duoid.Laws'
  1138. 634.23 s [duoids] Missing documentation for:
  1139. 634.23 s [duoids] Law (src/Data/Duoid/Laws.hs:27)
  1140. 634.23 s [duoids] Laws (src/Data/Duoid/Laws.hs:49)
  1141. 634.23 s [duoids] getLaws (src/Data/Duoid/Laws.hs:56)
  1142. 634.23 s [duoids] NormalLaws (src/Data/Duoid/Laws.hs:70)
  1143. 634.23 s [duoids] getNormalLaws (src/Data/Duoid/Laws.hs:75)
  1144. 634.23 s [duoids] checkLaw (src/Data/Duoid/Laws.hs:29)
  1145. 634.23 s [duoids] interchangeLaw (src/Data/Duoid/Laws.hs:32)
  1146. 634.23 s [duoids] joinUnitLaw (src/Data/Duoid/Laws.hs:42)
  1147. 634.23 s [duoids] splitUnitLaw (src/Data/Duoid/Laws.hs:39)
  1148. 634.23 s [duoids] swapUnitLaw (src/Data/Duoid/Laws.hs:45)
  1149. 634.23 s [duoids] 50% ( 3 / 6) in 'Control.Duoidal.Laws'
  1150. 634.23 s [duoids] Missing documentation for:
  1151. 634.23 s [duoids] joinUnit (src/Control/Duoidal/Laws.hs:66)
  1152. 634.23 s [duoids] splitUnit (src/Control/Duoidal/Laws.hs:62)
  1153. 634.23 s [duoids] swapUnit (src/Control/Duoidal/Laws.hs:73)
  1154. 634.23 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  1155. 634.23 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1156. 634.23 s [duoids] Phase: installPhase
  1157. 634.23 s [duoids] Installing library in /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  1158. 634.23 s [duoids] Phase: fixupPhase
  1159. 634.23 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0
  1160. 634.31 s [strict:post-build] Uploading to cachix cache "sellout": /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1 /nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc
  1161. 634.82 s [strict:post-build] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  1162. 634.82 s [strict:post-build]
  1163. 635.21 s [strict:post-build] Pushing /nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc (1.47 MiB)
  1164. 635.26 s [strict:post-build] Pushing /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1 (5.17 MiB)
  1165. 636.25 s [strict:post-build]
  1166. 636.25 s [strict:post-build] All done.
  1167. 636.27 s [strict:post-build] Uploading to the NixCI cache: /nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1 /nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc
  1168. 636.33 s [strict:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1169. 636.59 s [strict:post-build] copying 2 paths...
  1170. 636.59 s [strict:post-build] copying path '/nix/store/dw47y20bb65wi6f1x86nvklc6kp827ch-strict-0.5.1-doc' to 'https://cache.nix-ci.com'...
  1171. 638.07 s [strict:post-build] copying path '/nix/store/0vxv3h1v1an089axirw1szc4dnj5g7n6-strict-0.5.1' to 'https://cache.nix-ci.com'...
  1172. 639.90 s [strict:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1173. 640.16 s [strict:post-build] copying 1 paths...
  1174. 640.25 s [strict:post-build] copying path '/nix/store/p0bvp8sjk1jqy8m7kw4nb87agx2rsaw4-strict-0.5.1.drv' to 'https://cache.nix-ci.com'...
  1175. 640.42 s Progress: 89 of 116 built (6 building), 172 of 172 downloaded from cache
  1176. 640.42 s [time-compat] 1971-0-2 = 1971-01-02: OK
  1177. 640.42 s [time-compat] 1971-0-27 = 1971-01-27: OK
  1178. 640.42 s [time-compat] 1971-0-28 = 1971-01-28: OK
  1179. 640.42 s [time-compat] 1971-0-29 = 1971-01-29: OK
  1180. 640.42 s [time-compat] 1971-0-30 = 1971-01-30: OK
  1181. 640.42 s [time-compat] 1971-0-31 = 1971-01-31: OK
  1182. 640.42 s [time-compat] 1971-0-32 = 1971-01-31: OK
  1183. 640.42 s [time-compat] 1971-0-40 = 1971-01-31: OK
  1184. 640.42 s [time-compat] 1971-1--7 = 1971-01-01: OK
  1185. 640.42 s [time-compat] 1971-1--1 = 1971-01-01: OK
  1186. 640.42 s [time-compat] 1971-1-0 = 1971-01-01: OK
  1187. 640.42 s [time-compat] 1971-1-1 = 1971-01-01: OK
  1188. 640.42 s [time-compat] 1971-1-2 = 1971-01-02: OK
  1189. 640.42 s [time-compat] 1971-1-27 = 1971-01-27: OK
  1190. 640.42 s [time-compat] 1971-1-28 = 1971-01-28: OK
  1191. 640.42 s [time-compat] 1971-1-29 = 1971-01-29: OK
  1192. 640.42 s [time-compat] 1971-1-30 = 1971-01-30: OK
  1193. 640.42 s [time-compat] 1971-1-31 = 1971-01-31: OK
  1194. 640.42 s [time-compat] 1971-1-32 = 1971-01-31: OK
  1195. 640.42 s [time-compat] 1971-1-40 = 1971-01-31: OK
  1196. 640.42 s [time-compat] 1971-2--7 = 1971-02-01: OK
  1197. 640.42 s [time-compat] 1971-2--1 = 1971-02-01: OK
  1198. 640.42 s [time-compat] 1971-2-0 = 1971-02-01: OK
  1199. 640.42 s [time-compat] 1971-2-1 = 1971-02-01: OK
  1200. 640.42 s [time-compat] 1971-2-2 = 1971-02-02: OK
  1201. 640.42 s [time-compat] 1971-2-27 = 1971-02-27: OK
  1202. 640.42 s [time-compat] 1971-2-28 = 1971-02-28: OK
  1203. 640.42 s [time-compat] 1971-2-29 = 1971-02-28: OK
  1204. 640.42 s [time-compat] 1971-2-30 = 1971-02-28: OK
  1205. 640.42 s [time-compat] 1971-2-31 = 1971-02-28: OK
  1206. 640.42 s [time-compat] 1971-2-32 = 1971-02-28: OK
  1207. 640.42 s [time-compat] 1971-2-40 = 1971-02-28: OK
  1208. 640.42 s [time-compat] 1971-12--7 = 1971-12-01: OK
  1209. 640.42 s [time-compat] 1971-12--1 = 1971-12-01: OK
  1210. 640.42 s [time-compat] 1971-12-0 = 1971-12-01: OK
  1211. 640.42 s [time-compat] 1971-12-1 = 1971-12-01: OK
  1212. 640.42 s [time-compat] 1971-12-2 = 1971-12-02: OK
  1213. 640.42 s [time-compat] 1971-12-27 = 1971-12-27: OK
  1214. 640.42 s [time-compat] 1971-12-28 = 1971-12-28: OK
  1215. 640.42 s [time-compat] 1971-12-29 = 1971-12-29: OK
  1216. 640.42 s [time-compat] 1971-12-30 = 1971-12-30: OK
  1217. 640.42 s [time-compat] 1971-12-31 = 1971-12-31: OK
  1218. 640.42 s [time-compat] 1971-12-32 = 1971-12-31: OK
  1219. 640.42 s [time-compat] 1971-12-40 = 1971-12-31: OK
  1220. 640.42 s [time-compat] 1971-13--7 = 1971-12-01: OK
  1221. 640.42 s [time-compat] 1971-13--1 = 1971-12-01: OK
  1222. 640.42 s [time-compat] 1971-13-0 = 1971-12-01: OK
  1223. 640.42 s [time-compat] 1971-13-1 = 1971-12-01: OK
  1224. 640.42 s [vector] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1225. 640.42 s [vector] No c2hs found
  1226. 640.42 s [vector] No cpphs found
  1227. 640.42 s [vector] Using doctest version 0.22.6 found on system at:
  1228. 640.43 s [vector] /nix/store/1rhhhdgycbwrgfgqrs5rr0mmh6r4ly3h-doctest-0.22.6/bin/doctest
  1229. 640.43 s [vector] Using gcc version 14.3.0 given by user at:
  1230. 640.43 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1231. 640.43 s [vector] Using ghc version 9.6.3 found on system at:
  1232. 640.43 s [vector] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  1233. 640.43 s [vector] Using ghc-pkg version 9.6.3 found on system at:
  1234. 640.43 s [vector] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  1235. 640.43 s [vector] No ghcjs found
  1236. 640.43 s [vector] No ghcjs-pkg found
  1237. 640.43 s [vector] No greencard found
  1238. 640.43 s [vector] Using haddock version 2.29.1 found on system at:
  1239. 640.43 s [vector] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  1240. 640.43 s [vector] No happy found
  1241. 640.43 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  1242. 640.43 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1243. 640.43 s [vector] No hmake found
  1244. 640.43 s [vector] Using hpc version 0.68 found on system at:
  1245. 640.43 s [vector] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  1246. 640.43 s [vector] Using hsc2hs version 0.68.9 found on system at:
  1247. 640.43 s [vector] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  1248. 640.43 s [vector] Using hscolour version 1.25 found on system at:
  1249. 640.43 s [vector] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  1250. 640.43 s [vector] No jhc found
  1251. 640.43 s [vector] Using ld found on system at:
  1252. 640.43 s [vector] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  1253. 640.43 s [vector] No pkg-config found
  1254. 640.43 s [vector] Using runghc version 9.6.3 found on system at:
  1255. 640.43 s [vector] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  1256. 640.43 s [vector] Using strip version 2.44 found on system at:
  1257. 640.43 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1258. 640.43 s [vector] Using tar found on system at:
  1259. 640.43 s [vector] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1260. 640.43 s [vector] No uhc found
  1261. 640.43 s [vector] Phase: buildPhase
  1262. 640.43 s [vector] Preprocessing library for vector-0.13.2.0..
  1263. 640.43 s [vector] Building library for vector-0.13.2.0..
  1264. 640.43 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 )
  1265. 640.43 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 )
  1266. 640.43 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 )
  1267. 640.43 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 )
  1268. 640.43 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 )
  1269. 640.43 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 )
  1270. 640.43 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 )
  1271. 640.43 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 )
  1272. 640.43 s [concurrent-output] Phase: setupCompilerEnvironmentPhase
  1273. 640.43 s [concurrent-output] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  1274. 640.43 s [concurrent-output] Phase: unpackPhase
  1275. 640.43 s [concurrent-output] unpacking source archive /nix/store/pyf7k374ldp9mk2h62dn593zrkammpq9-concurrent-output-1.10.21.tar.gz
  1276. 640.43 s [concurrent-output] source root is concurrent-output-1.10.21
  1277. 640.43 s [concurrent-output] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "concurrent-output-1.10.21/Utility/Monad.hs"
  1278. 640.43 s [concurrent-output] Phase: patchPhase
  1279. 640.43 s [concurrent-output] Phase: compileBuildDriverPhase
  1280. 640.43 s [concurrent-output] setupCompileFlags: -package-db=/build/tmp.Z9ou3Vz41k/setup-package.conf.d -threaded
  1281. 640.43 s [concurrent-output] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Z9ou3Vz41k/Main.o )
  1282. 640.43 s [concurrent-output] [2 of 2] Linking Setup
  1283. 640.43 s [concurrent-output] Phase: updateAutotoolsGnuConfigScriptsPhase
  1284. 640.43 s [concurrent-output] Phase: configurePhase
  1285. 640.43 s [concurrent-output] configureFlags: --verbose --prefix=/nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/vs0fypp8xg16h15ms6sk15mdqvipxndh-concurrent-output-1.10.21-doc/share/doc/concurrent-output-1.10.21 --with-gcc=gcc --package-db=/build/tmp.Z9ou3Vz41k/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  1286. 640.43 s [concurrent-output] Using Parsec parser
  1287. 640.43 s [concurrent-output] Configuring concurrent-output-1.10.21...
  1288. 640.43 s [concurrent-output] Dependency ansi-terminal >=0.6.2 && <1.2.0: using ansi-terminal-1.1.2
  1289. 640.43 s [concurrent-output] Dependency async >=2.0 && <2.3: using async-2.2.5
  1290. 640.43 s [concurrent-output] Dependency base >=4.6 && <5: using base-4.18.1.0
  1291. 640.43 s [concurrent-output] Dependency directory >=1.2.0 && <1.4.0: using directory-1.3.8.1
  1292. 640.43 s [concurrent-output] Dependency exceptions >=0.6.0 && <0.11.0: using exceptions-0.10.7
  1293. 640.43 s [concurrent-output] Dependency process >=1.6.0 && <1.7.0: using process-1.6.17.0
  1294. 640.43 s [concurrent-output] Dependency stm >=2.0 && <2.6: using stm-2.5.1.0
  1295. 640.43 s [concurrent-output] Dependency terminal-size >=0.3.0 && <0.4.0: using terminal-size-0.3.4
  1296. 640.43 s [concurrent-output] Dependency text >=0.11.0 && <2.2: using text-2.0.2
  1297. 640.43 s [concurrent-output] Dependency transformers >=0.3.0 && <0.7.0: using transformers-0.6.1.0
  1298. 640.43 s [concurrent-output] Dependency unix >=2.7.0 && <2.9.0: using unix-2.8.1.0
  1299. 640.43 s [concurrent-output] Source component graph: component lib
  1300. 640.43 s [concurrent-output] Configured component graph:
  1301. 640.43 s [concurrent-output] component concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb
  1302. 640.43 s [concurrent-output] include ansi-terminal-1.1.2-8ILE2aUwQMrAKZvScdfvlf
  1303. 640.43 s [concurrent-output] include async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1304. 640.43 s [concurrent-output] include base-4.18.1.0
  1305. 640.43 s [concurrent-output] include directory-1.3.8.1
  1306. 640.43 s [concurrent-output] include exceptions-0.10.7
  1307. 640.43 s [concurrent-output] include process-1.6.17.0
  1308. 640.43 s [concurrent-output] include stm-2.5.1.0
  1309. 640.43 s [concurrent-output] include terminal-size-0.3.4-F29cA6SfcnBIj4P9LFGJy0
  1310. 640.43 s [concurrent-output] include text-2.0.2
  1311. 640.43 s [concurrent-output] include transformers-0.6.1.0
  1312. 640.43 s [concurrent-output] include unix-2.8.1.0
  1313. 640.43 s [concurrent-output] Linked component graph:
  1314. 640.43 s [concurrent-output] unit concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb
  1315. 640.43 s [concurrent-output] include ansi-terminal-1.1.2-8ILE2aUwQMrAKZvScdfvlf
  1316. 640.43 s [concurrent-output] include async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1317. 640.43 s [concurrent-output] include base-4.18.1.0
  1318. 640.43 s [concurrent-output] include directory-1.3.8.1
  1319. 640.43 s [concurrent-output] include exceptions-0.10.7
  1320. 640.43 s [concurrent-output] include process-1.6.17.0
  1321. 640.43 s [concurrent-output] include stm-2.5.1.0
  1322. 640.43 s [concurrent-output] include terminal-size-0.3.4-F29cA6SfcnBIj4P9LFGJy0
  1323. 640.43 s [concurrent-output] include text-2.0.2
  1324. 640.43 s [concurrent-output] include transformers-0.6.1.0
  1325. 640.43 s [concurrent-output] include unix-2.8.1.0
  1326. 640.43 s [duoids] shrinking /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSduoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM-ghc9.6.3.so
  1327. 640.43 s [duoids] checking for references to /build/ in /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0...
  1328. 640.43 s [duoids] patching script interpreter paths in /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0
  1329. 640.43 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0/lib
  1330. 640.43 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc
  1331. 640.43 s [duoids] checking for references to /build/ in /nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc...
  1332. 640.43 s [duoids] patching script interpreter paths in /nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc
  1333. 640.43 s [lifted-async] Phase: setupCompilerEnvironmentPhase
  1334. 640.43 s [lifted-async] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  1335. 640.43 s [lifted-async] Phase: unpackPhase
  1336. 640.43 s [lifted-async] unpacking source archive /nix/store/w5ndm5lizzwsyhcb2rzsvjxx5ggxbyi8-lifted-async-0.10.2.7.tar.gz
  1337. 640.43 s [lifted-async] source root is lifted-async-0.10.2.7
  1338. 640.43 s [lifted-async] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "lifted-async-0.10.2.7/tests/TestSuite.hs"
  1339. 640.43 s [lifted-async] Phase: patchPhase
  1340. 640.43 s [lifted-async] Phase: compileBuildDriverPhase
  1341. 640.43 s [lifted-async] setupCompileFlags: -package-db=/build/tmp.EHc5JM3Ixs/setup-package.conf.d -threaded
  1342. 640.43 s [lifted-async] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.EHc5JM3Ixs/Main.o )
  1343. 640.43 s [lifted-async] [2 of 2] Linking Setup
  1344. 640.43 s [lifted-async] Phase: updateAutotoolsGnuConfigScriptsPhase
  1345. 640.43 s [lifted-async] Phase: configurePhase
  1346. 640.43 s [lifted-async] configureFlags: --verbose --prefix=/nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ym4p5vclmcmhk6qnhlvbc77apnvsxg4k-lifted-async-0.10.2.7-doc/share/doc/lifted-async-0.10.2.7 --with-gcc=gcc --package-db=/build/tmp.EHc5JM3Ixs/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 --disable-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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  1347. 640.43 s [lifted-async] Using Parsec parser
  1348. 640.43 s [lifted-async] Configuring lifted-async-0.10.2.7...
  1349. 640.43 s [lifted-async] Dependency async >=2.2 && <2.3: using async-2.2.5
  1350. 640.43 s [lifted-async] Dependency base >=4.5 && <4.22: using base-4.18.1.0
  1351. 640.43 s [lifted-async] Dependency constraints >=0.2 && <0.15: using constraints-0.14.2
  1352. 640.43 s [lifted-async] Dependency lifted-base >=0.2 && <0.3: using lifted-base-0.2.3.12
  1353. 640.43 s [lifted-async] Dependency monad-control >=1.0 && <1.1: using monad-control-1.0.3.1
  1354. 640.43 s [lifted-async] Dependency transformers-base >=0.4 && <0.5: using transformers-base-0.4.6
  1355. 640.43 s [lifted-async] Source component graph: component lib
  1356. 640.43 s [lifted-async] Configured component graph:
  1357. 640.43 s [lifted-async] component lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI
  1358. 640.43 s [lifted-async] include async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1359. 640.43 s [lifted-async] include base-4.18.1.0
  1360. 640.43 s [lifted-async] include constraints-0.14.2-ImFkRARbiOAGSXHYeqOCSx
  1361. 640.43 s [lifted-async] include lifted-base-0.2.3.12-ItXrGiQsH5g7O20vNaygTA
  1362. 640.43 s [lifted-async] include monad-control-1.0.3.1-2IsJNI7knS73USTyyqyQ0F
  1363. 640.43 s [lifted-async] include transformers-base-0.4.6-B9tbHsqjT7AMa9jIl8ea0
  1364. 640.43 s [lifted-async] Linked component graph:
  1365. 640.43 s [lifted-async] unit lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI
  1366. 640.43 s [lifted-async] include async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1367. 640.43 s [lifted-async] include base-4.18.1.0
  1368. 640.43 s [lifted-async] include constraints-0.14.2-ImFkRARbiOAGSXHYeqOCSx
  1369. 640.43 s [lifted-async] include lifted-base-0.2.3.12-ItXrGiQsH5g7O20vNaygTA
  1370. 640.43 s [lifted-async] include monad-control-1.0.3.1-2IsJNI7knS73USTyyqyQ0F
  1371. 640.43 s [lifted-async] include transformers-base-0.4.6-B9tbHsqjT7AMa9jIl8ea0
  1372. 640.43 s [lifted-async] Control.Concurrent.Async.Lifted=lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI:Control.Concurrent.Async.Lifted,Control.Concurrent.Async.Lifted.Safe=lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI:Control.Concurrent.Async.Lifted.Safe
  1373. 640.43 s [lifted-async] Ready component graph:
  1374. 640.43 s [lifted-async] definite lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI
  1375. 640.43 s [lifted-async] depends async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1376. 640.43 s [lifted-async] depends base-4.18.1.0
  1377. 640.43 s [lifted-async] depends constraints-0.14.2-ImFkRARbiOAGSXHYeqOCSx
  1378. 640.43 s [lifted-async] depends lifted-base-0.2.3.12-ItXrGiQsH5g7O20vNaygTA
  1379. 640.43 s [lifted-async] depends monad-control-1.0.3.1-2IsJNI7knS73USTyyqyQ0F
  1380. 640.43 s [lifted-async] depends transformers-base-0.4.6-B9tbHsqjT7AMa9jIl8ea0
  1381. 640.43 s [logict] Phase: setupCompilerEnvironmentPhase
  1382. 640.43 s [logict] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  1383. 640.43 s [logict] Phase: unpackPhase
  1384. 640.43 s [logict] unpacking source archive /nix/store/8bm3ahkqr8f35z3yrz2jbmxmmv77hvk5-logict-0.8.2.0.tar.gz
  1385. 640.43 s [logict] source root is logict-0.8.2.0
  1386. 640.43 s [logict] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "logict-0.8.2.0/test/Test.hs"
  1387. 640.43 s [logict] Phase: patchPhase
  1388. 640.43 s [logict] Phase: compileBuildDriverPhase
  1389. 640.43 s [logict] setupCompileFlags: -package-db=/build/tmp.FluJgwVbkx/setup-package.conf.d -threaded
  1390. 640.43 s [logict] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.FluJgwVbkx/Main.o )
  1391. 640.43 s [logict] [2 of 2] Linking Setup
  1392. 640.43 s [logict] Phase: updateAutotoolsGnuConfigScriptsPhase
  1393. 640.43 s [logict] Phase: configurePhase
  1394. 640.43 s [logict] configureFlags: --verbose --prefix=/nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc/share/doc/logict-0.8.2.0 --with-gcc=gcc --package-db=/build/tmp.FluJgwVbkx/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  1395. 640.43 s [logict] Using Parsec parser
  1396. 640.43 s [logict] Configuring logict-0.8.2.0...
  1397. 640.43 s [logict] Dependency base >=4.9 && <5: using base-4.18.1.0
  1398. 640.43 s [logict] Dependency exceptions <0.11: using exceptions-0.10.7
  1399. 640.43 s [logict] Dependency mtl >=2.0 && <2.4: using mtl-2.3.1
  1400. 640.43 s [logict] Dependency transformers <0.7: using transformers-0.6.1.0
  1401. 640.43 s [logict] Dependency async >=2.0 && <2.3: using async-2.2.5
  1402. 640.43 s [logict] Dependency base: using base-4.18.1.0
  1403. 640.43 s [logict] Dependency logict: using logict-0.8.2.0
  1404. 640.43 s [logict] Dependency mtl: using mtl-2.3.1
  1405. 640.43 s [logict] Dependency tasty <1.6: using tasty-1.5.3
  1406. 640.43 s [logict] Dependency tasty-hunit <0.11: using tasty-hunit-0.10.2
  1407. 640.43 s [logict] Dependency transformers: using transformers-0.6.1.0
  1408. 640.43 s [logict] Source component graph:
  1409. 640.43 s [logict] component lib
  1410. 640.43 s [logict] component test:logict-tests dependency lib
  1411. 640.43 s [logict] Configured component graph:
  1412. 640.43 s [logict] component logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  1413. 640.43 s [logict] include base-4.18.1.0
  1414. 640.43 s [logict] include exceptions-0.10.7
  1415. 640.43 s [logict] include mtl-2.3.1
  1416. 640.43 s [logict] include transformers-0.6.1.0
  1417. 640.43 s [logict] component logict-0.8.2.0-3SR4xRzo2IgL9pISggNaP1-logict-tests
  1418. 640.43 s [logict] include async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1419. 640.43 s [logict] include base-4.18.1.0
  1420. 640.43 s [logict] include logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  1421. 640.43 s [logict] include mtl-2.3.1
  1422. 640.43 s [logict] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  1423. 640.43 s [logict] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  1424. 640.43 s [logict] include transformers-0.6.1.0
  1425. 640.43 s [logict] Linked component graph:
  1426. 640.43 s [logict] unit logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  1427. 640.43 s [logict] include base-4.18.1.0
  1428. 640.43 s [logict] include exceptions-0.10.7
  1429. 640.43 s [logict] include mtl-2.3.1
  1430. 640.43 s [logict] include transformers-0.6.1.0
  1431. 640.43 s [logict] Control.Monad.Logic=logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V:Control.Monad.Logic,Control.Monad.Logic.Class=logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V:Control.Monad.Logic.Class
  1432. 640.43 s [logict] unit logict-0.8.2.0-3SR4xRzo2IgL9pISggNaP1-logict-tests
  1433. 640.43 s [logict] include async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1434. 640.43 s [logict] include base-4.18.1.0
  1435. 640.43 s [logict] include logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  1436. 640.43 s [logict] include mtl-2.3.1
  1437. 640.43 s [logict] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  1438. 640.43 s [logict] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  1439. 640.44 s [time-compat] 1971-13-2 = 1971-12-02: OK
  1440. 640.44 s [time-compat] 1971-13-27 = 1971-12-27: OK
  1441. 640.44 s [time-compat] 1971-13-28 = 1971-12-28: OK
  1442. 640.44 s [time-compat] 1971-13-29 = 1971-12-29: OK
  1443. 640.44 s [time-compat] 1971-13-30 = 1971-12-30: OK
  1444. 640.44 s [time-compat] 1971-13-31 = 1971-12-31: OK
  1445. 640.44 s [time-compat] 1971-13-32 = 1971-12-31: OK
  1446. 640.44 s [time-compat] 1971-13-40 = 1971-12-31: OK
  1447. 640.44 s [time-compat] 1971-17--7 = 1971-12-01: OK
  1448. 640.44 s [time-compat] 1971-17--1 = 1971-12-01: OK
  1449. 640.44 s [time-compat] 1971-17-0 = 1971-12-01: OK
  1450. 640.44 s [time-compat] 1971-17-1 = 1971-12-01: OK
  1451. 640.44 s [time-compat] 1971-17-2 = 1971-12-02: OK
  1452. 640.44 s [time-compat] 1971-17-27 = 1971-12-27: OK
  1453. 640.44 s [time-compat] 1971-17-28 = 1971-12-28: OK
  1454. 640.44 s [time-compat] 1971-17-29 = 1971-12-29: OK
  1455. 640.44 s [time-compat] 1971-17-30 = 1971-12-30: OK
  1456. 640.44 s [time-compat] 1971-17-31 = 1971-12-31: OK
  1457. 640.44 s [time-compat] 1971-17-32 = 1971-12-31: OK
  1458. 640.44 s [time-compat] 1971-17-40 = 1971-12-31: OK
  1459. 640.44 s [time-compat] ISOWeekDay
  1460. 640.44 s [time-compat] 1968-W-20--2 = 1968-W01-1: OK
  1461. 640.44 s [time-compat] 1968-W-20--1 = 1968-W01-1: OK
  1462. 640.44 s [time-compat] 1968-W-20-0 = 1968-W01-1: OK
  1463. 640.44 s [time-compat] 1968-W-20-1 = 1968-W01-1: OK
  1464. 640.44 s [time-compat] 1968-W-20-4 = 1968-W01-4: OK
  1465. 640.44 s [time-compat] 1968-W-20-6 = 1968-W01-6: OK
  1466. 640.44 s [time-compat] 1968-W-20-7 = 1968-W01-7: OK
  1467. 640.44 s [time-compat] 1968-W-20-8 = 1968-W01-7: OK
  1468. 640.44 s [time-compat] 1968-W-20-9 = 1968-W01-7: OK
  1469. 640.44 s [time-compat] 1968-W-1--2 = 1968-W01-1: OK
  1470. 640.44 s [time-compat] 1968-W-1--1 = 1968-W01-1: OK
  1471. 640.44 s [time-compat] 1968-W-1-0 = 1968-W01-1: OK
  1472. 640.44 s [time-compat] 1968-W-1-1 = 1968-W01-1: OK
  1473. 640.44 s [time-compat] 1968-W-1-4 = 1968-W01-4: OK
  1474. 640.44 s [time-compat] 1968-W-1-6 = 1968-W01-6: OK
  1475. 640.44 s [time-compat] 1968-W-1-7 = 1968-W01-7: OK
  1476. 640.44 s [time-compat] 1968-W-1-8 = 1968-W01-7: OK
  1477. 640.44 s [time-compat] 1968-W-1-9 = 1968-W01-7: OK
  1478. 640.44 s [time-compat] 1968-W0--2 = 1968-W01-1: OK
  1479. 640.44 s [time-compat] 1968-W0--1 = 1968-W01-1: OK
  1480. 640.44 s [time-compat] 1968-W0-0 = 1968-W01-1: OK
  1481. 640.44 s [time-compat] 1968-W0-1 = 1968-W01-1: OK
  1482. 640.44 s [time-compat] 1968-W0-4 = 1968-W01-4: OK
  1483. 640.44 s [time-compat] 1968-W0-6 = 1968-W01-6: OK
  1484. 640.44 s [time-compat] 1968-W0-7 = 1968-W01-7: OK
  1485. 640.44 s [time-compat] 1968-W0-8 = 1968-W01-7: OK
  1486. 640.44 s [time-compat] 1968-W0-9 = 1968-W01-7: OK
  1487. 640.44 s [time-compat] 1968-W1--2 = 1968-W01-1: OK
  1488. 640.44 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 )
  1489. 640.44 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 )
  1490. 640.44 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 )
  1491. 640.44 s [concurrent-output] System.Console.Concurrent=concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb:System.Console.Concurrent,System.Console.Concurrent.Internal=concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb:System.Console.Concurrent.Internal,System.Console.Regions=concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb:System.Console.Regions,System.Process.Concurrent=concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb:System.Process.Concurrent
  1492. 640.44 s [concurrent-output] Ready component graph:
  1493. 640.44 s [concurrent-output] definite concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb
  1494. 640.44 s [concurrent-output] depends ansi-terminal-1.1.2-8ILE2aUwQMrAKZvScdfvlf
  1495. 640.44 s [concurrent-output] depends async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1496. 640.44 s [concurrent-output] depends base-4.18.1.0
  1497. 640.44 s [concurrent-output] depends directory-1.3.8.1
  1498. 640.44 s [concurrent-output] depends exceptions-0.10.7
  1499. 640.44 s [concurrent-output] depends process-1.6.17.0
  1500. 640.44 s [concurrent-output] depends stm-2.5.1.0
  1501. 640.44 s [concurrent-output] depends terminal-size-0.3.4-F29cA6SfcnBIj4P9LFGJy0
  1502. 640.44 s [concurrent-output] depends text-2.0.2
  1503. 640.44 s [concurrent-output] depends transformers-0.6.1.0
  1504. 640.44 s [concurrent-output] depends unix-2.8.1.0
  1505. 640.44 s [concurrent-output] Using Cabal-3.10.1.0 compiled by ghc-9.6
  1506. 640.44 s [concurrent-output] Using compiler: ghc-9.6.3
  1507. 640.44 s [concurrent-output] Using install prefix:
  1508. 640.44 s [concurrent-output] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21
  1509. 640.44 s [concurrent-output] Executables installed in:
  1510. 640.44 s [concurrent-output] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/bin
  1511. 640.44 s [concurrent-output] Libraries installed in:
  1512. 640.44 s [concurrent-output] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb
  1513. 640.44 s [concurrent-output] Dynamic Libraries installed in:
  1514. 640.44 s [concurrent-output] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  1515. 640.44 s [concurrent-output] Private executables installed in:
  1516. 640.44 s [concurrent-output] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/libexec/x86_64-linux-ghc-9.6.3/concurrent-output-1.10.21
  1517. 640.44 s [concurrent-output] Data files installed in:
  1518. 640.44 s [concurrent-output] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/share/x86_64-linux-ghc-9.6.3/concurrent-output-1.10.21
  1519. 640.44 s [concurrent-output] Documentation installed in:
  1520. 640.44 s [concurrent-output] /nix/store/vs0fypp8xg16h15ms6sk15mdqvipxndh-concurrent-output-1.10.21-doc/share/doc/concurrent-output-1.10.21
  1521. 640.44 s [concurrent-output] Configuration files installed in:
  1522. 640.44 s [concurrent-output] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/etc
  1523. 640.44 s [concurrent-output] No alex found
  1524. 640.44 s [concurrent-output] Using ar found on system at:
  1525. 640.44 s [concurrent-output] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1526. 640.44 s [concurrent-output] No c2hs found
  1527. 640.44 s [concurrent-output] No cpphs found
  1528. 640.44 s [concurrent-output] No doctest found
  1529. 640.44 s [concurrent-output] Using gcc version 14.3.0 given by user at:
  1530. 640.44 s [concurrent-output] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1531. 640.44 s [concurrent-output] Using ghc version 9.6.3 found on system at:
  1532. 640.44 s [concurrent-output] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  1533. 640.44 s [concurrent-output] Using ghc-pkg version 9.6.3 found on system at:
  1534. 640.44 s [concurrent-output] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  1535. 640.44 s [concurrent-output] No ghcjs found
  1536. 640.44 s [concurrent-output] No ghcjs-pkg found
  1537. 640.44 s [concurrent-output] No greencard found
  1538. 640.44 s [concurrent-output] Using haddock version 2.29.1 found on system at:
  1539. 640.44 s [concurrent-output] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  1540. 640.44 s [concurrent-output] No happy found
  1541. 640.44 s [concurrent-output] Using haskell-suite found on system at: haskell-suite-dummy-location
  1542. 640.44 s [concurrent-output] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1543. 640.44 s [concurrent-output] No hmake found
  1544. 640.44 s [concurrent-output] Using hpc version 0.68 found on system at:
  1545. 640.44 s [concurrent-output] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  1546. 640.44 s [concurrent-output] Using hsc2hs version 0.68.9 found on system at:
  1547. 640.44 s [concurrent-output] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  1548. 640.44 s [concurrent-output] Using hscolour version 1.25 found on system at:
  1549. 640.44 s [concurrent-output] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  1550. 640.44 s [concurrent-output] No jhc found
  1551. 640.44 s [concurrent-output] Using ld found on system at:
  1552. 640.44 s [concurrent-output] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  1553. 640.44 s [concurrent-output] No pkg-config found
  1554. 640.44 s [concurrent-output] Using runghc version 9.6.3 found on system at:
  1555. 640.44 s [concurrent-output] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  1556. 640.44 s [concurrent-output] Using strip version 2.44 found on system at:
  1557. 640.44 s [concurrent-output] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1558. 640.44 s [concurrent-output] Using tar found on system at:
  1559. 640.44 s [concurrent-output] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1560. 640.44 s [concurrent-output] No uhc found
  1561. 640.44 s [concurrent-output] Phase: buildPhase
  1562. 640.44 s [concurrent-output] Preprocessing library for concurrent-output-1.10.21..
  1563. 640.44 s [concurrent-output] Building library for concurrent-output-1.10.21..
  1564. 640.44 s [concurrent-output] [1 of 6] Compiling Utility.Exception ( Utility/Exception.hs, dist/build/Utility/Exception.o, dist/build/Utility/Exception.dyn_o )
  1565. 640.44 s [concurrent-output] [2 of 6] Compiling Utility.Monad ( Utility/Monad.hs, dist/build/Utility/Monad.o, dist/build/Utility/Monad.dyn_o )
  1566. 640.52 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0 /nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc
  1567. 641.08 s [duoids:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  1568. 641.08 s [duoids:post-build]
  1569. 641.50 s [duoids:post-build] Pushing /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0 (8.06 MiB)
  1570. 641.55 s [duoids:post-build] Pushing /nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc (2.04 MiB)
  1571. 642.73 s [duoids:post-build]
  1572. 642.73 s [duoids:post-build] All done.
  1573. 642.86 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0 /nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc
  1574. 643.36 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1575. 643.46 s [duoids:post-build] copying 2 paths...
  1576. 643.46 s [duoids:post-build] copying path '/nix/store/vdms38jp2b2p0aix8sjk2vmzikk9jzsj-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1577. 644.39 s [duoids:post-build] copying path '/nix/store/qp6m1azkqg7nfqi9w5r3wm0rwj1q8fla-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  1578. 647.28 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1579. 647.69 s [duoids:post-build] copying 2 paths...
  1580. 647.82 s [duoids:post-build] copying path '/nix/store/isn3mz1bv1g5k3kzv60smhi3scf340lh-cabal-doctest-1.0.11.drv' to 'https://cache.nix-ci.com'...
  1581. 648.39 s [duoids:post-build] copying path '/nix/store/lfw82ik66xszxpndqk14qbkkn3pjc46n-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1582. 648.69 s Progress: 90 of 116 built (5 building), 172 of 172 downloaded from cache
  1583. 648.69 s [lifted-async] Using Cabal-3.10.1.0 compiled by ghc-9.6
  1584. 648.69 s [lifted-async] Using compiler: ghc-9.6.3
  1585. 648.69 s [lifted-async] Using install prefix:
  1586. 648.69 s [lifted-async] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7
  1587. 648.69 s [lifted-async] Executables installed in:
  1588. 648.69 s [lifted-async] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/bin
  1589. 648.69 s [lifted-async] Libraries installed in:
  1590. 648.69 s [lifted-async] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI
  1591. 648.69 s [lifted-async] Dynamic Libraries installed in:
  1592. 648.69 s [lifted-async] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  1593. 648.69 s [lifted-async] Private executables installed in:
  1594. 648.69 s [lifted-async] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/libexec/x86_64-linux-ghc-9.6.3/lifted-async-0.10.2.7
  1595. 648.69 s [lifted-async] Data files installed in:
  1596. 648.69 s [lifted-async] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/share/x86_64-linux-ghc-9.6.3/lifted-async-0.10.2.7
  1597. 648.69 s [lifted-async] Documentation installed in:
  1598. 648.69 s [lifted-async] /nix/store/ym4p5vclmcmhk6qnhlvbc77apnvsxg4k-lifted-async-0.10.2.7-doc/share/doc/lifted-async-0.10.2.7
  1599. 648.69 s [lifted-async] Configuration files installed in:
  1600. 648.69 s [lifted-async] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/etc
  1601. 648.69 s [lifted-async] No alex found
  1602. 648.69 s [lifted-async] Using ar found on system at:
  1603. 648.69 s [lifted-async] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1604. 648.69 s [lifted-async] No c2hs found
  1605. 648.69 s [lifted-async] No cpphs found
  1606. 648.69 s [lifted-async] No doctest found
  1607. 648.69 s [lifted-async] Using gcc version 14.3.0 given by user at:
  1608. 648.69 s [lifted-async] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1609. 648.69 s [lifted-async] Using ghc version 9.6.3 found on system at:
  1610. 648.69 s [lifted-async] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  1611. 648.69 s [lifted-async] Using ghc-pkg version 9.6.3 found on system at:
  1612. 648.69 s [lifted-async] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  1613. 648.69 s [lifted-async] No ghcjs found
  1614. 648.69 s [lifted-async] No ghcjs-pkg found
  1615. 648.69 s [lifted-async] No greencard found
  1616. 648.69 s [lifted-async] Using haddock version 2.29.1 found on system at:
  1617. 648.69 s [lifted-async] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  1618. 648.69 s [lifted-async] No happy found
  1619. 648.70 s [lifted-async] Using haskell-suite found on system at: haskell-suite-dummy-location
  1620. 648.70 s [lifted-async] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1621. 648.70 s [lifted-async] No hmake found
  1622. 648.70 s [lifted-async] Using hpc version 0.68 found on system at:
  1623. 648.70 s [lifted-async] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  1624. 648.70 s [lifted-async] Using hsc2hs version 0.68.9 found on system at:
  1625. 648.70 s [lifted-async] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  1626. 648.70 s [lifted-async] Using hscolour version 1.25 found on system at:
  1627. 648.70 s [lifted-async] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  1628. 648.70 s [lifted-async] No jhc found
  1629. 648.70 s [lifted-async] Using ld found on system at:
  1630. 648.70 s [lifted-async] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  1631. 648.70 s [lifted-async] No pkg-config found
  1632. 648.70 s [lifted-async] Using runghc version 9.6.3 found on system at:
  1633. 648.70 s [lifted-async] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  1634. 648.70 s [lifted-async] Using strip version 2.44 found on system at:
  1635. 648.70 s [lifted-async] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1636. 648.70 s [lifted-async] Using tar found on system at:
  1637. 648.70 s [lifted-async] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1638. 648.70 s [lifted-async] No uhc found
  1639. 648.70 s [lifted-async] Phase: buildPhase
  1640. 648.70 s [lifted-async] Preprocessing library for lifted-async-0.10.2.7..
  1641. 648.70 s [lifted-async] Building library for lifted-async-0.10.2.7..
  1642. 648.70 s [lifted-async] [1 of 2] Compiling Control.Concurrent.Async.Lifted ( src/Control/Concurrent/Async/Lifted.hs, dist/build/Control/Concurrent/Async/Lifted.o, dist/build/Control/Concurrent/Async/Lifted.dyn_o )
  1643. 648.70 s [lifted-async] [2 of 2] Compiling Control.Concurrent.Async.Lifted.Safe ( src/Control/Concurrent/Async/Lifted/Safe.hs, dist/build/Control/Concurrent/Async/Lifted/Safe.o, dist/build/Control/Concurrent/Async/Lifted/Safe.dyn_o )
  1644. 648.70 s [lifted-async] [1 of 2] Compiling Control.Concurrent.Async.Lifted ( src/Control/Concurrent/Async/Lifted.hs, dist/build/Control/Concurrent/Async/Lifted.p_o )
  1645. 648.70 s [lifted-async] [2 of 2] Compiling Control.Concurrent.Async.Lifted.Safe ( src/Control/Concurrent/Async/Lifted/Safe.hs, dist/build/Control/Concurrent/Async/Lifted/Safe.p_o )
  1646. 648.70 s [logict] include transformers-0.6.1.0
  1647. 648.70 s [logict] Ready component graph:
  1648. 648.70 s [logict] definite logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  1649. 648.70 s [logict] depends base-4.18.1.0
  1650. 648.70 s [logict] depends exceptions-0.10.7
  1651. 648.70 s [logict] depends mtl-2.3.1
  1652. 648.70 s [logict] depends transformers-0.6.1.0
  1653. 648.70 s [logict] definite logict-0.8.2.0-3SR4xRzo2IgL9pISggNaP1-logict-tests
  1654. 648.70 s [logict] depends async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  1655. 648.70 s [logict] depends base-4.18.1.0
  1656. 648.70 s [logict] depends logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  1657. 648.70 s [logict] depends mtl-2.3.1
  1658. 648.70 s [logict] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  1659. 648.70 s [logict] depends tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  1660. 648.70 s [logict] depends transformers-0.6.1.0
  1661. 648.70 s [logict] Using Cabal-3.10.1.0 compiled by ghc-9.6
  1662. 648.70 s [logict] Using compiler: ghc-9.6.3
  1663. 648.70 s [logict] Using install prefix:
  1664. 648.70 s [logict] /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0
  1665. 648.70 s [logict] Executables installed in:
  1666. 648.70 s [logict] /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/bin
  1667. 648.70 s [logict] Libraries installed in:
  1668. 648.70 s [logict] /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  1669. 648.70 s [logict] Dynamic Libraries installed in:
  1670. 648.70 s [logict] /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  1671. 648.70 s [logict] Private executables installed in:
  1672. 648.70 s [logict] /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/libexec/x86_64-linux-ghc-9.6.3/logict-0.8.2.0
  1673. 648.70 s [logict] Data files installed in:
  1674. 648.70 s [logict] /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/share/x86_64-linux-ghc-9.6.3/logict-0.8.2.0
  1675. 648.70 s [logict] Documentation installed in:
  1676. 648.70 s [logict] /nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc/share/doc/logict-0.8.2.0
  1677. 648.70 s [logict] Configuration files installed in:
  1678. 648.70 s [logict] /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/etc
  1679. 648.70 s [logict] No alex found
  1680. 648.70 s [logict] Using ar found on system at:
  1681. 648.70 s [logict] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1682. 648.70 s [logict] No c2hs found
  1683. 648.70 s [logict] No cpphs found
  1684. 648.70 s [logict] No doctest found
  1685. 648.70 s [logict] Using gcc version 14.3.0 given by user at:
  1686. 648.70 s [logict] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1687. 648.70 s [logict] Using ghc version 9.6.3 found on system at:
  1688. 648.70 s [logict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  1689. 648.70 s [logict] Using ghc-pkg version 9.6.3 found on system at:
  1690. 648.70 s [logict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  1691. 648.70 s [logict] No ghcjs found
  1692. 648.70 s [logict] No ghcjs-pkg found
  1693. 648.70 s [logict] No greencard found
  1694. 648.70 s [logict] Using haddock version 2.29.1 found on system at:
  1695. 648.70 s [logict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  1696. 648.70 s [logict] No happy found
  1697. 648.70 s [logict] Using haskell-suite found on system at: haskell-suite-dummy-location
  1698. 648.70 s [logict] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1699. 648.70 s [logict] No hmake found
  1700. 648.70 s [logict] Using hpc version 0.68 found on system at:
  1701. 648.70 s [logict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  1702. 648.70 s [logict] Using hsc2hs version 0.68.9 found on system at:
  1703. 648.70 s [logict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  1704. 648.70 s [logict] Using hscolour version 1.25 found on system at:
  1705. 648.70 s [logict] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  1706. 648.70 s [logict] No jhc found
  1707. 648.70 s [logict] Using ld found on system at:
  1708. 648.70 s [logict] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  1709. 648.70 s [logict] No pkg-config found
  1710. 648.70 s [logict] Using runghc version 9.6.3 found on system at:
  1711. 648.70 s [logict] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  1712. 648.70 s [logict] Using strip version 2.44 found on system at:
  1713. 648.70 s [logict] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1714. 648.70 s [logict] Using tar found on system at:
  1715. 648.70 s [logict] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1716. 648.70 s [logict] No uhc found
  1717. 648.70 s [logict] Phase: buildPhase
  1718. 648.70 s [logict] Preprocessing library for logict-0.8.2.0..
  1719. 648.70 s [logict] Building library for logict-0.8.2.0..
  1720. 648.70 s [logict] [1 of 2] Compiling Control.Monad.Logic.Class ( Control/Monad/Logic/Class.hs, dist/build/Control/Monad/Logic/Class.o, dist/build/Control/Monad/Logic/Class.dyn_o )
  1721. 648.70 s [logict] [2 of 2] Compiling Control.Monad.Logic ( Control/Monad/Logic.hs, dist/build/Control/Monad/Logic.o, dist/build/Control/Monad/Logic.dyn_o )
  1722. 648.70 s [logict] [1 of 2] Compiling Control.Monad.Logic.Class ( Control/Monad/Logic/Class.hs, dist/build/Control/Monad/Logic/Class.p_o )
  1723. 648.70 s [logict] [2 of 2] Compiling Control.Monad.Logic ( Control/Monad/Logic.hs, dist/build/Control/Monad/Logic.p_o )
  1724. 648.70 s [time-compat] 1968-W1--1 = 1968-W01-1: OK
  1725. 648.70 s [time-compat] 1968-W1-0 = 1968-W01-1: OK
  1726. 648.70 s [time-compat] 1968-W1-1 = 1968-W01-1: OK
  1727. 648.70 s [time-compat] 1968-W1-4 = 1968-W01-4: OK
  1728. 648.70 s [time-compat] 1968-W1-6 = 1968-W01-6: OK
  1729. 648.70 s [time-compat] 1968-W1-7 = 1968-W01-7: OK
  1730. 648.70 s [time-compat] 1968-W1-8 = 1968-W01-7: OK
  1731. 648.70 s [time-compat] 1968-W1-9 = 1968-W01-7: OK
  1732. 648.70 s [time-compat] 1968-W20--2 = 1968-W20-1: OK
  1733. 648.70 s [time-compat] 1968-W20--1 = 1968-W20-1: OK
  1734. 648.70 s [time-compat] 1968-W20-0 = 1968-W20-1: OK
  1735. 648.70 s [time-compat] 1968-W20-1 = 1968-W20-1: OK
  1736. 648.70 s [time-compat] 1968-W20-4 = 1968-W20-4: OK
  1737. 648.70 s [time-compat] 1968-W20-6 = 1968-W20-6: OK
  1738. 648.70 s [time-compat] 1968-W20-7 = 1968-W20-7: OK
  1739. 648.70 s [time-compat] 1968-W20-8 = 1968-W20-7: OK
  1740. 648.70 s [time-compat] 1968-W20-9 = 1968-W20-7: OK
  1741. 648.70 s [time-compat] 1968-W51--2 = 1968-W51-1: OK
  1742. 648.70 s [time-compat] 1968-W51--1 = 1968-W51-1: OK
  1743. 648.70 s [time-compat] 1968-W51-0 = 1968-W51-1: OK
  1744. 648.70 s [time-compat] 1968-W51-1 = 1968-W51-1: OK
  1745. 648.70 s [time-compat] 1968-W51-4 = 1968-W51-4: OK
  1746. 648.70 s [time-compat] 1968-W51-6 = 1968-W51-6: OK
  1747. 648.70 s [time-compat] 1968-W51-7 = 1968-W51-7: OK
  1748. 648.70 s [time-compat] 1968-W51-8 = 1968-W51-7: OK
  1749. 648.70 s [time-compat] 1968-W51-9 = 1968-W51-7: OK
  1750. 648.70 s [time-compat] 1968-W52--2 = 1968-W52-1: OK
  1751. 648.70 s [time-compat] 1968-W52--1 = 1968-W52-1: OK
  1752. 648.70 s [time-compat] 1968-W52-0 = 1968-W52-1: OK
  1753. 648.70 s [time-compat] 1968-W52-1 = 1968-W52-1: OK
  1754. 648.70 s [time-compat] 1968-W52-4 = 1968-W52-4: OK
  1755. 648.70 s [time-compat] 1968-W52-6 = 1968-W52-6: OK
  1756. 648.70 s [time-compat] 1968-W52-7 = 1968-W52-7: OK
  1757. 648.70 s [time-compat] 1968-W52-8 = 1968-W52-7: OK
  1758. 648.70 s [time-compat] 1968-W52-9 = 1968-W52-7: OK
  1759. 648.70 s [time-compat] 1968-W53--2 = 1968-W52-1: OK
  1760. 648.70 s [time-compat] 1968-W53--1 = 1968-W52-1: OK
  1761. 648.70 s [time-compat] 1968-W53-0 = 1968-W52-1: OK
  1762. 648.70 s [time-compat] 1968-W53-1 = 1968-W52-1: OK
  1763. 648.70 s [time-compat] 1968-W53-4 = 1968-W52-4: OK
  1764. 648.70 s [time-compat] 1968-W53-6 = 1968-W52-6: OK
  1765. 648.70 s [time-compat] 1968-W53-7 = 1968-W52-7: OK
  1766. 648.70 s [time-compat] 1968-W53-8 = 1968-W52-7: OK
  1767. 648.70 s [time-compat] 1968-W53-9 = 1968-W52-7: OK
  1768. 648.70 s [time-compat] 1968-W54--2 = 1968-W52-1: OK
  1769. 648.70 s [time-compat] 1968-W54--1 = 1968-W52-1: OK
  1770. 648.70 s [time-compat] 1968-W54-0 = 1968-W52-1: OK
  1771. 648.70 s [time-compat] 1968-W54-1 = 1968-W52-1: OK
  1772. 648.70 s [time-compat] 1968-W54-4 = 1968-W52-4: OK
  1773. 648.75 s Building /nix/store/aa9x36s9a12s5l9wpwshvvarngkfhjha-duoidal-transformers-0.0.1.0.drv
  1774. 648.75 s [concurrent-output] [3 of 6] Compiling System.Console.Concurrent.Internal ( System/Console/Concurrent/Internal.hs, dist/build/System/Console/Concurrent/Internal.o, dist/build/System/Console/Concurrent/Internal.dyn_o )
  1775. 648.75 s [concurrent-output] [4 of 6] Compiling System.Console.Concurrent ( System/Console/Concurrent.hs, dist/build/System/Console/Concurrent.o, dist/build/System/Console/Concurrent.dyn_o )
  1776. 648.75 s [concurrent-output] [5 of 6] Compiling System.Process.Concurrent ( System/Process/Concurrent.hs, dist/build/System/Process/Concurrent.o, dist/build/System/Process/Concurrent.dyn_o )
  1777. 648.75 s [concurrent-output] [6 of 6] Compiling System.Console.Regions ( System/Console/Regions.hs, dist/build/System/Console/Regions.o, dist/build/System/Console/Regions.dyn_o )
  1778. 648.75 s [concurrent-output] [1 of 6] Compiling Utility.Exception ( Utility/Exception.hs, dist/build/Utility/Exception.p_o )
  1779. 648.75 s [concurrent-output] [2 of 6] Compiling Utility.Monad ( Utility/Monad.hs, dist/build/Utility/Monad.p_o )
  1780. 648.75 s [concurrent-output] [3 of 6] Compiling System.Console.Concurrent.Internal ( System/Console/Concurrent/Internal.hs, dist/build/System/Console/Concurrent/Internal.p_o )
  1781. 648.75 s [concurrent-output] [4 of 6] Compiling System.Console.Concurrent ( System/Console/Concurrent.hs, dist/build/System/Console/Concurrent.p_o )
  1782. 648.75 s [concurrent-output] [5 of 6] Compiling System.Process.Concurrent ( System/Process/Concurrent.hs, dist/build/System/Process/Concurrent.p_o )
  1783. 648.75 s [concurrent-output] [6 of 6] Compiling System.Console.Regions ( System/Console/Regions.hs, dist/build/System/Console/Regions.p_o )
  1784. 648.75 s [concurrent-output] Phase: checkPhase
  1785. 648.75 s [concurrent-output] Package has no test suites.
  1786. 648.75 s [concurrent-output] Phase: haddockPhase
  1787. 648.75 s [concurrent-output] Preprocessing library for concurrent-output-1.10.21..
  1788. 648.75 s [concurrent-output] Running Haddock on library for concurrent-output-1.10.21..
  1789. 648.75 s [concurrent-output] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  1790. 648.75 s [concurrent-output] 46% ( 20 / 43) in 'System.Console.Concurrent.Internal'
  1791. 648.75 s [concurrent-output] Missing documentation for:
  1792. 648.75 s [concurrent-output] OutputHandle (System/Console/Concurrent/Internal.hs:38)
  1793. 648.75 s [concurrent-output] Lock (System/Console/Concurrent/Internal.hs:45)
  1794. 648.75 s [concurrent-output] withLock (System/Console/Concurrent/Internal.hs:75)
  1795. 648.75 s [concurrent-output] takeOutputLock' (System/Console/Concurrent/Internal.hs:78)
  1796. 648.75 s [concurrent-output] outputConcurrent' (System/Console/Concurrent/Internal.hs:170)
  1797. 648.75 s [concurrent-output] fgProcess (System/Console/Concurrent/Internal.hs:243)
  1798. 648.75 s [concurrent-output] bgProcess (System/Console/Concurrent/Internal.hs:255)
  1799. 648.75 s [concurrent-output] willOutput (System/Console/Concurrent/Internal.hs:288)
  1800. 648.75 s [concurrent-output] StdHandle (System/Console/Concurrent/Internal.hs:296)
  1801. 648.75 s [concurrent-output] toHandle (System/Console/Concurrent/Internal.hs:298)
  1802. 648.75 s [concurrent-output] bufferFor (System/Console/Concurrent/Internal.hs:302)
  1803. 648.75 s [concurrent-output] OutputBufferedActivity (System/Console/Concurrent/Internal.hs:306)
  1804. 648.75 s [concurrent-output] AtEnd (System/Console/Concurrent/Internal.hs:314)
  1805. 648.75 s [concurrent-output] BufSig (System/Console/Concurrent/Internal.hs:317)
  1806. 648.75 s [concurrent-output] setupOutputBuffer (System/Console/Concurrent/Internal.hs:319)
  1807. 648.75 s [concurrent-output] outputDrainer (System/Console/Concurrent/Internal.hs:328)
  1808. 648.75 s [concurrent-output] registerOutputThread (System/Console/Concurrent/Internal.hs:348)
  1809. 648.75 s [concurrent-output] unregisterOutputThread (System/Console/Concurrent/Internal.hs:353)
  1810. 648.75 s [concurrent-output] bufferWriter (System/Console/Concurrent/Internal.hs:363)
  1811. 648.75 s [concurrent-output] addOutputBuffer (System/Console/Concurrent/Internal.hs:416)
  1812. 648.75 s [concurrent-output] bufferOutputSTM' (System/Console/Concurrent/Internal.hs:450)
  1813. 648.75 s [concurrent-output] waitAnyBuffer (System/Console/Concurrent/Internal.hs:476)
  1814. 648.75 s [concurrent-output] endsNewLine (System/Console/Concurrent/Internal.hs:490)
  1815. 648.75 s [concurrent-output] 90% ( 18 / 20) in 'System.Console.Concurrent'
  1816. 648.75 s [concurrent-output] Missing documentation for:
  1817. 648.75 s [concurrent-output] StdHandle (System/Console/Concurrent/Internal.hs:296)
  1818. 648.76 s [concurrent-output] waitAnyBuffer (System/Console/Concurrent/Internal.hs:476)
  1819. 648.76 s [concurrent-output] 100% ( 3 / 3) in 'System.Process.Concurrent'
  1820. 648.76 s [concurrent-output] 96% ( 24 / 25) in 'System.Console.Regions'
  1821. 648.76 s [concurrent-output] Missing documentation for:
  1822. 648.76 s [concurrent-output] RegionContent (System/Console/Regions.hs:176)
  1823. 648.76 s [lifted-async] Phase: haddockPhase
  1824. 648.76 s [lifted-async] Preprocessing library for lifted-async-0.10.2.7..
  1825. 648.76 s [lifted-async] Running Haddock on library for lifted-async-0.10.2.7..
  1826. 648.76 s [lifted-async] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  1827. 648.76 s [lifted-async] Warning: 'a' is out of scope.
  1828. 648.76 s [lifted-async] If you qualify the identifier, haddock can try to link it anyway.
  1829. 648.76 s [lifted-async] 98% ( 62 / 63) in 'Control.Concurrent.Async.Lifted'
  1830. 648.76 s [lifted-async] Missing documentation for:
  1831. 648.76 s [lifted-async] ExceptionInLinkedThread
  1832. 648.76 s [lifted-async] Warning: 'a' is out of scope.
  1833. 648.76 s [lifted-async] If you qualify the identifier, haddock can try to link it anyway.
  1834. 648.76 s [lifted-async] Warning: 'm' is out of scope.
  1835. 648.76 s [lifted-async] If you qualify the identifier, haddock can try to link it anyway.
  1836. 648.76 s [lifted-async] 96% ( 63 / 65) in 'Control.Concurrent.Async.Lifted.Safe'
  1837. 648.76 s [lifted-async] Missing documentation for:
  1838. 648.76 s [lifted-async] Forall
  1839. 648.76 s [lifted-async] ExceptionInLinkedThread
  1840. 648.76 s [lifted-async] Documentation created: dist/doc/html/lifted-async/index.html,
  1841. 648.76 s [lifted-async] dist/doc/html/lifted-async/lifted-async.txt
  1842. 648.76 s [lifted-async] Phase: installPhase
  1843. 648.76 s [lifted-async] Installing library in /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI
  1844. 648.76 s [lifted-async] Phase: fixupPhase
  1845. 648.76 s [lifted-async] shrinking RPATHs of ELF executables and libraries in /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7
  1846. 648.76 s [lifted-async] shrinking /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSlifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI-ghc9.6.3.so
  1847. 648.76 s [lifted-async] checking for references to /build/ in /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7...
  1848. 648.76 s [lifted-async] patching script interpreter paths in /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7
  1849. 648.76 s [lifted-async] stripping (with command strip and flags -S -p) in /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/lib
  1850. 648.76 s [lifted-async] shrinking RPATHs of ELF executables and libraries in /nix/store/ym4p5vclmcmhk6qnhlvbc77apnvsxg4k-lifted-async-0.10.2.7-doc
  1851. 648.76 s [lifted-async] checking for references to /build/ in /nix/store/ym4p5vclmcmhk6qnhlvbc77apnvsxg4k-lifted-async-0.10.2.7-doc...
  1852. 648.76 s [lifted-async] patching script interpreter paths in /nix/store/ym4p5vclmcmhk6qnhlvbc77apnvsxg4k-lifted-async-0.10.2.7-doc
  1853. 648.76 s [logict] Preprocessing test suite 'logict-tests' for logict-0.8.2.0..
  1854. 648.76 s [logict] Building test suite 'logict-tests' for logict-0.8.2.0..
  1855. 648.76 s [logict] [1 of 1] Compiling Main ( test/Test.hs, dist/build/logict-tests/logict-tests-tmp/Main.o )
  1856. 648.76 s [logict] [2 of 2] Linking dist/build/logict-tests/logict-tests
  1857. 648.76 s [logict] Phase: checkPhase
  1858. 648.76 s [logict] Running 1 test suites...
  1859. 648.76 s [logict] Test suite logict-tests: RUNNING...
  1860. 648.76 s [logict] All
  1861. 648.76 s [logict] Monad Reader + env
  1862. 648.76 s [logict] Monad Reader 1: OK
  1863. 648.76 s [logict] Monad Reader 2: OK
  1864. 648.76 s [logict] Monad Reader 3: OK
  1865. 648.76 s [logict] Various monads
  1866. 648.76 s [logict] runIdentity all: OK
  1867. 648.76 s [logict] runIdentity many: OK
  1868. 648.76 s [logict] observeAll: OK
  1869. 648.76 s [logict] observeMany: OK
  1870. 648.76 s [logict] runReader is productive: OK
  1871. 648.76 s [logict] observeManyT can be used with Either: OK
  1872. 648.76 s [logict] Control.Monad.Logic tests
  1873. 648.76 s [logict] runLogicT multi: OK
  1874. 648.76 s [logict] runLogicT none: OK
  1875. 648.76 s [logict] runLogicT first: OK
  1876. 648.76 s [logict] runLogic multi: OK
  1877. 648.76 s [logict] runLogic none: OK
  1878. 648.76 s [logict] observe multi: OK
  1879. 648.76 s [logict] observe none: OK
  1880. 648.76 s [logict] observeAll multi: OK
  1881. 648.76 s [logict] observeAll none: OK
  1882. 648.76 s [logict] observeMany multi: OK
  1883. 648.76 s [logict] observeMany none: OK
  1884. 648.76 s [logict] (>>-) Logic: OK
  1885. 648.76 s [logict] Control.Monad.Logic.Class tests
  1886. 648.76 s [logict] msplit laws
  1887. 648.76 s [logict] msplit mzero == return Nothing
  1888. 648.76 s [logict] msplit mzero :: []: OK
  1889. 648.76 s [logict] msplit mzero :: ReaderT: OK
  1890. 648.76 s [logict] msplit mzero :: CPS WriterT: OK
  1891. 648.76 s [logict] msplit mzero :: LogicT: OK
  1892. 648.76 s [logict] msplit mzero :: strict StateT: OK
  1893. 648.76 s [logict] msplit mzero :: lazy StateT: OK
  1894. 648.76 s [logict] msplit (return a `mplus` m) == return (Just a, m)
  1895. 648.76 s [logict] msplit []: OK
  1896. 648.76 s [logict] (>>-) []: OK
  1897. 648.76 s [logict] msplit ReaderT: OK
  1898. 648.76 s [logict] msplit CPS WriterT: OK
  1899. 648.76 s [logict] msplit LogicT: OK
  1900. 648.76 s [logict] msplit strict StateT: OK
  1901. 648.76 s [logict] msplit lazy StateT: OK
  1902. 648.76 s [logict] fair disjunction
  1903. 648.76 s [logict] some odds: OK
  1904. 648.76 s [logict] unfair disjunction: OK
  1905. 648.76 s [logict] fair disjunction :: LogicT: OK
  1906. 648.76 s [logict] fair production: OK
  1907. 648.76 s [logict] NONTERMINATION even when fair: OK (0.11s)
  1908. 648.76 s [logict] fair disjunction :: []: OK
  1909. 648.76 s [logict] fair disjunction :: ReaderT: OK
  1910. 648.76 s [logict] fair disjunction :: CPS WriterT: OK
  1911. 648.76 s [logict] fair disjunction :: strict StateT: OK
  1912. 648.76 s [logict] fair disjunction :: lazy StateT: OK
  1913. 648.76 s [logict] fair conjunction
  1914. 648.76 s [logict] fair conjunction :: LogicT: OK
  1915. 648.76 s [logict] fair conjunction OK: OK
  1916. 648.76 s [logict] fair conjunction also OK: OK
  1917. 648.76 s [logict] fair conjunction NON-PRODUCTIVE: OK (0.12s)
  1918. 648.76 s [logict] fair conjunction also NON-PRODUCTIVE: OK (0.12s)
  1919. 648.76 s [logict] unfair conjunction is NON-PRODUCTIVE: OK (0.12s)
  1920. 648.76 s [logict] fair conjunction :: []: OK
  1921. 648.76 s [logict] fair conjunction :: ReaderT: OK
  1922. 648.76 s [logict] fair conjunction :: CPS WriterT: OK
  1923. 648.76 s [logict] fair conjunction :: strict StateT: OK
  1924. 648.76 s [logict] fair conjunction :: lazy StateT: OK
  1925. 648.76 s [logict] ifte logical conditional (soft-cut)
  1926. 648.76 s [logict] divisible odds: OK
  1927. 648.76 s [logict] indivisible odds, wrong: OK
  1928. 648.76 s [logict] indivisible odds :: LogicT: OK
  1929. 648.76 s [logict] indivisible odds :: []: OK
  1930. 648.76 s [logict] indivisible odds :: ReaderT: OK
  1931. 648.76 s [logict] indivisible odds :: CPS WriterT: OK
  1932. 648.76 s [logict] indivisible odds :: strict StateT: OK
  1933. 648.76 s [logict] indivisible odds :: strict StateT: OK
  1934. 648.76 s [logict] once (pruning)
  1935. 648.76 s [logict] no pruning: OK
  1936. 648.76 s [logict] with pruning: OK
  1937. 648.76 s [logict] lnot (inversion)
  1938. 648.76 s [logict] inversion :: LogicT: OK
  1939. 648.76 s [logict] inversion :: []: OK
  1940. 648.76 s [logict] inversion :: ReaderT: OK
  1941. 648.76 s [logict] inversion :: CPS WriterT: OK
  1942. 648.76 s [logict] inversion :: strict StateT: OK
  1943. 648.76 s [time-compat] 1968-W54-6 = 1968-W52-6: OK
  1944. 648.76 s [time-compat] 1968-W54-7 = 1968-W52-7: OK
  1945. 648.76 s [time-compat] 1968-W54-8 = 1968-W52-7: OK
  1946. 648.76 s [time-compat] 1968-W54-9 = 1968-W52-7: OK
  1947. 648.76 s [time-compat] 1969-W-20--2 = 1969-W01-1: OK
  1948. 648.76 s [time-compat] 1969-W-20--1 = 1969-W01-1: OK
  1949. 648.76 s [time-compat] 1969-W-20-0 = 1969-W01-1: OK
  1950. 648.76 s [time-compat] 1969-W-20-1 = 1969-W01-1: OK
  1951. 648.76 s [time-compat] 1969-W-20-4 = 1969-W01-4: OK
  1952. 648.76 s [time-compat] 1969-W-20-6 = 1969-W01-6: OK
  1953. 648.76 s [time-compat] 1969-W-20-7 = 1969-W01-7: OK
  1954. 648.76 s [time-compat] 1969-W-20-8 = 1969-W01-7: OK
  1955. 648.76 s [time-compat] 1969-W-20-9 = 1969-W01-7: OK
  1956. 648.76 s [time-compat] 1969-W-1--2 = 1969-W01-1: OK
  1957. 648.76 s [time-compat] 1969-W-1--1 = 1969-W01-1: OK
  1958. 648.76 s [time-compat] 1969-W-1-0 = 1969-W01-1: OK
  1959. 648.76 s [time-compat] 1969-W-1-1 = 1969-W01-1: OK
  1960. 648.76 s [time-compat] 1969-W-1-4 = 1969-W01-4: OK
  1961. 648.76 s [time-compat] 1969-W-1-6 = 1969-W01-6: OK
  1962. 648.76 s [time-compat] 1969-W-1-7 = 1969-W01-7: OK
  1963. 648.77 s [time-compat] 1969-W-1-8 = 1969-W01-7: OK
  1964. 648.77 s [time-compat] 1969-W-1-9 = 1969-W01-7: OK
  1965. 648.77 s [time-compat] 1969-W0--2 = 1969-W01-1: OK
  1966. 648.77 s [time-compat] 1969-W0--1 = 1969-W01-1: OK
  1967. 648.77 s [time-compat] 1969-W0-0 = 1969-W01-1: OK
  1968. 648.77 s [time-compat] 1969-W0-1 = 1969-W01-1: OK
  1969. 648.77 s [time-compat] 1969-W0-4 = 1969-W01-4: OK
  1970. 648.77 s [time-compat] 1969-W0-6 = 1969-W01-6: OK
  1971. 648.77 s [time-compat] 1969-W0-7 = 1969-W01-7: OK
  1972. 648.77 s [time-compat] 1969-W0-8 = 1969-W01-7: OK
  1973. 648.77 s [time-compat] 1969-W0-9 = 1969-W01-7: OK
  1974. 648.77 s [time-compat] 1969-W1--2 = 1969-W01-1: OK
  1975. 648.77 s [time-compat] 1969-W1--1 = 1969-W01-1: OK
  1976. 648.77 s [time-compat] 1969-W1-0 = 1969-W01-1: OK
  1977. 648.77 s [time-compat] 1969-W1-1 = 1969-W01-1: OK
  1978. 648.77 s [time-compat] 1969-W1-4 = 1969-W01-4: OK
  1979. 648.77 s [time-compat] 1969-W1-6 = 1969-W01-6: OK
  1980. 648.77 s [time-compat] 1969-W1-7 = 1969-W01-7: OK
  1981. 648.77 s [time-compat] 1969-W1-8 = 1969-W01-7: OK
  1982. 648.77 s [time-compat] 1969-W1-9 = 1969-W01-7: OK
  1983. 648.77 s [time-compat] 1969-W20--2 = 1969-W20-1: OK
  1984. 648.77 s [time-compat] 1969-W20--1 = 1969-W20-1: OK
  1985. 648.77 s [time-compat] 1969-W20-0 = 1969-W20-1: OK
  1986. 648.77 s [time-compat] 1969-W20-1 = 1969-W20-1: OK
  1987. 648.77 s [time-compat] 1969-W20-4 = 1969-W20-4: OK
  1988. 648.77 s [time-compat] 1969-W20-6 = 1969-W20-6: OK
  1989. 648.77 s [time-compat] 1969-W20-7 = 1969-W20-7: OK
  1990. 648.77 s [time-compat] 1969-W20-8 = 1969-W20-7: OK
  1991. 648.92 s [lifted-async:post-build] Uploading to cachix cache "sellout": /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7 /nix/store/ym4p5vclmcmhk6qnhlvbc77apnvsxg4k-lifted-async-0.10.2.7-doc
  1992. 649.91 s [lifted-async:post-build] Nothing to push - all store paths are already on Cachix.
  1993. 649.98 s [lifted-async:post-build] Uploading to the NixCI cache: /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7 /nix/store/ym4p5vclmcmhk6qnhlvbc77apnvsxg4k-lifted-async-0.10.2.7-doc
  1994. 650.39 s [lifted-async:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1995. 650.66 s [lifted-async:post-build] copying 2 paths...
  1996. 650.66 s [lifted-async:post-build] copying path '/nix/store/ym4p5vclmcmhk6qnhlvbc77apnvsxg4k-lifted-async-0.10.2.7-doc' to 'https://cache.nix-ci.com'...
  1997. 651.12 s [lifted-async:post-build] copying path '/nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7' to 'https://cache.nix-ci.com'...
  1998. 652.16 s [lifted-async:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1999. 652.50 s [lifted-async:post-build] copying 1 paths...
  2000. 652.50 s [lifted-async:post-build] copying path '/nix/store/9xv9z5g9gdh25x342s4wxbs2ziymlh5f-lifted-async-0.10.2.7.drv' to 'https://cache.nix-ci.com'...
  2001. 653.54 s Progress: 91 of 115 built (5 building), 172 of 172 downloaded from cache
  2002. 653.54 s [logict] inversion :: lazy StateT: OK
  2003. 653.54 s [logict]
  2004. 653.66 s [logict] All 71 tests passed (0.47s)
  2005. 653.66 s [logict] Test suite logict-tests: PASS
  2006. 653.66 s [logict] Test suite logged to: dist/test/logict-0.8.2.0-logict-tests.log
  2007. 653.66 s [logict] 1 of 1 test suites (1 of 1 test cases) passed.
  2008. 653.66 s [logict] Phase: haddockPhase
  2009. 653.66 s [logict] Preprocessing library for logict-0.8.2.0..
  2010. 653.66 s [logict] Running Haddock on library for logict-0.8.2.0..
  2011. 653.66 s [logict] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  2012. 653.66 s [time-compat] 1969-W20-9 = 1969-W20-7: OK
  2013. 653.66 s [time-compat] 1969-W51--2 = 1969-W51-1: OK
  2014. 653.66 s [time-compat] 1969-W51--1 = 1969-W51-1: OK
  2015. 653.66 s [time-compat] 1969-W51-0 = 1969-W51-1: OK
  2016. 653.66 s [time-compat] 1969-W51-1 = 1969-W51-1: OK
  2017. 653.66 s [time-compat] 1969-W51-4 = 1969-W51-4: OK
  2018. 653.66 s [time-compat] 1969-W51-6 = 1969-W51-6: OK
  2019. 653.66 s [time-compat] 1969-W51-7 = 1969-W51-7: OK
  2020. 653.66 s [time-compat] 1969-W51-8 = 1969-W51-7: OK
  2021. 653.66 s [time-compat] 1969-W51-9 = 1969-W51-7: OK
  2022. 653.66 s [time-compat] 1969-W52--2 = 1969-W52-1: OK
  2023. 653.66 s [time-compat] 1969-W52--1 = 1969-W52-1: OK
  2024. 653.66 s [time-compat] 1969-W52-0 = 1969-W52-1: OK
  2025. 653.66 s [time-compat] 1969-W52-1 = 1969-W52-1: OK
  2026. 653.67 s [time-compat] 1969-W52-4 = 1969-W52-4: OK
  2027. 653.67 s [time-compat] 1969-W52-6 = 1969-W52-6: OK
  2028. 653.67 s [time-compat] 1969-W52-7 = 1969-W52-7: OK
  2029. 653.67 s [time-compat] 1969-W52-8 = 1969-W52-7: OK
  2030. 653.67 s [time-compat] 1969-W52-9 = 1969-W52-7: OK
  2031. 653.67 s [time-compat] 1969-W53--2 = 1969-W52-1: OK
  2032. 653.67 s [time-compat] 1969-W53--1 = 1969-W52-1: OK
  2033. 653.67 s [time-compat] 1969-W53-0 = 1969-W52-1: OK
  2034. 653.67 s [time-compat] 1969-W53-1 = 1969-W52-1: OK
  2035. 653.67 s [time-compat] 1969-W53-4 = 1969-W52-4: OK
  2036. 653.67 s [time-compat] 1969-W53-6 = 1969-W52-6: OK
  2037. 653.67 s [time-compat] 1969-W53-7 = 1969-W52-7: OK
  2038. 653.67 s [time-compat] 1969-W53-8 = 1969-W52-7: OK
  2039. 653.67 s [time-compat] 1969-W53-9 = 1969-W52-7: OK
  2040. 653.67 s [time-compat] 1969-W54--2 = 1969-W52-1: OK
  2041. 653.67 s [time-compat] 1969-W54--1 = 1969-W52-1: OK
  2042. 653.67 s [time-compat] 1969-W54-0 = 1969-W52-1: OK
  2043. 653.67 s [time-compat] 1969-W54-1 = 1969-W52-1: OK
  2044. 653.67 s [time-compat] 1969-W54-4 = 1969-W52-4: OK
  2045. 653.67 s [time-compat] 1969-W54-6 = 1969-W52-6: OK
  2046. 653.67 s [time-compat] 1969-W54-7 = 1969-W52-7: OK
  2047. 653.67 s [time-compat] 1969-W54-8 = 1969-W52-7: OK
  2048. 653.67 s [time-compat] 1969-W54-9 = 1969-W52-7: OK
  2049. 653.67 s [time-compat] 2004-W-20--2 = 2004-W01-1: OK
  2050. 653.67 s [time-compat] 2004-W-20--1 = 2004-W01-1: OK
  2051. 653.67 s [time-compat] 2004-W-20-0 = 2004-W01-1: OK
  2052. 653.67 s [time-compat] 2004-W-20-1 = 2004-W01-1: OK
  2053. 653.67 s [time-compat] 2004-W-20-4 = 2004-W01-4: OK
  2054. 653.67 s [time-compat] 2004-W-20-6 = 2004-W01-6: OK
  2055. 653.67 s [time-compat] 2004-W-20-7 = 2004-W01-7: OK
  2056. 653.67 s [time-compat] 2004-W-20-8 = 2004-W01-7: OK
  2057. 653.67 s [time-compat] 2004-W-20-9 = 2004-W01-7: OK
  2058. 653.67 s [time-compat] 2004-W-1--2 = 2004-W01-1: OK
  2059. 653.67 s [time-compat] 2004-W-1--1 = 2004-W01-1: OK
  2060. 653.67 s [concurrent-output] Documentation created: dist/doc/html/concurrent-output/index.html,
  2061. 653.67 s [concurrent-output] dist/doc/html/concurrent-output/concurrent-output.txt
  2062. 653.67 s [concurrent-output] Phase: installPhase
  2063. 653.67 s [concurrent-output] Installing library in /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb
  2064. 653.67 s [concurrent-output] Phase: fixupPhase
  2065. 653.67 s [concurrent-output] shrinking RPATHs of ELF executables and libraries in /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21
  2066. 653.67 s [concurrent-output] shrinking /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSconcurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb-ghc9.6.3.so
  2067. 653.67 s [concurrent-output] checking for references to /build/ in /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21...
  2068. 653.67 s [concurrent-output] patching script interpreter paths in /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21
  2069. 653.67 s [concurrent-output] stripping (with command strip and flags -S -p) in /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/lib
  2070. 653.67 s [concurrent-output] shrinking RPATHs of ELF executables and libraries in /nix/store/vs0fypp8xg16h15ms6sk15mdqvipxndh-concurrent-output-1.10.21-doc
  2071. 653.67 s [concurrent-output] checking for references to /build/ in /nix/store/vs0fypp8xg16h15ms6sk15mdqvipxndh-concurrent-output-1.10.21-doc...
  2072. 653.67 s [concurrent-output] patching script interpreter paths in /nix/store/vs0fypp8xg16h15ms6sk15mdqvipxndh-concurrent-output-1.10.21-doc
  2073. 653.67 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  2074. 653.67 s [duoidal-transformers] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  2075. 653.67 s [duoidal-transformers] Phase: unpackPhase
  2076. 653.67 s [duoidal-transformers] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./transformers
  2077. 653.67 s [duoidal-transformers] source root is transformers
  2078. 653.67 s [duoidal-transformers] Phase: patchPhase
  2079. 653.67 s [duoidal-transformers] Phase: compileBuildDriverPhase
  2080. 653.67 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.2okqGAkeUY/setup-package.conf.d -threaded
  2081. 653.67 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.2okqGAkeUY/Main.o )
  2082. 653.67 s [duoidal-transformers] [2 of 2] Linking Setup
  2083. 653.67 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  2084. 653.67 s [duoidal-transformers] Phase: configurePhase
  2085. 653.67 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.2okqGAkeUY/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/lib
  2086. 653.67 s [duoidal-transformers] Using Parsec parser
  2087. 653.67 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  2088. 653.67 s [duoidal-transformers] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  2089. 653.67 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2090. 653.67 s [duoidal-transformers] >=4.21.0 && <4.22: using base-4.18.1.0
  2091. 653.67 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2092. 653.67 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.0
  2093. 653.67 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2094. 653.67 s [duoidal-transformers] >=4.21.0 && <4.22: using base-4.18.1.0
  2095. 653.67 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  2096. 653.67 s [duoidal-transformers] <0.25: using doctest-0.22.6
  2097. 653.67 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  2098. 653.67 s [duoidal-transformers] Source component graph:
  2099. 653.67 s [duoidal-transformers] component lib
  2100. 653.67 s [duoidal-transformers] component test:doctests dependency lib
  2101. 653.67 s [duoidal-transformers] Configured component graph:
  2102. 653.67 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF
  2103. 653.67 s [duoidal-transformers] include base-4.18.1.0
  2104. 653.67 s [duoidal-transformers] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  2105. 653.67 s [duoidal-transformers] include transformers-0.6.1.0
  2106. 653.67 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-FMtmyIk7TIe5cKx1AnIWJX-doctests
  2107. 653.67 s [duoidal-transformers] include base-4.18.1.0
  2108. 653.67 s [duoidal-transformers] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  2109. 653.67 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF
  2110. 653.67 s [duoidal-transformers] Linked component graph:
  2111. 653.67 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF
  2112. 653.67 s [duoidal-transformers] include base-4.18.1.0
  2113. 653.67 s [duoidal-transformers] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  2114. 653.67 s [duoidal-transformers] include transformers-0.6.1.0
  2115. 653.67 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF:Control.Duoidal.Trans.Orphans
  2116. 653.67 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-FMtmyIk7TIe5cKx1AnIWJX-doctests
  2117. 653.67 s [duoidal-transformers] include base-4.18.1.0
  2118. 653.67 s [duoidal-transformers] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  2119. 653.67 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF
  2120. 653.67 s [duoidal-transformers] Ready component graph:
  2121. 653.67 s [logict] 100% ( 3 / 3) in 'Control.Monad.Logic.Class'
  2122. 653.67 s [logict] 100% ( 19 / 19) in 'Control.Monad.Logic'
  2123. 653.67 s [logict] Documentation created: dist/doc/html/logict/index.html,
  2124. 653.67 s [logict] dist/doc/html/logict/logict.txt
  2125. 653.67 s [logict] Preprocessing test suite 'logict-tests' for logict-0.8.2.0..
  2126. 653.67 s [logict] Phase: installPhase
  2127. 653.67 s [logict] Installing library in /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  2128. 653.67 s [logict] Phase: fixupPhase
  2129. 653.67 s [logict] shrinking RPATHs of ELF executables and libraries in /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0
  2130. 653.67 s [logict] shrinking /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSlogict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V-ghc9.6.3.so
  2131. 653.67 s [logict] checking for references to /build/ in /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0...
  2132. 653.67 s [logict] patching script interpreter paths in /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0
  2133. 653.67 s [logict] stripping (with command strip and flags -S -p) in /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0/lib
  2134. 653.67 s [logict] shrinking RPATHs of ELF executables and libraries in /nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc
  2135. 653.67 s [logict] checking for references to /build/ in /nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc...
  2136. 653.67 s [time-compat] 2004-W-1-0 = 2004-W01-1: OK
  2137. 653.67 s [time-compat] 2004-W-1-1 = 2004-W01-1: OK
  2138. 653.67 s [time-compat] 2004-W-1-4 = 2004-W01-4: OK
  2139. 653.67 s [time-compat] 2004-W-1-6 = 2004-W01-6: OK
  2140. 653.67 s [time-compat] 2004-W-1-7 = 2004-W01-7: OK
  2141. 653.67 s [time-compat] 2004-W-1-8 = 2004-W01-7: OK
  2142. 653.67 s [time-compat] 2004-W-1-9 = 2004-W01-7: OK
  2143. 653.67 s [time-compat] 2004-W0--2 = 2004-W01-1: OK
  2144. 653.67 s [time-compat] 2004-W0--1 = 2004-W01-1: OK
  2145. 653.67 s [time-compat] 2004-W0-0 = 2004-W01-1: OK
  2146. 653.67 s [time-compat] 2004-W0-1 = 2004-W01-1: OK
  2147. 653.67 s [time-compat] 2004-W0-4 = 2004-W01-4: OK
  2148. 653.67 s [time-compat] 2004-W0-6 = 2004-W01-6: OK
  2149. 653.67 s [time-compat] 2004-W0-7 = 2004-W01-7: OK
  2150. 653.67 s [time-compat] 2004-W0-8 = 2004-W01-7: OK
  2151. 653.67 s [time-compat] 2004-W0-9 = 2004-W01-7: OK
  2152. 653.67 s [time-compat] 2004-W1--2 = 2004-W01-1: OK
  2153. 653.67 s [time-compat] 2004-W1--1 = 2004-W01-1: OK
  2154. 653.67 s [time-compat] 2004-W1-0 = 2004-W01-1: OK
  2155. 653.67 s [time-compat] 2004-W1-1 = 2004-W01-1: OK
  2156. 653.67 s [time-compat] 2004-W1-4 = 2004-W01-4: OK
  2157. 653.67 s [time-compat] 2004-W1-6 = 2004-W01-6: OK
  2158. 653.67 s [time-compat] 2004-W1-7 = 2004-W01-7: OK
  2159. 653.67 s [time-compat] 2004-W1-8 = 2004-W01-7: OK
  2160. 653.67 s [time-compat] 2004-W1-9 = 2004-W01-7: OK
  2161. 653.67 s [time-compat] 2004-W20--2 = 2004-W20-1: OK
  2162. 653.67 s [time-compat] 2004-W20--1 = 2004-W20-1: OK
  2163. 653.67 s [time-compat] 2004-W20-0 = 2004-W20-1: OK
  2164. 653.67 s [time-compat] 2004-W20-1 = 2004-W20-1: OK
  2165. 653.67 s [time-compat] 2004-W20-4 = 2004-W20-4: OK
  2166. 653.67 s [time-compat] 2004-W20-6 = 2004-W20-6: OK
  2167. 653.67 s [time-compat] 2004-W20-7 = 2004-W20-7: OK
  2168. 653.67 s [time-compat] 2004-W20-8 = 2004-W20-7: OK
  2169. 653.67 s [time-compat] 2004-W20-9 = 2004-W20-7: OK
  2170. 653.67 s [time-compat] 2004-W51--2 = 2004-W51-1: OK
  2171. 653.67 s [time-compat] 2004-W51--1 = 2004-W51-1: OK
  2172. 653.67 s [time-compat] 2004-W51-0 = 2004-W51-1: OK
  2173. 653.67 s [time-compat] 2004-W51-1 = 2004-W51-1: OK
  2174. 653.67 s [time-compat] 2004-W51-4 = 2004-W51-4: OK
  2175. 653.67 s [time-compat] 2004-W51-6 = 2004-W51-6: OK
  2176. 653.67 s [time-compat] 2004-W51-7 = 2004-W51-7: OK
  2177. 653.67 s [time-compat] 2004-W51-8 = 2004-W51-7: OK
  2178. 653.67 s [time-compat] 2004-W51-9 = 2004-W51-7: OK
  2179. 653.67 s [time-compat] 2004-W52--2 = 2004-W52-1: OK
  2180. 653.67 s [time-compat] 2004-W52--1 = 2004-W52-1: OK
  2181. 653.67 s [time-compat] 2004-W52-0 = 2004-W52-1: OK
  2182. 653.67 s [time-compat] 2004-W52-1 = 2004-W52-1: OK
  2183. 653.67 s [time-compat] 2004-W52-4 = 2004-W52-4: OK
  2184. 653.67 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 )
  2185. 653.67 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  2186. 653.67 s [concurrent-output:post-build] Uploading to cachix cache "sellout": /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21 /nix/store/vs0fypp8xg16h15ms6sk15mdqvipxndh-concurrent-output-1.10.21-doc
  2187. 654.15 s [concurrent-output:post-build] Nothing to push - all store paths are already on Cachix.
  2188. 654.18 s [concurrent-output:post-build] Uploading to the NixCI cache: /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21 /nix/store/vs0fypp8xg16h15ms6sk15mdqvipxndh-concurrent-output-1.10.21-doc
  2189. 654.25 s [concurrent-output:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2190. 654.49 s [concurrent-output:post-build] copying 2 paths...
  2191. 654.49 s [concurrent-output:post-build] copying path '/nix/store/vs0fypp8xg16h15ms6sk15mdqvipxndh-concurrent-output-1.10.21-doc' to 'https://cache.nix-ci.com'...
  2192. 655.04 s [concurrent-output:post-build] copying path '/nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21' to 'https://cache.nix-ci.com'...
  2193. 656.38 s [concurrent-output:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2194. 656.66 s [concurrent-output:post-build] copying 1 paths...
  2195. 656.66 s [concurrent-output:post-build] copying path '/nix/store/vhr5s8kz4z16y9rq7j8cmybrd01yrm0i-concurrent-output-1.10.21.drv' to 'https://cache.nix-ci.com'...
  2196. 656.92 s Progress: 92 of 115 built (4 building), 172 of 172 downloaded from cache
  2197. 656.92 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF
  2198. 656.92 s [duoidal-transformers] depends base-4.18.1.0
  2199. 656.92 s [duoidal-transformers] depends duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  2200. 656.92 s [duoidal-transformers] depends transformers-0.6.1.0
  2201. 656.92 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-FMtmyIk7TIe5cKx1AnIWJX-doctests
  2202. 656.92 s [duoidal-transformers] depends base-4.18.1.0
  2203. 656.92 s [duoidal-transformers] depends doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  2204. 656.92 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF
  2205. 656.92 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.6
  2206. 656.92 s [duoidal-transformers] Using compiler: ghc-9.6.3
  2207. 656.92 s [duoidal-transformers] Using install prefix:
  2208. 656.92 s [duoidal-transformers] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0
  2209. 656.92 s [duoidal-transformers] Executables installed in:
  2210. 656.92 s [duoidal-transformers] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/bin
  2211. 656.92 s [duoidal-transformers] Libraries installed in:
  2212. 656.92 s [duoidal-transformers] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF
  2213. 656.92 s [duoidal-transformers] Dynamic Libraries installed in:
  2214. 656.92 s [duoidal-transformers] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  2215. 656.92 s [duoidal-transformers] Private executables installed in:
  2216. 656.92 s [duoidal-transformers] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.6.3/duoidal-transformers-0.0.1.0
  2217. 656.92 s [duoidal-transformers] Data files installed in:
  2218. 656.92 s [duoidal-transformers] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.6.3/duoidal-transformers-0.0.1.0
  2219. 656.92 s [duoidal-transformers] Documentation installed in:
  2220. 656.92 s [duoidal-transformers] /nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  2221. 656.92 s [duoidal-transformers] Configuration files installed in:
  2222. 656.92 s [duoidal-transformers] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/etc
  2223. 656.92 s [duoidal-transformers] No alex found
  2224. 656.92 s [duoidal-transformers] Using ar found on system at:
  2225. 656.92 s [duoidal-transformers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  2226. 656.92 s [duoidal-transformers] No c2hs found
  2227. 656.92 s [duoidal-transformers] No cpphs found
  2228. 656.92 s [duoidal-transformers] Using doctest version 0.22.6 found on system at:
  2229. 656.92 s [duoidal-transformers] /nix/store/1rhhhdgycbwrgfgqrs5rr0mmh6r4ly3h-doctest-0.22.6/bin/doctest
  2230. 656.92 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  2231. 656.92 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  2232. 656.92 s [duoidal-transformers] Using ghc version 9.6.3 found on system at:
  2233. 656.92 s [duoidal-transformers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  2234. 656.92 s [duoidal-transformers] Using ghc-pkg version 9.6.3 found on system at:
  2235. 656.92 s [duoidal-transformers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  2236. 656.92 s [duoidal-transformers] No ghcjs found
  2237. 656.92 s [duoidal-transformers] No ghcjs-pkg found
  2238. 656.92 s [duoidal-transformers] No greencard found
  2239. 656.92 s [duoidal-transformers] Using haddock version 2.29.1 found on system at:
  2240. 656.92 s [duoidal-transformers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  2241. 656.92 s [duoidal-transformers] No happy found
  2242. 656.92 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  2243. 656.92 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2244. 656.92 s [duoidal-transformers] No hmake found
  2245. 656.92 s [duoidal-transformers] Using hpc version 0.68 found on system at:
  2246. 656.92 s [duoidal-transformers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  2247. 656.92 s [duoidal-transformers] Using hsc2hs version 0.68.9 found on system at:
  2248. 656.92 s [duoidal-transformers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  2249. 656.92 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  2250. 656.92 s [duoidal-transformers] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  2251. 656.92 s [duoidal-transformers] No jhc found
  2252. 656.92 s [duoidal-transformers] Using ld found on system at:
  2253. 656.92 s [duoidal-transformers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  2254. 656.92 s [duoidal-transformers] No pkg-config found
  2255. 656.92 s [duoidal-transformers] Using runghc version 9.6.3 found on system at:
  2256. 656.92 s [duoidal-transformers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  2257. 656.92 s [duoidal-transformers] Using strip version 2.44 found on system at:
  2258. 656.92 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  2259. 656.92 s [duoidal-transformers] Using tar found on system at:
  2260. 656.92 s [duoidal-transformers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  2261. 656.92 s [duoidal-transformers] No uhc found
  2262. 656.92 s [duoidal-transformers] Phase: buildPhase
  2263. 656.92 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  2264. 656.92 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  2265. 656.92 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 )
  2266. 656.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 )
  2267. 656.92 s [time-compat] 2004-W52-6 = 2004-W52-6: OK
  2268. 656.92 s [time-compat] 2004-W52-7 = 2004-W52-7: OK
  2269. 656.92 s [time-compat] 2004-W52-8 = 2004-W52-7: OK
  2270. 656.92 s [time-compat] 2004-W52-9 = 2004-W52-7: OK
  2271. 656.92 s [time-compat] 2004-W53--2 = 2004-W53-1: OK
  2272. 656.92 s [time-compat] 2004-W53--1 = 2004-W53-1: OK
  2273. 656.92 s [time-compat] 2004-W53-0 = 2004-W53-1: OK
  2274. 656.92 s [time-compat] 2004-W53-1 = 2004-W53-1: OK
  2275. 656.92 s [time-compat] 2004-W53-4 = 2004-W53-4: OK
  2276. 656.92 s [time-compat] 2004-W53-6 = 2004-W53-6: OK
  2277. 656.92 s [time-compat] 2004-W53-7 = 2004-W53-7: OK
  2278. 656.92 s [time-compat] 2004-W53-8 = 2004-W53-7: OK
  2279. 656.92 s [time-compat] 2004-W53-9 = 2004-W53-7: OK
  2280. 656.92 s [time-compat] 2004-W54--2 = 2004-W53-1: OK
  2281. 656.92 s [time-compat] 2004-W54--1 = 2004-W53-1: OK
  2282. 656.92 s [time-compat] 2004-W54-0 = 2004-W53-1: OK
  2283. 656.92 s [time-compat] 2004-W54-1 = 2004-W53-1: OK
  2284. 656.92 s [time-compat] 2004-W54-4 = 2004-W53-4: OK
  2285. 656.92 s [time-compat] 2004-W54-6 = 2004-W53-6: OK
  2286. 656.92 s [time-compat] 2004-W54-7 = 2004-W53-7: OK
  2287. 656.92 s [time-compat] 2004-W54-8 = 2004-W53-7: OK
  2288. 656.92 s [time-compat] 2004-W54-9 = 2004-W53-7: OK
  2289. 656.92 s [time-compat] convertBack: OK
  2290. 656.92 s [time-compat] longWeekYears: OK
  2291. 656.92 s [time-compat] testMonthDay: OK
  2292. 656.92 s [time-compat] testEaster: OK
  2293. 656.92 s [time-compat] testValid
  2294. 656.92 s [time-compat] Gregorian
  2295. 656.92 s [time-compat] valid: OK
  2296. 656.92 s [time-compat] +++ OK, passed 100 tests; 169 discarded.
  2297. 656.92 s [time-compat] invalid: OK
  2298. 656.92 s [time-compat] +++ OK, passed 100 tests; 74 discarded.
  2299. 656.92 s [time-compat] OrdinalDate
  2300. 656.92 s [time-compat] valid: OK
  2301. 656.92 s [time-compat] +++ OK, passed 100 tests; 18 discarded.
  2302. 656.92 s [time-compat] invalid: OK
  2303. 656.92 s [time-compat] +++ OK, passed 100 tests; 643 discarded.
  2304. 656.92 s [time-compat] WeekDate
  2305. 656.92 s [time-compat] valid: OK
  2306. 656.92 s [time-compat] +++ OK, passed 100 tests; 232 discarded.
  2307. 656.92 s [time-compat] invalid: OK
  2308. 656.92 s [time-compat] +++ OK, passed 100 tests; 32 discarded.
  2309. 656.92 s [time-compat] SundayStartWeek
  2310. 656.92 s [time-compat] valid: OK
  2311. 656.92 s [time-compat] +++ OK, passed 100 tests; 276 discarded.
  2312. 656.92 s [time-compat] invalid: OK
  2313. 656.92 s [time-compat] +++ OK, passed 100 tests; 45 discarded.
  2314. 656.92 s [time-compat] MondayStartWeek
  2315. 656.92 s [time-compat] valid: OK
  2316. 656.92 s [time-compat] +++ OK, passed 100 tests; 298 discarded.
  2317. 656.92 s [time-compat] invalid: OK
  2318. 656.92 s [time-compat] +++ OK, passed 100 tests; 44 discarded.
  2319. 656.92 s [time-compat] Julian
  2320. 656.92 s [time-compat] valid: OK
  2321. 656.92 s [time-compat] +++ OK, passed 100 tests; 124 discarded.
  2322. 656.92 s [time-compat] invalid: OK
  2323. 656.92 s [time-compat] +++ OK, passed 100 tests; 63 discarded.
  2324. 656.92 s [time-compat] Week
  2325. 656.92 s [time-compat] day: OK
  2326. 656.92 s [time-compat] succ
  2327. 656.92 s [time-compat] Monday: OK
  2328. 656.97 s Building /nix/store/rz6jcqsk53vrni92p2vs7kh5qkc6a4ld-hedgehog-1.5.drv
  2329. 656.98 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 )
  2330. 656.98 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 )
  2331. 656.98 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2332. 656.98 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  2333. 656.98 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  2334. 656.98 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2335. 656.98 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  2336. 656.98 s [logict] patching script interpreter paths in /nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc
  2337. 656.98 s [time-compat] Tuesday: OK
  2338. 656.98 s [time-compat] Wednesday: OK
  2339. 656.98 s [time-compat] Thursday: OK
  2340. 656.98 s [time-compat] Friday: OK
  2341. 656.98 s [time-compat] Saturday: OK
  2342. 656.98 s [time-compat] Sunday: OK
  2343. 656.98 s [time-compat] pred
  2344. 656.98 s [time-compat] Monday: OK
  2345. 656.98 s [time-compat] Tuesday: OK
  2346. 656.98 s [time-compat] Wednesday: OK
  2347. 656.98 s [time-compat] Thursday: OK
  2348. 656.98 s [time-compat] Friday: OK
  2349. 656.98 s [time-compat] Saturday: OK
  2350. 656.98 s [time-compat] Sunday: OK
  2351. 656.98 s [time-compat] sequence
  2352. 656.98 s [time-compat] [Monday .. Sunday]: OK
  2353. 656.98 s [time-compat] [Wednesday .. Wednesday]: OK
  2354. 656.98 s [time-compat] [Sunday .. Saturday]: OK
  2355. 656.98 s [time-compat] [Thursday .. Wednesday]: OK
  2356. 656.98 s [time-compat] [Tuesday ..]: OK
  2357. 656.98 s [time-compat] [Wednesday, Tuesday ..]: OK
  2358. 656.98 s [time-compat] [Sunday, Friday ..]: OK
  2359. 656.98 s [time-compat] [Monday,Sunday .. Tuesday]: OK
  2360. 656.98 s [time-compat] [Thursday, Saturday .. Tuesday]: OK
  2361. 656.98 s [time-compat] read show
  2362. 656.98 s [time-compat] Monday: OK
  2363. 656.98 s [time-compat] Tuesday: OK
  2364. 656.98 s [time-compat] Wednesday: OK
  2365. 656.98 s [time-compat] Thursday: OK
  2366. 656.98 s [time-compat] Friday: OK
  2367. 656.98 s [time-compat] Saturday: OK
  2368. 656.98 s [time-compat] Sunday: OK
  2369. 656.98 s [time-compat] diff
  2370. 656.98 s [time-compat] Friday - Tuesday: OK
  2371. 656.98 s [time-compat] Tuesday - Friday: OK
  2372. 656.98 s [time-compat] firstDayOfWeekOnAfter_onAfter: OK
  2373. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2374. 656.98 s [time-compat] firstDayOfWeekOnAfter_Day: OK
  2375. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2376. 656.98 s [time-compat] toFromWeekCalendar: OK
  2377. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2378. 656.98 s [time-compat] weekChanges: OK
  2379. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2380. 656.98 s [time-compat] weekYearWholeStart: OK
  2381. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2382. 656.98 s [time-compat] weekYearMostStart: OK
  2383. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2384. 656.98 s [time-compat] CalendarDiffDays
  2385. 656.98 s [time-compat] add diff
  2386. 656.98 s [time-compat] add diff GregorianDurationClip: OK
  2387. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2388. 656.98 s [time-compat] add diff GregorianDurationRollOver: OK
  2389. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2390. 656.98 s [time-compat] add diff JulianDurationClip: OK
  2391. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2392. 656.98 s [time-compat] add diff JulianDurationRollOver: OK
  2393. 656.98 s [time-compat] +++ OK, passed 100 tests.
  2394. 656.98 s [time-compat] diffs
  2395. 656.98 s [time-compat] 2017-04-07 - 2017-04-07: OK
  2396. 657.06 s [logict:post-build] Uploading to cachix cache "sellout": /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0 /nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc
  2397. 657.56 s [logict:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  2398. 657.56 s [logict:post-build]
  2399. 657.94 s [logict:post-build] Pushing /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0 (2.77 MiB)
  2400. 658.04 s [logict:post-build] Pushing /nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc (815.16 KiB)
  2401. 659.11 s [logict:post-build]
  2402. 659.27 s [logict:post-build] All done.
  2403. 659.27 s [logict:post-build] Uploading to the NixCI cache: /nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0 /nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc
  2404. 659.27 s [logict:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2405. 659.43 s [logict:post-build] copying 2 paths...
  2406. 659.43 s [logict:post-build] copying path '/nix/store/dq2lwgly82dcdbj52zr01km092bz2v61-logict-0.8.2.0-doc' to 'https://cache.nix-ci.com'...
  2407. 659.93 s [logict:post-build] copying path '/nix/store/5zacvbww0pxnax9arvbmvvikygmnykcj-logict-0.8.2.0' to 'https://cache.nix-ci.com'...
  2408. 661.15 s [logict:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2409. 661.42 s [logict:post-build] copying 1 paths...
  2410. 661.42 s [logict:post-build] copying path '/nix/store/n5lzhg4lavycx6d6c9ciar6bppdqn8h4-logict-0.8.2.0.drv' to 'https://cache.nix-ci.com'...
  2411. 661.68 s Progress: 93 of 115 built (4 building), 172 of 172 downloaded from cache
  2412. 661.68 s [time-compat] 2017-04-07 - 2017-04-01: OK
  2413. 661.68 s [time-compat] 2017-04-01 - 2017-04-07: OK
  2414. 661.68 s [time-compat] 2017-04-07 - 2017-02-01: OK
  2415. 661.68 s [time-compat] 2017-02-01 - 2017-04-07: OK
  2416. 661.68 s [time-compat] Clock
  2417. 661.68 s [time-compat] clock conversion
  2418. 661.68 s [time-compat] 1970-01-01 00:00:00 UTC
  2419. 661.68 s [time-compat] systemToUTCTime: OK
  2420. 661.68 s [time-compat] utcToSystemTime: OK
  2421. 661.68 s [time-compat] 1970-01-01 23:59:59 UTC
  2422. 661.68 s [time-compat] systemToUTCTime: OK
  2423. 661.68 s [time-compat] utcToSystemTime: OK
  2424. 661.68 s [time-compat] 1970-01-01 23:59:59.999999999 UTC
  2425. 661.68 s [time-compat] systemToUTCTime: OK
  2426. 661.68 s [time-compat] utcToSystemTime: OK
  2427. 661.68 s [time-compat] 1970-01-01 23:59:60 UTC
  2428. 661.68 s [time-compat] systemToUTCTime: OK
  2429. 661.68 s [time-compat] utcToSystemTime: OK
  2430. 661.68 s [time-compat] 1970-01-01 23:59:60.999999999 UTC
  2431. 661.68 s [time-compat] systemToUTCTime: OK
  2432. 661.68 s [time-compat] utcToSystemTime: OK
  2433. 661.68 s [time-compat] 1970-01-02 00:00:00 UTC
  2434. 661.68 s [time-compat] systemToUTCTime: OK
  2435. 661.68 s [time-compat] utcToSystemTime: OK
  2436. 661.68 s [time-compat] resolution
  2437. 661.68 s [time-compat] getCurrentTime: OK (0.13s)
  2438. 661.68 s [time-compat] taiClock: OK (0.13s)
  2439. 661.68 s [time-compat] leap second transition
  2440. 661.68 s [time-compat] mapping: OK
  2441. 661.68 s [time-compat] day length: OK
  2442. 661.68 s [time-compat] differences: OK
  2443. 661.68 s [time-compat] round-trip
  2444. 661.68 s [time-compat] 1: OK
  2445. 661.68 s [time-compat] 2: OK
  2446. 661.68 s [time-compat] 3: OK
  2447. 661.68 s [time-compat] Format
  2448. 661.68 s [time-compat] testFormat
  2449. 661.68 s [time-compat] DayOfWeek
  2450. 661.68 s [time-compat] 'u'
  2451. 661.68 s [time-compat] 2018-01-05: OK
  2452. 661.68 s [time-compat] 2018-01-06: OK
  2453. 661.68 s [time-compat] 2018-01-07: OK
  2454. 661.68 s [time-compat] 2018-01-08: OK
  2455. 661.68 s [time-compat] 2018-01-09: OK
  2456. 661.68 s [time-compat] 2018-01-10: OK
  2457. 661.68 s [time-compat] 2018-01-11: OK
  2458. 661.68 s [time-compat] 2018-01-12: OK
  2459. 661.68 s [time-compat] 2018-01-13: OK
  2460. 661.68 s [time-compat] 2018-01-14: OK
  2461. 661.68 s [time-compat] 2018-01-15: OK
  2462. 661.68 s [time-compat] 2018-01-16: OK
  2463. 661.68 s [time-compat] 2018-01-17: OK
  2464. 661.68 s [time-compat] 2018-01-18: OK
  2465. 661.68 s [time-compat] 2018-01-19: OK
  2466. 661.68 s [time-compat] 2018-01-20: OK
  2467. 661.68 s [time-compat] 2018-01-21: OK
  2468. 661.68 s [time-compat] 2018-01-22: OK
  2469. 661.68 s [time-compat] 2018-01-23: OK
  2470. 661.68 s [time-compat] 2018-01-24: OK
  2471. 661.73 s Building /nix/store/1pnlycbmvimxlqpzvkl5qm796kb3ljmb-smallcheck-1.2.1.1.drv
  2472. 661.73 s [duoidal-transformers] Phase: checkPhase
  2473. 661.73 s [duoidal-transformers] Running 1 test suites...
  2474. 661.73 s [duoidal-transformers] Test suite doctests: RUNNING...
  2475. 661.73 s [duoidal-transformers]
  2476. 661.73 s [duoidal-transformers] on the commandline: warning:
  2477. 661.73 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2478. 661.73 s [duoidal-transformers]
  2479. 661.73 s [duoidal-transformers] on the commandline: warning:
  2480. 661.73 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2481. 661.73 s [duoidal-transformers]
  2482. 661.73 s [duoidal-transformers] on the commandline: warning:
  2483. 661.73 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  2484. 661.73 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2485. 661.73 s [duoidal-transformers] Test suite doctests: PASS
  2486. 661.73 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  2487. 661.73 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  2488. 661.73 s [duoidal-transformers] Phase: haddockPhase
  2489. 661.73 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  2490. 661.73 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  2491. 661.73 s [duoidal-transformers] 33% ( 1 / 3) in 'Control.Duoidal.Trans.Class'
  2492. 661.73 s [duoidal-transformers] Missing documentation for:
  2493. 661.73 s [duoidal-transformers] DuoidalTrans (src/Control/Duoidal/Trans/Class.hs:18)
  2494. 661.73 s [duoidal-transformers] NormalTrans (src/Control/Duoidal/Trans/Class.hs:22)
  2495. 661.73 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  2496. 661.73 s [hedgehog] Phase: setupCompilerEnvironmentPhase
  2497. 661.73 s [hedgehog] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  2498. 661.73 s [hedgehog] Phase: unpackPhase
  2499. 661.73 s [hedgehog] unpacking source archive /nix/store/y6x6mm5qz6s835g6w7sj382w8cidq00s-hedgehog-1.5.tar.gz
  2500. 661.73 s [hedgehog] source root is hedgehog-1.5
  2501. 661.73 s [hedgehog] setting SOURCE_DATE_EPOCH to timestamp 1721821132 of file "hedgehog-1.5/CHANGELOG.md"
  2502. 661.73 s [hedgehog] Phase: patchPhase
  2503. 661.73 s [hedgehog] Replace Cabal file with edited version from mirror://hackage/hedgehog-1.5/revision/2.cabal.
  2504. 661.73 s [hedgehog] Phase: compileBuildDriverPhase
  2505. 661.73 s [hedgehog] setupCompileFlags: -package-db=/build/tmp.vYxnFywBqg/setup-package.conf.d -threaded
  2506. 661.73 s [hedgehog] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.vYxnFywBqg/Main.o )
  2507. 661.73 s [hedgehog] [2 of 2] Linking Setup
  2508. 661.73 s [hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  2509. 661.73 s [hedgehog] Phase: configurePhase
  2510. 661.73 s [hedgehog] configureFlags: --verbose --prefix=/nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc/share/doc/hedgehog-1.5 --with-gcc=gcc --package-db=/build/tmp.vYxnFywBqg/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  2511. 661.73 s [hedgehog] Using Parsec parser
  2512. 661.73 s [hedgehog] Configuring hedgehog-1.5...
  2513. 661.73 s [hedgehog] Dependency ansi-terminal >=0.6 && <1.2: using ansi-terminal-1.1.2
  2514. 661.73 s [hedgehog] Dependency async >=2.0 && <2.3: using async-2.2.5
  2515. 661.73 s [hedgehog] Dependency barbies >=1.0 && <2.2: using barbies-2.1.1.0
  2516. 661.73 s [hedgehog] Dependency base >=4.9 && <5: using base-4.18.1.0
  2517. 661.73 s [hedgehog] Dependency bytestring >=0.10 && <0.13: using bytestring-0.11.5.2
  2518. 661.73 s [hedgehog] Dependency concurrent-output >=1.7 && <1.11: using concurrent-output-1.10.21
  2519. 661.73 s [hedgehog] Dependency containers >=0.4 && <0.9: using containers-0.6.7
  2520. 661.73 s [hedgehog] Dependency deepseq >=1.1.0.0 && <1.6: using deepseq-1.4.8.1
  2521. 661.73 s [hedgehog] Dependency directory >=1.2 && <1.4: using directory-1.3.8.1
  2522. 661.73 s [hedgehog] Dependency erf >=2.0 && <2.1: using erf-2.0.0.0
  2523. 661.73 s [hedgehog] Dependency exceptions >=0.7 && <0.11: using exceptions-0.10.7
  2524. 661.73 s [hedgehog] Dependency lifted-async >=0.7 && <0.11: using lifted-async-0.10.2.7
  2525. 661.73 s [hedgehog] Dependency mmorph >=1.0 && <1.3: using mmorph-1.2.0
  2526. 661.73 s [hedgehog] Dependency monad-control >=1.0 && <1.1: using monad-control-1.0.3.1
  2527. 661.73 s [hedgehog] Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
  2528. 661.73 s [hedgehog] Dependency pretty-show >=1.6 && <1.11: using pretty-show-1.10
  2529. 661.73 s [hedgehog] Dependency primitive >=0.6 && <0.10: using primitive-0.9.1.0
  2530. 661.73 s [hedgehog] Dependency random >=1.1 && <1.4: using random-1.2.1.3
  2531. 661.73 s [hedgehog] Dependency resourcet >=1.1 && <1.4: using resourcet-1.3.0
  2532. 661.73 s [hedgehog] Dependency safe-exceptions >=0.1 && <0.2: using safe-exceptions-0.1.7.4
  2533. 661.73 s [hedgehog] Dependency stm >=2.4 && <2.6: using stm-2.5.1.0
  2534. 661.73 s [hedgehog] Dependency template-haskell >=2.10 && <2.24: using template-haskell-2.20.0.0
  2535. 661.73 s [hedgehog] Dependency text >=1.1 && <2.2: using text-2.0.2
  2536. 661.73 s [hedgehog] Dependency time >=1.4 && <1.15: using time-1.12.2
  2537. 661.73 s [hedgehog] Dependency transformers >=0.5 && <0.7: using transformers-0.6.1.0
  2538. 661.73 s [hedgehog] Dependency transformers-base >=0.4.5.1 && <0.5: using transformers-base-0.4.6
  2539. 661.73 s [hedgehog] Dependency wl-pprint-annotated >=0.0 && <0.2: using
  2540. 661.73 s [hedgehog] wl-pprint-annotated-0.1.0.1
  2541. 661.73 s [hedgehog] Dependency base >=3 && <5: using base-4.18.1.0
  2542. 661.73 s [hedgehog] Dependency containers >=0.4 && <0.9: using containers-0.6.7
  2543. 661.73 s [hedgehog] Dependency hedgehog: using hedgehog-1.5
  2544. 661.73 s [time-compat] 2018-01-25: OK
  2545. 661.73 s [time-compat] 2018-01-26: OK
  2546. 661.73 s [time-compat] 'w'
  2547. 661.73 s [time-compat] 2018-01-05: OK
  2548. 661.73 s [time-compat] 2018-01-06: OK
  2549. 661.73 s [time-compat] 2018-01-07: OK
  2550. 661.73 s [time-compat] 2018-01-08: OK
  2551. 661.73 s [time-compat] 2018-01-09: OK
  2552. 661.73 s [time-compat] 2018-01-10: OK
  2553. 661.73 s [time-compat] 2018-01-11: OK
  2554. 661.73 s [time-compat] 2018-01-12: OK
  2555. 661.73 s [time-compat] 2018-01-13: OK
  2556. 661.73 s [time-compat] 2018-01-14: OK
  2557. 661.73 s [time-compat] 2018-01-15: OK
  2558. 661.73 s [time-compat] 2018-01-16: OK
  2559. 661.73 s [time-compat] 2018-01-17: OK
  2560. 661.73 s [time-compat] 2018-01-18: OK
  2561. 661.73 s [time-compat] 2018-01-19: OK
  2562. 661.73 s [time-compat] 2018-01-20: OK
  2563. 661.73 s [time-compat] 2018-01-21: OK
  2564. 661.73 s [time-compat] 2018-01-22: OK
  2565. 661.73 s [time-compat] 2018-01-23: OK
  2566. 661.73 s [time-compat] 2018-01-24: OK
  2567. 661.73 s [time-compat] 2018-01-25: OK
  2568. 661.73 s [time-compat] 2018-01-26: OK
  2569. 661.73 s [time-compat] 'a'
  2570. 661.73 s [time-compat] 2018-01-05: OK
  2571. 661.73 s [time-compat] 2018-01-06: OK
  2572. 661.73 s [time-compat] 2018-01-07: OK
  2573. 661.73 s [time-compat] 2018-01-08: OK
  2574. 661.73 s [time-compat] 2018-01-09: OK
  2575. 661.73 s [time-compat] 2018-01-10: OK
  2576. 661.73 s [time-compat] 2018-01-11: OK
  2577. 661.73 s [time-compat] 2018-01-12: OK
  2578. 661.73 s [time-compat] 2018-01-13: OK
  2579. 661.73 s [time-compat] 2018-01-14: OK
  2580. 661.73 s [time-compat] 2018-01-15: OK
  2581. 661.73 s [time-compat] 2018-01-16: OK
  2582. 661.73 s [time-compat] 2018-01-17: OK
  2583. 661.73 s [time-compat] 2018-01-18: OK
  2584. 661.73 s [time-compat] 2018-01-19: OK
  2585. 661.73 s [time-compat] 2018-01-20: OK
  2586. 661.73 s [time-compat] 2018-01-21: OK
  2587. 661.73 s [time-compat] 2018-01-22: OK
  2588. 661.74 s [time-compat] 2018-01-23: OK
  2589. 661.74 s [time-compat] 2018-01-24: OK
  2590. 661.74 s [time-compat] 2018-01-25: OK
  2591. 661.74 s [time-compat] 2018-01-26: OK
  2592. 661.74 s [time-compat] 'A'
  2593. 661.74 s [time-compat] 2018-01-05: OK
  2594. 661.74 s [time-compat] 2018-01-06: OK
  2595. 661.74 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 )
  2596. 661.74 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 )
  2597. 661.74 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 )
  2598. 661.74 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 )
  2599. 661.74 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 )
  2600. 661.74 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 )
  2601. 661.74 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 )
  2602. 661.74 s [hedgehog] Dependency mmorph >=1.0 && <1.3: using mmorph-1.2.0
  2603. 661.74 s [hedgehog] Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
  2604. 661.74 s [hedgehog] Dependency pretty-show >=1.6 && <1.11: using pretty-show-1.10
  2605. 661.74 s [hedgehog] Dependency text >=1.1 && <2.2: using text-2.0.2
  2606. 661.74 s [hedgehog] Dependency transformers >=0.3 && <0.7: using transformers-0.6.1.0
  2607. 661.74 s [hedgehog] Source component graph:
  2608. 661.74 s [hedgehog] component lib
  2609. 661.74 s [hedgehog] component test:test dependency lib
  2610. 661.74 s [hedgehog] Configured component graph:
  2611. 661.74 s [hedgehog] component hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2612. 661.74 s [hedgehog] include ansi-terminal-1.1.2-8ILE2aUwQMrAKZvScdfvlf
  2613. 661.74 s [hedgehog] include async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  2614. 661.74 s [hedgehog] include barbies-2.1.1.0-LAG4VKmOInN4A2PiG3POxA
  2615. 661.74 s [hedgehog] include base-4.18.1.0
  2616. 661.74 s [hedgehog] include bytestring-0.11.5.2
  2617. 661.74 s [hedgehog] include concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb
  2618. 661.74 s [hedgehog] include containers-0.6.7
  2619. 661.74 s [hedgehog] include deepseq-1.4.8.1
  2620. 661.74 s [hedgehog] include directory-1.3.8.1
  2621. 661.74 s [hedgehog] include erf-2.0.0.0-CvQu7DcZTR92ZYZfdVMV4v
  2622. 661.74 s [hedgehog] include exceptions-0.10.7
  2623. 661.74 s [hedgehog] include lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI
  2624. 661.74 s [hedgehog] include mmorph-1.2.0-7q8EyX77gcXFnfJAyb0wZF
  2625. 661.74 s [hedgehog] include monad-control-1.0.3.1-2IsJNI7knS73USTyyqyQ0F
  2626. 661.74 s [hedgehog] include mtl-2.3.1
  2627. 661.74 s [hedgehog] include pretty-show-1.10-8B4Pe9xwsex8t6kOjzWq0M
  2628. 661.74 s [hedgehog] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  2629. 661.74 s [hedgehog] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  2630. 661.74 s [hedgehog] include resourcet-1.3.0-KwCMgt45SP76XTKbi4lzfa
  2631. 661.74 s [hedgehog] include safe-exceptions-0.1.7.4-CgY5Pd5sAEwGDXgDeAVvhC
  2632. 661.74 s [hedgehog] include stm-2.5.1.0
  2633. 661.74 s [hedgehog] include template-haskell-2.20.0.0
  2634. 661.74 s [hedgehog] include text-2.0.2
  2635. 661.74 s [hedgehog] include time-1.12.2
  2636. 661.74 s [hedgehog] include transformers-0.6.1.0
  2637. 661.74 s [hedgehog] include transformers-base-0.4.6-B9tbHsqjT7AMa9jIl8ea0
  2638. 661.74 s [hedgehog] include wl-pprint-annotated-0.1.0.1-Eo4WTvXSOR0FSKT0PPKs2r
  2639. 661.74 s [hedgehog] component hedgehog-1.5-2J9CTesViPw4LHjQCDsCLK-test
  2640. 661.74 s [hedgehog] include base-4.18.1.0
  2641. 661.74 s [hedgehog] include containers-0.6.7
  2642. 661.74 s [hedgehog] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2643. 661.74 s [hedgehog] include mmorph-1.2.0-7q8EyX77gcXFnfJAyb0wZF
  2644. 661.74 s [hedgehog] include mtl-2.3.1
  2645. 661.74 s [hedgehog] include pretty-show-1.10-8B4Pe9xwsex8t6kOjzWq0M
  2646. 661.74 s [hedgehog] include text-2.0.2
  2647. 661.74 s [hedgehog] include transformers-0.6.1.0
  2648. 661.74 s [hedgehog] Linked component graph:
  2649. 661.74 s [hedgehog] unit hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2650. 661.74 s [hedgehog] include ansi-terminal-1.1.2-8ILE2aUwQMrAKZvScdfvlf
  2651. 661.74 s [hedgehog] include async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  2652. 661.74 s [hedgehog] include barbies-2.1.1.0-LAG4VKmOInN4A2PiG3POxA
  2653. 661.74 s [hedgehog] include base-4.18.1.0
  2654. 661.74 s [hedgehog] include bytestring-0.11.5.2
  2655. 661.74 s [hedgehog] include concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb
  2656. 661.74 s [hedgehog] include containers-0.6.7
  2657. 661.74 s [hedgehog] include deepseq-1.4.8.1
  2658. 661.74 s [hedgehog] include directory-1.3.8.1
  2659. 661.74 s [hedgehog] include erf-2.0.0.0-CvQu7DcZTR92ZYZfdVMV4v
  2660. 661.74 s [hedgehog] include exceptions-0.10.7
  2661. 661.74 s [hedgehog] include lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI
  2662. 661.74 s [hedgehog] include mmorph-1.2.0-7q8EyX77gcXFnfJAyb0wZF
  2663. 661.74 s [hedgehog] include monad-control-1.0.3.1-2IsJNI7knS73USTyyqyQ0F
  2664. 661.74 s [hedgehog] include mtl-2.3.1
  2665. 661.74 s [hedgehog] include pretty-show-1.10-8B4Pe9xwsex8t6kOjzWq0M
  2666. 661.74 s [hedgehog] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  2667. 661.74 s [hedgehog] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  2668. 661.74 s [hedgehog] include resourcet-1.3.0-KwCMgt45SP76XTKbi4lzfa
  2669. 661.74 s [hedgehog] include safe-exceptions-0.1.7.4-CgY5Pd5sAEwGDXgDeAVvhC
  2670. 661.74 s [hedgehog] include stm-2.5.1.0
  2671. 661.74 s [hedgehog] include template-haskell-2.20.0.0
  2672. 661.74 s [hedgehog] include text-2.0.2
  2673. 661.74 s [hedgehog] include time-1.12.2
  2674. 661.74 s [hedgehog] include transformers-0.6.1.0
  2675. 661.74 s [hedgehog] include transformers-base-0.4.6-B9tbHsqjT7AMa9jIl8ea0
  2676. 661.74 s [hedgehog] include wl-pprint-annotated-0.1.0.1-Eo4WTvXSOR0FSKT0PPKs2r
  2677. 661.74 s [time-compat] 2018-01-07: OK
  2678. 661.74 s [time-compat] 2018-01-08: OK
  2679. 661.74 s [time-compat] 2018-01-09: OK
  2680. 661.74 s [time-compat] 2018-01-10: OK
  2681. 661.74 s [time-compat] 2018-01-11: OK
  2682. 661.74 s [time-compat] 2018-01-12: OK
  2683. 661.74 s [time-compat] 2018-01-13: OK
  2684. 661.74 s [time-compat] 2018-01-14: OK
  2685. 661.74 s [time-compat] 2018-01-15: OK
  2686. 661.74 s [time-compat] 2018-01-16: OK
  2687. 661.74 s [time-compat] 2018-01-17: OK
  2688. 661.74 s [time-compat] 2018-01-18: OK
  2689. 661.74 s [time-compat] 2018-01-19: OK
  2690. 661.74 s [time-compat] 2018-01-20: OK
  2691. 661.74 s [time-compat] 2018-01-21: OK
  2692. 661.74 s [time-compat] 2018-01-22: OK
  2693. 661.74 s [time-compat] 2018-01-23: OK
  2694. 661.74 s [time-compat] 2018-01-24: OK
  2695. 661.74 s [time-compat] 2018-01-25: OK
  2696. 661.74 s [time-compat] 2018-01-26: OK
  2697. 661.74 s [time-compat] ISO8601
  2698. 661.74 s [time-compat] show format
  2699. 661.74 s [time-compat] durationDaysFormat: P0D: OK
  2700. 661.74 s [time-compat] durationDaysFormat: P4Y: OK
  2701. 661.74 s [time-compat] durationDaysFormat: P7M: OK
  2702. 661.74 s [time-compat] durationDaysFormat: P5D: OK
  2703. 661.74 s [time-compat] durationDaysFormat: P2Y3M81D: OK
  2704. 661.74 s [time-compat] durationTimeFormat: P0D: OK
  2705. 661.74 s [time-compat] durationTimeFormat: P4Y: OK
  2706. 661.74 s [time-compat] durationTimeFormat: P7M: OK
  2707. 661.74 s [time-compat] durationTimeFormat: P5D: OK
  2708. 661.74 s [time-compat] durationTimeFormat: P2Y3M81D: OK
  2709. 661.74 s [time-compat] durationTimeFormat: PT2H: OK
  2710. 661.74 s [time-compat] durationTimeFormat: PT3M: OK
  2711. 661.74 s [time-compat] durationTimeFormat: PT12S: OK
  2712. 661.74 s [time-compat] durationTimeFormat: PT1M18.77634S: OK
  2713. 661.74 s [time-compat] durationTimeFormat: PT2H1M18.77634S: OK
  2714. 661.74 s [time-compat] durationTimeFormat: P5DT2H1M18.77634S: OK
  2715. 661.74 s [time-compat] durationTimeFormat: P7Y10M5DT2H1M18.77634S: OK
  2716. 661.74 s [time-compat] durationTimeFormat: P7Y10MT2H1M18.77634S: OK
  2717. 661.74 s [time-compat] durationTimeFormat: P8YT2H1M18.77634S: OK
  2718. 661.74 s [time-compat] alternativeDurationDaysFormat: P0001-00-00: OK
  2719. 661.74 s [time-compat] alternativeDurationDaysFormat: P0002-03-29: OK
  2720. 661.74 s [time-compat] alternativeDurationDaysFormat: P0561-08-29: OK
  2721. 661.74 s [time-compat] alternativeDurationTimeFormat: P0000-00-01T00:00:00: OK
  2722. 661.74 s [time-compat] alternativeDurationTimeFormat: P0007-10-05T02:01:18.77634: OK
  2723. 661.74 s [time-compat] alternativeDurationTimeFormat: P4271-10-05T02:01:18.77634: OK
  2724. 661.74 s [time-compat] centuryFormat: 02: OK
  2725. 661.74 s [time-compat] centuryFormat: 21: OK
  2726. 661.74 s [time-compat] intervalFormat etc.: 2015-06-13T21:13:56/P1Y2M7DT5H33M2.34S: OK
  2727. 661.74 s [hedgehog] Hedgehog=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog,Hedgehog.Gen=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Gen,Hedgehog.Internal.Barbie=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Barbie,Hedgehog.Internal.Config=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Config,Hedgehog.Internal.Discovery=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Discovery,Hedgehog.Internal.Distributive=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Distributive,Hedgehog.Internal.Exception=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Exception,Hedgehog.Internal.Gen=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Gen,Hedgehog.Internal.HTraversable=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.HTraversable,Hedgehog.Internal.Opaque=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Opaque,Hedgehog.Internal.Prelude=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Prelude,Hedgehog.Internal.Property=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Property,Hedgehog.Internal.Queue=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Queue,Hedgehog.Internal.Range=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Range,Hedgehog.Internal.Region=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Region,Hedgehog.Internal.Report=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Report,Hedgehog.Internal.Runner=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Runner,Hedgehog.Internal.Seed=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Seed,Hedgehog.Internal.Show=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Show,Hedgehog.Internal.Shrink=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Shrink,Hedgehog.Internal.Source=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Source,Hedgehog.Internal.State=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.State,Hedgehog.Internal.TH=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.TH,Hedgehog.Internal.Tree=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Tree,Hedgehog.Internal.Tripping=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Internal.Tripping,Hedgehog.Main=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Main,Hedgehog.Range=hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp:Hedgehog.Range
  2728. 661.74 s [hedgehog] unit hedgehog-1.5-2J9CTesViPw4LHjQCDsCLK-test
  2729. 661.74 s [hedgehog] include base-4.18.1.0
  2730. 661.74 s [hedgehog] include containers-0.6.7
  2731. 661.74 s [hedgehog] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2732. 661.74 s [hedgehog] include mmorph-1.2.0-7q8EyX77gcXFnfJAyb0wZF
  2733. 661.74 s [hedgehog] include mtl-2.3.1
  2734. 661.74 s [hedgehog] include pretty-show-1.10-8B4Pe9xwsex8t6kOjzWq0M
  2735. 661.74 s [hedgehog] include text-2.0.2
  2736. 661.74 s [hedgehog] include transformers-0.6.1.0
  2737. 661.74 s [hedgehog] Ready component graph:
  2738. 661.74 s [hedgehog] definite hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2739. 661.74 s [hedgehog] depends ansi-terminal-1.1.2-8ILE2aUwQMrAKZvScdfvlf
  2740. 661.74 s [hedgehog] depends async-2.2.5-FXUcVAC32Pt4FiCqIp4LhF
  2741. 661.74 s [hedgehog] depends barbies-2.1.1.0-LAG4VKmOInN4A2PiG3POxA
  2742. 661.74 s [hedgehog] depends base-4.18.1.0
  2743. 661.74 s [hedgehog] depends bytestring-0.11.5.2
  2744. 661.74 s [hedgehog] depends concurrent-output-1.10.21-293unbhZcKzL0ZbDvawiyb
  2745. 661.74 s [hedgehog] depends containers-0.6.7
  2746. 661.74 s [hedgehog] depends deepseq-1.4.8.1
  2747. 661.74 s [hedgehog] depends directory-1.3.8.1
  2748. 661.74 s [hedgehog] depends erf-2.0.0.0-CvQu7DcZTR92ZYZfdVMV4v
  2749. 661.74 s [hedgehog] depends exceptions-0.10.7
  2750. 661.74 s [hedgehog] depends lifted-async-0.10.2.7-9IFlHKnSvMp9QwtbTSmHZI
  2751. 661.74 s [hedgehog] depends mmorph-1.2.0-7q8EyX77gcXFnfJAyb0wZF
  2752. 661.74 s [hedgehog] depends monad-control-1.0.3.1-2IsJNI7knS73USTyyqyQ0F
  2753. 661.74 s [hedgehog] depends mtl-2.3.1
  2754. 661.74 s [hedgehog] depends pretty-show-1.10-8B4Pe9xwsex8t6kOjzWq0M
  2755. 661.74 s [hedgehog] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  2756. 661.74 s [hedgehog] depends random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  2757. 661.74 s [hedgehog] depends resourcet-1.3.0-KwCMgt45SP76XTKbi4lzfa
  2758. 661.74 s [hedgehog] depends safe-exceptions-0.1.7.4-CgY5Pd5sAEwGDXgDeAVvhC
  2759. 661.74 s [hedgehog] depends stm-2.5.1.0
  2760. 661.74 s [hedgehog] depends template-haskell-2.20.0.0
  2761. 661.74 s [hedgehog] depends text-2.0.2
  2762. 661.74 s [hedgehog] depends time-1.12.2
  2763. 661.74 s [hedgehog] depends transformers-0.6.1.0
  2764. 661.74 s [hedgehog] depends transformers-base-0.4.6-B9tbHsqjT7AMa9jIl8ea0
  2765. 661.74 s [hedgehog] depends wl-pprint-annotated-0.1.0.1-Eo4WTvXSOR0FSKT0PPKs2r
  2766. 661.74 s [hedgehog] definite hedgehog-1.5-2J9CTesViPw4LHjQCDsCLK-test
  2767. 661.74 s [hedgehog] depends base-4.18.1.0
  2768. 661.74 s [hedgehog] depends containers-0.6.7
  2769. 661.74 s [hedgehog] depends hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2770. 661.74 s [hedgehog] depends mmorph-1.2.0-7q8EyX77gcXFnfJAyb0wZF
  2771. 661.74 s [hedgehog] depends mtl-2.3.1
  2772. 661.74 s [hedgehog] depends pretty-show-1.10-8B4Pe9xwsex8t6kOjzWq0M
  2773. 661.74 s [hedgehog] depends text-2.0.2
  2774. 661.74 s [hedgehog] depends transformers-0.6.1.0
  2775. 661.74 s [hedgehog] Using Cabal-3.10.1.0 compiled by ghc-9.6
  2776. 661.74 s [hedgehog] Using compiler: ghc-9.6.3
  2777. 661.74 s [hedgehog] Using install prefix: /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5
  2778. 661.74 s [hedgehog] Executables installed in:
  2779. 661.74 s [hedgehog] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/bin
  2780. 661.74 s [hedgehog] Libraries installed in:
  2781. 661.74 s [hedgehog] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2782. 661.74 s [hedgehog] Dynamic Libraries installed in:
  2783. 661.74 s [time-compat] recurringIntervalFormat etc.: R74/2015-06-13T21:13:56/P1Y2M7DT5H33M2.34S: OK
  2784. 661.74 s [time-compat] recurringIntervalFormat etc.: R74/2015-06-13/P1Y2M7D: OK
  2785. 661.74 s [time-compat] timeOffsetFormat: -06:30: OK
  2786. 661.74 s [time-compat] timeOffsetFormat: +00:00: OK
  2787. 661.74 s [time-compat] timeOffsetFormat: +0000: OK
  2788. 661.74 s [time-compat] timeOffsetFormat: +00:10: OK
  2789. 661.74 s [time-compat] timeOffsetFormat: -00:10: OK
  2790. 661.74 s [time-compat] timeOffsetFormat: +01:35: OK
  2791. 661.74 s [time-compat] timeOffsetFormat: -01:35: OK
  2792. 661.74 s [time-compat] timeOffsetFormat: +0135: OK
  2793. 661.74 s [time-compat] timeOffsetFormat: -0135: OK
  2794. 661.74 s [time-compat] timeOffsetFormat: -1100: OK
  2795. 661.74 s [time-compat] timeOffsetFormat: +1015: OK
  2796. 661.74 s [time-compat] zonedTimeFormat: 2024-07-06T08:45:56.553-06:30: OK
  2797. 661.74 s [time-compat] zonedTimeFormat: 2024-07-06T08:45:56.553+06:30: OK
  2798. 661.74 s [time-compat] utcTimeFormat: 2024-07-06T08:45:56.553Z: OK
  2799. 661.74 s [time-compat] utcTimeFormat: 2028-12-31T23:59:60.9Z: OK
  2800. 661.74 s [time-compat] weekDateFormat: 1994-W52-7: OK
  2801. 661.74 s [time-compat] weekDateFormat: 1995-W01-1: OK
  2802. 661.74 s [time-compat] weekDateFormat: 1996-W52-7: OK
  2803. 661.74 s [time-compat] weekDateFormat: 1997-W01-2: OK
  2804. 661.74 s [time-compat] weekDateFormat: 1997-W01-3: OK
  2805. 661.74 s [time-compat] weekDateFormat: 1974-W32-6: OK
  2806. 661.74 s [time-compat] weekDateFormat: 1974W326: OK
  2807. 661.74 s [time-compat] weekDateFormat: 1995-W05-6: OK
  2808. 661.74 s [time-compat] weekDateFormat: 1995W056: OK
  2809. 661.74 s [time-compat] weekDateFormat: +001995-W05-6: OK
  2810. 661.74 s [time-compat] weekDateFormat: +001995W056: OK
  2811. 661.74 s [time-compat] ordinalDateFormat: 1846-235: OK
  2812. 661.74 s [time-compat] ordinalDateFormat: 1844236: OK
  2813. 661.74 s [time-compat] ordinalDateFormat: +01846-235: OK
  2814. 661.74 s [time-compat] hourMinuteFormat: 13:17.25: OK
  2815. 661.74 s [time-compat] hourMinuteFormat: 01:12.4: OK
  2816. 661.74 s [time-compat] hourMinuteFormat: 1317.25: OK
  2817. 661.74 s [time-compat] hourMinuteFormat: 0112.4: OK
  2818. 661.74 s [time-compat] hourFormat: 22: OK
  2819. 661.74 s [time-compat] hourFormat: 06: OK
  2820. 661.74 s [time-compat] hourFormat: 18.9475: OK
  2821. 661.74 s [time-compat] read-show format
  2822. 661.74 s [time-compat] calendarFormat
  2823. 661.74 s [time-compat] extended: OK
  2824. 661.74 s [time-compat] +++ OK, passed 100 tests.
  2825. 661.74 s [time-compat] basic: OK
  2826. 661.74 s [time-compat] +++ OK, passed 100 tests.
  2827. 661.74 s [time-compat] yearMonthFormat: OK
  2828. 661.74 s [time-compat] +++ OK, passed 100 tests; 88 discarded.
  2829. 661.74 s [time-compat] yearFormat: OK
  2830. 661.74 s [time-compat] +++ OK, passed 100 tests.
  2831. 661.74 s [time-compat] centuryFormat: OK
  2832. 661.74 s [time-compat] +++ OK, passed 100 tests.
  2833. 661.74 s [time-compat] expandedCalendarFormat
  2834. 661.74 s [time-compat] extended: OK
  2835. 661.74 s [time-compat] +++ OK, passed 100 tests.
  2836. 661.74 s [hedgehog] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  2837. 661.74 s [hedgehog] Private executables installed in:
  2838. 661.74 s [hedgehog] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/libexec/x86_64-linux-ghc-9.6.3/hedgehog-1.5
  2839. 661.74 s [hedgehog] Data files installed in:
  2840. 661.74 s [hedgehog] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/share/x86_64-linux-ghc-9.6.3/hedgehog-1.5
  2841. 661.74 s [hedgehog] Documentation installed in:
  2842. 661.74 s [hedgehog] /nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc/share/doc/hedgehog-1.5
  2843. 661.74 s [hedgehog] Configuration files installed in:
  2844. 661.74 s [hedgehog] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/etc
  2845. 661.74 s [hedgehog] No alex found
  2846. 661.74 s [hedgehog] Using ar found on system at:
  2847. 661.74 s [hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  2848. 661.74 s [hedgehog] No c2hs found
  2849. 661.75 s [hedgehog] No cpphs found
  2850. 661.75 s [hedgehog] No doctest found
  2851. 661.75 s [hedgehog] Using gcc version 14.3.0 given by user at:
  2852. 661.75 s [hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  2853. 661.75 s [hedgehog] Using ghc version 9.6.3 found on system at:
  2854. 661.75 s [hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  2855. 661.75 s [hedgehog] Using ghc-pkg version 9.6.3 found on system at:
  2856. 661.75 s [hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  2857. 661.75 s [hedgehog] No ghcjs found
  2858. 661.75 s [hedgehog] No ghcjs-pkg found
  2859. 661.75 s [hedgehog] No greencard found
  2860. 661.75 s [hedgehog] Using haddock version 2.29.1 found on system at:
  2861. 661.75 s [hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  2862. 661.75 s [hedgehog] No happy found
  2863. 661.75 s [hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  2864. 661.75 s [hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2865. 661.75 s [hedgehog] No hmake found
  2866. 661.75 s [hedgehog] Using hpc version 0.68 found on system at:
  2867. 661.75 s [hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  2868. 661.75 s [hedgehog] Using hsc2hs version 0.68.9 found on system at:
  2869. 661.75 s [hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  2870. 661.75 s [hedgehog] Using hscolour version 1.25 found on system at:
  2871. 661.75 s [hedgehog] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  2872. 661.75 s [hedgehog] No jhc found
  2873. 661.75 s [hedgehog] Using ld found on system at:
  2874. 661.75 s [hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  2875. 661.75 s [hedgehog] No pkg-config found
  2876. 661.75 s [hedgehog] Using runghc version 9.6.3 found on system at:
  2877. 661.75 s [hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  2878. 661.75 s [hedgehog] Using strip version 2.44 found on system at:
  2879. 661.75 s [hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  2880. 661.75 s [hedgehog] Using tar found on system at:
  2881. 661.75 s [hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  2882. 661.75 s [hedgehog] No uhc found
  2883. 661.75 s [time-compat] basic: OK
  2884. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2885. 661.75 s [time-compat] expandedYearMonthFormat: OK
  2886. 661.75 s [time-compat] +++ OK, passed 100 tests; 77 discarded.
  2887. 661.75 s [time-compat] expandedYearFormat: OK
  2888. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2889. 661.75 s [time-compat] expandedCenturyFormat: OK
  2890. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2891. 661.75 s [time-compat] ordinalDateFormat
  2892. 661.75 s [time-compat] extended: OK
  2893. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2894. 661.75 s [time-compat] basic: OK
  2895. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2896. 661.75 s [time-compat] expandedOrdinalDateFormat
  2897. 661.75 s [time-compat] extended: OK
  2898. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2899. 661.75 s [time-compat] basic: OK
  2900. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2901. 661.75 s [time-compat] weekDateFormat
  2902. 661.75 s [time-compat] extended: OK
  2903. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2904. 661.75 s [time-compat] basic: OK
  2905. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2906. 661.75 s [time-compat] yearWeekFormat
  2907. 661.75 s [time-compat] extended: OK
  2908. 661.75 s [time-compat] +++ OK, passed 100 tests; 116 discarded.
  2909. 661.75 s [time-compat] basic: OK
  2910. 661.75 s [time-compat] +++ OK, passed 100 tests; 109 discarded.
  2911. 661.75 s [time-compat] expandedWeekDateFormat
  2912. 661.75 s [time-compat] extended: OK
  2913. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2914. 661.75 s [time-compat] basic: OK
  2915. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2916. 661.75 s [time-compat] expandedYearWeekFormat
  2917. 661.75 s [time-compat] extended: OK
  2918. 661.75 s [time-compat] +++ OK, passed 100 tests; 91 discarded.
  2919. 661.75 s [time-compat] basic: OK
  2920. 661.75 s [time-compat] +++ OK, passed 100 tests; 84 discarded.
  2921. 661.75 s [time-compat] timeOfDayFormat
  2922. 661.75 s [time-compat] extended: OK
  2923. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2924. 661.75 s [time-compat] basic: OK
  2925. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2926. 661.75 s [time-compat] withTimeDesignator
  2927. 661.75 s [time-compat] extended: OK
  2928. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2929. 661.75 s [time-compat] basic: OK
  2930. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2931. 661.75 s [time-compat] withUTCDesignator
  2932. 661.75 s [time-compat] extended: OK
  2933. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2934. 661.75 s [time-compat] basic: OK
  2935. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2936. 661.75 s [time-compat] timeOffsetFormat
  2937. 661.75 s [time-compat] extended: OK
  2938. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2939. 661.75 s [time-compat] basic: OK
  2940. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2941. 661.75 s [time-compat] timeOfDayAndOffsetFormat
  2942. 661.75 s [time-compat] extended: OK
  2943. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2944. 661.75 s [time-compat] basic: OK
  2945. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2946. 661.75 s [time-compat] localTimeFormat
  2947. 661.75 s [time-compat] extended: OK
  2948. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2949. 661.75 s [time-compat] basic: OK
  2950. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2951. 661.75 s [time-compat] zonedTimeFormat
  2952. 661.75 s [time-compat] extended: OK
  2953. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2954. 661.75 s [time-compat] basic: OK
  2955. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2956. 661.75 s [time-compat] utcTimeFormat
  2957. 661.75 s [time-compat] extended: OK
  2958. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2959. 661.75 s [time-compat] basic: OK
  2960. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2961. 661.75 s [time-compat] dayAndTimeFormat
  2962. 661.75 s [time-compat] extended: OK
  2963. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2964. 661.75 s [time-compat] basic: OK
  2965. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2966. 661.75 s [time-compat] timeAndOffsetFormat
  2967. 661.75 s [time-compat] extended: OK
  2968. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2969. 661.75 s [time-compat] basic: OK
  2970. 661.75 s [time-compat] +++ OK, passed 100 tests.
  2971. 661.75 s [time-compat] durationDaysFormat: OK
  2972. 661.75 s [time-compat] +++ OK, passed 100 tests; 257 discarded.
  2973. 661.75 s [time-compat] durationTimeFormat: OK
  2974. 661.75 s [time-compat] +++ OK, passed 100 tests; 271 discarded.
  2975. 661.75 s [time-compat] alternativeDurationDaysFormat
  2976. 661.75 s [time-compat] extended: OK
  2977. 661.75 s [time-compat] +++ OK, passed 100 tests; 421 discarded.
  2978. 661.75 s [time-compat] basic: OK
  2979. 661.75 s [time-compat] +++ OK, passed 100 tests; 478 discarded.
  2980. 661.75 s [time-compat] alternativeDurationTimeFormat
  2981. 661.75 s [time-compat] extended: OK
  2982. 661.75 s [time-compat] +++ OK, passed 100 tests; 393 discarded.
  2983. 661.75 s [time-compat] basic: OK
  2984. 661.75 s [time-compat] +++ OK, passed 100 tests; 439 discarded.
  2985. 661.75 s [time-compat] intervalFormat
  2986. 661.75 s [time-compat] extended: OK
  2987. 661.75 s [time-compat] +++ OK, passed 100 tests; 285 discarded.
  2988. 661.75 s [time-compat] basic: OK
  2989. 661.75 s [time-compat] +++ OK, passed 100 tests; 326 discarded.
  2990. 661.75 s [time-compat] recurringIntervalFormat
  2991. 661.75 s [time-compat] extended: OK
  2992. 661.75 s [time-compat] +++ OK, passed 100 tests; 598 discarded.
  2993. 661.75 s [time-compat] basic: OK
  2994. 661.75 s [time-compat] +++ OK, passed 100 tests; 674 discarded.
  2995. 661.75 s [time-compat] LocalTime
  2996. 661.75 s [time-compat] testTime: OK
  2997. 661.75 s [time-compat] TimeOfDay
  2998. 661.75 s [time-compat] daysAndTimeOfDayToTime . timeToDaysAndTimeOfDay: OK
  2999. 661.75 s [time-compat] +++ OK, passed 100 tests.
  3000. 661.75 s [time-compat] timeOfDayToTime . timeToTimeOfDay: OK
  3001. 661.75 s [time-compat] +++ OK, passed 100 tests.
  3002. 661.75 s [time-compat]
  3003. 661.75 s [time-compat] All 856 tests passed (0.41s)
  3004. 661.75 s [time-compat] Test suite main: PASS
  3005. 661.75 s [time-compat] Test suite logged to: dist/test/time-compat-1.9.7-main.log
  3006. 661.75 s [time-compat] 2 of 2 test suites (2 of 2 test cases) passed.
  3007. 661.75 s [hedgehog] Phase: buildPhase
  3008. 661.75 s [time-compat] checkPhase completed in 1 minutes 31 seconds
  3009. 661.75 s [time-compat] Phase: haddockPhase
  3010. 661.81 s [smallcheck] Phase: setupCompilerEnvironmentPhase
  3011. 661.81 s [smallcheck] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  3012. 661.82 s [hedgehog] Preprocessing library for hedgehog-1.5..
  3013. 661.83 s [hedgehog] Building library for hedgehog-1.5..
  3014. 661.91 s [time-compat] Preprocessing library for time-compat-1.9.7..
  3015. 661.91 s [time-compat] Running Haddock on library for time-compat-1.9.7..
  3016. 661.95 s [smallcheck] Phase: unpackPhase
  3017. 661.96 s [smallcheck] unpacking source archive /nix/store/4z2d5xjv0wl7ziyllqx31bwhdql1a9bh-smallcheck-1.2.1.1.tar.gz
  3018. 661.99 s [smallcheck] source root is smallcheck-1.2.1.1
  3019. 661.99 s [time-compat] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  3020. 661.99 s [smallcheck] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "smallcheck-1.2.1.1/Test/SmallCheck/SeriesMonad.hs"
  3021. 662.00 s [smallcheck] Phase: patchPhase
  3022. 662.01 s [smallcheck] Phase: compileBuildDriverPhase
  3023. 662.01 s [smallcheck] setupCompileFlags: -package-db=/build/tmp.94ehWFdhq4/setup-package.conf.d -threaded
  3024. 662.09 s [smallcheck] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.94ehWFdhq4/Main.o )
  3025. 662.16 s [smallcheck] [2 of 2] Linking Setup
  3026. 662.25 s [hedgehog] [ 1 of 27] Compiling Hedgehog.Internal.Barbie ( src/Hedgehog/Internal/Barbie.hs, dist/build/Hedgehog/Internal/Barbie.o, dist/build/Hedgehog/Internal/Barbie.dyn_o )
  3027. 662.58 s [hedgehog] [ 2 of 27] Compiling Hedgehog.Internal.Distributive ( src/Hedgehog/Internal/Distributive.hs, dist/build/Hedgehog/Internal/Distributive.o, dist/build/Hedgehog/Internal/Distributive.dyn_o )
  3028. 662.59 s [time-compat] 61% ( 8 / 13) in 'Data.Time.Calendar.Month.Compat'
  3029. 662.59 s [time-compat] Missing documentation for:
  3030. 662.59 s [time-compat] Module header
  3031. 662.59 s [time-compat] addMonths
  3032. 662.60 s [time-compat] diffMonths
  3033. 662.60 s [time-compat] fromYearMonthValid
  3034. 662.60 s [time-compat] fromMonthDayValid
  3035. 662.60 s [time-compat] 75% ( 9 / 12) in 'Data.Time.Calendar.Quarter.Compat'
  3036. 662.60 s [time-compat] Missing documentation for:
  3037. 662.60 s [time-compat] Module header
  3038. 662.60 s [time-compat] addQuarters
  3039. 662.60 s [time-compat] diffQuarters
  3040. 662.90 s [time-compat] 93% ( 44 / 47) in 'Data.Time.Format.ISO8601.Compat'
  3041. 662.90 s [time-compat] Missing documentation for:
  3042. 662.90 s [time-compat] Module header
  3043. 662.90 s [time-compat] ISO8601
  3044. 662.90 s [time-compat] FormatExtension
  3045. 662.91 s [time-compat] 68% ( 13 / 19) in 'Data.Time.Format.Compat'
  3046. 662.91 s [time-compat] Missing documentation for:
  3047. 662.91 s [time-compat] Module header
  3048. 662.91 s [time-compat] FormatTime
  3049. 662.91 s [time-compat] parseTime (src/Data/Time/Format/Compat.hs:54)
  3050. 662.91 s [time-compat] readTime (src/Data/Time/Format/Compat.hs:63)
  3051. 662.91 s [time-compat] readsTime (src/Data/Time/Format/Compat.hs:71)
  3052. 662.91 s [time-compat] TimeLocale
  3053. 662.92 s [time-compat] 87% ( 7 / 8) in 'Data.Time.Clock.System.Compat'
  3054. 662.92 s [time-compat] Missing documentation for:
  3055. 662.92 s [time-compat] Module header
  3056. 662.93 s [time-compat] 50% ( 4 / 8) in 'Data.Time.Clock.POSIX.Compat'
  3057. 662.93 s [time-compat] Missing documentation for:
  3058. 662.93 s [time-compat] Module header
  3059. 662.93 s [time-compat] posixSecondsToUTCTime
  3060. 662.93 s [time-compat] utcTimeToPOSIXSeconds
  3061. 662.93 s [time-compat] systemToPOSIXTime
  3062. 662.94 s [time-compat] 96% ( 25 / 26) in 'Data.Time.Clock.Compat'
  3063. 662.94 s [time-compat] Missing documentation for:
  3064. 662.94 s [time-compat] Module header
  3065. 662.94 s [time-compat] 73% ( 11 / 15) in 'Data.Time.Calendar.WeekDate.Compat'
  3066. 662.94 s [time-compat] Missing documentation for:
  3067. 662.94 s [time-compat] Module header
  3068. 662.94 s [time-compat] DayOfWeek
  3069. 662.94 s [time-compat] dayOfWeek
  3070. 662.94 s [time-compat] FirstWeekType
  3071. 662.99 s [time-compat] 82% ( 14 / 17) in 'Data.Time.Calendar.OrdinalDate.Compat'
  3072. 662.99 s [time-compat] Missing documentation for:
  3073. 662.99 s [time-compat] Module header
  3074. 662.99 s [time-compat] fromMondayStartWeekValid
  3075. 662.99 s [time-compat] fromSundayStartWeekValid
  3076. 662.99 s [time-compat] 87% ( 7 / 8) in 'Data.Time.Calendar.MonthDay.Compat'
  3077. 662.99 s [time-compat] Missing documentation for:
  3078. 662.99 s [time-compat] Module header
  3079. 662.99 s [time-compat] 83% ( 5 / 6) in 'Data.Time.Calendar.Easter.Compat'
  3080. 662.99 s [time-compat] Missing documentation for:
  3081. 662.99 s [time-compat] Module header
  3082. 663.01 s [time-compat] 72% ( 27 / 37) in 'Data.Time.Calendar.Compat'
  3083. 663.01 s [time-compat] Missing documentation for:
  3084. 663.01 s [time-compat] Module header
  3085. 663.01 s [time-compat] addDays
  3086. 663.01 s [time-compat] diffDays
  3087. 663.01 s [time-compat] CalendarDiffDays
  3088. 663.01 s [time-compat] calendarDay
  3089. 663.01 s [time-compat] calendarWeek
  3090. 663.01 s [time-compat] calendarMonth
  3091. 663.01 s [time-compat] calendarYear
  3092. 663.01 s [time-compat] DayOfWeek
  3093. 663.01 s [time-compat] dayOfWeek
  3094. 663.02 s [time-compat] 79% ( 35 / 44) in 'Data.Time.LocalTime.Compat'
  3095. 663.02 s [time-compat] Missing documentation for:
  3096. 663.02 s [time-compat] Module header
  3097. 663.02 s [time-compat] makeTimeOfDayValid
  3098. 663.02 s [time-compat] CalendarDiffTime
  3099. 663.02 s [time-compat] calendarTimeDays
  3100. 663.02 s [time-compat] calendarTimeTime
  3101. 663.02 s [time-compat] utcToZonedTime
  3102. 663.02 s [time-compat] zonedTimeToUTC
  3103. 663.02 s [time-compat] getZonedTime
  3104. 663.02 s [time-compat] utcToLocalZonedTime
  3105. 663.03 s [time-compat] 80% ( 4 / 5) in 'Data.Time.Compat'
  3106. 663.03 s [time-compat] Missing documentation for:
  3107. 663.03 s [time-compat] Module header
  3108. 663.03 s [time-compat] 64% ( 9 / 14) in 'Data.Time.Clock.TAI.Compat'
  3109. 663.03 s [time-compat] Missing documentation for:
  3110. 663.03 s [time-compat] Module header
  3111. 663.03 s [time-compat] taiNominalDayStart
  3112. 663.03 s [time-compat] utcDayLength
  3113. 663.03 s [time-compat] utcToTAITime
  3114. 663.03 s [time-compat] taiToUTCTime
  3115. 663.04 s [time-compat] 95% ( 23 / 24) in 'Data.Time.Calendar.Julian.Compat'
  3116. 663.04 s [time-compat] Missing documentation for:
  3117. 663.04 s [time-compat] Module header
  3118. 663.25 s [hedgehog] [ 3 of 27] Compiling Hedgehog.Internal.Exception ( src/Hedgehog/Internal/Exception.hs, dist/build/Hedgehog/Internal/Exception.o, dist/build/Hedgehog/Internal/Exception.dyn_o )
  3119. 663.25 s [hedgehog] [ 4 of 27] Compiling Hedgehog.Internal.HTraversable ( src/Hedgehog/Internal/HTraversable.hs, dist/build/Hedgehog/Internal/HTraversable.o, dist/build/Hedgehog/Internal/HTraversable.dyn_o )
  3120. 663.25 s [hedgehog] [ 5 of 27] Compiling Hedgehog.Internal.Opaque ( src/Hedgehog/Internal/Opaque.hs, dist/build/Hedgehog/Internal/Opaque.o, dist/build/Hedgehog/Internal/Opaque.dyn_o )
  3121. 663.25 s [hedgehog] [ 6 of 27] Compiling Hedgehog.Internal.Prelude ( src/Hedgehog/Internal/Prelude.hs, dist/build/Hedgehog/Internal/Prelude.o, dist/build/Hedgehog/Internal/Prelude.dyn_o )
  3122. 663.25 s [hedgehog] [ 7 of 27] Compiling Hedgehog.Internal.Range ( src/Hedgehog/Internal/Range.hs, dist/build/Hedgehog/Internal/Range.o, dist/build/Hedgehog/Internal/Range.dyn_o )
  3123. 663.25 s [hedgehog] [ 8 of 27] Compiling Hedgehog.Internal.Region ( src/Hedgehog/Internal/Region.hs, dist/build/Hedgehog/Internal/Region.o, dist/build/Hedgehog/Internal/Region.dyn_o )
  3124. 663.25 s [hedgehog] [ 9 of 27] Compiling Hedgehog.Internal.Seed ( src/Hedgehog/Internal/Seed.hs, dist/build/Hedgehog/Internal/Seed.o, dist/build/Hedgehog/Internal/Seed.dyn_o )
  3125. 663.38 s [time-compat] Warning: Data.Time.Format.ISO8601.Compat: could not find link destinations for:
  3126. 663.38 s [time-compat] - Data.Format.Productish
  3127. 663.38 s [time-compat] - Data.Format.<**>
  3128. 663.38 s [time-compat] - Data.Format.**>
  3129. 663.38 s [time-compat] - Data.Format.<**
  3130. 663.38 s [time-compat] - Data.Format.pUnit
  3131. 663.38 s [time-compat] - Data.Format.Summish
  3132. 663.38 s [time-compat] - Data.Format.<++>
  3133. 663.38 s [time-compat] - Data.Format.pVoid
  3134. 663.38 s [time-compat] - Data.Format.isoMap
  3135. 663.38 s [time-compat] - Data.Format.IsoVariant
  3136. 663.54 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  3137. 663.54 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  3138. 663.61 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  3139. 663.62 s [duoidal-transformers] Phase: installPhase
  3140. 663.68 s [duoidal-transformers] Installing library in /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/duoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF
  3141. 663.69 s [smallcheck] Phase: updateAutotoolsGnuConfigScriptsPhase
  3142. 663.70 s [smallcheck] Phase: configurePhase
  3143. 663.71 s [smallcheck] configureFlags: --verbose --prefix=/nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc/share/doc/smallcheck-1.2.1.1 --with-gcc=gcc --package-db=/build/tmp.94ehWFdhq4/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  3144. 663.71 s [hedgehog] [10 of 27] Compiling Hedgehog.Internal.Show ( src/Hedgehog/Internal/Show.hs, dist/build/Hedgehog/Internal/Show.o, dist/build/Hedgehog/Internal/Show.dyn_o )
  3145. 663.71 s [hedgehog] [11 of 27] Compiling Hedgehog.Internal.Shrink ( src/Hedgehog/Internal/Shrink.hs, dist/build/Hedgehog/Internal/Shrink.o, dist/build/Hedgehog/Internal/Shrink.dyn_o )
  3146. 663.71 s [hedgehog] [12 of 27] Compiling Hedgehog.Internal.Source ( src/Hedgehog/Internal/Source.hs, dist/build/Hedgehog/Internal/Source.o, dist/build/Hedgehog/Internal/Source.dyn_o )
  3147. 663.71 s [hedgehog] [13 of 27] Compiling Hedgehog.Internal.Tree ( src/Hedgehog/Internal/Tree.hs, dist/build/Hedgehog/Internal/Tree.o, dist/build/Hedgehog/Internal/Tree.dyn_o )
  3148. 663.71 s [smallcheck] Using Parsec parser
  3149. 663.71 s [smallcheck] Configuring smallcheck-1.2.1.1...
  3150. 663.89 s [duoidal-transformers] Phase: fixupPhase
  3151. 663.91 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0
  3152. 663.91 s [duoidal-transformers] shrinking /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSduoidal-transformers-0.0.1.0-GPOkAKZ9fTA2uCrRWszkpF-ghc9.6.3.so
  3153. 663.92 s [duoidal-transformers] checking for references to /build/ in /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0...
  3154. 663.93 s [duoidal-transformers] patching script interpreter paths in /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0
  3155. 663.93 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/lib
  3156. 663.98 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc
  3157. 663.99 s [duoidal-transformers] checking for references to /build/ in /nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc...
  3158. 664.00 s [duoidal-transformers] patching script interpreter paths in /nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc
  3159. 664.11 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0 /nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc
  3160. 664.68 s [duoidal-transformers:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  3161. 664.68 s [duoidal-transformers:post-build]
  3162. 665.05 s [duoidal-transformers:post-build] Pushing /nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc (339.22 KiB)
  3163. 665.15 s [duoidal-transformers:post-build] Pushing /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0 (648.40 KiB)
  3164. 666.20 s [duoidal-transformers:post-build]
  3165. 666.20 s [duoidal-transformers:post-build] All done.
  3166. 666.23 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0 /nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc
  3167. 666.29 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3168. 666.30 s [duoidal-transformers:post-build] copying 2 paths...
  3169. 666.30 s [duoidal-transformers:post-build] copying path '/nix/store/rhjyl3czkivw0y74r0rnl63q4lk9s9ap-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  3170. 666.73 s [duoidal-transformers:post-build] copying path '/nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  3171. 667.19 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3172. 667.45 s [duoidal-transformers:post-build] copying 1 paths...
  3173. 667.45 s [duoidal-transformers:post-build] copying path '/nix/store/aa9x36s9a12s5l9wpwshvvarngkfhjha-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  3174. 667.71 s Progress: 94 of 115 built (4 building), 172 of 172 downloaded from cache
  3175. 667.71 s [hedgehog] [14 of 27] Compiling Hedgehog.Main ( src/Hedgehog/Main.hs, dist/build/Hedgehog/Main.o, dist/build/Hedgehog/Main.dyn_o )
  3176. 667.71 s [hedgehog] [15 of 27] Compiling Hedgehog.Range ( src/Hedgehog/Range.hs, dist/build/Hedgehog/Range.o, dist/build/Hedgehog/Range.dyn_o )
  3177. 667.71 s [hedgehog] [16 of 27] Compiling Hedgehog.Internal.Gen ( src/Hedgehog/Internal/Gen.hs, dist/build/Hedgehog/Internal/Gen.o, dist/build/Hedgehog/Internal/Gen.dyn_o )
  3178. 667.71 s [hedgehog] [17 of 27] Compiling Hedgehog.Internal.Property ( src/Hedgehog/Internal/Property.hs, dist/build/Hedgehog/Internal/Property.o, dist/build/Hedgehog/Internal/Property.dyn_o )
  3179. 667.71 s [smallcheck] Dependency base >=4.3 && <5: using base-4.18.1.0
  3180. 667.71 s [smallcheck] Dependency logict >=0.5 && <0.9: using logict-0.8.2.0
  3181. 667.71 s [smallcheck] Dependency mtl <2.4: using mtl-2.3.1
  3182. 667.71 s [smallcheck] Dependency pretty <1.2: using pretty-1.1.3.6
  3183. 667.71 s [smallcheck] Source component graph: component lib
  3184. 667.71 s [smallcheck] Configured component graph:
  3185. 667.71 s [smallcheck] component smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3186. 667.71 s [smallcheck] include base-4.18.1.0
  3187. 667.71 s [smallcheck] include logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  3188. 667.71 s [smallcheck] include mtl-2.3.1
  3189. 667.71 s [smallcheck] include pretty-1.1.3.6
  3190. 667.71 s [smallcheck] Linked component graph:
  3191. 667.71 s [smallcheck] unit smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3192. 667.71 s [smallcheck] include base-4.18.1.0
  3193. 667.71 s [smallcheck] include logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  3194. 667.71 s [smallcheck] include mtl-2.3.1
  3195. 667.71 s [smallcheck] include pretty-1.1.3.6
  3196. 667.72 s [smallcheck] Test.SmallCheck=smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2:Test.SmallCheck,Test.SmallCheck.Drivers=smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2:Test.SmallCheck.Drivers,Test.SmallCheck.Series=smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2:Test.SmallCheck.Series
  3197. 667.72 s [smallcheck] Ready component graph:
  3198. 667.72 s [smallcheck] definite smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3199. 667.72 s [smallcheck] depends base-4.18.1.0
  3200. 667.72 s [smallcheck] depends logict-0.8.2.0-BnFHhxSebb89uVYm09RZ6V
  3201. 667.72 s [smallcheck] depends mtl-2.3.1
  3202. 667.72 s [smallcheck] depends pretty-1.1.3.6
  3203. 667.72 s [smallcheck] Using Cabal-3.10.1.0 compiled by ghc-9.6
  3204. 667.72 s [smallcheck] Using compiler: ghc-9.6.3
  3205. 667.72 s [smallcheck] Using install prefix:
  3206. 667.72 s [smallcheck] /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1
  3207. 667.72 s [smallcheck] Executables installed in:
  3208. 667.72 s [smallcheck] /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/bin
  3209. 667.72 s [smallcheck] Libraries installed in:
  3210. 667.72 s [smallcheck] /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3211. 667.72 s [smallcheck] Dynamic Libraries installed in:
  3212. 667.72 s [smallcheck] /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  3213. 667.72 s [smallcheck] Private executables installed in:
  3214. 667.72 s [smallcheck] /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/libexec/x86_64-linux-ghc-9.6.3/smallcheck-1.2.1.1
  3215. 667.72 s [smallcheck] Data files installed in:
  3216. 667.72 s [smallcheck] /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/share/x86_64-linux-ghc-9.6.3/smallcheck-1.2.1.1
  3217. 667.72 s [smallcheck] Documentation installed in:
  3218. 667.72 s [smallcheck] /nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc/share/doc/smallcheck-1.2.1.1
  3219. 667.72 s [smallcheck] Configuration files installed in:
  3220. 667.72 s [smallcheck] /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/etc
  3221. 667.72 s [smallcheck] No alex found
  3222. 667.72 s [smallcheck] Using ar found on system at:
  3223. 667.72 s [smallcheck] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  3224. 667.72 s [smallcheck] No c2hs found
  3225. 667.72 s [smallcheck] No cpphs found
  3226. 667.72 s [smallcheck] No doctest found
  3227. 667.72 s [smallcheck] Using gcc version 14.3.0 given by user at:
  3228. 667.72 s [smallcheck] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  3229. 667.72 s [smallcheck] Using ghc version 9.6.3 found on system at:
  3230. 667.72 s [smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  3231. 667.72 s [smallcheck] Using ghc-pkg version 9.6.3 found on system at:
  3232. 667.72 s [smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  3233. 667.72 s [smallcheck] No ghcjs found
  3234. 667.72 s [smallcheck] No ghcjs-pkg found
  3235. 667.72 s [smallcheck] No greencard found
  3236. 667.72 s [smallcheck] Using haddock version 2.29.1 found on system at:
  3237. 667.72 s [smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  3238. 667.72 s [smallcheck] No happy found
  3239. 667.72 s [smallcheck] Using haskell-suite found on system at: haskell-suite-dummy-location
  3240. 667.72 s [smallcheck] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3241. 667.72 s [smallcheck] No hmake found
  3242. 667.72 s [smallcheck] Using hpc version 0.68 found on system at:
  3243. 667.72 s [smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  3244. 667.72 s [smallcheck] Using hsc2hs version 0.68.9 found on system at:
  3245. 667.72 s [smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  3246. 667.72 s [smallcheck] Using hscolour version 1.25 found on system at:
  3247. 667.72 s [smallcheck] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  3248. 667.72 s [smallcheck] No jhc found
  3249. 667.72 s [smallcheck] Using ld found on system at:
  3250. 667.72 s [smallcheck] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  3251. 667.72 s [smallcheck] No pkg-config found
  3252. 667.72 s [smallcheck] Using runghc version 9.6.3 found on system at:
  3253. 667.72 s [smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  3254. 667.72 s [smallcheck] Using strip version 2.44 found on system at:
  3255. 667.72 s [smallcheck] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  3256. 667.72 s [smallcheck] Using tar found on system at:
  3257. 667.72 s [smallcheck] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  3258. 667.72 s [smallcheck] No uhc found
  3259. 667.72 s [smallcheck] Phase: buildPhase
  3260. 667.72 s [smallcheck] Preprocessing library for smallcheck-1.2.1.1..
  3261. 667.72 s [smallcheck] Building library for smallcheck-1.2.1.1..
  3262. 667.72 s [time-compat] Documentation created: dist/doc/html/time-compat/index.html,
  3263. 667.72 s [time-compat] dist/doc/html/time-compat/time-compat.txt
  3264. 667.72 s [time-compat] Preprocessing test suite 'instances' for time-compat-1.9.7..
  3265. 667.72 s [time-compat] Preprocessing test suite 'main' for time-compat-1.9.7..
  3266. 667.72 s [time-compat] Phase: installPhase
  3267. 667.72 s [time-compat] Installing library in /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/time-compat-1.9.7-CgIQc7E2JHn8kYFCatkL43
  3268. 667.72 s [time-compat] Phase: fixupPhase
  3269. 667.72 s [time-compat] shrinking RPATHs of ELF executables and libraries in /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7
  3270. 667.72 s [time-compat] shrinking /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHStime-compat-1.9.7-CgIQc7E2JHn8kYFCatkL43-ghc9.6.3.so
  3271. 667.72 s [time-compat] checking for references to /build/ in /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7...
  3272. 667.72 s [time-compat] patching script interpreter paths in /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7
  3273. 667.72 s [time-compat] stripping (with command strip and flags -S -p) in /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7/lib
  3274. 667.72 s [smallcheck] [1 of 6] Compiling Test.SmallCheck.Property.Result ( Test/SmallCheck/Property/Result.hs, dist/build/Test/SmallCheck/Property/Result.o, dist/build/Test/SmallCheck/Property/Result.dyn_o )
  3275. 667.72 s [smallcheck] [2 of 6] Compiling Test.SmallCheck.SeriesMonad ( Test/SmallCheck/SeriesMonad.hs, dist/build/Test/SmallCheck/SeriesMonad.o, dist/build/Test/SmallCheck/SeriesMonad.dyn_o )
  3276. 667.72 s [smallcheck] [3 of 6] Compiling Test.SmallCheck.Series ( Test/SmallCheck/Series.hs, dist/build/Test/SmallCheck/Series.o, dist/build/Test/SmallCheck/Series.dyn_o )
  3277. 667.80 s [time-compat] shrinking RPATHs of ELF executables and libraries in /nix/store/rlmbykdramdpxnqhpzh497gk96igwr95-time-compat-1.9.7-doc
  3278. 667.81 s [time-compat] checking for references to /build/ in /nix/store/rlmbykdramdpxnqhpzh497gk96igwr95-time-compat-1.9.7-doc...
  3279. 667.83 s [time-compat] patching script interpreter paths in /nix/store/rlmbykdramdpxnqhpzh497gk96igwr95-time-compat-1.9.7-doc
  3280. 667.99 s [time-compat:post-build] Uploading to cachix cache "sellout": /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7 /nix/store/rlmbykdramdpxnqhpzh497gk96igwr95-time-compat-1.9.7-doc
  3281. 668.53 s [time-compat:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  3282. 668.53 s [time-compat:post-build]
  3283. 668.91 s [time-compat:post-build] Pushing /nix/store/rlmbykdramdpxnqhpzh497gk96igwr95-time-compat-1.9.7-doc (2.03 MiB)
  3284. 668.97 s [time-compat:post-build] Pushing /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7 (1.61 MiB)
  3285. 669.97 s [time-compat:post-build]
  3286. 669.97 s [time-compat:post-build] All done.
  3287. 669.99 s [time-compat:post-build] Uploading to the NixCI cache: /nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7 /nix/store/rlmbykdramdpxnqhpzh497gk96igwr95-time-compat-1.9.7-doc
  3288. 670.08 s [time-compat:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3289. 670.28 s [time-compat:post-build] copying 2 paths...
  3290. 670.28 s [time-compat:post-build] copying path '/nix/store/rlmbykdramdpxnqhpzh497gk96igwr95-time-compat-1.9.7-doc' to 'https://cache.nix-ci.com'...
  3291. 670.82 s [time-compat:post-build] copying path '/nix/store/741qpdb5i4fb2dvw3mazr6n59is0067j-time-compat-1.9.7' to 'https://cache.nix-ci.com'...
  3292. 671.49 s [time-compat:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3293. 671.75 s [time-compat:post-build] copying 1 paths...
  3294. 671.75 s [time-compat:post-build] copying path '/nix/store/njxcrpn4pqcjbpalbjbivjzxgjy6jkkk-time-compat-1.9.7.drv' to 'https://cache.nix-ci.com'...
  3295. 672.03 s Progress: 95 of 114 built (3 building), 172 of 172 downloaded from cache
  3296. 672.03 s [hedgehog] [18 of 27] Compiling Hedgehog.Internal.Tripping ( src/Hedgehog/Internal/Tripping.hs, dist/build/Hedgehog/Internal/Tripping.o, dist/build/Hedgehog/Internal/Tripping.dyn_o )
  3297. 672.03 s [hedgehog] [19 of 27] Compiling Hedgehog.Internal.State ( src/Hedgehog/Internal/State.hs, dist/build/Hedgehog/Internal/State.o, dist/build/Hedgehog/Internal/State.dyn_o )
  3298. 672.03 s [hedgehog] [20 of 27] Compiling Hedgehog.Internal.Discovery ( src/Hedgehog/Internal/Discovery.hs, dist/build/Hedgehog/Internal/Discovery.o, dist/build/Hedgehog/Internal/Discovery.dyn_o )
  3299. 672.03 s [hedgehog] [21 of 27] Compiling Hedgehog.Internal.TH ( src/Hedgehog/Internal/TH.hs, dist/build/Hedgehog/Internal/TH.o, dist/build/Hedgehog/Internal/TH.dyn_o )
  3300. 672.03 s [hedgehog] [22 of 27] Compiling Hedgehog.Internal.Config ( src/Hedgehog/Internal/Config.hs, dist/build/Hedgehog/Internal/Config.o, dist/build/Hedgehog/Internal/Config.dyn_o )
  3301. 672.03 s [hedgehog] [23 of 27] Compiling Hedgehog.Internal.Report ( src/Hedgehog/Internal/Report.hs, dist/build/Hedgehog/Internal/Report.o, dist/build/Hedgehog/Internal/Report.dyn_o )
  3302. 672.03 s [smallcheck] [4 of 6] Compiling Test.SmallCheck.Property ( Test/SmallCheck/Property.hs, dist/build/Test/SmallCheck/Property.o, dist/build/Test/SmallCheck/Property.dyn_o )
  3303. 672.03 s [smallcheck] [5 of 6] Compiling Test.SmallCheck.Drivers ( Test/SmallCheck/Drivers.hs, dist/build/Test/SmallCheck/Drivers.o, dist/build/Test/SmallCheck/Drivers.dyn_o )
  3304. 672.03 s [smallcheck] [6 of 6] Compiling Test.SmallCheck ( Test/SmallCheck.hs, dist/build/Test/SmallCheck.o, dist/build/Test/SmallCheck.dyn_o )
  3305. 672.03 s [smallcheck] [1 of 6] Compiling Test.SmallCheck.Property.Result ( Test/SmallCheck/Property/Result.hs, dist/build/Test/SmallCheck/Property/Result.p_o )
  3306. 672.03 s [smallcheck] [2 of 6] Compiling Test.SmallCheck.SeriesMonad ( Test/SmallCheck/SeriesMonad.hs, dist/build/Test/SmallCheck/SeriesMonad.p_o )
  3307. 672.03 s [smallcheck] [3 of 6] Compiling Test.SmallCheck.Series ( Test/SmallCheck/Series.hs, dist/build/Test/SmallCheck/Series.p_o )
  3308. 672.04 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 )
  3309. 672.52 s [smallcheck] [4 of 6] Compiling Test.SmallCheck.Property ( Test/SmallCheck/Property.hs, dist/build/Test/SmallCheck/Property.p_o )
  3310. 672.99 s [smallcheck] [5 of 6] Compiling Test.SmallCheck.Drivers ( Test/SmallCheck/Drivers.hs, dist/build/Test/SmallCheck/Drivers.p_o )
  3311. 673.15 s [smallcheck] [6 of 6] Compiling Test.SmallCheck ( Test/SmallCheck.hs, dist/build/Test/SmallCheck.p_o )
  3312. 673.81 s [hedgehog] [24 of 27] Compiling Hedgehog.Internal.Queue ( src/Hedgehog/Internal/Queue.hs, dist/build/Hedgehog/Internal/Queue.o, dist/build/Hedgehog/Internal/Queue.dyn_o )
  3313. 673.81 s [hedgehog] [25 of 27] Compiling Hedgehog.Internal.Runner ( src/Hedgehog/Internal/Runner.hs, dist/build/Hedgehog/Internal/Runner.o, dist/build/Hedgehog/Internal/Runner.dyn_o )
  3314. 674.22 s [smallcheck] Phase: checkPhase
  3315. 674.24 s [smallcheck] Package has no test suites.
  3316. 674.26 s [smallcheck] Phase: haddockPhase
  3317. 674.40 s [smallcheck] Preprocessing library for smallcheck-1.2.1.1..
  3318. 674.40 s [smallcheck] Running Haddock on library for smallcheck-1.2.1.1..
  3319. 674.45 s [smallcheck] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  3320. 674.74 s [hedgehog] [26 of 27] Compiling Hedgehog.Gen ( src/Hedgehog/Gen.hs, dist/build/Hedgehog/Gen.o, dist/build/Hedgehog/Gen.dyn_o )
  3321. 674.74 s [hedgehog] [27 of 27] Compiling Hedgehog ( src/Hedgehog.hs, dist/build/Hedgehog.o, dist/build/Hedgehog.dyn_o )
  3322. 675.19 s [smallcheck] 100% ( 56 / 56) in 'Test.SmallCheck.Series'
  3323. 675.37 s [hedgehog] [ 1 of 27] Compiling Hedgehog.Internal.Barbie ( src/Hedgehog/Internal/Barbie.hs, dist/build/Hedgehog/Internal/Barbie.p_o )
  3324. 675.68 s [hedgehog] [ 2 of 27] Compiling Hedgehog.Internal.Distributive ( src/Hedgehog/Internal/Distributive.hs, dist/build/Hedgehog/Internal/Distributive.p_o )
  3325. 676.00 s [smallcheck] 100% ( 11 / 11) in 'Test.SmallCheck.Drivers'
  3326. 676.03 s [smallcheck] 100% ( 21 / 21) in 'Test.SmallCheck'
  3327. 676.22 s [smallcheck] Warning: Test.SmallCheck.Series: could not find link destinations for:
  3328. 676.22 s [smallcheck] - Test.SmallCheck.Series.GCoSerial
  3329. 676.22 s [smallcheck] - Test.SmallCheck.Series.GSerial
  3330. 676.23 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 )
  3331. 676.32 s [hedgehog] [ 3 of 27] Compiling Hedgehog.Internal.Exception ( src/Hedgehog/Internal/Exception.hs, dist/build/Hedgehog/Internal/Exception.p_o )
  3332. 676.32 s [hedgehog] [ 4 of 27] Compiling Hedgehog.Internal.HTraversable ( src/Hedgehog/Internal/HTraversable.hs, dist/build/Hedgehog/Internal/HTraversable.p_o )
  3333. 676.32 s [hedgehog] [ 5 of 27] Compiling Hedgehog.Internal.Opaque ( src/Hedgehog/Internal/Opaque.hs, dist/build/Hedgehog/Internal/Opaque.p_o )
  3334. 676.32 s [hedgehog] [ 6 of 27] Compiling Hedgehog.Internal.Prelude ( src/Hedgehog/Internal/Prelude.hs, dist/build/Hedgehog/Internal/Prelude.p_o )
  3335. 676.32 s [hedgehog] [ 7 of 27] Compiling Hedgehog.Internal.Range ( src/Hedgehog/Internal/Range.hs, dist/build/Hedgehog/Internal/Range.p_o )
  3336. 676.32 s [hedgehog] [ 8 of 27] Compiling Hedgehog.Internal.Region ( src/Hedgehog/Internal/Region.hs, dist/build/Hedgehog/Internal/Region.p_o )
  3337. 676.32 s [hedgehog] [ 9 of 27] Compiling Hedgehog.Internal.Seed ( src/Hedgehog/Internal/Seed.hs, dist/build/Hedgehog/Internal/Seed.p_o )
  3338. 676.76 s [hedgehog] [10 of 27] Compiling Hedgehog.Internal.Show ( src/Hedgehog/Internal/Show.hs, dist/build/Hedgehog/Internal/Show.p_o )
  3339. 676.76 s [hedgehog] [11 of 27] Compiling Hedgehog.Internal.Shrink ( src/Hedgehog/Internal/Shrink.hs, dist/build/Hedgehog/Internal/Shrink.p_o )
  3340. 676.76 s [hedgehog] [12 of 27] Compiling Hedgehog.Internal.Source ( src/Hedgehog/Internal/Source.hs, dist/build/Hedgehog/Internal/Source.p_o )
  3341. 676.76 s [hedgehog] [13 of 27] Compiling Hedgehog.Internal.Tree ( src/Hedgehog/Internal/Tree.hs, dist/build/Hedgehog/Internal/Tree.p_o )
  3342. 677.94 s [hedgehog] [14 of 27] Compiling Hedgehog.Main ( src/Hedgehog/Main.hs, dist/build/Hedgehog/Main.p_o )
  3343. 677.94 s [hedgehog] [15 of 27] Compiling Hedgehog.Range ( src/Hedgehog/Range.hs, dist/build/Hedgehog/Range.p_o )
  3344. 677.94 s [hedgehog] [16 of 27] Compiling Hedgehog.Internal.Gen ( src/Hedgehog/Internal/Gen.hs, dist/build/Hedgehog/Internal/Gen.p_o )
  3345. 679.12 s [smallcheck] Documentation created: dist/doc/html/smallcheck/index.html,
  3346. 679.12 s [smallcheck] dist/doc/html/smallcheck/smallcheck.txt
  3347. 679.21 s [smallcheck] Phase: installPhase
  3348. 679.25 s [smallcheck] Installing library in /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3349. 679.62 s [smallcheck] Phase: fixupPhase
  3350. 679.64 s [smallcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1
  3351. 679.65 s [smallcheck] shrinking /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSsmallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2-ghc9.6.3.so
  3352. 679.65 s [smallcheck] checking for references to /build/ in /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1...
  3353. 679.67 s [smallcheck] patching script interpreter paths in /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1
  3354. 679.67 s [smallcheck] stripping (with command strip and flags -S -p) in /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1/lib
  3355. 679.88 s [smallcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc
  3356. 679.88 s [smallcheck] checking for references to /build/ in /nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc...
  3357. 679.89 s [smallcheck] patching script interpreter paths in /nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc
  3358. 680.00 s [smallcheck:post-build] Uploading to cachix cache "sellout": /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1 /nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc
  3359. 680.61 s [smallcheck:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  3360. 680.61 s [smallcheck:post-build]
  3361. 681.09 s [smallcheck:post-build] Pushing /nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc (1.92 MiB)
  3362. 681.14 s [smallcheck:post-build] Pushing /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1 (6.77 MiB)
  3363. 682.36 s [smallcheck:post-build]
  3364. 682.36 s [smallcheck:post-build] All done.
  3365. 682.38 s [smallcheck:post-build] Uploading to the NixCI cache: /nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1 /nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc
  3366. 682.44 s [smallcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3367. 682.65 s [smallcheck:post-build] copying 2 paths...
  3368. 682.65 s [smallcheck:post-build] copying path '/nix/store/m0wbi3cmwg5s3haz54y5bbzlbmhap7xd-smallcheck-1.2.1.1-doc' to 'https://cache.nix-ci.com'...
  3369. 683.16 s [smallcheck:post-build] copying path '/nix/store/iq6gy6bayan1a0bcnc1gn4lpk7dvn5j0-smallcheck-1.2.1.1' to 'https://cache.nix-ci.com'...
  3370. 685.49 s [smallcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3371. 685.74 s [smallcheck:post-build] copying 1 paths...
  3372. 685.74 s [smallcheck:post-build] copying path '/nix/store/1pnlycbmvimxlqpzvkl5qm796kb3ljmb-smallcheck-1.2.1.1.drv' to 'https://cache.nix-ci.com'...
  3373. 686.00 s Progress: 96 of 114 built (2 building), 172 of 172 downloaded from cache
  3374. 686.06 s Building /nix/store/1v8zxzpnz7cdhkkhxhni0pcjqdzpzgiy-tasty-smallcheck-0.8.2.drv
  3375. 686.06 s [hedgehog] [17 of 27] Compiling Hedgehog.Internal.Property ( src/Hedgehog/Internal/Property.hs, dist/build/Hedgehog/Internal/Property.p_o )
  3376. 686.06 s [hedgehog] [18 of 27] Compiling Hedgehog.Internal.Tripping ( src/Hedgehog/Internal/Tripping.hs, dist/build/Hedgehog/Internal/Tripping.p_o )
  3377. 686.06 s [hedgehog] [19 of 27] Compiling Hedgehog.Internal.State ( src/Hedgehog/Internal/State.hs, dist/build/Hedgehog/Internal/State.p_o )
  3378. 686.06 s [hedgehog] [20 of 27] Compiling Hedgehog.Internal.Discovery ( src/Hedgehog/Internal/Discovery.hs, dist/build/Hedgehog/Internal/Discovery.p_o )
  3379. 686.06 s [hedgehog] [21 of 27] Compiling Hedgehog.Internal.TH ( src/Hedgehog/Internal/TH.hs, dist/build/Hedgehog/Internal/TH.p_o )
  3380. 686.06 s [hedgehog] [22 of 27] Compiling Hedgehog.Internal.Config ( src/Hedgehog/Internal/Config.hs, dist/build/Hedgehog/Internal/Config.p_o )
  3381. 686.06 s [hedgehog] [23 of 27] Compiling Hedgehog.Internal.Report ( src/Hedgehog/Internal/Report.hs, dist/build/Hedgehog/Internal/Report.p_o )
  3382. 686.06 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 )
  3383. 686.06 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 )
  3384. 686.06 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  3385. 686.06 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 )
  3386. 686.06 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 )
  3387. 686.06 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  3388. 686.06 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  3389. 686.06 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 )
  3390. 686.15 s [tasty-smallcheck] Phase: setupCompilerEnvironmentPhase
  3391. 686.16 s [tasty-smallcheck] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  3392. 686.32 s [tasty-smallcheck] Phase: unpackPhase
  3393. 686.32 s [tasty-smallcheck] unpacking source archive /nix/store/0x239pdac4vkzizdq057g48dka8hh4al-tasty-smallcheck-0.8.2.tar.gz
  3394. 686.33 s [tasty-smallcheck] source root is tasty-smallcheck-0.8.2
  3395. 686.33 s [tasty-smallcheck] setting SOURCE_DATE_EPOCH to timestamp 1608313170 of file "tasty-smallcheck-0.8.2/tasty-smallcheck.cabal"
  3396. 686.34 s [tasty-smallcheck] Phase: patchPhase
  3397. 686.34 s [tasty-smallcheck] Replace Cabal file with edited version from mirror://hackage/tasty-smallcheck-0.8.2/revision/1.cabal.
  3398. 686.35 s [tasty-smallcheck] Phase: compileBuildDriverPhase
  3399. 686.35 s [tasty-smallcheck] setupCompileFlags: -package-db=/build/tmp.pZIVGoDjtO/setup-package.conf.d -threaded
  3400. 686.40 s [tasty-smallcheck] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.pZIVGoDjtO/Main.o )
  3401. 686.46 s [tasty-smallcheck] [2 of 2] Linking Setup
  3402. 687.31 s [hedgehog] [24 of 27] Compiling Hedgehog.Internal.Queue ( src/Hedgehog/Internal/Queue.hs, dist/build/Hedgehog/Internal/Queue.p_o )
  3403. 687.32 s [hedgehog] [25 of 27] Compiling Hedgehog.Internal.Runner ( src/Hedgehog/Internal/Runner.hs, dist/build/Hedgehog/Internal/Runner.p_o )
  3404. 687.70 s [tasty-smallcheck] Phase: updateAutotoolsGnuConfigScriptsPhase
  3405. 687.72 s [tasty-smallcheck] Phase: configurePhase
  3406. 687.72 s [tasty-smallcheck] configureFlags: --verbose --prefix=/nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc/share/doc/tasty-smallcheck-0.8.2 --with-gcc=gcc --package-db=/build/tmp.pZIVGoDjtO/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  3407. 687.73 s [tasty-smallcheck] Using Parsec parser
  3408. 687.73 s [tasty-smallcheck] Configuring tasty-smallcheck-0.8.2...
  3409. 688.05 s [tasty-smallcheck] Dependency base >=4.8 && <5: using base-4.18.1.0
  3410. 688.05 s [tasty-smallcheck] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  3411. 688.05 s [tasty-smallcheck] Dependency smallcheck >=1.0: using smallcheck-1.2.1.1
  3412. 688.05 s [tasty-smallcheck] Dependency tagged: using tagged-0.8.8
  3413. 688.05 s [tasty-smallcheck] Dependency tasty >=0.8: using tasty-1.5.3
  3414. 688.09 s [hedgehog] [26 of 27] Compiling Hedgehog.Gen ( src/Hedgehog/Gen.hs, dist/build/Hedgehog/Gen.p_o )
  3415. 688.09 s [hedgehog] [27 of 27] Compiling Hedgehog ( src/Hedgehog.hs, dist/build/Hedgehog.p_o )
  3416. 688.29 s [tasty-smallcheck] Source component graph: component lib
  3417. 688.29 s [tasty-smallcheck] Configured component graph:
  3418. 688.29 s [tasty-smallcheck] component tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  3419. 688.29 s [tasty-smallcheck] include base-4.18.1.0
  3420. 688.29 s [tasty-smallcheck] include optparse-applicative-0.18.1.0-3njyGCesfyJ26MUMeugFs9
  3421. 688.29 s [tasty-smallcheck] include smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3422. 688.29 s [tasty-smallcheck] include tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  3423. 688.29 s [tasty-smallcheck] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  3424. 688.29 s [tasty-smallcheck] Linked component graph:
  3425. 688.29 s [tasty-smallcheck] unit tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  3426. 688.29 s [tasty-smallcheck] include base-4.18.1.0
  3427. 688.29 s [tasty-smallcheck] include optparse-applicative-0.18.1.0-3njyGCesfyJ26MUMeugFs9
  3428. 688.29 s [tasty-smallcheck] include smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3429. 688.29 s [tasty-smallcheck] include tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  3430. 688.29 s [tasty-smallcheck] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  3431. 688.29 s [tasty-smallcheck] Test.Tasty.SmallCheck=tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl:Test.Tasty.SmallCheck
  3432. 688.29 s [tasty-smallcheck] Ready component graph:
  3433. 688.29 s [tasty-smallcheck] definite tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  3434. 688.29 s [tasty-smallcheck] depends base-4.18.1.0
  3435. 688.29 s [tasty-smallcheck] depends optparse-applicative-0.18.1.0-3njyGCesfyJ26MUMeugFs9
  3436. 688.29 s [tasty-smallcheck] depends smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3437. 688.29 s [tasty-smallcheck] depends tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  3438. 688.29 s [tasty-smallcheck] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  3439. 688.29 s [tasty-smallcheck] Using Cabal-3.10.1.0 compiled by ghc-9.6
  3440. 688.29 s [tasty-smallcheck] Using compiler: ghc-9.6.3
  3441. 688.29 s [tasty-smallcheck] Using install prefix:
  3442. 688.29 s [tasty-smallcheck] /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2
  3443. 688.29 s [tasty-smallcheck] Executables installed in:
  3444. 688.29 s [tasty-smallcheck] /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/bin
  3445. 688.29 s [tasty-smallcheck] Libraries installed in:
  3446. 688.29 s [tasty-smallcheck] /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  3447. 688.29 s [tasty-smallcheck] Dynamic Libraries installed in:
  3448. 688.29 s [tasty-smallcheck] /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  3449. 688.29 s [tasty-smallcheck] Private executables installed in:
  3450. 688.29 s [tasty-smallcheck] /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/libexec/x86_64-linux-ghc-9.6.3/tasty-smallcheck-0.8.2
  3451. 688.29 s [tasty-smallcheck] Data files installed in:
  3452. 688.29 s [tasty-smallcheck] /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/share/x86_64-linux-ghc-9.6.3/tasty-smallcheck-0.8.2
  3453. 688.29 s [tasty-smallcheck] Documentation installed in:
  3454. 688.29 s [tasty-smallcheck] /nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc/share/doc/tasty-smallcheck-0.8.2
  3455. 688.29 s [tasty-smallcheck] Configuration files installed in:
  3456. 688.29 s [tasty-smallcheck] /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/etc
  3457. 688.29 s [tasty-smallcheck] No alex found
  3458. 688.29 s [tasty-smallcheck] Using ar found on system at:
  3459. 688.29 s [tasty-smallcheck] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  3460. 688.29 s [tasty-smallcheck] No c2hs found
  3461. 688.29 s [tasty-smallcheck] No cpphs found
  3462. 688.29 s [tasty-smallcheck] No doctest found
  3463. 688.29 s [tasty-smallcheck] Using gcc version 14.3.0 given by user at:
  3464. 688.29 s [tasty-smallcheck] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  3465. 688.29 s [tasty-smallcheck] Using ghc version 9.6.3 found on system at:
  3466. 688.29 s [tasty-smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  3467. 688.29 s [tasty-smallcheck] Using ghc-pkg version 9.6.3 found on system at:
  3468. 688.29 s [tasty-smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  3469. 688.29 s [tasty-smallcheck] No ghcjs found
  3470. 688.29 s [tasty-smallcheck] No ghcjs-pkg found
  3471. 688.29 s [tasty-smallcheck] No greencard found
  3472. 688.29 s [tasty-smallcheck] Using haddock version 2.29.1 found on system at:
  3473. 688.29 s [tasty-smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  3474. 688.29 s [tasty-smallcheck] No happy found
  3475. 688.29 s [tasty-smallcheck] Using haskell-suite found on system at: haskell-suite-dummy-location
  3476. 688.29 s [tasty-smallcheck] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3477. 688.29 s [tasty-smallcheck] No hmake found
  3478. 688.29 s [tasty-smallcheck] Using hpc version 0.68 found on system at:
  3479. 688.29 s [tasty-smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  3480. 688.29 s [tasty-smallcheck] Using hsc2hs version 0.68.9 found on system at:
  3481. 688.29 s [tasty-smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  3482. 688.29 s [tasty-smallcheck] Using hscolour version 1.25 found on system at:
  3483. 688.29 s [tasty-smallcheck] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  3484. 688.29 s [tasty-smallcheck] No jhc found
  3485. 688.29 s [tasty-smallcheck] Using ld found on system at:
  3486. 688.29 s [tasty-smallcheck] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  3487. 688.29 s [tasty-smallcheck] No pkg-config found
  3488. 688.29 s [tasty-smallcheck] Using runghc version 9.6.3 found on system at:
  3489. 688.29 s [tasty-smallcheck] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  3490. 688.29 s [tasty-smallcheck] Using strip version 2.44 found on system at:
  3491. 688.29 s [tasty-smallcheck] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  3492. 688.29 s [tasty-smallcheck] Using tar found on system at:
  3493. 688.29 s [tasty-smallcheck] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  3494. 688.29 s [tasty-smallcheck] No uhc found
  3495. 688.42 s [tasty-smallcheck] Phase: buildPhase
  3496. 688.48 s [tasty-smallcheck] Preprocessing library for tasty-smallcheck-0.8.2..
  3497. 688.48 s [tasty-smallcheck] Building library for tasty-smallcheck-0.8.2..
  3498. 688.56 s [tasty-smallcheck] [1 of 1] Compiling Test.Tasty.SmallCheck ( Test/Tasty/SmallCheck.hs, dist/build/Test/Tasty/SmallCheck.o, dist/build/Test/Tasty/SmallCheck.dyn_o )
  3499. 689.13 s [tasty-smallcheck] [1 of 1] Compiling Test.Tasty.SmallCheck ( Test/Tasty/SmallCheck.hs, dist/build/Test/Tasty/SmallCheck.p_o )
  3500. 689.67 s [hedgehog] Preprocessing test suite 'test' for hedgehog-1.5..
  3501. 689.67 s [hedgehog] Building test suite 'test' for hedgehog-1.5..
  3502. 689.75 s [hedgehog] [1 of 9] Compiling Test.Hedgehog.Applicative ( test/Test/Hedgehog/Applicative.hs, dist/build/test/test-tmp/Test/Hedgehog/Applicative.o )
  3503. 690.60 s [hedgehog] [2 of 9] Compiling Test.Hedgehog.Confidence ( test/Test/Hedgehog/Confidence.hs, dist/build/test/test-tmp/Test/Hedgehog/Confidence.o )
  3504. 690.60 s [hedgehog] [3 of 9] Compiling Test.Hedgehog.Filter ( test/Test/Hedgehog/Filter.hs, dist/build/test/test-tmp/Test/Hedgehog/Filter.o )
  3505. 690.60 s [hedgehog] [4 of 9] Compiling Test.Hedgehog.Maybe ( test/Test/Hedgehog/Maybe.hs, dist/build/test/test-tmp/Test/Hedgehog/Maybe.o )
  3506. 690.60 s [hedgehog] [5 of 9] Compiling Test.Hedgehog.Seed ( test/Test/Hedgehog/Seed.hs, dist/build/test/test-tmp/Test/Hedgehog/Seed.o )
  3507. 690.60 s [hedgehog] [6 of 9] Compiling Test.Hedgehog.Skip ( test/Test/Hedgehog/Skip.hs, dist/build/test/test-tmp/Test/Hedgehog/Skip.o )
  3508. 690.71 s [tasty-smallcheck] Phase: checkPhase
  3509. 690.74 s [tasty-smallcheck] Package has no test suites.
  3510. 690.74 s [tasty-smallcheck] Phase: haddockPhase
  3511. 690.80 s [hedgehog] [7 of 9] Compiling Test.Hedgehog.Text ( test/Test/Hedgehog/Text.hs, dist/build/test/test-tmp/Test/Hedgehog/Text.o )
  3512. 690.80 s [hedgehog] [8 of 9] Compiling Test.Hedgehog.Zip ( test/Test/Hedgehog/Zip.hs, dist/build/test/test-tmp/Test/Hedgehog/Zip.o )
  3513. 690.80 s [hedgehog] [9 of 9] Compiling Main ( test/test.hs, dist/build/test/test-tmp/Main.o )
  3514. 690.88 s [tasty-smallcheck] Preprocessing library for tasty-smallcheck-0.8.2..
  3515. 690.88 s [tasty-smallcheck] Running Haddock on library for tasty-smallcheck-0.8.2..
  3516. 690.93 s [tasty-smallcheck] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  3517. 691.22 s [tasty-smallcheck] Warning: 'Test' is out of scope.
  3518. 691.22 s [tasty-smallcheck] If you qualify the identifier, haddock can try to link it anyway.
  3519. 691.33 s [tasty-smallcheck] 100% ( 15 / 15) in 'Test.Tasty.SmallCheck'
  3520. 691.33 s [hedgehog] [10 of 10] Linking dist/build/test/test
  3521. 691.33 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  3522. 692.20 s [hedgehog] buildPhase completed in 30 seconds
  3523. 692.20 s [hedgehog] Phase: checkPhase
  3524. 692.23 s [hedgehog] Running 1 test suites...
  3525. 692.23 s [hedgehog] Test suite test: RUNNING...
  3526. 692.24 s [hedgehog] ━━━ Test.Hedgehog.Applicative ━━━
  3527. 692.30 s [hedgehog] ✓ prop_StateT_outside passed 100 tests.
  3528. 692.30 s [hedgehog] ✓ 1 succeeded.
  3529. 692.30 s [hedgehog] ━━━ Test.Hedgehog.Confidence ━━━
  3530. 692.32 s [hedgehog] ✓ prop_with_confidence passed 1200 tests.
  3531. 692.32 s [hedgehog] number == 1 27% █████▍·············· ✓ 20%
  3532. 692.32 s [hedgehog] ✓ prop_with_confidence_and_min_tests passed 1000 tests.
  3533. 692.32 s [hedgehog] number == 2 20% ████················ ✓ 10%
  3534. 692.32 s [hedgehog] ✓ 2 succeeded.
  3535. 692.32 s [hedgehog] ━━━ Test.Hedgehog.Filter ━━━
  3536. 692.32 s [hedgehog] ✓ prop_filter_repetition passed 100 tests.
  3537. 692.32 s [hedgehog] ✓ prop_filter_even passed 100 tests.
  3538. 692.32 s [hedgehog] ✓ 2 succeeded.
  3539. 692.32 s [hedgehog] ━━━ Test.Hedgehog.Maybe ━━━
  3540. 692.32 s [hedgehog] ✓ prop_mapMaybe passed 1 test.
  3541. 692.32 s [hedgehog] ✓ 1 succeeded.
  3542. 692.32 s [hedgehog] ━━━ Test.Hedgehog.Seed ━━━
  3543. 692.32 s [hedgehog] ✓ prop_avoid_pathological_gamma_values passed 1 test.
  3544. 692.32 s [hedgehog] ✓ 1 succeeded.
  3545. 692.32 s [hedgehog] ━━━ Test.Hedgehog.Skip ━━━
  3546. 692.33 s [hedgehog] ✓ prop_SkipNothing passed 1 test.
  3547. 692.33 s [hedgehog] ✓ prop_SkipToFailingTest passed 1 test.
  3548. 692.33 s [hedgehog] ✓ prop_SkipPastFailingTest passed 1 test.
  3549. 692.33 s [hedgehog] ✓ prop_SkipToNoShrink passed 1 test.
  3550. 692.33 s [hedgehog] ✓ prop_SkipToFailingShrink passed 1 test.
  3551. 692.33 s [hedgehog] ✓ prop_SkipToPassingShrink passed 1 test.
  3552. 692.33 s [hedgehog] ✓ prop_SkipToReportedShrink passed 1 test.
  3553. 692.34 s [hedgehog] ✓ prop_compressSkip passed 100 tests.
  3554. 692.34 s [hedgehog] ✓ prop_compressDecompressExamples passed 1 test.
  3555. 692.34 s [hedgehog] ✓ 9 succeeded.
  3556. 692.34 s [hedgehog] ━━━ Test.Hedgehog.Text ━━━
  3557. 692.36 s [hedgehog] ✓ prop_show_append_size passed 100 tests.
  3558. 692.36 s [hedgehog] ✓ prop_tripping_append_size passed 100 tests.
  3559. 692.36 s [hedgehog] ✓ prop_show_append_seed passed 100 tests.
  3560. 692.36 s [hedgehog] ✓ prop_tripping_append_seed passed 100 tests.
  3561. 692.36 s [hedgehog] ✓ 4 succeeded.
  3562. 692.36 s [hedgehog] ━━━ Test.Hedgehog.Zip ━━━
  3563. 692.56 s [hedgehog] ✓ prop_gen_applicative passed 100 tests.
  3564. 692.56 s [hedgehog] ✓ 1 succeeded.
  3565. 692.57 s [hedgehog] Test suite test: PASS
  3566. 692.57 s [hedgehog] Test suite logged to: dist/test/hedgehog-1.5-test.log
  3567. 692.57 s [hedgehog] 1 of 1 test suites (1 of 1 test cases) passed.
  3568. 692.58 s [hedgehog] Phase: haddockPhase
  3569. 692.73 s [hedgehog] Preprocessing library for hedgehog-1.5..
  3570. 692.74 s [hedgehog] Running Haddock on library for hedgehog-1.5..
  3571. 692.80 s [hedgehog] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  3572. 693.27 s [hedgehog] 75% ( 3 / 4) in 'Hedgehog.Internal.Barbie'
  3573. 693.27 s [hedgehog] Missing documentation for:
  3574. 693.27 s [hedgehog] Rec
  3575. 693.37 s [hedgehog] 0% ( 0 / 2) in 'Hedgehog.Internal.Distributive'
  3576. 693.37 s [hedgehog] Missing documentation for:
  3577. 693.37 s [hedgehog] Module header
  3578. 693.37 s [hedgehog] MonadTransDistributive (src/Hedgehog/Internal/Distributive.hs:31)
  3579. 693.51 s [hedgehog] 0% ( 0 / 3) in 'Hedgehog.Internal.Exception'
  3580. 693.51 s [hedgehog] Missing documentation for:
  3581. 693.51 s [hedgehog] Module header
  3582. 693.51 s [hedgehog] tryAll (src/Hedgehog/Internal/Exception.hs:13)
  3583. 693.51 s [hedgehog] tryEvaluate (src/Hedgehog/Internal/Exception.hs:22)
  3584. 693.59 s [hedgehog] 50% ( 1 / 2) in 'Hedgehog.Internal.HTraversable'
  3585. 693.59 s [hedgehog] Missing documentation for:
  3586. 693.59 s [hedgehog] Module header
  3587. 693.60 s [hedgehog] 50% ( 1 / 2) in 'Hedgehog.Internal.Opaque'
  3588. 693.60 s [hedgehog] Missing documentation for:
  3589. 693.60 s [hedgehog] Module header
  3590. 693.66 s [hedgehog] 97% (135 /139) in 'Hedgehog.Internal.Prelude'
  3591. 693.66 s [hedgehog] Missing documentation for:
  3592. 693.66 s [hedgehog] Bool
  3593. 693.66 s [hedgehog] Ordering
  3594. 693.66 s [hedgehog] even
  3595. 693.66 s [hedgehog] odd
  3596. 693.81 s [hedgehog] 96% ( 32 / 33) in 'Hedgehog.Internal.Range'
  3597. 693.81 s [hedgehog] Missing documentation for:
  3598. 693.81 s [hedgehog] Module header
  3599. 694.04 s [hedgehog] 0% ( 0 / 10) in 'Hedgehog.Internal.Region'
  3600. 694.04 s [hedgehog] Missing documentation for:
  3601. 694.04 s [hedgehog] Module header
  3602. 694.04 s [hedgehog] Region (src/Hedgehog/Internal/Region.hs:29)
  3603. 694.04 s [hedgehog] newEmptyRegion (src/Hedgehog/Internal/Region.hs:34)
  3604. 694.04 s [hedgehog] newOpenRegion (src/Hedgehog/Internal/Region.hs:40)
  3605. 694.04 s [hedgehog] openRegion (src/Hedgehog/Internal/Region.hs:47)
  3606. 694.04 s [hedgehog] setRegion (src/Hedgehog/Internal/Region.hs:63)
  3607. 694.04 s [hedgehog] displayRegions (src/Hedgehog/Internal/Region.hs:77)
  3608. 694.04 s [hedgehog] displayRegion (src/Hedgehog/Internal/Region.hs:81)
  3609. 694.04 s [hedgehog] moveToBottom (src/Hedgehog/Internal/Region.hs:90)
  3610. 694.04 s [hedgehog] finishRegion (src/Hedgehog/Internal/Region.hs:114)
  3611. 694.19 s [hedgehog] 70% ( 12 / 17) in 'Hedgehog.Internal.Seed'
  3612. 694.19 s [hedgehog] Missing documentation for:
  3613. 694.19 s [hedgehog] mix64 (src/Hedgehog/Internal/Seed.hs:176)
  3614. 694.19 s [hedgehog] mix64variant13 (src/Hedgehog/Internal/Seed.hs:192)
  3615. 694.19 s [hedgehog] mix32 (src/Hedgehog/Internal/Seed.hs:184)
  3616. 694.19 s [hedgehog] mixGamma (src/Hedgehog/Internal/Seed.hs:200)
  3617. 694.19 s [hedgehog] global (src/Hedgehog/Internal/Seed.hs:96)
  3618. 694.32 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  3619. 694.38 s [hedgehog] 13% ( 2 / 15) in 'Hedgehog.Internal.Show'
  3620. 694.38 s [hedgehog] Missing documentation for:
  3621. 694.38 s [hedgehog] Module header
  3622. 694.38 s [hedgehog] ValueDiff (src/Hedgehog/Internal/Show.hs:30)
  3623. 694.38 s [hedgehog] LineDiff (src/Hedgehog/Internal/Show.hs:39)
  3624. 694.38 s [hedgehog] mkValue (src/Hedgehog/Internal/Show.hs:73)
  3625. 694.38 s [hedgehog] showPretty (src/Hedgehog/Internal/Show.hs:77)
  3626. 694.38 s [hedgehog] valueDiff (src/Hedgehog/Internal/Show.hs:92)
  3627. 694.38 s [hedgehog] lineDiff (src/Hedgehog/Internal/Show.hs:81)
  3628. 694.38 s [hedgehog] toLineDiff (src/Hedgehog/Internal/Show.hs:85)
  3629. 694.38 s [hedgehog] renderValue (src/Hedgehog/Internal/Show.hs:54)
  3630. 694.38 s [hedgehog] renderValueDiff (src/Hedgehog/Internal/Show.hs:58)
  3631. 694.38 s [hedgehog] renderLineDiff (src/Hedgehog/Internal/Show.hs:64)
  3632. 694.38 s [hedgehog] takeLeft (src/Hedgehog/Internal/Show.hs:126)
  3633. 694.38 s [hedgehog] takeRight (src/Hedgehog/Internal/Show.hs:141)
  3634. 694.75 s [hedgehog] Warning: 'k' is out of scope.
  3635. 694.75 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3636. 694.75 s [hedgehog] 85% ( 6 / 7) in 'Hedgehog.Internal.Shrink'
  3637. 694.75 s [hedgehog] Missing documentation for:
  3638. 694.75 s [hedgehog] Module header
  3639. 694.77 s [tasty-smallcheck] Documentation created: dist/doc/html/tasty-smallcheck/index.html,
  3640. 694.77 s [tasty-smallcheck] dist/doc/html/tasty-smallcheck/tasty-smallcheck.txt
  3641. 694.83 s [tasty-smallcheck] Phase: installPhase
  3642. 694.84 s [hedgehog] 50% ( 5 / 10) in 'Hedgehog.Internal.Source'
  3643. 694.84 s [hedgehog] Missing documentation for:
  3644. 694.84 s [hedgehog] Module header
  3645. 694.84 s [hedgehog] LineNo (src/Hedgehog/Internal/Source.hs:24)
  3646. 694.84 s [hedgehog] ColumnNo (src/Hedgehog/Internal/Source.hs:29)
  3647. 694.84 s [hedgehog] Span (src/Hedgehog/Internal/Source.hs:34)
  3648. 694.84 s [hedgehog] getCaller (src/Hedgehog/Internal/Source.hs:43)
  3649. 694.87 s [tasty-smallcheck] Installing library in /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  3650. 695.07 s [tasty-smallcheck] Phase: fixupPhase
  3651. 695.09 s [tasty-smallcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2
  3652. 695.09 s [tasty-smallcheck] shrinking /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHStasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl-ghc9.6.3.so
  3653. 695.10 s [tasty-smallcheck] checking for references to /build/ in /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2...
  3654. 695.11 s [tasty-smallcheck] patching script interpreter paths in /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2
  3655. 695.11 s [hedgehog] Warning: 'Node' is ambiguous. It is defined
  3656. 695.11 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:125:1
  3657. 695.11 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:116:1
  3658. 695.11 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  3659. 695.11 s [hedgehog] by specifying the type/value namespace explicitly.
  3660. 695.11 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:116:1
  3661. 695.11 s [hedgehog] Warning: 'Tree' is ambiguous. It is defined
  3662. 695.11 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:95:1
  3663. 695.11 s [hedgehog] * at src/Hedgehog/Internal/Tree.hs:89:1
  3664. 695.11 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  3665. 695.11 s [hedgehog] by specifying the type/value namespace explicitly.
  3666. 695.11 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Tree.hs:89:1
  3667. 695.11 s [tasty-smallcheck] stripping (with command strip and flags -S -p) in /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2/lib
  3668. 695.12 s [hedgehog] 78% ( 22 / 28) in 'Hedgehog.Internal.Tree'
  3669. 695.12 s [hedgehog] Missing documentation for:
  3670. 695.12 s [hedgehog] Module header
  3671. 695.12 s [hedgehog] mapMaybe (src/Hedgehog/Internal/Tree.hs:256)
  3672. 695.12 s [hedgehog] mapMaybeMaybeT (src/Hedgehog/Internal/Tree.hs:276)
  3673. 695.12 s [hedgehog] consChild (src/Hedgehog/Internal/Tree.hs:324)
  3674. 695.12 s [hedgehog] mapMaybeT (src/Hedgehog/Internal/Tree.hs:313)
  3675. 695.12 s [hedgehog] interleave (src/Hedgehog/Internal/Tree.hs:387)
  3676. 695.15 s [tasty-smallcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc
  3677. 695.15 s [tasty-smallcheck] checking for references to /build/ in /nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc...
  3678. 695.16 s [tasty-smallcheck] patching script interpreter paths in /nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc
  3679. 695.26 s [tasty-smallcheck:post-build] Uploading to cachix cache "sellout": /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2 /nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc
  3680. 695.84 s [tasty-smallcheck:post-build] Pushing 2 paths (89 are already present) using zstd to cache sellout ⏳
  3681. 695.84 s [tasty-smallcheck:post-build]
  3682. 696.22 s [tasty-smallcheck:post-build] Pushing /nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc (272.72 KiB)
  3683. 696.28 s [tasty-smallcheck:post-build] Pushing /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2 (360.51 KiB)
  3684. 697.82 s [tasty-smallcheck:post-build]
  3685. 697.82 s [tasty-smallcheck:post-build] All done.
  3686. 697.87 s [tasty-smallcheck:post-build] Uploading to the NixCI cache: /nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2 /nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc
  3687. 697.92 s [tasty-smallcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3688. 698.18 s [tasty-smallcheck:post-build] copying 2 paths...
  3689. 698.18 s [tasty-smallcheck:post-build] copying path '/nix/store/f5m8pbm6w2q0jcsvlgsilmccs3rwcg04-tasty-smallcheck-0.8.2-doc' to 'https://cache.nix-ci.com'...
  3690. 698.52 s [tasty-smallcheck:post-build] copying path '/nix/store/6szzj1lnsr4mcz5gk8dp304lzj3pvq4f-tasty-smallcheck-0.8.2' to 'https://cache.nix-ci.com'...
  3691. 698.93 s [tasty-smallcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3692. 699.21 s [tasty-smallcheck:post-build] copying 1 paths...
  3693. 699.21 s [tasty-smallcheck:post-build] copying path '/nix/store/1v8zxzpnz7cdhkkhxhni0pcjqdzpzgiy-tasty-smallcheck-0.8.2.drv' to 'https://cache.nix-ci.com'...
  3694. 699.45 s Progress: 97 of 114 built (2 building), 172 of 172 downloaded from cache
  3695. 699.50 s Building /nix/store/v80kzj4lckw5hp79f52cs1ymdfhjaxzj-integer-logarithms-1.0.4.drv
  3696. 699.50 s [hedgehog] 66% ( 2 / 3) in 'Hedgehog.Main'
  3697. 699.50 s [hedgehog] Missing documentation for:
  3698. 699.50 s [hedgehog] Module header
  3699. 699.50 s [hedgehog] 96% ( 25 / 26) in 'Hedgehog.Range'
  3700. 699.50 s [hedgehog] Missing documentation for:
  3701. 699.50 s [hedgehog] Module header
  3702. 699.50 s [hedgehog] Warning: 'mfilter' is out of scope.
  3703. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3704. 699.50 s [hedgehog] Warning: 'a' is out of scope.
  3705. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3706. 699.50 s [hedgehog] Warning: 'b' is out of scope.
  3707. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3708. 699.50 s [hedgehog] Warning: 'n' is out of scope.
  3709. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3710. 699.50 s [hedgehog] Warning: 'withTests' is out of scope.
  3711. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3712. 699.50 s [hedgehog] Warning: 'property' is out of scope.
  3713. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3714. 699.50 s [hedgehog] 97% (124 /127) in 'Hedgehog.Internal.Gen'
  3715. 699.50 s [hedgehog] Missing documentation for:
  3716. 699.50 s [hedgehog] Module header
  3717. 699.50 s [hedgehog] Vec (src/Hedgehog/Internal/Gen.hs:1609)
  3718. 699.50 s [hedgehog] Nat (src/Hedgehog/Internal/Gen.hs:1605)
  3719. 699.50 s [hedgehog] Warning: 'OverloadedStrings' is out of scope.
  3720. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3721. 699.50 s [hedgehog] Warning: 'Class' is out of scope.
  3722. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3723. 699.50 s [hedgehog] Warning: 'r' is out of scope.
  3724. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3725. 699.50 s [hedgehog] Warning: 'Label' is ambiguous. It is defined
  3726. 699.50 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:593:5
  3727. 699.50 s [hedgehog] * at src/Hedgehog/Internal/Property.hs:672:1
  3728. 699.50 s [hedgehog] You may be able to disambiguate the identifier by qualifying it or
  3729. 699.50 s [hedgehog] by specifying the type/value namespace explicitly.
  3730. 699.50 s [hedgehog] Defaulting to the one defined at src/Hedgehog/Internal/Property.hs:590:1
  3731. 699.50 s [hedgehog] Warning: 'ClassifierName' is out of scope.
  3732. 699.50 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3733. 699.50 s [hedgehog] 86% ( 87 /101) in 'Hedgehog.Internal.Property'
  3734. 699.50 s [hedgehog] Missing documentation for:
  3735. 699.50 s [hedgehog] Module header
  3736. 699.50 s [hedgehog] MonadTest (src/Hedgehog/Internal/Property.hs:766)
  3737. 699.50 s [hedgehog] coverPercentage (src/Hedgehog/Internal/Property.hs:1341)
  3738. 699.50 s [hedgehog] labelCovered (src/Hedgehog/Internal/Property.hs:1354)
  3739. 699.50 s [hedgehog] coverageFailures (src/Hedgehog/Internal/Property.hs:1363)
  3740. 699.50 s [hedgehog] journalCoverage (src/Hedgehog/Internal/Property.hs:1440)
  3741. 699.50 s [hedgehog] toCoverCount (src/Hedgehog/Internal/Property.hs:1316)
  3742. 699.50 s [hedgehog] TerminationCriteria (src/Hedgehog/Internal/Property.hs:576)
  3743. 699.50 s [hedgehog] verifiedTermination (src/Hedgehog/Internal/Property.hs:1227)
  3744. 699.50 s [hedgehog] mkTest (src/Hedgehog/Internal/Property.hs:825)
  3745. 699.50 s [hedgehog] mkTestT (src/Hedgehog/Internal/Property.hs:821)
  3746. 699.50 s [hedgehog] runTest (src/Hedgehog/Internal/Property.hs:833)
  3747. 699.50 s [hedgehog] runTestT (src/Hedgehog/Internal/Property.hs:829)
  3748. 699.50 s [hedgehog] wilsonBounds (src/Hedgehog/Internal/Property.hs:1402)
  3749. 699.50 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  3750. 699.50 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  3751. 699.62 s [integer-logarithms] Phase: setupCompilerEnvironmentPhase
  3752. 699.62 s [integer-logarithms] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  3753. 699.81 s [integer-logarithms] Phase: unpackPhase
  3754. 699.81 s [integer-logarithms] unpacking source archive /nix/store/ph0i5ssdxwdx25fp5i1sbmq6177nxsr9-integer-logarithms-1.0.4.tar.gz
  3755. 699.82 s [integer-logarithms] source root is integer-logarithms-1.0.4
  3756. 699.83 s [integer-logarithms] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "integer-logarithms-1.0.4/test-suite/Test.hs"
  3757. 699.83 s [integer-logarithms] Phase: patchPhase
  3758. 699.84 s [integer-logarithms] Phase: compileBuildDriverPhase
  3759. 699.84 s [integer-logarithms] setupCompileFlags: -package-db=/build/tmp.Q6thEV7uko/setup-package.conf.d -threaded
  3760. 699.90 s [integer-logarithms] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Q6thEV7uko/Main.o )
  3761. 699.97 s [integer-logarithms] [2 of 2] Linking Setup
  3762. 700.08 s [hedgehog] 50% ( 1 / 2) in 'Hedgehog.Internal.Tripping'
  3763. 700.08 s [hedgehog] Missing documentation for:
  3764. 700.08 s [hedgehog] Module header
  3765. 700.18 s [hedgehog] 96% ( 31 / 32) in 'Hedgehog.Internal.State'
  3766. 700.18 s [hedgehog] Missing documentation for:
  3767. 700.18 s [hedgehog] Module header
  3768. 700.44 s [hedgehog] 0% ( 0 / 7) in 'Hedgehog.Internal.Discovery'
  3769. 700.44 s [hedgehog] Missing documentation for:
  3770. 700.44 s [hedgehog] Module header
  3771. 700.44 s [hedgehog] PropertySource (src/Hedgehog/Internal/Discovery.hs:35)
  3772. 700.44 s [hedgehog] readProperties (src/Hedgehog/Internal/Discovery.hs:40)
  3773. 700.44 s [hedgehog] findProperties (src/Hedgehog/Internal/Discovery.hs:66)
  3774. 700.44 s [hedgehog] readDeclaration (src/Hedgehog/Internal/Discovery.hs:44)
  3775. 700.44 s [hedgehog] Pos (src/Hedgehog/Internal/Discovery.hs:209)
  3776. 700.44 s [hedgehog] Position (src/Hedgehog/Internal/Discovery.hs:202)
  3777. 700.72 s [hedgehog] Warning: 'prop_' is out of scope.
  3778. 700.72 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3779. 700.72 s [hedgehog] 25% ( 1 / 4) in 'Hedgehog.Internal.TH'
  3780. 700.72 s [hedgehog] Missing documentation for:
  3781. 700.72 s [hedgehog] Module header
  3782. 700.72 s [hedgehog] TExpQ (src/Hedgehog/Internal/TH.hs:30)
  3783. 700.72 s [hedgehog] discoverPrefix (src/Hedgehog/Internal/TH.hs:50)
  3784. 700.75 s [hedgehog] 29% ( 5 / 17) in 'Hedgehog.Internal.Config'
  3785. 700.75 s [hedgehog] Missing documentation for:
  3786. 700.75 s [hedgehog] Module header
  3787. 700.75 s [hedgehog] resolveColor (src/Hedgehog/Internal/Config.hs:190)
  3788. 700.75 s [hedgehog] resolveSeed (src/Hedgehog/Internal/Config.hs:197)
  3789. 700.75 s [hedgehog] resolveVerbosity (src/Hedgehog/Internal/Config.hs:204)
  3790. 700.75 s [hedgehog] resolveWorkers (src/Hedgehog/Internal/Config.hs:211)
  3791. 700.75 s [hedgehog] resolveSkip (src/Hedgehog/Internal/Config.hs:218)
  3792. 700.75 s [hedgehog] detectMark (src/Hedgehog/Internal/Config.hs:75)
  3793. 700.75 s [hedgehog] detectColor (src/Hedgehog/Internal/Config.hs:102)
  3794. 700.75 s [hedgehog] detectSeed (src/Hedgehog/Internal/Config.hs:136)
  3795. 700.75 s [hedgehog] detectVerbosity (src/Hedgehog/Internal/Config.hs:146)
  3796. 700.75 s [hedgehog] detectWorkers (src/Hedgehog/Internal/Config.hs:164)
  3797. 700.75 s [hedgehog] detectSkip (src/Hedgehog/Internal/Config.hs:174)
  3798. 701.06 s [hedgehog] 26% ( 7 / 26) in 'Hedgehog.Internal.Report'
  3799. 701.06 s [hedgehog] Missing documentation for:
  3800. 701.06 s [hedgehog] Module header
  3801. 701.06 s [hedgehog] FailureReport (src/Hedgehog/Internal/Report.hs:100)
  3802. 701.06 s [hedgehog] FailedAnnotation (src/Hedgehog/Internal/Report.hs:94)
  3803. 701.06 s [hedgehog] Style (src/Hedgehog/Internal/Report.hs:205)
  3804. 701.06 s [hedgehog] Markup (src/Hedgehog/Internal/Report.hs:211)
  3805. 701.06 s [hedgehog] Config (src/Hedgehog/Internal/Report.hs:1316)
  3806. 701.06 s [hedgehog] defaultConfig (src/Hedgehog/Internal/Report.hs:1334)
  3807. 701.06 s [hedgehog] Context (src/Hedgehog/Internal/Report.hs:573)
  3808. 701.06 s [hedgehog] Lines (src/Hedgehog/Internal/Report.hs:567)
  3809. 701.06 s [hedgehog] renderProgress (src/Hedgehog/Internal/Report.hs:1309)
  3810. 701.06 s [hedgehog] renderResult (src/Hedgehog/Internal/Report.hs:1313)
  3811. 701.06 s [hedgehog] renderResultWith (src/Hedgehog/Internal/Report.hs:1337)
  3812. 701.06 s [hedgehog] renderSummary (src/Hedgehog/Internal/Report.hs:1341)
  3813. 701.06 s [hedgehog] renderDoc (src/Hedgehog/Internal/Report.hs:1189)
  3814. 701.06 s [hedgehog] ppProgress (src/Hedgehog/Internal/Report.hs:799)
  3815. 701.06 s [hedgehog] ppResult (src/Hedgehog/Internal/Report.hs:822)
  3816. 701.06 s [hedgehog] ppResultWith (src/Hedgehog/Internal/Report.hs:825)
  3817. 701.06 s [hedgehog] ppSummary (src/Hedgehog/Internal/Report.hs:1147)
  3818. 701.06 s [hedgehog] mkFailure (src/Hedgehog/Internal/Report.hs:277)
  3819. 701.26 s [integer-logarithms] Phase: updateAutotoolsGnuConfigScriptsPhase
  3820. 701.27 s [integer-logarithms] Phase: configurePhase
  3821. 701.28 s [integer-logarithms] configureFlags: --verbose --prefix=/nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc/share/doc/integer-logarithms-1.0.4 --with-gcc=gcc --package-db=/build/tmp.Q6thEV7uko/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  3822. 701.28 s [integer-logarithms] Using Parsec parser
  3823. 701.28 s [integer-logarithms] Configuring integer-logarithms-1.0.4...
  3824. 701.63 s [integer-logarithms] Flags chosen: check-bounds=False, integer-gmp=True
  3825. 701.72 s [integer-logarithms] Dependency array >=0.5.3.0 && <0.6: using array-0.5.5.0
  3826. 701.72 s [integer-logarithms] Dependency base >=4.15 && <4.22: using base-4.18.1.0
  3827. 701.72 s [integer-logarithms] Dependency ghc-bignum >=1.0 && <1.4: using ghc-bignum-1.3
  3828. 701.72 s [integer-logarithms] Dependency ghc-prim <0.14: using ghc-prim-0.10.0
  3829. 701.72 s [integer-logarithms] Dependency QuickCheck >=2.14.1 && <2.16: using QuickCheck-2.14.3
  3830. 701.72 s [integer-logarithms] Dependency base: using base-4.18.1.0
  3831. 701.72 s [integer-logarithms] Dependency integer-logarithms: using integer-logarithms-1.0.4
  3832. 701.72 s [integer-logarithms] Dependency smallcheck >=1.2 && <1.3: using smallcheck-1.2.1.1
  3833. 701.72 s [integer-logarithms] Dependency tasty >=1.4 && <1.6: using tasty-1.5.3
  3834. 701.72 s [integer-logarithms] Dependency tasty-hunit >=0.10 && <0.11: using tasty-hunit-0.10.2
  3835. 701.72 s [integer-logarithms] Dependency tasty-quickcheck >=0.10 && <0.12: using tasty-quickcheck-0.11
  3836. 701.72 s [integer-logarithms] Dependency tasty-smallcheck >=0.8 && <0.9: using tasty-smallcheck-0.8.2
  3837. 701.91 s [integer-logarithms] Source component graph:
  3838. 701.91 s [integer-logarithms] component lib
  3839. 701.91 s [integer-logarithms] component test:spec dependency lib
  3840. 701.91 s [integer-logarithms] Configured component graph:
  3841. 701.91 s [integer-logarithms] component integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  3842. 701.91 s [integer-logarithms] include array-0.5.5.0
  3843. 701.91 s [integer-logarithms] include base-4.18.1.0
  3844. 701.91 s [integer-logarithms] include ghc-bignum-1.3
  3845. 701.91 s [integer-logarithms] include ghc-prim-0.10.0
  3846. 701.91 s [integer-logarithms] component integer-logarithms-1.0.4-L9gwhkdKdCAC5sl2EwjooB-spec
  3847. 701.91 s [integer-logarithms] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  3848. 701.91 s [integer-logarithms] include base-4.18.1.0
  3849. 701.91 s [integer-logarithms] include integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  3850. 701.91 s [integer-logarithms] include smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3851. 701.91 s [integer-logarithms] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  3852. 701.91 s [integer-logarithms] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  3853. 701.91 s [integer-logarithms] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  3854. 701.91 s [integer-logarithms] include tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  3855. 701.91 s [integer-logarithms] Linked component graph:
  3856. 701.91 s [integer-logarithms] unit integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  3857. 701.91 s [integer-logarithms] include array-0.5.5.0
  3858. 701.91 s [integer-logarithms] include base-4.18.1.0
  3859. 701.91 s [integer-logarithms] include ghc-bignum-1.3
  3860. 701.91 s [integer-logarithms] include ghc-prim-0.10.0
  3861. 701.91 s [integer-logarithms] GHC.Integer.Logarithms.Compat=integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1:GHC.Integer.Logarithms.Compat,Math.NumberTheory.Logarithms=integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1:Math.NumberTheory.Logarithms,Math.NumberTheory.Powers.Integer=integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1:Math.NumberTheory.Powers.Integer,Math.NumberTheory.Powers.Natural=integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1:Math.NumberTheory.Powers.Natural
  3862. 701.91 s [integer-logarithms] unit integer-logarithms-1.0.4-L9gwhkdKdCAC5sl2EwjooB-spec
  3863. 701.91 s [integer-logarithms] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  3864. 701.91 s [integer-logarithms] include base-4.18.1.0
  3865. 701.91 s [integer-logarithms] include integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  3866. 701.91 s [integer-logarithms] include smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3867. 701.91 s [integer-logarithms] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  3868. 701.91 s [integer-logarithms] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  3869. 701.91 s [integer-logarithms] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  3870. 701.91 s [integer-logarithms] include tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  3871. 701.91 s [integer-logarithms] Ready component graph:
  3872. 701.91 s [integer-logarithms] definite integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  3873. 701.91 s [integer-logarithms] depends array-0.5.5.0
  3874. 701.91 s [integer-logarithms] depends base-4.18.1.0
  3875. 701.91 s [integer-logarithms] depends ghc-bignum-1.3
  3876. 701.91 s [integer-logarithms] depends ghc-prim-0.10.0
  3877. 701.91 s [integer-logarithms] definite integer-logarithms-1.0.4-L9gwhkdKdCAC5sl2EwjooB-spec
  3878. 701.91 s [integer-logarithms] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  3879. 701.91 s [integer-logarithms] depends base-4.18.1.0
  3880. 701.91 s [integer-logarithms] depends integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  3881. 701.91 s [integer-logarithms] depends smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  3882. 701.91 s [integer-logarithms] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  3883. 701.91 s [integer-logarithms] depends tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  3884. 701.91 s [integer-logarithms] depends tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  3885. 701.91 s [integer-logarithms] depends tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  3886. 701.91 s [integer-logarithms] Using Cabal-3.10.1.0 compiled by ghc-9.6
  3887. 701.91 s [integer-logarithms] Using compiler: ghc-9.6.3
  3888. 701.91 s [integer-logarithms] Using install prefix:
  3889. 701.91 s [integer-logarithms] /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4
  3890. 701.91 s [integer-logarithms] Executables installed in:
  3891. 701.91 s [integer-logarithms] /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/bin
  3892. 701.91 s [integer-logarithms] Libraries installed in:
  3893. 701.91 s [integer-logarithms] /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  3894. 701.91 s [integer-logarithms] Dynamic Libraries installed in:
  3895. 701.91 s [integer-logarithms] /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  3896. 701.91 s [integer-logarithms] Private executables installed in:
  3897. 701.91 s [integer-logarithms] /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/libexec/x86_64-linux-ghc-9.6.3/integer-logarithms-1.0.4
  3898. 701.91 s [integer-logarithms] Data files installed in:
  3899. 701.91 s [integer-logarithms] /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/share/x86_64-linux-ghc-9.6.3/integer-logarithms-1.0.4
  3900. 701.91 s [integer-logarithms] Documentation installed in:
  3901. 701.91 s [integer-logarithms] /nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc/share/doc/integer-logarithms-1.0.4
  3902. 701.91 s [integer-logarithms] Configuration files installed in:
  3903. 701.91 s [integer-logarithms] /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/etc
  3904. 701.91 s [integer-logarithms] No alex found
  3905. 701.91 s [integer-logarithms] Using ar found on system at:
  3906. 701.91 s [integer-logarithms] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  3907. 701.91 s [integer-logarithms] No c2hs found
  3908. 701.91 s [integer-logarithms] No cpphs found
  3909. 701.91 s [integer-logarithms] No doctest found
  3910. 701.91 s [integer-logarithms] Using gcc version 14.3.0 given by user at:
  3911. 701.91 s [integer-logarithms] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  3912. 701.91 s [integer-logarithms] Using ghc version 9.6.3 found on system at:
  3913. 701.91 s [integer-logarithms] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  3914. 701.91 s [integer-logarithms] Using ghc-pkg version 9.6.3 found on system at:
  3915. 701.91 s [integer-logarithms] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  3916. 701.91 s [integer-logarithms] No ghcjs found
  3917. 701.91 s [integer-logarithms] No ghcjs-pkg found
  3918. 701.91 s [integer-logarithms] No greencard found
  3919. 701.91 s [integer-logarithms] Using haddock version 2.29.1 found on system at:
  3920. 701.91 s [integer-logarithms] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  3921. 701.91 s [integer-logarithms] No happy found
  3922. 701.91 s [integer-logarithms] Using haskell-suite found on system at: haskell-suite-dummy-location
  3923. 701.91 s [integer-logarithms] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3924. 701.91 s [integer-logarithms] No hmake found
  3925. 701.91 s [integer-logarithms] Using hpc version 0.68 found on system at:
  3926. 701.91 s [integer-logarithms] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  3927. 701.91 s [integer-logarithms] Using hsc2hs version 0.68.9 found on system at:
  3928. 701.91 s [integer-logarithms] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  3929. 701.91 s [integer-logarithms] Using hscolour version 1.25 found on system at:
  3930. 701.91 s [integer-logarithms] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  3931. 701.91 s [integer-logarithms] No jhc found
  3932. 701.91 s [integer-logarithms] Using ld found on system at:
  3933. 701.91 s [integer-logarithms] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  3934. 701.91 s [integer-logarithms] No pkg-config found
  3935. 701.91 s [integer-logarithms] Using runghc version 9.6.3 found on system at:
  3936. 701.91 s [integer-logarithms] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  3937. 701.91 s [integer-logarithms] Using strip version 2.44 found on system at:
  3938. 701.91 s [integer-logarithms] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  3939. 701.91 s [integer-logarithms] Using tar found on system at:
  3940. 701.91 s [integer-logarithms] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  3941. 701.91 s [integer-logarithms] No uhc found
  3942. 702.03 s [integer-logarithms] Phase: buildPhase
  3943. 702.08 s [integer-logarithms] Preprocessing library for integer-logarithms-1.0.4..
  3944. 702.09 s [integer-logarithms] Building library for integer-logarithms-1.0.4..
  3945. 702.19 s [integer-logarithms] [1 of 4] Compiling GHC.Integer.Logarithms.Compat ( src/GHC/Integer/Logarithms/Compat.hs, dist/build/GHC/Integer/Logarithms/Compat.o, dist/build/GHC/Integer/Logarithms/Compat.dyn_o )
  3946. 702.28 s [integer-logarithms] [2 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, dist/build/Math/NumberTheory/Logarithms.o, dist/build/Math/NumberTheory/Logarithms.dyn_o )
  3947. 702.40 s [hedgehog] 12% ( 1 / 8) in 'Hedgehog.Internal.Queue'
  3948. 702.40 s [hedgehog] Missing documentation for:
  3949. 702.40 s [hedgehog] Module header
  3950. 702.40 s [hedgehog] TaskIndex (src/Hedgehog/Internal/Queue.hs:32)
  3951. 702.40 s [hedgehog] TasksRemaining (src/Hedgehog/Internal/Queue.hs:36)
  3952. 702.40 s [hedgehog] runTasks (src/Hedgehog/Internal/Queue.hs:51)
  3953. 702.40 s [hedgehog] finalizeTask (src/Hedgehog/Internal/Queue.hs:101)
  3954. 702.40 s [hedgehog] runActiveFinalizers (src/Hedgehog/Internal/Queue.hs:79)
  3955. 702.40 s [hedgehog] dequeueMVar (src/Hedgehog/Internal/Queue.hs:39)
  3956. 702.54 s [hedgehog] 64% ( 9 / 14) in 'Hedgehog.Internal.Runner'
  3957. 702.54 s [hedgehog] Missing documentation for:
  3958. 702.54 s [hedgehog] Module header
  3959. 702.54 s [hedgehog] recheckAt (src/Hedgehog/Internal/Runner.hs:441)
  3960. 702.54 s [hedgehog] checkReport (src/Hedgehog/Internal/Runner.hs:205)
  3961. 702.54 s [hedgehog] checkRegion (src/Hedgehog/Internal/Runner.hs:380)
  3962. 702.54 s [hedgehog] checkNamed (src/Hedgehog/Internal/Runner.hs:411)
  3963. 702.60 s [hedgehog] 98% ( 93 / 94) in 'Hedgehog.Gen'
  3964. 702.60 s [hedgehog] Missing documentation for:
  3965. 702.60 s [hedgehog] Module header
  3966. 702.60 s [hedgehog] Warning: 'DeriveGeneric' is out of scope.
  3967. 702.60 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3968. 702.60 s [hedgehog] Warning: 'DeriveAnyClass' is out of scope.
  3969. 702.60 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3970. 702.60 s [hedgehog] Warning: 'DerivingStrategies' is out of scope.
  3971. 702.60 s [hedgehog] If you qualify the identifier, haddock can try to link it anyway.
  3972. 702.60 s [hedgehog] 94% ( 93 / 98) in 'Hedgehog'
  3973. 702.60 s [hedgehog] Missing documentation for:
  3974. 702.60 s [hedgehog] recheckAt (src/Hedgehog/Internal/Runner.hs:441)
  3975. 702.60 s [hedgehog] discoverPrefix (src/Hedgehog/Internal/TH.hs:50)
  3976. 702.60 s [hedgehog] verifiedTermination (src/Hedgehog/Internal/Property.hs:1227)
  3977. 702.60 s [hedgehog] MonadTest (src/Hedgehog/Internal/Property.hs:766)
  3978. 702.60 s [hedgehog] Rec
  3979. 702.74 s [hedgehog] Warning: Hedgehog.Internal.Barbie: could not find link destinations for:
  3980. 702.74 s [hedgehog] - Barbies.Generics.Constraints.P
  3981. 702.74 s [hedgehog] - Barbies.Generics.Constraints.GAllRec
  3982. 703.26 s [hedgehog] Warning: Hedgehog.Internal.Prelude: could not find link destinations for:
  3983. 703.26 s [hedgehog] - GHC.Prim.~#
  3984. 703.26 s [hedgehog] - Data.Functor.Utils.StateT
  3985. 703.26 s [hedgehog] - Data.Functor.Utils.StateR
  3986. 703.26 s [hedgehog] - Data.Functor.Utils.StateL
  3987. 703.26 s [hedgehog] - Data.Functor.Utils.Min
  3988. 703.26 s [hedgehog] - Data.Functor.Utils.Max
  3989. 703.26 s [hedgehog] - GHC.Generics.SingKind
  3990. 703.26 s [hedgehog] - GHC.Generics.DemoteRep
  3991. 703.26 s [hedgehog] - GHC.Generics.fromSing
  3992. 703.26 s [hedgehog] - GHC.Generics.SingI
  3993. 703.26 s [hedgehog] - GHC.Generics.sing
  3994. 703.26 s [hedgehog] - GHC.Generics.Sing
  3995. 703.26 s [hedgehog] - GHC.Generics.D:R:UReckWordp0
  3996. 703.26 s [hedgehog] - GHC.Generics.D:R:UReckIntp0
  3997. 703.26 s [hedgehog] - GHC.Generics.D:R:UReckFloatp0
  3998. 703.26 s [hedgehog] - GHC.Generics.D:R:UReckDoublep0
  3999. 703.26 s [hedgehog] - GHC.Generics.D:R:UReckCharp0
  4000. 703.26 s [hedgehog] - Text.ParserCombinators.ReadP.P
  4001. 703.26 s [hedgehog] - GHC.Generics.D:R:SingBoola0
  4002. 703.26 s [hedgehog] - GHC.Generics.STrue
  4003. 703.26 s [hedgehog] - GHC.Generics.SFalse
  4004. 703.26 s [hedgehog] - GHC.Generics.D:R:SingMaybeb0
  4005. 703.26 s [hedgehog] - GHC.Generics.SNothing
  4006. 703.26 s [hedgehog] - GHC.Generics.SJust
  4007. 703.26 s [hedgehog] - System.Console.Regions.LineUpdate
  4008. 703.26 s [hedgehog] - Data.Set.Internal.MergeSet
  4009. 703.26 s [hedgehog] - Text.Printf.UPrintf
  4010. 703.26 s [hedgehog] - Text.Printf.hspr
  4011. 703.26 s [hedgehog] - Text.Printf.spr
  4012. 703.26 s [hedgehog] Warning: Hedgehog.Internal.Region: could not find link destinations for:
  4013. 703.26 s [hedgehog] - Hedgehog.Internal.Region.Body
  4014. 703.31 s [hedgehog] Warning: Hedgehog.Internal.State: could not find link destinations for:
  4015. 703.31 s [hedgehog] - Hedgehog.Internal.State.Context
  4016. 703.33 s [integer-logarithms] [3 of 4] Compiling Math.NumberTheory.Powers.Integer ( src/Math/NumberTheory/Powers/Integer.hs, dist/build/Math/NumberTheory/Powers/Integer.o, dist/build/Math/NumberTheory/Powers/Integer.dyn_o )
  4017. 703.33 s [integer-logarithms] [4 of 4] Compiling Math.NumberTheory.Powers.Natural ( src/Math/NumberTheory/Powers/Natural.hs, dist/build/Math/NumberTheory/Powers/Natural.o, dist/build/Math/NumberTheory/Powers/Natural.dyn_o )
  4018. 703.36 s [hedgehog] Warning: Hedgehog: could not find link destinations for:
  4019. 703.36 s [hedgehog] - Barbies.Generics.Constraints.P
  4020. 703.36 s [hedgehog] - Barbies.Generics.Constraints.GAllRec
  4021. 703.59 s [integer-logarithms] [1 of 4] Compiling GHC.Integer.Logarithms.Compat ( src/GHC/Integer/Logarithms/Compat.hs, dist/build/GHC/Integer/Logarithms/Compat.p_o )
  4022. 703.74 s [integer-logarithms] [2 of 4] Compiling Math.NumberTheory.Logarithms ( src/Math/NumberTheory/Logarithms.hs, dist/build/Math/NumberTheory/Logarithms.p_o )
  4023. 704.72 s [integer-logarithms] [3 of 4] Compiling Math.NumberTheory.Powers.Integer ( src/Math/NumberTheory/Powers/Integer.hs, dist/build/Math/NumberTheory/Powers/Integer.p_o )
  4024. 704.72 s [integer-logarithms] [4 of 4] Compiling Math.NumberTheory.Powers.Natural ( src/Math/NumberTheory/Powers/Natural.hs, dist/build/Math/NumberTheory/Powers/Natural.p_o )
  4025. 705.57 s [integer-logarithms] Preprocessing test suite 'spec' for integer-logarithms-1.0.4..
  4026. 705.57 s [integer-logarithms] Building test suite 'spec' for integer-logarithms-1.0.4..
  4027. 705.66 s [integer-logarithms] [1 of 4] Compiling Math.NumberTheory.TestUtils ( test-suite/Math/NumberTheory/TestUtils.hs, dist/build/spec/spec-tmp/Math/NumberTheory/TestUtils.o )
  4028. 706.18 s [integer-logarithms] [2 of 4] Compiling Orphans ( test-suite/Orphans.hs, dist/build/spec/spec-tmp/Orphans.o )
  4029. 706.18 s [integer-logarithms] [3 of 4] Compiling Math.NumberTheory.LogarithmsTests ( test-suite/Math/NumberTheory/LogarithmsTests.hs, dist/build/spec/spec-tmp/Math/NumberTheory/LogarithmsTests.o )
  4030. 706.82 s [integer-logarithms] [4 of 4] Compiling Main ( test-suite/Test.hs, dist/build/spec/spec-tmp/Main.o )
  4031. 706.85 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  4032. 706.95 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  4033. 707.11 s [integer-logarithms] [5 of 5] Linking dist/build/spec/spec
  4034. 708.25 s [integer-logarithms] Phase: checkPhase
  4035. 708.28 s [integer-logarithms] Running 1 test suites...
  4036. 708.28 s [integer-logarithms] Test suite spec: RUNNING...
  4037. 708.29 s [integer-logarithms] All
  4038. 708.29 s [integer-logarithms] Logarithms
  4039. 708.29 s [integer-logarithms] integerLogBase
  4040. 708.29 s [integer-logarithms] smallcheck: OK
  4041. 708.29 s [integer-logarithms] 25 tests completed
  4042. 708.29 s [integer-logarithms] quickcheck: OK
  4043. 708.29 s [integer-logarithms] +++ OK, passed 100 tests.
  4044. 708.29 s [integer-logarithms] integerLog2
  4045. 708.29 s [integer-logarithms] smallcheck: OK
  4046. 708.29 s [integer-logarithms] 5 tests completed
  4047. 708.29 s [integer-logarithms] quickcheck: OK
  4048. 708.29 s [integer-logarithms] +++ OK, passed 100 tests.
  4049. 708.29 s [integer-logarithms] integerLog2Huge
  4050. 708.29 s [integer-logarithms] smallcheck: OK
  4051. 708.29 s [integer-logarithms] 5 tests completed
  4052. 708.29 s [integer-logarithms] quickcheck: OK
  4053. 708.29 s [integer-logarithms] +++ OK, passed 100 tests.
  4054. 708.29 s [integer-logarithms] integerLog10
  4055. 708.29 s [integer-logarithms] smallcheck: OK
  4056. 708.29 s [integer-logarithms] 5 tests completed
  4057. 708.29 s [integer-logarithms] quickcheck: OK
  4058. 708.29 s [integer-logarithms] +++ OK, passed 100 tests.
  4059. 708.29 s [integer-logarithms] naturalLogBase
  4060. 708.29 s [integer-logarithms] smallcheck: OK
  4061. 708.29 s [integer-logarithms] 25 tests completed
  4062. 708.29 s [integer-logarithms] quickcheck: OK
  4063. 708.29 s [integer-logarithms] +++ OK, passed 100 tests.
  4064. 708.29 s [integer-logarithms] naturalLog2
  4065. 708.29 s [integer-logarithms] smallcheck: OK
  4066. 708.29 s [integer-logarithms] 5 tests completed
  4067. 708.30 s [integer-logarithms] quickcheck: OK
  4068. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4069. 708.30 s [integer-logarithms] naturalLog2Huge
  4070. 708.30 s [integer-logarithms] smallcheck: OK
  4071. 708.30 s [integer-logarithms] 5 tests completed
  4072. 708.30 s [integer-logarithms] quickcheck: OK
  4073. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4074. 708.30 s [integer-logarithms] naturalLog10
  4075. 708.30 s [integer-logarithms] smallcheck: OK
  4076. 708.30 s [integer-logarithms] 5 tests completed
  4077. 708.30 s [integer-logarithms] quickcheck: OK
  4078. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4079. 708.30 s [integer-logarithms] intLog2
  4080. 708.30 s [integer-logarithms] smallcheck: OK
  4081. 708.30 s [integer-logarithms] 5 tests completed
  4082. 708.30 s [integer-logarithms] quickcheck: OK
  4083. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4084. 708.30 s [integer-logarithms] wordLog2
  4085. 708.30 s [integer-logarithms] smallcheck: OK
  4086. 708.30 s [integer-logarithms] 5 tests completed
  4087. 708.30 s [integer-logarithms] quickcheck: OK
  4088. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4089. 708.30 s [integer-logarithms] integerLogBase'
  4090. 708.30 s [integer-logarithms] smallcheck: OK
  4091. 708.30 s [integer-logarithms] 25 tests completed
  4092. 708.30 s [integer-logarithms] quickcheck: OK
  4093. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4094. 708.30 s [integer-logarithms] integerLogBase' with base > 32 and n >= base ^ 2
  4095. 708.30 s [integer-logarithms] smallcheck: OK
  4096. 708.30 s [integer-logarithms] 25 tests completed
  4097. 708.30 s [integer-logarithms] quickcheck: OK
  4098. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4099. 708.30 s [integer-logarithms] integerLog2'
  4100. 708.30 s [integer-logarithms] smallcheck: OK
  4101. 708.30 s [integer-logarithms] 5 tests completed
  4102. 708.30 s [integer-logarithms] quickcheck: OK
  4103. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4104. 708.30 s [integer-logarithms] integerLog10'
  4105. 708.30 s [integer-logarithms] smallcheck: OK
  4106. 708.30 s [integer-logarithms] 5 tests completed
  4107. 708.30 s [integer-logarithms] quickcheck: OK
  4108. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4109. 708.30 s [integer-logarithms] intLog2'
  4110. 708.30 s [integer-logarithms] smallcheck: OK
  4111. 708.30 s [integer-logarithms] 5 tests completed
  4112. 708.30 s [integer-logarithms] quickcheck: OK
  4113. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4114. 708.30 s [integer-logarithms] wordLog2'
  4115. 708.30 s [integer-logarithms] smallcheck: OK
  4116. 708.30 s [integer-logarithms] 5 tests completed
  4117. 708.30 s [integer-logarithms] quickcheck: OK
  4118. 708.30 s [integer-logarithms] +++ OK, passed 100 tests.
  4119. 708.30 s [integer-logarithms]
  4120. 708.30 s [integer-logarithms] All 32 tests passed (0.01s)
  4121. 708.30 s [integer-logarithms] Test suite spec: PASS
  4122. 708.30 s [integer-logarithms] Test suite logged to: dist/test/integer-logarithms-1.0.4-spec.log
  4123. 708.30 s [integer-logarithms] 1 of 1 test suites (1 of 1 test cases) passed.
  4124. 708.31 s [integer-logarithms] Phase: haddockPhase
  4125. 708.51 s [integer-logarithms] Preprocessing library for integer-logarithms-1.0.4..
  4126. 708.51 s [integer-logarithms] Running Haddock on library for integer-logarithms-1.0.4..
  4127. 708.58 s [integer-logarithms] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  4128. 708.75 s [integer-logarithms] 40% ( 2 / 5) in 'GHC.Integer.Logarithms.Compat'
  4129. 708.75 s [integer-logarithms] Missing documentation for:
  4130. 708.75 s [integer-logarithms] integerLogBase#
  4131. 708.75 s [integer-logarithms] integerLog2#
  4132. 708.75 s [integer-logarithms] wordLog2#
  4133. 708.83 s [integer-logarithms] 100% ( 17 / 17) in 'Math.NumberTheory.Logarithms'
  4134. 708.86 s [integer-logarithms] 100% ( 3 / 3) in 'Math.NumberTheory.Powers.Integer'
  4135. 708.87 s [integer-logarithms] 100% ( 3 / 3) in 'Math.NumberTheory.Powers.Natural'
  4136. 709.93 s [hedgehog] Documentation created: dist/doc/html/hedgehog/index.html,
  4137. 709.93 s [hedgehog] dist/doc/html/hedgehog/hedgehog.txt
  4138. 710.01 s [hedgehog] Preprocessing test suite 'test' for hedgehog-1.5..
  4139. 710.05 s [hedgehog] Phase: installPhase
  4140. 710.19 s [hedgehog] Installing library in /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4141. 710.86 s [integer-logarithms] Documentation created: dist/doc/html/integer-logarithms/index.html,
  4142. 710.86 s [integer-logarithms] dist/doc/html/integer-logarithms/integer-logarithms.txt
  4143. 710.93 s [integer-logarithms] Preprocessing test suite 'spec' for integer-logarithms-1.0.4..
  4144. 710.94 s [integer-logarithms] Phase: installPhase
  4145. 711.03 s [integer-logarithms] Installing library in /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  4146. 711.33 s [hedgehog] Phase: fixupPhase
  4147. 711.36 s [hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5
  4148. 711.38 s [integer-logarithms] Phase: fixupPhase
  4149. 711.39 s [hedgehog] shrinking /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHShedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp-ghc9.6.3.so
  4150. 711.41 s [hedgehog] checking for references to /build/ in /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5...
  4151. 711.45 s [hedgehog] patching script interpreter paths in /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5
  4152. 711.45 s [integer-logarithms] shrinking RPATHs of ELF executables and libraries in /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4
  4153. 711.45 s [integer-logarithms] shrinking /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSinteger-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1-ghc9.6.3.so
  4154. 711.46 s [hedgehog] stripping (with command strip and flags -S -p) in /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/lib
  4155. 711.46 s [integer-logarithms] checking for references to /build/ in /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4...
  4156. 711.47 s [integer-logarithms] patching script interpreter paths in /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4
  4157. 711.53 s [integer-logarithms] stripping (with command strip and flags -S -p) in /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4/lib
  4158. 711.62 s [integer-logarithms] shrinking RPATHs of ELF executables and libraries in /nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc
  4159. 711.63 s [integer-logarithms] checking for references to /build/ in /nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc...
  4160. 711.64 s [integer-logarithms] patching script interpreter paths in /nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc
  4161. 711.81 s [integer-logarithms:post-build] Uploading to cachix cache "sellout": /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4 /nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc
  4162. 712.58 s [integer-logarithms:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  4163. 712.58 s [integer-logarithms:post-build]
  4164. 712.99 s [integer-logarithms:post-build] Pushing /nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc (354.30 KiB)
  4165. 713.06 s [integer-logarithms:post-build] Pushing /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4 (900.24 KiB)
  4166. 714.19 s [integer-logarithms:post-build]
  4167. 714.19 s [integer-logarithms:post-build] All done.
  4168. 714.23 s [integer-logarithms:post-build] Uploading to the NixCI cache: /nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4 /nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc
  4169. 714.32 s [integer-logarithms:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4170. 714.56 s [integer-logarithms:post-build] copying 2 paths...
  4171. 714.57 s [integer-logarithms:post-build] copying path '/nix/store/jb85vry01rz4lifxk2y7r0f81r0v0v56-integer-logarithms-1.0.4-doc' to 'https://cache.nix-ci.com'...
  4172. 714.96 s [integer-logarithms:post-build] copying path '/nix/store/j7pgjsmrffkj49slzdqagkhjia6kbvr0-integer-logarithms-1.0.4' to 'https://cache.nix-ci.com'...
  4173. 716.05 s [integer-logarithms:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4174. 716.33 s [integer-logarithms:post-build] copying 1 paths...
  4175. 716.33 s [integer-logarithms:post-build] copying path '/nix/store/v80kzj4lckw5hp79f52cs1ymdfhjaxzj-integer-logarithms-1.0.4.drv' to 'https://cache.nix-ci.com'...
  4176. 716.56 s Progress: 98 of 114 built (2 building), 172 of 172 downloaded from cache
  4177. 716.63 s Building /nix/store/yqwmlnz4s14y254s1l3day9fhabjxvwd-scientific-0.3.8.0.drv
  4178. 716.63 s [hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc
  4179. 716.63 s [hedgehog] checking for references to /build/ in /nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc...
  4180. 716.63 s [hedgehog] patching script interpreter paths in /nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc
  4181. 716.63 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  4182. 716.63 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  4183. 716.63 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  4184. 716.63 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  4185. 716.63 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  4186. 716.77 s [hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5
  4187. 717.31 s [hedgehog:post-build] Pushing 2 paths (128 are already present) using zstd to cache sellout ⏳
  4188. 717.31 s [hedgehog:post-build]
  4189. 717.77 s [hedgehog:post-build] Pushing /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5 (23.85 MiB)
  4190. 717.83 s [hedgehog:post-build] Pushing /nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc (15.26 MiB)
  4191. 719.42 s [hedgehog:post-build]
  4192. 719.42 s [hedgehog:post-build] All done.
  4193. 719.48 s [hedgehog:post-build] Uploading to the NixCI cache: /nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5
  4194. 719.65 s [hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4195. 720.06 s [hedgehog:post-build] copying 2 paths...
  4196. 720.06 s [hedgehog:post-build] copying path '/nix/store/zckrphb382qh4zv2s4ninvqfc5nizg5n-hedgehog-1.5-doc' to 'https://cache.nix-ci.com'...
  4197. 722.99 s [hedgehog:post-build] copying path '/nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5' to 'https://cache.nix-ci.com'...
  4198. 733.39 s [hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4199. 733.71 s [hedgehog:post-build] copying 1 paths...
  4200. 733.74 s [hedgehog:post-build] copying path '/nix/store/rz6jcqsk53vrni92p2vs7kh5qkc6a4ld-hedgehog-1.5.drv' to 'https://cache.nix-ci.com'...
  4201. 734.16 s Progress: 99 of 114 built (2 building), 172 of 172 downloaded from cache
  4202. 734.25 s Building /nix/store/zrzmyf319grqw2rx1ckw5agf3lb5wipj-duoids-hedgehog-0.0.1.0.drv
  4203. 734.32 s Building /nix/store/aiw4scijz7q4iwi0llfsyy8gmh90gfna-tasty-hedgehog-1.4.0.2.drv
  4204. 734.32 s [scientific] Phase: setupCompilerEnvironmentPhase
  4205. 734.32 s [scientific] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  4206. 734.32 s [scientific] Phase: unpackPhase
  4207. 734.32 s [scientific] unpacking source archive /nix/store/8wdrn8qwx87rmmykvk7is30zx4xswld9-scientific-0.3.8.0.tar.gz
  4208. 734.32 s [scientific] source root is scientific-0.3.8.0
  4209. 734.32 s [scientific] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "scientific-0.3.8.0/test/test.hs"
  4210. 734.32 s [scientific] Phase: patchPhase
  4211. 734.32 s [scientific] Replace Cabal file with edited version from mirror://hackage/scientific-0.3.8.0/revision/2.cabal.
  4212. 734.32 s [scientific] Phase: compileBuildDriverPhase
  4213. 734.32 s [scientific] setupCompileFlags: -package-db=/build/tmp.0eyX13Axfo/setup-package.conf.d -threaded
  4214. 734.32 s [scientific] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.0eyX13Axfo/Main.o )
  4215. 734.32 s [scientific] [2 of 2] Linking Setup
  4216. 734.32 s [scientific] Phase: updateAutotoolsGnuConfigScriptsPhase
  4217. 734.32 s [scientific] Phase: configurePhase
  4218. 734.32 s [scientific] configureFlags: --verbose --prefix=/nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc/share/doc/scientific-0.3.8.0 --with-gcc=gcc --package-db=/build/tmp.0eyX13Axfo/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  4219. 734.32 s [scientific] Using Parsec parser
  4220. 734.32 s [scientific] Configuring scientific-0.3.8.0...
  4221. 734.32 s [scientific] Flags chosen: integer-simple=False
  4222. 734.32 s [scientific] Dependency base >=4.15 && <4.22: using base-4.18.1.0
  4223. 734.32 s [scientific] Dependency binary >=0.8.6.0 && <0.9: using binary-0.8.9.1
  4224. 734.32 s [scientific] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.11.5.2
  4225. 734.32 s [scientific] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.7
  4226. 734.32 s [scientific] Dependency deepseq >=1.4.4.0 && <1.6: using deepseq-1.4.8.1
  4227. 734.32 s [scientific] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  4228. 734.32 s [scientific] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  4229. 734.32 s [scientific] integer-logarithms-1.0.4
  4230. 734.32 s [scientific] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  4231. 734.32 s [scientific] Dependency template-haskell >=2.14.0.0 && <2.24: using
  4232. 734.32 s [scientific] template-haskell-2.20.0.0
  4233. 734.32 s [scientific] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  4234. 734.32 s [scientific] Dependency QuickCheck >=2.14.2: using QuickCheck-2.14.3
  4235. 734.32 s [scientific] Dependency base: using base-4.18.1.0
  4236. 734.32 s [scientific] Dependency binary: using binary-0.8.9.1
  4237. 734.32 s [scientific] Dependency bytestring: using bytestring-0.11.5.2
  4238. 734.32 s [scientific] Dependency scientific: using scientific-0.3.8.0
  4239. 734.32 s [scientific] Dependency smallcheck >=1.0: using smallcheck-1.2.1.1
  4240. 734.32 s [scientific] Dependency tasty >=1.4.0.1: using tasty-1.5.3
  4241. 734.32 s [scientific] Dependency tasty-hunit >=0.8: using tasty-hunit-0.10.2
  4242. 734.32 s [scientific] Dependency tasty-quickcheck >=0.8: using tasty-quickcheck-0.11
  4243. 734.32 s [scientific] Dependency tasty-smallcheck >=0.2: using tasty-smallcheck-0.8.2
  4244. 734.32 s [scientific] Dependency text: using text-2.0.2
  4245. 734.32 s [scientific] Source component graph:
  4246. 734.32 s [scientific] component lib
  4247. 734.32 s [scientific] component test:test-scientific dependency lib
  4248. 734.32 s [scientific] Configured component graph:
  4249. 734.32 s [scientific] component scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  4250. 734.32 s [scientific] include base-4.18.1.0
  4251. 734.32 s [scientific] include binary-0.8.9.1
  4252. 734.32 s [scientific] include bytestring-0.11.5.2
  4253. 734.32 s [scientific] include containers-0.6.7
  4254. 734.32 s [scientific] include deepseq-1.4.8.1
  4255. 734.32 s [scientific] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  4256. 734.32 s [scientific] include integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  4257. 734.32 s [scientific] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  4258. 734.32 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  4259. 734.32 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  4260. 734.32 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  4261. 734.32 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  4262. 734.32 s [scientific] include template-haskell-2.20.0.0
  4263. 734.32 s [scientific] include text-2.0.2
  4264. 734.32 s [scientific] component scientific-0.3.8.0-2gnOlFK4L4mKvXTCOYocrP-test-scientific
  4265. 734.32 s [scientific] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  4266. 734.32 s [scientific] include base-4.18.1.0
  4267. 734.32 s [scientific] include binary-0.8.9.1
  4268. 734.32 s [scientific] include bytestring-0.11.5.2
  4269. 734.32 s [scientific] include scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  4270. 734.32 s [scientific] include smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  4271. 734.32 s [scientific] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  4272. 734.32 s [scientific] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  4273. 734.32 s [scientific] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  4274. 734.32 s [scientific] include tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  4275. 734.32 s [scientific] include text-2.0.2
  4276. 734.32 s [scientific] Linked component graph:
  4277. 734.32 s [scientific] unit scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  4278. 734.32 s [scientific] include base-4.18.1.0
  4279. 734.32 s [scientific] include binary-0.8.9.1
  4280. 734.32 s [scientific] include bytestring-0.11.5.2
  4281. 734.32 s [scientific] include containers-0.6.7
  4282. 734.32 s [scientific] include deepseq-1.4.8.1
  4283. 734.32 s [scientific] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  4284. 734.32 s [scientific] include integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  4285. 734.32 s [scientific] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  4286. 734.32 s [scientific] include template-haskell-2.20.0.0
  4287. 734.32 s [scientific] include text-2.0.2
  4288. 734.32 s [scientific] Data.ByteString.Builder.Scientific=scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj:Data.ByteString.Builder.Scientific,Data.Scientific=scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj:Data.Scientific,Data.Text.Lazy.Builder.Scientific=scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj:Data.Text.Lazy.Builder.Scientific
  4289. 734.32 s [scientific] unit scientific-0.3.8.0-2gnOlFK4L4mKvXTCOYocrP-test-scientific
  4290. 734.32 s [scientific] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  4291. 734.32 s [scientific] include base-4.18.1.0
  4292. 734.32 s [scientific] include binary-0.8.9.1
  4293. 734.32 s [scientific] include bytestring-0.11.5.2
  4294. 734.32 s [scientific] include scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  4295. 734.32 s [scientific] include smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  4296. 734.32 s [scientific] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  4297. 734.32 s [scientific] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  4298. 734.32 s [scientific] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  4299. 734.32 s [scientific] include tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  4300. 734.32 s [scientific] include text-2.0.2
  4301. 734.32 s [scientific] Ready component graph:
  4302. 734.32 s [scientific] definite scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  4303. 734.32 s [scientific] depends base-4.18.1.0
  4304. 734.32 s [scientific] depends binary-0.8.9.1
  4305. 734.32 s [scientific] depends bytestring-0.11.5.2
  4306. 734.33 s [scientific] depends containers-0.6.7
  4307. 734.33 s [scientific] depends deepseq-1.4.8.1
  4308. 734.33 s [scientific] depends hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  4309. 734.33 s [scientific] depends integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  4310. 734.33 s [scientific] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  4311. 734.33 s [scientific] depends template-haskell-2.20.0.0
  4312. 734.33 s [scientific] depends text-2.0.2
  4313. 734.33 s [scientific] definite scientific-0.3.8.0-2gnOlFK4L4mKvXTCOYocrP-test-scientific
  4314. 734.33 s [scientific] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  4315. 734.33 s [scientific] depends base-4.18.1.0
  4316. 734.33 s [scientific] depends binary-0.8.9.1
  4317. 734.33 s [scientific] depends bytestring-0.11.5.2
  4318. 734.33 s [scientific] depends scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  4319. 734.33 s [scientific] depends smallcheck-1.2.1.1-DmrirUhzSCwy5ohb3w6m2
  4320. 734.33 s [scientific] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  4321. 734.33 s [scientific] depends tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  4322. 734.33 s [scientific] depends tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  4323. 734.33 s [scientific] depends tasty-smallcheck-0.8.2-5VOvnwhoIZc4WPEWsoZEKl
  4324. 734.33 s [scientific] depends text-2.0.2
  4325. 734.33 s [scientific] Using Cabal-3.10.1.0 compiled by ghc-9.6
  4326. 734.33 s [scientific] Using compiler: ghc-9.6.3
  4327. 734.33 s [scientific] Using install prefix:
  4328. 734.33 s [scientific] /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0
  4329. 734.33 s [scientific] Executables installed in:
  4330. 734.33 s [scientific] /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/bin
  4331. 734.33 s [scientific] Libraries installed in:
  4332. 734.33 s [scientific] /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  4333. 734.33 s [scientific] Dynamic Libraries installed in:
  4334. 734.33 s [scientific] /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  4335. 734.33 s [scientific] Private executables installed in:
  4336. 734.33 s [scientific] /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/libexec/x86_64-linux-ghc-9.6.3/scientific-0.3.8.0
  4337. 734.33 s [scientific] Data files installed in:
  4338. 734.33 s [scientific] /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/share/x86_64-linux-ghc-9.6.3/scientific-0.3.8.0
  4339. 734.33 s [scientific] Documentation installed in:
  4340. 734.33 s [scientific] /nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc/share/doc/scientific-0.3.8.0
  4341. 734.33 s [scientific] Configuration files installed in:
  4342. 734.33 s [scientific] /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/etc
  4343. 734.33 s [scientific] No alex found
  4344. 734.33 s [scientific] Using ar found on system at:
  4345. 734.33 s [scientific] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  4346. 734.33 s [scientific] No c2hs found
  4347. 734.33 s [scientific] No cpphs found
  4348. 734.33 s [scientific] No doctest found
  4349. 734.33 s [scientific] Using gcc version 14.3.0 given by user at:
  4350. 734.33 s [scientific] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  4351. 734.33 s [scientific] Using ghc version 9.6.3 found on system at:
  4352. 734.33 s [scientific] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  4353. 734.33 s [scientific] Using ghc-pkg version 9.6.3 found on system at:
  4354. 734.33 s [scientific] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  4355. 734.33 s [scientific] No ghcjs found
  4356. 734.33 s [scientific] No ghcjs-pkg found
  4357. 734.33 s [scientific] No greencard found
  4358. 734.33 s [scientific] Using haddock version 2.29.1 found on system at:
  4359. 734.33 s [scientific] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  4360. 734.33 s [scientific] No happy found
  4361. 734.33 s [scientific] Using haskell-suite found on system at: haskell-suite-dummy-location
  4362. 734.33 s [scientific] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4363. 734.33 s [scientific] No hmake found
  4364. 734.33 s [scientific] Using hpc version 0.68 found on system at:
  4365. 734.33 s [scientific] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  4366. 734.33 s [scientific] Using hsc2hs version 0.68.9 found on system at:
  4367. 734.33 s [scientific] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  4368. 734.33 s [scientific] Using hscolour version 1.25 found on system at:
  4369. 734.33 s [scientific] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  4370. 734.33 s [scientific] No jhc found
  4371. 734.33 s [scientific] Using ld found on system at:
  4372. 734.33 s [scientific] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  4373. 734.33 s [scientific] No pkg-config found
  4374. 734.33 s [scientific] Using runghc version 9.6.3 found on system at:
  4375. 734.33 s [scientific] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  4376. 734.33 s [scientific] Using strip version 2.44 found on system at:
  4377. 734.33 s [scientific] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  4378. 734.33 s [scientific] Using tar found on system at:
  4379. 734.33 s [scientific] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  4380. 734.33 s [scientific] No uhc found
  4381. 734.33 s [scientific] Phase: buildPhase
  4382. 734.33 s [scientific] Preprocessing library for scientific-0.3.8.0..
  4383. 734.33 s [scientific] Building library for scientific-0.3.8.0..
  4384. 734.33 s [scientific] [1 of 5] Compiling GHC.Integer.Compat ( src/GHC/Integer/Compat.hs, dist/build/GHC/Integer/Compat.o, dist/build/GHC/Integer/Compat.dyn_o )
  4385. 734.33 s [scientific] [2 of 5] Compiling Utils ( src/Utils.hs, dist/build/Utils.o, dist/build/Utils.dyn_o )
  4386. 734.33 s [scientific] [3 of 5] Compiling Data.Scientific ( src/Data/Scientific.hs, dist/build/Data/Scientific.o, dist/build/Data/Scientific.dyn_o )
  4387. 734.33 s [scientific]
  4388. 734.33 s [scientific] src/Data/Scientific.hs:1041:16: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4389. 734.33 s [scientific] Pattern match(es) are non-exhaustive
  4390. 734.33 s [scientific] In a pattern binding:
  4391. 734.33 s [scientific] Patterns of type ‘[Char]’ not matched:
  4392. 734.33 s [scientific] []
  4393. 734.33 s [scientific] []
  4394. 734.33 s [scientific] []
  4395. 734.33 s [scientific] |
  4396. 734.33 s [scientific] 1041 | (d:ds') = map intToDigit (if ei > 0 then init is' else is')
  4397. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4398. 734.33 s [scientific]
  4399. 734.33 s [scientific] src/Data/Scientific.hs:1057:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4400. 734.33 s [scientific] Pattern match(es) are non-exhaustive
  4401. 734.33 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  4402. 734.33 s [scientific] |
  4403. 734.33 s [scientific] 1057 | d:ds' = map intToDigit (if ei > 0 then is' else 0:is')
  4404. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4405. 734.33 s [scientific] [4 of 5] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, dist/build/Data/Text/Lazy/Builder/Scientific.o, dist/build/Data/Text/Lazy/Builder/Scientific.dyn_o )
  4406. 734.33 s [scientific]
  4407. 734.33 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:19:1: warning: [-Wunused-imports]
  4408. 734.33 s [scientific] The import of ‘Data.Monoid’ is redundant
  4409. 734.33 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  4410. 734.33 s [scientific] To import instances alone, use: import Data.Monoid()
  4411. 734.33 s [scientific] |
  4412. 734.33 s [scientific] 19 | import Data.Monoid ((<>))
  4413. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4414. 734.33 s [scientific]
  4415. 734.33 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:60:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4416. 734.33 s [scientific] Pattern match(es) are non-exhaustive
  4417. 734.33 s [scientific] In a pattern binding:
  4418. 734.33 s [scientific] Patterns of type ‘[Char]’ not matched:
  4419. 734.33 s [scientific] []
  4420. 734.33 s [scientific] []
  4421. 734.33 s [scientific] []
  4422. 734.33 s [scientific] |
  4423. 734.33 s [scientific] 60 | (d:ds') = map i2d (if ei > 0 then init is' else is')
  4424. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4425. 734.33 s [scientific]
  4426. 734.33 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:88:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4427. 734.33 s [scientific] Pattern match(es) are non-exhaustive
  4428. 734.33 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  4429. 734.33 s [scientific] |
  4430. 734.33 s [scientific] 88 | d:ds' = map i2d (if ei > 0 then is' else 0:is')
  4431. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4432. 734.33 s [scientific] [5 of 5] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, dist/build/Data/ByteString/Builder/Scientific.o, dist/build/Data/ByteString/Builder/Scientific.dyn_o )
  4433. 734.33 s [scientific]
  4434. 734.33 s [scientific] src/Data/ByteString/Builder/Scientific.hs:20:1: warning: [-Wunused-imports]
  4435. 734.33 s [scientific] The import of ‘Data.Monoid’ is redundant
  4436. 734.33 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  4437. 734.33 s [scientific] To import instances alone, use: import Data.Monoid()
  4438. 734.33 s [scientific] |
  4439. 734.33 s [scientific] 20 | import Data.Monoid ((<>))
  4440. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4441. 734.33 s [scientific]
  4442. 734.33 s [scientific] src/Data/ByteString/Builder/Scientific.hs:64:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4443. 734.33 s [scientific] Pattern match(es) are non-exhaustive
  4444. 734.33 s [scientific] In a pattern binding:
  4445. 734.33 s [scientific] Patterns of type ‘[Char]’ not matched:
  4446. 734.33 s [scientific] []
  4447. 734.33 s [scientific] []
  4448. 734.33 s [scientific] []
  4449. 734.33 s [scientific] |
  4450. 734.33 s [scientific] 64 | (d:ds') = map i2d (if ei > 0 then init is' else is')
  4451. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4452. 734.33 s [scientific]
  4453. 734.33 s [scientific] src/Data/ByteString/Builder/Scientific.hs:94:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4454. 734.33 s [scientific] Pattern match(es) are non-exhaustive
  4455. 734.33 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  4456. 734.33 s [scientific] |
  4457. 734.33 s [scientific] 94 | d:ds' = map i2d (if ei > 0 then is' else 0:is')
  4458. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4459. 734.33 s [scientific] [1 of 5] Compiling GHC.Integer.Compat ( src/GHC/Integer/Compat.hs, dist/build/GHC/Integer/Compat.p_o )
  4460. 734.33 s [scientific] [2 of 5] Compiling Utils ( src/Utils.hs, dist/build/Utils.p_o )
  4461. 734.33 s [scientific] [3 of 5] Compiling Data.Scientific ( src/Data/Scientific.hs, dist/build/Data/Scientific.p_o )
  4462. 734.33 s [scientific]
  4463. 734.33 s [scientific] src/Data/Scientific.hs:1041:16: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4464. 734.33 s [scientific] Pattern match(es) are non-exhaustive
  4465. 734.33 s [scientific] In a pattern binding:
  4466. 734.33 s [scientific] Patterns of type ‘[Char]’ not matched:
  4467. 734.33 s [scientific] []
  4468. 734.33 s [scientific] []
  4469. 734.33 s [scientific] []
  4470. 734.33 s [scientific] |
  4471. 734.33 s [scientific] 1041 | (d:ds') = map intToDigit (if ei > 0 then init is' else is')
  4472. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4473. 734.33 s [scientific]
  4474. 734.33 s [scientific] src/Data/Scientific.hs:1057:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4475. 734.33 s [scientific] Pattern match(es) are non-exhaustive
  4476. 734.33 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  4477. 734.33 s [scientific] |
  4478. 734.33 s [scientific] 1057 | d:ds' = map intToDigit (if ei > 0 then is' else 0:is')
  4479. 734.33 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4480. 734.47 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  4481. 734.49 s [duoids-hedgehog] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  4482. 734.52 s [tasty-hedgehog] Phase: setupCompilerEnvironmentPhase
  4483. 734.53 s [tasty-hedgehog] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  4484. 734.62 s [scientific] [4 of 5] Compiling Data.Text.Lazy.Builder.Scientific ( src/Data/Text/Lazy/Builder/Scientific.hs, dist/build/Data/Text/Lazy/Builder/Scientific.p_o )
  4485. 734.65 s [scientific]
  4486. 734.65 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:19:1: warning: [-Wunused-imports]
  4487. 734.65 s [scientific] The import of ‘Data.Monoid’ is redundant
  4488. 734.65 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  4489. 734.65 s [scientific] To import instances alone, use: import Data.Monoid()
  4490. 734.65 s [scientific] |
  4491. 734.65 s [scientific] 19 | import Data.Monoid ((<>))
  4492. 734.65 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4493. 734.65 s [scientific]
  4494. 734.65 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:60:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4495. 734.65 s [scientific] Pattern match(es) are non-exhaustive
  4496. 734.65 s [scientific] In a pattern binding:
  4497. 734.65 s [scientific] Patterns of type ‘[Char]’ not matched:
  4498. 734.65 s [scientific] []
  4499. 734.65 s [scientific] []
  4500. 734.65 s [scientific] []
  4501. 734.65 s [scientific] |
  4502. 734.65 s [scientific] 60 | (d:ds') = map i2d (if ei > 0 then init is' else is')
  4503. 734.65 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4504. 734.65 s [scientific]
  4505. 734.65 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:88:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4506. 734.65 s [scientific] Pattern match(es) are non-exhaustive
  4507. 734.65 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  4508. 734.65 s [scientific] |
  4509. 734.65 s [scientific] 88 | d:ds' = map i2d (if ei > 0 then is' else 0:is')
  4510. 734.65 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4511. 734.94 s [duoids-hedgehog] Phase: unpackPhase
  4512. 734.94 s [tasty-hedgehog] Phase: unpackPhase
  4513. 734.95 s [duoids-hedgehog] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./hedgehog
  4514. 734.96 s [tasty-hedgehog] unpacking source archive /nix/store/c7lip15ss1zm2zsp6i971ky2zjla3sm3-tasty-hedgehog-1.4.0.2.tar.gz
  4515. 734.97 s [tasty-hedgehog] source root is tasty-hedgehog-1.4.0.2
  4516. 734.97 s [duoids-hedgehog] source root is hedgehog
  4517. 735.01 s [tasty-hedgehog] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "tasty-hedgehog-1.4.0.2/test/Main.hs"
  4518. 735.02 s [tasty-hedgehog] Phase: patchPhase
  4519. 735.04 s [tasty-hedgehog] Replace Cabal file with edited version from mirror://hackage/tasty-hedgehog-1.4.0.2/revision/6.cabal.
  4520. 735.06 s [tasty-hedgehog] Phase: compileBuildDriverPhase
  4521. 735.07 s [tasty-hedgehog] setupCompileFlags: -package-db=/build/tmp.kBzLkchkSy/setup-package.conf.d -threaded
  4522. 735.19 s [duoids-hedgehog] Phase: patchPhase
  4523. 735.23 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  4524. 735.24 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.wLOUoOTKvK/setup-package.conf.d -threaded
  4525. 735.25 s [tasty-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.kBzLkchkSy/Main.o )
  4526. 735.36 s [tasty-hedgehog] [2 of 2] Linking Setup
  4527. 735.36 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.wLOUoOTKvK/Main.o )
  4528. 735.47 s [duoids-hedgehog] [2 of 2] Linking Setup
  4529. 736.26 s [scientific] [5 of 5] Compiling Data.ByteString.Builder.Scientific ( src/Data/ByteString/Builder/Scientific.hs, dist/build/Data/ByteString/Builder/Scientific.p_o )
  4530. 736.26 s [scientific]
  4531. 736.26 s [scientific] src/Data/ByteString/Builder/Scientific.hs:20:1: warning: [-Wunused-imports]
  4532. 736.26 s [scientific] The import of ‘Data.Monoid’ is redundant
  4533. 736.26 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  4534. 736.26 s [scientific] To import instances alone, use: import Data.Monoid()
  4535. 736.26 s [scientific] |
  4536. 736.26 s [scientific] 20 | import Data.Monoid ((<>))
  4537. 736.26 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4538. 736.26 s [scientific]
  4539. 736.26 s [scientific] src/Data/ByteString/Builder/Scientific.hs:64:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4540. 736.26 s [scientific] Pattern match(es) are non-exhaustive
  4541. 736.26 s [scientific] In a pattern binding:
  4542. 736.26 s [scientific] Patterns of type ‘[Char]’ not matched:
  4543. 736.26 s [scientific] []
  4544. 736.26 s [scientific] []
  4545. 736.26 s [scientific] []
  4546. 736.26 s [scientific] |
  4547. 736.26 s [scientific] 64 | (d:ds') = map i2d (if ei > 0 then init is' else is')
  4548. 736.26 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4549. 736.26 s [scientific]
  4550. 736.26 s [scientific] src/Data/ByteString/Builder/Scientific.hs:94:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  4551. 736.26 s [scientific] Pattern match(es) are non-exhaustive
  4552. 736.26 s [scientific] In a pattern binding: Patterns of type ‘[Char]’ not matched: []
  4553. 736.26 s [scientific] |
  4554. 736.26 s [scientific] 94 | d:ds' = map i2d (if ei > 0 then is' else 0:is')
  4555. 736.26 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4556. 737.22 s [tasty-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  4557. 737.25 s [tasty-hedgehog] Phase: configurePhase
  4558. 737.32 s [tasty-hedgehog] configureFlags: --verbose --prefix=/nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc/share/doc/tasty-hedgehog-1.4.0.2 --with-gcc=gcc --package-db=/build/tmp.kBzLkchkSy/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 --disable-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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  4559. 737.35 s [tasty-hedgehog] Using Parsec parser
  4560. 737.35 s [tasty-hedgehog] Configuring tasty-hedgehog-1.4.0.2...
  4561. 737.41 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  4562. 737.43 s [duoids-hedgehog] Phase: configurePhase
  4563. 737.44 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.wLOUoOTKvK/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/lib
  4564. 737.46 s [duoids-hedgehog] Using Parsec parser
  4565. 737.46 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  4566. 737.85 s [scientific] Preprocessing test suite 'test-scientific' for scientific-0.3.8.0..
  4567. 737.85 s [scientific] Building test suite 'test-scientific' for scientific-0.3.8.0..
  4568. 737.87 s [tasty-hedgehog] Dependency base >=4.8 && <4.22: using base-4.18.1.0
  4569. 737.87 s [tasty-hedgehog] Dependency hedgehog >=1.4 && <1.6: using hedgehog-1.5
  4570. 737.87 s [tasty-hedgehog] Dependency tagged >=0.8 && <0.9: using tagged-0.8.8
  4571. 737.87 s [tasty-hedgehog] Dependency tasty >=0.11 && <1.6: using tasty-1.5.3
  4572. 737.97 s [scientific] [1 of 1] Compiling Main ( test/test.hs, dist/build/test-scientific/test-scientific-tmp/Main.o )
  4573. 738.09 s [duoids-hedgehog] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  4574. 738.31 s [tasty-hedgehog] Source component graph: component lib
  4575. 738.31 s [tasty-hedgehog] Configured component graph:
  4576. 738.31 s [tasty-hedgehog] component tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1
  4577. 738.31 s [tasty-hedgehog] include base-4.18.1.0
  4578. 738.31 s [tasty-hedgehog] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4579. 738.31 s [tasty-hedgehog] include tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  4580. 738.31 s [tasty-hedgehog] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  4581. 738.31 s [tasty-hedgehog] Linked component graph:
  4582. 738.31 s [tasty-hedgehog] unit tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1
  4583. 738.31 s [tasty-hedgehog] include base-4.18.1.0
  4584. 738.31 s [tasty-hedgehog] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4585. 738.31 s [tasty-hedgehog] include tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  4586. 738.31 s [tasty-hedgehog] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  4587. 738.31 s [tasty-hedgehog] Test.Tasty.Hedgehog=tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1:Test.Tasty.Hedgehog
  4588. 738.31 s [tasty-hedgehog] Ready component graph:
  4589. 738.31 s [tasty-hedgehog] definite tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1
  4590. 738.31 s [tasty-hedgehog] depends base-4.18.1.0
  4591. 738.31 s [tasty-hedgehog] depends hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4592. 738.31 s [tasty-hedgehog] depends tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  4593. 738.31 s [tasty-hedgehog] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  4594. 738.31 s [tasty-hedgehog] Using Cabal-3.10.1.0 compiled by ghc-9.6
  4595. 738.31 s [tasty-hedgehog] Using compiler: ghc-9.6.3
  4596. 738.31 s [tasty-hedgehog] Using install prefix:
  4597. 738.31 s [tasty-hedgehog] /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2
  4598. 738.31 s [tasty-hedgehog] Executables installed in:
  4599. 738.31 s [tasty-hedgehog] /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/bin
  4600. 738.31 s [tasty-hedgehog] Libraries installed in:
  4601. 738.31 s [tasty-hedgehog] /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1
  4602. 738.31 s [tasty-hedgehog] Dynamic Libraries installed in:
  4603. 738.31 s [tasty-hedgehog] /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  4604. 738.31 s [tasty-hedgehog] Private executables installed in:
  4605. 738.31 s [tasty-hedgehog] /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/libexec/x86_64-linux-ghc-9.6.3/tasty-hedgehog-1.4.0.2
  4606. 738.31 s [tasty-hedgehog] Data files installed in:
  4607. 738.31 s [tasty-hedgehog] /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/share/x86_64-linux-ghc-9.6.3/tasty-hedgehog-1.4.0.2
  4608. 738.31 s [tasty-hedgehog] Documentation installed in:
  4609. 738.31 s [tasty-hedgehog] /nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc/share/doc/tasty-hedgehog-1.4.0.2
  4610. 738.31 s [tasty-hedgehog] Configuration files installed in:
  4611. 738.31 s [tasty-hedgehog] /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/etc
  4612. 738.31 s [tasty-hedgehog] No alex found
  4613. 738.31 s [tasty-hedgehog] Using ar found on system at:
  4614. 738.31 s [tasty-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  4615. 738.31 s [tasty-hedgehog] No c2hs found
  4616. 738.31 s [tasty-hedgehog] No cpphs found
  4617. 738.31 s [tasty-hedgehog] No doctest found
  4618. 738.31 s [tasty-hedgehog] Using gcc version 14.3.0 given by user at:
  4619. 738.31 s [tasty-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  4620. 738.31 s [tasty-hedgehog] Using ghc version 9.6.3 found on system at:
  4621. 738.31 s [tasty-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  4622. 738.31 s [tasty-hedgehog] Using ghc-pkg version 9.6.3 found on system at:
  4623. 738.31 s [tasty-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  4624. 738.31 s [tasty-hedgehog] No ghcjs found
  4625. 738.31 s [tasty-hedgehog] No ghcjs-pkg found
  4626. 738.31 s [tasty-hedgehog] No greencard found
  4627. 738.31 s [tasty-hedgehog] Using haddock version 2.29.1 found on system at:
  4628. 738.31 s [tasty-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  4629. 738.31 s [tasty-hedgehog] No happy found
  4630. 738.31 s [tasty-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  4631. 738.31 s [tasty-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4632. 738.31 s [tasty-hedgehog] No hmake found
  4633. 738.31 s [tasty-hedgehog] Using hpc version 0.68 found on system at:
  4634. 738.31 s [tasty-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  4635. 738.31 s [tasty-hedgehog] Using hsc2hs version 0.68.9 found on system at:
  4636. 738.31 s [tasty-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  4637. 738.31 s [tasty-hedgehog] Using hscolour version 1.25 found on system at:
  4638. 738.31 s [tasty-hedgehog] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  4639. 738.31 s [tasty-hedgehog] No jhc found
  4640. 738.31 s [tasty-hedgehog] Using ld found on system at:
  4641. 738.31 s [tasty-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  4642. 738.31 s [tasty-hedgehog] No pkg-config found
  4643. 738.31 s [tasty-hedgehog] Using runghc version 9.6.3 found on system at:
  4644. 738.31 s [tasty-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  4645. 738.31 s [tasty-hedgehog] Using strip version 2.44 found on system at:
  4646. 738.31 s [tasty-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  4647. 738.31 s [tasty-hedgehog] Using tar found on system at:
  4648. 738.31 s [tasty-hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  4649. 738.31 s [tasty-hedgehog] No uhc found
  4650. 738.60 s [tasty-hedgehog] Phase: buildPhase
  4651. 738.68 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4652. 738.68 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.18.1.0
  4653. 738.68 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4654. 738.68 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4655. 738.68 s [duoids-hedgehog] hedgehog-1.5
  4656. 738.68 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4657. 738.68 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.18.1.0
  4658. 738.68 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4659. 738.68 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4660. 738.68 s [duoids-hedgehog] hedgehog-1.5
  4661. 738.68 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4662. 738.68 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.18.1.0
  4663. 738.68 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  4664. 738.68 s [duoids-hedgehog] <0.25: using doctest-0.22.6
  4665. 738.68 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4666. 738.68 s [duoids-hedgehog] Source component graph:
  4667. 738.68 s [duoids-hedgehog] component lib
  4668. 738.68 s [duoids-hedgehog] component test:doctests dependency lib
  4669. 738.68 s [duoids-hedgehog] component test:laws dependency lib
  4670. 738.68 s [duoids-hedgehog] Configured component graph:
  4671. 738.68 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4672. 738.68 s [duoids-hedgehog] include base-4.18.1.0
  4673. 738.69 s [duoids-hedgehog] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  4674. 738.69 s [duoids-hedgehog] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4675. 738.69 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-8po7WjCcKQz9POx7aLWZgr-doctests
  4676. 738.69 s [duoids-hedgehog] include base-4.18.1.0
  4677. 738.69 s [duoids-hedgehog] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  4678. 738.69 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4679. 738.69 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-KtiYab1RJf91p9hzPkyAOd-laws
  4680. 738.69 s [duoids-hedgehog] include base-4.18.1.0
  4681. 738.69 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4682. 738.69 s [duoids-hedgehog] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4683. 738.69 s [duoids-hedgehog] Linked component graph:
  4684. 738.69 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4685. 738.69 s [duoids-hedgehog] include base-4.18.1.0
  4686. 738.69 s [duoids-hedgehog] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  4687. 738.69 s [duoids-hedgehog] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4688. 738.69 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9:Test.Duoidal
  4689. 738.69 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-8po7WjCcKQz9POx7aLWZgr-doctests
  4690. 738.69 s [duoids-hedgehog] include base-4.18.1.0
  4691. 738.69 s [duoids-hedgehog] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  4692. 738.69 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4693. 738.69 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-KtiYab1RJf91p9hzPkyAOd-laws
  4694. 738.69 s [duoids-hedgehog] include base-4.18.1.0
  4695. 738.69 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4696. 738.69 s [duoids-hedgehog] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4697. 738.69 s [duoids-hedgehog] Ready component graph:
  4698. 738.69 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4699. 738.69 s [duoids-hedgehog] depends base-4.18.1.0
  4700. 738.69 s [duoids-hedgehog] depends duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  4701. 738.69 s [duoids-hedgehog] depends hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4702. 738.69 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-8po7WjCcKQz9POx7aLWZgr-doctests
  4703. 738.69 s [duoids-hedgehog] depends base-4.18.1.0
  4704. 738.69 s [duoids-hedgehog] depends doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  4705. 738.69 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4706. 738.69 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-KtiYab1RJf91p9hzPkyAOd-laws
  4707. 738.69 s [duoids-hedgehog] depends base-4.18.1.0
  4708. 738.69 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4709. 738.69 s [duoids-hedgehog] depends hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  4710. 738.69 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.6
  4711. 738.69 s [duoids-hedgehog] Using compiler: ghc-9.6.3
  4712. 738.69 s [duoids-hedgehog] Using install prefix:
  4713. 738.69 s [duoids-hedgehog] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0
  4714. 738.69 s [duoids-hedgehog] Executables installed in:
  4715. 738.69 s [duoids-hedgehog] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/bin
  4716. 738.69 s [duoids-hedgehog] Libraries installed in:
  4717. 738.69 s [duoids-hedgehog] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  4718. 738.69 s [duoids-hedgehog] Dynamic Libraries installed in:
  4719. 738.69 s [duoids-hedgehog] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  4720. 738.69 s [duoids-hedgehog] Private executables installed in:
  4721. 738.69 s [duoids-hedgehog] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.6.3/duoids-hedgehog-0.0.1.0
  4722. 738.69 s [duoids-hedgehog] Data files installed in:
  4723. 738.69 s [duoids-hedgehog] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.6.3/duoids-hedgehog-0.0.1.0
  4724. 738.69 s [duoids-hedgehog] Documentation installed in:
  4725. 738.69 s [duoids-hedgehog] /nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  4726. 738.69 s [duoids-hedgehog] Configuration files installed in:
  4727. 738.69 s [duoids-hedgehog] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/etc
  4728. 738.69 s [duoids-hedgehog] No alex found
  4729. 738.69 s [duoids-hedgehog] Using ar found on system at:
  4730. 738.69 s [duoids-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  4731. 738.69 s [duoids-hedgehog] No c2hs found
  4732. 738.69 s [duoids-hedgehog] No cpphs found
  4733. 738.69 s [duoids-hedgehog] Using doctest version 0.22.6 found on system at:
  4734. 738.69 s [duoids-hedgehog] /nix/store/1rhhhdgycbwrgfgqrs5rr0mmh6r4ly3h-doctest-0.22.6/bin/doctest
  4735. 738.69 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  4736. 738.69 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  4737. 738.69 s [duoids-hedgehog] Using ghc version 9.6.3 found on system at:
  4738. 738.69 s [duoids-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  4739. 738.69 s [duoids-hedgehog] Using ghc-pkg version 9.6.3 found on system at:
  4740. 738.69 s [duoids-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  4741. 738.69 s [duoids-hedgehog] No ghcjs found
  4742. 738.69 s [duoids-hedgehog] No ghcjs-pkg found
  4743. 738.69 s [duoids-hedgehog] No greencard found
  4744. 738.69 s [duoids-hedgehog] Using haddock version 2.29.1 found on system at:
  4745. 738.69 s [duoids-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  4746. 738.69 s [duoids-hedgehog] No happy found
  4747. 738.69 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  4748. 738.69 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4749. 738.69 s [duoids-hedgehog] No hmake found
  4750. 738.69 s [duoids-hedgehog] Using hpc version 0.68 found on system at:
  4751. 738.69 s [duoids-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  4752. 738.69 s [duoids-hedgehog] Using hsc2hs version 0.68.9 found on system at:
  4753. 738.69 s [duoids-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  4754. 738.69 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  4755. 738.69 s [duoids-hedgehog] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  4756. 738.69 s [duoids-hedgehog] No jhc found
  4757. 738.69 s [duoids-hedgehog] Using ld found on system at:
  4758. 738.69 s [duoids-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  4759. 738.69 s [duoids-hedgehog] No pkg-config found
  4760. 738.69 s [duoids-hedgehog] Using runghc version 9.6.3 found on system at:
  4761. 738.69 s [duoids-hedgehog] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  4762. 738.69 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  4763. 738.69 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  4764. 738.69 s [duoids-hedgehog] Using tar found on system at:
  4765. 738.69 s [duoids-hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  4766. 738.69 s [duoids-hedgehog] No uhc found
  4767. 738.74 s [tasty-hedgehog] Preprocessing library for tasty-hedgehog-1.4.0.2..
  4768. 738.74 s [tasty-hedgehog] Building library for tasty-hedgehog-1.4.0.2..
  4769. 738.84 s [tasty-hedgehog] [1 of 1] Compiling Test.Tasty.Hedgehog ( src/Test/Tasty/Hedgehog.hs, dist/build/Test/Tasty/Hedgehog.o, dist/build/Test/Tasty/Hedgehog.dyn_o )
  4770. 739.01 s [duoids-hedgehog] Phase: buildPhase
  4771. 739.14 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  4772. 739.14 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  4773. 739.24 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  4774. 739.90 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  4775. 740.15 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  4776. 740.28 s [tasty-hedgehog] [1 of 1] Compiling Test.Tasty.Hedgehog ( src/Test/Tasty/Hedgehog.hs, dist/build/Test/Tasty/Hedgehog.p_o )
  4777. 740.77 s [scientific] [2 of 2] Linking dist/build/test-scientific/test-scientific
  4778. 740.95 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  4779. 741.94 s [scientific] Phase: checkPhase
  4780. 741.98 s [scientific] Running 1 test suites...
  4781. 741.98 s [scientific] Test suite test-scientific: RUNNING...
  4782. 741.99 s [scientific] scientific
  4783. 741.99 s [scientific] DoS protection
  4784. 741.99 s [scientific] Eq
  4785. 741.99 s [scientific] 1e1000000: OK
  4786. 741.99 s [scientific] Ord
  4787. 741.99 s [scientific] compare 1234e1000000 123e1000001: OK
  4788. 741.99 s [scientific] RealFrac
  4789. 741.99 s [scientific] floor
  4790. 741.99 s [scientific] 1e1000000: OK
  4791. 741.99 s [scientific] -1e-1000000: OK
  4792. 741.99 s [scientific] 1e-1000000: OK
  4793. 741.99 s [scientific] ceiling
  4794. 741.99 s [scientific] 1e1000000: OK
  4795. 741.99 s [scientific] -1e-1000000: OK
  4796. 741.99 s [scientific] 1e-1000000: OK
  4797. 741.99 s [scientific] round
  4798. 741.99 s [scientific] 1e1000000: OK
  4799. 741.99 s [scientific] -1e-1000000: OK
  4800. 741.99 s [scientific] 1e-1000000: OK
  4801. 741.99 s [scientific] truncate
  4802. 741.99 s [scientific] 1e1000000: OK
  4803. 741.99 s [scientific] -1e-1000000: OK
  4804. 741.99 s [scientific] 1e-1000000: OK
  4805. 741.99 s [scientific] properFracton
  4806. 741.99 s [scientific] 1e1000000: OK
  4807. 741.99 s [scientific] -1e-1000000: OK
  4808. 741.99 s [scientific] 1e-1000000: OK
  4809. 741.99 s [scientific] toRealFloat
  4810. 741.99 s [scientific] 1e1000000: OK
  4811. 741.99 s [scientific] 1e-1000000: OK
  4812. 741.99 s [scientific] toBoundedInteger
  4813. 741.99 s [scientific] 1e1000000: OK
  4814. 741.99 s [scientific] normalization
  4815. 742.00 s [scientific] smallcheck: OK
  4816. 742.00 s [scientific] 81 tests completed (but 9 did not meet the condition)
  4817. 742.00 s [scientific] quickcheck: OK
  4818. 742.00 s [scientific] +++ OK, passed 100 tests; 19 discarded.
  4819. 742.00 s [scientific] Binary
  4820. 742.00 s [scientific] decode . encode == id
  4821. 742.00 s [scientific] smallcheck: OK
  4822. 742.00 s [scientific] 81 tests completed
  4823. 742.00 s [scientific] quickcheck: OK
  4824. 742.00 s [scientific] +++ OK, passed 100 tests.
  4825. 742.00 s [scientific] Parsing
  4826. 742.00 s [scientific] reads "": OK
  4827. 742.00 s [scientific] reads "1.": OK
  4828. 742.00 s [scientific] reads "1.2e": OK
  4829. 742.00 s [scientific] reads "(1.3 )": OK
  4830. 742.00 s [scientific] reads "((1.3))": OK
  4831. 742.00 s [scientific] reads " 1.3": OK
  4832. 742.00 s [scientific] read " ( (( -1.0e+3 ) ))": OK
  4833. 742.00 s [scientific] scientificP "3": OK
  4834. 742.00 s [scientific] scientificP "3.0e2": OK
  4835. 742.00 s [scientific] scientificP "+3.0e+2": OK
  4836. 742.00 s [scientific] scientificP "-3.0e-2": OK
  4837. 742.00 s [scientific] Formatting
  4838. 742.00 s [scientific] read . show == id
  4839. 742.00 s [scientific] smallcheck: OK
  4840. 742.00 s [scientific] 81 tests completed
  4841. 742.00 s [scientific] quickcheck: OK
  4842. 742.00 s [scientific] +++ OK, passed 100 tests.
  4843. 742.00 s [scientific] show (Just 1): OK
  4844. 742.00 s [scientific] show (Just 0): OK
  4845. 742.00 s [scientific] show (Just (-1)): OK
  4846. 742.00 s [scientific] toDecimalDigits
  4847. 742.00 s [scientific] laws
  4848. 742.00 s [scientific] smallcheck: OK
  4849. 742.00 s [scientific] 45 tests completed
  4850. 742.00 s [scientific] quickcheck: OK
  4851. 742.00 s [scientific] +++ OK, passed 100 tests.
  4852. 742.00 s [scientific] == Numeric.floatToDigits
  4853. 742.00 s [scientific] smallcheck: OK
  4854. 742.00 s [scientific] 19 tests completed
  4855. 742.00 s [scientific] quickcheck: OK
  4856. 742.00 s [scientific] +++ OK, passed 100 tests.
  4857. 742.00 s [scientific] Builder
  4858. 742.00 s [scientific] Text
  4859. 742.00 s [scientific] smallcheck: OK
  4860. 742.00 s [scientific] 81 tests completed
  4861. 742.00 s [scientific] quickcheck: OK
  4862. 742.00 s [scientific] +++ OK, passed 100 tests.
  4863. 742.00 s [scientific] ByteString
  4864. 742.00 s [scientific] smallcheck: OK
  4865. 742.00 s [scientific] 81 tests completed
  4866. 742.00 s [scientific] quickcheck: OK
  4867. 742.00 s [scientific] +++ OK, passed 100 tests.
  4868. 742.00 s [scientific] formatScientific_fromFloatDigits
  4869. 742.00 s [scientific] smallcheck: OK
  4870. 742.00 s [scientific] 37 tests completed
  4871. 742.00 s [scientific] quickcheck: OK
  4872. 742.02 s [scientific] +++ OK, passed 100 tests.
  4873. 742.02 s [scientific] Eq
  4874. 742.02 s [scientific] ==
  4875. 742.03 s [scientific] smallcheck: OK (0.02s)
  4876. 742.03 s [scientific] 6561 tests completed
  4877. 742.04 s [scientific] quickcheck: OK (0.01s)
  4878. 742.04 s [scientific] +++ OK, passed 100 tests.
  4879. 742.04 s [scientific] s == s
  4880. 742.04 s [scientific] smallcheck: OK
  4881. 742.04 s [scientific] 81 tests completed
  4882. 742.04 s [scientific] quickcheck: OK
  4883. 742.04 s [scientific] +++ OK, passed 100 tests.
  4884. 742.04 s [scientific] Ord
  4885. 742.04 s [scientific] compare
  4886. 742.06 s [scientific] smallcheck: OK (0.02s)
  4887. 742.06 s [scientific] 6561 tests completed
  4888. 742.06 s [scientific] quickcheck: OK
  4889. 742.06 s [scientific] +++ OK, passed 100 tests.
  4890. 742.06 s [scientific] Num
  4891. 742.06 s [scientific] Equal to Rational
  4892. 742.06 s [scientific] fromInteger
  4893. 742.07 s [scientific] smallcheck: OK
  4894. 742.07 s [scientific] 11 tests completed
  4895. 742.08 s [scientific] quickcheck: OK
  4896. 742.08 s [scientific] +++ OK, passed 100 tests.
  4897. 742.08 s [scientific] +
  4898. 742.10 s [scientific] smallcheck: OK (0.02s)
  4899. 742.10 s [scientific] 6561 tests completed
  4900. 742.14 s [scientific] quickcheck: OK (0.04s)
  4901. 742.14 s [scientific] +++ OK, passed 100 tests.
  4902. 742.14 s [scientific] -
  4903. 742.16 s [scientific] smallcheck: OK (0.02s)
  4904. 742.16 s [scientific] 6561 tests completed
  4905. 742.20 s [scientific] quickcheck: OK (0.03s)
  4906. 742.20 s [scientific] +++ OK, passed 100 tests.
  4907. 742.20 s [scientific] *
  4908. 742.22 s [scientific] smallcheck: OK (0.02s)
  4909. 742.22 s [scientific] 6561 tests completed
  4910. 742.22 s [scientific] quickcheck: OK (0.02s)
  4911. 742.22 s [scientific] +++ OK, passed 100 tests.
  4912. 742.22 s [scientific] abs
  4913. 742.22 s [scientific] smallcheck: OK
  4914. 742.22 s [scientific] 81 tests completed
  4915. 742.23 s [scientific] quickcheck: OK (0.01s)
  4916. 742.23 s [scientific] +++ OK, passed 100 tests.
  4917. 742.24 s [scientific] negate
  4918. 742.24 s [scientific] smallcheck: OK
  4919. 742.25 s [scientific] 81 tests completed
  4920. 742.25 s [scientific] quickcheck: OK (0.01s)
  4921. 742.25 s [scientific] +++ OK, passed 100 tests.
  4922. 742.25 s [scientific] signum
  4923. 742.25 s [scientific] smallcheck: OK
  4924. 742.26 s [scientific] 81 tests completed
  4925. 742.26 s [scientific] quickcheck: OK
  4926. 742.26 s [scientific] +++ OK, passed 100 tests.
  4927. 742.26 s [scientific] 0 identity of +
  4928. 742.26 s [scientific] smallcheck: OK
  4929. 742.26 s [scientific] 81 tests completed
  4930. 742.39 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4931. 742.39 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4932. 742.47 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4933. 742.59 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  4934. 742.69 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4935. 743.14 s [scientific] quickcheck: OK (0.88s)
  4936. 743.14 s [scientific] +++ OK, passed 100 tests.
  4937. 743.14 s [scientific] 1 identity of *
  4938. 743.14 s [scientific] smallcheck: OK
  4939. 743.14 s [scientific] 81 tests completed
  4940. 743.14 s [scientific] quickcheck: OK
  4941. 743.14 s [scientific] +++ OK, passed 100 tests.
  4942. 743.14 s [scientific] 0 identity of *
  4943. 743.14 s [scientific] smallcheck: OK
  4944. 743.14 s [scientific] 81 tests completed
  4945. 743.14 s [scientific] quickcheck: OK
  4946. 743.15 s [scientific] +++ OK, passed 100 tests.
  4947. 743.15 s [scientific] associativity of +
  4948. 743.17 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  4949. 743.21 s [tasty-hedgehog] Phase: haddockPhase
  4950. 743.44 s [tasty-hedgehog] Preprocessing library for tasty-hedgehog-1.4.0.2..
  4951. 743.44 s [tasty-hedgehog] Running Haddock on library for tasty-hedgehog-1.4.0.2..
  4952. 743.53 s [tasty-hedgehog] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  4953. 743.98 s [tasty-hedgehog] 100% ( 11 / 11) in 'Test.Tasty.Hedgehog'
  4954. 744.13 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  4955. 744.13 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  4956. 744.36 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  4957. 744.89 s [scientific] smallcheck: OK (1.73s)
  4958. 744.89 s [scientific] 531441 tests completed
  4959. 745.28 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 )
  4960. 745.29 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  4961. 746.36 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  4962. 747.07 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4963. 747.07 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4964. 747.16 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  4965. 747.18 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  4966. 747.68 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  4967. 747.74 s [scientific] quickcheck: OK (2.86s)
  4968. 747.74 s [scientific] +++ OK, passed 100 tests.
  4969. 747.74 s [scientific] commutativity of +
  4970. 747.76 s [scientific] smallcheck: OK (0.03s)
  4971. 747.77 s [scientific] 6561 tests completed
  4972. 748.29 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  4973. 748.30 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  4974. 748.42 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 )
  4975. 748.74 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 )
  4976. 748.78 s [tasty-hedgehog] Documentation created: dist/doc/html/tasty-hedgehog/index.html,
  4977. 748.78 s [tasty-hedgehog] dist/doc/html/tasty-hedgehog/tasty-hedgehog.txt
  4978. 748.84 s [duoids-hedgehog] Phase: checkPhase
  4979. 748.87 s [tasty-hedgehog] Phase: installPhase
  4980. 748.96 s [tasty-hedgehog] Installing library in /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1
  4981. 749.28 s [duoids-hedgehog] Running 2 test suites...
  4982. 749.28 s [duoids-hedgehog] Test suite doctests: RUNNING...
  4983. 749.28 s [tasty-hedgehog] Phase: fixupPhase
  4984. 749.37 s [tasty-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2
  4985. 749.38 s [tasty-hedgehog] shrinking /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHStasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1-ghc9.6.3.so
  4986. 749.40 s [tasty-hedgehog] checking for references to /build/ in /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2...
  4987. 749.41 s [tasty-hedgehog] patching script interpreter paths in /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2
  4988. 749.42 s [tasty-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2/lib
  4989. 749.48 s [tasty-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc
  4990. 749.48 s [tasty-hedgehog] checking for references to /build/ in /nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc...
  4991. 749.49 s [tasty-hedgehog] patching script interpreter paths in /nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc
  4992. 749.69 s [tasty-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2 /nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc
  4993. 750.97 s [tasty-hedgehog:post-build] Pushing 2 paths (138 are already present) using zstd to cache sellout ⏳
  4994. 750.97 s [tasty-hedgehog:post-build]
  4995. 751.35 s [tasty-hedgehog:post-build] Pushing /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2 (924.43 KiB)
  4996. 751.47 s [tasty-hedgehog:post-build] Pushing /nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc (349.05 KiB)
  4997. 752.43 s [tasty-hedgehog:post-build]
  4998. 752.43 s [tasty-hedgehog:post-build] All done.
  4999. 752.67 s [tasty-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2 /nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc
  5000. 753.22 s [tasty-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5001. 753.57 s [tasty-hedgehog:post-build] copying 2 paths...
  5002. 753.57 s [tasty-hedgehog:post-build] copying path '/nix/store/yg6l2pxfd23m5dk6blnxlpy1fnafwxav-tasty-hedgehog-1.4.0.2-doc' to 'https://cache.nix-ci.com'...
  5003. 753.94 s [tasty-hedgehog:post-build] copying path '/nix/store/6gfpnhl1kz7jas61lx55k56c592r38ny-tasty-hedgehog-1.4.0.2' to 'https://cache.nix-ci.com'...
  5004. 755.12 s [tasty-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5005. 755.52 s [tasty-hedgehog:post-build] copying 1 paths...
  5006. 755.57 s [tasty-hedgehog:post-build] copying path '/nix/store/aiw4scijz7q4iwi0llfsyy8gmh90gfna-tasty-hedgehog-1.4.0.2.drv' to 'https://cache.nix-ci.com'...
  5007. 755.91 s Progress: 100 of 114 built (3 building), 172 of 172 downloaded from cache
  5008. 755.91 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  5009. 755.91 s [duoids-hedgehog] Test suite doctests: PASS
  5010. 755.91 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  5011. 755.91 s [duoids-hedgehog] Test suite laws: RUNNING...
  5012. 755.91 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  5013. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5014. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5015. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5016. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5017. 755.91 s [duoids-hedgehog] ✓ 4 succeeded.
  5018. 755.91 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  5019. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5020. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5021. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5022. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5023. 755.91 s [duoids-hedgehog] ✓ 4 succeeded.
  5024. 755.91 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  5025. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5026. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5027. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5028. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5029. 755.91 s [duoids-hedgehog] ✓ 4 succeeded.
  5030. 755.91 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  5031. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5032. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5033. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5034. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5035. 755.91 s [duoids-hedgehog] ✓ 4 succeeded.
  5036. 755.91 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  5037. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5038. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5039. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5040. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5041. 755.91 s [duoids-hedgehog] ✓ 4 succeeded.
  5042. 755.91 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  5043. 755.91 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5044. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5045. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5046. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5047. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5048. 755.91 s [duoids-hedgehog] ✓ 5 succeeded.
  5049. 755.91 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  5050. 755.91 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5051. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5052. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5053. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5054. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5055. 755.91 s [duoids-hedgehog] ✓ 5 succeeded.
  5056. 755.91 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  5057. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5058. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5059. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5060. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5061. 755.91 s [duoids-hedgehog] ✓ 4 succeeded.
  5062. 755.91 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  5063. 755.91 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5064. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5065. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5066. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5067. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5068. 755.91 s [duoids-hedgehog] ✓ 5 succeeded.
  5069. 755.91 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  5070. 755.91 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5071. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5072. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5073. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5074. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5075. 755.91 s [duoids-hedgehog] ✓ 5 succeeded.
  5076. 755.91 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  5077. 755.91 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5078. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5079. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5080. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5081. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5082. 755.91 s [duoids-hedgehog] ✓ 5 succeeded.
  5083. 755.91 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  5084. 755.91 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5085. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5086. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5087. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5088. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5089. 755.91 s [duoids-hedgehog] ✓ 5 succeeded.
  5090. 755.91 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  5091. 755.91 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5092. 755.91 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5093. 755.91 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5094. 755.91 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5095. 755.91 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5096. 755.91 s [duoids-hedgehog] ✓ 5 succeeded.
  5097. 755.91 s [duoids-hedgehog] Test suite laws: PASS
  5098. 755.91 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  5099. 755.91 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  5100. 755.91 s [duoids-hedgehog] Phase: haddockPhase
  5101. 755.91 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  5102. 755.91 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  5103. 755.91 s [duoids-hedgehog] 33% ( 1 / 3) in 'Test.Duoid'
  5104. 755.91 s [duoids-hedgehog] Missing documentation for:
  5105. 755.91 s [duoids-hedgehog] validate (src/Test/Duoid.hs:66)
  5106. 755.91 s [duoids-hedgehog] validateNormal (src/Test/Duoid.hs:76)
  5107. 755.91 s [duoids-hedgehog] 50% ( 1 / 2) in 'Test.Duoidal'
  5108. 755.91 s [duoids-hedgehog] Missing documentation for:
  5109. 755.91 s [duoids-hedgehog] validate (src/Test/Duoidal.hs:84)
  5110. 755.91 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  5111. 755.91 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  5112. 755.91 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  5113. 755.91 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  5114. 755.91 s [duoids-hedgehog] Phase: installPhase
  5115. 755.91 s [duoids-hedgehog] Installing library in /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  5116. 755.91 s [duoids-hedgehog] Phase: fixupPhase
  5117. 755.91 s [scientific] quickcheck: OK (1.98s)
  5118. 755.91 s [scientific] +++ OK, passed 100 tests.
  5119. 755.91 s [scientific] distributivity of * over +
  5120. 755.91 s [scientific] smallcheck: OK (1.70s)
  5121. 755.91 s [scientific] 531441 tests completed
  5122. 755.91 s [scientific] quickcheck: OK (1.54s)
  5123. 755.91 s [scientific] +++ OK, passed 100 tests.
  5124. 755.91 s [scientific] subtracting the addition
  5125. 755.91 s [scientific] smallcheck: OK (0.02s)
  5126. 755.91 s [scientific] 6561 tests completed
  5127. 755.91 s [scientific] quickcheck: OK (2.53s)
  5128. 755.91 s [scientific] +++ OK, passed 100 tests.
  5129. 755.91 s [scientific] + and negate
  5130. 755.91 s [scientific] smallcheck: OK
  5131. 755.91 s [scientific] 81 tests completed
  5132. 755.91 s [scientific] quickcheck: OK
  5133. 755.91 s [scientific] +++ OK, passed 100 tests.
  5134. 755.91 s [scientific] - and negate
  5135. 755.91 s [scientific] smallcheck: OK
  5136. 755.91 s [scientific] 81 tests completed
  5137. 755.91 s [scientific] quickcheck: OK
  5138. 755.91 s [scientific] +++ OK, passed 100 tests.
  5139. 755.91 s [scientific] abs . negate == id
  5140. 755.91 s [scientific] smallcheck: OK
  5141. 755.91 s [scientific] 45 tests completed
  5142. 755.91 s [scientific] quickcheck: OK
  5143. 755.91 s [scientific] +++ OK, passed 100 tests.
  5144. 755.91 s [scientific] Real
  5145. 755.91 s [scientific] fromRational . toRational == id
  5146. 755.91 s [scientific] smallcheck: OK
  5147. 755.91 s [scientific] 81 tests completed
  5148. 755.91 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0
  5149. 755.91 s [duoids-hedgehog] shrinking /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSduoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9-ghc9.6.3.so
  5150. 755.91 s [duoids-hedgehog] checking for references to /build/ in /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0...
  5151. 755.92 s [duoids-hedgehog] patching script interpreter paths in /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0
  5152. 755.93 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/lib
  5153. 756.02 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc
  5154. 756.03 s [duoids-hedgehog] checking for references to /build/ in /nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc...
  5155. 756.05 s [duoids-hedgehog] patching script interpreter paths in /nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc
  5156. 756.25 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0 /nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc
  5157. 757.60 s [duoids-hedgehog:post-build] Pushing 2 paths (132 are already present) using zstd to cache sellout ⏳
  5158. 757.60 s [duoids-hedgehog:post-build]
  5159. 758.04 s [duoids-hedgehog:post-build] Pushing /nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc (297.44 KiB)
  5160. 758.21 s [duoids-hedgehog:post-build] Pushing /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0 (495.91 KiB)
  5161. 759.14 s [duoids-hedgehog:post-build]
  5162. 759.14 s [duoids-hedgehog:post-build] All done.
  5163. 759.27 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0 /nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc
  5164. 759.71 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5165. 759.77 s [duoids-hedgehog:post-build] copying 2 paths...
  5166. 759.77 s [duoids-hedgehog:post-build] copying path '/nix/store/lbwdmzwa789x64ynxjkzbzh8qg5zs048-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  5167. 760.23 s [duoids-hedgehog:post-build] copying path '/nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  5168. 760.86 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5169. 761.14 s [duoids-hedgehog:post-build] copying 1 paths...
  5170. 761.23 s [duoids-hedgehog:post-build] copying path '/nix/store/zrzmyf319grqw2rx1ckw5agf3lb5wipj-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  5171. 761.48 s Progress: 101 of 114 built (2 building), 172 of 172 downloaded from cache
  5172. 761.49 s [scientific] quickcheck: OK (1.69s)
  5173. 761.49 s [scientific] +++ OK, passed 100 tests.
  5174. 761.49 s [scientific] RealFrac
  5175. 761.49 s [scientific] Equal to Rational
  5176. 761.49 s [scientific] properFraction
  5177. 761.49 s [scientific] smallcheck: OK
  5178. 761.49 s [scientific] 81 tests completed
  5179. 761.49 s [scientific] quickcheck: OK (0.97s)
  5180. 761.49 s [scientific] +++ OK, passed 100 tests.
  5181. 761.49 s [scientific] round
  5182. 761.49 s [scientific] smallcheck: OK
  5183. 761.49 s [scientific] 81 tests completed
  5184. 761.49 s [scientific] quickcheck: OK
  5185. 761.49 s [scientific] +++ OK, passed 100 tests.
  5186. 761.49 s [scientific] truncate
  5187. 761.49 s [scientific] smallcheck: OK
  5188. 761.49 s [scientific] 81 tests completed
  5189. 761.49 s [scientific] quickcheck: OK
  5190. 761.49 s [scientific] +++ OK, passed 100 tests.
  5191. 761.49 s [scientific] ceiling
  5192. 761.49 s [scientific] smallcheck: OK
  5193. 761.49 s [scientific] 81 tests completed
  5194. 761.49 s [scientific] quickcheck: OK
  5195. 761.49 s [scientific] +++ OK, passed 100 tests.
  5196. 761.49 s [scientific] floor
  5197. 761.49 s [scientific] smallcheck: OK
  5198. 761.49 s [scientific] 81 tests completed
  5199. 761.49 s [scientific] quickcheck: OK
  5200. 761.49 s [scientific] +++ OK, passed 100 tests.
  5201. 761.49 s [scientific] properFraction_laws
  5202. 761.49 s [scientific] smallcheck: OK
  5203. 761.49 s [scientific] 81 tests completed
  5204. 761.49 s [scientific] quickcheck: OK (1.20s)
  5205. 761.49 s [scientific] +++ OK, passed 100 tests.
  5206. 761.49 s [scientific] round
  5207. 761.49 s [scientific] smallcheck: OK
  5208. 761.49 s [scientific] 81 tests completed
  5209. 761.49 s [scientific] quickcheck: OK (0.01s)
  5210. 761.49 s [scientific] +++ OK, passed 100 tests.
  5211. 761.49 s [scientific] truncate
  5212. 761.49 s [scientific] smallcheck: OK
  5213. 761.49 s [scientific] 81 tests completed
  5214. 761.49 s [scientific] quickcheck: OK
  5215. 761.49 s [scientific] +++ OK, passed 100 tests.
  5216. 761.49 s [scientific] ceiling
  5217. 761.49 s [scientific] smallcheck: OK
  5218. 761.49 s [scientific] 81 tests completed
  5219. 761.49 s [scientific] quickcheck: OK
  5220. 761.49 s [scientific] +++ OK, passed 100 tests.
  5221. 761.49 s [scientific] floor
  5222. 761.49 s [scientific] smallcheck: OK
  5223. 761.49 s [scientific] 81 tests completed
  5224. 761.49 s [scientific] quickcheck: OK
  5225. 761.49 s [scientific] +++ OK, passed 100 tests.
  5226. 761.49 s [scientific] Conversions
  5227. 761.49 s [scientific] fromRationalRepetend
  5228. 761.50 s [scientific] smallcheck: OK
  5229. 761.50 s [scientific] 189 tests completed
  5230. 761.50 s [scientific] quickcheck: OK
  5231. 761.50 s [scientific] +++ OK, passed 100 tests.
  5232. 761.50 s [scientific] Float
  5233. 761.50 s [scientific] toRealFloat
  5234. 761.50 s [scientific] smallcheck: OK
  5235. 761.50 s [scientific] 37 tests completed
  5236. 761.50 s [scientific] quickcheck: OK
  5237. 761.50 s [scientific] +++ OK, passed 100 tests.
  5238. 761.50 s [scientific] toRealFloat . fromFloatDigits == id
  5239. 761.50 s [scientific] smallcheck: OK
  5240. 761.50 s [scientific] 37 tests completed
  5241. 761.50 s [scientific] quickcheck: OK
  5242. 761.50 s [scientific] +++ OK, passed 100 tests.
  5243. 761.50 s [scientific] Double
  5244. 761.50 s [scientific] toRealFloat
  5245. 761.50 s [scientific] smallcheck: OK
  5246. 761.50 s [scientific] 37 tests completed
  5247. 761.50 s [scientific] quickcheck: OK
  5248. 761.50 s [scientific] +++ OK, passed 100 tests.
  5249. 761.50 s [scientific] toRealFloat . fromFloatDigits == id
  5250. 761.50 s [scientific] smallcheck: OK
  5251. 761.50 s [scientific] 37 tests completed
  5252. 761.50 s [scientific] quickcheck: OK
  5253. 761.50 s [scientific] +++ OK, passed 100 tests.
  5254. 761.50 s [scientific] floatingOrInteger
  5255. 761.50 s [scientific] correct conversion
  5256. 761.50 s [scientific] smallcheck: OK
  5257. 761.50 s [scientific] 81 tests completed
  5258. 761.50 s [scientific] quickcheck: OK
  5259. 761.50 s [scientific] +++ OK, passed 100 tests.
  5260. 761.50 s [scientific] Integer == Right
  5261. 761.50 s [scientific] smallcheck: OK
  5262. 761.50 s [scientific] 11 tests completed
  5263. 761.50 s [scientific] quickcheck: OK
  5264. 761.50 s [scientific] +++ OK, passed 100 tests.
  5265. 761.50 s [scientific] Double == Left
  5266. 761.50 s [scientific] smallcheck: OK
  5267. 761.50 s [scientific] 37 tests completed (but 21 did not meet the condition)
  5268. 761.50 s [scientific] quickcheck: OK
  5269. 761.50 s [scientific] +++ OK, passed 100 tests; 59 discarded.
  5270. 761.50 s [scientific] toBoundedInteger
  5271. 761.50 s [scientific] correct conversion
  5272. 761.50 s [scientific] Int64
  5273. 761.50 s [scientific] smallcheck: OK
  5274. 761.50 s [scientific] 81 tests completed
  5275. 761.50 s [scientific] quickcheck: OK
  5276. 761.50 s [scientific] +++ OK, passed 100 tests.
  5277. 761.50 s [scientific] Word64
  5278. 761.50 s [scientific] smallcheck: OK
  5279. 761.50 s [scientific] 81 tests completed
  5280. 761.50 s [scientific] quickcheck: OK
  5281. 761.50 s [scientific] +++ OK, passed 100 tests.
  5282. 761.50 s [scientific] NegativeNum
  5283. 761.50 s [scientific] smallcheck: OK
  5284. 761.50 s [scientific] 81 tests completed
  5285. 761.50 s [scientific] quickcheck: OK
  5286. 761.50 s [scientific] +++ OK, passed 100 tests.
  5287. 761.50 s [scientific] toBoundedRealFloat
  5288. 761.50 s [scientific] 0 * 10^1000 == 0: OK
  5289. 761.50 s [scientific] toBoundedInteger
  5290. 761.50 s [scientific] to Int64
  5291. 761.50 s [scientific] succ of maxBound: OK
  5292. 761.50 s [scientific] pred of minBound: OK
  5293. 761.50 s [scientific] 0 * 10^1000 == 0: OK
  5294. 761.50 s [scientific] Predicates
  5295. 761.50 s [scientific] isFloating
  5296. 761.50 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 )
  5297. 761.50 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 )
  5298. 761.50 s [scientific] smallcheck: OK
  5299. 761.50 s [scientific] 81 tests completed
  5300. 761.50 s [scientific] quickcheck: OK (0.42s)
  5301. 761.50 s [scientific] +++ OK, passed 100 tests.
  5302. 761.50 s [scientific] isInteger
  5303. 761.50 s [scientific] smallcheck: OK
  5304. 761.50 s [scientific] 81 tests completed
  5305. 761.76 s [scientific] quickcheck: OK (1.86s)
  5306. 761.76 s [scientific] +++ OK, passed 100 tests.
  5307. 761.76 s [scientific]
  5308. 761.76 s [scientific] All 142 tests passed (19.77s)
  5309. 761.90 s [scientific] Test suite test-scientific: PASS
  5310. 761.90 s [scientific] Test suite logged to: dist/test/scientific-0.3.8.0-test-scientific.log
  5311. 761.90 s [scientific] 1 of 1 test suites (1 of 1 test cases) passed.
  5312. 761.91 s [scientific] Phase: haddockPhase
  5313. 762.08 s [scientific] Preprocessing library for scientific-0.3.8.0..
  5314. 762.08 s [scientific] Running Haddock on library for scientific-0.3.8.0..
  5315. 762.14 s [scientific] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  5316. 762.87 s [scientific] Warning: 'base10exponent' is out of scope.
  5317. 762.87 s [scientific] If you qualify the identifier, haddock can try to link it anyway.
  5318. 762.89 s [scientific] 100% ( 31 / 31) in 'Data.Scientific'
  5319. 763.10 s [scientific] 75% ( 3 / 4) in 'Data.Text.Lazy.Builder.Scientific'
  5320. 763.10 s [scientific] Missing documentation for:
  5321. 763.10 s [scientific] Module header
  5322. 763.21 s [scientific]
  5323. 763.21 s [scientific] src/Data/Text/Lazy/Builder/Scientific.hs:19:1: warning: [-Wunused-imports]
  5324. 763.21 s [scientific] The import of ‘Data.Monoid’ is redundant
  5325. 763.21 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  5326. 763.21 s [scientific] To import instances alone, use: import Data.Monoid()
  5327. 763.21 s [scientific] |
  5328. 763.21 s [scientific] 19 | import Data.Monoid ((<>))
  5329. 763.21 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  5330. 763.23 s [scientific] 75% ( 3 / 4) in 'Data.ByteString.Builder.Scientific'
  5331. 763.23 s [scientific] Missing documentation for:
  5332. 763.23 s [scientific] Module header
  5333. 763.23 s [scientific]
  5334. 763.23 s [scientific] src/Data/ByteString/Builder/Scientific.hs:20:1: warning: [-Wunused-imports]
  5335. 763.23 s [scientific] The import of ‘Data.Monoid’ is redundant
  5336. 763.23 s [scientific] except perhaps to import instances from ‘Data.Monoid’
  5337. 763.23 s [scientific] To import instances alone, use: import Data.Monoid()
  5338. 763.23 s [scientific] |
  5339. 763.24 s [scientific] 20 | import Data.Monoid ((<>))
  5340. 763.24 s [scientific] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  5341. 767.42 s [scientific] Documentation created: dist/doc/html/scientific/index.html,
  5342. 767.42 s [scientific] dist/doc/html/scientific/scientific.txt
  5343. 767.50 s [scientific] Preprocessing test suite 'test-scientific' for scientific-0.3.8.0..
  5344. 767.58 s [scientific] Phase: installPhase
  5345. 767.60 s [scientific] Installing library in /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  5346. 767.95 s [scientific] Phase: fixupPhase
  5347. 767.99 s [scientific] shrinking RPATHs of ELF executables and libraries in /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0
  5348. 767.99 s [scientific] shrinking /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSscientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj-ghc9.6.3.so
  5349. 768.00 s [scientific] checking for references to /build/ in /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0...
  5350. 768.02 s [scientific] patching script interpreter paths in /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0
  5351. 768.03 s [scientific] stripping (with command strip and flags -S -p) in /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0/lib
  5352. 768.13 s [scientific] shrinking RPATHs of ELF executables and libraries in /nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc
  5353. 768.14 s [scientific] checking for references to /build/ in /nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc...
  5354. 768.15 s [scientific] patching script interpreter paths in /nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc
  5355. 768.27 s [scientific:post-build] Uploading to cachix cache "sellout": /nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0
  5356. 768.85 s [scientific:post-build] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  5357. 768.85 s [scientific:post-build]
  5358. 769.22 s [scientific:post-build] Pushing /nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc (986.93 KiB)
  5359. 769.31 s [scientific:post-build] Pushing /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0 (2.94 MiB)
  5360. 771.12 s [scientific:post-build]
  5361. 771.12 s [scientific:post-build] All done.
  5362. 771.24 s [scientific:post-build] Uploading to the NixCI cache: /nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc /nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0
  5363. 771.51 s [scientific:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5364. 771.80 s [scientific:post-build] copying 2 paths...
  5365. 771.80 s [scientific:post-build] copying path '/nix/store/496mnzivp1s67bnr2gaqnl50jh058sn8-scientific-0.3.8.0-doc' to 'https://cache.nix-ci.com'...
  5366. 772.40 s [scientific:post-build] copying path '/nix/store/rf1id4f51j2dh0b87gf5djv37hifdykd-scientific-0.3.8.0' to 'https://cache.nix-ci.com'...
  5367. 773.91 s [scientific:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5368. 774.22 s [scientific:post-build] copying 1 paths...
  5369. 774.27 s [scientific:post-build] copying path '/nix/store/yqwmlnz4s14y254s1l3day9fhabjxvwd-scientific-0.3.8.0.drv' to 'https://cache.nix-ci.com'...
  5370. 774.49 s Progress: 102 of 113 built (1 building), 172 of 172 downloaded from cache
  5371. 774.49 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 )
  5372. 796.34 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 )
  5373. 796.38 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 )
  5374. 796.38 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 )
  5375. 796.38 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 )
  5376. 796.38 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 )
  5377. 796.38 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 )
  5378. 796.38 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 )
  5379. 797.41 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  5380. 799.13 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  5381. 799.13 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  5382. 799.24 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 )
  5383. 804.00 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 )
  5384. 804.04 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 )
  5385. 804.42 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 )
  5386. 804.42 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 )
  5387. 804.42 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 )
  5388. 804.42 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 )
  5389. 804.42 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 )
  5390. 804.42 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 )
  5391. 804.42 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 )
  5392. 804.42 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 )
  5393. 804.42 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 )
  5394. 804.42 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 )
  5395. 804.42 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 )
  5396. 804.90 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 )
  5397. 814.46 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 )
  5398. 814.50 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 )
  5399. 814.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.p_o )
  5400. 814.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.p_o )
  5401. 814.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.p_o )
  5402. 814.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.p_o )
  5403. 814.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.p_o )
  5404. 814.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.p_o )
  5405. 814.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.p_o )
  5406. 814.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.p_o )
  5407. 814.50 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  5408. 814.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.p_o )
  5409. 814.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.p_o )
  5410. 817.96 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  5411. 817.96 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  5412. 818.15 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  5413. 818.70 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  5414. 824.13 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  5415. 824.14 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  5416. 824.43 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 )
  5417. 825.02 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 )
  5418. 827.72 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 )
  5419. 827.72 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 )
  5420. 829.25 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 )
  5421. 829.84 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 )
  5422. 829.84 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 )
  5423. 829.84 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 )
  5424. 829.84 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 )
  5425. 829.84 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 )
  5426. 829.84 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 )
  5427. 829.84 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 )
  5428. 831.29 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  5429. 833.19 s [vector] buildPhase completed in 3 minutes 27 seconds
  5430. 833.19 s [vector] Phase: checkPhase
  5431. 833.25 s [vector] Running 2 test suites...
  5432. 833.25 s [vector] Test suite vector-tests-O0: RUNNING...
  5433. 833.31 s [vector] toplevel
  5434. 833.31 s [vector] Data.Vector.Fusion.Bundle
  5435. 833.31 s [vector] fromList.toList == id: OK
  5436. 833.31 s [vector] +++ OK, passed 100 tests.
  5437. 833.31 s [vector] toList.fromList == id: OK
  5438. 833.31 s [vector] +++ OK, passed 100 tests.
  5439. 833.31 s [vector] eq: OK
  5440. 833.31 s [vector] +++ OK, passed 100 tests.
  5441. 833.32 s [vector] length: OK
  5442. 833.32 s [vector] +++ OK, passed 100 tests.
  5443. 833.32 s [vector] null: OK
  5444. 833.32 s [vector] +++ OK, passed 100 tests.
  5445. 833.32 s [vector] empty: OK
  5446. 833.32 s [vector] +++ OK, passed 1 test.
  5447. 833.32 s [vector] singleton: OK
  5448. 833.32 s [vector] +++ OK, passed 100 tests.
  5449. 833.32 s [vector] replicate: OK (0.02s)
  5450. 833.32 s [vector] +++ OK, passed 100 tests.
  5451. 833.32 s [vector] cons: OK
  5452. 833.32 s [vector] +++ OK, passed 100 tests.
  5453. 833.32 s [vector] snoc: OK
  5454. 833.32 s [vector] +++ OK, passed 100 tests.
  5455. 833.32 s [vector] append: OK
  5456. 833.32 s [vector] +++ OK, passed 100 tests.
  5457. 833.32 s [vector] head: OK
  5458. 833.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5459. 833.32 s [vector] last: OK
  5460. 833.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5461. 833.32 s [vector] index: OK
  5462. 833.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5463. 833.32 s [vector] extract: OK
  5464. 833.32 s [vector] +++ OK, passed 100 tests.
  5465. 833.32 s [vector] init: OK
  5466. 833.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5467. 833.32 s [vector] tail: OK
  5468. 833.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5469. 833.32 s [vector] take: OK
  5470. 833.32 s [vector] +++ OK, passed 100 tests.
  5471. 833.32 s [vector] drop: OK
  5472. 833.32 s [vector] +++ OK, passed 100 tests.
  5473. 833.32 s [vector] map: OK
  5474. 833.32 s [vector] +++ OK, passed 100 tests.
  5475. 833.33 s [vector] zipWith: OK
  5476. 833.33 s [vector] +++ OK, passed 100 tests.
  5477. 833.33 s [vector] zipWith3: OK
  5478. 833.35 s [vector] +++ OK, passed 100 tests.
  5479. 833.35 s [vector] filter: OK
  5480. 833.35 s [vector] +++ OK, passed 100 tests.
  5481. 833.35 s [vector] takeWhile: OK
  5482. 833.35 s [vector] +++ OK, passed 100 tests.
  5483. 833.35 s [vector] dropWhile: OK
  5484. 833.35 s [vector] +++ OK, passed 100 tests.
  5485. 833.35 s [vector] elem: OK
  5486. 833.35 s [vector] +++ OK, passed 100 tests.
  5487. 833.35 s [vector] notElem: OK
  5488. 833.35 s [vector] +++ OK, passed 100 tests.
  5489. 833.35 s [vector] find: OK
  5490. 833.35 s [vector] +++ OK, passed 100 tests.
  5491. 833.35 s [vector] findIndex: OK
  5492. 833.35 s [vector] +++ OK, passed 100 tests.
  5493. 833.35 s [vector] foldl: OK
  5494. 833.35 s [vector] +++ OK, passed 100 tests.
  5495. 833.35 s [vector] foldl1: OK
  5496. 833.35 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5497. 833.35 s [vector] foldl': OK
  5498. 833.35 s [vector] +++ OK, passed 100 tests.
  5499. 833.35 s [vector] foldl1': OK
  5500. 833.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5501. 833.35 s [vector] foldr: OK
  5502. 833.35 s [vector] +++ OK, passed 100 tests.
  5503. 833.35 s [vector] foldr1: OK
  5504. 833.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5505. 833.35 s [vector] prescanl: OK
  5506. 833.35 s [vector] +++ OK, passed 100 tests.
  5507. 833.35 s [vector] prescanl': OK
  5508. 833.35 s [vector] +++ OK, passed 100 tests.
  5509. 833.35 s [vector] postscanl: OK
  5510. 833.36 s [vector] +++ OK, passed 100 tests.
  5511. 833.36 s [vector] postscanl': OK
  5512. 833.36 s [vector] +++ OK, passed 100 tests.
  5513. 833.36 s [vector] scanl: OK
  5514. 833.36 s [vector] +++ OK, passed 100 tests.
  5515. 833.38 s [vector] scanl': OK (0.02s)
  5516. 833.38 s [vector] +++ OK, passed 100 tests.
  5517. 833.38 s [vector] scanl1: OK
  5518. 833.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5519. 833.38 s [vector] scanl1': OK
  5520. 833.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5521. 833.38 s [vector] concatMap: OK
  5522. 833.39 s [vector] +++ OK, passed 100 tests.
  5523. 833.39 s [vector] unfoldr: OK
  5524. 833.39 s [vector] +++ OK, passed 100 tests.
  5525. 833.39 s [vector] and: OK
  5526. 833.39 s [vector] +++ OK, passed 100 tests.
  5527. 833.39 s [vector] or: OK
  5528. 833.39 s [vector] +++ OK, passed 100 tests.
  5529. 833.39 s [vector] Tests.Vector.Boxed
  5530. 833.39 s [vector] Bool
  5531. 833.39 s [vector] fromList.toList == id: OK
  5532. 833.39 s [vector] +++ OK, passed 100 tests.
  5533. 833.39 s [vector] toList.fromList == id: OK
  5534. 833.39 s [vector] +++ OK, passed 100 tests.
  5535. 833.39 s [vector] unstream.stream == id: OK
  5536. 833.39 s [vector] +++ OK, passed 100 tests.
  5537. 833.39 s [vector] stream.unstream == id: OK
  5538. 833.39 s [vector] +++ OK, passed 100 tests.
  5539. 833.39 s [vector] eq: OK
  5540. 833.39 s [vector] +++ OK, passed 100 tests.
  5541. 833.39 s [vector] length: OK
  5542. 833.39 s [vector] +++ OK, passed 100 tests.
  5543. 833.39 s [vector] null: OK
  5544. 833.39 s [vector] +++ OK, passed 100 tests.
  5545. 833.39 s [vector] index: OK
  5546. 833.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5547. 833.39 s [vector] safeIndex: OK
  5548. 833.39 s [vector] +++ OK, passed 100 tests.
  5549. 833.39 s [vector] head: OK
  5550. 833.39 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5551. 833.39 s [vector] last: OK
  5552. 833.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5553. 833.39 s [vector] unsafeIndex: OK
  5554. 833.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5555. 833.39 s [vector] unsafeHead: OK
  5556. 833.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5557. 833.39 s [vector] unsafeLast: OK
  5558. 833.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5559. 833.39 s [vector] slice: OK
  5560. 833.39 s [vector] +++ OK, passed 100 tests.
  5561. 833.40 s [vector] init: OK
  5562. 833.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5563. 833.40 s [vector] tail: OK
  5564. 833.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5565. 833.40 s [vector] take: OK
  5566. 833.40 s [vector] +++ OK, passed 100 tests.
  5567. 833.40 s [vector] drop: OK
  5568. 833.40 s [vector] +++ OK, passed 100 tests.
  5569. 833.40 s [vector] splitAt: OK
  5570. 833.40 s [vector] +++ OK, passed 100 tests.
  5571. 833.40 s [vector] empty: OK
  5572. 833.40 s [vector] +++ OK, passed 1 test.
  5573. 833.40 s [vector] singleton: OK
  5574. 833.40 s [vector] +++ OK, passed 100 tests.
  5575. 833.40 s [vector] replicate: OK
  5576. 833.40 s [vector] +++ OK, passed 100 tests.
  5577. 833.40 s [vector] generate: OK
  5578. 833.40 s [vector] +++ OK, passed 100 tests.
  5579. 833.40 s [vector] iterateN: OK
  5580. 833.40 s [vector] +++ OK, passed 100 tests.
  5581. 833.49 s [vector] iterateNM: OK (0.04s)
  5582. 833.49 s [vector] +++ OK, passed 100 tests.
  5583. 833.50 s [vector] generateM: OK (0.03s)
  5584. 833.50 s [vector] +++ OK, passed 100 tests.
  5585. 833.52 s [vector] replicateM: OK (0.02s)
  5586. 833.52 s [vector] +++ OK, passed 100 tests.
  5587. 833.52 s [vector] create: OK
  5588. 833.52 s [vector] +++ OK, passed 100 tests.
  5589. 833.52 s [vector] createT: OK
  5590. 833.52 s [vector] +++ OK, passed 100 tests.
  5591. 833.52 s [vector] unfoldr: OK
  5592. 833.52 s [vector] +++ OK, passed 100 tests.
  5593. 833.52 s [vector] unfoldrN: OK
  5594. 833.52 s [vector] +++ OK, passed 100 tests.
  5595. 833.52 s [vector] unfoldrExactN: OK
  5596. 833.52 s [vector] +++ OK, passed 100 tests.
  5597. 833.52 s [vector] unfoldrM: OK
  5598. 833.55 s [vector] +++ OK, passed 100 tests.
  5599. 833.55 s [vector] unfoldrNM: OK
  5600. 833.55 s [vector] +++ OK, passed 100 tests.
  5601. 833.58 s [vector] unfoldrExactNM: OK (0.06s)
  5602. 833.58 s [vector] +++ OK, passed 100 tests.
  5603. 833.59 s [vector] constructN: OK
  5604. 833.59 s [vector] +++ OK, passed 100 tests.
  5605. 833.59 s [vector] constructrN: OK
  5606. 833.59 s [vector] +++ OK, passed 100 tests.
  5607. 833.59 s [vector] cons: OK
  5608. 833.59 s [vector] +++ OK, passed 100 tests.
  5609. 833.59 s [vector] snoc: OK
  5610. 833.59 s [vector] +++ OK, passed 100 tests.
  5611. 833.59 s [vector] append: OK
  5612. 833.59 s [vector] +++ OK, passed 100 tests.
  5613. 833.60 s [vector] concat: OK
  5614. 833.60 s [vector] +++ OK, passed 100 tests.
  5615. 833.60 s [vector] force: OK
  5616. 833.60 s [vector] +++ OK, passed 100 tests.
  5617. 833.60 s [vector] upd: OK
  5618. 833.60 s [vector] +++ OK, passed 100 tests.
  5619. 833.61 s [vector] accum: OK
  5620. 833.61 s [vector] +++ OK, passed 100 tests.
  5621. 833.61 s [vector] reverse: OK
  5622. 833.61 s [vector] +++ OK, passed 100 tests.
  5623. 833.61 s [vector] backpermute: OK
  5624. 833.61 s [vector] +++ OK, passed 100 tests.
  5625. 833.61 s [vector] map: OK
  5626. 833.61 s [vector] +++ OK, passed 100 tests.
  5627. 833.61 s [vector] imap: OK
  5628. 833.61 s [vector] +++ OK, passed 100 tests.
  5629. 833.61 s [vector] concatMap: OK
  5630. 833.61 s [vector] +++ OK, passed 100 tests.
  5631. 833.61 s [vector] mapM: OK
  5632. 833.62 s [vector] +++ OK, passed 100 tests.
  5633. 833.63 s [vector] mapM_: OK (0.01s)
  5634. 833.63 s [vector] +++ OK, passed 100 tests.
  5635. 833.64 s [vector] forM: OK
  5636. 833.64 s [vector] +++ OK, passed 100 tests.
  5637. 833.64 s [vector] forM_: OK (0.01s)
  5638. 833.64 s [vector] +++ OK, passed 100 tests.
  5639. 833.64 s [vector] imapM: OK
  5640. 833.64 s [vector] +++ OK, passed 100 tests.
  5641. 833.66 s [vector] imapM_: OK (0.01s)
  5642. 833.66 s [vector] +++ OK, passed 100 tests.
  5643. 833.66 s [vector] zipWith: OK
  5644. 833.66 s [vector] +++ OK, passed 100 tests.
  5645. 833.66 s [vector] zipWith3: OK
  5646. 833.66 s [vector] +++ OK, passed 100 tests.
  5647. 833.66 s [vector] izipWith: OK
  5648. 833.66 s [vector] +++ OK, passed 100 tests.
  5649. 833.66 s [vector] izipWith3: OK
  5650. 833.66 s [vector] +++ OK, passed 100 tests.
  5651. 833.67 s [vector] izipWithM: OK
  5652. 833.68 s [vector] +++ OK, passed 100 tests.
  5653. 833.68 s [vector] izipWithM_: OK (0.01s)
  5654. 833.68 s [vector] +++ OK, passed 100 tests.
  5655. 833.68 s [vector] zipWithM: OK
  5656. 833.68 s [vector] +++ OK, passed 100 tests.
  5657. 833.69 s [vector] zipWithM_: OK
  5658. 833.69 s [vector] +++ OK, passed 100 tests.
  5659. 833.69 s [vector] filter: OK
  5660. 833.69 s [vector] +++ OK, passed 100 tests.
  5661. 833.70 s [vector] ifilter: OK
  5662. 833.70 s [vector] +++ OK, passed 100 tests.
  5663. 833.73 s [vector] filterM: OK (0.03s)
  5664. 833.73 s [vector] +++ OK, passed 100 tests.
  5665. 833.73 s [vector] uniq: OK (0.01s)
  5666. 833.73 s [vector] +++ OK, passed 100 tests.
  5667. 833.73 s [vector] mapMaybe: OK
  5668. 833.73 s [vector] +++ OK, passed 100 tests.
  5669. 833.73 s [vector] imapMaybe: OK
  5670. 833.74 s [vector] +++ OK, passed 100 tests.
  5671. 833.74 s [vector] takeWhile: OK
  5672. 833.74 s [vector] +++ OK, passed 100 tests.
  5673. 833.74 s [vector] dropWhile: OK
  5674. 833.74 s [vector] +++ OK, passed 100 tests.
  5675. 833.74 s [vector] partition: OK
  5676. 833.74 s [vector] +++ OK, passed 100 tests.
  5677. 833.74 s [vector] partitionWith: OK
  5678. 833.74 s [vector] +++ OK, passed 100 tests.
  5679. 833.74 s [vector] span: OK
  5680. 833.74 s [vector] +++ OK, passed 100 tests.
  5681. 833.74 s [vector] break: OK
  5682. 833.74 s [vector] +++ OK, passed 100 tests.
  5683. 833.74 s [vector] spanR: OK
  5684. 833.74 s [vector] +++ OK, passed 100 tests.
  5685. 833.74 s [vector] breakR: OK
  5686. 833.74 s [vector] +++ OK, passed 100 tests.
  5687. 833.74 s [vector] groupBy: OK
  5688. 833.74 s [vector] +++ OK, passed 100 tests.
  5689. 833.74 s [vector] elem: OK
  5690. 833.74 s [vector] +++ OK, passed 100 tests.
  5691. 833.74 s [vector] notElem: OK
  5692. 833.74 s [vector] +++ OK, passed 100 tests.
  5693. 833.74 s [vector] find: OK
  5694. 833.74 s [vector] +++ OK, passed 100 tests.
  5695. 833.74 s [vector] findIndex: OK
  5696. 833.74 s [vector] +++ OK, passed 100 tests.
  5697. 833.75 s [vector] findIndexR: OK
  5698. 833.75 s [vector] +++ OK, passed 100 tests.
  5699. 833.75 s [vector] findIndices: OK
  5700. 833.75 s [vector] +++ OK, passed 100 tests.
  5701. 833.75 s [vector] elemIndex: OK
  5702. 833.75 s [vector] +++ OK, passed 100 tests.
  5703. 833.82 s [vector] elemIndices: OK (0.04s)
  5704. 833.82 s [vector] +++ OK, passed 100 tests.
  5705. 833.82 s [vector] foldl: OK
  5706. 833.82 s [vector] +++ OK, passed 100 tests.
  5707. 833.82 s [vector] foldl1: OK
  5708. 833.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5709. 833.83 s [vector] foldl': OK
  5710. 833.83 s [vector] +++ OK, passed 100 tests.
  5711. 833.83 s [vector] foldl1': OK
  5712. 833.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5713. 833.83 s [vector] foldr: OK
  5714. 833.83 s [vector] +++ OK, passed 100 tests.
  5715. 833.83 s [vector] foldr1: OK
  5716. 833.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5717. 833.83 s [vector] foldr': OK
  5718. 833.83 s [vector] +++ OK, passed 100 tests.
  5719. 833.83 s [vector] foldr1': OK
  5720. 833.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5721. 833.84 s [vector] ifoldl: OK
  5722. 833.84 s [vector] +++ OK, passed 100 tests.
  5723. 833.84 s [vector] ifoldl': OK
  5724. 833.85 s [vector] +++ OK, passed 100 tests.
  5725. 833.85 s [vector] ifoldr: OK
  5726. 833.85 s [vector] +++ OK, passed 100 tests.
  5727. 833.85 s [vector] ifoldr': OK
  5728. 833.85 s [vector] +++ OK, passed 100 tests.
  5729. 833.85 s [vector] ifoldM: OK
  5730. 833.85 s [vector] +++ OK, passed 100 tests.
  5731. 833.85 s [vector] ifoldM': OK
  5732. 833.85 s [vector] +++ OK, passed 100 tests.
  5733. 833.88 s [vector] ifoldM_: OK
  5734. 833.92 s [vector] +++ OK, passed 100 tests.
  5735. 833.92 s [vector] ifoldM'_: OK (0.01s)
  5736. 833.92 s [vector] +++ OK, passed 100 tests.
  5737. 833.92 s [vector] all: OK
  5738. 833.92 s [vector] +++ OK, passed 100 tests.
  5739. 833.92 s [vector] any: OK
  5740. 833.92 s [vector] +++ OK, passed 100 tests.
  5741. 833.92 s [vector] prescanl: OK
  5742. 833.92 s [vector] +++ OK, passed 100 tests.
  5743. 833.92 s [vector] prescanl': OK
  5744. 833.92 s [vector] +++ OK, passed 100 tests.
  5745. 833.92 s [vector] postscanl: OK
  5746. 833.92 s [vector] +++ OK, passed 100 tests.
  5747. 833.92 s [vector] postscanl': OK
  5748. 833.92 s [vector] +++ OK, passed 100 tests.
  5749. 833.92 s [vector] scanl: OK
  5750. 833.92 s [vector] +++ OK, passed 100 tests.
  5751. 833.92 s [vector] scanl': OK
  5752. 833.92 s [vector] +++ OK, passed 100 tests.
  5753. 833.92 s [vector] scanl1: OK
  5754. 833.92 s [vector] +++ OK, passed 100 tests.
  5755. 833.92 s [vector] scanl1': OK
  5756. 833.92 s [vector] +++ OK, passed 100 tests.
  5757. 833.92 s [vector] iscanl: OK
  5758. 833.92 s [vector] +++ OK, passed 100 tests.
  5759. 833.92 s [vector] iscanl': OK
  5760. 833.92 s [vector] +++ OK, passed 100 tests.
  5761. 833.92 s [vector] prescanr: OK
  5762. 833.92 s [vector] +++ OK, passed 100 tests.
  5763. 833.92 s [vector] prescanr': OK
  5764. 833.92 s [vector] +++ OK, passed 100 tests.
  5765. 833.92 s [vector] postscanr: OK
  5766. 833.92 s [vector] +++ OK, passed 100 tests.
  5767. 833.92 s [vector] postscanr': OK
  5768. 833.92 s [vector] +++ OK, passed 100 tests.
  5769. 833.93 s [vector] scanr: OK
  5770. 833.93 s [vector] +++ OK, passed 100 tests.
  5771. 833.93 s [vector] scanr': OK
  5772. 833.93 s [vector] +++ OK, passed 100 tests.
  5773. 833.93 s [vector] scanr1: OK
  5774. 833.93 s [vector] +++ OK, passed 100 tests.
  5775. 833.93 s [vector] scanr1': OK
  5776. 833.93 s [vector] +++ OK, passed 100 tests.
  5777. 833.94 s [vector] iscanr: OK
  5778. 833.94 s [vector] +++ OK, passed 100 tests.
  5779. 833.94 s [vector] iscanr': OK
  5780. 833.94 s [vector] +++ OK, passed 100 tests.
  5781. 833.94 s [vector] mut_read: OK
  5782. 833.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5783. 833.94 s [vector] mut_write: OK
  5784. 833.94 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5785. 833.94 s [vector] mut_modify: OK
  5786. 833.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5787. 833.94 s [vector] mut_generate: OK
  5788. 833.96 s [vector] +++ OK, passed 100 tests.
  5789. 833.98 s [vector] mut_generateM: OK (0.02s)
  5790. 833.98 s [vector] +++ OK, passed 100 tests.
  5791. 834.00 s [vector] mut_mapM_: OK (0.02s)
  5792. 834.00 s [vector] +++ OK, passed 100 tests.
  5793. 834.00 s [vector] mut_imapM_: OK (0.01s)
  5794. 834.00 s [vector] +++ OK, passed 100 tests.
  5795. 834.02 s [vector] mut_forM_: OK (0.01s)
  5796. 834.02 s [vector] +++ OK, passed 100 tests.
  5797. 834.03 s [vector] mut_iforM_: OK (0.01s)
  5798. 834.03 s [vector] +++ OK, passed 100 tests.
  5799. 834.03 s [vector] mut_foldr: OK
  5800. 834.03 s [vector] +++ OK, passed 100 tests.
  5801. 834.03 s [vector] mut_foldr': OK
  5802. 834.03 s [vector] +++ OK, passed 100 tests.
  5803. 834.03 s [vector] mut_foldl: OK
  5804. 834.03 s [vector] +++ OK, passed 100 tests.
  5805. 834.03 s [vector] mut_foldl': OK
  5806. 834.04 s [vector] +++ OK, passed 100 tests.
  5807. 834.04 s [vector] mut_ifoldr: OK
  5808. 834.04 s [vector] +++ OK, passed 100 tests.
  5809. 834.04 s [vector] mut_ifoldr': OK
  5810. 834.04 s [vector] +++ OK, passed 100 tests.
  5811. 834.04 s [vector] mut_ifoldl: OK
  5812. 834.04 s [vector] +++ OK, passed 100 tests.
  5813. 834.04 s [vector] mut_ifoldl': OK
  5814. 834.05 s [vector] +++ OK, passed 100 tests.
  5815. 834.05 s [vector] mut_foldM: OK
  5816. 834.05 s [vector] +++ OK, passed 100 tests.
  5817. 834.05 s [vector] mut_foldM': OK
  5818. 834.05 s [vector] +++ OK, passed 100 tests.
  5819. 834.05 s [vector] mut_foldrM: OK
  5820. 834.05 s [vector] +++ OK, passed 100 tests.
  5821. 834.05 s [vector] mut_foldrM': OK
  5822. 834.05 s [vector] +++ OK, passed 100 tests.
  5823. 834.05 s [vector] mut_ifoldM: OK
  5824. 834.06 s [vector] +++ OK, passed 100 tests.
  5825. 834.06 s [vector] mut_ifoldM': OK
  5826. 834.06 s [vector] +++ OK, passed 100 tests.
  5827. 834.06 s [vector] mut_ifoldrM: OK
  5828. 834.06 s [vector] +++ OK, passed 100 tests.
  5829. 834.07 s [vector] mut_ifoldrM': OK
  5830. 834.07 s [vector] +++ OK, passed 100 tests.
  5831. 834.07 s [vector] compare: OK
  5832. 834.07 s [vector] +++ OK, passed 100 tests.
  5833. 834.07 s [vector] maximum: OK
  5834. 834.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5835. 834.07 s [vector] minimum: OK
  5836. 834.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5837. 834.07 s [vector] minIndex: OK
  5838. 834.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5839. 834.07 s [vector] maxIndex: OK
  5840. 834.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5841. 834.07 s [vector] maximumBy: OK
  5842. 834.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5843. 834.07 s [vector] minimumBy: OK
  5844. 834.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5845. 834.07 s [vector] maximumOn: OK
  5846. 834.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5847. 834.07 s [vector] minimumOn: OK
  5848. 834.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5849. 834.07 s [vector] maxIndexBy: OK
  5850. 834.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5851. 834.07 s [vector] minIndexBy: OK
  5852. 834.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5853. 834.07 s [vector] ListFirstMaxIndexWins: OK
  5854. 834.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5855. 834.08 s [vector] FalseListFirstMaxIndexWins: OK
  5856. 834.08 s [vector] +++ OK, failed as expected. (after 1 test):
  5857. 834.08 s [vector] Exception:
  5858. 834.08 s [vector] Prelude.foldr1: empty list
  5859. 834.08 s [vector] CallStack (from HasCallStack):
  5860. 834.08 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  5861. 834.08 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  5862. 834.08 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5863. 834.08 s [vector] []
  5864. 834.08 s [vector] zip: OK
  5865. 834.08 s [vector] +++ OK, passed 100 tests.
  5866. 834.08 s [vector] zip3: OK
  5867. 834.08 s [vector] +++ OK, passed 100 tests.
  5868. 834.08 s [vector] unzip: OK
  5869. 834.08 s [vector] +++ OK, passed 100 tests.
  5870. 834.08 s [vector] unzip3: OK
  5871. 834.08 s [vector] +++ OK, passed 100 tests.
  5872. 834.08 s [vector] indexed: OK
  5873. 834.08 s [vector] +++ OK, passed 100 tests.
  5874. 834.08 s [vector] update: OK
  5875. 834.08 s [vector] +++ OK, passed 100 tests.
  5876. 834.09 s [vector] concat: OK (0.01s)
  5877. 834.10 s [vector] +++ OK, passed 100 tests.
  5878. 834.10 s [vector] mempty: OK
  5879. 834.10 s [vector] +++ OK, passed 1 test.
  5880. 834.10 s [vector] mappend: OK
  5881. 834.11 s [vector] +++ OK, passed 100 tests.
  5882. 834.12 s [vector] mconcat: OK (0.02s)
  5883. 834.12 s [vector] +++ OK, passed 100 tests.
  5884. 834.12 s [vector] fmap: OK
  5885. 834.12 s [vector] +++ OK, passed 100 tests.
  5886. 834.12 s [vector] return: OK
  5887. 834.12 s [vector] +++ OK, passed 100 tests.
  5888. 834.13 s [vector] bind: OK (0.02s)
  5889. 834.13 s [vector] +++ OK, passed 100 tests.
  5890. 834.13 s [vector] mzip: OK
  5891. 834.13 s [vector] +++ OK, passed 100 tests.
  5892. 834.13 s [vector] munzip: OK
  5893. 834.13 s [vector] +++ OK, passed 100 tests.
  5894. 834.13 s [vector] applicative_pure: OK
  5895. 834.14 s [vector] +++ OK, passed 100 tests.
  5896. 834.16 s [vector] applicative_appl: OK (0.02s)
  5897. 834.16 s [vector] +++ OK, passed 100 tests.
  5898. 834.16 s [vector] alternative_empty: OK
  5899. 834.16 s [vector] +++ OK, passed 1 test.
  5900. 834.16 s [vector] alternative_or: OK
  5901. 834.17 s [vector] +++ OK, passed 100 tests.
  5902. 834.19 s [vector] sequence: OK (0.03s)
  5903. 834.19 s [vector] +++ OK, passed 100 tests.
  5904. 834.20 s [vector] sequence_: OK (0.01s)
  5905. 834.21 s [vector] +++ OK, passed 100 tests.
  5906. 834.21 s [vector] glength: OK
  5907. 834.21 s [vector] +++ OK, passed 100 tests.
  5908. 834.21 s [vector] and: OK
  5909. 834.21 s [vector] +++ OK, passed 100 tests.
  5910. 834.21 s [vector] or: OK
  5911. 834.21 s [vector] +++ OK, passed 100 tests.
  5912. 834.21 s [vector] Int
  5913. 834.21 s [vector] fromList.toList == id: OK
  5914. 834.21 s [vector] +++ OK, passed 100 tests.
  5915. 834.21 s [vector] toList.fromList == id: OK
  5916. 834.21 s [vector] +++ OK, passed 100 tests.
  5917. 834.21 s [vector] unstream.stream == id: OK
  5918. 834.21 s [vector] +++ OK, passed 100 tests.
  5919. 834.21 s [vector] stream.unstream == id: OK
  5920. 834.21 s [vector] +++ OK, passed 100 tests.
  5921. 834.21 s [vector] eq: OK
  5922. 834.21 s [vector] +++ OK, passed 100 tests.
  5923. 834.21 s [vector] length: OK
  5924. 834.21 s [vector] +++ OK, passed 100 tests.
  5925. 834.21 s [vector] null: OK
  5926. 834.21 s [vector] +++ OK, passed 100 tests.
  5927. 834.21 s [vector] index: OK
  5928. 834.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5929. 834.21 s [vector] safeIndex: OK
  5930. 834.21 s [vector] +++ OK, passed 100 tests.
  5931. 834.21 s [vector] head: OK
  5932. 834.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5933. 834.21 s [vector] last: OK
  5934. 834.21 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5935. 834.21 s [vector] unsafeIndex: OK
  5936. 834.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5937. 834.21 s [vector] unsafeHead: OK
  5938. 834.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5939. 834.21 s [vector] unsafeLast: OK
  5940. 834.21 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5941. 834.21 s [vector] slice: OK
  5942. 834.21 s [vector] +++ OK, passed 100 tests.
  5943. 834.21 s [vector] init: OK
  5944. 834.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5945. 834.22 s [vector] tail: OK
  5946. 834.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5947. 834.22 s [vector] take: OK
  5948. 834.22 s [vector] +++ OK, passed 100 tests.
  5949. 834.22 s [vector] drop: OK
  5950. 834.22 s [vector] +++ OK, passed 100 tests.
  5951. 834.22 s [vector] splitAt: OK
  5952. 834.22 s [vector] +++ OK, passed 100 tests.
  5953. 834.22 s [vector] empty: OK
  5954. 834.22 s [vector] +++ OK, passed 1 test.
  5955. 834.22 s [vector] singleton: OK
  5956. 834.22 s [vector] +++ OK, passed 100 tests.
  5957. 834.22 s [vector] replicate: OK
  5958. 834.22 s [vector] +++ OK, passed 100 tests.
  5959. 834.22 s [vector] generate: OK
  5960. 834.22 s [vector] +++ OK, passed 100 tests.
  5961. 834.23 s [vector] iterateN: OK
  5962. 834.23 s [vector] +++ OK, passed 100 tests.
  5963. 834.27 s [vector] iterateNM: OK (0.05s)
  5964. 834.42 s [vector] +++ OK, passed 100 tests.
  5965. 834.42 s [vector] generateM: OK (0.01s)
  5966. 834.42 s [vector] +++ OK, passed 100 tests.
  5967. 834.42 s [vector] replicateM: OK
  5968. 834.42 s [vector] +++ OK, passed 100 tests.
  5969. 834.42 s [vector] create: OK
  5970. 834.42 s [vector] +++ OK, passed 100 tests.
  5971. 834.42 s [vector] createT: OK
  5972. 834.42 s [vector] +++ OK, passed 100 tests.
  5973. 834.42 s [vector] unfoldr: OK
  5974. 834.42 s [vector] +++ OK, passed 100 tests.
  5975. 834.42 s [vector] unfoldrN: OK
  5976. 834.42 s [vector] +++ OK, passed 100 tests.
  5977. 834.42 s [vector] unfoldrExactN: OK
  5978. 834.42 s [vector] +++ OK, passed 100 tests.
  5979. 834.42 s [vector] unfoldrM: OK
  5980. 834.42 s [vector] +++ OK, passed 100 tests.
  5981. 834.42 s [vector] unfoldrNM: OK
  5982. 834.42 s [vector] +++ OK, passed 100 tests.
  5983. 834.42 s [vector] unfoldrExactNM: OK (0.02s)
  5984. 834.42 s [vector] +++ OK, passed 100 tests.
  5985. 834.42 s [vector] constructN: OK
  5986. 834.42 s [vector] +++ OK, passed 100 tests.
  5987. 834.42 s [vector] constructrN: OK
  5988. 834.42 s [vector] +++ OK, passed 100 tests.
  5989. 834.42 s [vector] cons: OK
  5990. 834.42 s [vector] +++ OK, passed 100 tests.
  5991. 834.42 s [vector] snoc: OK
  5992. 834.42 s [vector] +++ OK, passed 100 tests.
  5993. 834.42 s [vector] append: OK
  5994. 834.42 s [vector] +++ OK, passed 100 tests.
  5995. 834.42 s [vector] concat: OK (0.01s)
  5996. 834.42 s [vector] +++ OK, passed 100 tests.
  5997. 834.42 s [vector] force: OK
  5998. 834.42 s [vector] +++ OK, passed 100 tests.
  5999. 834.42 s [vector] upd: OK
  6000. 834.42 s [vector] +++ OK, passed 100 tests.
  6001. 834.42 s [vector] accum: OK
  6002. 834.42 s [vector] +++ OK, passed 100 tests.
  6003. 834.42 s [vector] reverse: OK
  6004. 834.42 s [vector] +++ OK, passed 100 tests.
  6005. 834.42 s [vector] backpermute: OK
  6006. 834.42 s [vector] +++ OK, passed 100 tests.
  6007. 834.42 s [vector] map: OK
  6008. 834.42 s [vector] +++ OK, passed 100 tests.
  6009. 834.42 s [vector] imap: OK
  6010. 834.42 s [vector] +++ OK, passed 100 tests.
  6011. 834.42 s [vector] concatMap: OK
  6012. 834.42 s [vector] +++ OK, passed 100 tests.
  6013. 834.42 s [vector] mapM: OK
  6014. 834.42 s [vector] +++ OK, passed 100 tests.
  6015. 834.42 s [vector] mapM_: OK (0.03s)
  6016. 834.42 s [vector] +++ OK, passed 100 tests.
  6017. 834.42 s [vector] forM: OK
  6018. 834.42 s [vector] +++ OK, passed 100 tests.
  6019. 834.44 s [vector] forM_: OK (0.04s)
  6020. 834.44 s [vector] +++ OK, passed 100 tests.
  6021. 834.44 s [vector] imapM: OK
  6022. 834.45 s [vector] +++ OK, passed 100 tests.
  6023. 834.47 s [vector] imapM_: OK (0.02s)
  6024. 834.47 s [vector] +++ OK, passed 100 tests.
  6025. 834.47 s [vector] zipWith: OK
  6026. 834.47 s [vector] +++ OK, passed 100 tests.
  6027. 834.47 s [vector] zipWith3: OK
  6028. 834.47 s [vector] +++ OK, passed 100 tests.
  6029. 834.47 s [vector] izipWith: OK
  6030. 834.47 s [vector] +++ OK, passed 100 tests.
  6031. 834.47 s [vector] izipWith3: OK
  6032. 834.47 s [vector] +++ OK, passed 100 tests.
  6033. 834.48 s [vector] izipWithM: OK
  6034. 834.49 s [vector] +++ OK, passed 100 tests.
  6035. 834.49 s [vector] izipWithM_: OK (0.01s)
  6036. 834.49 s [vector] +++ OK, passed 100 tests.
  6037. 834.49 s [vector] zipWithM: OK
  6038. 834.49 s [vector] +++ OK, passed 100 tests.
  6039. 834.51 s [vector] zipWithM_: OK (0.01s)
  6040. 834.51 s [vector] +++ OK, passed 100 tests.
  6041. 834.51 s [vector] filter: OK
  6042. 834.51 s [vector] +++ OK, passed 100 tests.
  6043. 834.51 s [vector] ifilter: OK
  6044. 834.51 s [vector] +++ OK, passed 100 tests.
  6045. 834.54 s [vector] filterM: OK (0.03s)
  6046. 834.54 s [vector] +++ OK, passed 100 tests.
  6047. 834.54 s [vector] uniq: OK
  6048. 834.54 s [vector] +++ OK, passed 100 tests.
  6049. 834.54 s [vector] mapMaybe: OK
  6050. 834.54 s [vector] +++ OK, passed 100 tests.
  6051. 834.54 s [vector] imapMaybe: OK
  6052. 834.54 s [vector] +++ OK, passed 100 tests.
  6053. 834.54 s [vector] takeWhile: OK
  6054. 834.54 s [vector] +++ OK, passed 100 tests.
  6055. 834.54 s [vector] dropWhile: OK
  6056. 834.54 s [vector] +++ OK, passed 100 tests.
  6057. 834.55 s [vector] partition: OK
  6058. 834.55 s [vector] +++ OK, passed 100 tests.
  6059. 834.55 s [vector] partitionWith: OK
  6060. 834.55 s [vector] +++ OK, passed 100 tests.
  6061. 834.55 s [vector] span: OK
  6062. 834.55 s [vector] +++ OK, passed 100 tests.
  6063. 834.55 s [vector] break: OK
  6064. 834.55 s [vector] +++ OK, passed 100 tests.
  6065. 834.55 s [vector] spanR: OK
  6066. 834.55 s [vector] +++ OK, passed 100 tests.
  6067. 834.55 s [vector] breakR: OK
  6068. 834.55 s [vector] +++ OK, passed 100 tests.
  6069. 834.55 s [vector] groupBy: OK
  6070. 834.55 s [vector] +++ OK, passed 100 tests.
  6071. 834.55 s [vector] elem: OK
  6072. 834.55 s [vector] +++ OK, passed 100 tests.
  6073. 834.55 s [vector] notElem: OK
  6074. 834.55 s [vector] +++ OK, passed 100 tests.
  6075. 834.55 s [vector] find: OK
  6076. 834.55 s [vector] +++ OK, passed 100 tests.
  6077. 834.55 s [vector] findIndex: OK
  6078. 834.55 s [vector] +++ OK, passed 100 tests.
  6079. 834.55 s [vector] findIndexR: OK
  6080. 834.55 s [vector] +++ OK, passed 100 tests.
  6081. 834.55 s [vector] findIndices: OK
  6082. 834.56 s [vector] +++ OK, passed 100 tests.
  6083. 834.56 s [vector] elemIndex: OK
  6084. 834.56 s [vector] +++ OK, passed 100 tests.
  6085. 834.56 s [vector] elemIndices: OK
  6086. 834.56 s [vector] +++ OK, passed 100 tests.
  6087. 834.56 s [vector] foldl: OK
  6088. 834.56 s [vector] +++ OK, passed 100 tests.
  6089. 834.56 s [vector] foldl1: OK
  6090. 834.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6091. 834.56 s [vector] foldl': OK
  6092. 834.56 s [vector] +++ OK, passed 100 tests.
  6093. 834.57 s [vector] foldl1': OK
  6094. 834.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6095. 834.57 s [vector] foldr: OK
  6096. 834.57 s [vector] +++ OK, passed 100 tests.
  6097. 834.57 s [vector] foldr1: OK
  6098. 834.57 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6099. 834.57 s [vector] foldr': OK
  6100. 834.58 s [vector] +++ OK, passed 100 tests.
  6101. 834.58 s [vector] foldr1': OK
  6102. 834.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6103. 834.58 s [vector] ifoldl: OK
  6104. 834.58 s [vector] +++ OK, passed 100 tests.
  6105. 834.58 s [vector] ifoldl': OK
  6106. 834.59 s [vector] +++ OK, passed 100 tests.
  6107. 834.59 s [vector] ifoldr: OK
  6108. 834.59 s [vector] +++ OK, passed 100 tests.
  6109. 834.59 s [vector] ifoldr': OK
  6110. 834.59 s [vector] +++ OK, passed 100 tests.
  6111. 834.59 s [vector] ifoldM: OK
  6112. 834.59 s [vector] +++ OK, passed 100 tests.
  6113. 834.61 s [vector] ifoldM': OK
  6114. 834.61 s [vector] +++ OK, passed 100 tests.
  6115. 834.63 s [vector] ifoldM_: OK (0.02s)
  6116. 834.63 s [vector] +++ OK, passed 100 tests.
  6117. 834.64 s [vector] ifoldM'_: OK (0.02s)
  6118. 834.64 s [vector] +++ OK, passed 100 tests.
  6119. 834.64 s [vector] all: OK
  6120. 834.64 s [vector] +++ OK, passed 100 tests.
  6121. 834.64 s [vector] any: OK
  6122. 834.64 s [vector] +++ OK, passed 100 tests.
  6123. 834.64 s [vector] prescanl: OK
  6124. 834.64 s [vector] +++ OK, passed 100 tests.
  6125. 834.65 s [vector] prescanl': OK
  6126. 834.65 s [vector] +++ OK, passed 100 tests.
  6127. 834.65 s [vector] postscanl: OK
  6128. 834.65 s [vector] +++ OK, passed 100 tests.
  6129. 834.65 s [vector] postscanl': OK
  6130. 834.65 s [vector] +++ OK, passed 100 tests.
  6131. 834.66 s [vector] scanl: OK
  6132. 834.66 s [vector] +++ OK, passed 100 tests.
  6133. 834.66 s [vector] scanl': OK
  6134. 834.66 s [vector] +++ OK, passed 100 tests.
  6135. 834.66 s [vector] scanl1: OK
  6136. 834.66 s [vector] +++ OK, passed 100 tests.
  6137. 834.66 s [vector] scanl1': OK
  6138. 834.66 s [vector] +++ OK, passed 100 tests.
  6139. 834.67 s [vector] iscanl: OK
  6140. 834.67 s [vector] +++ OK, passed 100 tests.
  6141. 834.67 s [vector] iscanl': OK
  6142. 834.67 s [vector] +++ OK, passed 100 tests.
  6143. 834.67 s [vector] prescanr: OK
  6144. 834.67 s [vector] +++ OK, passed 100 tests.
  6145. 834.67 s [vector] prescanr': OK
  6146. 834.68 s [vector] +++ OK, passed 100 tests.
  6147. 834.68 s [vector] postscanr: OK
  6148. 834.68 s [vector] +++ OK, passed 100 tests.
  6149. 834.68 s [vector] postscanr': OK
  6150. 834.68 s [vector] +++ OK, passed 100 tests.
  6151. 834.68 s [vector] scanr: OK
  6152. 834.68 s [vector] +++ OK, passed 100 tests.
  6153. 834.69 s [vector] scanr': OK
  6154. 834.69 s [vector] +++ OK, passed 100 tests.
  6155. 834.69 s [vector] scanr1: OK
  6156. 834.69 s [vector] +++ OK, passed 100 tests.
  6157. 834.69 s [vector] scanr1': OK
  6158. 834.69 s [vector] +++ OK, passed 100 tests.
  6159. 834.69 s [vector] iscanr: OK
  6160. 834.69 s [vector] +++ OK, passed 100 tests.
  6161. 834.70 s [vector] iscanr': OK
  6162. 834.70 s [vector] +++ OK, passed 100 tests.
  6163. 834.70 s [vector] mut_read: OK
  6164. 834.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6165. 834.70 s [vector] mut_write: OK
  6166. 834.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6167. 834.70 s [vector] mut_modify: OK
  6168. 834.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6169. 834.70 s [vector] mut_generate: OK
  6170. 834.71 s [vector] +++ OK, passed 100 tests.
  6171. 834.71 s [vector] mut_generateM: OK
  6172. 834.71 s [vector] +++ OK, passed 100 tests.
  6173. 834.73 s [vector] mut_mapM_: OK (0.02s)
  6174. 834.73 s [vector] +++ OK, passed 100 tests.
  6175. 834.76 s [vector] mut_imapM_: OK (0.02s)
  6176. 834.76 s [vector] +++ OK, passed 100 tests.
  6177. 834.77 s [vector] mut_forM_: OK (0.02s)
  6178. 834.77 s [vector] +++ OK, passed 100 tests.
  6179. 834.79 s [vector] mut_iforM_: OK (0.02s)
  6180. 834.79 s [vector] +++ OK, passed 100 tests.
  6181. 834.79 s [vector] mut_foldr: OK
  6182. 834.79 s [vector] +++ OK, passed 100 tests.
  6183. 834.79 s [vector] mut_foldr': OK
  6184. 834.80 s [vector] +++ OK, passed 100 tests.
  6185. 834.80 s [vector] mut_foldl: OK
  6186. 834.80 s [vector] +++ OK, passed 100 tests.
  6187. 834.80 s [vector] mut_foldl': OK
  6188. 834.80 s [vector] +++ OK, passed 100 tests.
  6189. 834.80 s [vector] mut_ifoldr: OK
  6190. 834.81 s [vector] +++ OK, passed 100 tests.
  6191. 834.81 s [vector] mut_ifoldr': OK
  6192. 834.81 s [vector] +++ OK, passed 100 tests.
  6193. 834.81 s [vector] mut_ifoldl: OK
  6194. 834.81 s [vector] +++ OK, passed 100 tests.
  6195. 834.82 s [vector] mut_ifoldl': OK
  6196. 834.82 s [vector] +++ OK, passed 100 tests.
  6197. 834.82 s [vector] mut_foldM: OK
  6198. 834.82 s [vector] +++ OK, passed 100 tests.
  6199. 834.82 s [vector] mut_foldM': OK
  6200. 834.83 s [vector] +++ OK, passed 100 tests.
  6201. 834.83 s [vector] mut_foldrM: OK
  6202. 834.83 s [vector] +++ OK, passed 100 tests.
  6203. 834.84 s [vector] mut_foldrM': OK
  6204. 834.84 s [vector] +++ OK, passed 100 tests.
  6205. 834.84 s [vector] mut_ifoldM: OK
  6206. 834.84 s [vector] +++ OK, passed 100 tests.
  6207. 834.85 s [vector] mut_ifoldM': OK
  6208. 834.85 s [vector] +++ OK, passed 100 tests.
  6209. 834.85 s [vector] mut_ifoldrM: OK
  6210. 834.85 s [vector] +++ OK, passed 100 tests.
  6211. 834.85 s [vector] mut_ifoldrM': OK
  6212. 834.85 s [vector] +++ OK, passed 100 tests.
  6213. 834.85 s [vector] compare: OK
  6214. 834.85 s [vector] +++ OK, passed 100 tests.
  6215. 834.85 s [vector] maximum: OK
  6216. 834.85 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6217. 834.85 s [vector] minimum: OK
  6218. 834.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6219. 834.86 s [vector] minIndex: OK
  6220. 834.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6221. 834.86 s [vector] maxIndex: OK
  6222. 834.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6223. 834.86 s [vector] maximumBy: OK
  6224. 834.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6225. 834.86 s [vector] minimumBy: OK
  6226. 834.86 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6227. 834.86 s [vector] maximumOn: OK
  6228. 834.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6229. 834.86 s [vector] minimumOn: OK
  6230. 834.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6231. 834.86 s [vector] maxIndexBy: OK
  6232. 834.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6233. 834.86 s [vector] minIndexBy: OK
  6234. 834.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6235. 834.86 s [vector] ListFirstMaxIndexWins: OK
  6236. 834.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6237. 834.86 s [vector] FalseListFirstMaxIndexWins: OK
  6238. 834.86 s [vector] +++ OK, failed as expected. (after 1 test):
  6239. 834.86 s [vector] Exception:
  6240. 834.86 s [vector] Prelude.foldr1: empty list
  6241. 834.86 s [vector] CallStack (from HasCallStack):
  6242. 834.86 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6243. 834.86 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6244. 834.86 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6245. 834.86 s [vector] []
  6246. 834.86 s [vector] zip: OK
  6247. 834.86 s [vector] +++ OK, passed 100 tests.
  6248. 834.87 s [vector] zip3: OK
  6249. 834.87 s [vector] +++ OK, passed 100 tests.
  6250. 834.87 s [vector] unzip: OK
  6251. 834.87 s [vector] +++ OK, passed 100 tests.
  6252. 834.87 s [vector] unzip3: OK
  6253. 834.87 s [vector] +++ OK, passed 100 tests.
  6254. 834.87 s [vector] indexed: OK
  6255. 834.87 s [vector] +++ OK, passed 100 tests.
  6256. 834.87 s [vector] update: OK
  6257. 834.88 s [vector] +++ OK, passed 100 tests.
  6258. 834.88 s [vector] concat: OK (0.01s)
  6259. 834.89 s [vector] +++ OK, passed 100 tests.
  6260. 834.89 s [vector] mempty: OK
  6261. 834.89 s [vector] +++ OK, passed 1 test.
  6262. 834.89 s [vector] mappend: OK
  6263. 834.89 s [vector] +++ OK, passed 100 tests.
  6264. 834.90 s [vector] mconcat: OK (0.01s)
  6265. 834.90 s [vector] +++ OK, passed 100 tests.
  6266. 834.90 s [vector] fmap: OK
  6267. 834.90 s [vector] +++ OK, passed 100 tests.
  6268. 834.91 s [vector] return: OK
  6269. 834.91 s [vector] +++ OK, passed 100 tests.
  6270. 834.92 s [vector] bind: OK (0.02s)
  6271. 834.92 s [vector] +++ OK, passed 100 tests.
  6272. 834.92 s [vector] mzip: OK
  6273. 834.92 s [vector] +++ OK, passed 100 tests.
  6274. 834.92 s [vector] munzip: OK
  6275. 834.93 s [vector] +++ OK, passed 100 tests.
  6276. 834.93 s [vector] applicative_pure: OK
  6277. 834.94 s [vector] +++ OK, passed 100 tests.
  6278. 834.96 s [vector] applicative_appl: OK (0.04s)
  6279. 834.96 s [vector] +++ OK, passed 100 tests.
  6280. 834.96 s [vector] alternative_empty: OK
  6281. 834.96 s [vector] +++ OK, passed 1 test.
  6282. 834.97 s [vector] alternative_or: OK
  6283. 834.97 s [vector] +++ OK, passed 100 tests.
  6284. 835.03 s [vector] sequence: OK (0.05s)
  6285. 835.03 s [vector] +++ OK, passed 100 tests.
  6286. 835.03 s [vector] sequence_: OK (0.01s)
  6287. 835.03 s [vector] +++ OK, passed 100 tests.
  6288. 835.03 s [vector] glength: OK
  6289. 835.03 s [vector] +++ OK, passed 100 tests.
  6290. 835.03 s [vector] sum: OK
  6291. 835.03 s [vector] +++ OK, passed 100 tests.
  6292. 835.03 s [vector] product: OK
  6293. 835.03 s [vector] +++ OK, passed 100 tests.
  6294. 835.03 s [vector] enumFromN: OK
  6295. 835.03 s [vector] +++ OK, passed 100 tests.
  6296. 835.03 s [vector] enumFromThenN: OK
  6297. 835.03 s [vector] +++ OK, passed 100 tests.
  6298. 835.03 s [vector] enumFromTo: OK
  6299. 835.03 s [vector] +++ OK, passed 100 tests.
  6300. 835.03 s [vector] enumFromThenTo: OK
  6301. 835.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6302. 835.03 s [vector] unstream
  6303. 835.03 s [vector] unstream == vunstream (exact): OK
  6304. 835.03 s [vector] +++ OK, passed 100 tests.
  6305. 835.04 s [vector] unstream == vunstream (unknown): OK
  6306. 835.04 s [vector] +++ OK, passed 100 tests.
  6307. 835.04 s [vector] unstreamR ~= vunstream (exact): OK
  6308. 835.04 s [vector] +++ OK, passed 100 tests.
  6309. 835.04 s [vector] unstreamR ~= vunstream (unknown): OK
  6310. 835.04 s [vector] +++ OK, passed 100 tests.
  6311. 835.04 s [vector] Tests.Vector.Primitive
  6312. 835.04 s [vector] Int
  6313. 835.04 s [vector] fromList.toList == id: OK
  6314. 835.04 s [vector] +++ OK, passed 100 tests.
  6315. 835.04 s [vector] toList.fromList == id: OK
  6316. 835.04 s [vector] +++ OK, passed 100 tests.
  6317. 835.04 s [vector] unstream.stream == id: OK
  6318. 835.04 s [vector] +++ OK, passed 100 tests.
  6319. 835.04 s [vector] stream.unstream == id: OK
  6320. 835.04 s [vector] +++ OK, passed 100 tests.
  6321. 835.04 s [vector] eq: OK
  6322. 835.04 s [vector] +++ OK, passed 100 tests.
  6323. 835.04 s [vector] length: OK
  6324. 835.04 s [vector] +++ OK, passed 100 tests.
  6325. 835.04 s [vector] null: OK
  6326. 835.04 s [vector] +++ OK, passed 100 tests.
  6327. 835.04 s [vector] index: OK
  6328. 835.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6329. 835.04 s [vector] safeIndex: OK
  6330. 835.04 s [vector] +++ OK, passed 100 tests.
  6331. 835.04 s [vector] head: OK
  6332. 835.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6333. 835.04 s [vector] last: OK
  6334. 835.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6335. 835.05 s [vector] unsafeIndex: OK
  6336. 835.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6337. 835.05 s [vector] unsafeHead: OK
  6338. 835.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6339. 835.05 s [vector] unsafeLast: OK
  6340. 835.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6341. 835.05 s [vector] slice: OK
  6342. 835.05 s [vector] +++ OK, passed 100 tests.
  6343. 835.05 s [vector] init: OK
  6344. 835.05 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6345. 835.05 s [vector] tail: OK
  6346. 835.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6347. 835.05 s [vector] take: OK
  6348. 835.05 s [vector] +++ OK, passed 100 tests.
  6349. 835.05 s [vector] drop: OK
  6350. 835.05 s [vector] +++ OK, passed 100 tests.
  6351. 835.05 s [vector] splitAt: OK
  6352. 835.05 s [vector] +++ OK, passed 100 tests.
  6353. 835.05 s [vector] empty: OK
  6354. 835.05 s [vector] +++ OK, passed 1 test.
  6355. 835.05 s [vector] singleton: OK
  6356. 835.05 s [vector] +++ OK, passed 100 tests.
  6357. 835.05 s [vector] replicate: OK
  6358. 835.05 s [vector] +++ OK, passed 100 tests.
  6359. 835.05 s [vector] generate: OK
  6360. 835.05 s [vector] +++ OK, passed 100 tests.
  6361. 835.09 s [vector] iterateN: OK
  6362. 835.09 s [vector] +++ OK, passed 100 tests.
  6363. 835.11 s [vector] iterateNM: OK (0.05s)
  6364. 835.11 s [vector] +++ OK, passed 100 tests.
  6365. 835.15 s [vector] generateM: OK (0.04s)
  6366. 835.15 s [vector] +++ OK, passed 100 tests.
  6367. 835.16 s [vector] replicateM: OK
  6368. 835.16 s [vector] +++ OK, passed 100 tests.
  6369. 835.16 s [vector] create: OK
  6370. 835.16 s [vector] +++ OK, passed 100 tests.
  6371. 835.16 s [vector] createT: OK
  6372. 835.16 s [vector] +++ OK, passed 100 tests.
  6373. 835.16 s [vector] unfoldr: OK
  6374. 835.16 s [vector] +++ OK, passed 100 tests.
  6375. 835.16 s [vector] unfoldrN: OK
  6376. 835.16 s [vector] +++ OK, passed 100 tests.
  6377. 835.16 s [vector] unfoldrExactN: OK
  6378. 835.16 s [vector] +++ OK, passed 100 tests.
  6379. 835.16 s [vector] unfoldrM: OK
  6380. 835.17 s [vector] +++ OK, passed 100 tests.
  6381. 835.17 s [vector] unfoldrNM: OK
  6382. 835.17 s [vector] +++ OK, passed 100 tests.
  6383. 835.24 s [vector] unfoldrExactNM: OK (0.07s)
  6384. 835.24 s [vector] +++ OK, passed 100 tests.
  6385. 835.25 s [vector] constructN: OK
  6386. 835.25 s [vector] +++ OK, passed 100 tests.
  6387. 835.25 s [vector] constructrN: OK
  6388. 835.25 s [vector] +++ OK, passed 100 tests.
  6389. 835.25 s [vector] cons: OK
  6390. 835.25 s [vector] +++ OK, passed 100 tests.
  6391. 835.25 s [vector] snoc: OK
  6392. 835.25 s [vector] +++ OK, passed 100 tests.
  6393. 835.25 s [vector] append: OK
  6394. 835.25 s [vector] +++ OK, passed 100 tests.
  6395. 835.27 s [vector] concat: OK (0.02s)
  6396. 835.27 s [vector] +++ OK, passed 100 tests.
  6397. 835.27 s [vector] force: OK
  6398. 835.27 s [vector] +++ OK, passed 100 tests.
  6399. 835.27 s [vector] upd: OK
  6400. 835.28 s [vector] +++ OK, passed 100 tests.
  6401. 835.28 s [vector] accum: OK
  6402. 835.28 s [vector] +++ OK, passed 100 tests.
  6403. 835.28 s [vector] reverse: OK
  6404. 835.28 s [vector] +++ OK, passed 100 tests.
  6405. 835.29 s [vector] backpermute: OK
  6406. 835.29 s [vector] +++ OK, passed 100 tests.
  6407. 835.29 s [vector] map: OK
  6408. 835.29 s [vector] +++ OK, passed 100 tests.
  6409. 835.29 s [vector] imap: OK
  6410. 835.29 s [vector] +++ OK, passed 100 tests.
  6411. 835.29 s [vector] concatMap: OK
  6412. 835.29 s [vector] +++ OK, passed 100 tests.
  6413. 835.31 s [vector] mapM: OK
  6414. 835.31 s [vector] +++ OK, passed 100 tests.
  6415. 835.32 s [vector] mapM_: OK (0.02s)
  6416. 835.32 s [vector] +++ OK, passed 100 tests.
  6417. 835.33 s [vector] forM: OK
  6418. 835.33 s [vector] +++ OK, passed 100 tests.
  6419. 835.34 s [vector] forM_: OK (0.02s)
  6420. 835.34 s [vector] +++ OK, passed 100 tests.
  6421. 835.34 s [vector] imapM: OK
  6422. 835.35 s [vector] +++ OK, passed 100 tests.
  6423. 835.36 s [vector] imapM_: OK (0.02s)
  6424. 835.36 s [vector] +++ OK, passed 100 tests.
  6425. 835.36 s [vector] zipWith: OK
  6426. 835.37 s [vector] +++ OK, passed 100 tests.
  6427. 835.37 s [vector] zipWith3: OK
  6428. 835.37 s [vector] +++ OK, passed 100 tests.
  6429. 835.38 s [vector] izipWith: OK
  6430. 835.38 s [vector] +++ OK, passed 100 tests.
  6431. 835.38 s [vector] izipWith3: OK
  6432. 835.38 s [vector] +++ OK, passed 100 tests.
  6433. 835.39 s [vector] izipWithM: OK
  6434. 835.39 s [vector] +++ OK, passed 100 tests.
  6435. 835.39 s [vector] izipWithM_: OK (0.02s)
  6436. 835.39 s [vector] +++ OK, passed 100 tests.
  6437. 835.40 s [vector] zipWithM: OK
  6438. 835.41 s [vector] +++ OK, passed 100 tests.
  6439. 835.41 s [vector] zipWithM_: OK (0.02s)
  6440. 835.41 s [vector] +++ OK, passed 100 tests.
  6441. 835.41 s [vector] filter: OK
  6442. 835.41 s [vector] +++ OK, passed 100 tests.
  6443. 835.43 s [vector] ifilter: OK
  6444. 835.43 s [vector] +++ OK, passed 100 tests.
  6445. 835.45 s [vector] filterM: OK (0.03s)
  6446. 835.45 s [vector] +++ OK, passed 100 tests.
  6447. 835.45 s [vector] uniq: OK
  6448. 835.45 s [vector] +++ OK, passed 100 tests.
  6449. 835.45 s [vector] mapMaybe: OK
  6450. 835.45 s [vector] +++ OK, passed 100 tests.
  6451. 835.45 s [vector] imapMaybe: OK
  6452. 835.45 s [vector] +++ OK, passed 100 tests.
  6453. 835.45 s [vector] takeWhile: OK
  6454. 835.45 s [vector] +++ OK, passed 100 tests.
  6455. 835.46 s [vector] dropWhile: OK
  6456. 835.46 s [vector] +++ OK, passed 100 tests.
  6457. 835.46 s [vector] partition: OK
  6458. 835.46 s [vector] +++ OK, passed 100 tests.
  6459. 835.46 s [vector] partitionWith: OK
  6460. 835.46 s [vector] +++ OK, passed 100 tests.
  6461. 835.46 s [vector] span: OK
  6462. 835.46 s [vector] +++ OK, passed 100 tests.
  6463. 835.46 s [vector] break: OK
  6464. 835.46 s [vector] +++ OK, passed 100 tests.
  6465. 835.46 s [vector] spanR: OK
  6466. 835.46 s [vector] +++ OK, passed 100 tests.
  6467. 835.46 s [vector] breakR: OK
  6468. 835.46 s [vector] +++ OK, passed 100 tests.
  6469. 835.47 s [vector] groupBy: OK
  6470. 835.47 s [vector] +++ OK, passed 100 tests.
  6471. 835.47 s [vector] elem: OK
  6472. 835.47 s [vector] +++ OK, passed 100 tests.
  6473. 835.47 s [vector] notElem: OK
  6474. 835.47 s [vector] +++ OK, passed 100 tests.
  6475. 835.47 s [vector] find: OK
  6476. 835.47 s [vector] +++ OK, passed 100 tests.
  6477. 835.47 s [vector] findIndex: OK
  6478. 835.47 s [vector] +++ OK, passed 100 tests.
  6479. 835.47 s [vector] findIndexR: OK
  6480. 835.47 s [vector] +++ OK, passed 100 tests.
  6481. 835.47 s [vector] findIndices: OK
  6482. 835.47 s [vector] +++ OK, passed 100 tests.
  6483. 835.47 s [vector] elemIndex: OK
  6484. 835.47 s [vector] +++ OK, passed 100 tests.
  6485. 835.47 s [vector] elemIndices: OK
  6486. 835.47 s [vector] +++ OK, passed 100 tests.
  6487. 835.48 s [vector] foldl: OK
  6488. 835.48 s [vector] +++ OK, passed 100 tests.
  6489. 835.48 s [vector] foldl1: OK
  6490. 835.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6491. 835.48 s [vector] foldl': OK
  6492. 835.48 s [vector] +++ OK, passed 100 tests.
  6493. 835.49 s [vector] foldl1': OK
  6494. 835.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6495. 835.49 s [vector] foldr: OK
  6496. 835.49 s [vector] +++ OK, passed 100 tests.
  6497. 835.49 s [vector] foldr1: OK
  6498. 835.49 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6499. 835.49 s [vector] foldr': OK
  6500. 835.49 s [vector] +++ OK, passed 100 tests.
  6501. 835.49 s [vector] foldr1': OK
  6502. 835.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6503. 835.50 s [vector] ifoldl: OK
  6504. 835.50 s [vector] +++ OK, passed 100 tests.
  6505. 835.50 s [vector] ifoldl': OK
  6506. 835.50 s [vector] +++ OK, passed 100 tests.
  6507. 835.51 s [vector] ifoldr: OK
  6508. 835.51 s [vector] +++ OK, passed 100 tests.
  6509. 835.51 s [vector] ifoldr': OK
  6510. 835.52 s [vector] +++ OK, passed 100 tests.
  6511. 835.52 s [vector] ifoldM: OK
  6512. 835.52 s [vector] +++ OK, passed 100 tests.
  6513. 835.53 s [vector] ifoldM': OK
  6514. 835.53 s [vector] +++ OK, passed 100 tests.
  6515. 835.56 s [vector] ifoldM_: OK (0.02s)
  6516. 835.56 s [vector] +++ OK, passed 100 tests.
  6517. 835.57 s [vector] ifoldM'_: OK (0.02s)
  6518. 835.57 s [vector] +++ OK, passed 100 tests.
  6519. 835.57 s [vector] all: OK
  6520. 835.57 s [vector] +++ OK, passed 100 tests.
  6521. 835.57 s [vector] any: OK
  6522. 835.57 s [vector] +++ OK, passed 100 tests.
  6523. 835.57 s [vector] prescanl: OK
  6524. 835.57 s [vector] +++ OK, passed 100 tests.
  6525. 835.57 s [vector] prescanl': OK
  6526. 835.57 s [vector] +++ OK, passed 100 tests.
  6527. 835.58 s [vector] postscanl: OK
  6528. 835.58 s [vector] +++ OK, passed 100 tests.
  6529. 835.58 s [vector] postscanl': OK
  6530. 835.58 s [vector] +++ OK, passed 100 tests.
  6531. 835.58 s [vector] scanl: OK
  6532. 835.59 s [vector] +++ OK, passed 100 tests.
  6533. 835.59 s [vector] scanl': OK
  6534. 835.59 s [vector] +++ OK, passed 100 tests.
  6535. 835.59 s [vector] scanl1: OK
  6536. 835.59 s [vector] +++ OK, passed 100 tests.
  6537. 835.59 s [vector] scanl1': OK
  6538. 835.59 s [vector] +++ OK, passed 100 tests.
  6539. 835.60 s [vector] iscanl: OK
  6540. 835.60 s [vector] +++ OK, passed 100 tests.
  6541. 835.60 s [vector] iscanl': OK
  6542. 835.60 s [vector] +++ OK, passed 100 tests.
  6543. 835.61 s [vector] prescanr: OK
  6544. 835.61 s [vector] +++ OK, passed 100 tests.
  6545. 835.61 s [vector] prescanr': OK
  6546. 835.61 s [vector] +++ OK, passed 100 tests.
  6547. 835.61 s [vector] postscanr: OK
  6548. 835.61 s [vector] +++ OK, passed 100 tests.
  6549. 835.62 s [vector] postscanr': OK
  6550. 835.62 s [vector] +++ OK, passed 100 tests.
  6551. 835.62 s [vector] scanr: OK
  6552. 835.63 s [vector] +++ OK, passed 100 tests.
  6553. 835.63 s [vector] scanr': OK
  6554. 835.63 s [vector] +++ OK, passed 100 tests.
  6555. 835.63 s [vector] scanr1: OK
  6556. 835.63 s [vector] +++ OK, passed 100 tests.
  6557. 835.63 s [vector] scanr1': OK
  6558. 835.64 s [vector] +++ OK, passed 100 tests.
  6559. 835.65 s [vector] iscanr: OK
  6560. 835.65 s [vector] +++ OK, passed 100 tests.
  6561. 835.65 s [vector] iscanr': OK
  6562. 835.65 s [vector] +++ OK, passed 100 tests.
  6563. 835.65 s [vector] mut_read: OK
  6564. 835.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6565. 835.65 s [vector] mut_write: OK
  6566. 835.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6567. 835.65 s [vector] mut_modify: OK
  6568. 835.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6569. 835.65 s [vector] mut_generate: OK
  6570. 835.65 s [vector] +++ OK, passed 100 tests.
  6571. 835.67 s [vector] mut_generateM: OK (0.01s)
  6572. 835.67 s [vector] +++ OK, passed 100 tests.
  6573. 835.69 s [vector] mut_mapM_: OK (0.02s)
  6574. 835.69 s [vector] +++ OK, passed 100 tests.
  6575. 835.71 s [vector] mut_imapM_: OK (0.02s)
  6576. 835.71 s [vector] +++ OK, passed 100 tests.
  6577. 835.72 s [vector] mut_forM_: OK (0.02s)
  6578. 835.72 s [vector] +++ OK, passed 100 tests.
  6579. 835.74 s [vector] mut_iforM_: OK
  6580. 835.74 s [vector] +++ OK, passed 100 tests.
  6581. 835.74 s [vector] mut_foldr: OK
  6582. 835.74 s [vector] +++ OK, passed 100 tests.
  6583. 835.74 s [vector] mut_foldr': OK
  6584. 835.75 s [vector] +++ OK, passed 100 tests.
  6585. 835.75 s [vector] mut_foldl: OK
  6586. 835.75 s [vector] +++ OK, passed 100 tests.
  6587. 835.75 s [vector] mut_foldl': OK
  6588. 835.75 s [vector] +++ OK, passed 100 tests.
  6589. 835.75 s [vector] mut_ifoldr: OK
  6590. 835.76 s [vector] +++ OK, passed 100 tests.
  6591. 835.76 s [vector] mut_ifoldr': OK
  6592. 835.76 s [vector] +++ OK, passed 100 tests.
  6593. 835.76 s [vector] mut_ifoldl: OK
  6594. 835.77 s [vector] +++ OK, passed 100 tests.
  6595. 835.77 s [vector] mut_ifoldl': OK
  6596. 835.77 s [vector] +++ OK, passed 100 tests.
  6597. 835.78 s [vector] mut_foldM: OK
  6598. 835.78 s [vector] +++ OK, passed 100 tests.
  6599. 835.78 s [vector] mut_foldM': OK
  6600. 835.78 s [vector] +++ OK, passed 100 tests.
  6601. 835.78 s [vector] mut_foldrM: OK
  6602. 835.78 s [vector] +++ OK, passed 100 tests.
  6603. 835.79 s [vector] mut_foldrM': OK
  6604. 835.79 s [vector] +++ OK, passed 100 tests.
  6605. 835.79 s [vector] mut_ifoldM: OK
  6606. 835.79 s [vector] +++ OK, passed 100 tests.
  6607. 835.80 s [vector] mut_ifoldM': OK
  6608. 835.80 s [vector] +++ OK, passed 100 tests.
  6609. 835.80 s [vector] mut_ifoldrM: OK
  6610. 835.81 s [vector] +++ OK, passed 100 tests.
  6611. 835.81 s [vector] mut_ifoldrM': OK
  6612. 835.81 s [vector] +++ OK, passed 100 tests.
  6613. 835.81 s [vector] compare: OK
  6614. 835.81 s [vector] +++ OK, passed 100 tests.
  6615. 835.81 s [vector] maximum: OK
  6616. 835.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6617. 835.81 s [vector] minimum: OK
  6618. 835.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6619. 835.81 s [vector] minIndex: OK
  6620. 835.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6621. 835.81 s [vector] maxIndex: OK
  6622. 835.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6623. 835.81 s [vector] maximumBy: OK
  6624. 835.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6625. 835.82 s [vector] minimumBy: OK
  6626. 835.82 s [vector] +++ OK, passed 100 tests; 25 discarded.
  6627. 835.82 s [vector] maximumOn: OK
  6628. 835.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6629. 835.82 s [vector] minimumOn: OK
  6630. 835.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6631. 835.82 s [vector] maxIndexBy: OK
  6632. 835.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6633. 835.82 s [vector] minIndexBy: OK
  6634. 835.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6635. 835.82 s [vector] ListFirstMaxIndexWins: OK
  6636. 835.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6637. 835.82 s [vector] FalseListFirstMaxIndexWins: OK
  6638. 835.82 s [vector] +++ OK, failed as expected. (after 1 test):
  6639. 835.82 s [vector] Exception:
  6640. 835.82 s [vector] Prelude.foldr1: empty list
  6641. 835.82 s [vector] CallStack (from HasCallStack):
  6642. 835.82 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6643. 835.82 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6644. 835.82 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6645. 835.82 s [vector] []
  6646. 835.82 s [vector] mempty: OK
  6647. 835.82 s [vector] +++ OK, passed 1 test.
  6648. 835.83 s [vector] mappend: OK
  6649. 835.83 s [vector] +++ OK, passed 100 tests.
  6650. 835.84 s [vector] mconcat: OK (0.02s)
  6651. 835.84 s [vector] +++ OK, passed 100 tests.
  6652. 835.84 s [vector] glength: OK
  6653. 835.84 s [vector] +++ OK, passed 100 tests.
  6654. 835.84 s [vector] sum: OK
  6655. 835.84 s [vector] +++ OK, passed 100 tests.
  6656. 835.84 s [vector] product: OK
  6657. 835.84 s [vector] +++ OK, passed 100 tests.
  6658. 835.84 s [vector] enumFromN: OK
  6659. 835.84 s [vector] +++ OK, passed 100 tests.
  6660. 835.84 s [vector] enumFromThenN: OK
  6661. 835.84 s [vector] +++ OK, passed 100 tests.
  6662. 835.85 s [vector] enumFromTo: OK
  6663. 835.85 s [vector] +++ OK, passed 100 tests.
  6664. 835.85 s [vector] enumFromThenTo: OK
  6665. 835.85 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6666. 835.85 s [vector] Double
  6667. 835.85 s [vector] fromList.toList == id: OK
  6668. 835.85 s [vector] +++ OK, passed 100 tests.
  6669. 835.85 s [vector] toList.fromList == id: OK
  6670. 835.85 s [vector] +++ OK, passed 100 tests.
  6671. 835.85 s [vector] unstream.stream == id: OK
  6672. 835.85 s [vector] +++ OK, passed 100 tests.
  6673. 835.85 s [vector] stream.unstream == id: OK
  6674. 835.85 s [vector] +++ OK, passed 100 tests.
  6675. 835.85 s [vector] eq: OK
  6676. 835.85 s [vector] +++ OK, passed 100 tests.
  6677. 835.85 s [vector] length: OK
  6678. 835.85 s [vector] +++ OK, passed 100 tests.
  6679. 835.85 s [vector] null: OK
  6680. 835.85 s [vector] +++ OK, passed 100 tests.
  6681. 835.85 s [vector] index: OK
  6682. 835.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6683. 835.85 s [vector] safeIndex: OK
  6684. 835.85 s [vector] +++ OK, passed 100 tests.
  6685. 835.86 s [vector] head: OK
  6686. 835.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6687. 835.86 s [vector] last: OK
  6688. 835.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6689. 835.86 s [vector] unsafeIndex: OK
  6690. 835.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6691. 835.86 s [vector] unsafeHead: OK
  6692. 835.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6693. 835.86 s [vector] unsafeLast: OK
  6694. 835.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6695. 835.86 s [vector] slice: OK
  6696. 835.86 s [vector] +++ OK, passed 100 tests.
  6697. 835.86 s [vector] init: OK
  6698. 835.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6699. 835.86 s [vector] tail: OK
  6700. 835.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6701. 835.86 s [vector] take: OK
  6702. 835.86 s [vector] +++ OK, passed 100 tests.
  6703. 835.87 s [vector] drop: OK
  6704. 835.87 s [vector] +++ OK, passed 100 tests.
  6705. 835.87 s [vector] splitAt: OK
  6706. 835.87 s [vector] +++ OK, passed 100 tests.
  6707. 835.87 s [vector] empty: OK
  6708. 835.87 s [vector] +++ OK, passed 1 test.
  6709. 835.87 s [vector] singleton: OK
  6710. 835.87 s [vector] +++ OK, passed 100 tests.
  6711. 835.87 s [vector] replicate: OK
  6712. 835.87 s [vector] +++ OK, passed 100 tests.
  6713. 835.87 s [vector] generate: OK
  6714. 835.87 s [vector] +++ OK, passed 100 tests.
  6715. 835.87 s [vector] iterateN: OK
  6716. 835.87 s [vector] +++ OK, passed 100 tests.
  6717. 835.94 s [vector] iterateNM: OK (0.06s)
  6718. 835.94 s [vector] +++ OK, passed 100 tests.
  6719. 835.99 s [vector] generateM: OK (0.04s)
  6720. 835.99 s [vector] +++ OK, passed 100 tests.
  6721. 835.99 s [vector] replicateM: OK
  6722. 835.99 s [vector] +++ OK, passed 100 tests.
  6723. 835.99 s [vector] create: OK
  6724. 835.99 s [vector] +++ OK, passed 100 tests.
  6725. 835.99 s [vector] createT: OK
  6726. 835.99 s [vector] +++ OK, passed 100 tests.
  6727. 836.00 s [vector] unfoldr: OK
  6728. 836.00 s [vector] +++ OK, passed 100 tests.
  6729. 836.01 s [vector] unfoldrN: OK
  6730. 836.01 s [vector] +++ OK, passed 100 tests.
  6731. 836.01 s [vector] unfoldrExactN: OK
  6732. 836.01 s [vector] +++ OK, passed 100 tests.
  6733. 836.01 s [vector] unfoldrM: OK
  6734. 836.01 s [vector] +++ OK, passed 100 tests.
  6735. 836.01 s [vector] unfoldrNM: OK
  6736. 836.01 s [vector] +++ OK, passed 100 tests.
  6737. 836.07 s [vector] unfoldrExactNM: OK (0.05s)
  6738. 836.07 s [vector] +++ OK, passed 100 tests.
  6739. 836.09 s [vector] constructN: OK (0.02s)
  6740. 836.09 s [vector] +++ OK, passed 100 tests.
  6741. 836.09 s [vector] constructrN: OK (0.02s)
  6742. 836.09 s [vector] +++ OK, passed 100 tests.
  6743. 836.09 s [vector] cons: OK
  6744. 836.09 s [vector] +++ OK, passed 100 tests.
  6745. 836.09 s [vector] snoc: OK
  6746. 836.11 s [vector] +++ OK, passed 100 tests.
  6747. 836.11 s [vector] append: OK
  6748. 836.11 s [vector] +++ OK, passed 100 tests.
  6749. 836.12 s [vector] concat: OK (0.03s)
  6750. 836.12 s [vector] +++ OK, passed 100 tests.
  6751. 836.12 s [vector] force: OK
  6752. 836.13 s [vector] +++ OK, passed 100 tests.
  6753. 836.13 s [vector] upd: OK
  6754. 836.13 s [vector] +++ OK, passed 100 tests.
  6755. 836.15 s [vector] accum: OK (0.01s)
  6756. 836.15 s [vector] +++ OK, passed 100 tests.
  6757. 836.15 s [vector] reverse: OK
  6758. 836.15 s [vector] +++ OK, passed 100 tests.
  6759. 836.15 s [vector] backpermute: OK
  6760. 836.15 s [vector] +++ OK, passed 100 tests.
  6761. 836.16 s [vector] map: OK
  6762. 836.17 s [vector] +++ OK, passed 100 tests.
  6763. 836.17 s [vector] imap: OK
  6764. 836.17 s [vector] +++ OK, passed 100 tests.
  6765. 836.19 s [vector] concatMap: OK (0.01s)
  6766. 836.19 s [vector] +++ OK, passed 100 tests.
  6767. 836.19 s [vector] mapM: OK
  6768. 836.19 s [vector] +++ OK, passed 100 tests.
  6769. 836.23 s [vector] mapM_: OK (0.04s)
  6770. 836.23 s [vector] +++ OK, passed 100 tests.
  6771. 836.25 s [vector] forM: OK
  6772. 836.25 s [vector] +++ OK, passed 100 tests.
  6773. 836.29 s [vector] forM_: OK (0.05s)
  6774. 836.29 s [vector] +++ OK, passed 100 tests.
  6775. 836.30 s [vector] imapM: OK (0.01s)
  6776. 836.30 s [vector] +++ OK, passed 100 tests.
  6777. 836.34 s [vector] imapM_: OK (0.04s)
  6778. 836.34 s [vector] +++ OK, passed 100 tests.
  6779. 836.35 s [vector] zipWith: OK (0.01s)
  6780. 836.35 s [vector] +++ OK, passed 100 tests.
  6781. 836.37 s [vector] zipWith3: OK (0.02s)
  6782. 836.37 s [vector] +++ OK, passed 100 tests.
  6783. 836.39 s [vector] izipWith: OK (0.01s)
  6784. 836.39 s [vector] +++ OK, passed 100 tests.
  6785. 836.39 s [vector] izipWith3: OK (0.01s)
  6786. 836.39 s [vector] +++ OK, passed 100 tests.
  6787. 836.42 s [vector] izipWithM: OK (0.01s)
  6788. 836.42 s [vector] +++ OK, passed 100 tests.
  6789. 836.45 s [vector] izipWithM_: OK (0.04s)
  6790. 836.45 s [vector] +++ OK, passed 100 tests.
  6791. 836.47 s [vector] zipWithM: OK (0.01s)
  6792. 836.47 s [vector] +++ OK, passed 100 tests.
  6793. 836.50 s [vector] zipWithM_: OK (0.04s)
  6794. 836.50 s [vector] +++ OK, passed 100 tests.
  6795. 836.51 s [vector] filter: OK
  6796. 836.51 s [vector] +++ OK, passed 100 tests.
  6797. 836.51 s [vector] ifilter: OK (0.01s)
  6798. 836.51 s [vector] +++ OK, passed 100 tests.
  6799. 836.57 s [vector] filterM: OK (0.06s)
  6800. 836.58 s [vector] +++ OK, passed 100 tests.
  6801. 836.58 s [vector] uniq: OK
  6802. 836.58 s [vector] +++ OK, passed 100 tests.
  6803. 836.59 s [vector] mapMaybe: OK
  6804. 836.59 s [vector] +++ OK, passed 100 tests.
  6805. 836.59 s [vector] imapMaybe: OK
  6806. 836.59 s [vector] +++ OK, passed 100 tests.
  6807. 836.59 s [vector] takeWhile: OK
  6808. 836.59 s [vector] +++ OK, passed 100 tests.
  6809. 836.61 s [vector] dropWhile: OK
  6810. 836.61 s [vector] +++ OK, passed 100 tests.
  6811. 836.61 s [vector] partition: OK (0.01s)
  6812. 836.61 s [vector] +++ OK, passed 100 tests.
  6813. 836.63 s [vector] partitionWith: OK (0.01s)
  6814. 836.63 s [vector] +++ OK, passed 100 tests.
  6815. 836.64 s [vector] span: OK
  6816. 836.64 s [vector] +++ OK, passed 100 tests.
  6817. 836.64 s [vector] break: OK
  6818. 836.64 s [vector] +++ OK, passed 100 tests.
  6819. 836.64 s [vector] spanR: OK
  6820. 836.64 s [vector] +++ OK, passed 100 tests.
  6821. 836.64 s [vector] breakR: OK
  6822. 836.65 s [vector] +++ OK, passed 100 tests.
  6823. 836.67 s [vector] groupBy: OK (0.02s)
  6824. 836.67 s [vector] +++ OK, passed 100 tests.
  6825. 836.67 s [vector] elem: OK
  6826. 836.67 s [vector] +++ OK, passed 100 tests.
  6827. 836.67 s [vector] notElem: OK
  6828. 836.67 s [vector] +++ OK, passed 100 tests.
  6829. 836.68 s [vector] find: OK
  6830. 836.68 s [vector] +++ OK, passed 100 tests.
  6831. 836.68 s [vector] findIndex: OK
  6832. 836.68 s [vector] +++ OK, passed 100 tests.
  6833. 836.68 s [vector] findIndexR: OK
  6834. 836.69 s [vector] +++ OK, passed 100 tests.
  6835. 836.69 s [vector] findIndices: OK (0.01s)
  6836. 836.69 s [vector] +++ OK, passed 100 tests.
  6837. 836.70 s [vector] elemIndex: OK
  6838. 836.70 s [vector] +++ OK, passed 100 tests.
  6839. 836.71 s [vector] elemIndices: OK
  6840. 836.71 s [vector] +++ OK, passed 100 tests.
  6841. 836.73 s [vector] foldl: OK (0.02s)
  6842. 836.73 s [vector] +++ OK, passed 100 tests.
  6843. 836.75 s [vector] foldl1: OK (0.02s)
  6844. 836.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6845. 836.77 s [vector] foldl': OK (0.02s)
  6846. 836.77 s [vector] +++ OK, passed 100 tests.
  6847. 836.77 s [vector] foldl1': OK (0.02s)
  6848. 836.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6849. 836.79 s [vector] foldr: OK
  6850. 836.81 s [vector] +++ OK, passed 100 tests.
  6851. 836.81 s [vector] foldr1: OK (0.02s)
  6852. 836.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6853. 836.83 s [vector] foldr': OK (0.02s)
  6854. 836.83 s [vector] +++ OK, passed 100 tests.
  6855. 836.84 s [vector] foldr1': OK (0.02s)
  6856. 836.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6857. 836.86 s [vector] ifoldl: OK
  6858. 836.87 s [vector] +++ OK, passed 100 tests.
  6859. 836.89 s [vector] ifoldl': OK (0.02s)
  6860. 836.89 s [vector] +++ OK, passed 100 tests.
  6861. 836.91 s [vector] ifoldr: OK (0.02s)
  6862. 836.91 s [vector] +++ OK, passed 100 tests.
  6863. 836.93 s [vector] ifoldr': OK (0.02s)
  6864. 836.93 s [vector] +++ OK, passed 100 tests.
  6865. 836.93 s [vector] ifoldM: OK (0.02s)
  6866. 836.93 s [vector] +++ OK, passed 100 tests.
  6867. 836.98 s [vector] ifoldM': OK (0.02s)
  6868. 836.98 s [vector] +++ OK, passed 100 tests.
  6869. 837.00 s [vector] ifoldM_: OK (0.05s)
  6870. 837.00 s [vector] +++ OK, passed 100 tests.
  6871. 837.04 s [vector] ifoldM'_: OK (0.04s)
  6872. 837.04 s [vector] +++ OK, passed 100 tests.
  6873. 837.04 s [vector] all: OK
  6874. 837.04 s [vector] +++ OK, passed 100 tests.
  6875. 837.04 s [vector] any: OK
  6876. 837.04 s [vector] +++ OK, passed 100 tests.
  6877. 837.05 s [vector] prescanl: OK
  6878. 837.05 s [vector] +++ OK, passed 100 tests.
  6879. 837.09 s [vector] prescanl': OK (0.02s)
  6880. 837.09 s [vector] +++ OK, passed 100 tests.
  6881. 837.09 s [vector] postscanl: OK (0.02s)
  6882. 837.09 s [vector] +++ OK, passed 100 tests.
  6883. 837.11 s [vector] postscanl': OK (0.02s)
  6884. 837.11 s [vector] +++ OK, passed 100 tests.
  6885. 837.13 s [vector] scanl: OK (0.02s)
  6886. 837.13 s [vector] +++ OK, passed 100 tests.
  6887. 837.15 s [vector] scanl': OK (0.02s)
  6888. 837.15 s [vector] +++ OK, passed 100 tests.
  6889. 837.19 s [vector] scanl1: OK (0.02s)
  6890. 837.19 s [vector] +++ OK, passed 100 tests.
  6891. 837.19 s [vector] scanl1': OK (0.02s)
  6892. 837.19 s [vector] +++ OK, passed 100 tests.
  6893. 837.21 s [vector] iscanl: OK (0.02s)
  6894. 837.21 s [vector] +++ OK, passed 100 tests.
  6895. 837.23 s [vector] iscanl': OK (0.02s)
  6896. 837.23 s [vector] +++ OK, passed 100 tests.
  6897. 837.25 s [vector] prescanr: OK (0.02s)
  6898. 837.25 s [vector] +++ OK, passed 100 tests.
  6899. 837.27 s [vector] prescanr': OK (0.02s)
  6900. 837.27 s [vector] +++ OK, passed 100 tests.
  6901. 837.29 s [vector] postscanr: OK (0.02s)
  6902. 837.29 s [vector] +++ OK, passed 100 tests.
  6903. 837.31 s [vector] postscanr': OK (0.02s)
  6904. 837.31 s [vector] +++ OK, passed 100 tests.
  6905. 837.33 s [vector] scanr: OK (0.02s)
  6906. 837.33 s [vector] +++ OK, passed 100 tests.
  6907. 837.35 s [vector] scanr': OK (0.02s)
  6908. 837.35 s [vector] +++ OK, passed 100 tests.
  6909. 837.37 s [vector] scanr1: OK (0.02s)
  6910. 837.37 s [vector] +++ OK, passed 100 tests.
  6911. 837.40 s [vector] scanr1': OK (0.02s)
  6912. 837.40 s [vector] +++ OK, passed 100 tests.
  6913. 837.42 s [vector] iscanr: OK (0.02s)
  6914. 837.42 s [vector] +++ OK, passed 100 tests.
  6915. 837.44 s [vector] iscanr': OK (0.04s)
  6916. 837.44 s [vector] +++ OK, passed 100 tests.
  6917. 837.44 s [vector] mut_read: OK
  6918. 837.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6919. 837.44 s [vector] mut_write: OK
  6920. 837.44 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6921. 837.44 s [vector] mut_modify: OK
  6922. 837.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6923. 837.45 s [vector] mut_generate: OK
  6924. 837.45 s [vector] +++ OK, passed 100 tests.
  6925. 837.47 s [vector] mut_generateM: OK (0.02s)
  6926. 837.47 s [vector] +++ OK, passed 100 tests.
  6927. 837.51 s [vector] mut_mapM_: OK (0.04s)
  6928. 837.51 s [vector] +++ OK, passed 100 tests.
  6929. 837.57 s [vector] mut_imapM_: OK (0.05s)
  6930. 837.57 s [vector] +++ OK, passed 100 tests.
  6931. 837.61 s [vector] mut_forM_: OK (0.05s)
  6932. 837.61 s [vector] +++ OK, passed 100 tests.
  6933. 837.65 s [vector] mut_iforM_: OK (0.05s)
  6934. 837.66 s [vector] +++ OK, passed 100 tests.
  6935. 837.67 s [vector] mut_foldr: OK (0.02s)
  6936. 837.67 s [vector] +++ OK, passed 100 tests.
  6937. 837.69 s [vector] mut_foldr': OK (0.02s)
  6938. 837.69 s [vector] +++ OK, passed 100 tests.
  6939. 837.71 s [vector] mut_foldl: OK (0.02s)
  6940. 837.71 s [vector] +++ OK, passed 100 tests.
  6941. 837.73 s [vector] mut_foldl': OK (0.02s)
  6942. 837.73 s [vector] +++ OK, passed 100 tests.
  6943. 837.75 s [vector] mut_ifoldr: OK (0.02s)
  6944. 837.75 s [vector] +++ OK, passed 100 tests.
  6945. 837.77 s [vector] mut_ifoldr': OK (0.02s)
  6946. 837.77 s [vector] +++ OK, passed 100 tests.
  6947. 837.79 s [vector] mut_ifoldl: OK (0.02s)
  6948. 837.79 s [vector] +++ OK, passed 100 tests.
  6949. 837.81 s [vector] mut_ifoldl': OK (0.02s)
  6950. 837.81 s [vector] +++ OK, passed 100 tests.
  6951. 837.82 s [vector] mut_foldM: OK (0.02s)
  6952. 837.82 s [vector] +++ OK, passed 100 tests.
  6953. 837.83 s [vector] mut_foldM': OK
  6954. 837.83 s [vector] +++ OK, passed 100 tests.
  6955. 837.85 s [vector] mut_foldrM: OK (0.02s)
  6956. 837.85 s [vector] +++ OK, passed 100 tests.
  6957. 837.87 s [vector] mut_foldrM': OK (0.02s)
  6958. 837.87 s [vector] +++ OK, passed 100 tests.
  6959. 837.89 s [vector] mut_ifoldM: OK (0.02s)
  6960. 837.89 s [vector] +++ OK, passed 100 tests.
  6961. 837.91 s [vector] mut_ifoldM': OK (0.02s)
  6962. 837.91 s [vector] +++ OK, passed 100 tests.
  6963. 837.93 s [vector] mut_ifoldrM: OK (0.02s)
  6964. 837.93 s [vector] +++ OK, passed 100 tests.
  6965. 837.94 s [vector] mut_ifoldrM': OK (0.02s)
  6966. 837.94 s [vector] +++ OK, passed 100 tests.
  6967. 837.94 s [vector] compare: OK
  6968. 837.94 s [vector] +++ OK, passed 100 tests.
  6969. 837.94 s [vector] maximum: OK
  6970. 837.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6971. 837.94 s [vector] minimum: OK
  6972. 837.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6973. 837.94 s [vector] minIndex: OK
  6974. 837.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6975. 837.94 s [vector] maxIndex: OK
  6976. 837.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6977. 837.94 s [vector] maximumBy: OK
  6978. 837.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6979. 837.94 s [vector] minimumBy: OK
  6980. 837.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6981. 837.95 s [vector] maximumOn: OK
  6982. 837.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6983. 837.95 s [vector] minimumOn: OK
  6984. 837.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6985. 837.95 s [vector] maxIndexBy: OK
  6986. 837.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6987. 837.95 s [vector] minIndexBy: OK
  6988. 837.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6989. 837.95 s [vector] ListFirstMaxIndexWins: OK
  6990. 837.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6991. 837.95 s [vector] FalseListFirstMaxIndexWins: OK
  6992. 837.95 s [vector] +++ OK, failed as expected. (after 1 test):
  6993. 837.95 s [vector] Exception:
  6994. 837.95 s [vector] Prelude.foldr1: empty list
  6995. 837.95 s [vector] CallStack (from HasCallStack):
  6996. 837.95 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6997. 837.95 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6998. 837.95 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6999. 837.95 s [vector] []
  7000. 837.95 s [vector] mempty: OK
  7001. 837.95 s [vector] +++ OK, passed 1 test.
  7002. 837.96 s [vector] mappend: OK
  7003. 837.97 s [vector] +++ OK, passed 100 tests.
  7004. 837.99 s [vector] mconcat: OK (0.03s)
  7005. 837.99 s [vector] +++ OK, passed 100 tests.
  7006. 837.99 s [vector] glength: OK
  7007. 837.99 s [vector] +++ OK, passed 100 tests.
  7008. 837.99 s [vector] sum: OK
  7009. 837.99 s [vector] +++ OK, passed 100 tests.
  7010. 838.00 s [vector] product: OK
  7011. 838.00 s [vector] +++ OK, passed 100 tests.
  7012. 838.00 s [vector] enumFromN: OK
  7013. 838.00 s [vector] +++ OK, passed 100 tests.
  7014. 838.00 s [vector] enumFromThenN: OK
  7015. 838.00 s [vector] +++ OK, passed 100 tests.
  7016. 838.00 s [vector] enumFromTo: OK
  7017. 838.00 s [vector] +++ OK, passed 100 tests.
  7018. 838.00 s [vector] enumFromThenTo: OK
  7019. 838.00 s [vector] +++ OK, passed 100 tests; 1 discarded.
  7020. 838.00 s [vector] unstream
  7021. 838.00 s [vector] unstream == vunstream (exact): OK
  7022. 838.00 s [vector] +++ OK, passed 100 tests.
  7023. 838.00 s [vector] unstream == vunstream (unknown): OK
  7024. 838.00 s [vector] +++ OK, passed 100 tests.
  7025. 838.01 s [vector] unstreamR ~= vunstream (exact): OK
  7026. 838.01 s [vector] +++ OK, passed 100 tests.
  7027. 838.01 s [vector] unstreamR ~= vunstream (unknown): OK
  7028. 838.01 s [vector] +++ OK, passed 100 tests.
  7029. 838.01 s [vector] Tests.Vector.Storable
  7030. 838.01 s [vector] Data.Vector.Storable.Vector (Int)
  7031. 838.01 s [vector] fromList.toList == id: OK
  7032. 838.01 s [vector] +++ OK, passed 100 tests.
  7033. 838.01 s [vector] toList.fromList == id: OK
  7034. 838.01 s [vector] +++ OK, passed 100 tests.
  7035. 838.01 s [vector] unstream.stream == id: OK
  7036. 838.01 s [vector] +++ OK, passed 100 tests.
  7037. 838.01 s [vector] stream.unstream == id: OK
  7038. 838.01 s [vector] +++ OK, passed 100 tests.
  7039. 838.01 s [vector] eq: OK
  7040. 838.01 s [vector] +++ OK, passed 100 tests.
  7041. 838.01 s [vector] length: OK
  7042. 838.01 s [vector] +++ OK, passed 100 tests.
  7043. 838.01 s [vector] null: OK
  7044. 838.01 s [vector] +++ OK, passed 100 tests.
  7045. 838.01 s [vector] index: OK
  7046. 838.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7047. 838.01 s [vector] safeIndex: OK
  7048. 838.01 s [vector] +++ OK, passed 100 tests.
  7049. 838.01 s [vector] head: OK
  7050. 838.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7051. 838.01 s [vector] last: OK
  7052. 838.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7053. 838.01 s [vector] unsafeIndex: OK
  7054. 838.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7055. 838.01 s [vector] unsafeHead: OK
  7056. 838.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7057. 838.01 s [vector] unsafeLast: OK
  7058. 838.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7059. 838.02 s [vector] slice: OK
  7060. 838.02 s [vector] +++ OK, passed 100 tests.
  7061. 838.02 s [vector] init: OK
  7062. 838.02 s [vector] +++ OK, passed 100 tests; 25 discarded.
  7063. 838.02 s [vector] tail: OK
  7064. 838.02 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7065. 838.02 s [vector] take: OK
  7066. 838.02 s [vector] +++ OK, passed 100 tests.
  7067. 838.02 s [vector] drop: OK
  7068. 838.02 s [vector] +++ OK, passed 100 tests.
  7069. 838.02 s [vector] splitAt: OK
  7070. 838.02 s [vector] +++ OK, passed 100 tests.
  7071. 838.02 s [vector] empty: OK
  7072. 838.02 s [vector] +++ OK, passed 1 test.
  7073. 838.02 s [vector] singleton: OK
  7074. 838.02 s [vector] +++ OK, passed 100 tests.
  7075. 838.02 s [vector] replicate: OK
  7076. 838.02 s [vector] +++ OK, passed 100 tests.
  7077. 838.02 s [vector] generate: OK
  7078. 838.02 s [vector] +++ OK, passed 100 tests.
  7079. 838.02 s [vector] iterateN: OK
  7080. 838.03 s [vector] +++ OK, passed 100 tests.
  7081. 838.07 s [vector] iterateNM: OK (0.04s)
  7082. 838.07 s [vector] +++ OK, passed 100 tests.
  7083. 838.09 s [vector] generateM: OK (0.01s)
  7084. 838.09 s [vector] +++ OK, passed 100 tests.
  7085. 838.10 s [vector] replicateM: OK (0.02s)
  7086. 838.10 s [vector] +++ OK, passed 100 tests.
  7087. 838.10 s [vector] create: OK
  7088. 838.10 s [vector] +++ OK, passed 100 tests.
  7089. 838.10 s [vector] createT: OK
  7090. 838.10 s [vector] +++ OK, passed 100 tests.
  7091. 838.10 s [vector] unfoldr: OK
  7092. 838.10 s [vector] +++ OK, passed 100 tests.
  7093. 838.10 s [vector] unfoldrN: OK
  7094. 838.10 s [vector] +++ OK, passed 100 tests.
  7095. 838.12 s [vector] unfoldrExactN: OK
  7096. 838.12 s [vector] +++ OK, passed 100 tests.
  7097. 838.13 s [vector] unfoldrM: OK (0.03s)
  7098. 838.13 s [vector] +++ OK, passed 100 tests.
  7099. 838.15 s [vector] unfoldrNM: OK (0.02s)
  7100. 838.15 s [vector] +++ OK, passed 100 tests.
  7101. 838.19 s [vector] unfoldrExactNM: OK (0.04s)
  7102. 838.19 s [vector] +++ OK, passed 100 tests.
  7103. 838.20 s [vector] constructN: OK
  7104. 838.20 s [vector] +++ OK, passed 100 tests.
  7105. 838.20 s [vector] constructrN: OK
  7106. 838.20 s [vector] +++ OK, passed 100 tests.
  7107. 838.20 s [vector] cons: OK
  7108. 838.20 s [vector] +++ OK, passed 100 tests.
  7109. 838.20 s [vector] snoc: OK
  7110. 838.20 s [vector] +++ OK, passed 100 tests.
  7111. 838.21 s [vector] append: OK
  7112. 838.21 s [vector] +++ OK, passed 100 tests.
  7113. 838.22 s [vector] concat: OK (0.02s)
  7114. 838.22 s [vector] +++ OK, passed 100 tests.
  7115. 838.22 s [vector] force: OK
  7116. 838.22 s [vector] +++ OK, passed 100 tests.
  7117. 838.23 s [vector] upd: OK
  7118. 838.23 s [vector] +++ OK, passed 100 tests.
  7119. 838.23 s [vector] accum: OK
  7120. 838.23 s [vector] +++ OK, passed 100 tests.
  7121. 838.23 s [vector] reverse: OK
  7122. 838.23 s [vector] +++ OK, passed 100 tests.
  7123. 838.23 s [vector] backpermute: OK
  7124. 838.23 s [vector] +++ OK, passed 100 tests.
  7125. 838.23 s [vector] map: OK
  7126. 838.23 s [vector] +++ OK, passed 100 tests.
  7127. 838.24 s [vector] imap: OK
  7128. 838.24 s [vector] +++ OK, passed 100 tests.
  7129. 838.24 s [vector] concatMap: OK
  7130. 838.24 s [vector] +++ OK, passed 100 tests.
  7131. 838.25 s [vector] mapM: OK
  7132. 838.25 s [vector] +++ OK, passed 100 tests.
  7133. 838.26 s [vector] mapM_: OK (0.02s)
  7134. 838.26 s [vector] +++ OK, passed 100 tests.
  7135. 838.26 s [vector] forM: OK
  7136. 838.27 s [vector] +++ OK, passed 100 tests.
  7137. 838.28 s [vector] forM_: OK (0.02s)
  7138. 838.28 s [vector] +++ OK, passed 100 tests.
  7139. 838.30 s [vector] imapM: OK
  7140. 838.30 s [vector] +++ OK, passed 100 tests.
  7141. 838.31 s [vector] imapM_: OK (0.02s)
  7142. 838.31 s [vector] +++ OK, passed 100 tests.
  7143. 838.31 s [vector] zipWith: OK
  7144. 838.31 s [vector] +++ OK, passed 100 tests.
  7145. 838.31 s [vector] zipWith3: OK
  7146. 838.31 s [vector] +++ OK, passed 100 tests.
  7147. 838.32 s [vector] izipWith: OK
  7148. 838.32 s [vector] +++ OK, passed 100 tests.
  7149. 838.32 s [vector] izipWith3: OK
  7150. 838.32 s [vector] +++ OK, passed 100 tests.
  7151. 838.33 s [vector] izipWithM: OK
  7152. 838.33 s [vector] +++ OK, passed 100 tests.
  7153. 838.34 s [vector] izipWithM_: OK (0.02s)
  7154. 838.34 s [vector] +++ OK, passed 100 tests.
  7155. 838.34 s [vector] zipWithM: OK
  7156. 838.35 s [vector] +++ OK, passed 100 tests.
  7157. 838.35 s [vector] zipWithM_: OK (0.01s)
  7158. 838.35 s [vector] +++ OK, passed 100 tests.
  7159. 838.36 s [vector] filter: OK
  7160. 838.36 s [vector] +++ OK, passed 100 tests.
  7161. 838.37 s [vector] ifilter: OK
  7162. 838.37 s [vector] +++ OK, passed 100 tests.
  7163. 838.39 s [vector] filterM: OK (0.03s)
  7164. 838.39 s [vector] +++ OK, passed 100 tests.
  7165. 838.39 s [vector] uniq: OK
  7166. 838.39 s [vector] +++ OK, passed 100 tests.
  7167. 838.39 s [vector] mapMaybe: OK
  7168. 838.39 s [vector] +++ OK, passed 100 tests.
  7169. 838.39 s [vector] imapMaybe: OK
  7170. 838.39 s [vector] +++ OK, passed 100 tests.
  7171. 838.39 s [vector] takeWhile: OK
  7172. 838.39 s [vector] +++ OK, passed 100 tests.
  7173. 838.39 s [vector] dropWhile: OK
  7174. 838.39 s [vector] +++ OK, passed 100 tests.
  7175. 838.40 s [vector] partition: OK
  7176. 838.40 s [vector] +++ OK, passed 100 tests.
  7177. 838.40 s [vector] partitionWith: OK
  7178. 838.40 s [vector] +++ OK, passed 100 tests.
  7179. 838.40 s [vector] span: OK
  7180. 838.40 s [vector] +++ OK, passed 100 tests.
  7181. 838.40 s [vector] break: OK
  7182. 838.40 s [vector] +++ OK, passed 100 tests.
  7183. 838.40 s [vector] spanR: OK
  7184. 838.40 s [vector] +++ OK, passed 100 tests.
  7185. 838.41 s [vector] breakR: OK
  7186. 838.41 s [vector] +++ OK, passed 100 tests.
  7187. 838.41 s [vector] groupBy: OK
  7188. 838.41 s [vector] +++ OK, passed 100 tests.
  7189. 838.41 s [vector] elem: OK
  7190. 838.41 s [vector] +++ OK, passed 100 tests.
  7191. 838.41 s [vector] notElem: OK
  7192. 838.41 s [vector] +++ OK, passed 100 tests.
  7193. 838.41 s [vector] find: OK
  7194. 838.41 s [vector] +++ OK, passed 100 tests.
  7195. 838.41 s [vector] findIndex: OK
  7196. 838.41 s [vector] +++ OK, passed 100 tests.
  7197. 838.41 s [vector] findIndexR: OK
  7198. 838.41 s [vector] +++ OK, passed 100 tests.
  7199. 838.41 s [vector] findIndices: OK
  7200. 838.41 s [vector] +++ OK, passed 100 tests.
  7201. 838.41 s [vector] elemIndex: OK
  7202. 838.41 s [vector] +++ OK, passed 100 tests.
  7203. 838.41 s [vector] elemIndices: OK
  7204. 838.41 s [vector] +++ OK, passed 100 tests.
  7205. 838.42 s [vector] foldl: OK
  7206. 838.42 s [vector] +++ OK, passed 100 tests.
  7207. 838.42 s [vector] foldl1: OK
  7208. 838.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7209. 838.42 s [vector] foldl': OK
  7210. 838.42 s [vector] +++ OK, passed 100 tests.
  7211. 838.42 s [vector] foldl1': OK
  7212. 838.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7213. 838.43 s [vector] foldr: OK
  7214. 838.43 s [vector] +++ OK, passed 100 tests.
  7215. 838.43 s [vector] foldr1: OK
  7216. 838.44 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7217. 838.44 s [vector] foldr': OK
  7218. 838.44 s [vector] +++ OK, passed 100 tests.
  7219. 838.44 s [vector] foldr1': OK
  7220. 838.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7221. 838.44 s [vector] ifoldl: OK
  7222. 838.44 s [vector] +++ OK, passed 100 tests.
  7223. 838.45 s [vector] ifoldl': OK
  7224. 838.45 s [vector] +++ OK, passed 100 tests.
  7225. 838.45 s [vector] ifoldr: OK
  7226. 838.46 s [vector] +++ OK, passed 100 tests.
  7227. 838.46 s [vector] ifoldr': OK
  7228. 838.46 s [vector] +++ OK, passed 100 tests.
  7229. 838.47 s [vector] ifoldM: OK
  7230. 838.47 s [vector] +++ OK, passed 100 tests.
  7231. 838.47 s [vector] ifoldM': OK
  7232. 838.47 s [vector] +++ OK, passed 100 tests.
  7233. 838.49 s [vector] ifoldM_: OK (0.02s)
  7234. 838.49 s [vector] +++ OK, passed 100 tests.
  7235. 838.51 s [vector] ifoldM'_: OK (0.02s)
  7236. 838.51 s [vector] +++ OK, passed 100 tests.
  7237. 838.51 s [vector] all: OK
  7238. 838.51 s [vector] +++ OK, passed 100 tests.
  7239. 838.51 s [vector] any: OK
  7240. 838.51 s [vector] +++ OK, passed 100 tests.
  7241. 838.51 s [vector] prescanl: OK
  7242. 838.51 s [vector] +++ OK, passed 100 tests.
  7243. 838.52 s [vector] prescanl': OK
  7244. 838.52 s [vector] +++ OK, passed 100 tests.
  7245. 838.53 s [vector] postscanl: OK
  7246. 838.53 s [vector] +++ OK, passed 100 tests.
  7247. 838.53 s [vector] postscanl': OK
  7248. 838.53 s [vector] +++ OK, passed 100 tests.
  7249. 838.54 s [vector] scanl: OK
  7250. 838.54 s [vector] +++ OK, passed 100 tests.
  7251. 838.55 s [vector] scanl': OK
  7252. 838.55 s [vector] +++ OK, passed 100 tests.
  7253. 838.55 s [vector] scanl1: OK
  7254. 838.55 s [vector] +++ OK, passed 100 tests.
  7255. 838.56 s [vector] scanl1': OK
  7256. 838.56 s [vector] +++ OK, passed 100 tests.
  7257. 838.56 s [vector] iscanl: OK
  7258. 838.57 s [vector] +++ OK, passed 100 tests.
  7259. 838.57 s [vector] iscanl': OK
  7260. 838.57 s [vector] +++ OK, passed 100 tests.
  7261. 838.58 s [vector] prescanr: OK
  7262. 838.58 s [vector] +++ OK, passed 100 tests.
  7263. 838.59 s [vector] prescanr': OK
  7264. 838.59 s [vector] +++ OK, passed 100 tests.
  7265. 838.59 s [vector] postscanr: OK
  7266. 838.59 s [vector] +++ OK, passed 100 tests.
  7267. 838.60 s [vector] postscanr': OK
  7268. 838.60 s [vector] +++ OK, passed 100 tests.
  7269. 838.61 s [vector] scanr: OK
  7270. 838.61 s [vector] +++ OK, passed 100 tests.
  7271. 838.61 s [vector] scanr': OK
  7272. 838.61 s [vector] +++ OK, passed 100 tests.
  7273. 838.61 s [vector] scanr1: OK
  7274. 838.61 s [vector] +++ OK, passed 100 tests.
  7275. 838.61 s [vector] scanr1': OK
  7276. 838.62 s [vector] +++ OK, passed 100 tests.
  7277. 838.62 s [vector] iscanr: OK
  7278. 838.62 s [vector] +++ OK, passed 100 tests.
  7279. 838.62 s [vector] iscanr': OK
  7280. 838.62 s [vector] +++ OK, passed 100 tests.
  7281. 838.62 s [vector] mut_read: OK
  7282. 838.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7283. 838.62 s [vector] mut_write: OK
  7284. 838.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7285. 838.62 s [vector] mut_modify: OK
  7286. 838.62 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7287. 838.62 s [vector] mut_generate: OK
  7288. 838.63 s [vector] +++ OK, passed 100 tests.
  7289. 838.65 s [vector] mut_generateM: OK (0.01s)
  7290. 838.65 s [vector] +++ OK, passed 100 tests.
  7291. 838.65 s [vector] mut_mapM_: OK (0.02s)
  7292. 838.65 s [vector] +++ OK, passed 100 tests.
  7293. 838.69 s [vector] mut_imapM_: OK (0.02s)
  7294. 838.71 s [vector] +++ OK, passed 100 tests.
  7295. 838.71 s [vector] mut_forM_: OK (0.02s)
  7296. 838.71 s [vector] +++ OK, passed 100 tests.
  7297. 838.71 s [vector] mut_iforM_: OK (0.02s)
  7298. 838.71 s [vector] +++ OK, passed 100 tests.
  7299. 838.71 s [vector] mut_foldr: OK
  7300. 838.72 s [vector] +++ OK, passed 100 tests.
  7301. 838.72 s [vector] mut_foldr': OK
  7302. 838.72 s [vector] +++ OK, passed 100 tests.
  7303. 838.72 s [vector] mut_foldl: OK
  7304. 838.72 s [vector] +++ OK, passed 100 tests.
  7305. 838.72 s [vector] mut_foldl': OK
  7306. 838.72 s [vector] +++ OK, passed 100 tests.
  7307. 838.73 s [vector] mut_ifoldr: OK
  7308. 838.73 s [vector] +++ OK, passed 100 tests.
  7309. 838.74 s [vector] mut_ifoldr': OK
  7310. 838.74 s [vector] +++ OK, passed 100 tests.
  7311. 838.75 s [vector] mut_ifoldl: OK
  7312. 838.75 s [vector] +++ OK, passed 100 tests.
  7313. 838.75 s [vector] mut_ifoldl': OK
  7314. 838.75 s [vector] +++ OK, passed 100 tests.
  7315. 838.75 s [vector] mut_foldM: OK
  7316. 838.76 s [vector] +++ OK, passed 100 tests.
  7317. 838.77 s [vector] mut_foldM': OK
  7318. 838.77 s [vector] +++ OK, passed 100 tests.
  7319. 838.77 s [vector] mut_foldrM: OK
  7320. 838.77 s [vector] +++ OK, passed 100 tests.
  7321. 838.77 s [vector] mut_foldrM': OK
  7322. 838.78 s [vector] +++ OK, passed 100 tests.
  7323. 838.79 s [vector] mut_ifoldM: OK
  7324. 838.79 s [vector] +++ OK, passed 100 tests.
  7325. 838.79 s [vector] mut_ifoldM': OK
  7326. 838.79 s [vector] +++ OK, passed 100 tests.
  7327. 838.80 s [vector] mut_ifoldrM: OK
  7328. 838.80 s [vector] +++ OK, passed 100 tests.
  7329. 838.80 s [vector] mut_ifoldrM': OK
  7330. 838.80 s [vector] +++ OK, passed 100 tests.
  7331. 838.80 s [vector] compare: OK
  7332. 838.80 s [vector] +++ OK, passed 100 tests.
  7333. 838.81 s [vector] maximum: OK
  7334. 838.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7335. 838.81 s [vector] minimum: OK
  7336. 838.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7337. 838.81 s [vector] minIndex: OK
  7338. 838.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7339. 838.81 s [vector] maxIndex: OK
  7340. 838.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7341. 838.81 s [vector] maximumBy: OK
  7342. 838.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7343. 838.81 s [vector] minimumBy: OK
  7344. 838.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7345. 838.81 s [vector] maximumOn: OK
  7346. 838.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7347. 838.81 s [vector] minimumOn: OK
  7348. 838.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7349. 838.81 s [vector] maxIndexBy: OK
  7350. 838.81 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7351. 838.82 s [vector] minIndexBy: OK
  7352. 838.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7353. 838.82 s [vector] ListFirstMaxIndexWins: OK
  7354. 838.82 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7355. 838.82 s [vector] FalseListFirstMaxIndexWins: OK
  7356. 838.82 s [vector] +++ OK, failed as expected. (after 1 test):
  7357. 838.82 s [vector] Exception:
  7358. 838.82 s [vector] Prelude.foldr1: empty list
  7359. 838.82 s [vector] CallStack (from HasCallStack):
  7360. 838.82 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  7361. 838.82 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  7362. 838.82 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7363. 838.82 s [vector] []
  7364. 838.82 s [vector] mempty: OK
  7365. 838.82 s [vector] +++ OK, passed 1 test.
  7366. 838.83 s [vector] mappend: OK
  7367. 838.83 s [vector] +++ OK, passed 100 tests.
  7368. 838.83 s [vector] mconcat: OK (0.02s)
  7369. 838.83 s [vector] +++ OK, passed 100 tests.
  7370. 838.84 s [vector] glength: OK
  7371. 838.84 s [vector] +++ OK, passed 100 tests.
  7372. 838.84 s [vector] sum: OK
  7373. 838.84 s [vector] +++ OK, passed 100 tests.
  7374. 838.84 s [vector] product: OK
  7375. 838.84 s [vector] +++ OK, passed 100 tests.
  7376. 838.84 s [vector] enumFromN: OK
  7377. 838.84 s [vector] +++ OK, passed 100 tests.
  7378. 838.84 s [vector] enumFromThenN: OK
  7379. 838.84 s [vector] +++ OK, passed 100 tests.
  7380. 838.84 s [vector] enumFromTo: OK
  7381. 838.84 s [vector] +++ OK, passed 100 tests.
  7382. 838.84 s [vector] enumFromThenTo: OK
  7383. 838.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7384. 838.84 s [vector] Data.Vector.Storable.Vector (Double)
  7385. 838.84 s [vector] fromList.toList == id: OK
  7386. 838.84 s [vector] +++ OK, passed 100 tests.
  7387. 838.84 s [vector] toList.fromList == id: OK
  7388. 838.84 s [vector] +++ OK, passed 100 tests.
  7389. 838.84 s [vector] unstream.stream == id: OK
  7390. 838.84 s [vector] +++ OK, passed 100 tests.
  7391. 838.84 s [vector] stream.unstream == id: OK
  7392. 838.84 s [vector] +++ OK, passed 100 tests.
  7393. 838.84 s [vector] eq: OK
  7394. 838.84 s [vector] +++ OK, passed 100 tests.
  7395. 838.85 s [vector] length: OK
  7396. 838.85 s [vector] +++ OK, passed 100 tests.
  7397. 838.85 s [vector] null: OK
  7398. 838.85 s [vector] +++ OK, passed 100 tests.
  7399. 838.85 s [vector] index: OK
  7400. 838.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7401. 838.85 s [vector] safeIndex: OK
  7402. 838.85 s [vector] +++ OK, passed 100 tests.
  7403. 838.85 s [vector] head: OK
  7404. 838.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7405. 838.85 s [vector] last: OK
  7406. 838.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7407. 838.85 s [vector] unsafeIndex: OK
  7408. 838.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7409. 838.85 s [vector] unsafeHead: OK
  7410. 838.85 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7411. 838.85 s [vector] unsafeLast: OK
  7412. 838.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7413. 838.85 s [vector] slice: OK
  7414. 838.85 s [vector] +++ OK, passed 100 tests.
  7415. 838.85 s [vector] init: OK
  7416. 838.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7417. 838.86 s [vector] tail: OK
  7418. 838.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7419. 838.86 s [vector] take: OK
  7420. 838.86 s [vector] +++ OK, passed 100 tests.
  7421. 838.86 s [vector] drop: OK
  7422. 838.86 s [vector] +++ OK, passed 100 tests.
  7423. 838.86 s [vector] splitAt: OK
  7424. 838.86 s [vector] +++ OK, passed 100 tests.
  7425. 838.86 s [vector] empty: OK
  7426. 838.86 s [vector] +++ OK, passed 1 test.
  7427. 838.86 s [vector] singleton: OK
  7428. 838.86 s [vector] +++ OK, passed 100 tests.
  7429. 838.86 s [vector] replicate: OK
  7430. 838.86 s [vector] +++ OK, passed 100 tests.
  7431. 838.86 s [vector] generate: OK
  7432. 838.86 s [vector] +++ OK, passed 100 tests.
  7433. 838.87 s [vector] iterateN: OK
  7434. 838.87 s [vector] +++ OK, passed 100 tests.
  7435. 838.95 s [vector] iterateNM: OK (0.07s)
  7436. 838.95 s [vector] +++ OK, passed 100 tests.
  7437. 838.97 s [vector] generateM: OK (0.03s)
  7438. 838.97 s [vector] +++ OK, passed 100 tests.
  7439. 838.98 s [vector] replicateM: OK
  7440. 838.98 s [vector] +++ OK, passed 100 tests.
  7441. 838.98 s [vector] create: OK
  7442. 838.98 s [vector] +++ OK, passed 100 tests.
  7443. 838.98 s [vector] createT: OK
  7444. 838.98 s [vector] +++ OK, passed 100 tests.
  7445. 838.98 s [vector] unfoldr: OK
  7446. 838.98 s [vector] +++ OK, passed 100 tests.
  7447. 838.98 s [vector] unfoldrN: OK
  7448. 838.98 s [vector] +++ OK, passed 100 tests.
  7449. 838.99 s [vector] unfoldrExactN: OK
  7450. 838.99 s [vector] +++ OK, passed 100 tests.
  7451. 838.99 s [vector] unfoldrM: OK
  7452. 838.99 s [vector] +++ OK, passed 100 tests.
  7453. 838.99 s [vector] unfoldrNM: OK
  7454. 839.02 s [vector] +++ OK, passed 100 tests.
  7455. 839.07 s [vector] unfoldrExactNM: OK (0.07s)
  7456. 839.07 s [vector] +++ OK, passed 100 tests.
  7457. 839.09 s [vector] constructN: OK (0.02s)
  7458. 839.09 s [vector] +++ OK, passed 100 tests.
  7459. 839.11 s [vector] constructrN: OK (0.02s)
  7460. 839.11 s [vector] +++ OK, passed 100 tests.
  7461. 839.11 s [vector] cons: OK
  7462. 839.11 s [vector] +++ OK, passed 100 tests.
  7463. 839.11 s [vector] snoc: OK
  7464. 839.11 s [vector] +++ OK, passed 100 tests.
  7465. 839.11 s [vector] append: OK
  7466. 839.11 s [vector] +++ OK, passed 100 tests.
  7467. 839.14 s [vector] concat: OK (0.03s)
  7468. 839.14 s [vector] +++ OK, passed 100 tests.
  7469. 839.14 s [vector] force: OK
  7470. 839.14 s [vector] +++ OK, passed 100 tests.
  7471. 839.15 s [vector] upd: OK
  7472. 839.15 s [vector] +++ OK, passed 100 tests.
  7473. 839.16 s [vector] accum: OK (0.02s)
  7474. 839.16 s [vector] +++ OK, passed 100 tests.
  7475. 839.16 s [vector] reverse: OK
  7476. 839.17 s [vector] +++ OK, passed 100 tests.
  7477. 839.17 s [vector] backpermute: OK
  7478. 839.17 s [vector] +++ OK, passed 100 tests.
  7479. 839.18 s [vector] map: OK
  7480. 839.18 s [vector] +++ OK, passed 100 tests.
  7481. 839.18 s [vector] imap: OK
  7482. 839.18 s [vector] +++ OK, passed 100 tests.
  7483. 839.20 s [vector] concatMap: OK (0.01s)
  7484. 839.20 s [vector] +++ OK, passed 100 tests.
  7485. 839.21 s [vector] mapM: OK (0.01s)
  7486. 839.21 s [vector] +++ OK, passed 100 tests.
  7487. 839.25 s [vector] mapM_: OK (0.04s)
  7488. 839.25 s [vector] +++ OK, passed 100 tests.
  7489. 839.25 s [vector] forM: OK
  7490. 839.25 s [vector] +++ OK, passed 100 tests.
  7491. 839.30 s [vector] forM_: OK (0.04s)
  7492. 839.56 s [vector] +++ OK, passed 100 tests.
  7493. 839.56 s [vector] imapM: OK (0.01s)
  7494. 839.56 s [vector] +++ OK, passed 100 tests.
  7495. 839.56 s [vector] imapM_: OK (0.05s)
  7496. 839.56 s [vector] +++ OK, passed 100 tests.
  7497. 839.56 s [vector] zipWith: OK (0.02s)
  7498. 839.56 s [vector] +++ OK, passed 100 tests.
  7499. 839.56 s [vector] zipWith3: OK (0.01s)
  7500. 839.56 s [vector] +++ OK, passed 100 tests.
  7501. 839.56 s [vector] izipWith: OK (0.01s)
  7502. 839.56 s [vector] +++ OK, passed 100 tests.
  7503. 839.56 s [vector] izipWith3: OK (0.01s)
  7504. 839.56 s [vector] +++ OK, passed 100 tests.
  7505. 839.56 s [vector] izipWithM: OK (0.01s)
  7506. 839.56 s [vector] +++ OK, passed 100 tests.
  7507. 839.56 s [vector] izipWithM_: OK (0.03s)
  7508. 839.56 s [vector] +++ OK, passed 100 tests.
  7509. 839.56 s [vector] zipWithM: OK (0.01s)
  7510. 839.56 s [vector] +++ OK, passed 100 tests.
  7511. 839.56 s [vector] zipWithM_: OK (0.04s)
  7512. 839.56 s [vector] +++ OK, passed 100 tests.
  7513. 839.56 s [vector] filter: OK
  7514. 839.56 s [vector] +++ OK, passed 100 tests.
  7515. 839.56 s [vector] ifilter: OK (0.01s)
  7516. 839.56 s [vector] +++ OK, passed 100 tests.
  7517. 839.59 s [vector] filterM: OK (0.05s)
  7518. 839.59 s [vector] +++ OK, passed 100 tests.
  7519. 839.59 s [vector] uniq: OK
  7520. 839.59 s [vector] +++ OK, passed 100 tests.
  7521. 839.61 s [vector] mapMaybe: OK (0.01s)
  7522. 839.61 s [vector] +++ OK, passed 100 tests.
  7523. 839.61 s [vector] imapMaybe: OK (0.01s)
  7524. 839.61 s [vector] +++ OK, passed 100 tests.
  7525. 839.62 s [vector] takeWhile: OK
  7526. 839.62 s [vector] +++ OK, passed 100 tests.
  7527. 839.62 s [vector] dropWhile: OK
  7528. 839.62 s [vector] +++ OK, passed 100 tests.
  7529. 839.62 s [vector] partition: OK
  7530. 839.63 s [vector] +++ OK, passed 100 tests.
  7531. 839.64 s [vector] partitionWith: OK
  7532. 839.64 s [vector] +++ OK, passed 100 tests.
  7533. 839.64 s [vector] span: OK
  7534. 839.64 s [vector] +++ OK, passed 100 tests.
  7535. 839.64 s [vector] break: OK
  7536. 839.64 s [vector] +++ OK, passed 100 tests.
  7537. 839.64 s [vector] spanR: OK
  7538. 839.64 s [vector] +++ OK, passed 100 tests.
  7539. 839.65 s [vector] breakR: OK
  7540. 839.65 s [vector] +++ OK, passed 100 tests.
  7541. 839.65 s [vector] groupBy: OK (0.01s)
  7542. 839.65 s [vector] +++ OK, passed 100 tests.
  7543. 839.65 s [vector] elem: OK
  7544. 839.66 s [vector] +++ OK, passed 100 tests.
  7545. 839.66 s [vector] notElem: OK
  7546. 839.66 s [vector] +++ OK, passed 100 tests.
  7547. 839.66 s [vector] find: OK
  7548. 839.66 s [vector] +++ OK, passed 100 tests.
  7549. 839.66 s [vector] findIndex: OK
  7550. 839.66 s [vector] +++ OK, passed 100 tests.
  7551. 839.68 s [vector] findIndexR: OK
  7552. 839.68 s [vector] +++ OK, passed 100 tests.
  7553. 839.68 s [vector] findIndices: OK (0.02s)
  7554. 839.68 s [vector] +++ OK, passed 100 tests.
  7555. 839.68 s [vector] elemIndex: OK
  7556. 839.68 s [vector] +++ OK, passed 100 tests.
  7557. 839.68 s [vector] elemIndices: OK
  7558. 839.69 s [vector] +++ OK, passed 100 tests.
  7559. 839.71 s [vector] foldl: OK (0.02s)
  7560. 839.71 s [vector] +++ OK, passed 100 tests.
  7561. 839.73 s [vector] foldl1: OK (0.02s)
  7562. 839.73 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7563. 839.75 s [vector] foldl': OK (0.02s)
  7564. 839.75 s [vector] +++ OK, passed 100 tests.
  7565. 839.75 s [vector] foldl1': OK (0.02s)
  7566. 839.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7567. 839.77 s [vector] foldr: OK (0.02s)
  7568. 839.77 s [vector] +++ OK, passed 100 tests.
  7569. 839.79 s [vector] foldr1: OK (0.01s)
  7570. 839.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7571. 839.81 s [vector] foldr': OK (0.02s)
  7572. 839.81 s [vector] +++ OK, passed 100 tests.
  7573. 839.83 s [vector] foldr1': OK (0.01s)
  7574. 839.83 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7575. 839.83 s [vector] ifoldl: OK (0.02s)
  7576. 839.83 s [vector] +++ OK, passed 100 tests.
  7577. 839.85 s [vector] ifoldl': OK (0.02s)
  7578. 839.85 s [vector] +++ OK, passed 100 tests.
  7579. 839.87 s [vector] ifoldr: OK (0.02s)
  7580. 839.87 s [vector] +++ OK, passed 100 tests.
  7581. 839.90 s [vector] ifoldr': OK (0.02s)
  7582. 839.90 s [vector] +++ OK, passed 100 tests.
  7583. 839.91 s [vector] ifoldM: OK (0.02s)
  7584. 839.91 s [vector] +++ OK, passed 100 tests.
  7585. 839.93 s [vector] ifoldM': OK (0.02s)
  7586. 839.93 s [vector] +++ OK, passed 100 tests.
  7587. 839.99 s [vector] ifoldM_: OK (0.05s)
  7588. 839.99 s [vector] +++ OK, passed 100 tests.
  7589. 840.03 s [vector] ifoldM'_: OK (0.05s)
  7590. 840.03 s [vector] +++ OK, passed 100 tests.
  7591. 840.03 s [vector] all: OK
  7592. 840.04 s [vector] +++ OK, passed 100 tests.
  7593. 840.04 s [vector] any: OK
  7594. 840.04 s [vector] +++ OK, passed 100 tests.
  7595. 840.06 s [vector] prescanl: OK (0.01s)
  7596. 840.06 s [vector] +++ OK, passed 100 tests.
  7597. 840.08 s [vector] prescanl': OK (0.02s)
  7598. 840.08 s [vector] +++ OK, passed 100 tests.
  7599. 840.10 s [vector] postscanl: OK (0.02s)
  7600. 840.10 s [vector] +++ OK, passed 100 tests.
  7601. 840.12 s [vector] postscanl': OK (0.01s)
  7602. 840.12 s [vector] +++ OK, passed 100 tests.
  7603. 840.12 s [vector] scanl: OK (0.02s)
  7604. 840.12 s [vector] +++ OK, passed 100 tests.
  7605. 840.14 s [vector] scanl': OK (0.02s)
  7606. 840.14 s [vector] +++ OK, passed 100 tests.
  7607. 840.16 s [vector] scanl1: OK (0.02s)
  7608. 840.16 s [vector] +++ OK, passed 100 tests.
  7609. 840.18 s [vector] scanl1': OK (0.02s)
  7610. 840.18 s [vector] +++ OK, passed 100 tests.
  7611. 840.20 s [vector] iscanl: OK (0.02s)
  7612. 840.20 s [vector] +++ OK, passed 100 tests.
  7613. 840.20 s [vector] iscanl': OK (0.02s)
  7614. 840.20 s [vector] +++ OK, passed 100 tests.
  7615. 840.22 s [vector] prescanr: OK (0.01s)
  7616. 840.22 s [vector] +++ OK, passed 100 tests.
  7617. 840.24 s [vector] prescanr': OK (0.01s)
  7618. 840.24 s [vector] +++ OK, passed 100 tests.
  7619. 840.24 s [vector] postscanr: OK (0.01s)
  7620. 840.24 s [vector] +++ OK, passed 100 tests.
  7621. 840.27 s [vector] postscanr': OK (0.01s)
  7622. 840.27 s [vector] +++ OK, passed 100 tests.
  7623. 840.28 s [vector] scanr: OK (0.01s)
  7624. 840.28 s [vector] +++ OK, passed 100 tests.
  7625. 840.28 s [vector] scanr': OK (0.01s)
  7626. 840.28 s [vector] +++ OK, passed 100 tests.
  7627. 840.29 s [vector] scanr1: OK (0.01s)
  7628. 840.29 s [vector] +++ OK, passed 100 tests.
  7629. 840.32 s [vector] scanr1': OK (0.01s)
  7630. 840.32 s [vector] +++ OK, passed 100 tests.
  7631. 840.34 s [vector] iscanr: OK (0.01s)
  7632. 840.34 s [vector] +++ OK, passed 100 tests.
  7633. 840.34 s [vector] iscanr': OK (0.01s)
  7634. 840.34 s [vector] +++ OK, passed 100 tests.
  7635. 840.34 s [vector] mut_read: OK
  7636. 840.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7637. 840.34 s [vector] mut_write: OK
  7638. 840.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7639. 840.34 s [vector] mut_modify: OK
  7640. 840.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7641. 840.34 s [vector] mut_generate: OK
  7642. 840.34 s [vector] +++ OK, passed 100 tests.
  7643. 840.36 s [vector] mut_generateM: OK (0.02s)
  7644. 840.36 s [vector] +++ OK, passed 100 tests.
  7645. 840.40 s [vector] mut_mapM_: OK (0.04s)
  7646. 840.40 s [vector] +++ OK, passed 100 tests.
  7647. 840.44 s [vector] mut_imapM_: OK (0.04s)
  7648. 840.44 s [vector] +++ OK, passed 100 tests.
  7649. 840.48 s [vector] mut_forM_: OK (0.04s)
  7650. 840.48 s [vector] +++ OK, passed 100 tests.
  7651. 840.52 s [vector] mut_iforM_: OK (0.04s)
  7652. 840.52 s [vector] +++ OK, passed 100 tests.
  7653. 840.54 s [vector] mut_foldr: OK (0.01s)
  7654. 840.54 s [vector] +++ OK, passed 100 tests.
  7655. 840.54 s [vector] mut_foldr': OK (0.02s)
  7656. 840.54 s [vector] +++ OK, passed 100 tests.
  7657. 840.56 s [vector] mut_foldl: OK (0.02s)
  7658. 840.56 s [vector] +++ OK, passed 100 tests.
  7659. 840.57 s [vector] mut_foldl': OK (0.02s)
  7660. 840.57 s [vector] +++ OK, passed 100 tests.
  7661. 840.60 s [vector] mut_ifoldr: OK (0.01s)
  7662. 840.60 s [vector] +++ OK, passed 100 tests.
  7663. 840.62 s [vector] mut_ifoldr': OK (0.02s)
  7664. 840.62 s [vector] +++ OK, passed 100 tests.
  7665. 840.64 s [vector] mut_ifoldl: OK (0.02s)
  7666. 840.64 s [vector] +++ OK, passed 100 tests.
  7667. 840.65 s [vector] mut_ifoldl': OK (0.02s)
  7668. 840.65 s [vector] +++ OK, passed 100 tests.
  7669. 840.67 s [vector] mut_foldM: OK
  7670. 840.68 s [vector] +++ OK, passed 100 tests.
  7671. 840.69 s [vector] mut_foldM': OK (0.02s)
  7672. 840.69 s [vector] +++ OK, passed 100 tests.
  7673. 840.70 s [vector] mut_foldrM: OK (0.02s)
  7674. 840.70 s [vector] +++ OK, passed 100 tests.
  7675. 840.72 s [vector] mut_foldrM': OK (0.02s)
  7676. 840.72 s [vector] +++ OK, passed 100 tests.
  7677. 840.74 s [vector] mut_ifoldM: OK (0.02s)
  7678. 840.74 s [vector] +++ OK, passed 100 tests.
  7679. 840.76 s [vector] mut_ifoldM': OK (0.02s)
  7680. 840.76 s [vector] +++ OK, passed 100 tests.
  7681. 840.78 s [vector] mut_ifoldrM: OK (0.02s)
  7682. 840.78 s [vector] +++ OK, passed 100 tests.
  7683. 840.78 s [vector] mut_ifoldrM': OK (0.02s)
  7684. 840.78 s [vector] +++ OK, passed 100 tests.
  7685. 840.79 s [vector] compare: OK
  7686. 840.79 s [vector] +++ OK, passed 100 tests.
  7687. 840.79 s [vector] maximum: OK
  7688. 840.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7689. 840.79 s [vector] minimum: OK
  7690. 840.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7691. 840.79 s [vector] minIndex: OK
  7692. 840.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7693. 840.79 s [vector] maxIndex: OK
  7694. 840.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7695. 840.79 s [vector] maximumBy: OK
  7696. 840.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7697. 840.79 s [vector] minimumBy: OK
  7698. 840.79 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7699. 840.79 s [vector] maximumOn: OK
  7700. 840.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7701. 840.79 s [vector] minimumOn: OK
  7702. 840.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7703. 840.80 s [vector] maxIndexBy: OK
  7704. 840.80 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7705. 840.80 s [vector] minIndexBy: OK
  7706. 840.80 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7707. 840.80 s [vector] ListFirstMaxIndexWins: OK
  7708. 840.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7709. 840.80 s [vector] FalseListFirstMaxIndexWins: OK
  7710. 840.80 s [vector] +++ OK, failed as expected. (after 1 test):
  7711. 840.80 s [vector] Exception:
  7712. 840.80 s [vector] Prelude.foldr1: empty list
  7713. 840.80 s [vector] CallStack (from HasCallStack):
  7714. 840.80 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  7715. 840.80 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  7716. 840.80 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7717. 840.80 s [vector] []
  7718. 840.80 s [vector] mempty: OK
  7719. 840.80 s [vector] +++ OK, passed 1 test.
  7720. 840.80 s [vector] mappend: OK
  7721. 840.80 s [vector] +++ OK, passed 100 tests.
  7722. 840.83 s [vector] mconcat: OK (0.02s)
  7723. 840.83 s [vector] +++ OK, passed 100 tests.
  7724. 840.83 s [vector] glength: OK
  7725. 840.83 s [vector] +++ OK, passed 100 tests.
  7726. 840.83 s [vector] sum: OK
  7727. 840.83 s [vector] +++ OK, passed 100 tests.
  7728. 840.83 s [vector] product: OK
  7729. 840.83 s [vector] +++ OK, passed 100 tests.
  7730. 840.83 s [vector] enumFromN: OK
  7731. 840.83 s [vector] +++ OK, passed 100 tests.
  7732. 840.83 s [vector] enumFromThenN: OK
  7733. 840.83 s [vector] +++ OK, passed 100 tests.
  7734. 840.83 s [vector] enumFromTo: OK
  7735. 840.83 s [vector] +++ OK, passed 100 tests.
  7736. 840.83 s [vector] enumFromThenTo: OK
  7737. 840.83 s [vector] +++ OK, passed 100 tests; 1 discarded.
  7738. 840.83 s [vector] unstream
  7739. 840.83 s [vector] unstream == vunstream (exact): OK
  7740. 840.83 s [vector] +++ OK, passed 100 tests.
  7741. 840.83 s [vector] unstream == vunstream (unknown): OK
  7742. 840.83 s [vector] +++ OK, passed 100 tests.
  7743. 840.83 s [vector] unstreamR ~= vunstream (exact): OK
  7744. 840.84 s [vector] +++ OK, passed 100 tests.
  7745. 840.84 s [vector] unstreamR ~= vunstream (unknown): OK
  7746. 840.84 s [vector] +++ OK, passed 100 tests.
  7747. 840.84 s [vector] Tests.Vector.Strict
  7748. 840.84 s [vector] Bool
  7749. 840.84 s [vector] fromList.toList == id: OK
  7750. 840.84 s [vector] +++ OK, passed 100 tests.
  7751. 840.84 s [vector] toList.fromList == id: OK
  7752. 840.84 s [vector] +++ OK, passed 100 tests.
  7753. 840.84 s [vector] unstream.stream == id: OK
  7754. 840.84 s [vector] +++ OK, passed 100 tests.
  7755. 840.84 s [vector] stream.unstream == id: OK
  7756. 840.84 s [vector] +++ OK, passed 100 tests.
  7757. 840.84 s [vector] eq: OK
  7758. 840.84 s [vector] +++ OK, passed 100 tests.
  7759. 840.84 s [vector] length: OK
  7760. 840.84 s [vector] +++ OK, passed 100 tests.
  7761. 840.84 s [vector] null: OK
  7762. 840.84 s [vector] +++ OK, passed 100 tests.
  7763. 840.84 s [vector] index: OK
  7764. 840.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7765. 840.84 s [vector] safeIndex: OK
  7766. 840.84 s [vector] +++ OK, passed 100 tests.
  7767. 840.84 s [vector] head: OK
  7768. 840.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7769. 840.84 s [vector] last: OK
  7770. 840.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7771. 840.84 s [vector] unsafeIndex: OK
  7772. 840.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7773. 840.84 s [vector] unsafeHead: OK
  7774. 840.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7775. 840.84 s [vector] unsafeLast: OK
  7776. 840.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7777. 840.84 s [vector] slice: OK
  7778. 840.84 s [vector] +++ OK, passed 100 tests.
  7779. 840.84 s [vector] init: OK
  7780. 840.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7781. 840.84 s [vector] tail: OK
  7782. 840.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7783. 840.85 s [vector] take: OK
  7784. 840.85 s [vector] +++ OK, passed 100 tests.
  7785. 840.85 s [vector] drop: OK
  7786. 840.85 s [vector] +++ OK, passed 100 tests.
  7787. 840.85 s [vector] splitAt: OK
  7788. 840.85 s [vector] +++ OK, passed 100 tests.
  7789. 840.85 s [vector] empty: OK
  7790. 840.85 s [vector] +++ OK, passed 1 test.
  7791. 840.85 s [vector] singleton: OK
  7792. 840.85 s [vector] +++ OK, passed 100 tests.
  7793. 840.85 s [vector] replicate: OK
  7794. 840.85 s [vector] +++ OK, passed 100 tests.
  7795. 840.85 s [vector] generate: OK
  7796. 840.85 s [vector] +++ OK, passed 100 tests.
  7797. 840.86 s [vector] iterateN: OK
  7798. 840.86 s [vector] +++ OK, passed 100 tests.
  7799. 840.90 s [vector] iterateNM: OK (0.04s)
  7800. 840.90 s [vector] +++ OK, passed 100 tests.
  7801. 840.90 s [vector] generateM: OK
  7802. 840.90 s [vector] +++ OK, passed 100 tests.
  7803. 840.92 s [vector] replicateM: OK (0.02s)
  7804. 840.92 s [vector] +++ OK, passed 100 tests.
  7805. 840.92 s [vector] create: OK
  7806. 840.92 s [vector] +++ OK, passed 100 tests.
  7807. 840.92 s [vector] createT: OK
  7808. 840.92 s [vector] +++ OK, passed 100 tests.
  7809. 840.92 s [vector] unfoldr: OK
  7810. 840.92 s [vector] +++ OK, passed 100 tests.
  7811. 840.92 s [vector] unfoldrN: OK
  7812. 840.92 s [vector] +++ OK, passed 100 tests.
  7813. 840.92 s [vector] unfoldrExactN: OK
  7814. 840.93 s [vector] +++ OK, passed 100 tests.
  7815. 840.93 s [vector] unfoldrM: OK
  7816. 840.93 s [vector] +++ OK, passed 100 tests.
  7817. 840.93 s [vector] unfoldrNM: OK
  7818. 840.94 s [vector] +++ OK, passed 100 tests.
  7819. 840.96 s [vector] unfoldrExactNM: OK (0.02s)
  7820. 840.96 s [vector] +++ OK, passed 100 tests.
  7821. 840.96 s [vector] constructN: OK
  7822. 840.96 s [vector] +++ OK, passed 100 tests.
  7823. 840.96 s [vector] constructrN: OK
  7824. 840.96 s [vector] +++ OK, passed 100 tests.
  7825. 840.96 s [vector] cons: OK
  7826. 840.96 s [vector] +++ OK, passed 100 tests.
  7827. 840.96 s [vector] snoc: OK
  7828. 840.96 s [vector] +++ OK, passed 100 tests.
  7829. 840.96 s [vector] append: OK
  7830. 840.96 s [vector] +++ OK, passed 100 tests.
  7831. 840.97 s [vector] concat: OK
  7832. 840.97 s [vector] +++ OK, passed 100 tests.
  7833. 840.97 s [vector] force: OK
  7834. 840.97 s [vector] +++ OK, passed 100 tests.
  7835. 840.98 s [vector] upd: OK
  7836. 840.98 s [vector] +++ OK, passed 100 tests.
  7837. 840.98 s [vector] accum: OK
  7838. 840.98 s [vector] +++ OK, passed 100 tests.
  7839. 840.98 s [vector] reverse: OK
  7840. 840.98 s [vector] +++ OK, passed 100 tests.
  7841. 840.99 s [vector] backpermute: OK
  7842. 840.99 s [vector] +++ OK, passed 100 tests.
  7843. 840.99 s [vector] map: OK (0.01s)
  7844. 840.99 s [vector] +++ OK, passed 100 tests.
  7845. 841.00 s [vector] imap: OK
  7846. 841.00 s [vector] +++ OK, passed 100 tests.
  7847. 841.00 s [vector] concatMap: OK
  7848. 841.00 s [vector] +++ OK, passed 100 tests.
  7849. 841.00 s [vector] mapM: OK
  7850. 841.00 s [vector] +++ OK, passed 100 tests.
  7851. 841.01 s [vector] mapM_: OK (0.01s)
  7852. 841.01 s [vector] +++ OK, passed 100 tests.
  7853. 841.02 s [vector] forM: OK
  7854. 841.02 s [vector] +++ OK, passed 100 tests.
  7855. 841.02 s [vector] forM_: OK (0.01s)
  7856. 841.02 s [vector] +++ OK, passed 100 tests.
  7857. 841.02 s [vector] imapM: OK
  7858. 841.04 s [vector] +++ OK, passed 100 tests.
  7859. 841.04 s [vector] imapM_: OK (0.01s)
  7860. 841.04 s [vector] +++ OK, passed 100 tests.
  7861. 841.04 s [vector] zipWith: OK
  7862. 841.04 s [vector] +++ OK, passed 100 tests.
  7863. 841.04 s [vector] zipWith3: OK
  7864. 841.04 s [vector] +++ OK, passed 100 tests.
  7865. 841.04 s [vector] izipWith: OK
  7866. 841.04 s [vector] +++ OK, passed 100 tests.
  7867. 841.05 s [vector] izipWith3: OK
  7868. 841.05 s [vector] +++ OK, passed 100 tests.
  7869. 841.05 s [vector] izipWithM: OK
  7870. 841.05 s [vector] +++ OK, passed 100 tests.
  7871. 841.06 s [vector] izipWithM_: OK
  7872. 841.06 s [vector] +++ OK, passed 100 tests.
  7873. 841.06 s [vector] zipWithM: OK
  7874. 841.06 s [vector] +++ OK, passed 100 tests.
  7875. 841.07 s [vector] zipWithM_: OK
  7876. 841.07 s [vector] +++ OK, passed 100 tests.
  7877. 841.07 s [vector] filter: OK
  7878. 841.07 s [vector] +++ OK, passed 100 tests.
  7879. 841.08 s [vector] ifilter: OK
  7880. 841.08 s [vector] +++ OK, passed 100 tests.
  7881. 841.09 s [vector] filterM: OK (0.02s)
  7882. 841.09 s [vector] +++ OK, passed 100 tests.
  7883. 841.09 s [vector] uniq: OK
  7884. 841.09 s [vector] +++ OK, passed 100 tests.
  7885. 841.09 s [vector] mapMaybe: OK
  7886. 841.09 s [vector] +++ OK, passed 100 tests.
  7887. 841.09 s [vector] imapMaybe: OK
  7888. 841.09 s [vector] +++ OK, passed 100 tests.
  7889. 841.09 s [vector] takeWhile: OK
  7890. 841.09 s [vector] +++ OK, passed 100 tests.
  7891. 841.09 s [vector] dropWhile: OK
  7892. 841.09 s [vector] +++ OK, passed 100 tests.
  7893. 841.10 s [vector] partition: OK
  7894. 841.10 s [vector] +++ OK, passed 100 tests.
  7895. 841.10 s [vector] partitionWith: OK
  7896. 841.10 s [vector] +++ OK, passed 100 tests.
  7897. 841.10 s [vector] span: OK
  7898. 841.10 s [vector] +++ OK, passed 100 tests.
  7899. 841.10 s [vector] break: OK
  7900. 841.10 s [vector] +++ OK, passed 100 tests.
  7901. 841.10 s [vector] spanR: OK
  7902. 841.10 s [vector] +++ OK, passed 100 tests.
  7903. 841.10 s [vector] breakR: OK
  7904. 841.10 s [vector] +++ OK, passed 100 tests.
  7905. 841.10 s [vector] groupBy: OK
  7906. 841.10 s [vector] +++ OK, passed 100 tests.
  7907. 841.10 s [vector] elem: OK
  7908. 841.10 s [vector] +++ OK, passed 100 tests.
  7909. 841.10 s [vector] notElem: OK
  7910. 841.10 s [vector] +++ OK, passed 100 tests.
  7911. 841.10 s [vector] find: OK
  7912. 841.10 s [vector] +++ OK, passed 100 tests.
  7913. 841.10 s [vector] findIndex: OK
  7914. 841.10 s [vector] +++ OK, passed 100 tests.
  7915. 841.10 s [vector] findIndexR: OK
  7916. 841.10 s [vector] +++ OK, passed 100 tests.
  7917. 841.10 s [vector] findIndices: OK
  7918. 841.10 s [vector] +++ OK, passed 100 tests.
  7919. 841.10 s [vector] elemIndex: OK
  7920. 841.10 s [vector] +++ OK, passed 100 tests.
  7921. 841.10 s [vector] elemIndices: OK
  7922. 841.10 s [vector] +++ OK, passed 100 tests.
  7923. 841.10 s [vector] foldl: OK
  7924. 841.11 s [vector] +++ OK, passed 100 tests.
  7925. 841.11 s [vector] foldl1: OK
  7926. 841.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7927. 841.11 s [vector] foldl': OK
  7928. 841.11 s [vector] +++ OK, passed 100 tests.
  7929. 841.11 s [vector] foldl1': OK
  7930. 841.11 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7931. 841.11 s [vector] foldr: OK
  7932. 841.11 s [vector] +++ OK, passed 100 tests.
  7933. 841.11 s [vector] foldr1: OK
  7934. 841.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7935. 841.11 s [vector] foldr': OK
  7936. 841.11 s [vector] +++ OK, passed 100 tests.
  7937. 841.12 s [vector] foldr1': OK
  7938. 841.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7939. 841.12 s [vector] ifoldl: OK
  7940. 841.12 s [vector] +++ OK, passed 100 tests.
  7941. 841.12 s [vector] ifoldl': OK
  7942. 841.12 s [vector] +++ OK, passed 100 tests.
  7943. 841.12 s [vector] ifoldr: OK
  7944. 841.12 s [vector] +++ OK, passed 100 tests.
  7945. 841.13 s [vector] ifoldr': OK
  7946. 841.13 s [vector] +++ OK, passed 100 tests.
  7947. 841.13 s [vector] ifoldM: OK
  7948. 841.13 s [vector] +++ OK, passed 100 tests.
  7949. 841.15 s [vector] ifoldM': OK
  7950. 841.15 s [vector] +++ OK, passed 100 tests.
  7951. 841.16 s [vector] ifoldM_: OK (0.01s)
  7952. 841.16 s [vector] +++ OK, passed 100 tests.
  7953. 841.16 s [vector] ifoldM'_: OK (0.02s)
  7954. 841.16 s [vector] +++ OK, passed 100 tests.
  7955. 841.16 s [vector] all: OK
  7956. 841.16 s [vector] +++ OK, passed 100 tests.
  7957. 841.16 s [vector] any: OK
  7958. 841.16 s [vector] +++ OK, passed 100 tests.
  7959. 841.16 s [vector] prescanl: OK
  7960. 841.16 s [vector] +++ OK, passed 100 tests.
  7961. 841.16 s [vector] prescanl': OK
  7962. 841.16 s [vector] +++ OK, passed 100 tests.
  7963. 841.16 s [vector] postscanl: OK
  7964. 841.16 s [vector] +++ OK, passed 100 tests.
  7965. 841.17 s [vector] postscanl': OK
  7966. 841.17 s [vector] +++ OK, passed 100 tests.
  7967. 841.17 s [vector] scanl: OK
  7968. 841.17 s [vector] +++ OK, passed 100 tests.
  7969. 841.17 s [vector] scanl': OK
  7970. 841.17 s [vector] +++ OK, passed 100 tests.
  7971. 841.17 s [vector] scanl1: OK
  7972. 841.17 s [vector] +++ OK, passed 100 tests.
  7973. 841.17 s [vector] scanl1': OK
  7974. 841.17 s [vector] +++ OK, passed 100 tests.
  7975. 841.18 s [vector] iscanl: OK
  7976. 841.18 s [vector] +++ OK, passed 100 tests.
  7977. 841.18 s [vector] iscanl': OK
  7978. 841.18 s [vector] +++ OK, passed 100 tests.
  7979. 841.18 s [vector] prescanr: OK
  7980. 841.18 s [vector] +++ OK, passed 100 tests.
  7981. 841.18 s [vector] prescanr': OK
  7982. 841.18 s [vector] +++ OK, passed 100 tests.
  7983. 841.18 s [vector] postscanr: OK
  7984. 841.19 s [vector] +++ OK, passed 100 tests.
  7985. 841.19 s [vector] postscanr': OK
  7986. 841.19 s [vector] +++ OK, passed 100 tests.
  7987. 841.19 s [vector] scanr: OK
  7988. 841.19 s [vector] +++ OK, passed 100 tests.
  7989. 841.19 s [vector] scanr': OK
  7990. 841.19 s [vector] +++ OK, passed 100 tests.
  7991. 841.19 s [vector] scanr1: OK
  7992. 841.19 s [vector] +++ OK, passed 100 tests.
  7993. 841.19 s [vector] scanr1': OK
  7994. 841.19 s [vector] +++ OK, passed 100 tests.
  7995. 841.19 s [vector] iscanr: OK
  7996. 841.20 s [vector] +++ OK, passed 100 tests.
  7997. 841.20 s [vector] iscanr': OK
  7998. 841.20 s [vector] +++ OK, passed 100 tests.
  7999. 841.20 s [vector] mut_read: OK
  8000. 841.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8001. 841.20 s [vector] mut_write: OK
  8002. 841.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8003. 841.20 s [vector] mut_modify: OK
  8004. 841.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8005. 841.20 s [vector] mut_generate: OK
  8006. 841.20 s [vector] +++ OK, passed 100 tests.
  8007. 841.21 s [vector] mut_generateM: OK
  8008. 841.22 s [vector] +++ OK, passed 100 tests.
  8009. 841.22 s [vector] mut_mapM_: OK (0.01s)
  8010. 841.22 s [vector] +++ OK, passed 100 tests.
  8011. 841.23 s [vector] mut_imapM_: OK (0.01s)
  8012. 841.23 s [vector] +++ OK, passed 100 tests.
  8013. 841.24 s [vector] mut_forM_: OK
  8014. 841.26 s [vector] +++ OK, passed 100 tests.
  8015. 841.26 s [vector] mut_iforM_: OK (0.01s)
  8016. 841.26 s [vector] +++ OK, passed 100 tests.
  8017. 841.26 s [vector] mut_foldr: OK
  8018. 841.26 s [vector] +++ OK, passed 100 tests.
  8019. 841.26 s [vector] mut_foldr': OK
  8020. 841.26 s [vector] +++ OK, passed 100 tests.
  8021. 841.26 s [vector] mut_foldl: OK
  8022. 841.26 s [vector] +++ OK, passed 100 tests.
  8023. 841.26 s [vector] mut_foldl': OK
  8024. 841.26 s [vector] +++ OK, passed 100 tests.
  8025. 841.26 s [vector] mut_ifoldr: OK
  8026. 841.26 s [vector] +++ OK, passed 100 tests.
  8027. 841.27 s [vector] mut_ifoldr': OK
  8028. 841.27 s [vector] +++ OK, passed 100 tests.
  8029. 841.27 s [vector] mut_ifoldl: OK
  8030. 841.27 s [vector] +++ OK, passed 100 tests.
  8031. 841.27 s [vector] mut_ifoldl': OK
  8032. 841.27 s [vector] +++ OK, passed 100 tests.
  8033. 841.27 s [vector] mut_foldM: OK
  8034. 841.27 s [vector] +++ OK, passed 100 tests.
  8035. 841.27 s [vector] mut_foldM': OK
  8036. 841.27 s [vector] +++ OK, passed 100 tests.
  8037. 841.28 s [vector] mut_foldrM: OK
  8038. 841.28 s [vector] +++ OK, passed 100 tests.
  8039. 841.28 s [vector] mut_foldrM': OK
  8040. 841.28 s [vector] +++ OK, passed 100 tests.
  8041. 841.28 s [vector] mut_ifoldM: OK
  8042. 841.28 s [vector] +++ OK, passed 100 tests.
  8043. 841.28 s [vector] mut_ifoldM': OK
  8044. 841.28 s [vector] +++ OK, passed 100 tests.
  8045. 841.28 s [vector] mut_ifoldrM: OK
  8046. 841.29 s [vector] +++ OK, passed 100 tests.
  8047. 841.29 s [vector] mut_ifoldrM': OK
  8048. 841.29 s [vector] +++ OK, passed 100 tests.
  8049. 841.29 s [vector] compare: OK
  8050. 841.29 s [vector] +++ OK, passed 100 tests.
  8051. 841.29 s [vector] maximum: OK
  8052. 841.29 s [vector] +++ OK, passed 100 tests; 26 discarded.
  8053. 841.29 s [vector] minimum: OK
  8054. 841.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8055. 841.29 s [vector] minIndex: OK
  8056. 841.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8057. 841.29 s [vector] maxIndex: OK
  8058. 841.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8059. 841.29 s [vector] maximumBy: OK
  8060. 841.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8061. 841.29 s [vector] minimumBy: OK
  8062. 841.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8063. 841.29 s [vector] maximumOn: OK
  8064. 841.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8065. 841.29 s [vector] minimumOn: OK
  8066. 841.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8067. 841.29 s [vector] maxIndexBy: OK
  8068. 841.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8069. 841.29 s [vector] minIndexBy: OK
  8070. 841.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8071. 841.29 s [vector] ListFirstMaxIndexWins: OK
  8072. 841.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8073. 841.30 s [vector] FalseListFirstMaxIndexWins: OK
  8074. 841.30 s [vector] +++ OK, failed as expected. (after 1 test):
  8075. 841.30 s [vector] Exception:
  8076. 841.30 s [vector] Prelude.foldr1: empty list
  8077. 841.30 s [vector] CallStack (from HasCallStack):
  8078. 841.30 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  8079. 841.30 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  8080. 841.30 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8081. 841.30 s [vector] []
  8082. 841.30 s [vector] zip: OK
  8083. 841.30 s [vector] +++ OK, passed 100 tests.
  8084. 841.30 s [vector] zip3: OK
  8085. 841.30 s [vector] +++ OK, passed 100 tests.
  8086. 841.30 s [vector] unzip: OK
  8087. 841.30 s [vector] +++ OK, passed 100 tests.
  8088. 841.30 s [vector] unzip3: OK
  8089. 841.30 s [vector] +++ OK, passed 100 tests.
  8090. 841.30 s [vector] indexed: OK
  8091. 841.30 s [vector] +++ OK, passed 100 tests.
  8092. 841.30 s [vector] update: OK
  8093. 841.30 s [vector] +++ OK, passed 100 tests.
  8094. 841.32 s [vector] concat: OK (0.01s)
  8095. 841.32 s [vector] +++ OK, passed 100 tests.
  8096. 841.32 s [vector] mempty: OK
  8097. 841.32 s [vector] +++ OK, passed 1 test.
  8098. 841.32 s [vector] mappend: OK
  8099. 841.32 s [vector] +++ OK, passed 100 tests.
  8100. 841.34 s [vector] mconcat: OK (0.02s)
  8101. 841.34 s [vector] +++ OK, passed 100 tests.
  8102. 841.34 s [vector] fmap: OK
  8103. 841.34 s [vector] +++ OK, passed 100 tests.
  8104. 841.34 s [vector] return: OK
  8105. 841.34 s [vector] +++ OK, passed 100 tests.
  8106. 841.36 s [vector] bind: OK (0.02s)
  8107. 841.36 s [vector] +++ OK, passed 100 tests.
  8108. 841.36 s [vector] mzip: OK
  8109. 841.36 s [vector] +++ OK, passed 100 tests.
  8110. 841.36 s [vector] munzip: OK
  8111. 841.36 s [vector] +++ OK, passed 100 tests.
  8112. 841.38 s [vector] applicative_pure: OK
  8113. 841.38 s [vector] +++ OK, passed 100 tests.
  8114. 841.39 s [vector] applicative_appl: OK (0.02s)
  8115. 841.39 s [vector] +++ OK, passed 100 tests.
  8116. 841.39 s [vector] alternative_empty: OK
  8117. 841.39 s [vector] +++ OK, passed 1 test.
  8118. 841.40 s [vector] alternative_or: OK
  8119. 841.40 s [vector] +++ OK, passed 100 tests.
  8120. 841.44 s [vector] sequence: OK (0.05s)
  8121. 841.44 s [vector] +++ OK, passed 100 tests.
  8122. 841.45 s [vector] sequence_: OK (0.01s)
  8123. 841.45 s [vector] +++ OK, passed 100 tests.
  8124. 841.45 s [vector] glength: OK
  8125. 841.45 s [vector] +++ OK, passed 100 tests.
  8126. 841.45 s [vector] and: OK
  8127. 841.45 s [vector] +++ OK, passed 100 tests.
  8128. 841.45 s [vector] or: OK
  8129. 841.45 s [vector] +++ OK, passed 100 tests.
  8130. 841.45 s [vector] Int
  8131. 841.45 s [vector] fromList.toList == id: OK
  8132. 841.45 s [vector] +++ OK, passed 100 tests.
  8133. 841.45 s [vector] toList.fromList == id: OK
  8134. 841.45 s [vector] +++ OK, passed 100 tests.
  8135. 841.45 s [vector] unstream.stream == id: OK
  8136. 841.45 s [vector] +++ OK, passed 100 tests.
  8137. 841.45 s [vector] stream.unstream == id: OK
  8138. 841.45 s [vector] +++ OK, passed 100 tests.
  8139. 841.45 s [vector] eq: OK
  8140. 841.45 s [vector] +++ OK, passed 100 tests.
  8141. 841.45 s [vector] length: OK
  8142. 841.45 s [vector] +++ OK, passed 100 tests.
  8143. 841.45 s [vector] null: OK
  8144. 841.45 s [vector] +++ OK, passed 100 tests.
  8145. 841.45 s [vector] index: OK
  8146. 841.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8147. 841.45 s [vector] safeIndex: OK
  8148. 841.45 s [vector] +++ OK, passed 100 tests.
  8149. 841.45 s [vector] head: OK
  8150. 841.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8151. 841.46 s [vector] last: OK
  8152. 841.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8153. 841.46 s [vector] unsafeIndex: OK
  8154. 841.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8155. 841.46 s [vector] unsafeHead: OK
  8156. 841.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8157. 841.46 s [vector] unsafeLast: OK
  8158. 841.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8159. 841.46 s [vector] slice: OK
  8160. 841.46 s [vector] +++ OK, passed 100 tests.
  8161. 841.46 s [vector] init: OK
  8162. 841.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8163. 841.46 s [vector] tail: OK
  8164. 841.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8165. 841.46 s [vector] take: OK
  8166. 841.46 s [vector] +++ OK, passed 100 tests.
  8167. 841.46 s [vector] drop: OK
  8168. 841.46 s [vector] +++ OK, passed 100 tests.
  8169. 841.46 s [vector] splitAt: OK
  8170. 841.46 s [vector] +++ OK, passed 100 tests.
  8171. 841.46 s [vector] empty: OK
  8172. 841.46 s [vector] +++ OK, passed 1 test.
  8173. 841.46 s [vector] singleton: OK
  8174. 841.46 s [vector] +++ OK, passed 100 tests.
  8175. 841.46 s [vector] replicate: OK
  8176. 841.46 s [vector] +++ OK, passed 100 tests.
  8177. 841.46 s [vector] generate: OK
  8178. 841.46 s [vector] +++ OK, passed 100 tests.
  8179. 841.46 s [vector] iterateN: OK
  8180. 841.46 s [vector] +++ OK, passed 100 tests.
  8181. 841.54 s [vector] iterateNM: OK (0.07s)
  8182. 841.54 s [vector] +++ OK, passed 100 tests.
  8183. 841.56 s [vector] generateM: OK (0.03s)
  8184. 841.56 s [vector] +++ OK, passed 100 tests.
  8185. 841.57 s [vector] replicateM: OK (0.02s)
  8186. 841.57 s [vector] +++ OK, passed 100 tests.
  8187. 841.57 s [vector] create: OK
  8188. 841.57 s [vector] +++ OK, passed 100 tests.
  8189. 841.57 s [vector] createT: OK
  8190. 841.57 s [vector] +++ OK, passed 100 tests.
  8191. 841.57 s [vector] unfoldr: OK
  8192. 841.57 s [vector] +++ OK, passed 100 tests.
  8193. 841.58 s [vector] unfoldrN: OK
  8194. 841.58 s [vector] +++ OK, passed 100 tests.
  8195. 841.58 s [vector] unfoldrExactN: OK
  8196. 841.58 s [vector] +++ OK, passed 100 tests.
  8197. 841.58 s [vector] unfoldrM: OK
  8198. 841.58 s [vector] +++ OK, passed 100 tests.
  8199. 841.60 s [vector] unfoldrNM: OK
  8200. 841.60 s [vector] +++ OK, passed 100 tests.
  8201. 841.61 s [vector] unfoldrExactNM: OK (0.02s)
  8202. 841.61 s [vector] +++ OK, passed 100 tests.
  8203. 841.61 s [vector] constructN: OK
  8204. 841.61 s [vector] +++ OK, passed 100 tests.
  8205. 841.61 s [vector] constructrN: OK
  8206. 841.61 s [vector] +++ OK, passed 100 tests.
  8207. 841.62 s [vector] cons: OK
  8208. 841.62 s [vector] +++ OK, passed 100 tests.
  8209. 841.62 s [vector] snoc: OK
  8210. 841.63 s [vector] +++ OK, passed 100 tests.
  8211. 841.63 s [vector] append: OK
  8212. 841.63 s [vector] +++ OK, passed 100 tests.
  8213. 841.63 s [vector] concat: OK (0.01s)
  8214. 841.63 s [vector] +++ OK, passed 100 tests.
  8215. 841.63 s [vector] force: OK
  8216. 841.63 s [vector] +++ OK, passed 100 tests.
  8217. 841.63 s [vector] upd: OK
  8218. 841.63 s [vector] +++ OK, passed 100 tests.
  8219. 841.63 s [vector] accum: OK
  8220. 841.63 s [vector] +++ OK, passed 100 tests.
  8221. 841.64 s [vector] reverse: OK
  8222. 841.64 s [vector] +++ OK, passed 100 tests.
  8223. 841.64 s [vector] backpermute: OK
  8224. 841.64 s [vector] +++ OK, passed 100 tests.
  8225. 841.64 s [vector] map: OK
  8226. 841.64 s [vector] +++ OK, passed 100 tests.
  8227. 841.64 s [vector] imap: OK
  8228. 841.64 s [vector] +++ OK, passed 100 tests.
  8229. 841.65 s [vector] concatMap: OK
  8230. 841.66 s [vector] +++ OK, passed 100 tests.
  8231. 841.66 s [vector] mapM: OK
  8232. 841.66 s [vector] +++ OK, passed 100 tests.
  8233. 841.68 s [vector] mapM_: OK (0.02s)
  8234. 841.68 s [vector] +++ OK, passed 100 tests.
  8235. 841.68 s [vector] forM: OK
  8236. 841.68 s [vector] +++ OK, passed 100 tests.
  8237. 841.72 s [vector] forM_: OK (0.03s)
  8238. 841.72 s [vector] +++ OK, passed 100 tests.
  8239. 841.72 s [vector] imapM: OK (0.01s)
  8240. 841.72 s [vector] +++ OK, passed 100 tests.
  8241. 841.76 s [vector] imapM_: OK (0.04s)
  8242. 841.76 s [vector] +++ OK, passed 100 tests.
  8243. 841.77 s [vector] zipWith: OK
  8244. 841.78 s [vector] +++ OK, passed 100 tests.
  8245. 841.78 s [vector] zipWith3: OK
  8246. 841.78 s [vector] +++ OK, passed 100 tests.
  8247. 841.78 s [vector] izipWith: OK
  8248. 841.78 s [vector] +++ OK, passed 100 tests.
  8249. 841.78 s [vector] izipWith3: OK
  8250. 841.78 s [vector] +++ OK, passed 100 tests.
  8251. 841.80 s [vector] izipWithM: OK
  8252. 841.80 s [vector] +++ OK, passed 100 tests.
  8253. 841.80 s [vector] izipWithM_: OK (0.01s)
  8254. 841.80 s [vector] +++ OK, passed 100 tests.
  8255. 841.80 s [vector] zipWithM: OK
  8256. 841.80 s [vector] +++ OK, passed 100 tests.
  8257. 841.82 s [vector] zipWithM_: OK (0.01s)
  8258. 841.82 s [vector] +++ OK, passed 100 tests.
  8259. 841.82 s [vector] filter: OK
  8260. 841.82 s [vector] +++ OK, passed 100 tests.
  8261. 841.82 s [vector] ifilter: OK
  8262. 841.82 s [vector] +++ OK, passed 100 tests.
  8263. 841.84 s [vector] filterM: OK (0.02s)
  8264. 841.85 s [vector] +++ OK, passed 100 tests.
  8265. 841.85 s [vector] uniq: OK
  8266. 841.85 s [vector] +++ OK, passed 100 tests.
  8267. 841.85 s [vector] mapMaybe: OK
  8268. 841.85 s [vector] +++ OK, passed 100 tests.
  8269. 841.85 s [vector] imapMaybe: OK
  8270. 841.85 s [vector] +++ OK, passed 100 tests.
  8271. 841.85 s [vector] takeWhile: OK
  8272. 841.85 s [vector] +++ OK, passed 100 tests.
  8273. 841.85 s [vector] dropWhile: OK
  8274. 841.85 s [vector] +++ OK, passed 100 tests.
  8275. 841.85 s [vector] partition: OK
  8276. 841.85 s [vector] +++ OK, passed 100 tests.
  8277. 841.85 s [vector] partitionWith: OK
  8278. 841.86 s [vector] +++ OK, passed 100 tests.
  8279. 841.86 s [vector] span: OK
  8280. 841.86 s [vector] +++ OK, passed 100 tests.
  8281. 841.86 s [vector] break: OK
  8282. 841.86 s [vector] +++ OK, passed 100 tests.
  8283. 841.86 s [vector] spanR: OK
  8284. 841.86 s [vector] +++ OK, passed 100 tests.
  8285. 841.86 s [vector] breakR: OK
  8286. 841.86 s [vector] +++ OK, passed 100 tests.
  8287. 841.86 s [vector] groupBy: OK
  8288. 841.86 s [vector] +++ OK, passed 100 tests.
  8289. 841.86 s [vector] elem: OK
  8290. 841.86 s [vector] +++ OK, passed 100 tests.
  8291. 841.86 s [vector] notElem: OK
  8292. 841.86 s [vector] +++ OK, passed 100 tests.
  8293. 841.86 s [vector] find: OK
  8294. 841.86 s [vector] +++ OK, passed 100 tests.
  8295. 841.86 s [vector] findIndex: OK
  8296. 841.86 s [vector] +++ OK, passed 100 tests.
  8297. 841.87 s [vector] findIndexR: OK
  8298. 841.87 s [vector] +++ OK, passed 100 tests.
  8299. 841.87 s [vector] findIndices: OK
  8300. 841.87 s [vector] +++ OK, passed 100 tests.
  8301. 841.87 s [vector] elemIndex: OK
  8302. 841.87 s [vector] +++ OK, passed 100 tests.
  8303. 841.87 s [vector] elemIndices: OK
  8304. 841.88 s [vector] +++ OK, passed 100 tests.
  8305. 841.88 s [vector] foldl: OK
  8306. 841.88 s [vector] +++ OK, passed 100 tests.
  8307. 841.88 s [vector] foldl1: OK
  8308. 841.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8309. 841.88 s [vector] foldl': OK
  8310. 841.88 s [vector] +++ OK, passed 100 tests.
  8311. 841.88 s [vector] foldl1': OK
  8312. 841.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8313. 841.88 s [vector] foldr: OK
  8314. 841.89 s [vector] +++ OK, passed 100 tests.
  8315. 841.89 s [vector] foldr1: OK
  8316. 841.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8317. 841.90 s [vector] foldr': OK
  8318. 841.90 s [vector] +++ OK, passed 100 tests.
  8319. 841.91 s [vector] foldr1': OK
  8320. 841.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8321. 841.91 s [vector] ifoldl: OK
  8322. 841.91 s [vector] +++ OK, passed 100 tests.
  8323. 841.92 s [vector] ifoldl': OK
  8324. 841.92 s [vector] +++ OK, passed 100 tests.
  8325. 841.93 s [vector] ifoldr: OK
  8326. 841.93 s [vector] +++ OK, passed 100 tests.
  8327. 841.93 s [vector] ifoldr': OK
  8328. 841.93 s [vector] +++ OK, passed 100 tests.
  8329. 841.93 s [vector] ifoldM: OK
  8330. 841.93 s [vector] +++ OK, passed 100 tests.
  8331. 841.94 s [vector] ifoldM': OK
  8332. 841.94 s [vector] +++ OK, passed 100 tests.
  8333. 841.97 s [vector] ifoldM_: OK (0.02s)
  8334. 841.97 s [vector] +++ OK, passed 100 tests.
  8335. 841.99 s [vector] ifoldM'_: OK (0.04s)
  8336. 841.99 s [vector] +++ OK, passed 100 tests.
  8337. 841.99 s [vector] all: OK
  8338. 841.99 s [vector] +++ OK, passed 100 tests.
  8339. 841.99 s [vector] any: OK
  8340. 841.99 s [vector] +++ OK, passed 100 tests.
  8341. 842.00 s [vector] prescanl: OK
  8342. 842.00 s [vector] +++ OK, passed 100 tests.
  8343. 842.00 s [vector] prescanl': OK
  8344. 842.00 s [vector] +++ OK, passed 100 tests.
  8345. 842.00 s [vector] postscanl: OK
  8346. 842.00 s [vector] +++ OK, passed 100 tests.
  8347. 842.01 s [vector] postscanl': OK
  8348. 842.01 s [vector] +++ OK, passed 100 tests.
  8349. 842.01 s [vector] scanl: OK
  8350. 842.01 s [vector] +++ OK, passed 100 tests.
  8351. 842.01 s [vector] scanl': OK
  8352. 842.01 s [vector] +++ OK, passed 100 tests.
  8353. 842.01 s [vector] scanl1: OK
  8354. 842.01 s [vector] +++ OK, passed 100 tests.
  8355. 842.01 s [vector] scanl1': OK
  8356. 842.01 s [vector] +++ OK, passed 100 tests.
  8357. 842.02 s [vector] iscanl: OK
  8358. 842.02 s [vector] +++ OK, passed 100 tests.
  8359. 842.02 s [vector] iscanl': OK
  8360. 842.02 s [vector] +++ OK, passed 100 tests.
  8361. 842.03 s [vector] prescanr: OK
  8362. 842.03 s [vector] +++ OK, passed 100 tests.
  8363. 842.03 s [vector] prescanr': OK
  8364. 842.03 s [vector] +++ OK, passed 100 tests.
  8365. 842.03 s [vector] postscanr: OK
  8366. 842.04 s [vector] +++ OK, passed 100 tests.
  8367. 842.04 s [vector] postscanr': OK
  8368. 842.04 s [vector] +++ OK, passed 100 tests.
  8369. 842.04 s [vector] scanr: OK
  8370. 842.04 s [vector] +++ OK, passed 100 tests.
  8371. 842.04 s [vector] scanr': OK
  8372. 842.04 s [vector] +++ OK, passed 100 tests.
  8373. 842.05 s [vector] scanr1: OK
  8374. 842.05 s [vector] +++ OK, passed 100 tests.
  8375. 842.05 s [vector] scanr1': OK
  8376. 842.05 s [vector] +++ OK, passed 100 tests.
  8377. 842.05 s [vector] iscanr: OK
  8378. 842.05 s [vector] +++ OK, passed 100 tests.
  8379. 842.05 s [vector] iscanr': OK
  8380. 842.05 s [vector] +++ OK, passed 100 tests.
  8381. 842.05 s [vector] mut_read: OK
  8382. 842.05 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8383. 842.06 s [vector] mut_write: OK
  8384. 842.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8385. 842.06 s [vector] mut_modify: OK
  8386. 842.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8387. 842.06 s [vector] mut_generate: OK
  8388. 842.06 s [vector] +++ OK, passed 100 tests.
  8389. 842.07 s [vector] mut_generateM: OK
  8390. 842.08 s [vector] +++ OK, passed 100 tests.
  8391. 842.08 s [vector] mut_mapM_: OK (0.02s)
  8392. 842.08 s [vector] +++ OK, passed 100 tests.
  8393. 842.10 s [vector] mut_imapM_: OK (0.02s)
  8394. 842.10 s [vector] +++ OK, passed 100 tests.
  8395. 842.12 s [vector] mut_forM_: OK (0.02s)
  8396. 842.12 s [vector] +++ OK, passed 100 tests.
  8397. 842.14 s [vector] mut_iforM_: OK (0.02s)
  8398. 842.14 s [vector] +++ OK, passed 100 tests.
  8399. 842.14 s [vector] mut_foldr: OK
  8400. 842.14 s [vector] +++ OK, passed 100 tests.
  8401. 842.14 s [vector] mut_foldr': OK
  8402. 842.14 s [vector] +++ OK, passed 100 tests.
  8403. 842.15 s [vector] mut_foldl: OK
  8404. 842.15 s [vector] +++ OK, passed 100 tests.
  8405. 842.15 s [vector] mut_foldl': OK
  8406. 842.15 s [vector] +++ OK, passed 100 tests.
  8407. 842.15 s [vector] mut_ifoldr: OK
  8408. 842.15 s [vector] +++ OK, passed 100 tests.
  8409. 842.15 s [vector] mut_ifoldr': OK
  8410. 842.15 s [vector] +++ OK, passed 100 tests.
  8411. 842.16 s [vector] mut_ifoldl: OK
  8412. 842.16 s [vector] +++ OK, passed 100 tests.
  8413. 842.16 s [vector] mut_ifoldl': OK
  8414. 842.16 s [vector] +++ OK, passed 100 tests.
  8415. 842.17 s [vector] mut_foldM: OK
  8416. 842.17 s [vector] +++ OK, passed 100 tests.
  8417. 842.18 s [vector] mut_foldM': OK
  8418. 842.18 s [vector] +++ OK, passed 100 tests.
  8419. 842.18 s [vector] mut_foldrM: OK
  8420. 842.18 s [vector] +++ OK, passed 100 tests.
  8421. 842.19 s [vector] mut_foldrM': OK
  8422. 842.19 s [vector] +++ OK, passed 100 tests.
  8423. 842.20 s [vector] mut_ifoldM: OK
  8424. 842.20 s [vector] +++ OK, passed 100 tests.
  8425. 842.20 s [vector] mut_ifoldM': OK
  8426. 842.20 s [vector] +++ OK, passed 100 tests.
  8427. 842.20 s [vector] mut_ifoldrM: OK
  8428. 842.20 s [vector] +++ OK, passed 100 tests.
  8429. 842.20 s [vector] mut_ifoldrM': OK
  8430. 842.20 s [vector] +++ OK, passed 100 tests.
  8431. 842.20 s [vector] compare: OK
  8432. 842.20 s [vector] +++ OK, passed 100 tests.
  8433. 842.20 s [vector] maximum: OK
  8434. 842.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8435. 842.20 s [vector] minimum: OK
  8436. 842.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8437. 842.21 s [vector] minIndex: OK
  8438. 842.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8439. 842.21 s [vector] maxIndex: OK
  8440. 842.21 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8441. 842.21 s [vector] maximumBy: OK
  8442. 842.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8443. 842.21 s [vector] minimumBy: OK
  8444. 842.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8445. 842.21 s [vector] maximumOn: OK
  8446. 842.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8447. 842.21 s [vector] minimumOn: OK
  8448. 842.21 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8449. 842.21 s [vector] maxIndexBy: OK
  8450. 842.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8451. 842.21 s [vector] minIndexBy: OK
  8452. 842.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8453. 842.21 s [vector] ListFirstMaxIndexWins: OK
  8454. 842.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8455. 842.21 s [vector] FalseListFirstMaxIndexWins: OK
  8456. 842.21 s [vector] +++ OK, failed as expected. (after 1 test):
  8457. 842.21 s [vector] Exception:
  8458. 842.21 s [vector] Prelude.foldr1: empty list
  8459. 842.21 s [vector] CallStack (from HasCallStack):
  8460. 842.21 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  8461. 842.21 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  8462. 842.21 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8463. 842.21 s [vector] []
  8464. 842.21 s [vector] zip: OK
  8465. 842.21 s [vector] +++ OK, passed 100 tests.
  8466. 842.21 s [vector] zip3: OK
  8467. 842.21 s [vector] +++ OK, passed 100 tests.
  8468. 842.22 s [vector] unzip: OK
  8469. 842.22 s [vector] +++ OK, passed 100 tests.
  8470. 842.22 s [vector] unzip3: OK
  8471. 842.22 s [vector] +++ OK, passed 100 tests.
  8472. 842.22 s [vector] indexed: OK
  8473. 842.22 s [vector] +++ OK, passed 100 tests.
  8474. 842.22 s [vector] update: OK
  8475. 842.22 s [vector] +++ OK, passed 100 tests.
  8476. 842.23 s [vector] concat: OK (0.01s)
  8477. 842.23 s [vector] +++ OK, passed 100 tests.
  8478. 842.23 s [vector] mempty: OK
  8479. 842.23 s [vector] +++ OK, passed 1 test.
  8480. 842.23 s [vector] mappend: OK
  8481. 842.24 s [vector] +++ OK, passed 100 tests.
  8482. 842.25 s [vector] mconcat: OK (0.01s)
  8483. 842.25 s [vector] +++ OK, passed 100 tests.
  8484. 842.25 s [vector] fmap: OK
  8485. 842.25 s [vector] +++ OK, passed 100 tests.
  8486. 842.25 s [vector] return: OK
  8487. 842.25 s [vector] +++ OK, passed 100 tests.
  8488. 842.27 s [vector] bind: OK (0.02s)
  8489. 842.27 s [vector] +++ OK, passed 100 tests.
  8490. 842.27 s [vector] mzip: OK
  8491. 842.27 s [vector] +++ OK, passed 100 tests.
  8492. 842.27 s [vector] munzip: OK
  8493. 842.27 s [vector] +++ OK, passed 100 tests.
  8494. 842.27 s [vector] applicative_pure: OK
  8495. 842.28 s [vector] +++ OK, passed 100 tests.
  8496. 842.30 s [vector] applicative_appl: OK (0.03s)
  8497. 842.30 s [vector] +++ OK, passed 100 tests.
  8498. 842.30 s [vector] alternative_empty: OK
  8499. 842.30 s [vector] +++ OK, passed 1 test.
  8500. 842.30 s [vector] alternative_or: OK
  8501. 842.30 s [vector] +++ OK, passed 100 tests.
  8502. 842.34 s [vector] sequence: OK (0.03s)
  8503. 842.34 s [vector] +++ OK, passed 100 tests.
  8504. 842.36 s [vector] sequence_: OK (0.02s)
  8505. 842.36 s [vector] +++ OK, passed 100 tests.
  8506. 842.36 s [vector] glength: OK
  8507. 842.36 s [vector] +++ OK, passed 100 tests.
  8508. 842.36 s [vector] sum: OK
  8509. 842.36 s [vector] +++ OK, passed 100 tests.
  8510. 842.36 s [vector] product: OK
  8511. 842.36 s [vector] +++ OK, passed 100 tests.
  8512. 842.36 s [vector] enumFromN: OK
  8513. 842.36 s [vector] +++ OK, passed 100 tests.
  8514. 842.36 s [vector] enumFromThenN: OK
  8515. 842.36 s [vector] +++ OK, passed 100 tests.
  8516. 842.36 s [vector] enumFromTo: OK
  8517. 842.36 s [vector] +++ OK, passed 100 tests.
  8518. 842.36 s [vector] enumFromThenTo: OK
  8519. 842.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8520. 842.36 s [vector] unstream
  8521. 842.36 s [vector] unstream == vunstream (exact): OK
  8522. 842.36 s [vector] +++ OK, passed 100 tests.
  8523. 842.37 s [vector] unstream == vunstream (unknown): OK
  8524. 842.37 s [vector] +++ OK, passed 100 tests.
  8525. 842.37 s [vector] unstreamR ~= vunstream (exact): OK
  8526. 842.37 s [vector] +++ OK, passed 100 tests.
  8527. 842.37 s [vector] unstreamR ~= vunstream (unknown): OK
  8528. 842.37 s [vector] +++ OK, passed 100 tests.
  8529. 842.37 s [vector] Tests.Vector.Unboxed
  8530. 842.37 s [vector] ()
  8531. 842.37 s [vector] fromList.toList == id: OK
  8532. 842.37 s [vector] +++ OK, passed 100 tests.
  8533. 842.37 s [vector] toList.fromList == id: OK
  8534. 842.37 s [vector] +++ OK, passed 100 tests.
  8535. 842.37 s [vector] unstream.stream == id: OK
  8536. 842.37 s [vector] +++ OK, passed 100 tests.
  8537. 842.37 s [vector] stream.unstream == id: OK
  8538. 842.37 s [vector] +++ OK, passed 100 tests.
  8539. 842.37 s [vector] eq: OK
  8540. 842.37 s [vector] +++ OK, passed 100 tests.
  8541. 842.37 s [vector] length: OK
  8542. 842.37 s [vector] +++ OK, passed 100 tests.
  8543. 842.37 s [vector] null: OK
  8544. 842.37 s [vector] +++ OK, passed 100 tests.
  8545. 842.37 s [vector] index: OK
  8546. 842.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8547. 842.37 s [vector] safeIndex: OK
  8548. 842.37 s [vector] +++ OK, passed 100 tests.
  8549. 842.37 s [vector] head: OK
  8550. 842.37 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8551. 842.37 s [vector] last: OK
  8552. 842.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8553. 842.37 s [vector] unsafeIndex: OK
  8554. 842.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8555. 842.37 s [vector] unsafeHead: OK
  8556. 842.37 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8557. 842.37 s [vector] unsafeLast: OK
  8558. 842.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8559. 842.37 s [vector] slice: OK
  8560. 842.37 s [vector] +++ OK, passed 100 tests.
  8561. 842.37 s [vector] init: OK
  8562. 842.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8563. 842.37 s [vector] tail: OK
  8564. 842.37 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8565. 842.38 s [vector] take: OK
  8566. 842.38 s [vector] +++ OK, passed 100 tests.
  8567. 842.38 s [vector] drop: OK
  8568. 842.38 s [vector] +++ OK, passed 100 tests.
  8569. 842.38 s [vector] splitAt: OK
  8570. 842.38 s [vector] +++ OK, passed 100 tests.
  8571. 842.38 s [vector] empty: OK
  8572. 842.38 s [vector] +++ OK, passed 1 test.
  8573. 842.38 s [vector] singleton: OK
  8574. 842.38 s [vector] +++ OK, passed 100 tests.
  8575. 842.38 s [vector] replicate: OK
  8576. 842.38 s [vector] +++ OK, passed 100 tests.
  8577. 842.38 s [vector] generate: OK
  8578. 842.38 s [vector] +++ OK, passed 100 tests.
  8579. 842.38 s [vector] iterateN: OK
  8580. 842.38 s [vector] +++ OK, passed 100 tests.
  8581. 842.42 s [vector] iterateNM: OK (0.03s)
  8582. 842.42 s [vector] +++ OK, passed 100 tests.
  8583. 842.43 s [vector] generateM: OK (0.01s)
  8584. 842.43 s [vector] +++ OK, passed 100 tests.
  8585. 842.43 s [vector] replicateM: OK
  8586. 842.43 s [vector] +++ OK, passed 100 tests.
  8587. 842.43 s [vector] create: OK
  8588. 842.44 s [vector] +++ OK, passed 100 tests.
  8589. 842.44 s [vector] createT: OK
  8590. 842.44 s [vector] +++ OK, passed 100 tests.
  8591. 842.44 s [vector] unfoldr: OK
  8592. 842.44 s [vector] +++ OK, passed 100 tests.
  8593. 842.44 s [vector] unfoldrN: OK
  8594. 842.44 s [vector] +++ OK, passed 100 tests.
  8595. 842.44 s [vector] unfoldrExactN: OK
  8596. 842.44 s [vector] +++ OK, passed 100 tests.
  8597. 842.44 s [vector] unfoldrM: OK
  8598. 842.44 s [vector] +++ OK, passed 100 tests.
  8599. 842.46 s [vector] unfoldrNM: OK
  8600. 842.46 s [vector] +++ OK, passed 100 tests.
  8601. 842.51 s [vector] unfoldrExactNM: OK (0.06s)
  8602. 842.51 s [vector] +++ OK, passed 100 tests.
  8603. 842.51 s [vector] constructN: OK
  8604. 842.51 s [vector] +++ OK, passed 100 tests.
  8605. 842.51 s [vector] constructrN: OK
  8606. 842.51 s [vector] +++ OK, passed 100 tests.
  8607. 842.51 s [vector] cons: OK
  8608. 842.51 s [vector] +++ OK, passed 100 tests.
  8609. 842.51 s [vector] snoc: OK
  8610. 842.51 s [vector] +++ OK, passed 100 tests.
  8611. 842.52 s [vector] append: OK
  8612. 842.52 s [vector] +++ OK, passed 100 tests.
  8613. 842.53 s [vector] concat: OK
  8614. 842.53 s [vector] +++ OK, passed 100 tests.
  8615. 842.53 s [vector] force: OK
  8616. 842.53 s [vector] +++ OK, passed 100 tests.
  8617. 842.53 s [vector] upd: OK
  8618. 842.53 s [vector] +++ OK, passed 100 tests.
  8619. 842.53 s [vector] accum: OK
  8620. 842.53 s [vector] +++ OK, passed 100 tests.
  8621. 842.53 s [vector] reverse: OK
  8622. 842.53 s [vector] +++ OK, passed 100 tests.
  8623. 842.53 s [vector] backpermute: OK
  8624. 842.53 s [vector] +++ OK, passed 100 tests.
  8625. 842.53 s [vector] map: OK
  8626. 842.53 s [vector] +++ OK, passed 100 tests.
  8627. 842.54 s [vector] imap: OK
  8628. 842.54 s [vector] +++ OK, passed 100 tests.
  8629. 842.54 s [vector] concatMap: OK
  8630. 842.54 s [vector] +++ OK, passed 100 tests.
  8631. 842.54 s [vector] mapM: OK
  8632. 842.54 s [vector] +++ OK, passed 100 tests.
  8633. 842.55 s [vector] mapM_: OK (0.01s)
  8634. 842.55 s [vector] +++ OK, passed 100 tests.
  8635. 842.55 s [vector] forM: OK
  8636. 842.55 s [vector] +++ OK, passed 100 tests.
  8637. 842.56 s [vector] forM_: OK (0.01s)
  8638. 842.56 s [vector] +++ OK, passed 100 tests.
  8639. 842.57 s [vector] imapM: OK
  8640. 842.57 s [vector] +++ OK, passed 100 tests.
  8641. 842.58 s [vector] imapM_: OK (0.01s)
  8642. 842.58 s [vector] +++ OK, passed 100 tests.
  8643. 842.58 s [vector] zipWith: OK
  8644. 842.58 s [vector] +++ OK, passed 100 tests.
  8645. 842.58 s [vector] zipWith3: OK
  8646. 842.58 s [vector] +++ OK, passed 100 tests.
  8647. 842.58 s [vector] izipWith: OK
  8648. 842.58 s [vector] +++ OK, passed 100 tests.
  8649. 842.58 s [vector] izipWith3: OK
  8650. 842.58 s [vector] +++ OK, passed 100 tests.
  8651. 842.59 s [vector] izipWithM: OK
  8652. 842.59 s [vector] +++ OK, passed 100 tests.
  8653. 842.59 s [vector] izipWithM_: OK
  8654. 842.59 s [vector] +++ OK, passed 100 tests.
  8655. 842.60 s [vector] zipWithM: OK
  8656. 842.60 s [vector] +++ OK, passed 100 tests.
  8657. 842.60 s [vector] zipWithM_: OK
  8658. 842.60 s [vector] +++ OK, passed 100 tests.
  8659. 842.60 s [vector] filter: OK
  8660. 842.60 s [vector] +++ OK, passed 100 tests.
  8661. 842.62 s [vector] ifilter: OK
  8662. 842.62 s [vector] +++ OK, passed 100 tests.
  8663. 842.62 s [vector] filterM: OK (0.02s)
  8664. 842.62 s [vector] +++ OK, passed 100 tests.
  8665. 842.62 s [vector] uniq: OK
  8666. 842.62 s [vector] +++ OK, passed 100 tests.
  8667. 842.63 s [vector] mapMaybe: OK
  8668. 842.63 s [vector] +++ OK, passed 100 tests.
  8669. 842.63 s [vector] imapMaybe: OK
  8670. 842.63 s [vector] +++ OK, passed 100 tests.
  8671. 842.63 s [vector] takeWhile: OK
  8672. 842.63 s [vector] +++ OK, passed 100 tests.
  8673. 842.63 s [vector] dropWhile: OK
  8674. 842.63 s [vector] +++ OK, passed 100 tests.
  8675. 842.63 s [vector] partition: OK
  8676. 842.63 s [vector] +++ OK, passed 100 tests.
  8677. 842.63 s [vector] partitionWith: OK
  8678. 842.63 s [vector] +++ OK, passed 100 tests.
  8679. 842.63 s [vector] span: OK
  8680. 842.63 s [vector] +++ OK, passed 100 tests.
  8681. 842.63 s [vector] break: OK
  8682. 842.63 s [vector] +++ OK, passed 100 tests.
  8683. 842.63 s [vector] spanR: OK
  8684. 842.63 s [vector] +++ OK, passed 100 tests.
  8685. 842.64 s [vector] breakR: OK
  8686. 842.64 s [vector] +++ OK, passed 100 tests.
  8687. 842.64 s [vector] groupBy: OK
  8688. 842.64 s [vector] +++ OK, passed 100 tests.
  8689. 842.64 s [vector] elem: OK
  8690. 842.64 s [vector] +++ OK, passed 100 tests.
  8691. 842.64 s [vector] notElem: OK
  8692. 842.64 s [vector] +++ OK, passed 100 tests.
  8693. 842.64 s [vector] find: OK
  8694. 842.64 s [vector] +++ OK, passed 100 tests.
  8695. 842.64 s [vector] findIndex: OK
  8696. 842.64 s [vector] +++ OK, passed 100 tests.
  8697. 842.64 s [vector] findIndexR: OK
  8698. 842.64 s [vector] +++ OK, passed 100 tests.
  8699. 842.64 s [vector] findIndices: OK
  8700. 842.64 s [vector] +++ OK, passed 100 tests.
  8701. 842.64 s [vector] elemIndex: OK
  8702. 842.64 s [vector] +++ OK, passed 100 tests.
  8703. 842.64 s [vector] elemIndices: OK
  8704. 842.64 s [vector] +++ OK, passed 100 tests.
  8705. 842.64 s [vector] foldl: OK
  8706. 842.64 s [vector] +++ OK, passed 100 tests.
  8707. 842.65 s [vector] foldl1: OK
  8708. 842.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8709. 842.65 s [vector] foldl': OK
  8710. 842.65 s [vector] +++ OK, passed 100 tests.
  8711. 842.65 s [vector] foldl1': OK
  8712. 842.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8713. 842.65 s [vector] foldr: OK
  8714. 842.65 s [vector] +++ OK, passed 100 tests.
  8715. 842.65 s [vector] foldr1: OK
  8716. 842.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8717. 842.65 s [vector] foldr': OK
  8718. 842.65 s [vector] +++ OK, passed 100 tests.
  8719. 842.65 s [vector] foldr1': OK
  8720. 842.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8721. 842.65 s [vector] ifoldl: OK
  8722. 842.65 s [vector] +++ OK, passed 100 tests.
  8723. 842.65 s [vector] ifoldl': OK
  8724. 842.65 s [vector] +++ OK, passed 100 tests.
  8725. 842.65 s [vector] ifoldr: OK
  8726. 842.65 s [vector] +++ OK, passed 100 tests.
  8727. 842.65 s [vector] ifoldr': OK
  8728. 842.65 s [vector] +++ OK, passed 100 tests.
  8729. 842.65 s [vector] ifoldM: OK
  8730. 842.65 s [vector] +++ OK, passed 100 tests.
  8731. 842.66 s [vector] ifoldM': OK
  8732. 842.66 s [vector] +++ OK, passed 100 tests.
  8733. 842.68 s [vector] ifoldM_: OK (0.01s)
  8734. 842.68 s [vector] +++ OK, passed 100 tests.
  8735. 842.68 s [vector] ifoldM'_: OK (0.01s)
  8736. 842.68 s [vector] +++ OK, passed 100 tests.
  8737. 842.68 s [vector] all: OK
  8738. 842.68 s [vector] +++ OK, passed 100 tests.
  8739. 842.68 s [vector] any: OK
  8740. 842.68 s [vector] +++ OK, passed 100 tests.
  8741. 842.68 s [vector] prescanl: OK
  8742. 842.68 s [vector] +++ OK, passed 100 tests.
  8743. 842.68 s [vector] prescanl': OK
  8744. 842.68 s [vector] +++ OK, passed 100 tests.
  8745. 842.68 s [vector] postscanl: OK
  8746. 842.68 s [vector] +++ OK, passed 100 tests.
  8747. 842.68 s [vector] postscanl': OK
  8748. 842.68 s [vector] +++ OK, passed 100 tests.
  8749. 842.68 s [vector] scanl: OK
  8750. 842.68 s [vector] +++ OK, passed 100 tests.
  8751. 842.69 s [vector] scanl': OK
  8752. 842.69 s [vector] +++ OK, passed 100 tests.
  8753. 842.69 s [vector] scanl1: OK
  8754. 842.69 s [vector] +++ OK, passed 100 tests.
  8755. 842.69 s [vector] scanl1': OK
  8756. 842.69 s [vector] +++ OK, passed 100 tests.
  8757. 842.69 s [vector] iscanl: OK
  8758. 842.69 s [vector] +++ OK, passed 100 tests.
  8759. 842.69 s [vector] iscanl': OK
  8760. 842.69 s [vector] +++ OK, passed 100 tests.
  8761. 842.69 s [vector] prescanr: OK
  8762. 842.69 s [vector] +++ OK, passed 100 tests.
  8763. 842.69 s [vector] prescanr': OK
  8764. 842.69 s [vector] +++ OK, passed 100 tests.
  8765. 842.69 s [vector] postscanr: OK
  8766. 842.70 s [vector] +++ OK, passed 100 tests.
  8767. 842.70 s [vector] postscanr': OK
  8768. 842.70 s [vector] +++ OK, passed 100 tests.
  8769. 842.70 s [vector] scanr: OK
  8770. 842.70 s [vector] +++ OK, passed 100 tests.
  8771. 842.70 s [vector] scanr': OK
  8772. 842.70 s [vector] +++ OK, passed 100 tests.
  8773. 842.70 s [vector] scanr1: OK
  8774. 842.70 s [vector] +++ OK, passed 100 tests.
  8775. 842.70 s [vector] scanr1': OK
  8776. 842.70 s [vector] +++ OK, passed 100 tests.
  8777. 842.70 s [vector] iscanr: OK
  8778. 842.70 s [vector] +++ OK, passed 100 tests.
  8779. 842.70 s [vector] iscanr': OK
  8780. 842.70 s [vector] +++ OK, passed 100 tests.
  8781. 842.70 s [vector] mut_read: OK
  8782. 842.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8783. 842.70 s [vector] mut_write: OK
  8784. 842.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8785. 842.71 s [vector] mut_modify: OK
  8786. 842.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8787. 842.71 s [vector] mut_generate: OK
  8788. 842.71 s [vector] +++ OK, passed 100 tests.
  8789. 842.72 s [vector] mut_generateM: OK
  8790. 842.72 s [vector] +++ OK, passed 100 tests.
  8791. 842.74 s [vector] mut_mapM_: OK (0.01s)
  8792. 842.74 s [vector] +++ OK, passed 100 tests.
  8793. 842.74 s [vector] mut_imapM_: OK (0.01s)
  8794. 842.74 s [vector] +++ OK, passed 100 tests.
  8795. 842.75 s [vector] mut_forM_: OK
  8796. 842.75 s [vector] +++ OK, passed 100 tests.
  8797. 842.76 s [vector] mut_iforM_: OK (0.01s)
  8798. 842.76 s [vector] +++ OK, passed 100 tests.
  8799. 842.76 s [vector] mut_foldr: OK
  8800. 842.76 s [vector] +++ OK, passed 100 tests.
  8801. 842.76 s [vector] mut_foldr': OK
  8802. 842.76 s [vector] +++ OK, passed 100 tests.
  8803. 842.76 s [vector] mut_foldl: OK
  8804. 842.76 s [vector] +++ OK, passed 100 tests.
  8805. 842.76 s [vector] mut_foldl': OK
  8806. 842.76 s [vector] +++ OK, passed 100 tests.
  8807. 842.76 s [vector] mut_ifoldr: OK
  8808. 842.76 s [vector] +++ OK, passed 100 tests.
  8809. 842.76 s [vector] mut_ifoldr': OK
  8810. 842.76 s [vector] +++ OK, passed 100 tests.
  8811. 842.76 s [vector] mut_ifoldl: OK
  8812. 842.76 s [vector] +++ OK, passed 100 tests.
  8813. 842.76 s [vector] mut_ifoldl': OK
  8814. 842.76 s [vector] +++ OK, passed 100 tests.
  8815. 842.76 s [vector] mut_foldM: OK
  8816. 842.76 s [vector] +++ OK, passed 100 tests.
  8817. 842.76 s [vector] mut_foldM': OK
  8818. 842.76 s [vector] +++ OK, passed 100 tests.
  8819. 842.76 s [vector] mut_foldrM: OK
  8820. 842.76 s [vector] +++ OK, passed 100 tests.
  8821. 842.77 s [vector] mut_foldrM': OK
  8822. 842.77 s [vector] +++ OK, passed 100 tests.
  8823. 842.77 s [vector] mut_ifoldM: OK
  8824. 842.77 s [vector] +++ OK, passed 100 tests.
  8825. 842.77 s [vector] mut_ifoldM': OK
  8826. 842.77 s [vector] +++ OK, passed 100 tests.
  8827. 842.77 s [vector] mut_ifoldrM: OK
  8828. 842.77 s [vector] +++ OK, passed 100 tests.
  8829. 842.77 s [vector] mut_ifoldrM': OK
  8830. 842.77 s [vector] +++ OK, passed 100 tests.
  8831. 842.77 s [vector] compare: OK
  8832. 842.77 s [vector] +++ OK, passed 100 tests.
  8833. 842.77 s [vector] maximum: OK
  8834. 842.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8835. 842.77 s [vector] minimum: OK
  8836. 842.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8837. 842.78 s [vector] minIndex: OK
  8838. 842.78 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8839. 842.78 s [vector] maxIndex: OK
  8840. 842.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8841. 842.78 s [vector] maximumBy: OK
  8842. 842.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8843. 842.78 s [vector] minimumBy: OK
  8844. 842.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8845. 842.78 s [vector] maximumOn: OK
  8846. 842.78 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8847. 842.78 s [vector] minimumOn: OK
  8848. 842.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8849. 842.78 s [vector] maxIndexBy: OK
  8850. 842.78 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8851. 842.78 s [vector] minIndexBy: OK
  8852. 842.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8853. 842.78 s [vector] ListFirstMaxIndexWins: OK
  8854. 842.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8855. 842.79 s [vector] FalseListFirstMaxIndexWins: OK
  8856. 842.79 s [vector] +++ OK, failed as expected. (after 1 test):
  8857. 842.79 s [vector] Exception:
  8858. 842.79 s [vector] Prelude.foldr1: empty list
  8859. 842.79 s [vector] CallStack (from HasCallStack):
  8860. 842.79 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  8861. 842.79 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  8862. 842.79 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8863. 842.79 s [vector] []
  8864. 842.79 s [vector] zip: OK
  8865. 842.79 s [vector] +++ OK, passed 100 tests.
  8866. 842.79 s [vector] zip3: OK
  8867. 842.79 s [vector] +++ OK, passed 100 tests.
  8868. 842.79 s [vector] unzip: OK
  8869. 842.79 s [vector] +++ OK, passed 100 tests.
  8870. 842.79 s [vector] unzip3: OK
  8871. 842.79 s [vector] +++ OK, passed 100 tests.
  8872. 842.79 s [vector] indexed: OK
  8873. 842.80 s [vector] +++ OK, passed 100 tests.
  8874. 842.80 s [vector] update: OK
  8875. 842.80 s [vector] +++ OK, passed 100 tests.
  8876. 842.80 s [vector] mempty: OK
  8877. 842.80 s [vector] +++ OK, passed 1 test.
  8878. 842.80 s [vector] mappend: OK
  8879. 842.80 s [vector] +++ OK, passed 100 tests.
  8880. 842.81 s [vector] mconcat: OK
  8881. 842.81 s [vector] +++ OK, passed 100 tests.
  8882. 842.81 s [vector] glength: OK
  8883. 842.81 s [vector] +++ OK, passed 100 tests.
  8884. 842.81 s [vector] (Bool)
  8885. 842.81 s [vector] fromList.toList == id: OK
  8886. 842.81 s [vector] +++ OK, passed 100 tests.
  8887. 842.81 s [vector] toList.fromList == id: OK
  8888. 842.81 s [vector] +++ OK, passed 100 tests.
  8889. 842.81 s [vector] unstream.stream == id: OK
  8890. 842.81 s [vector] +++ OK, passed 100 tests.
  8891. 842.81 s [vector] stream.unstream == id: OK
  8892. 842.81 s [vector] +++ OK, passed 100 tests.
  8893. 842.81 s [vector] eq: OK
  8894. 842.81 s [vector] +++ OK, passed 100 tests.
  8895. 842.81 s [vector] length: OK
  8896. 842.81 s [vector] +++ OK, passed 100 tests.
  8897. 842.81 s [vector] null: OK
  8898. 842.81 s [vector] +++ OK, passed 100 tests.
  8899. 842.81 s [vector] index: OK
  8900. 842.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8901. 842.81 s [vector] safeIndex: OK
  8902. 842.81 s [vector] +++ OK, passed 100 tests.
  8903. 842.81 s [vector] head: OK
  8904. 842.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8905. 842.81 s [vector] last: OK
  8906. 842.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8907. 842.81 s [vector] unsafeIndex: OK
  8908. 842.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8909. 842.81 s [vector] unsafeHead: OK
  8910. 842.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8911. 842.81 s [vector] unsafeLast: OK
  8912. 842.81 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8913. 842.81 s [vector] slice: OK
  8914. 842.81 s [vector] +++ OK, passed 100 tests.
  8915. 842.81 s [vector] init: OK
  8916. 842.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8917. 842.81 s [vector] tail: OK
  8918. 842.82 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8919. 842.82 s [vector] take: OK
  8920. 842.83 s [vector] +++ OK, passed 100 tests.
  8921. 842.83 s [vector] drop: OK
  8922. 842.83 s [vector] +++ OK, passed 100 tests.
  8923. 842.83 s [vector] splitAt: OK
  8924. 842.83 s [vector] +++ OK, passed 100 tests.
  8925. 842.83 s [vector] empty: OK
  8926. 842.83 s [vector] +++ OK, passed 1 test.
  8927. 842.83 s [vector] singleton: OK
  8928. 842.83 s [vector] +++ OK, passed 100 tests.
  8929. 842.83 s [vector] replicate: OK
  8930. 842.83 s [vector] +++ OK, passed 100 tests.
  8931. 842.83 s [vector] generate: OK
  8932. 842.83 s [vector] +++ OK, passed 100 tests.
  8933. 842.84 s [vector] iterateN: OK
  8934. 842.84 s [vector] +++ OK, passed 100 tests.
  8935. 842.86 s [vector] iterateNM: OK (0.01s)
  8936. 842.87 s [vector] +++ OK, passed 100 tests.
  8937. 842.87 s [vector] generateM: OK (0.02s)
  8938. 842.87 s [vector] +++ OK, passed 100 tests.
  8939. 842.89 s [vector] replicateM: OK (0.03s)
  8940. 842.89 s [vector] +++ OK, passed 100 tests.
  8941. 842.89 s [vector] create: OK
  8942. 842.89 s [vector] +++ OK, passed 100 tests.
  8943. 842.89 s [vector] createT: OK
  8944. 842.89 s [vector] +++ OK, passed 100 tests.
  8945. 842.89 s [vector] unfoldr: OK
  8946. 842.89 s [vector] +++ OK, passed 100 tests.
  8947. 842.89 s [vector] unfoldrN: OK
  8948. 842.89 s [vector] +++ OK, passed 100 tests.
  8949. 842.90 s [vector] unfoldrExactN: OK
  8950. 842.90 s [vector] +++ OK, passed 100 tests.
  8951. 842.90 s [vector] unfoldrM: OK
  8952. 842.90 s [vector] +++ OK, passed 100 tests.
  8953. 842.90 s [vector] unfoldrNM: OK
  8954. 842.90 s [vector] +++ OK, passed 100 tests.
  8955. 842.93 s [vector] unfoldrExactNM: OK (0.03s)
  8956. 842.93 s [vector] +++ OK, passed 100 tests.
  8957. 842.94 s [vector] constructN: OK
  8958. 842.94 s [vector] +++ OK, passed 100 tests.
  8959. 842.95 s [vector] constructrN: OK
  8960. 842.95 s [vector] +++ OK, passed 100 tests.
  8961. 842.95 s [vector] cons: OK
  8962. 842.95 s [vector] +++ OK, passed 100 tests.
  8963. 842.95 s [vector] snoc: OK
  8964. 842.95 s [vector] +++ OK, passed 100 tests.
  8965. 842.96 s [vector] append: OK
  8966. 842.96 s [vector] +++ OK, passed 100 tests.
  8967. 842.98 s [vector] concat: OK (0.02s)
  8968. 842.98 s [vector] +++ OK, passed 100 tests.
  8969. 842.98 s [vector] force: OK
  8970. 842.98 s [vector] +++ OK, passed 100 tests.
  8971. 842.98 s [vector] upd: OK
  8972. 842.98 s [vector] +++ OK, passed 100 tests.
  8973. 842.99 s [vector] accum: OK
  8974. 842.99 s [vector] +++ OK, passed 100 tests.
  8975. 842.99 s [vector] reverse: OK
  8976. 842.99 s [vector] +++ OK, passed 100 tests.
  8977. 843.00 s [vector] backpermute: OK
  8978. 843.00 s [vector] +++ OK, passed 100 tests.
  8979. 843.00 s [vector] map: OK
  8980. 843.00 s [vector] +++ OK, passed 100 tests.
  8981. 843.00 s [vector] imap: OK
  8982. 843.00 s [vector] +++ OK, passed 100 tests.
  8983. 843.00 s [vector] concatMap: OK
  8984. 843.00 s [vector] +++ OK, passed 100 tests.
  8985. 843.00 s [vector] mapM: OK
  8986. 843.00 s [vector] +++ OK, passed 100 tests.
  8987. 843.01 s [vector] mapM_: OK (0.01s)
  8988. 843.01 s [vector] +++ OK, passed 100 tests.
  8989. 843.02 s [vector] forM: OK
  8990. 843.02 s [vector] +++ OK, passed 100 tests.
  8991. 843.03 s [vector] forM_: OK (0.01s)
  8992. 843.03 s [vector] +++ OK, passed 100 tests.
  8993. 843.05 s [vector] imapM: OK
  8994. 843.05 s [vector] +++ OK, passed 100 tests.
  8995. 843.05 s [vector] imapM_: OK (0.02s)
  8996. 843.05 s [vector] +++ OK, passed 100 tests.
  8997. 843.05 s [vector] zipWith: OK
  8998. 843.05 s [vector] +++ OK, passed 100 tests.
  8999. 843.05 s [vector] zipWith3: OK
  9000. 843.05 s [vector] +++ OK, passed 100 tests.
  9001. 843.05 s [vector] izipWith: OK
  9002. 843.05 s [vector] +++ OK, passed 100 tests.
  9003. 843.06 s [vector] izipWith3: OK
  9004. 843.06 s [vector] +++ OK, passed 100 tests.
  9005. 843.06 s [vector] izipWithM: OK
  9006. 843.06 s [vector] +++ OK, passed 100 tests.
  9007. 843.07 s [vector] izipWithM_: OK (0.01s)
  9008. 843.07 s [vector] +++ OK, passed 100 tests.
  9009. 843.08 s [vector] zipWithM: OK
  9010. 843.08 s [vector] +++ OK, passed 100 tests.
  9011. 843.09 s [vector] zipWithM_: OK (0.01s)
  9012. 843.09 s [vector] +++ OK, passed 100 tests.
  9013. 843.09 s [vector] filter: OK
  9014. 843.09 s [vector] +++ OK, passed 100 tests.
  9015. 843.10 s [vector] ifilter: OK
  9016. 843.10 s [vector] +++ OK, passed 100 tests.
  9017. 843.11 s [vector] filterM: OK (0.02s)
  9018. 843.11 s [vector] +++ OK, passed 100 tests.
  9019. 843.11 s [vector] uniq: OK
  9020. 843.11 s [vector] +++ OK, passed 100 tests.
  9021. 843.12 s [vector] mapMaybe: OK
  9022. 843.12 s [vector] +++ OK, passed 100 tests.
  9023. 843.12 s [vector] imapMaybe: OK
  9024. 843.12 s [vector] +++ OK, passed 100 tests.
  9025. 843.12 s [vector] takeWhile: OK
  9026. 843.12 s [vector] +++ OK, passed 100 tests.
  9027. 843.12 s [vector] dropWhile: OK
  9028. 843.12 s [vector] +++ OK, passed 100 tests.
  9029. 843.12 s [vector] partition: OK
  9030. 843.12 s [vector] +++ OK, passed 100 tests.
  9031. 843.12 s [vector] partitionWith: OK
  9032. 843.12 s [vector] +++ OK, passed 100 tests.
  9033. 843.12 s [vector] span: OK
  9034. 843.12 s [vector] +++ OK, passed 100 tests.
  9035. 843.13 s [vector] break: OK
  9036. 843.13 s [vector] +++ OK, passed 100 tests.
  9037. 843.13 s [vector] spanR: OK
  9038. 843.13 s [vector] +++ OK, passed 100 tests.
  9039. 843.13 s [vector] breakR: OK
  9040. 843.13 s [vector] +++ OK, passed 100 tests.
  9041. 843.13 s [vector] groupBy: OK
  9042. 843.13 s [vector] +++ OK, passed 100 tests.
  9043. 843.13 s [vector] elem: OK
  9044. 843.13 s [vector] +++ OK, passed 100 tests.
  9045. 843.13 s [vector] notElem: OK
  9046. 843.13 s [vector] +++ OK, passed 100 tests.
  9047. 843.13 s [vector] find: OK
  9048. 843.13 s [vector] +++ OK, passed 100 tests.
  9049. 843.13 s [vector] findIndex: OK
  9050. 843.13 s [vector] +++ OK, passed 100 tests.
  9051. 843.13 s [vector] findIndexR: OK
  9052. 843.13 s [vector] +++ OK, passed 100 tests.
  9053. 843.13 s [vector] findIndices: OK
  9054. 843.13 s [vector] +++ OK, passed 100 tests.
  9055. 843.13 s [vector] elemIndex: OK
  9056. 843.13 s [vector] +++ OK, passed 100 tests.
  9057. 843.13 s [vector] elemIndices: OK
  9058. 843.13 s [vector] +++ OK, passed 100 tests.
  9059. 843.13 s [vector] foldl: OK
  9060. 843.13 s [vector] +++ OK, passed 100 tests.
  9061. 843.14 s [vector] foldl1: OK
  9062. 843.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9063. 843.14 s [vector] foldl': OK
  9064. 843.14 s [vector] +++ OK, passed 100 tests.
  9065. 843.14 s [vector] foldl1': OK
  9066. 843.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9067. 843.14 s [vector] foldr: OK
  9068. 843.14 s [vector] +++ OK, passed 100 tests.
  9069. 843.15 s [vector] foldr1: OK
  9070. 843.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9071. 843.15 s [vector] foldr': OK
  9072. 843.15 s [vector] +++ OK, passed 100 tests.
  9073. 843.15 s [vector] foldr1': OK
  9074. 843.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9075. 843.15 s [vector] ifoldl: OK
  9076. 843.15 s [vector] +++ OK, passed 100 tests.
  9077. 843.16 s [vector] ifoldl': OK
  9078. 843.16 s [vector] +++ OK, passed 100 tests.
  9079. 843.16 s [vector] ifoldr: OK
  9080. 843.16 s [vector] +++ OK, passed 100 tests.
  9081. 843.16 s [vector] ifoldr': OK
  9082. 843.16 s [vector] +++ OK, passed 100 tests.
  9083. 843.16 s [vector] ifoldM: OK
  9084. 843.16 s [vector] +++ OK, passed 100 tests.
  9085. 843.18 s [vector] ifoldM': OK
  9086. 843.18 s [vector] +++ OK, passed 100 tests.
  9087. 843.18 s [vector] ifoldM_: OK (0.01s)
  9088. 843.18 s [vector] +++ OK, passed 100 tests.
  9089. 843.19 s [vector] ifoldM'_: OK (0.01s)
  9090. 843.19 s [vector] +++ OK, passed 100 tests.
  9091. 843.19 s [vector] all: OK
  9092. 843.19 s [vector] +++ OK, passed 100 tests.
  9093. 843.19 s [vector] any: OK
  9094. 843.19 s [vector] +++ OK, passed 100 tests.
  9095. 843.19 s [vector] prescanl: OK
  9096. 843.19 s [vector] +++ OK, passed 100 tests.
  9097. 843.20 s [vector] prescanl': OK
  9098. 843.20 s [vector] +++ OK, passed 100 tests.
  9099. 843.20 s [vector] postscanl: OK
  9100. 843.20 s [vector] +++ OK, passed 100 tests.
  9101. 843.20 s [vector] postscanl': OK
  9102. 843.20 s [vector] +++ OK, passed 100 tests.
  9103. 843.20 s [vector] scanl: OK
  9104. 843.20 s [vector] +++ OK, passed 100 tests.
  9105. 843.20 s [vector] scanl': OK
  9106. 843.20 s [vector] +++ OK, passed 100 tests.
  9107. 843.20 s [vector] scanl1: OK
  9108. 843.20 s [vector] +++ OK, passed 100 tests.
  9109. 843.21 s [vector] scanl1': OK
  9110. 843.21 s [vector] +++ OK, passed 100 tests.
  9111. 843.21 s [vector] iscanl: OK
  9112. 843.21 s [vector] +++ OK, passed 100 tests.
  9113. 843.21 s [vector] iscanl': OK
  9114. 843.21 s [vector] +++ OK, passed 100 tests.
  9115. 843.21 s [vector] prescanr: OK
  9116. 843.21 s [vector] +++ OK, passed 100 tests.
  9117. 843.21 s [vector] prescanr': OK
  9118. 843.21 s [vector] +++ OK, passed 100 tests.
  9119. 843.22 s [vector] postscanr: OK
  9120. 843.22 s [vector] +++ OK, passed 100 tests.
  9121. 843.22 s [vector] postscanr': OK
  9122. 843.22 s [vector] +++ OK, passed 100 tests.
  9123. 843.22 s [vector] scanr: OK
  9124. 843.22 s [vector] +++ OK, passed 100 tests.
  9125. 843.22 s [vector] scanr': OK
  9126. 843.22 s [vector] +++ OK, passed 100 tests.
  9127. 843.22 s [vector] scanr1: OK
  9128. 843.22 s [vector] +++ OK, passed 100 tests.
  9129. 843.22 s [vector] scanr1': OK
  9130. 843.22 s [vector] +++ OK, passed 100 tests.
  9131. 843.23 s [vector] iscanr: OK
  9132. 843.23 s [vector] +++ OK, passed 100 tests.
  9133. 843.23 s [vector] iscanr': OK
  9134. 843.23 s [vector] +++ OK, passed 100 tests.
  9135. 843.23 s [vector] mut_read: OK
  9136. 843.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9137. 843.23 s [vector] mut_write: OK
  9138. 843.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9139. 843.23 s [vector] mut_modify: OK
  9140. 843.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9141. 843.23 s [vector] mut_generate: OK
  9142. 843.23 s [vector] +++ OK, passed 100 tests.
  9143. 843.24 s [vector] mut_generateM: OK
  9144. 843.24 s [vector] +++ OK, passed 100 tests.
  9145. 843.26 s [vector] mut_mapM_: OK (0.01s)
  9146. 843.26 s [vector] +++ OK, passed 100 tests.
  9147. 843.27 s [vector] mut_imapM_: OK (0.01s)
  9148. 843.27 s [vector] +++ OK, passed 100 tests.
  9149. 843.27 s [vector] mut_forM_: OK
  9150. 843.28 s [vector] +++ OK, passed 100 tests.
  9151. 843.29 s [vector] mut_iforM_: OK (0.01s)
  9152. 843.29 s [vector] +++ OK, passed 100 tests.
  9153. 843.29 s [vector] mut_foldr: OK
  9154. 843.29 s [vector] +++ OK, passed 100 tests.
  9155. 843.29 s [vector] mut_foldr': OK
  9156. 843.29 s [vector] +++ OK, passed 100 tests.
  9157. 843.29 s [vector] mut_foldl: OK
  9158. 843.29 s [vector] +++ OK, passed 100 tests.
  9159. 843.29 s [vector] mut_foldl': OK
  9160. 843.29 s [vector] +++ OK, passed 100 tests.
  9161. 843.29 s [vector] mut_ifoldr: OK
  9162. 843.29 s [vector] +++ OK, passed 100 tests.
  9163. 843.30 s [vector] mut_ifoldr': OK
  9164. 843.30 s [vector] +++ OK, passed 100 tests.
  9165. 843.30 s [vector] mut_ifoldl: OK
  9166. 843.30 s [vector] +++ OK, passed 100 tests.
  9167. 843.30 s [vector] mut_ifoldl': OK
  9168. 843.30 s [vector] +++ OK, passed 100 tests.
  9169. 843.30 s [vector] mut_foldM: OK
  9170. 843.30 s [vector] +++ OK, passed 100 tests.
  9171. 843.30 s [vector] mut_foldM': OK
  9172. 843.30 s [vector] +++ OK, passed 100 tests.
  9173. 843.30 s [vector] mut_foldrM: OK
  9174. 843.30 s [vector] +++ OK, passed 100 tests.
  9175. 843.31 s [vector] mut_foldrM': OK
  9176. 843.31 s [vector] +++ OK, passed 100 tests.
  9177. 843.31 s [vector] mut_ifoldM: OK
  9178. 843.31 s [vector] +++ OK, passed 100 tests.
  9179. 843.32 s [vector] mut_ifoldM': OK
  9180. 843.32 s [vector] +++ OK, passed 100 tests.
  9181. 843.32 s [vector] mut_ifoldrM: OK
  9182. 843.32 s [vector] +++ OK, passed 100 tests.
  9183. 843.33 s [vector] mut_ifoldrM': OK
  9184. 843.33 s [vector] +++ OK, passed 100 tests.
  9185. 843.34 s [vector] compare: OK
  9186. 843.34 s [vector] +++ OK, passed 100 tests.
  9187. 843.34 s [vector] maximum: OK
  9188. 843.34 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9189. 843.34 s [vector] minimum: OK
  9190. 843.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9191. 843.35 s [vector] minIndex: OK
  9192. 843.35 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9193. 843.35 s [vector] maxIndex: OK
  9194. 843.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9195. 843.35 s [vector] maximumBy: OK
  9196. 843.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9197. 843.36 s [vector] minimumBy: OK
  9198. 843.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9199. 843.36 s [vector] maximumOn: OK
  9200. 843.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9201. 843.36 s [vector] minimumOn: OK
  9202. 843.36 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9203. 843.36 s [vector] maxIndexBy: OK
  9204. 843.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9205. 843.37 s [vector] minIndexBy: OK
  9206. 843.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9207. 843.37 s [vector] ListFirstMaxIndexWins: OK
  9208. 843.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9209. 843.37 s [vector] FalseListFirstMaxIndexWins: OK
  9210. 843.37 s [vector] +++ OK, failed as expected. (after 1 test):
  9211. 843.37 s [vector] Exception:
  9212. 843.37 s [vector] Prelude.foldr1: empty list
  9213. 843.37 s [vector] CallStack (from HasCallStack):
  9214. 843.38 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9215. 843.38 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9216. 843.38 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9217. 843.38 s [vector] []
  9218. 843.38 s [vector] zip: OK
  9219. 843.38 s [vector] +++ OK, passed 100 tests.
  9220. 843.38 s [vector] zip3: OK
  9221. 843.38 s [vector] +++ OK, passed 100 tests.
  9222. 843.38 s [vector] unzip: OK
  9223. 843.38 s [vector] +++ OK, passed 100 tests.
  9224. 843.38 s [vector] unzip3: OK
  9225. 843.38 s [vector] +++ OK, passed 100 tests.
  9226. 843.38 s [vector] indexed: OK
  9227. 843.39 s [vector] +++ OK, passed 100 tests.
  9228. 843.39 s [vector] update: OK
  9229. 843.39 s [vector] +++ OK, passed 100 tests.
  9230. 843.39 s [vector] mempty: OK
  9231. 843.39 s [vector] +++ OK, passed 1 test.
  9232. 843.40 s [vector] mappend: OK
  9233. 843.40 s [vector] +++ OK, passed 100 tests.
  9234. 843.40 s [vector] mconcat: OK (0.02s)
  9235. 843.40 s [vector] +++ OK, passed 100 tests.
  9236. 843.40 s [vector] glength: OK
  9237. 843.40 s [vector] +++ OK, passed 100 tests.
  9238. 843.40 s [vector] and: OK
  9239. 843.40 s [vector] +++ OK, passed 100 tests.
  9240. 843.41 s [vector] or: OK
  9241. 843.41 s [vector] +++ OK, passed 100 tests.
  9242. 843.41 s [vector] (Int)
  9243. 843.41 s [vector] fromList.toList == id: OK
  9244. 843.41 s [vector] +++ OK, passed 100 tests.
  9245. 843.41 s [vector] toList.fromList == id: OK
  9246. 843.41 s [vector] +++ OK, passed 100 tests.
  9247. 843.41 s [vector] unstream.stream == id: OK
  9248. 843.41 s [vector] +++ OK, passed 100 tests.
  9249. 843.41 s [vector] stream.unstream == id: OK
  9250. 843.41 s [vector] +++ OK, passed 100 tests.
  9251. 843.41 s [vector] eq: OK
  9252. 843.41 s [vector] +++ OK, passed 100 tests.
  9253. 843.41 s [vector] length: OK
  9254. 843.41 s [vector] +++ OK, passed 100 tests.
  9255. 843.41 s [vector] null: OK
  9256. 843.41 s [vector] +++ OK, passed 100 tests.
  9257. 843.41 s [vector] index: OK
  9258. 843.41 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9259. 843.41 s [vector] safeIndex: OK
  9260. 843.41 s [vector] +++ OK, passed 100 tests.
  9261. 843.41 s [vector] head: OK
  9262. 843.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9263. 843.41 s [vector] last: OK
  9264. 843.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9265. 843.41 s [vector] unsafeIndex: OK
  9266. 843.41 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9267. 843.41 s [vector] unsafeHead: OK
  9268. 843.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9269. 843.41 s [vector] unsafeLast: OK
  9270. 843.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9271. 843.41 s [vector] slice: OK
  9272. 843.41 s [vector] +++ OK, passed 100 tests.
  9273. 843.42 s [vector] init: OK
  9274. 843.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9275. 843.42 s [vector] tail: OK
  9276. 843.42 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9277. 843.42 s [vector] take: OK
  9278. 843.42 s [vector] +++ OK, passed 100 tests.
  9279. 843.42 s [vector] drop: OK
  9280. 843.42 s [vector] +++ OK, passed 100 tests.
  9281. 843.42 s [vector] splitAt: OK
  9282. 843.42 s [vector] +++ OK, passed 100 tests.
  9283. 843.42 s [vector] empty: OK
  9284. 843.42 s [vector] +++ OK, passed 1 test.
  9285. 843.42 s [vector] singleton: OK
  9286. 843.42 s [vector] +++ OK, passed 100 tests.
  9287. 843.42 s [vector] replicate: OK
  9288. 843.42 s [vector] +++ OK, passed 100 tests.
  9289. 843.42 s [vector] generate: OK
  9290. 843.42 s [vector] +++ OK, passed 100 tests.
  9291. 843.42 s [vector] iterateN: OK
  9292. 843.42 s [vector] +++ OK, passed 100 tests.
  9293. 843.46 s [vector] iterateNM: OK (0.03s)
  9294. 843.46 s [vector] +++ OK, passed 100 tests.
  9295. 843.49 s [vector] generateM: OK (0.03s)
  9296. 843.49 s [vector] +++ OK, passed 100 tests.
  9297. 843.50 s [vector] replicateM: OK (0.01s)
  9298. 843.50 s [vector] +++ OK, passed 100 tests.
  9299. 843.50 s [vector] create: OK
  9300. 843.50 s [vector] +++ OK, passed 100 tests.
  9301. 843.50 s [vector] createT: OK
  9302. 843.50 s [vector] +++ OK, passed 100 tests.
  9303. 843.50 s [vector] unfoldr: OK
  9304. 843.50 s [vector] +++ OK, passed 100 tests.
  9305. 843.50 s [vector] unfoldrN: OK
  9306. 843.50 s [vector] +++ OK, passed 100 tests.
  9307. 843.50 s [vector] unfoldrExactN: OK
  9308. 843.50 s [vector] +++ OK, passed 100 tests.
  9309. 843.50 s [vector] unfoldrM: OK
  9310. 843.50 s [vector] +++ OK, passed 100 tests.
  9311. 843.52 s [vector] unfoldrNM: OK
  9312. 843.52 s [vector] +++ OK, passed 100 tests.
  9313. 843.54 s [vector] unfoldrExactNM: OK (0.03s)
  9314. 843.54 s [vector] +++ OK, passed 100 tests.
  9315. 843.54 s [vector] constructN: OK
  9316. 843.54 s [vector] +++ OK, passed 100 tests.
  9317. 843.54 s [vector] constructrN: OK
  9318. 843.54 s [vector] +++ OK, passed 100 tests.
  9319. 843.54 s [vector] cons: OK
  9320. 843.54 s [vector] +++ OK, passed 100 tests.
  9321. 843.54 s [vector] snoc: OK
  9322. 843.55 s [vector] +++ OK, passed 100 tests.
  9323. 843.55 s [vector] append: OK
  9324. 843.56 s [vector] +++ OK, passed 100 tests.
  9325. 843.56 s [vector] concat: OK (0.01s)
  9326. 843.56 s [vector] +++ OK, passed 100 tests.
  9327. 843.56 s [vector] force: OK
  9328. 843.56 s [vector] +++ OK, passed 100 tests.
  9329. 843.57 s [vector] upd: OK
  9330. 843.57 s [vector] +++ OK, passed 100 tests.
  9331. 843.57 s [vector] accum: OK
  9332. 843.57 s [vector] +++ OK, passed 100 tests.
  9333. 843.57 s [vector] reverse: OK
  9334. 843.57 s [vector] +++ OK, passed 100 tests.
  9335. 843.57 s [vector] backpermute: OK
  9336. 843.57 s [vector] +++ OK, passed 100 tests.
  9337. 843.58 s [vector] map: OK
  9338. 843.58 s [vector] +++ OK, passed 100 tests.
  9339. 843.58 s [vector] imap: OK
  9340. 843.58 s [vector] +++ OK, passed 100 tests.
  9341. 843.58 s [vector] concatMap: OK
  9342. 843.58 s [vector] +++ OK, passed 100 tests.
  9343. 843.58 s [vector] mapM: OK
  9344. 843.58 s [vector] +++ OK, passed 100 tests.
  9345. 843.60 s [vector] mapM_: OK (0.01s)
  9346. 843.60 s [vector] +++ OK, passed 100 tests.
  9347. 843.61 s [vector] forM: OK
  9348. 843.61 s [vector] +++ OK, passed 100 tests.
  9349. 843.62 s [vector] forM_: OK (0.01s)
  9350. 843.62 s [vector] +++ OK, passed 100 tests.
  9351. 843.62 s [vector] imapM: OK
  9352. 843.62 s [vector] +++ OK, passed 100 tests.
  9353. 843.64 s [vector] imapM_: OK (0.02s)
  9354. 843.64 s [vector] +++ OK, passed 100 tests.
  9355. 843.64 s [vector] zipWith: OK
  9356. 843.64 s [vector] +++ OK, passed 100 tests.
  9357. 843.64 s [vector] zipWith3: OK
  9358. 843.64 s [vector] +++ OK, passed 100 tests.
  9359. 843.65 s [vector] izipWith: OK
  9360. 843.65 s [vector] +++ OK, passed 100 tests.
  9361. 843.65 s [vector] izipWith3: OK
  9362. 843.65 s [vector] +++ OK, passed 100 tests.
  9363. 843.66 s [vector] izipWithM: OK
  9364. 843.66 s [vector] +++ OK, passed 100 tests.
  9365. 843.67 s [vector] izipWithM_: OK (0.01s)
  9366. 843.67 s [vector] +++ OK, passed 100 tests.
  9367. 843.68 s [vector] zipWithM: OK
  9368. 843.68 s [vector] +++ OK, passed 100 tests.
  9369. 843.68 s [vector] zipWithM_: OK (0.01s)
  9370. 843.68 s [vector] +++ OK, passed 100 tests.
  9371. 843.68 s [vector] filter: OK
  9372. 843.68 s [vector] +++ OK, passed 100 tests.
  9373. 843.68 s [vector] ifilter: OK
  9374. 843.70 s [vector] +++ OK, passed 100 tests.
  9375. 843.72 s [vector] filterM: OK (0.04s)
  9376. 843.72 s [vector] +++ OK, passed 100 tests.
  9377. 843.73 s [vector] uniq: OK
  9378. 843.73 s [vector] +++ OK, passed 100 tests.
  9379. 843.73 s [vector] mapMaybe: OK
  9380. 843.73 s [vector] +++ OK, passed 100 tests.
  9381. 843.73 s [vector] imapMaybe: OK
  9382. 843.73 s [vector] +++ OK, passed 100 tests.
  9383. 843.73 s [vector] takeWhile: OK
  9384. 843.73 s [vector] +++ OK, passed 100 tests.
  9385. 843.73 s [vector] dropWhile: OK
  9386. 843.73 s [vector] +++ OK, passed 100 tests.
  9387. 843.73 s [vector] partition: OK
  9388. 843.73 s [vector] +++ OK, passed 100 tests.
  9389. 843.73 s [vector] partitionWith: OK
  9390. 843.73 s [vector] +++ OK, passed 100 tests.
  9391. 843.73 s [vector] span: OK
  9392. 843.74 s [vector] +++ OK, passed 100 tests.
  9393. 843.74 s [vector] break: OK
  9394. 843.74 s [vector] +++ OK, passed 100 tests.
  9395. 843.74 s [vector] spanR: OK
  9396. 843.74 s [vector] +++ OK, passed 100 tests.
  9397. 843.74 s [vector] breakR: OK
  9398. 843.74 s [vector] +++ OK, passed 100 tests.
  9399. 843.74 s [vector] groupBy: OK
  9400. 843.74 s [vector] +++ OK, passed 100 tests.
  9401. 843.74 s [vector] elem: OK
  9402. 843.74 s [vector] +++ OK, passed 100 tests.
  9403. 843.74 s [vector] notElem: OK
  9404. 843.74 s [vector] +++ OK, passed 100 tests.
  9405. 843.74 s [vector] find: OK
  9406. 843.74 s [vector] +++ OK, passed 100 tests.
  9407. 843.74 s [vector] findIndex: OK
  9408. 843.74 s [vector] +++ OK, passed 100 tests.
  9409. 843.74 s [vector] findIndexR: OK
  9410. 843.74 s [vector] +++ OK, passed 100 tests.
  9411. 843.74 s [vector] findIndices: OK
  9412. 843.74 s [vector] +++ OK, passed 100 tests.
  9413. 843.75 s [vector] elemIndex: OK
  9414. 843.75 s [vector] +++ OK, passed 100 tests.
  9415. 843.75 s [vector] elemIndices: OK
  9416. 843.75 s [vector] +++ OK, passed 100 tests.
  9417. 843.75 s [vector] foldl: OK
  9418. 843.75 s [vector] +++ OK, passed 100 tests.
  9419. 843.75 s [vector] foldl1: OK
  9420. 843.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9421. 843.76 s [vector] foldl': OK
  9422. 843.76 s [vector] +++ OK, passed 100 tests.
  9423. 843.76 s [vector] foldl1': OK
  9424. 843.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9425. 843.76 s [vector] foldr: OK
  9426. 843.76 s [vector] +++ OK, passed 100 tests.
  9427. 843.76 s [vector] foldr1: OK
  9428. 843.76 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9429. 843.77 s [vector] foldr': OK
  9430. 843.77 s [vector] +++ OK, passed 100 tests.
  9431. 843.77 s [vector] foldr1': OK
  9432. 843.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9433. 843.77 s [vector] ifoldl: OK
  9434. 843.77 s [vector] +++ OK, passed 100 tests.
  9435. 843.78 s [vector] ifoldl': OK
  9436. 843.78 s [vector] +++ OK, passed 100 tests.
  9437. 843.78 s [vector] ifoldr: OK
  9438. 843.78 s [vector] +++ OK, passed 100 tests.
  9439. 843.78 s [vector] ifoldr': OK
  9440. 843.78 s [vector] +++ OK, passed 100 tests.
  9441. 843.79 s [vector] ifoldM: OK
  9442. 843.79 s [vector] +++ OK, passed 100 tests.
  9443. 843.80 s [vector] ifoldM': OK
  9444. 843.80 s [vector] +++ OK, passed 100 tests.
  9445. 843.82 s [vector] ifoldM_: OK (0.02s)
  9446. 843.82 s [vector] +++ OK, passed 100 tests.
  9447. 843.82 s [vector] ifoldM'_: OK (0.02s)
  9448. 843.82 s [vector] +++ OK, passed 100 tests.
  9449. 843.82 s [vector] all: OK
  9450. 843.82 s [vector] +++ OK, passed 100 tests.
  9451. 843.82 s [vector] any: OK
  9452. 843.83 s [vector] +++ OK, passed 100 tests.
  9453. 843.83 s [vector] prescanl: OK
  9454. 843.83 s [vector] +++ OK, passed 100 tests.
  9455. 843.84 s [vector] prescanl': OK
  9456. 843.84 s [vector] +++ OK, passed 100 tests.
  9457. 843.84 s [vector] postscanl: OK
  9458. 843.84 s [vector] +++ OK, passed 100 tests.
  9459. 843.84 s [vector] postscanl': OK
  9460. 843.84 s [vector] +++ OK, passed 100 tests.
  9461. 843.85 s [vector] scanl: OK
  9462. 843.85 s [vector] +++ OK, passed 100 tests.
  9463. 843.85 s [vector] scanl': OK
  9464. 843.85 s [vector] +++ OK, passed 100 tests.
  9465. 843.85 s [vector] scanl1: OK
  9466. 843.86 s [vector] +++ OK, passed 100 tests.
  9467. 843.86 s [vector] scanl1': OK
  9468. 843.86 s [vector] +++ OK, passed 100 tests.
  9469. 843.86 s [vector] iscanl: OK
  9470. 843.86 s [vector] +++ OK, passed 100 tests.
  9471. 843.87 s [vector] iscanl': OK
  9472. 843.87 s [vector] +++ OK, passed 100 tests.
  9473. 843.87 s [vector] prescanr: OK
  9474. 843.87 s [vector] +++ OK, passed 100 tests.
  9475. 843.88 s [vector] prescanr': OK
  9476. 843.88 s [vector] +++ OK, passed 100 tests.
  9477. 843.88 s [vector] postscanr: OK
  9478. 843.88 s [vector] +++ OK, passed 100 tests.
  9479. 843.88 s [vector] postscanr': OK
  9480. 843.88 s [vector] +++ OK, passed 100 tests.
  9481. 843.89 s [vector] scanr: OK
  9482. 843.89 s [vector] +++ OK, passed 100 tests.
  9483. 843.89 s [vector] scanr': OK
  9484. 843.89 s [vector] +++ OK, passed 100 tests.
  9485. 843.90 s [vector] scanr1: OK
  9486. 843.90 s [vector] +++ OK, passed 100 tests.
  9487. 843.90 s [vector] scanr1': OK
  9488. 843.90 s [vector] +++ OK, passed 100 tests.
  9489. 843.90 s [vector] iscanr: OK
  9490. 843.91 s [vector] +++ OK, passed 100 tests.
  9491. 843.91 s [vector] iscanr': OK
  9492. 843.91 s [vector] +++ OK, passed 100 tests.
  9493. 843.91 s [vector] mut_read: OK
  9494. 843.91 s [vector] +++ OK, passed 100 tests; 27 discarded.
  9495. 843.91 s [vector] mut_write: OK
  9496. 843.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9497. 843.91 s [vector] mut_modify: OK
  9498. 843.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9499. 843.92 s [vector] mut_generate: OK
  9500. 843.92 s [vector] +++ OK, passed 100 tests.
  9501. 843.94 s [vector] mut_generateM: OK (0.01s)
  9502. 843.94 s [vector] +++ OK, passed 100 tests.
  9503. 843.96 s [vector] mut_mapM_: OK (0.02s)
  9504. 843.96 s [vector] +++ OK, passed 100 tests.
  9505. 844.00 s [vector] mut_imapM_: OK (0.04s)
  9506. 844.00 s [vector] +++ OK, passed 100 tests.
  9507. 844.00 s [vector] mut_forM_: OK (0.02s)
  9508. 844.00 s [vector] +++ OK, passed 100 tests.
  9509. 844.03 s [vector] mut_iforM_: OK (0.03s)
  9510. 844.03 s [vector] +++ OK, passed 100 tests.
  9511. 844.04 s [vector] mut_foldr: OK
  9512. 844.04 s [vector] +++ OK, passed 100 tests.
  9513. 844.04 s [vector] mut_foldr': OK
  9514. 844.04 s [vector] +++ OK, passed 100 tests.
  9515. 844.05 s [vector] mut_foldl: OK
  9516. 844.05 s [vector] +++ OK, passed 100 tests.
  9517. 844.06 s [vector] mut_foldl': OK
  9518. 844.06 s [vector] +++ OK, passed 100 tests.
  9519. 844.06 s [vector] mut_ifoldr: OK
  9520. 844.06 s [vector] +++ OK, passed 100 tests.
  9521. 844.06 s [vector] mut_ifoldr': OK
  9522. 844.06 s [vector] +++ OK, passed 100 tests.
  9523. 844.06 s [vector] mut_ifoldl: OK
  9524. 844.07 s [vector] +++ OK, passed 100 tests.
  9525. 844.07 s [vector] mut_ifoldl': OK
  9526. 844.07 s [vector] +++ OK, passed 100 tests.
  9527. 844.08 s [vector] mut_foldM: OK
  9528. 844.08 s [vector] +++ OK, passed 100 tests.
  9529. 844.08 s [vector] mut_foldM': OK
  9530. 844.08 s [vector] +++ OK, passed 100 tests.
  9531. 844.08 s [vector] mut_foldrM: OK
  9532. 844.08 s [vector] +++ OK, passed 100 tests.
  9533. 844.08 s [vector] mut_foldrM': OK
  9534. 844.08 s [vector] +++ OK, passed 100 tests.
  9535. 844.09 s [vector] mut_ifoldM: OK
  9536. 844.09 s [vector] +++ OK, passed 100 tests.
  9537. 844.10 s [vector] mut_ifoldM': OK
  9538. 844.10 s [vector] +++ OK, passed 100 tests.
  9539. 844.10 s [vector] mut_ifoldrM: OK
  9540. 844.10 s [vector] +++ OK, passed 100 tests.
  9541. 844.10 s [vector] mut_ifoldrM': OK
  9542. 844.10 s [vector] +++ OK, passed 100 tests.
  9543. 844.10 s [vector] compare: OK
  9544. 844.10 s [vector] +++ OK, passed 100 tests.
  9545. 844.10 s [vector] maximum: OK
  9546. 844.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9547. 844.10 s [vector] minimum: OK
  9548. 844.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9549. 844.10 s [vector] minIndex: OK
  9550. 844.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9551. 844.10 s [vector] maxIndex: OK
  9552. 844.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9553. 844.11 s [vector] maximumBy: OK
  9554. 844.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9555. 844.11 s [vector] minimumBy: OK
  9556. 844.11 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9557. 844.11 s [vector] maximumOn: OK
  9558. 844.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9559. 844.11 s [vector] minimumOn: OK
  9560. 844.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9561. 844.11 s [vector] maxIndexBy: OK
  9562. 844.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9563. 844.11 s [vector] minIndexBy: OK
  9564. 844.11 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9565. 844.11 s [vector] ListFirstMaxIndexWins: OK
  9566. 844.11 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9567. 844.11 s [vector] FalseListFirstMaxIndexWins: OK
  9568. 844.11 s [vector] +++ OK, failed as expected. (after 1 test):
  9569. 844.11 s [vector] Exception:
  9570. 844.11 s [vector] Prelude.foldr1: empty list
  9571. 844.11 s [vector] CallStack (from HasCallStack):
  9572. 844.11 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9573. 844.11 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9574. 844.11 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9575. 844.11 s [vector] []
  9576. 844.11 s [vector] zip: OK
  9577. 844.11 s [vector] +++ OK, passed 100 tests.
  9578. 844.12 s [vector] zip3: OK
  9579. 844.12 s [vector] +++ OK, passed 100 tests.
  9580. 844.12 s [vector] unzip: OK
  9581. 844.12 s [vector] +++ OK, passed 100 tests.
  9582. 844.12 s [vector] unzip3: OK
  9583. 844.12 s [vector] +++ OK, passed 100 tests.
  9584. 844.12 s [vector] indexed: OK
  9585. 844.12 s [vector] +++ OK, passed 100 tests.
  9586. 844.12 s [vector] update: OK
  9587. 844.12 s [vector] +++ OK, passed 100 tests.
  9588. 844.12 s [vector] mempty: OK
  9589. 844.12 s [vector] +++ OK, passed 1 test.
  9590. 844.12 s [vector] mappend: OK
  9591. 844.12 s [vector] +++ OK, passed 100 tests.
  9592. 844.14 s [vector] mconcat: OK (0.01s)
  9593. 844.14 s [vector] +++ OK, passed 100 tests.
  9594. 844.14 s [vector] glength: OK
  9595. 844.14 s [vector] +++ OK, passed 100 tests.
  9596. 844.14 s [vector] sum: OK
  9597. 844.14 s [vector] +++ OK, passed 100 tests.
  9598. 844.14 s [vector] product: OK
  9599. 844.14 s [vector] +++ OK, passed 100 tests.
  9600. 844.14 s [vector] enumFromN: OK
  9601. 844.14 s [vector] +++ OK, passed 100 tests.
  9602. 844.14 s [vector] enumFromThenN: OK
  9603. 844.14 s [vector] +++ OK, passed 100 tests.
  9604. 844.15 s [vector] enumFromTo: OK
  9605. 844.15 s [vector] +++ OK, passed 100 tests.
  9606. 844.15 s [vector] enumFromThenTo: OK
  9607. 844.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9608. 844.15 s [vector] (Float)
  9609. 844.15 s [vector] fromList.toList == id: OK
  9610. 844.15 s [vector] +++ OK, passed 100 tests.
  9611. 844.15 s [vector] toList.fromList == id: OK
  9612. 844.15 s [vector] +++ OK, passed 100 tests.
  9613. 844.15 s [vector] unstream.stream == id: OK
  9614. 844.15 s [vector] +++ OK, passed 100 tests.
  9615. 844.15 s [vector] stream.unstream == id: OK
  9616. 844.15 s [vector] +++ OK, passed 100 tests.
  9617. 844.15 s [vector] eq: OK
  9618. 844.15 s [vector] +++ OK, passed 100 tests.
  9619. 844.15 s [vector] length: OK
  9620. 844.15 s [vector] +++ OK, passed 100 tests.
  9621. 844.15 s [vector] null: OK
  9622. 844.15 s [vector] +++ OK, passed 100 tests.
  9623. 844.15 s [vector] index: OK
  9624. 844.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9625. 844.15 s [vector] safeIndex: OK
  9626. 844.15 s [vector] +++ OK, passed 100 tests.
  9627. 844.15 s [vector] head: OK
  9628. 844.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9629. 844.15 s [vector] last: OK
  9630. 844.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9631. 844.15 s [vector] unsafeIndex: OK
  9632. 844.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9633. 844.15 s [vector] unsafeHead: OK
  9634. 844.15 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9635. 844.15 s [vector] unsafeLast: OK
  9636. 844.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9637. 844.15 s [vector] slice: OK
  9638. 844.15 s [vector] +++ OK, passed 100 tests.
  9639. 844.15 s [vector] init: OK
  9640. 844.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9641. 844.16 s [vector] tail: OK
  9642. 844.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9643. 844.16 s [vector] take: OK
  9644. 844.16 s [vector] +++ OK, passed 100 tests.
  9645. 844.16 s [vector] drop: OK
  9646. 844.16 s [vector] +++ OK, passed 100 tests.
  9647. 844.16 s [vector] splitAt: OK
  9648. 844.16 s [vector] +++ OK, passed 100 tests.
  9649. 844.16 s [vector] empty: OK
  9650. 844.16 s [vector] +++ OK, passed 1 test.
  9651. 844.16 s [vector] singleton: OK
  9652. 844.16 s [vector] +++ OK, passed 100 tests.
  9653. 844.16 s [vector] replicate: OK
  9654. 844.16 s [vector] +++ OK, passed 100 tests.
  9655. 844.16 s [vector] generate: OK
  9656. 844.16 s [vector] +++ OK, passed 100 tests.
  9657. 844.18 s [vector] iterateN: OK
  9658. 844.18 s [vector] +++ OK, passed 100 tests.
  9659. 844.20 s [vector] iterateNM: OK (0.03s)
  9660. 844.20 s [vector] +++ OK, passed 100 tests.
  9661. 844.22 s [vector] generateM: OK (0.02s)
  9662. 844.22 s [vector] +++ OK, passed 100 tests.
  9663. 844.23 s [vector] replicateM: OK (0.02s)
  9664. 844.23 s [vector] +++ OK, passed 100 tests.
  9665. 844.23 s [vector] create: OK
  9666. 844.23 s [vector] +++ OK, passed 100 tests.
  9667. 844.23 s [vector] createT: OK
  9668. 844.23 s [vector] +++ OK, passed 100 tests.
  9669. 844.23 s [vector] unfoldr: OK
  9670. 844.23 s [vector] +++ OK, passed 100 tests.
  9671. 844.23 s [vector] unfoldrN: OK
  9672. 844.24 s [vector] +++ OK, passed 100 tests.
  9673. 844.24 s [vector] unfoldrExactN: OK
  9674. 844.24 s [vector] +++ OK, passed 100 tests.
  9675. 844.24 s [vector] unfoldrM: OK
  9676. 844.24 s [vector] +++ OK, passed 100 tests.
  9677. 844.24 s [vector] unfoldrNM: OK
  9678. 844.24 s [vector] +++ OK, passed 100 tests.
  9679. 844.28 s [vector] unfoldrExactNM: OK (0.03s)
  9680. 844.28 s [vector] +++ OK, passed 100 tests.
  9681. 844.28 s [vector] constructN: OK
  9682. 844.28 s [vector] +++ OK, passed 100 tests.
  9683. 844.29 s [vector] constructrN: OK
  9684. 844.29 s [vector] +++ OK, passed 100 tests.
  9685. 844.29 s [vector] cons: OK
  9686. 844.29 s [vector] +++ OK, passed 100 tests.
  9687. 844.30 s [vector] snoc: OK
  9688. 844.30 s [vector] +++ OK, passed 100 tests.
  9689. 844.30 s [vector] append: OK
  9690. 844.30 s [vector] +++ OK, passed 100 tests.
  9691. 844.32 s [vector] concat: OK (0.02s)
  9692. 844.76 s [vector] +++ OK, passed 100 tests.
  9693. 844.76 s [vector] force: OK
  9694. 844.76 s [vector] +++ OK, passed 100 tests.
  9695. 844.76 s [vector] upd: OK
  9696. 844.76 s [vector] +++ OK, passed 100 tests.
  9697. 844.76 s [vector] accum: OK
  9698. 844.76 s [vector] +++ OK, passed 100 tests.
  9699. 844.76 s [vector] reverse: OK
  9700. 844.76 s [vector] +++ OK, passed 100 tests.
  9701. 844.76 s [vector] backpermute: OK
  9702. 844.76 s [vector] +++ OK, passed 100 tests.
  9703. 844.76 s [vector] map: OK
  9704. 844.76 s [vector] +++ OK, passed 100 tests.
  9705. 844.76 s [vector] imap: OK
  9706. 844.76 s [vector] +++ OK, passed 100 tests.
  9707. 844.76 s [vector] concatMap: OK
  9708. 844.76 s [vector] +++ OK, passed 100 tests.
  9709. 844.76 s [vector] mapM: OK
  9710. 844.76 s [vector] +++ OK, passed 100 tests.
  9711. 844.76 s [vector] mapM_: OK (0.03s)
  9712. 844.76 s [vector] +++ OK, passed 100 tests.
  9713. 844.76 s [vector] forM: OK
  9714. 844.76 s [vector] +++ OK, passed 100 tests.
  9715. 844.76 s [vector] forM_: OK (0.03s)
  9716. 844.76 s [vector] +++ OK, passed 100 tests.
  9717. 844.76 s [vector] imapM: OK
  9718. 844.76 s [vector] +++ OK, passed 100 tests.
  9719. 844.76 s [vector] imapM_: OK (0.04s)
  9720. 844.76 s [vector] +++ OK, passed 100 tests.
  9721. 844.76 s [vector] zipWith: OK
  9722. 844.76 s [vector] +++ OK, passed 100 tests.
  9723. 844.76 s [vector] zipWith3: OK
  9724. 844.76 s [vector] +++ OK, passed 100 tests.
  9725. 844.76 s [vector] izipWith: OK
  9726. 844.76 s [vector] +++ OK, passed 100 tests.
  9727. 844.77 s [vector] izipWith3: OK
  9728. 844.77 s [vector] +++ OK, passed 100 tests.
  9729. 844.77 s [vector] izipWithM: OK
  9730. 844.77 s [vector] +++ OK, passed 100 tests.
  9731. 844.77 s [vector] izipWithM_: OK (0.03s)
  9732. 844.77 s [vector] +++ OK, passed 100 tests.
  9733. 844.77 s [vector] zipWithM: OK
  9734. 844.77 s [vector] +++ OK, passed 100 tests.
  9735. 844.77 s [vector] zipWithM_: OK (0.03s)
  9736. 844.77 s [vector] +++ OK, passed 100 tests.
  9737. 844.77 s [vector] filter: OK
  9738. 844.77 s [vector] +++ OK, passed 100 tests.
  9739. 844.77 s [vector] ifilter: OK
  9740. 844.77 s [vector] +++ OK, passed 100 tests.
  9741. 844.77 s [vector] filterM: OK (0.04s)
  9742. 844.77 s [vector] +++ OK, passed 100 tests.
  9743. 844.77 s [vector] uniq: OK
  9744. 844.77 s [vector] +++ OK, passed 100 tests.
  9745. 844.77 s [vector] mapMaybe: OK
  9746. 844.77 s [vector] +++ OK, passed 100 tests.
  9747. 844.77 s [vector] imapMaybe: OK
  9748. 844.77 s [vector] +++ OK, passed 100 tests.
  9749. 844.77 s [vector] takeWhile: OK
  9750. 844.77 s [vector] +++ OK, passed 100 tests.
  9751. 844.77 s [vector] dropWhile: OK
  9752. 844.77 s [vector] +++ OK, passed 100 tests.
  9753. 844.77 s [vector] partition: OK
  9754. 844.77 s [vector] +++ OK, passed 100 tests.
  9755. 844.77 s [vector] partitionWith: OK
  9756. 844.77 s [vector] +++ OK, passed 100 tests.
  9757. 844.77 s [vector] span: OK
  9758. 844.77 s [vector] +++ OK, passed 100 tests.
  9759. 844.77 s [vector] break: OK
  9760. 844.77 s [vector] +++ OK, passed 100 tests.
  9761. 844.77 s [vector] spanR: OK
  9762. 844.77 s [vector] +++ OK, passed 100 tests.
  9763. 844.77 s [vector] breakR: OK
  9764. 844.77 s [vector] +++ OK, passed 100 tests.
  9765. 844.77 s [vector] groupBy: OK
  9766. 844.77 s [vector] +++ OK, passed 100 tests.
  9767. 844.77 s [vector] elem: OK
  9768. 844.77 s [vector] +++ OK, passed 100 tests.
  9769. 844.77 s [vector] notElem: OK
  9770. 844.77 s [vector] +++ OK, passed 100 tests.
  9771. 844.77 s [vector] find: OK
  9772. 844.77 s [vector] +++ OK, passed 100 tests.
  9773. 844.77 s [vector] findIndex: OK
  9774. 844.77 s [vector] +++ OK, passed 100 tests.
  9775. 844.77 s [vector] findIndexR: OK
  9776. 844.77 s [vector] +++ OK, passed 100 tests.
  9777. 844.77 s [vector] findIndices: OK
  9778. 844.77 s [vector] +++ OK, passed 100 tests.
  9779. 844.77 s [vector] elemIndex: OK
  9780. 844.77 s [vector] +++ OK, passed 100 tests.
  9781. 844.77 s [vector] elemIndices: OK
  9782. 844.77 s [vector] +++ OK, passed 100 tests.
  9783. 844.77 s [vector] foldl: OK
  9784. 844.77 s [vector] +++ OK, passed 100 tests.
  9785. 844.77 s [vector] foldl1: OK
  9786. 844.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9787. 844.77 s [vector] foldl': OK
  9788. 844.77 s [vector] +++ OK, passed 100 tests.
  9789. 844.77 s [vector] foldl1': OK
  9790. 844.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9791. 844.77 s [vector] foldr: OK
  9792. 844.77 s [vector] +++ OK, passed 100 tests.
  9793. 844.77 s [vector] foldr1: OK
  9794. 844.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9795. 844.77 s [vector] foldr': OK
  9796. 844.77 s [vector] +++ OK, passed 100 tests.
  9797. 844.77 s [vector] foldr1': OK
  9798. 844.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9799. 844.77 s [vector] ifoldl: OK
  9800. 844.77 s [vector] +++ OK, passed 100 tests.
  9801. 844.78 s [vector] ifoldl': OK (0.02s)
  9802. 844.78 s [vector] +++ OK, passed 100 tests.
  9803. 844.80 s [vector] ifoldr: OK (0.02s)
  9804. 844.80 s [vector] +++ OK, passed 100 tests.
  9805. 844.82 s [vector] ifoldr': OK (0.02s)
  9806. 844.82 s [vector] +++ OK, passed 100 tests.
  9807. 844.84 s [vector] ifoldM: OK (0.02s)
  9808. 844.84 s [vector] +++ OK, passed 100 tests.
  9809. 844.86 s [vector] ifoldM': OK (0.02s)
  9810. 844.86 s [vector] +++ OK, passed 100 tests.
  9811. 844.90 s [vector] ifoldM_: OK (0.04s)
  9812. 844.90 s [vector] +++ OK, passed 100 tests.
  9813. 844.93 s [vector] ifoldM'_: OK (0.04s)
  9814. 844.93 s [vector] +++ OK, passed 100 tests.
  9815. 844.93 s [vector] all: OK
  9816. 844.93 s [vector] +++ OK, passed 100 tests.
  9817. 844.93 s [vector] any: OK
  9818. 844.94 s [vector] +++ OK, passed 100 tests.
  9819. 844.94 s [vector] prescanl: OK
  9820. 844.94 s [vector] +++ OK, passed 100 tests.
  9821. 844.94 s [vector] prescanl': OK
  9822. 844.94 s [vector] +++ OK, passed 100 tests.
  9823. 844.96 s [vector] postscanl: OK
  9824. 844.96 s [vector] +++ OK, passed 100 tests.
  9825. 844.96 s [vector] postscanl': OK
  9826. 844.96 s [vector] +++ OK, passed 100 tests.
  9827. 844.98 s [vector] scanl: OK
  9828. 844.98 s [vector] +++ OK, passed 100 tests.
  9829. 844.98 s [vector] scanl': OK
  9830. 844.98 s [vector] +++ OK, passed 100 tests.
  9831. 844.98 s [vector] scanl1: OK
  9832. 844.98 s [vector] +++ OK, passed 100 tests.
  9833. 845.00 s [vector] scanl1': OK
  9834. 845.00 s [vector] +++ OK, passed 100 tests.
  9835. 845.00 s [vector] iscanl: OK
  9836. 845.00 s [vector] +++ OK, passed 100 tests.
  9837. 845.02 s [vector] iscanl': OK
  9838. 845.02 s [vector] +++ OK, passed 100 tests.
  9839. 845.03 s [vector] prescanr: OK
  9840. 845.03 s [vector] +++ OK, passed 100 tests.
  9841. 845.04 s [vector] prescanr': OK
  9842. 845.04 s [vector] +++ OK, passed 100 tests.
  9843. 845.05 s [vector] postscanr: OK
  9844. 845.05 s [vector] +++ OK, passed 100 tests.
  9845. 845.05 s [vector] postscanr': OK
  9846. 845.05 s [vector] +++ OK, passed 100 tests.
  9847. 845.05 s [vector] scanr: OK
  9848. 845.05 s [vector] +++ OK, passed 100 tests.
  9849. 845.06 s [vector] scanr': OK
  9850. 845.06 s [vector] +++ OK, passed 100 tests.
  9851. 845.07 s [vector] scanr1: OK
  9852. 845.08 s [vector] +++ OK, passed 100 tests.
  9853. 845.08 s [vector] scanr1': OK
  9854. 845.09 s [vector] +++ OK, passed 100 tests.
  9855. 845.10 s [vector] iscanr: OK (0.01s)
  9856. 845.10 s [vector] +++ OK, passed 100 tests.
  9857. 845.10 s [vector] iscanr': OK (0.01s)
  9858. 845.10 s [vector] +++ OK, passed 100 tests.
  9859. 845.10 s [vector] mut_read: OK
  9860. 845.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9861. 845.10 s [vector] mut_write: OK
  9862. 845.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9863. 845.10 s [vector] mut_modify: OK
  9864. 845.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9865. 845.10 s [vector] mut_generate: OK
  9866. 845.10 s [vector] +++ OK, passed 100 tests.
  9867. 845.11 s [vector] mut_generateM: OK (0.01s)
  9868. 845.11 s [vector] +++ OK, passed 100 tests.
  9869. 845.16 s [vector] mut_mapM_: OK (0.03s)
  9870. 845.16 s [vector] +++ OK, passed 100 tests.
  9871. 845.18 s [vector] mut_imapM_: OK (0.03s)
  9872. 845.18 s [vector] +++ OK, passed 100 tests.
  9873. 845.22 s [vector] mut_forM_: OK (0.03s)
  9874. 845.23 s [vector] +++ OK, passed 100 tests.
  9875. 845.28 s [vector] mut_iforM_: OK (0.06s)
  9876. 845.28 s [vector] +++ OK, passed 100 tests.
  9877. 845.30 s [vector] mut_foldr: OK (0.01s)
  9878. 845.30 s [vector] +++ OK, passed 100 tests.
  9879. 845.30 s [vector] mut_foldr': OK (0.01s)
  9880. 845.30 s [vector] +++ OK, passed 100 tests.
  9881. 845.31 s [vector] mut_foldl: OK
  9882. 845.31 s [vector] +++ OK, passed 100 tests.
  9883. 845.32 s [vector] mut_foldl': OK
  9884. 845.32 s [vector] +++ OK, passed 100 tests.
  9885. 845.32 s [vector] mut_ifoldr: OK
  9886. 845.33 s [vector] +++ OK, passed 100 tests.
  9887. 845.34 s [vector] mut_ifoldr': OK
  9888. 845.34 s [vector] +++ OK, passed 100 tests.
  9889. 845.36 s [vector] mut_ifoldl: OK (0.02s)
  9890. 845.36 s [vector] +++ OK, passed 100 tests.
  9891. 845.39 s [vector] mut_ifoldl': OK (0.02s)
  9892. 845.39 s [vector] +++ OK, passed 100 tests.
  9893. 845.40 s [vector] mut_foldM: OK (0.02s)
  9894. 845.40 s [vector] +++ OK, passed 100 tests.
  9895. 845.42 s [vector] mut_foldM': OK (0.02s)
  9896. 845.42 s [vector] +++ OK, passed 100 tests.
  9897. 845.42 s [vector] mut_foldrM: OK (0.01s)
  9898. 845.42 s [vector] +++ OK, passed 100 tests.
  9899. 845.43 s [vector] mut_foldrM': OK
  9900. 845.44 s [vector] +++ OK, passed 100 tests.
  9901. 845.45 s [vector] mut_ifoldM: OK (0.01s)
  9902. 845.45 s [vector] +++ OK, passed 100 tests.
  9903. 845.45 s [vector] mut_ifoldM': OK
  9904. 845.47 s [vector] +++ OK, passed 100 tests.
  9905. 845.47 s [vector] mut_ifoldrM: OK
  9906. 845.47 s [vector] +++ OK, passed 100 tests.
  9907. 845.47 s [vector] mut_ifoldrM': OK (0.01s)
  9908. 845.47 s [vector] +++ OK, passed 100 tests.
  9909. 845.48 s [vector] compare: OK
  9910. 845.48 s [vector] +++ OK, passed 100 tests.
  9911. 845.48 s [vector] maximum: OK
  9912. 845.48 s [vector] +++ OK, passed 100 tests; 26 discarded.
  9913. 845.48 s [vector] minimum: OK
  9914. 845.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9915. 845.48 s [vector] minIndex: OK
  9916. 845.48 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9917. 845.48 s [vector] maxIndex: OK
  9918. 845.48 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9919. 845.48 s [vector] maximumBy: OK
  9920. 845.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9921. 845.48 s [vector] minimumBy: OK
  9922. 845.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9923. 845.48 s [vector] maximumOn: OK
  9924. 845.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9925. 845.48 s [vector] minimumOn: OK
  9926. 845.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9927. 845.49 s [vector] maxIndexBy: OK
  9928. 845.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9929. 845.49 s [vector] minIndexBy: OK
  9930. 845.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9931. 845.50 s [vector] ListFirstMaxIndexWins: OK
  9932. 845.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9933. 845.51 s [vector] FalseListFirstMaxIndexWins: OK
  9934. 845.51 s [vector] +++ OK, failed as expected. (after 1 test):
  9935. 845.51 s [vector] Exception:
  9936. 845.51 s [vector] Prelude.foldr1: empty list
  9937. 845.51 s [vector] CallStack (from HasCallStack):
  9938. 845.51 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9939. 845.51 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9940. 845.51 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9941. 845.51 s [vector] []
  9942. 845.51 s [vector] zip: OK
  9943. 845.51 s [vector] +++ OK, passed 100 tests.
  9944. 845.51 s [vector] zip3: OK (0.01s)
  9945. 845.51 s [vector] +++ OK, passed 100 tests.
  9946. 845.51 s [vector] unzip: OK
  9947. 845.51 s [vector] +++ OK, passed 100 tests.
  9948. 845.51 s [vector] unzip3: OK
  9949. 845.52 s [vector] +++ OK, passed 100 tests.
  9950. 845.52 s [vector] indexed: OK
  9951. 845.52 s [vector] +++ OK, passed 100 tests.
  9952. 845.53 s [vector] update: OK
  9953. 845.53 s [vector] +++ OK, passed 100 tests.
  9954. 845.53 s [vector] mempty: OK
  9955. 845.53 s [vector] +++ OK, passed 1 test.
  9956. 845.53 s [vector] mappend: OK
  9957. 845.54 s [vector] +++ OK, passed 100 tests.
  9958. 845.55 s [vector] mconcat: OK (0.02s)
  9959. 845.55 s [vector] +++ OK, passed 100 tests.
  9960. 845.55 s [vector] glength: OK
  9961. 845.55 s [vector] +++ OK, passed 100 tests.
  9962. 845.55 s [vector] sum: OK
  9963. 845.55 s [vector] +++ OK, passed 100 tests.
  9964. 845.55 s [vector] product: OK
  9965. 845.55 s [vector] +++ OK, passed 100 tests.
  9966. 845.55 s [vector] enumFromN: OK
  9967. 845.55 s [vector] +++ OK, passed 100 tests.
  9968. 845.55 s [vector] enumFromThenN: OK
  9969. 845.55 s [vector] +++ OK, passed 100 tests.
  9970. 845.55 s [vector] enumFromTo: OK
  9971. 845.56 s [vector] +++ OK, passed 100 tests.
  9972. 845.56 s [vector] enumFromThenTo: OK
  9973. 845.56 s [vector] +++ OK, passed 100 tests; 3 discarded.
  9974. 845.56 s [vector] (Double)
  9975. 845.56 s [vector] fromList.toList == id: OK
  9976. 845.56 s [vector] +++ OK, passed 100 tests.
  9977. 845.56 s [vector] toList.fromList == id: OK
  9978. 845.56 s [vector] +++ OK, passed 100 tests.
  9979. 845.56 s [vector] unstream.stream == id: OK
  9980. 845.56 s [vector] +++ OK, passed 100 tests.
  9981. 845.56 s [vector] stream.unstream == id: OK
  9982. 845.56 s [vector] +++ OK, passed 100 tests.
  9983. 845.56 s [vector] eq: OK
  9984. 845.56 s [vector] +++ OK, passed 100 tests.
  9985. 845.56 s [vector] length: OK
  9986. 845.56 s [vector] +++ OK, passed 100 tests.
  9987. 845.56 s [vector] null: OK
  9988. 845.56 s [vector] +++ OK, passed 100 tests.
  9989. 845.56 s [vector] index: OK
  9990. 845.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9991. 845.56 s [vector] safeIndex: OK
  9992. 845.56 s [vector] +++ OK, passed 100 tests.
  9993. 845.56 s [vector] head: OK
  9994. 845.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9995. 845.57 s [vector] last: OK
  9996. 845.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9997. 845.57 s [vector] unsafeIndex: OK
  9998. 845.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9999. 845.57 s [vector] unsafeHead: OK
  10000. 845.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10001. 845.57 s [vector] unsafeLast: OK
  10002. 845.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10003. 845.57 s [vector] slice: OK
  10004. 845.57 s [vector] +++ OK, passed 100 tests.
  10005. 845.57 s [vector] init: OK
  10006. 845.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10007. 845.57 s [vector] tail: OK
  10008. 845.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10009. 845.57 s [vector] take: OK
  10010. 845.57 s [vector] +++ OK, passed 100 tests.
  10011. 845.57 s [vector] drop: OK
  10012. 845.57 s [vector] +++ OK, passed 100 tests.
  10013. 845.57 s [vector] splitAt: OK
  10014. 845.57 s [vector] +++ OK, passed 100 tests.
  10015. 845.57 s [vector] empty: OK
  10016. 845.57 s [vector] +++ OK, passed 1 test.
  10017. 845.57 s [vector] singleton: OK
  10018. 845.57 s [vector] +++ OK, passed 100 tests.
  10019. 845.57 s [vector] replicate: OK
  10020. 845.57 s [vector] +++ OK, passed 100 tests.
  10021. 845.58 s [vector] generate: OK
  10022. 845.58 s [vector] +++ OK, passed 100 tests.
  10023. 845.58 s [vector] iterateN: OK
  10024. 845.58 s [vector] +++ OK, passed 100 tests.
  10025. 845.62 s [vector] iterateNM: OK (0.04s)
  10026. 845.62 s [vector] +++ OK, passed 100 tests.
  10027. 845.64 s [vector] generateM: OK (0.02s)
  10028. 845.64 s [vector] +++ OK, passed 100 tests.
  10029. 845.65 s [vector] replicateM: OK
  10030. 845.65 s [vector] +++ OK, passed 100 tests.
  10031. 845.65 s [vector] create: OK
  10032. 845.65 s [vector] +++ OK, passed 100 tests.
  10033. 845.65 s [vector] createT: OK
  10034. 845.65 s [vector] +++ OK, passed 100 tests.
  10035. 845.65 s [vector] unfoldr: OK
  10036. 845.65 s [vector] +++ OK, passed 100 tests.
  10037. 845.65 s [vector] unfoldrN: OK
  10038. 845.65 s [vector] +++ OK, passed 100 tests.
  10039. 845.66 s [vector] unfoldrExactN: OK
  10040. 845.66 s [vector] +++ OK, passed 100 tests.
  10041. 845.66 s [vector] unfoldrM: OK
  10042. 845.66 s [vector] +++ OK, passed 100 tests.
  10043. 845.66 s [vector] unfoldrNM: OK
  10044. 845.66 s [vector] +++ OK, passed 100 tests.
  10045. 845.70 s [vector] unfoldrExactNM: OK (0.03s)
  10046. 845.70 s [vector] +++ OK, passed 100 tests.
  10047. 845.72 s [vector] constructN: OK (0.02s)
  10048. 845.72 s [vector] +++ OK, passed 100 tests.
  10049. 845.73 s [vector] constructrN: OK (0.01s)
  10050. 845.73 s [vector] +++ OK, passed 100 tests.
  10051. 845.73 s [vector] cons: OK
  10052. 845.73 s [vector] +++ OK, passed 100 tests.
  10053. 845.73 s [vector] snoc: OK
  10054. 845.73 s [vector] +++ OK, passed 100 tests.
  10055. 845.73 s [vector] append: OK
  10056. 845.74 s [vector] +++ OK, passed 100 tests.
  10057. 845.75 s [vector] concat: OK (0.02s)
  10058. 845.75 s [vector] +++ OK, passed 100 tests.
  10059. 845.76 s [vector] force: OK
  10060. 845.76 s [vector] +++ OK, passed 100 tests.
  10061. 845.76 s [vector] upd: OK
  10062. 845.76 s [vector] +++ OK, passed 100 tests.
  10063. 845.77 s [vector] accum: OK (0.02s)
  10064. 845.77 s [vector] +++ OK, passed 100 tests.
  10065. 845.78 s [vector] reverse: OK
  10066. 845.78 s [vector] +++ OK, passed 100 tests.
  10067. 845.78 s [vector] backpermute: OK
  10068. 845.78 s [vector] +++ OK, passed 100 tests.
  10069. 845.78 s [vector] map: OK
  10070. 845.80 s [vector] +++ OK, passed 100 tests.
  10071. 845.81 s [vector] imap: OK (0.02s)
  10072. 845.82 s [vector] +++ OK, passed 100 tests.
  10073. 845.82 s [vector] concatMap: OK (0.01s)
  10074. 845.82 s [vector] +++ OK, passed 100 tests.
  10075. 845.84 s [vector] mapM: OK (0.01s)
  10076. 845.84 s [vector] +++ OK, passed 100 tests.
  10077. 845.86 s [vector] mapM_: OK (0.03s)
  10078. 845.86 s [vector] +++ OK, passed 100 tests.
  10079. 845.88 s [vector] forM: OK (0.01s)
  10080. 845.88 s [vector] +++ OK, passed 100 tests.
  10081. 845.92 s [vector] forM_: OK (0.05s)
  10082. 845.92 s [vector] +++ OK, passed 100 tests.
  10083. 845.94 s [vector] imapM: OK (0.01s)
  10084. 845.94 s [vector] +++ OK, passed 100 tests.
  10085. 846.00 s [vector] imapM_: OK (0.05s)
  10086. 846.00 s [vector] +++ OK, passed 100 tests.
  10087. 846.00 s [vector] zipWith: OK (0.01s)
  10088. 846.00 s [vector] +++ OK, passed 100 tests.
  10089. 846.02 s [vector] zipWith3: OK (0.02s)
  10090. 846.02 s [vector] +++ OK, passed 100 tests.
  10091. 846.04 s [vector] izipWith: OK (0.01s)
  10092. 846.04 s [vector] +++ OK, passed 100 tests.
  10093. 846.06 s [vector] izipWith3: OK (0.01s)
  10094. 846.06 s [vector] +++ OK, passed 100 tests.
  10095. 846.06 s [vector] izipWithM: OK (0.01s)
  10096. 846.06 s [vector] +++ OK, passed 100 tests.
  10097. 846.10 s [vector] izipWithM_: OK (0.04s)
  10098. 846.10 s [vector] +++ OK, passed 100 tests.
  10099. 846.12 s [vector] zipWithM: OK (0.01s)
  10100. 846.12 s [vector] +++ OK, passed 100 tests.
  10101. 846.15 s [vector] zipWithM_: OK (0.04s)
  10102. 846.15 s [vector] +++ OK, passed 100 tests.
  10103. 846.15 s [vector] filter: OK
  10104. 846.16 s [vector] +++ OK, passed 100 tests.
  10105. 846.16 s [vector] ifilter: OK
  10106. 846.16 s [vector] +++ OK, passed 100 tests.
  10107. 846.20 s [vector] filterM: OK (0.04s)
  10108. 846.20 s [vector] +++ OK, passed 100 tests.
  10109. 846.21 s [vector] uniq: OK
  10110. 846.21 s [vector] +++ OK, passed 100 tests.
  10111. 846.22 s [vector] mapMaybe: OK
  10112. 846.22 s [vector] +++ OK, passed 100 tests.
  10113. 846.22 s [vector] imapMaybe: OK
  10114. 846.22 s [vector] +++ OK, passed 100 tests.
  10115. 846.22 s [vector] takeWhile: OK
  10116. 846.22 s [vector] +++ OK, passed 100 tests.
  10117. 846.23 s [vector] dropWhile: OK
  10118. 846.23 s [vector] +++ OK, passed 100 tests.
  10119. 846.23 s [vector] partition: OK
  10120. 846.24 s [vector] +++ OK, passed 100 tests.
  10121. 846.24 s [vector] partitionWith: OK
  10122. 846.24 s [vector] +++ OK, passed 100 tests.
  10123. 846.24 s [vector] span: OK
  10124. 846.24 s [vector] +++ OK, passed 100 tests.
  10125. 846.24 s [vector] break: OK
  10126. 846.24 s [vector] +++ OK, passed 100 tests.
  10127. 846.24 s [vector] spanR: OK
  10128. 846.24 s [vector] +++ OK, passed 100 tests.
  10129. 846.25 s [vector] breakR: OK
  10130. 846.25 s [vector] +++ OK, passed 100 tests.
  10131. 846.25 s [vector] groupBy: OK (0.01s)
  10132. 846.25 s [vector] +++ OK, passed 100 tests.
  10133. 846.26 s [vector] elem: OK
  10134. 846.26 s [vector] +++ OK, passed 100 tests.
  10135. 846.26 s [vector] notElem: OK
  10136. 846.26 s [vector] +++ OK, passed 100 tests.
  10137. 846.26 s [vector] find: OK
  10138. 846.26 s [vector] +++ OK, passed 100 tests.
  10139. 846.26 s [vector] findIndex: OK
  10140. 846.26 s [vector] +++ OK, passed 100 tests.
  10141. 846.26 s [vector] findIndexR: OK
  10142. 846.26 s [vector] +++ OK, passed 100 tests.
  10143. 846.27 s [vector] findIndices: OK
  10144. 846.27 s [vector] +++ OK, passed 100 tests.
  10145. 846.27 s [vector] elemIndex: OK
  10146. 846.27 s [vector] +++ OK, passed 100 tests.
  10147. 846.28 s [vector] elemIndices: OK
  10148. 846.28 s [vector] +++ OK, passed 100 tests.
  10149. 846.28 s [vector] foldl: OK (0.01s)
  10150. 846.28 s [vector] +++ OK, passed 100 tests.
  10151. 846.30 s [vector] foldl1: OK
  10152. 846.30 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10153. 846.32 s [vector] foldl': OK (0.01s)
  10154. 846.32 s [vector] +++ OK, passed 100 tests.
  10155. 846.34 s [vector] foldl1': OK (0.01s)
  10156. 846.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10157. 846.34 s [vector] foldr: OK (0.01s)
  10158. 846.34 s [vector] +++ OK, passed 100 tests.
  10159. 846.36 s [vector] foldr1: OK (0.02s)
  10160. 846.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10161. 846.38 s [vector] foldr': OK (0.02s)
  10162. 846.38 s [vector] +++ OK, passed 100 tests.
  10163. 846.40 s [vector] foldr1': OK (0.02s)
  10164. 846.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10165. 846.41 s [vector] ifoldl: OK (0.02s)
  10166. 846.41 s [vector] +++ OK, passed 100 tests.
  10167. 846.44 s [vector] ifoldl': OK (0.02s)
  10168. 846.44 s [vector] +++ OK, passed 100 tests.
  10169. 846.44 s [vector] ifoldr: OK (0.02s)
  10170. 846.44 s [vector] +++ OK, passed 100 tests.
  10171. 846.46 s [vector] ifoldr': OK (0.02s)
  10172. 846.46 s [vector] +++ OK, passed 100 tests.
  10173. 846.48 s [vector] ifoldM: OK (0.01s)
  10174. 846.48 s [vector] +++ OK, passed 100 tests.
  10175. 846.50 s [vector] ifoldM': OK (0.02s)
  10176. 846.50 s [vector] +++ OK, passed 100 tests.
  10177. 846.52 s [vector] ifoldM_: OK (0.04s)
  10178. 846.52 s [vector] +++ OK, passed 100 tests.
  10179. 846.57 s [vector] ifoldM'_: OK (0.05s)
  10180. 846.57 s [vector] +++ OK, passed 100 tests.
  10181. 846.58 s [vector] all: OK
  10182. 846.58 s [vector] +++ OK, passed 100 tests.
  10183. 846.58 s [vector] any: OK
  10184. 846.58 s [vector] +++ OK, passed 100 tests.
  10185. 846.62 s [vector] prescanl: OK (0.03s)
  10186. 846.62 s [vector] +++ OK, passed 100 tests.
  10187. 846.64 s [vector] prescanl': OK (0.02s)
  10188. 846.64 s [vector] +++ OK, passed 100 tests.
  10189. 846.64 s [vector] postscanl: OK (0.01s)
  10190. 846.64 s [vector] +++ OK, passed 100 tests.
  10191. 846.66 s [vector] postscanl': OK (0.01s)
  10192. 846.66 s [vector] +++ OK, passed 100 tests.
  10193. 846.68 s [vector] scanl: OK (0.01s)
  10194. 846.68 s [vector] +++ OK, passed 100 tests.
  10195. 846.68 s [vector] scanl': OK (0.01s)
  10196. 846.68 s [vector] +++ OK, passed 100 tests.
  10197. 846.69 s [vector] scanl1: OK (0.01s)
  10198. 846.69 s [vector] +++ OK, passed 100 tests.
  10199. 846.72 s [vector] scanl1': OK
  10200. 846.72 s [vector] +++ OK, passed 100 tests.
  10201. 846.74 s [vector] iscanl: OK (0.02s)
  10202. 846.74 s [vector] +++ OK, passed 100 tests.
  10203. 846.76 s [vector] iscanl': OK (0.02s)
  10204. 846.76 s [vector] +++ OK, passed 100 tests.
  10205. 846.76 s [vector] prescanr: OK (0.01s)
  10206. 846.76 s [vector] +++ OK, passed 100 tests.
  10207. 846.78 s [vector] prescanr': OK (0.02s)
  10208. 846.78 s [vector] +++ OK, passed 100 tests.
  10209. 846.79 s [vector] postscanr: OK (0.02s)
  10210. 846.79 s [vector] +++ OK, passed 100 tests.
  10211. 846.82 s [vector] postscanr': OK
  10212. 846.82 s [vector] +++ OK, passed 100 tests.
  10213. 846.82 s [vector] scanr: OK (0.02s)
  10214. 846.82 s [vector] +++ OK, passed 100 tests.
  10215. 846.84 s [vector] scanr': OK (0.01s)
  10216. 846.84 s [vector] +++ OK, passed 100 tests.
  10217. 846.86 s [vector] scanr1: OK (0.02s)
  10218. 846.86 s [vector] +++ OK, passed 100 tests.
  10219. 846.88 s [vector] scanr1': OK (0.01s)
  10220. 846.88 s [vector] +++ OK, passed 100 tests.
  10221. 846.88 s [vector] iscanr: OK (0.02s)
  10222. 846.88 s [vector] +++ OK, passed 100 tests.
  10223. 846.90 s [vector] iscanr': OK (0.02s)
  10224. 846.90 s [vector] +++ OK, passed 100 tests.
  10225. 846.90 s [vector] mut_read: OK
  10226. 846.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10227. 846.90 s [vector] mut_write: OK
  10228. 846.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10229. 846.90 s [vector] mut_modify: OK
  10230. 846.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10231. 846.92 s [vector] mut_generate: OK
  10232. 846.92 s [vector] +++ OK, passed 100 tests.
  10233. 846.94 s [vector] mut_generateM: OK (0.02s)
  10234. 846.94 s [vector] +++ OK, passed 100 tests.
  10235. 846.98 s [vector] mut_mapM_: OK (0.04s)
  10236. 846.98 s [vector] +++ OK, passed 100 tests.
  10237. 847.00 s [vector] mut_imapM_: OK (0.04s)
  10238. 847.00 s [vector] +++ OK, passed 100 tests.
  10239. 847.04 s [vector] mut_forM_: OK (0.04s)
  10240. 847.04 s [vector] +++ OK, passed 100 tests.
  10241. 847.10 s [vector] mut_iforM_: OK (0.05s)
  10242. 847.10 s [vector] +++ OK, passed 100 tests.
  10243. 847.10 s [vector] mut_foldr: OK (0.01s)
  10244. 847.10 s [vector] +++ OK, passed 100 tests.
  10245. 847.12 s [vector] mut_foldr': OK (0.01s)
  10246. 847.12 s [vector] +++ OK, passed 100 tests.
  10247. 847.14 s [vector] mut_foldl: OK (0.01s)
  10248. 847.14 s [vector] +++ OK, passed 100 tests.
  10249. 847.14 s [vector] mut_foldl': OK (0.01s)
  10250. 847.14 s [vector] +++ OK, passed 100 tests.
  10251. 847.16 s [vector] mut_ifoldr: OK (0.01s)
  10252. 847.16 s [vector] +++ OK, passed 100 tests.
  10253. 847.18 s [vector] mut_ifoldr': OK (0.02s)
  10254. 847.18 s [vector] +++ OK, passed 100 tests.
  10255. 847.22 s [vector] mut_ifoldl: OK (0.02s)
  10256. 847.22 s [vector] +++ OK, passed 100 tests.
  10257. 847.22 s [vector] mut_ifoldl': OK (0.02s)
  10258. 847.22 s [vector] +++ OK, passed 100 tests.
  10259. 847.22 s [vector] mut_foldM: OK (0.02s)
  10260. 847.22 s [vector] +++ OK, passed 100 tests.
  10261. 847.24 s [vector] mut_foldM': OK (0.02s)
  10262. 847.24 s [vector] +++ OK, passed 100 tests.
  10263. 847.26 s [vector] mut_foldrM: OK (0.02s)
  10264. 847.26 s [vector] +++ OK, passed 100 tests.
  10265. 847.28 s [vector] mut_foldrM': OK (0.02s)
  10266. 847.28 s [vector] +++ OK, passed 100 tests.
  10267. 847.30 s [vector] mut_ifoldM: OK (0.02s)
  10268. 847.30 s [vector] +++ OK, passed 100 tests.
  10269. 847.30 s [vector] mut_ifoldM': OK (0.02s)
  10270. 847.30 s [vector] +++ OK, passed 100 tests.
  10271. 847.32 s [vector] mut_ifoldrM: OK (0.02s)
  10272. 847.32 s [vector] +++ OK, passed 100 tests.
  10273. 847.34 s [vector] mut_ifoldrM': OK (0.01s)
  10274. 847.34 s [vector] +++ OK, passed 100 tests.
  10275. 847.34 s [vector] compare: OK
  10276. 847.34 s [vector] +++ OK, passed 100 tests.
  10277. 847.34 s [vector] maximum: OK
  10278. 847.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10279. 847.34 s [vector] minimum: OK
  10280. 847.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10281. 847.34 s [vector] minIndex: OK
  10282. 847.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10283. 847.34 s [vector] maxIndex: OK
  10284. 847.34 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10285. 847.34 s [vector] maximumBy: OK
  10286. 847.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10287. 847.34 s [vector] minimumBy: OK
  10288. 847.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10289. 847.35 s [vector] maximumOn: OK
  10290. 847.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10291. 847.35 s [vector] minimumOn: OK
  10292. 847.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10293. 847.35 s [vector] maxIndexBy: OK
  10294. 847.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10295. 847.35 s [vector] minIndexBy: OK
  10296. 847.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10297. 847.35 s [vector] ListFirstMaxIndexWins: OK
  10298. 847.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10299. 847.35 s [vector] FalseListFirstMaxIndexWins: OK
  10300. 847.35 s [vector] +++ OK, failed as expected. (after 1 test):
  10301. 847.35 s [vector] Exception:
  10302. 847.35 s [vector] Prelude.foldr1: empty list
  10303. 847.35 s [vector] CallStack (from HasCallStack):
  10304. 847.35 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  10305. 847.35 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  10306. 847.35 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10307. 847.35 s [vector] []
  10308. 847.35 s [vector] zip: OK
  10309. 847.35 s [vector] +++ OK, passed 100 tests.
  10310. 847.36 s [vector] zip3: OK
  10311. 847.36 s [vector] +++ OK, passed 100 tests.
  10312. 847.36 s [vector] unzip: OK
  10313. 847.36 s [vector] +++ OK, passed 100 tests.
  10314. 847.36 s [vector] unzip3: OK
  10315. 847.36 s [vector] +++ OK, passed 100 tests.
  10316. 847.36 s [vector] indexed: OK
  10317. 847.36 s [vector] +++ OK, passed 100 tests.
  10318. 847.36 s [vector] update: OK
  10319. 847.36 s [vector] +++ OK, passed 100 tests.
  10320. 847.36 s [vector] mempty: OK
  10321. 847.37 s [vector] +++ OK, passed 1 test.
  10322. 847.37 s [vector] mappend: OK
  10323. 847.38 s [vector] +++ OK, passed 100 tests.
  10324. 847.39 s [vector] mconcat: OK (0.02s)
  10325. 847.39 s [vector] +++ OK, passed 100 tests.
  10326. 847.39 s [vector] glength: OK
  10327. 847.39 s [vector] +++ OK, passed 100 tests.
  10328. 847.39 s [vector] sum: OK
  10329. 847.39 s [vector] +++ OK, passed 100 tests.
  10330. 847.39 s [vector] product: OK
  10331. 847.39 s [vector] +++ OK, passed 100 tests.
  10332. 847.39 s [vector] enumFromN: OK
  10333. 847.39 s [vector] +++ OK, passed 100 tests.
  10334. 847.39 s [vector] enumFromThenN: OK
  10335. 847.39 s [vector] +++ OK, passed 100 tests.
  10336. 847.39 s [vector] enumFromTo: OK
  10337. 847.39 s [vector] +++ OK, passed 100 tests.
  10338. 847.39 s [vector] enumFromThenTo: OK
  10339. 847.39 s [vector] +++ OK, passed 100 tests; 3 discarded.
  10340. 847.39 s [vector] (Int,Bool)
  10341. 847.39 s [vector] fromList.toList == id: OK
  10342. 847.39 s [vector] +++ OK, passed 100 tests.
  10343. 847.39 s [vector] toList.fromList == id: OK
  10344. 847.39 s [vector] +++ OK, passed 100 tests.
  10345. 847.40 s [vector] unstream.stream == id: OK
  10346. 847.40 s [vector] +++ OK, passed 100 tests.
  10347. 847.40 s [vector] stream.unstream == id: OK
  10348. 847.40 s [vector] +++ OK, passed 100 tests.
  10349. 847.40 s [vector] eq: OK
  10350. 847.40 s [vector] +++ OK, passed 100 tests.
  10351. 847.40 s [vector] length: OK
  10352. 847.40 s [vector] +++ OK, passed 100 tests.
  10353. 847.40 s [vector] null: OK
  10354. 847.40 s [vector] +++ OK, passed 100 tests.
  10355. 847.40 s [vector] index: OK
  10356. 847.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10357. 847.40 s [vector] safeIndex: OK
  10358. 847.40 s [vector] +++ OK, passed 100 tests.
  10359. 847.40 s [vector] head: OK
  10360. 847.40 s [vector] +++ OK, passed 100 tests; 10 discarded.
  10361. 847.40 s [vector] last: OK
  10362. 847.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10363. 847.40 s [vector] unsafeIndex: OK
  10364. 847.40 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10365. 847.40 s [vector] unsafeHead: OK
  10366. 847.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10367. 847.41 s [vector] unsafeLast: OK
  10368. 847.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10369. 847.41 s [vector] slice: OK
  10370. 847.41 s [vector] +++ OK, passed 100 tests.
  10371. 847.41 s [vector] init: OK
  10372. 847.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10373. 847.41 s [vector] tail: OK
  10374. 847.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10375. 847.41 s [vector] take: OK
  10376. 847.41 s [vector] +++ OK, passed 100 tests.
  10377. 847.41 s [vector] drop: OK
  10378. 847.41 s [vector] +++ OK, passed 100 tests.
  10379. 847.41 s [vector] splitAt: OK
  10380. 847.41 s [vector] +++ OK, passed 100 tests.
  10381. 847.41 s [vector] empty: OK
  10382. 847.41 s [vector] +++ OK, passed 1 test.
  10383. 847.42 s [vector] singleton: OK
  10384. 847.42 s [vector] +++ OK, passed 100 tests.
  10385. 847.42 s [vector] replicate: OK
  10386. 847.42 s [vector] +++ OK, passed 100 tests.
  10387. 847.42 s [vector] generate: OK
  10388. 847.42 s [vector] +++ OK, passed 100 tests.
  10389. 847.42 s [vector] iterateN: OK
  10390. 847.42 s [vector] +++ OK, passed 100 tests.
  10391. 847.50 s [vector] iterateNM: OK (0.08s)
  10392. 847.50 s [vector] +++ OK, passed 100 tests.
  10393. 847.52 s [vector] generateM: OK (0.02s)
  10394. 847.52 s [vector] +++ OK, passed 100 tests.
  10395. 847.55 s [vector] replicateM: OK (0.03s)
  10396. 847.55 s [vector] +++ OK, passed 100 tests.
  10397. 847.55 s [vector] create: OK
  10398. 847.55 s [vector] +++ OK, passed 100 tests.
  10399. 847.55 s [vector] createT: OK
  10400. 847.55 s [vector] +++ OK, passed 100 tests.
  10401. 847.55 s [vector] unfoldr: OK
  10402. 847.55 s [vector] +++ OK, passed 100 tests.
  10403. 847.55 s [vector] unfoldrN: OK
  10404. 847.55 s [vector] +++ OK, passed 100 tests.
  10405. 847.56 s [vector] unfoldrExactN: OK
  10406. 847.56 s [vector] +++ OK, passed 100 tests.
  10407. 847.56 s [vector] unfoldrM: OK
  10408. 847.56 s [vector] +++ OK, passed 100 tests.
  10409. 847.56 s [vector] unfoldrNM: OK
  10410. 847.56 s [vector] +++ OK, passed 100 tests.
  10411. 847.61 s [vector] unfoldrExactNM: OK (0.05s)
  10412. 847.61 s [vector] +++ OK, passed 100 tests.
  10413. 847.61 s [vector] constructN: OK
  10414. 847.61 s [vector] +++ OK, passed 100 tests.
  10415. 847.62 s [vector] constructrN: OK
  10416. 847.62 s [vector] +++ OK, passed 100 tests.
  10417. 847.62 s [vector] cons: OK
  10418. 847.62 s [vector] +++ OK, passed 100 tests.
  10419. 847.63 s [vector] snoc: OK
  10420. 847.63 s [vector] +++ OK, passed 100 tests.
  10421. 847.64 s [vector] append: OK
  10422. 847.64 s [vector] +++ OK, passed 100 tests.
  10423. 847.68 s [vector] concat: OK (0.04s)
  10424. 847.68 s [vector] +++ OK, passed 100 tests.
  10425. 847.68 s [vector] force: OK (0.01s)
  10426. 847.68 s [vector] +++ OK, passed 100 tests.
  10427. 847.68 s [vector] upd: OK
  10428. 847.68 s [vector] +++ OK, passed 100 tests.
  10429. 847.69 s [vector] accum: OK
  10430. 847.69 s [vector] +++ OK, passed 100 tests.
  10431. 847.69 s [vector] reverse: OK
  10432. 847.70 s [vector] +++ OK, passed 100 tests.
  10433. 847.70 s [vector] backpermute: OK
  10434. 847.70 s [vector] +++ OK, passed 100 tests.
  10435. 847.70 s [vector] map: OK
  10436. 847.70 s [vector] +++ OK, passed 100 tests.
  10437. 847.71 s [vector] imap: OK
  10438. 847.71 s [vector] +++ OK, passed 100 tests.
  10439. 847.72 s [vector] concatMap: OK
  10440. 847.72 s [vector] +++ OK, passed 100 tests.
  10441. 847.72 s [vector] mapM: OK
  10442. 847.72 s [vector] +++ OK, passed 100 tests.
  10443. 847.75 s [vector] mapM_: OK (0.03s)
  10444. 847.75 s [vector] +++ OK, passed 100 tests.
  10445. 847.76 s [vector] forM: OK
  10446. 847.76 s [vector] +++ OK, passed 100 tests.
  10447. 847.79 s [vector] forM_: OK (0.03s)
  10448. 847.80 s [vector] +++ OK, passed 100 tests.
  10449. 847.80 s [vector] imapM: OK
  10450. 847.80 s [vector] +++ OK, passed 100 tests.
  10451. 847.84 s [vector] imapM_: OK (0.04s)
  10452. 847.84 s [vector] +++ OK, passed 100 tests.
  10453. 847.84 s [vector] zipWith: OK
  10454. 847.84 s [vector] +++ OK, passed 100 tests.
  10455. 847.86 s [vector] zipWith3: OK (0.01s)
  10456. 847.86 s [vector] +++ OK, passed 100 tests.
  10457. 847.86 s [vector] izipWith: OK
  10458. 847.86 s [vector] +++ OK, passed 100 tests.
  10459. 847.87 s [vector] izipWith3: OK (0.01s)
  10460. 847.87 s [vector] +++ OK, passed 100 tests.
  10461. 847.90 s [vector] izipWithM: OK
  10462. 847.90 s [vector] +++ OK, passed 100 tests.
  10463. 847.92 s [vector] izipWithM_: OK (0.03s)
  10464. 847.92 s [vector] +++ OK, passed 100 tests.
  10465. 847.92 s [vector] zipWithM: OK
  10466. 847.92 s [vector] +++ OK, passed 100 tests.
  10467. 847.94 s [vector] zipWithM_: OK (0.02s)
  10468. 847.94 s [vector] +++ OK, passed 100 tests.
  10469. 847.94 s [vector] filter: OK
  10470. 847.95 s [vector] +++ OK, passed 100 tests.
  10471. 847.96 s [vector] ifilter: OK
  10472. 847.96 s [vector] +++ OK, passed 100 tests.
  10473. 847.99 s [vector] filterM: OK (0.04s)
  10474. 848.00 s [vector] +++ OK, passed 100 tests.
  10475. 848.00 s [vector] uniq: OK
  10476. 848.00 s [vector] +++ OK, passed 100 tests.
  10477. 848.00 s [vector] mapMaybe: OK
  10478. 848.00 s [vector] +++ OK, passed 100 tests.
  10479. 848.00 s [vector] imapMaybe: OK
  10480. 848.00 s [vector] +++ OK, passed 100 tests.
  10481. 848.00 s [vector] takeWhile: OK
  10482. 848.00 s [vector] +++ OK, passed 100 tests.
  10483. 848.01 s [vector] dropWhile: OK
  10484. 848.01 s [vector] +++ OK, passed 100 tests.
  10485. 848.02 s [vector] partition: OK
  10486. 848.02 s [vector] +++ OK, passed 100 tests.
  10487. 848.02 s [vector] partitionWith: OK
  10488. 848.02 s [vector] +++ OK, passed 100 tests.
  10489. 848.02 s [vector] span: OK
  10490. 848.02 s [vector] +++ OK, passed 100 tests.
  10491. 848.02 s [vector] break: OK
  10492. 848.02 s [vector] +++ OK, passed 100 tests.
  10493. 848.02 s [vector] spanR: OK
  10494. 848.02 s [vector] +++ OK, passed 100 tests.
  10495. 848.03 s [vector] breakR: OK
  10496. 848.03 s [vector] +++ OK, passed 100 tests.
  10497. 848.03 s [vector] groupBy: OK
  10498. 848.03 s [vector] +++ OK, passed 100 tests.
  10499. 848.03 s [vector] elem: OK
  10500. 848.03 s [vector] +++ OK, passed 100 tests.
  10501. 848.03 s [vector] notElem: OK
  10502. 848.03 s [vector] +++ OK, passed 100 tests.
  10503. 848.03 s [vector] find: OK
  10504. 848.03 s [vector] +++ OK, passed 100 tests.
  10505. 848.03 s [vector] findIndex: OK
  10506. 848.03 s [vector] +++ OK, passed 100 tests.
  10507. 848.04 s [vector] findIndexR: OK
  10508. 848.04 s [vector] +++ OK, passed 100 tests.
  10509. 848.04 s [vector] findIndices: OK
  10510. 848.04 s [vector] +++ OK, passed 100 tests.
  10511. 848.04 s [vector] elemIndex: OK
  10512. 848.04 s [vector] +++ OK, passed 100 tests.
  10513. 848.04 s [vector] elemIndices: OK
  10514. 848.04 s [vector] +++ OK, passed 100 tests.
  10515. 848.05 s [vector] foldl: OK
  10516. 848.05 s [vector] +++ OK, passed 100 tests.
  10517. 848.06 s [vector] foldl1: OK
  10518. 848.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10519. 848.06 s [vector] foldl': OK
  10520. 848.07 s [vector] +++ OK, passed 100 tests.
  10521. 848.08 s [vector] foldl1': OK
  10522. 848.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10523. 848.08 s [vector] foldr: OK
  10524. 848.08 s [vector] +++ OK, passed 100 tests.
  10525. 848.08 s [vector] foldr1: OK
  10526. 848.08 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10527. 848.08 s [vector] foldr': OK
  10528. 848.08 s [vector] +++ OK, passed 100 tests.
  10529. 848.08 s [vector] foldr1': OK
  10530. 848.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10531. 848.09 s [vector] ifoldl: OK
  10532. 848.10 s [vector] +++ OK, passed 100 tests.
  10533. 848.10 s [vector] ifoldl': OK
  10534. 848.10 s [vector] +++ OK, passed 100 tests.
  10535. 848.10 s [vector] ifoldr: OK
  10536. 848.10 s [vector] +++ OK, passed 100 tests.
  10537. 848.10 s [vector] ifoldr': OK
  10538. 848.10 s [vector] +++ OK, passed 100 tests.
  10539. 848.11 s [vector] ifoldM: OK
  10540. 848.12 s [vector] +++ OK, passed 100 tests.
  10541. 848.12 s [vector] ifoldM': OK
  10542. 848.12 s [vector] +++ OK, passed 100 tests.
  10543. 848.19 s [vector] ifoldM_: OK (0.05s)
  10544. 848.19 s [vector] +++ OK, passed 100 tests.
  10545. 848.21 s [vector] ifoldM'_: OK (0.04s)
  10546. 848.21 s [vector] +++ OK, passed 100 tests.
  10547. 848.21 s [vector] all: OK
  10548. 848.21 s [vector] +++ OK, passed 100 tests.
  10549. 848.21 s [vector] any: OK
  10550. 848.22 s [vector] +++ OK, passed 100 tests.
  10551. 848.23 s [vector] prescanl: OK
  10552. 848.23 s [vector] +++ OK, passed 100 tests.
  10553. 848.24 s [vector] prescanl': OK
  10554. 848.24 s [vector] +++ OK, passed 100 tests.
  10555. 848.24 s [vector] postscanl: OK
  10556. 848.24 s [vector] +++ OK, passed 100 tests.
  10557. 848.26 s [vector] postscanl': OK
  10558. 848.26 s [vector] +++ OK, passed 100 tests.
  10559. 848.26 s [vector] scanl: OK
  10560. 848.26 s [vector] +++ OK, passed 100 tests.
  10561. 848.27 s [vector] scanl': OK
  10562. 848.27 s [vector] +++ OK, passed 100 tests.
  10563. 848.27 s [vector] scanl1: OK
  10564. 848.27 s [vector] +++ OK, passed 100 tests.
  10565. 848.28 s [vector] scanl1': OK (0.02s)
  10566. 848.28 s [vector] +++ OK, passed 100 tests.
  10567. 848.29 s [vector] iscanl: OK
  10568. 848.30 s [vector] +++ OK, passed 100 tests.
  10569. 848.31 s [vector] iscanl': OK
  10570. 848.31 s [vector] +++ OK, passed 100 tests.
  10571. 848.32 s [vector] prescanr: OK
  10572. 848.32 s [vector] +++ OK, passed 100 tests.
  10573. 848.32 s [vector] prescanr': OK
  10574. 848.32 s [vector] +++ OK, passed 100 tests.
  10575. 848.32 s [vector] postscanr: OK
  10576. 848.32 s [vector] +++ OK, passed 100 tests.
  10577. 848.32 s [vector] postscanr': OK
  10578. 848.32 s [vector] +++ OK, passed 100 tests.
  10579. 848.32 s [vector] scanr: OK
  10580. 848.32 s [vector] +++ OK, passed 100 tests.
  10581. 848.33 s [vector] scanr': OK
  10582. 848.33 s [vector] +++ OK, passed 100 tests.
  10583. 848.33 s [vector] scanr1: OK
  10584. 848.33 s [vector] +++ OK, passed 100 tests.
  10585. 848.34 s [vector] scanr1': OK
  10586. 848.34 s [vector] +++ OK, passed 100 tests.
  10587. 848.36 s [vector] iscanr: OK
  10588. 848.36 s [vector] +++ OK, passed 100 tests.
  10589. 848.36 s [vector] iscanr': OK
  10590. 848.36 s [vector] +++ OK, passed 100 tests.
  10591. 848.36 s [vector] mut_read: OK
  10592. 848.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10593. 848.36 s [vector] mut_write: OK
  10594. 848.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10595. 848.36 s [vector] mut_modify: OK
  10596. 848.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10597. 848.37 s [vector] mut_generate: OK
  10598. 848.38 s [vector] +++ OK, passed 100 tests.
  10599. 848.40 s [vector] mut_generateM: OK (0.02s)
  10600. 848.40 s [vector] +++ OK, passed 100 tests.
  10601. 848.44 s [vector] mut_mapM_: OK (0.03s)
  10602. 848.44 s [vector] +++ OK, passed 100 tests.
  10603. 848.46 s [vector] mut_imapM_: OK (0.04s)
  10604. 848.46 s [vector] +++ OK, passed 100 tests.
  10605. 848.50 s [vector] mut_forM_: OK (0.03s)
  10606. 848.50 s [vector] +++ OK, passed 100 tests.
  10607. 848.52 s [vector] mut_iforM_: OK (0.03s)
  10608. 848.52 s [vector] +++ OK, passed 100 tests.
  10609. 848.53 s [vector] mut_foldr: OK
  10610. 848.53 s [vector] +++ OK, passed 100 tests.
  10611. 848.53 s [vector] mut_foldr': OK
  10612. 848.53 s [vector] +++ OK, passed 100 tests.
  10613. 848.53 s [vector] mut_foldl: OK
  10614. 848.54 s [vector] +++ OK, passed 100 tests.
  10615. 848.54 s [vector] mut_foldl': OK
  10616. 848.54 s [vector] +++ OK, passed 100 tests.
  10617. 848.54 s [vector] mut_ifoldr: OK
  10618. 848.55 s [vector] +++ OK, passed 100 tests.
  10619. 848.56 s [vector] mut_ifoldr': OK
  10620. 848.56 s [vector] +++ OK, passed 100 tests.
  10621. 848.56 s [vector] mut_ifoldl: OK
  10622. 848.56 s [vector] +++ OK, passed 100 tests.
  10623. 848.57 s [vector] mut_ifoldl': OK
  10624. 848.57 s [vector] +++ OK, passed 100 tests.
  10625. 848.58 s [vector] mut_foldM: OK
  10626. 848.58 s [vector] +++ OK, passed 100 tests.
  10627. 848.58 s [vector] mut_foldM': OK
  10628. 848.58 s [vector] +++ OK, passed 100 tests.
  10629. 848.60 s [vector] mut_foldrM: OK
  10630. 848.60 s [vector] +++ OK, passed 100 tests.
  10631. 848.60 s [vector] mut_foldrM': OK
  10632. 848.60 s [vector] +++ OK, passed 100 tests.
  10633. 848.61 s [vector] mut_ifoldM: OK
  10634. 848.61 s [vector] +++ OK, passed 100 tests.
  10635. 848.62 s [vector] mut_ifoldM': OK
  10636. 848.62 s [vector] +++ OK, passed 100 tests.
  10637. 848.62 s [vector] mut_ifoldrM: OK
  10638. 848.62 s [vector] +++ OK, passed 100 tests.
  10639. 848.62 s [vector] mut_ifoldrM': OK
  10640. 848.62 s [vector] +++ OK, passed 100 tests.
  10641. 848.63 s [vector] compare: OK
  10642. 848.63 s [vector] +++ OK, passed 100 tests.
  10643. 848.63 s [vector] maximum: OK
  10644. 848.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10645. 848.63 s [vector] minimum: OK
  10646. 848.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10647. 848.63 s [vector] minIndex: OK
  10648. 848.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10649. 848.63 s [vector] maxIndex: OK
  10650. 848.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10651. 848.63 s [vector] maximumBy: OK
  10652. 848.63 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10653. 848.63 s [vector] minimumBy: OK
  10654. 848.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10655. 848.63 s [vector] maximumOn: OK
  10656. 848.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10657. 848.63 s [vector] minimumOn: OK
  10658. 848.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10659. 848.64 s [vector] maxIndexBy: OK
  10660. 848.64 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10661. 848.64 s [vector] minIndexBy: OK
  10662. 848.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10663. 848.64 s [vector] ListFirstMaxIndexWins: OK
  10664. 848.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10665. 848.64 s [vector] FalseListFirstMaxIndexWins: OK
  10666. 848.64 s [vector] +++ OK, failed as expected. (after 1 test):
  10667. 848.64 s [vector] Exception:
  10668. 848.64 s [vector] Prelude.foldr1: empty list
  10669. 848.65 s [vector] CallStack (from HasCallStack):
  10670. 848.65 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  10671. 848.66 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  10672. 848.66 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10673. 848.66 s [vector] []
  10674. 848.66 s [vector] zip: OK
  10675. 848.66 s [vector] +++ OK, passed 100 tests.
  10676. 848.66 s [vector] zip3: OK
  10677. 848.66 s [vector] +++ OK, passed 100 tests.
  10678. 848.66 s [vector] unzip: OK
  10679. 848.66 s [vector] +++ OK, passed 100 tests.
  10680. 848.66 s [vector] unzip3: OK
  10681. 848.66 s [vector] +++ OK, passed 100 tests.
  10682. 848.67 s [vector] indexed: OK
  10683. 848.67 s [vector] +++ OK, passed 100 tests.
  10684. 848.69 s [vector] update: OK
  10685. 848.69 s [vector] +++ OK, passed 100 tests.
  10686. 848.69 s [vector] mempty: OK
  10687. 848.69 s [vector] +++ OK, passed 1 test.
  10688. 848.69 s [vector] mappend: OK
  10689. 848.69 s [vector] +++ OK, passed 100 tests.
  10690. 848.72 s [vector] mconcat: OK (0.05s)
  10691. 848.72 s [vector] +++ OK, passed 100 tests.
  10692. 848.72 s [vector] glength: OK
  10693. 848.72 s [vector] +++ OK, passed 100 tests.
  10694. 848.72 s [vector] (Int,Bool,Int)
  10695. 848.72 s [vector] fromList.toList == id: OK
  10696. 848.72 s [vector] +++ OK, passed 100 tests.
  10697. 848.73 s [vector] toList.fromList == id: OK
  10698. 848.73 s [vector] +++ OK, passed 100 tests.
  10699. 848.73 s [vector] unstream.stream == id: OK
  10700. 848.73 s [vector] +++ OK, passed 100 tests.
  10701. 848.73 s [vector] stream.unstream == id: OK
  10702. 848.73 s [vector] +++ OK, passed 100 tests.
  10703. 848.73 s [vector] eq: OK
  10704. 848.73 s [vector] +++ OK, passed 100 tests.
  10705. 848.73 s [vector] length: OK
  10706. 848.73 s [vector] +++ OK, passed 100 tests.
  10707. 848.74 s [vector] null: OK
  10708. 848.74 s [vector] +++ OK, passed 100 tests.
  10709. 848.74 s [vector] index: OK
  10710. 848.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10711. 848.74 s [vector] safeIndex: OK
  10712. 848.74 s [vector] +++ OK, passed 100 tests.
  10713. 848.74 s [vector] head: OK
  10714. 848.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10715. 848.74 s [vector] last: OK
  10716. 848.74 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10717. 848.74 s [vector] unsafeIndex: OK
  10718. 848.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10719. 848.74 s [vector] unsafeHead: OK
  10720. 848.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10721. 848.74 s [vector] unsafeLast: OK
  10722. 848.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10723. 848.75 s [vector] slice: OK
  10724. 848.75 s [vector] +++ OK, passed 100 tests.
  10725. 848.75 s [vector] init: OK
  10726. 848.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10727. 848.75 s [vector] tail: OK
  10728. 848.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10729. 848.75 s [vector] take: OK
  10730. 848.76 s [vector] +++ OK, passed 100 tests.
  10731. 848.76 s [vector] drop: OK
  10732. 848.76 s [vector] +++ OK, passed 100 tests.
  10733. 848.76 s [vector] splitAt: OK
  10734. 848.76 s [vector] +++ OK, passed 100 tests.
  10735. 848.76 s [vector] empty: OK
  10736. 848.76 s [vector] +++ OK, passed 1 test.
  10737. 848.76 s [vector] singleton: OK
  10738. 848.76 s [vector] +++ OK, passed 100 tests.
  10739. 848.76 s [vector] replicate: OK
  10740. 848.76 s [vector] +++ OK, passed 100 tests.
  10741. 848.76 s [vector] generate: OK
  10742. 848.76 s [vector] +++ OK, passed 100 tests.
  10743. 848.78 s [vector] iterateN: OK
  10744. 848.78 s [vector] +++ OK, passed 100 tests.
  10745. 848.80 s [vector] iterateNM: OK (0.02s)
  10746. 848.80 s [vector] +++ OK, passed 100 tests.
  10747. 848.84 s [vector] generateM: OK (0.05s)
  10748. 848.84 s [vector] +++ OK, passed 100 tests.
  10749. 848.86 s [vector] replicateM: OK (0.03s)
  10750. 848.86 s [vector] +++ OK, passed 100 tests.
  10751. 848.86 s [vector] create: OK
  10752. 848.87 s [vector] +++ OK, passed 100 tests.
  10753. 848.87 s [vector] createT: OK
  10754. 848.87 s [vector] +++ OK, passed 100 tests.
  10755. 848.87 s [vector] unfoldr: OK
  10756. 848.87 s [vector] +++ OK, passed 100 tests.
  10757. 848.87 s [vector] unfoldrN: OK
  10758. 848.87 s [vector] +++ OK, passed 100 tests.
  10759. 848.88 s [vector] unfoldrExactN: OK
  10760. 848.88 s [vector] +++ OK, passed 100 tests.
  10761. 848.88 s [vector] unfoldrM: OK
  10762. 848.88 s [vector] +++ OK, passed 100 tests.
  10763. 848.88 s [vector] unfoldrNM: OK
  10764. 848.88 s [vector] +++ OK, passed 100 tests.
  10765. 848.94 s [vector] unfoldrExactNM: OK (0.05s)
  10766. 848.94 s [vector] +++ OK, passed 100 tests.
  10767. 848.94 s [vector] constructN: OK (0.01s)
  10768. 848.94 s [vector] +++ OK, passed 100 tests.
  10769. 848.95 s [vector] constructrN: OK
  10770. 848.95 s [vector] +++ OK, passed 100 tests.
  10771. 848.95 s [vector] cons: OK
  10772. 848.96 s [vector] +++ OK, passed 100 tests.
  10773. 848.96 s [vector] snoc: OK
  10774. 848.96 s [vector] +++ OK, passed 100 tests.
  10775. 848.97 s [vector] append: OK
  10776. 848.97 s [vector] +++ OK, passed 100 tests.
  10777. 849.02 s [vector] concat: OK (0.05s)
  10778. 849.02 s [vector] +++ OK, passed 100 tests.
  10779. 849.02 s [vector] force: OK
  10780. 849.02 s [vector] +++ OK, passed 100 tests.
  10781. 849.04 s [vector] upd: OK (0.01s)
  10782. 849.04 s [vector] +++ OK, passed 100 tests.
  10783. 849.06 s [vector] accum: OK (0.02s)
  10784. 849.06 s [vector] +++ OK, passed 100 tests.
  10785. 849.06 s [vector] reverse: OK
  10786. 849.06 s [vector] +++ OK, passed 100 tests.
  10787. 849.06 s [vector] backpermute: OK
  10788. 849.06 s [vector] +++ OK, passed 100 tests.
  10789. 849.08 s [vector] map: OK
  10790. 849.08 s [vector] +++ OK, passed 100 tests.
  10791. 849.08 s [vector] imap: OK (0.02s)
  10792. 849.08 s [vector] +++ OK, passed 100 tests.
  10793. 849.10 s [vector] concatMap: OK (0.02s)
  10794. 849.10 s [vector] +++ OK, passed 100 tests.
  10795. 849.12 s [vector] mapM: OK (0.01s)
  10796. 849.12 s [vector] +++ OK, passed 100 tests.
  10797. 849.16 s [vector] mapM_: OK (0.05s)
  10798. 849.16 s [vector] +++ OK, passed 100 tests.
  10799. 849.17 s [vector] forM: OK
  10800. 849.17 s [vector] +++ OK, passed 100 tests.
  10801. 849.21 s [vector] forM_: OK (0.04s)
  10802. 849.21 s [vector] +++ OK, passed 100 tests.
  10803. 849.22 s [vector] imapM: OK
  10804. 849.22 s [vector] +++ OK, passed 100 tests.
  10805. 849.28 s [vector] imapM_: OK (0.05s)
  10806. 849.28 s [vector] +++ OK, passed 100 tests.
  10807. 849.28 s [vector] zipWith: OK
  10808. 849.28 s [vector] +++ OK, passed 100 tests.
  10809. 849.30 s [vector] zipWith3: OK (0.01s)
  10810. 849.30 s [vector] +++ OK, passed 100 tests.
  10811. 849.30 s [vector] izipWith: OK
  10812. 849.30 s [vector] +++ OK, passed 100 tests.
  10813. 849.32 s [vector] izipWith3: OK (0.01s)
  10814. 849.32 s [vector] +++ OK, passed 100 tests.
  10815. 849.32 s [vector] izipWithM: OK
  10816. 849.32 s [vector] +++ OK, passed 100 tests.
  10817. 849.36 s [vector] izipWithM_: OK (0.04s)
  10818. 849.69 s [vector] +++ OK, passed 100 tests.
  10819. 849.69 s [vector] zipWithM: OK (0.01s)
  10820. 849.69 s [vector] +++ OK, passed 100 tests.
  10821. 849.69 s [vector] zipWithM_: OK (0.04s)
  10822. 849.69 s [vector] +++ OK, passed 100 tests.
  10823. 849.69 s [vector] filter: OK
  10824. 849.69 s [vector] +++ OK, passed 100 tests.
  10825. 849.69 s [vector] ifilter: OK
  10826. 849.69 s [vector] +++ OK, passed 100 tests.
  10827. 849.70 s [vector] filterM: OK (0.05s)
  10828. 849.70 s [vector] +++ OK, passed 100 tests.
  10829. 849.70 s [vector] uniq: OK
  10830. 849.70 s [vector] +++ OK, passed 100 tests.
  10831. 849.70 s [vector] mapMaybe: OK
  10832. 849.70 s [vector] +++ OK, passed 100 tests.
  10833. 849.70 s [vector] imapMaybe: OK
  10834. 849.70 s [vector] +++ OK, passed 100 tests.
  10835. 849.70 s [vector] takeWhile: OK
  10836. 849.70 s [vector] +++ OK, passed 100 tests.
  10837. 849.70 s [vector] dropWhile: OK
  10838. 849.70 s [vector] +++ OK, passed 100 tests.
  10839. 849.70 s [vector] partition: OK
  10840. 849.70 s [vector] +++ OK, passed 100 tests.
  10841. 849.70 s [vector] partitionWith: OK
  10842. 849.70 s [vector] +++ OK, passed 100 tests.
  10843. 849.70 s [vector] span: OK
  10844. 849.70 s [vector] +++ OK, passed 100 tests.
  10845. 849.70 s [vector] break: OK
  10846. 849.70 s [vector] +++ OK, passed 100 tests.
  10847. 849.70 s [vector] spanR: OK
  10848. 849.70 s [vector] +++ OK, passed 100 tests.
  10849. 849.70 s [vector] breakR: OK
  10850. 849.70 s [vector] +++ OK, passed 100 tests.
  10851. 849.70 s [vector] groupBy: OK
  10852. 849.70 s [vector] +++ OK, passed 100 tests.
  10853. 849.70 s [vector] elem: OK
  10854. 849.70 s [vector] +++ OK, passed 100 tests.
  10855. 849.70 s [vector] notElem: OK
  10856. 849.70 s [vector] +++ OK, passed 100 tests.
  10857. 849.70 s [vector] find: OK
  10858. 849.70 s [vector] +++ OK, passed 100 tests.
  10859. 849.70 s [vector] findIndex: OK
  10860. 849.70 s [vector] +++ OK, passed 100 tests.
  10861. 849.70 s [vector] findIndexR: OK
  10862. 849.70 s [vector] +++ OK, passed 100 tests.
  10863. 849.70 s [vector] findIndices: OK
  10864. 849.70 s [vector] +++ OK, passed 100 tests.
  10865. 849.70 s [vector] elemIndex: OK
  10866. 849.70 s [vector] +++ OK, passed 100 tests.
  10867. 849.70 s [vector] elemIndices: OK
  10868. 849.70 s [vector] +++ OK, passed 100 tests.
  10869. 849.70 s [vector] foldl: OK
  10870. 849.70 s [vector] +++ OK, passed 100 tests.
  10871. 849.70 s [vector] foldl1: OK
  10872. 849.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10873. 849.70 s [vector] foldl': OK
  10874. 849.70 s [vector] +++ OK, passed 100 tests.
  10875. 849.70 s [vector] foldl1': OK
  10876. 849.70 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10877. 849.70 s [vector] foldr: OK
  10878. 849.70 s [vector] +++ OK, passed 100 tests.
  10879. 849.70 s [vector] foldr1: OK
  10880. 849.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10881. 849.70 s [vector] foldr': OK
  10882. 849.70 s [vector] +++ OK, passed 100 tests.
  10883. 849.70 s [vector] foldr1': OK
  10884. 849.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10885. 849.70 s [vector] ifoldl: OK
  10886. 849.70 s [vector] +++ OK, passed 100 tests.
  10887. 849.70 s [vector] ifoldl': OK
  10888. 849.70 s [vector] +++ OK, passed 100 tests.
  10889. 849.70 s [vector] ifoldr: OK
  10890. 849.70 s [vector] +++ OK, passed 100 tests.
  10891. 849.70 s [vector] ifoldr': OK
  10892. 849.70 s [vector] +++ OK, passed 100 tests.
  10893. 849.70 s [vector] ifoldM: OK
  10894. 849.70 s [vector] +++ OK, passed 100 tests.
  10895. 849.70 s [vector] ifoldM': OK
  10896. 849.70 s [vector] +++ OK, passed 100 tests.
  10897. 849.70 s [vector] ifoldM_: OK (0.04s)
  10898. 849.70 s [vector] +++ OK, passed 100 tests.
  10899. 849.73 s [vector] ifoldM'_: OK (0.05s)
  10900. 849.73 s [vector] +++ OK, passed 100 tests.
  10901. 849.73 s [vector] all: OK
  10902. 849.73 s [vector] +++ OK, passed 100 tests.
  10903. 849.73 s [vector] any: OK
  10904. 849.74 s [vector] +++ OK, passed 100 tests.
  10905. 849.75 s [vector] prescanl: OK
  10906. 849.75 s [vector] +++ OK, passed 100 tests.
  10907. 849.76 s [vector] prescanl': OK
  10908. 849.76 s [vector] +++ OK, passed 100 tests.
  10909. 849.78 s [vector] postscanl: OK (0.01s)
  10910. 849.78 s [vector] +++ OK, passed 100 tests.
  10911. 849.79 s [vector] postscanl': OK (0.02s)
  10912. 849.79 s [vector] +++ OK, passed 100 tests.
  10913. 849.79 s [vector] scanl: OK (0.02s)
  10914. 849.79 s [vector] +++ OK, passed 100 tests.
  10915. 849.80 s [vector] scanl': OK
  10916. 849.81 s [vector] +++ OK, passed 100 tests.
  10917. 849.82 s [vector] scanl1: OK
  10918. 849.82 s [vector] +++ OK, passed 100 tests.
  10919. 849.82 s [vector] scanl1': OK
  10920. 849.82 s [vector] +++ OK, passed 100 tests.
  10921. 849.84 s [vector] iscanl: OK
  10922. 849.84 s [vector] +++ OK, passed 100 tests.
  10923. 849.84 s [vector] iscanl': OK
  10924. 849.85 s [vector] +++ OK, passed 100 tests.
  10925. 849.86 s [vector] prescanr: OK (0.01s)
  10926. 849.86 s [vector] +++ OK, passed 100 tests.
  10927. 849.86 s [vector] prescanr': OK
  10928. 849.86 s [vector] +++ OK, passed 100 tests.
  10929. 849.88 s [vector] postscanr: OK
  10930. 849.88 s [vector] +++ OK, passed 100 tests.
  10931. 849.88 s [vector] postscanr': OK
  10932. 849.89 s [vector] +++ OK, passed 100 tests.
  10933. 849.89 s [vector] scanr: OK
  10934. 849.90 s [vector] +++ OK, passed 100 tests.
  10935. 849.90 s [vector] scanr': OK
  10936. 849.90 s [vector] +++ OK, passed 100 tests.
  10937. 849.90 s [vector] scanr1: OK
  10938. 849.90 s [vector] +++ OK, passed 100 tests.
  10939. 849.91 s [vector] scanr1': OK
  10940. 849.91 s [vector] +++ OK, passed 100 tests.
  10941. 849.92 s [vector] iscanr: OK
  10942. 849.92 s [vector] +++ OK, passed 100 tests.
  10943. 849.93 s [vector] iscanr': OK
  10944. 849.93 s [vector] +++ OK, passed 100 tests.
  10945. 849.93 s [vector] mut_read: OK
  10946. 849.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10947. 849.93 s [vector] mut_write: OK
  10948. 849.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10949. 849.94 s [vector] mut_modify: OK
  10950. 849.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10951. 849.94 s [vector] mut_generate: OK
  10952. 849.94 s [vector] +++ OK, passed 100 tests.
  10953. 849.98 s [vector] mut_generateM: OK (0.03s)
  10954. 849.98 s [vector] +++ OK, passed 100 tests.
  10955. 850.04 s [vector] mut_mapM_: OK (0.05s)
  10956. 850.04 s [vector] +++ OK, passed 100 tests.
  10957. 850.07 s [vector] mut_imapM_: OK (0.04s)
  10958. 850.07 s [vector] +++ OK, passed 100 tests.
  10959. 850.12 s [vector] mut_forM_: OK (0.04s)
  10960. 850.12 s [vector] +++ OK, passed 100 tests.
  10961. 850.18 s [vector] mut_iforM_: OK (0.05s)
  10962. 850.18 s [vector] +++ OK, passed 100 tests.
  10963. 850.19 s [vector] mut_foldr: OK (0.01s)
  10964. 850.19 s [vector] +++ OK, passed 100 tests.
  10965. 850.20 s [vector] mut_foldr': OK
  10966. 850.20 s [vector] +++ OK, passed 100 tests.
  10967. 850.20 s [vector] mut_foldl: OK
  10968. 850.20 s [vector] +++ OK, passed 100 tests.
  10969. 850.22 s [vector] mut_foldl': OK
  10970. 850.22 s [vector] +++ OK, passed 100 tests.
  10971. 850.22 s [vector] mut_ifoldr: OK
  10972. 850.22 s [vector] +++ OK, passed 100 tests.
  10973. 850.24 s [vector] mut_ifoldr': OK
  10974. 850.24 s [vector] +++ OK, passed 100 tests.
  10975. 850.24 s [vector] mut_ifoldl: OK
  10976. 850.24 s [vector] +++ OK, passed 100 tests.
  10977. 850.25 s [vector] mut_ifoldl': OK
  10978. 850.25 s [vector] +++ OK, passed 100 tests.
  10979. 850.26 s [vector] mut_foldM: OK
  10980. 850.26 s [vector] +++ OK, passed 100 tests.
  10981. 850.26 s [vector] mut_foldM': OK
  10982. 850.27 s [vector] +++ OK, passed 100 tests.
  10983. 850.28 s [vector] mut_foldrM: OK
  10984. 850.28 s [vector] +++ OK, passed 100 tests.
  10985. 850.28 s [vector] mut_foldrM': OK
  10986. 850.28 s [vector] +++ OK, passed 100 tests.
  10987. 850.29 s [vector] mut_ifoldM: OK
  10988. 850.29 s [vector] +++ OK, passed 100 tests.
  10989. 850.29 s [vector] mut_ifoldM': OK
  10990. 850.29 s [vector] +++ OK, passed 100 tests.
  10991. 850.30 s [vector] mut_ifoldrM: OK
  10992. 850.30 s [vector] +++ OK, passed 100 tests.
  10993. 850.31 s [vector] mut_ifoldrM': OK
  10994. 850.31 s [vector] +++ OK, passed 100 tests.
  10995. 850.31 s [vector] compare: OK
  10996. 850.31 s [vector] +++ OK, passed 100 tests.
  10997. 850.31 s [vector] maximum: OK
  10998. 850.31 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10999. 850.31 s [vector] minimum: OK
  11000. 850.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11001. 850.31 s [vector] minIndex: OK
  11002. 850.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11003. 850.32 s [vector] maxIndex: OK
  11004. 850.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11005. 850.32 s [vector] maximumBy: OK
  11006. 850.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11007. 850.32 s [vector] minimumBy: OK
  11008. 850.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11009. 850.32 s [vector] maximumOn: OK
  11010. 850.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11011. 850.32 s [vector] minimumOn: OK
  11012. 850.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11013. 850.32 s [vector] maxIndexBy: OK
  11014. 850.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11015. 850.32 s [vector] minIndexBy: OK
  11016. 850.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11017. 850.33 s [vector] ListFirstMaxIndexWins: OK
  11018. 850.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11019. 850.33 s [vector] FalseListFirstMaxIndexWins: OK
  11020. 850.33 s [vector] +++ OK, failed as expected. (after 1 test):
  11021. 850.33 s [vector] Exception:
  11022. 850.34 s [vector] Prelude.foldr1: empty list
  11023. 850.34 s [vector] CallStack (from HasCallStack):
  11024. 850.34 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  11025. 850.34 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  11026. 850.34 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11027. 850.34 s [vector] []
  11028. 850.34 s [vector] zip: OK
  11029. 850.34 s [vector] +++ OK, passed 100 tests.
  11030. 850.35 s [vector] zip3: OK
  11031. 850.35 s [vector] +++ OK, passed 100 tests.
  11032. 850.35 s [vector] unzip: OK
  11033. 850.35 s [vector] +++ OK, passed 100 tests.
  11034. 850.35 s [vector] unzip3: OK
  11035. 850.36 s [vector] +++ OK, passed 100 tests.
  11036. 850.36 s [vector] indexed: OK
  11037. 850.36 s [vector] +++ OK, passed 100 tests.
  11038. 850.36 s [vector] update: OK
  11039. 850.36 s [vector] +++ OK, passed 100 tests.
  11040. 850.36 s [vector] mempty: OK
  11041. 850.36 s [vector] +++ OK, passed 1 test.
  11042. 850.37 s [vector] mappend: OK
  11043. 850.39 s [vector] +++ OK, passed 100 tests.
  11044. 850.45 s [vector] mconcat: OK (0.08s)
  11045. 850.45 s [vector] +++ OK, passed 100 tests.
  11046. 850.45 s [vector] glength: OK
  11047. 850.45 s [vector] +++ OK, passed 100 tests.
  11048. 850.45 s [vector] unstream
  11049. 850.46 s [vector] unstream == vunstream (exact): OK
  11050. 850.46 s [vector] +++ OK, passed 100 tests.
  11051. 850.46 s [vector] unstream == vunstream (unknown): OK
  11052. 850.46 s [vector] +++ OK, passed 100 tests.
  11053. 850.46 s [vector] unstreamR ~= vunstream (exact): OK
  11054. 850.46 s [vector] +++ OK, passed 100 tests.
  11055. 850.46 s [vector] unstreamR ~= vunstream (unknown): OK
  11056. 850.46 s [vector] +++ OK, passed 100 tests.
  11057. 850.46 s [vector] Data.Vector.Storable.Vector Alignment
  11058. 850.46 s [vector] Aligned Double: OK
  11059. 850.46 s [vector] Aligned Int: OK
  11060. 850.46 s [vector] Regression tests
  11061. 850.46 s [vector] enumFromTo crash #188
  11062. 850.46 s [vector] Word8: OK
  11063. 850.46 s [vector] Word16: OK
  11064. 850.46 s [vector] Word32: OK
  11065. 850.46 s [vector] Word64: OK
  11066. 850.46 s [vector] Word: OK
  11067. 850.46 s [vector] Int8: OK
  11068. 850.46 s [vector] Int16: OK
  11069. 850.46 s [vector] Int32: OK
  11070. 850.46 s [vector] Int64: OK
  11071. 850.47 s [vector] Int: OK
  11072. 850.47 s [vector] Char: OK
  11073. 850.47 s [vector] Negative tests
  11074. 850.47 s [vector] slice out of bounds #257
  11075. 850.47 s [vector] Boxed
  11076. 850.47 s [vector] Negative ix: OK
  11077. 850.47 s [vector] Negative size: OK
  11078. 850.47 s [vector] Negative ix and size: OK
  11079. 850.47 s [vector] Too large ix: OK
  11080. 850.47 s [vector] Too large size: OK
  11081. 850.47 s [vector] Too large ix and size: OK
  11082. 850.47 s [vector] Overflow: OK
  11083. 850.47 s [vector] OutOfMemory: OK
  11084. 850.47 s [vector] Primitive
  11085. 850.47 s [vector] Negative ix: OK
  11086. 850.47 s [vector] Negative size: OK
  11087. 850.47 s [vector] Negative ix and size: OK
  11088. 850.47 s [vector] Too large ix: OK
  11089. 850.47 s [vector] Too large size: OK
  11090. 850.47 s [vector] Too large ix and size: OK
  11091. 850.47 s [vector] Overflow: OK
  11092. 850.47 s [vector] OutOfMemory: OK
  11093. 850.47 s [vector] Storable
  11094. 850.47 s [vector] Negative ix: OK
  11095. 850.47 s [vector] Negative size: OK
  11096. 850.47 s [vector] Negative ix and size: OK
  11097. 850.47 s [vector] Too large ix: OK
  11098. 850.47 s [vector] Too large size: OK
  11099. 850.47 s [vector] Too large ix and size: OK
  11100. 850.47 s [vector] Overflow: OK
  11101. 850.47 s [vector] OutOfMemory: OK
  11102. 850.47 s [vector] Unboxed
  11103. 850.47 s [vector] Negative ix: OK
  11104. 850.47 s [vector] Negative size: OK
  11105. 850.47 s [vector] Negative ix and size: OK
  11106. 850.48 s [vector] Too large ix: OK
  11107. 850.48 s [vector] Too large size: OK
  11108. 850.48 s [vector] Too large ix and size: OK
  11109. 850.48 s [vector] Overflow: OK
  11110. 850.48 s [vector] OutOfMemory: OK
  11111. 850.48 s [vector] take #282
  11112. 850.48 s [vector] Boxed: OK
  11113. 850.48 s [vector] Primitive: OK
  11114. 850.48 s [vector] Storable: OK
  11115. 850.48 s [vector] Unboxed: OK
  11116. 850.48 s [vector] Data.Vector
  11117. 850.48 s [vector] MonadFix: OK
  11118. 850.48 s [vector] toFromArray: OK
  11119. 850.48 s [vector] toFromArraySlice: OK
  11120. 850.48 s [vector] toFromArraySliceUnsafe: OK
  11121. 850.48 s [vector] toFromMutableArray: OK
  11122. 850.48 s [vector] Data.Vector.Mutable (Move): OK
  11123. 850.48 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11124. 850.48 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  11125. 850.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11126. 850.48 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  11127. 850.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11128. 850.50 s [vector] Data.Vector.Storable.Mutable (Move): OK
  11129. 850.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11130. 850.51 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.02s)
  11131. 850.51 s [vector] +++ OK, passed 1 test.
  11132. 850.52 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  11133. 850.52 s [vector] +++ OK, passed 1 test.
  11134. 850.52 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  11135. 850.52 s [vector] +++ OK, passed 100 tests.
  11136. 850.52 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  11137. 850.52 s [vector] +++ OK, passed 100 tests.
  11138. 850.52 s [vector]
  11139. 850.52 s [vector] All 2808 tests passed (17.24s)
  11140. 850.53 s [vector] Test suite vector-tests-O0: PASS
  11141. 850.53 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  11142. 850.53 s [vector] Test suite vector-tests-O2: RUNNING...
  11143. 850.68 s [vector] toplevel
  11144. 850.69 s [vector] Data.Vector.Fusion.Bundle
  11145. 850.71 s [vector] fromList.toList == id: OK
  11146. 850.71 s [vector] +++ OK, passed 100 tests.
  11147. 850.71 s [vector] toList.fromList == id: OK
  11148. 850.71 s [vector] +++ OK, passed 100 tests.
  11149. 850.71 s [vector] eq: OK
  11150. 850.71 s [vector] +++ OK, passed 100 tests.
  11151. 850.71 s [vector] length: OK
  11152. 850.71 s [vector] +++ OK, passed 100 tests.
  11153. 850.71 s [vector] null: OK
  11154. 850.71 s [vector] +++ OK, passed 100 tests.
  11155. 850.71 s [vector] empty: OK
  11156. 850.71 s [vector] +++ OK, passed 1 test.
  11157. 850.71 s [vector] singleton: OK
  11158. 850.71 s [vector] +++ OK, passed 100 tests.
  11159. 850.71 s [vector] replicate: OK
  11160. 850.71 s [vector] +++ OK, passed 100 tests.
  11161. 850.71 s [vector] cons: OK
  11162. 850.71 s [vector] +++ OK, passed 100 tests.
  11163. 850.71 s [vector] snoc: OK
  11164. 850.71 s [vector] +++ OK, passed 100 tests.
  11165. 850.71 s [vector] append: OK
  11166. 850.71 s [vector] +++ OK, passed 100 tests.
  11167. 850.71 s [vector] head: OK
  11168. 850.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11169. 850.71 s [vector] last: OK
  11170. 850.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11171. 850.71 s [vector] index: OK
  11172. 850.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11173. 850.71 s [vector] extract: OK
  11174. 850.71 s [vector] +++ OK, passed 100 tests.
  11175. 850.71 s [vector] init: OK
  11176. 850.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11177. 850.71 s [vector] tail: OK
  11178. 850.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11179. 850.71 s [vector] take: OK
  11180. 850.71 s [vector] +++ OK, passed 100 tests.
  11181. 850.71 s [vector] drop: OK
  11182. 850.71 s [vector] +++ OK, passed 100 tests.
  11183. 850.71 s [vector] map: OK
  11184. 850.71 s [vector] +++ OK, passed 100 tests.
  11185. 850.71 s [vector] zipWith: OK
  11186. 850.71 s [vector] +++ OK, passed 100 tests.
  11187. 850.71 s [vector] zipWith3: OK
  11188. 850.71 s [vector] +++ OK, passed 100 tests.
  11189. 850.71 s [vector] filter: OK
  11190. 850.71 s [vector] +++ OK, passed 100 tests.
  11191. 850.71 s [vector] takeWhile: OK
  11192. 850.71 s [vector] +++ OK, passed 100 tests.
  11193. 850.71 s [vector] dropWhile: OK
  11194. 850.71 s [vector] +++ OK, passed 100 tests.
  11195. 850.71 s [vector] elem: OK
  11196. 850.71 s [vector] +++ OK, passed 100 tests.
  11197. 850.71 s [vector] notElem: OK
  11198. 850.71 s [vector] +++ OK, passed 100 tests.
  11199. 850.71 s [vector] find: OK
  11200. 850.71 s [vector] +++ OK, passed 100 tests.
  11201. 850.71 s [vector] findIndex: OK
  11202. 850.71 s [vector] +++ OK, passed 100 tests.
  11203. 850.71 s [vector] foldl: OK
  11204. 850.71 s [vector] +++ OK, passed 100 tests.
  11205. 850.71 s [vector] foldl1: OK
  11206. 850.71 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11207. 850.71 s [vector] foldl': OK
  11208. 850.71 s [vector] +++ OK, passed 100 tests.
  11209. 850.71 s [vector] foldl1': OK
  11210. 850.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11211. 850.71 s [vector] foldr: OK
  11212. 850.71 s [vector] +++ OK, passed 100 tests.
  11213. 850.71 s [vector] foldr1: OK
  11214. 850.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11215. 850.71 s [vector] prescanl: OK
  11216. 850.71 s [vector] +++ OK, passed 100 tests.
  11217. 850.71 s [vector] prescanl': OK
  11218. 850.71 s [vector] +++ OK, passed 100 tests.
  11219. 850.71 s [vector] postscanl: OK
  11220. 850.71 s [vector] +++ OK, passed 100 tests.
  11221. 850.71 s [vector] postscanl': OK
  11222. 850.71 s [vector] +++ OK, passed 100 tests.
  11223. 850.71 s [vector] scanl: OK
  11224. 850.71 s [vector] +++ OK, passed 100 tests.
  11225. 850.71 s [vector] scanl': OK
  11226. 850.71 s [vector] +++ OK, passed 100 tests.
  11227. 850.71 s [vector] scanl1: OK
  11228. 850.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11229. 850.71 s [vector] scanl1': OK
  11230. 850.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11231. 850.71 s [vector] concatMap: OK
  11232. 850.71 s [vector] +++ OK, passed 100 tests.
  11233. 850.71 s [vector] unfoldr: OK
  11234. 850.71 s [vector] +++ OK, passed 100 tests.
  11235. 850.71 s [vector] and: OK
  11236. 850.71 s [vector] +++ OK, passed 100 tests.
  11237. 850.71 s [vector] or: OK
  11238. 850.71 s [vector] +++ OK, passed 100 tests.
  11239. 850.71 s [vector] Tests.Vector.Boxed
  11240. 850.71 s [vector] Bool
  11241. 850.71 s [vector] fromList.toList == id: OK
  11242. 850.71 s [vector] +++ OK, passed 100 tests.
  11243. 850.71 s [vector] toList.fromList == id: OK
  11244. 850.71 s [vector] +++ OK, passed 100 tests.
  11245. 850.71 s [vector] unstream.stream == id: OK
  11246. 850.71 s [vector] +++ OK, passed 100 tests.
  11247. 850.71 s [vector] stream.unstream == id: OK
  11248. 850.71 s [vector] +++ OK, passed 100 tests.
  11249. 850.71 s [vector] eq: OK
  11250. 850.71 s [vector] +++ OK, passed 100 tests.
  11251. 850.71 s [vector] length: OK
  11252. 850.71 s [vector] +++ OK, passed 100 tests.
  11253. 850.71 s [vector] null: OK
  11254. 850.71 s [vector] +++ OK, passed 100 tests.
  11255. 850.71 s [vector] index: OK
  11256. 850.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11257. 850.71 s [vector] safeIndex: OK
  11258. 850.71 s [vector] +++ OK, passed 100 tests.
  11259. 850.71 s [vector] head: OK
  11260. 850.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11261. 850.71 s [vector] last: OK
  11262. 850.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11263. 850.71 s [vector] unsafeIndex: OK
  11264. 850.71 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11265. 850.71 s [vector] unsafeHead: OK
  11266. 850.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11267. 850.71 s [vector] unsafeLast: OK
  11268. 850.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11269. 850.71 s [vector] slice: OK
  11270. 850.71 s [vector] +++ OK, passed 100 tests.
  11271. 850.71 s [vector] init: OK
  11272. 850.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11273. 850.71 s [vector] tail: OK
  11274. 850.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11275. 850.71 s [vector] take: OK
  11276. 850.71 s [vector] +++ OK, passed 100 tests.
  11277. 850.71 s [vector] drop: OK
  11278. 850.71 s [vector] +++ OK, passed 100 tests.
  11279. 850.71 s [vector] splitAt: OK
  11280. 850.71 s [vector] +++ OK, passed 100 tests.
  11281. 850.71 s [vector] empty: OK
  11282. 850.71 s [vector] +++ OK, passed 1 test.
  11283. 850.71 s [vector] singleton: OK
  11284. 850.71 s [vector] +++ OK, passed 100 tests.
  11285. 850.71 s [vector] replicate: OK
  11286. 850.71 s [vector] +++ OK, passed 100 tests.
  11287. 850.71 s [vector] generate: OK
  11288. 850.71 s [vector] +++ OK, passed 100 tests.
  11289. 850.71 s [vector] iterateN: OK
  11290. 850.71 s [vector] +++ OK, passed 100 tests.
  11291. 850.71 s [vector] iterateNM: OK
  11292. 850.71 s [vector] +++ OK, passed 100 tests.
  11293. 850.71 s [vector] generateM: OK (0.02s)
  11294. 850.71 s [vector] +++ OK, passed 100 tests.
  11295. 850.72 s [vector] replicateM: OK (0.02s)
  11296. 850.72 s [vector] +++ OK, passed 100 tests.
  11297. 850.72 s [vector] create: OK
  11298. 850.72 s [vector] +++ OK, passed 100 tests.
  11299. 850.72 s [vector] createT: OK
  11300. 850.72 s [vector] +++ OK, passed 100 tests.
  11301. 850.72 s [vector] unfoldr: OK
  11302. 850.72 s [vector] +++ OK, passed 100 tests.
  11303. 850.72 s [vector] unfoldrN: OK
  11304. 850.72 s [vector] +++ OK, passed 100 tests.
  11305. 850.72 s [vector] unfoldrExactN: OK
  11306. 850.72 s [vector] +++ OK, passed 100 tests.
  11307. 850.72 s [vector] unfoldrM: OK (0.02s)
  11308. 850.72 s [vector] +++ OK, passed 100 tests.
  11309. 850.72 s [vector] unfoldrNM: OK
  11310. 850.72 s [vector] +++ OK, passed 100 tests.
  11311. 850.72 s [vector] unfoldrExactNM: OK (0.03s)
  11312. 850.72 s [vector] +++ OK, passed 100 tests.
  11313. 850.72 s [vector] constructN: OK
  11314. 850.72 s [vector] +++ OK, passed 100 tests.
  11315. 850.72 s [vector] constructrN: OK
  11316. 850.73 s [vector] +++ OK, passed 100 tests.
  11317. 850.73 s [vector] cons: OK
  11318. 850.73 s [vector] +++ OK, passed 100 tests.
  11319. 850.73 s [vector] snoc: OK
  11320. 850.73 s [vector] +++ OK, passed 100 tests.
  11321. 850.73 s [vector] append: OK
  11322. 850.73 s [vector] +++ OK, passed 100 tests.
  11323. 850.74 s [vector] concat: OK
  11324. 850.74 s [vector] +++ OK, passed 100 tests.
  11325. 850.74 s [vector] force: OK
  11326. 850.74 s [vector] +++ OK, passed 100 tests.
  11327. 850.74 s [vector] upd: OK
  11328. 850.74 s [vector] +++ OK, passed 100 tests.
  11329. 850.75 s [vector] accum: OK
  11330. 850.75 s [vector] +++ OK, passed 100 tests.
  11331. 850.75 s [vector] reverse: OK
  11332. 850.75 s [vector] +++ OK, passed 100 tests.
  11333. 850.75 s [vector] backpermute: OK
  11334. 850.75 s [vector] +++ OK, passed 100 tests.
  11335. 850.75 s [vector] map: OK
  11336. 850.75 s [vector] +++ OK, passed 100 tests.
  11337. 850.75 s [vector] imap: OK
  11338. 850.75 s [vector] +++ OK, passed 100 tests.
  11339. 850.75 s [vector] concatMap: OK
  11340. 850.75 s [vector] +++ OK, passed 100 tests.
  11341. 850.75 s [vector] mapM: OK
  11342. 850.75 s [vector] +++ OK, passed 100 tests.
  11343. 850.75 s [vector] mapM_: OK
  11344. 850.76 s [vector] +++ OK, passed 100 tests.
  11345. 850.76 s [vector] forM: OK
  11346. 850.76 s [vector] +++ OK, passed 100 tests.
  11347. 850.76 s [vector] forM_: OK
  11348. 850.76 s [vector] +++ OK, passed 100 tests.
  11349. 850.77 s [vector] imapM: OK
  11350. 850.77 s [vector] +++ OK, passed 100 tests.
  11351. 850.77 s [vector] imapM_: OK
  11352. 850.77 s [vector] +++ OK, passed 100 tests.
  11353. 850.77 s [vector] zipWith: OK
  11354. 850.77 s [vector] +++ OK, passed 100 tests.
  11355. 850.77 s [vector] zipWith3: OK
  11356. 850.77 s [vector] +++ OK, passed 100 tests.
  11357. 850.77 s [vector] izipWith: OK
  11358. 850.77 s [vector] +++ OK, passed 100 tests.
  11359. 850.77 s [vector] izipWith3: OK
  11360. 850.77 s [vector] +++ OK, passed 100 tests.
  11361. 850.77 s [vector] izipWithM: OK
  11362. 850.78 s [vector] +++ OK, passed 100 tests.
  11363. 850.78 s [vector] izipWithM_: OK
  11364. 850.78 s [vector] +++ OK, passed 100 tests.
  11365. 850.79 s [vector] zipWithM: OK
  11366. 850.79 s [vector] +++ OK, passed 100 tests.
  11367. 850.79 s [vector] zipWithM_: OK
  11368. 850.79 s [vector] +++ OK, passed 100 tests.
  11369. 850.79 s [vector] filter: OK
  11370. 850.80 s [vector] +++ OK, passed 100 tests.
  11371. 850.80 s [vector] ifilter: OK
  11372. 850.80 s [vector] +++ OK, passed 100 tests.
  11373. 850.81 s [vector] filterM: OK
  11374. 850.81 s [vector] +++ OK, passed 100 tests.
  11375. 850.81 s [vector] uniq: OK
  11376. 850.81 s [vector] +++ OK, passed 100 tests.
  11377. 850.81 s [vector] mapMaybe: OK
  11378. 850.81 s [vector] +++ OK, passed 100 tests.
  11379. 850.81 s [vector] imapMaybe: OK
  11380. 850.81 s [vector] +++ OK, passed 100 tests.
  11381. 850.81 s [vector] takeWhile: OK
  11382. 850.81 s [vector] +++ OK, passed 100 tests.
  11383. 850.81 s [vector] dropWhile: OK
  11384. 850.81 s [vector] +++ OK, passed 100 tests.
  11385. 850.82 s [vector] partition: OK
  11386. 850.82 s [vector] +++ OK, passed 100 tests.
  11387. 850.82 s [vector] partitionWith: OK
  11388. 850.82 s [vector] +++ OK, passed 100 tests.
  11389. 850.82 s [vector] span: OK
  11390. 850.82 s [vector] +++ OK, passed 100 tests.
  11391. 850.82 s [vector] break: OK
  11392. 850.82 s [vector] +++ OK, passed 100 tests.
  11393. 850.82 s [vector] spanR: OK
  11394. 850.82 s [vector] +++ OK, passed 100 tests.
  11395. 850.82 s [vector] breakR: OK
  11396. 850.82 s [vector] +++ OK, passed 100 tests.
  11397. 850.82 s [vector] groupBy: OK
  11398. 850.82 s [vector] +++ OK, passed 100 tests.
  11399. 850.82 s [vector] elem: OK
  11400. 850.82 s [vector] +++ OK, passed 100 tests.
  11401. 850.82 s [vector] notElem: OK
  11402. 850.82 s [vector] +++ OK, passed 100 tests.
  11403. 850.82 s [vector] find: OK
  11404. 850.82 s [vector] +++ OK, passed 100 tests.
  11405. 850.82 s [vector] findIndex: OK
  11406. 850.82 s [vector] +++ OK, passed 100 tests.
  11407. 850.82 s [vector] findIndexR: OK
  11408. 850.82 s [vector] +++ OK, passed 100 tests.
  11409. 850.82 s [vector] findIndices: OK
  11410. 850.82 s [vector] +++ OK, passed 100 tests.
  11411. 850.82 s [vector] elemIndex: OK
  11412. 850.82 s [vector] +++ OK, passed 100 tests.
  11413. 850.82 s [vector] elemIndices: OK
  11414. 850.82 s [vector] +++ OK, passed 100 tests.
  11415. 850.82 s [vector] foldl: OK
  11416. 850.83 s [vector] +++ OK, passed 100 tests.
  11417. 850.83 s [vector] foldl1: OK
  11418. 850.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11419. 850.83 s [vector] foldl': OK
  11420. 850.83 s [vector] +++ OK, passed 100 tests.
  11421. 850.83 s [vector] foldl1': OK
  11422. 850.83 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11423. 850.83 s [vector] foldr: OK
  11424. 850.83 s [vector] +++ OK, passed 100 tests.
  11425. 850.83 s [vector] foldr1: OK
  11426. 850.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11427. 850.83 s [vector] foldr': OK
  11428. 850.83 s [vector] +++ OK, passed 100 tests.
  11429. 850.83 s [vector] foldr1': OK
  11430. 850.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11431. 850.83 s [vector] ifoldl: OK
  11432. 850.83 s [vector] +++ OK, passed 100 tests.
  11433. 850.84 s [vector] ifoldl': OK
  11434. 850.84 s [vector] +++ OK, passed 100 tests.
  11435. 850.84 s [vector] ifoldr: OK
  11436. 850.84 s [vector] +++ OK, passed 100 tests.
  11437. 850.84 s [vector] ifoldr': OK
  11438. 850.84 s [vector] +++ OK, passed 100 tests.
  11439. 850.84 s [vector] ifoldM: OK
  11440. 850.84 s [vector] +++ OK, passed 100 tests.
  11441. 850.84 s [vector] ifoldM': OK
  11442. 850.84 s [vector] +++ OK, passed 100 tests.
  11443. 850.86 s [vector] ifoldM_: OK (0.01s)
  11444. 850.86 s [vector] +++ OK, passed 100 tests.
  11445. 850.86 s [vector] ifoldM'_: OK
  11446. 850.86 s [vector] +++ OK, passed 100 tests.
  11447. 850.86 s [vector] all: OK
  11448. 850.86 s [vector] +++ OK, passed 100 tests.
  11449. 850.86 s [vector] any: OK
  11450. 850.86 s [vector] +++ OK, passed 100 tests.
  11451. 850.86 s [vector] prescanl: OK
  11452. 850.86 s [vector] +++ OK, passed 100 tests.
  11453. 850.87 s [vector] prescanl': OK
  11454. 850.87 s [vector] +++ OK, passed 100 tests.
  11455. 850.87 s [vector] postscanl: OK
  11456. 850.87 s [vector] +++ OK, passed 100 tests.
  11457. 850.88 s [vector] postscanl': OK
  11458. 850.88 s [vector] +++ OK, passed 100 tests.
  11459. 850.88 s [vector] scanl: OK (0.01s)
  11460. 850.88 s [vector] +++ OK, passed 100 tests.
  11461. 850.88 s [vector] scanl': OK
  11462. 850.88 s [vector] +++ OK, passed 100 tests.
  11463. 850.88 s [vector] scanl1: OK
  11464. 850.88 s [vector] +++ OK, passed 100 tests.
  11465. 850.88 s [vector] scanl1': OK
  11466. 850.88 s [vector] +++ OK, passed 100 tests.
  11467. 850.89 s [vector] iscanl: OK
  11468. 850.89 s [vector] +++ OK, passed 100 tests.
  11469. 850.89 s [vector] iscanl': OK
  11470. 850.89 s [vector] +++ OK, passed 100 tests.
  11471. 850.89 s [vector] prescanr: OK
  11472. 850.89 s [vector] +++ OK, passed 100 tests.
  11473. 850.89 s [vector] prescanr': OK
  11474. 850.89 s [vector] +++ OK, passed 100 tests.
  11475. 850.89 s [vector] postscanr: OK
  11476. 850.89 s [vector] +++ OK, passed 100 tests.
  11477. 850.89 s [vector] postscanr': OK
  11478. 850.90 s [vector] +++ OK, passed 100 tests.
  11479. 850.90 s [vector] scanr: OK
  11480. 850.90 s [vector] +++ OK, passed 100 tests.
  11481. 850.90 s [vector] scanr': OK
  11482. 850.90 s [vector] +++ OK, passed 100 tests.
  11483. 850.90 s [vector] scanr1: OK
  11484. 850.90 s [vector] +++ OK, passed 100 tests.
  11485. 850.90 s [vector] scanr1': OK
  11486. 850.90 s [vector] +++ OK, passed 100 tests.
  11487. 850.90 s [vector] iscanr: OK
  11488. 850.90 s [vector] +++ OK, passed 100 tests.
  11489. 850.90 s [vector] iscanr': OK
  11490. 850.90 s [vector] +++ OK, passed 100 tests.
  11491. 850.90 s [vector] mut_read: OK
  11492. 850.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11493. 850.90 s [vector] mut_write: OK
  11494. 850.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11495. 850.91 s [vector] mut_modify: OK
  11496. 850.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11497. 850.91 s [vector] mut_generate: OK
  11498. 850.91 s [vector] +++ OK, passed 100 tests.
  11499. 850.92 s [vector] mut_generateM: OK
  11500. 850.92 s [vector] +++ OK, passed 100 tests.
  11501. 850.92 s [vector] mut_mapM_: OK
  11502. 850.93 s [vector] +++ OK, passed 100 tests.
  11503. 850.94 s [vector] mut_imapM_: OK
  11504. 850.94 s [vector] +++ OK, passed 100 tests.
  11505. 850.94 s [vector] mut_forM_: OK
  11506. 850.94 s [vector] +++ OK, passed 100 tests.
  11507. 850.95 s [vector] mut_iforM_: OK (0.01s)
  11508. 850.95 s [vector] +++ OK, passed 100 tests.
  11509. 850.95 s [vector] mut_foldr: OK
  11510. 850.95 s [vector] +++ OK, passed 100 tests.
  11511. 850.95 s [vector] mut_foldr': OK
  11512. 850.95 s [vector] +++ OK, passed 100 tests.
  11513. 850.95 s [vector] mut_foldl: OK
  11514. 850.95 s [vector] +++ OK, passed 100 tests.
  11515. 850.95 s [vector] mut_foldl': OK
  11516. 850.96 s [vector] +++ OK, passed 100 tests.
  11517. 850.96 s [vector] mut_ifoldr: OK
  11518. 850.96 s [vector] +++ OK, passed 100 tests.
  11519. 850.96 s [vector] mut_ifoldr': OK
  11520. 850.96 s [vector] +++ OK, passed 100 tests.
  11521. 850.96 s [vector] mut_ifoldl: OK
  11522. 850.96 s [vector] +++ OK, passed 100 tests.
  11523. 850.96 s [vector] mut_ifoldl': OK
  11524. 850.96 s [vector] +++ OK, passed 100 tests.
  11525. 850.96 s [vector] mut_foldM: OK
  11526. 850.96 s [vector] +++ OK, passed 100 tests.
  11527. 850.96 s [vector] mut_foldM': OK
  11528. 850.96 s [vector] +++ OK, passed 100 tests.
  11529. 850.96 s [vector] mut_foldrM: OK
  11530. 850.96 s [vector] +++ OK, passed 100 tests.
  11531. 850.97 s [vector] mut_foldrM': OK
  11532. 850.97 s [vector] +++ OK, passed 100 tests.
  11533. 850.97 s [vector] mut_ifoldM: OK
  11534. 850.97 s [vector] +++ OK, passed 100 tests.
  11535. 850.97 s [vector] mut_ifoldM': OK
  11536. 850.97 s [vector] +++ OK, passed 100 tests.
  11537. 850.97 s [vector] mut_ifoldrM: OK
  11538. 850.97 s [vector] +++ OK, passed 100 tests.
  11539. 850.97 s [vector] mut_ifoldrM': OK
  11540. 850.97 s [vector] +++ OK, passed 100 tests.
  11541. 850.97 s [vector] compare: OK
  11542. 850.97 s [vector] +++ OK, passed 100 tests.
  11543. 850.97 s [vector] maximum: OK
  11544. 850.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11545. 850.97 s [vector] minimum: OK
  11546. 850.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11547. 850.97 s [vector] minIndex: OK
  11548. 850.97 s [vector] +++ OK, passed 100 tests; 24 discarded.
  11549. 850.98 s [vector] maxIndex: OK
  11550. 850.98 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11551. 850.98 s [vector] maximumBy: OK
  11552. 850.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11553. 850.98 s [vector] minimumBy: OK
  11554. 850.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11555. 850.98 s [vector] maximumOn: OK
  11556. 850.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11557. 850.98 s [vector] minimumOn: OK
  11558. 850.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11559. 850.98 s [vector] maxIndexBy: OK
  11560. 850.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11561. 850.98 s [vector] minIndexBy: OK
  11562. 850.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11563. 850.98 s [vector] ListFirstMaxIndexWins: OK
  11564. 850.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11565. 850.98 s [vector] FalseListFirstMaxIndexWins: OK
  11566. 850.98 s [vector] +++ OK, failed as expected. (after 1 test):
  11567. 850.98 s [vector] Exception:
  11568. 850.98 s [vector] Prelude.foldr1: empty list
  11569. 850.98 s [vector] CallStack (from HasCallStack):
  11570. 850.98 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  11571. 850.98 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  11572. 850.98 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11573. 850.98 s [vector] []
  11574. 850.98 s [vector] zip: OK
  11575. 850.98 s [vector] +++ OK, passed 100 tests.
  11576. 850.98 s [vector] zip3: OK
  11577. 850.98 s [vector] +++ OK, passed 100 tests.
  11578. 850.98 s [vector] unzip: OK
  11579. 850.98 s [vector] +++ OK, passed 100 tests.
  11580. 850.98 s [vector] unzip3: OK
  11581. 850.98 s [vector] +++ OK, passed 100 tests.
  11582. 850.98 s [vector] indexed: OK
  11583. 850.98 s [vector] +++ OK, passed 100 tests.
  11584. 850.98 s [vector] update: OK
  11585. 850.99 s [vector] +++ OK, passed 100 tests.
  11586. 850.99 s [vector] concat: OK
  11587. 850.99 s [vector] +++ OK, passed 100 tests.
  11588. 850.99 s [vector] mempty: OK
  11589. 850.99 s [vector] +++ OK, passed 1 test.
  11590. 851.00 s [vector] mappend: OK
  11591. 851.00 s [vector] +++ OK, passed 100 tests.
  11592. 851.00 s [vector] mconcat: OK
  11593. 851.00 s [vector] +++ OK, passed 100 tests.
  11594. 851.00 s [vector] fmap: OK
  11595. 851.00 s [vector] +++ OK, passed 100 tests.
  11596. 851.01 s [vector] return: OK
  11597. 851.01 s [vector] +++ OK, passed 100 tests.
  11598. 851.02 s [vector] bind: OK (0.01s)
  11599. 851.02 s [vector] +++ OK, passed 100 tests.
  11600. 851.02 s [vector] mzip: OK
  11601. 851.02 s [vector] +++ OK, passed 100 tests.
  11602. 851.02 s [vector] munzip: OK
  11603. 851.02 s [vector] +++ OK, passed 100 tests.
  11604. 851.02 s [vector] applicative_pure: OK
  11605. 851.03 s [vector] +++ OK, passed 100 tests.
  11606. 851.04 s [vector] applicative_appl: OK (0.02s)
  11607. 851.04 s [vector] +++ OK, passed 100 tests.
  11608. 851.04 s [vector] alternative_empty: OK
  11609. 851.04 s [vector] +++ OK, passed 1 test.
  11610. 851.05 s [vector] alternative_or: OK
  11611. 851.05 s [vector] +++ OK, passed 100 tests.
  11612. 851.08 s [vector] sequence: OK (0.03s)
  11613. 851.09 s [vector] +++ OK, passed 100 tests.
  11614. 851.09 s [vector] sequence_: OK (0.02s)
  11615. 851.09 s [vector] +++ OK, passed 100 tests.
  11616. 851.09 s [vector] glength: OK
  11617. 851.09 s [vector] +++ OK, passed 100 tests.
  11618. 851.09 s [vector] and: OK
  11619. 851.09 s [vector] +++ OK, passed 100 tests.
  11620. 851.09 s [vector] or: OK
  11621. 851.09 s [vector] +++ OK, passed 100 tests.
  11622. 851.09 s [vector] Int
  11623. 851.09 s [vector] fromList.toList == id: OK
  11624. 851.10 s [vector] +++ OK, passed 100 tests.
  11625. 851.10 s [vector] toList.fromList == id: OK
  11626. 851.10 s [vector] +++ OK, passed 100 tests.
  11627. 851.10 s [vector] unstream.stream == id: OK
  11628. 851.10 s [vector] +++ OK, passed 100 tests.
  11629. 851.10 s [vector] stream.unstream == id: OK
  11630. 851.10 s [vector] +++ OK, passed 100 tests.
  11631. 851.10 s [vector] eq: OK
  11632. 851.10 s [vector] +++ OK, passed 100 tests.
  11633. 851.10 s [vector] length: OK
  11634. 851.10 s [vector] +++ OK, passed 100 tests.
  11635. 851.10 s [vector] null: OK
  11636. 851.10 s [vector] +++ OK, passed 100 tests.
  11637. 851.10 s [vector] index: OK
  11638. 851.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11639. 851.10 s [vector] safeIndex: OK
  11640. 851.10 s [vector] +++ OK, passed 100 tests.
  11641. 851.10 s [vector] head: OK
  11642. 851.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11643. 851.10 s [vector] last: OK
  11644. 851.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11645. 851.10 s [vector] unsafeIndex: OK
  11646. 851.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11647. 851.10 s [vector] unsafeHead: OK
  11648. 851.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11649. 851.10 s [vector] unsafeLast: OK
  11650. 851.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11651. 851.10 s [vector] slice: OK
  11652. 851.10 s [vector] +++ OK, passed 100 tests.
  11653. 851.10 s [vector] init: OK
  11654. 851.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11655. 851.10 s [vector] tail: OK
  11656. 851.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11657. 851.10 s [vector] take: OK
  11658. 851.10 s [vector] +++ OK, passed 100 tests.
  11659. 851.10 s [vector] drop: OK
  11660. 851.10 s [vector] +++ OK, passed 100 tests.
  11661. 851.10 s [vector] splitAt: OK
  11662. 851.10 s [vector] +++ OK, passed 100 tests.
  11663. 851.10 s [vector] empty: OK
  11664. 851.10 s [vector] +++ OK, passed 1 test.
  11665. 851.10 s [vector] singleton: OK
  11666. 851.10 s [vector] +++ OK, passed 100 tests.
  11667. 851.10 s [vector] replicate: OK
  11668. 851.10 s [vector] +++ OK, passed 100 tests.
  11669. 851.10 s [vector] generate: OK
  11670. 851.10 s [vector] +++ OK, passed 100 tests.
  11671. 851.10 s [vector] iterateN: OK
  11672. 851.11 s [vector] +++ OK, passed 100 tests.
  11673. 851.15 s [vector] iterateNM: OK (0.02s)
  11674. 851.15 s [vector] +++ OK, passed 100 tests.
  11675. 851.17 s [vector] generateM: OK (0.03s)
  11676. 851.17 s [vector] +++ OK, passed 100 tests.
  11677. 851.18 s [vector] replicateM: OK
  11678. 851.18 s [vector] +++ OK, passed 100 tests.
  11679. 851.18 s [vector] create: OK
  11680. 851.18 s [vector] +++ OK, passed 100 tests.
  11681. 851.18 s [vector] createT: OK
  11682. 851.18 s [vector] +++ OK, passed 100 tests.
  11683. 851.18 s [vector] unfoldr: OK
  11684. 851.18 s [vector] +++ OK, passed 100 tests.
  11685. 851.18 s [vector] unfoldrN: OK
  11686. 851.18 s [vector] +++ OK, passed 100 tests.
  11687. 851.18 s [vector] unfoldrExactN: OK
  11688. 851.18 s [vector] +++ OK, passed 100 tests.
  11689. 851.18 s [vector] unfoldrM: OK
  11690. 851.18 s [vector] +++ OK, passed 100 tests.
  11691. 851.18 s [vector] unfoldrNM: OK
  11692. 851.18 s [vector] +++ OK, passed 100 tests.
  11693. 851.20 s [vector] unfoldrExactNM: OK (0.01s)
  11694. 851.20 s [vector] +++ OK, passed 100 tests.
  11695. 851.20 s [vector] constructN: OK
  11696. 851.20 s [vector] +++ OK, passed 100 tests.
  11697. 851.20 s [vector] constructrN: OK
  11698. 851.20 s [vector] +++ OK, passed 100 tests.
  11699. 851.20 s [vector] cons: OK
  11700. 851.20 s [vector] +++ OK, passed 100 tests.
  11701. 851.20 s [vector] snoc: OK
  11702. 851.20 s [vector] +++ OK, passed 100 tests.
  11703. 851.21 s [vector] append: OK
  11704. 851.21 s [vector] +++ OK, passed 100 tests.
  11705. 851.22 s [vector] concat: OK (0.01s)
  11706. 851.22 s [vector] +++ OK, passed 100 tests.
  11707. 851.22 s [vector] force: OK
  11708. 851.22 s [vector] +++ OK, passed 100 tests.
  11709. 851.22 s [vector] upd: OK
  11710. 851.22 s [vector] +++ OK, passed 100 tests.
  11711. 851.22 s [vector] accum: OK
  11712. 851.22 s [vector] +++ OK, passed 100 tests.
  11713. 851.22 s [vector] reverse: OK
  11714. 851.22 s [vector] +++ OK, passed 100 tests.
  11715. 851.22 s [vector] backpermute: OK
  11716. 851.22 s [vector] +++ OK, passed 100 tests.
  11717. 851.22 s [vector] map: OK
  11718. 851.23 s [vector] +++ OK, passed 100 tests.
  11719. 851.23 s [vector] imap: OK
  11720. 851.23 s [vector] +++ OK, passed 100 tests.
  11721. 851.23 s [vector] concatMap: OK
  11722. 851.23 s [vector] +++ OK, passed 100 tests.
  11723. 851.23 s [vector] mapM: OK
  11724. 851.25 s [vector] +++ OK, passed 100 tests.
  11725. 851.25 s [vector] mapM_: OK (0.02s)
  11726. 851.25 s [vector] +++ OK, passed 100 tests.
  11727. 851.27 s [vector] forM: OK
  11728. 851.27 s [vector] +++ OK, passed 100 tests.
  11729. 851.27 s [vector] forM_: OK (0.02s)
  11730. 851.27 s [vector] +++ OK, passed 100 tests.
  11731. 851.29 s [vector] imapM: OK
  11732. 851.29 s [vector] +++ OK, passed 100 tests.
  11733. 851.29 s [vector] imapM_: OK (0.02s)
  11734. 851.29 s [vector] +++ OK, passed 100 tests.
  11735. 851.29 s [vector] zipWith: OK
  11736. 851.29 s [vector] +++ OK, passed 100 tests.
  11737. 851.30 s [vector] zipWith3: OK
  11738. 851.30 s [vector] +++ OK, passed 100 tests.
  11739. 851.30 s [vector] izipWith: OK
  11740. 851.30 s [vector] +++ OK, passed 100 tests.
  11741. 851.30 s [vector] izipWith3: OK
  11742. 851.30 s [vector] +++ OK, passed 100 tests.
  11743. 851.31 s [vector] izipWithM: OK
  11744. 851.31 s [vector] +++ OK, passed 100 tests.
  11745. 851.32 s [vector] izipWithM_: OK (0.01s)
  11746. 851.32 s [vector] +++ OK, passed 100 tests.
  11747. 851.33 s [vector] zipWithM: OK
  11748. 851.33 s [vector] +++ OK, passed 100 tests.
  11749. 851.33 s [vector] zipWithM_: OK (0.01s)
  11750. 851.33 s [vector] +++ OK, passed 100 tests.
  11751. 851.33 s [vector] filter: OK
  11752. 851.33 s [vector] +++ OK, passed 100 tests.
  11753. 851.33 s [vector] ifilter: OK
  11754. 851.35 s [vector] +++ OK, passed 100 tests.
  11755. 851.36 s [vector] filterM: OK (0.03s)
  11756. 851.36 s [vector] +++ OK, passed 100 tests.
  11757. 851.36 s [vector] uniq: OK
  11758. 851.36 s [vector] +++ OK, passed 100 tests.
  11759. 851.36 s [vector] mapMaybe: OK
  11760. 851.36 s [vector] +++ OK, passed 100 tests.
  11761. 851.36 s [vector] imapMaybe: OK
  11762. 851.36 s [vector] +++ OK, passed 100 tests.
  11763. 851.36 s [vector] takeWhile: OK
  11764. 851.36 s [vector] +++ OK, passed 100 tests.
  11765. 851.36 s [vector] dropWhile: OK
  11766. 851.36 s [vector] +++ OK, passed 100 tests.
  11767. 851.37 s [vector] partition: OK
  11768. 851.37 s [vector] +++ OK, passed 100 tests.
  11769. 851.37 s [vector] partitionWith: OK
  11770. 851.37 s [vector] +++ OK, passed 100 tests.
  11771. 851.37 s [vector] span: OK
  11772. 851.37 s [vector] +++ OK, passed 100 tests.
  11773. 851.37 s [vector] break: OK
  11774. 851.37 s [vector] +++ OK, passed 100 tests.
  11775. 851.37 s [vector] spanR: OK
  11776. 851.37 s [vector] +++ OK, passed 100 tests.
  11777. 851.37 s [vector] breakR: OK
  11778. 851.37 s [vector] +++ OK, passed 100 tests.
  11779. 851.37 s [vector] groupBy: OK
  11780. 851.37 s [vector] +++ OK, passed 100 tests.
  11781. 851.37 s [vector] elem: OK
  11782. 851.37 s [vector] +++ OK, passed 100 tests.
  11783. 851.37 s [vector] notElem: OK
  11784. 851.37 s [vector] +++ OK, passed 100 tests.
  11785. 851.37 s [vector] find: OK
  11786. 851.37 s [vector] +++ OK, passed 100 tests.
  11787. 851.37 s [vector] findIndex: OK
  11788. 851.37 s [vector] +++ OK, passed 100 tests.
  11789. 851.37 s [vector] findIndexR: OK
  11790. 851.37 s [vector] +++ OK, passed 100 tests.
  11791. 851.38 s [vector] findIndices: OK
  11792. 851.38 s [vector] +++ OK, passed 100 tests.
  11793. 851.38 s [vector] elemIndex: OK
  11794. 851.38 s [vector] +++ OK, passed 100 tests.
  11795. 851.38 s [vector] elemIndices: OK
  11796. 851.38 s [vector] +++ OK, passed 100 tests.
  11797. 851.38 s [vector] foldl: OK
  11798. 851.38 s [vector] +++ OK, passed 100 tests.
  11799. 851.38 s [vector] foldl1: OK
  11800. 851.38 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11801. 851.38 s [vector] foldl': OK
  11802. 851.39 s [vector] +++ OK, passed 100 tests.
  11803. 851.39 s [vector] foldl1': OK
  11804. 851.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11805. 851.39 s [vector] foldr: OK
  11806. 851.39 s [vector] +++ OK, passed 100 tests.
  11807. 851.39 s [vector] foldr1: OK
  11808. 851.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11809. 851.40 s [vector] foldr': OK
  11810. 851.40 s [vector] +++ OK, passed 100 tests.
  11811. 851.40 s [vector] foldr1': OK
  11812. 851.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11813. 851.40 s [vector] ifoldl: OK
  11814. 851.40 s [vector] +++ OK, passed 100 tests.
  11815. 851.40 s [vector] ifoldl': OK
  11816. 851.40 s [vector] +++ OK, passed 100 tests.
  11817. 851.40 s [vector] ifoldr: OK
  11818. 851.41 s [vector] +++ OK, passed 100 tests.
  11819. 851.41 s [vector] ifoldr': OK
  11820. 851.41 s [vector] +++ OK, passed 100 tests.
  11821. 851.42 s [vector] ifoldM: OK
  11822. 851.42 s [vector] +++ OK, passed 100 tests.
  11823. 851.43 s [vector] ifoldM': OK
  11824. 851.43 s [vector] +++ OK, passed 100 tests.
  11825. 851.45 s [vector] ifoldM_: OK (0.01s)
  11826. 851.45 s [vector] +++ OK, passed 100 tests.
  11827. 851.46 s [vector] ifoldM'_: OK (0.03s)
  11828. 851.46 s [vector] +++ OK, passed 100 tests.
  11829. 851.46 s [vector] all: OK
  11830. 851.46 s [vector] +++ OK, passed 100 tests.
  11831. 851.46 s [vector] any: OK
  11832. 851.46 s [vector] +++ OK, passed 100 tests.
  11833. 851.46 s [vector] prescanl: OK
  11834. 851.46 s [vector] +++ OK, passed 100 tests.
  11835. 851.46 s [vector] prescanl': OK
  11836. 851.47 s [vector] +++ OK, passed 100 tests.
  11837. 851.47 s [vector] postscanl: OK
  11838. 851.47 s [vector] +++ OK, passed 100 tests.
  11839. 851.47 s [vector] postscanl': OK
  11840. 851.47 s [vector] +++ OK, passed 100 tests.
  11841. 851.47 s [vector] scanl: OK
  11842. 851.47 s [vector] +++ OK, passed 100 tests.
  11843. 851.47 s [vector] scanl': OK
  11844. 851.48 s [vector] +++ OK, passed 100 tests.
  11845. 851.48 s [vector] scanl1: OK
  11846. 851.48 s [vector] +++ OK, passed 100 tests.
  11847. 851.48 s [vector] scanl1': OK
  11848. 851.48 s [vector] +++ OK, passed 100 tests.
  11849. 851.48 s [vector] iscanl: OK
  11850. 851.48 s [vector] +++ OK, passed 100 tests.
  11851. 851.48 s [vector] iscanl': OK
  11852. 851.49 s [vector] +++ OK, passed 100 tests.
  11853. 851.49 s [vector] prescanr: OK
  11854. 851.49 s [vector] +++ OK, passed 100 tests.
  11855. 851.49 s [vector] prescanr': OK
  11856. 851.49 s [vector] +++ OK, passed 100 tests.
  11857. 851.49 s [vector] postscanr: OK
  11858. 851.49 s [vector] +++ OK, passed 100 tests.
  11859. 851.50 s [vector] postscanr': OK
  11860. 851.50 s [vector] +++ OK, passed 100 tests.
  11861. 851.50 s [vector] scanr: OK
  11862. 851.50 s [vector] +++ OK, passed 100 tests.
  11863. 851.50 s [vector] scanr': OK
  11864. 851.50 s [vector] +++ OK, passed 100 tests.
  11865. 851.50 s [vector] scanr1: OK
  11866. 851.51 s [vector] +++ OK, passed 100 tests.
  11867. 851.51 s [vector] scanr1': OK
  11868. 851.51 s [vector] +++ OK, passed 100 tests.
  11869. 851.51 s [vector] iscanr: OK
  11870. 851.51 s [vector] +++ OK, passed 100 tests.
  11871. 851.51 s [vector] iscanr': OK
  11872. 851.51 s [vector] +++ OK, passed 100 tests.
  11873. 851.52 s [vector] mut_read: OK
  11874. 851.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11875. 851.52 s [vector] mut_write: OK
  11876. 851.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11877. 851.52 s [vector] mut_modify: OK
  11878. 851.52 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11879. 851.52 s [vector] mut_generate: OK
  11880. 851.52 s [vector] +++ OK, passed 100 tests.
  11881. 851.52 s [vector] mut_generateM: OK
  11882. 851.52 s [vector] +++ OK, passed 100 tests.
  11883. 851.54 s [vector] mut_mapM_: OK (0.01s)
  11884. 851.54 s [vector] +++ OK, passed 100 tests.
  11885. 851.57 s [vector] mut_imapM_: OK (0.02s)
  11886. 851.57 s [vector] +++ OK, passed 100 tests.
  11887. 851.59 s [vector] mut_forM_: OK (0.01s)
  11888. 851.59 s [vector] +++ OK, passed 100 tests.
  11889. 851.60 s [vector] mut_iforM_: OK (0.03s)
  11890. 851.60 s [vector] +++ OK, passed 100 tests.
  11891. 851.60 s [vector] mut_foldr: OK
  11892. 851.60 s [vector] +++ OK, passed 100 tests.
  11893. 851.60 s [vector] mut_foldr': OK
  11894. 851.60 s [vector] +++ OK, passed 100 tests.
  11895. 851.61 s [vector] mut_foldl: OK
  11896. 851.61 s [vector] +++ OK, passed 100 tests.
  11897. 851.61 s [vector] mut_foldl': OK
  11898. 851.61 s [vector] +++ OK, passed 100 tests.
  11899. 851.61 s [vector] mut_ifoldr: OK
  11900. 851.62 s [vector] +++ OK, passed 100 tests.
  11901. 851.62 s [vector] mut_ifoldr': OK
  11902. 851.62 s [vector] +++ OK, passed 100 tests.
  11903. 851.63 s [vector] mut_ifoldl: OK
  11904. 851.63 s [vector] +++ OK, passed 100 tests.
  11905. 851.63 s [vector] mut_ifoldl': OK
  11906. 851.63 s [vector] +++ OK, passed 100 tests.
  11907. 851.64 s [vector] mut_foldM: OK
  11908. 851.64 s [vector] +++ OK, passed 100 tests.
  11909. 851.64 s [vector] mut_foldM': OK
  11910. 851.64 s [vector] +++ OK, passed 100 tests.
  11911. 851.64 s [vector] mut_foldrM: OK
  11912. 851.64 s [vector] +++ OK, passed 100 tests.
  11913. 851.64 s [vector] mut_foldrM': OK
  11914. 851.64 s [vector] +++ OK, passed 100 tests.
  11915. 851.65 s [vector] mut_ifoldM: OK
  11916. 851.65 s [vector] +++ OK, passed 100 tests.
  11917. 851.65 s [vector] mut_ifoldM': OK
  11918. 851.65 s [vector] +++ OK, passed 100 tests.
  11919. 851.66 s [vector] mut_ifoldrM: OK
  11920. 851.66 s [vector] +++ OK, passed 100 tests.
  11921. 851.66 s [vector] mut_ifoldrM': OK
  11922. 851.66 s [vector] +++ OK, passed 100 tests.
  11923. 851.66 s [vector] compare: OK
  11924. 851.66 s [vector] +++ OK, passed 100 tests.
  11925. 851.66 s [vector] maximum: OK
  11926. 851.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11927. 851.66 s [vector] minimum: OK
  11928. 851.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11929. 851.66 s [vector] minIndex: OK
  11930. 851.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11931. 851.66 s [vector] maxIndex: OK
  11932. 851.66 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11933. 851.66 s [vector] maximumBy: OK
  11934. 851.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11935. 851.66 s [vector] minimumBy: OK
  11936. 851.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11937. 851.66 s [vector] maximumOn: OK
  11938. 851.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11939. 851.66 s [vector] minimumOn: OK
  11940. 851.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11941. 851.66 s [vector] maxIndexBy: OK
  11942. 851.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11943. 851.66 s [vector] minIndexBy: OK
  11944. 851.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11945. 851.66 s [vector] ListFirstMaxIndexWins: OK
  11946. 851.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11947. 851.66 s [vector] FalseListFirstMaxIndexWins: OK
  11948. 851.66 s [vector] +++ OK, failed as expected. (after 1 test):
  11949. 851.66 s [vector] Exception:
  11950. 851.66 s [vector] Prelude.foldr1: empty list
  11951. 851.66 s [vector] CallStack (from HasCallStack):
  11952. 851.66 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  11953. 851.66 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  11954. 851.66 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11955. 851.66 s [vector] []
  11956. 851.66 s [vector] zip: OK
  11957. 851.66 s [vector] +++ OK, passed 100 tests.
  11958. 851.66 s [vector] zip3: OK
  11959. 851.66 s [vector] +++ OK, passed 100 tests.
  11960. 851.66 s [vector] unzip: OK
  11961. 851.66 s [vector] +++ OK, passed 100 tests.
  11962. 851.66 s [vector] unzip3: OK
  11963. 851.66 s [vector] +++ OK, passed 100 tests.
  11964. 851.67 s [vector] indexed: OK
  11965. 851.67 s [vector] +++ OK, passed 100 tests.
  11966. 851.67 s [vector] update: OK
  11967. 851.68 s [vector] +++ OK, passed 100 tests.
  11968. 851.68 s [vector] concat: OK
  11969. 851.68 s [vector] +++ OK, passed 100 tests.
  11970. 851.68 s [vector] mempty: OK
  11971. 851.68 s [vector] +++ OK, passed 1 test.
  11972. 851.68 s [vector] mappend: OK
  11973. 851.68 s [vector] +++ OK, passed 100 tests.
  11974. 851.69 s [vector] mconcat: OK
  11975. 851.69 s [vector] +++ OK, passed 100 tests.
  11976. 851.69 s [vector] fmap: OK
  11977. 851.69 s [vector] +++ OK, passed 100 tests.
  11978. 851.69 s [vector] return: OK
  11979. 851.71 s [vector] +++ OK, passed 100 tests.
  11980. 851.71 s [vector] bind: OK (0.02s)
  11981. 851.71 s [vector] +++ OK, passed 100 tests.
  11982. 851.71 s [vector] mzip: OK
  11983. 851.71 s [vector] +++ OK, passed 100 tests.
  11984. 851.71 s [vector] munzip: OK
  11985. 851.71 s [vector] +++ OK, passed 100 tests.
  11986. 851.73 s [vector] applicative_pure: OK
  11987. 851.73 s [vector] +++ OK, passed 100 tests.
  11988. 851.75 s [vector] applicative_appl: OK (0.05s)
  11989. 851.75 s [vector] +++ OK, passed 100 tests.
  11990. 851.75 s [vector] alternative_empty: OK
  11991. 851.76 s [vector] +++ OK, passed 1 test.
  11992. 851.76 s [vector] alternative_or: OK
  11993. 851.77 s [vector] +++ OK, passed 100 tests.
  11994. 851.81 s [vector] sequence: OK (0.03s)
  11995. 851.81 s [vector] +++ OK, passed 100 tests.
  11996. 851.81 s [vector] sequence_: OK (0.02s)
  11997. 851.81 s [vector] +++ OK, passed 100 tests.
  11998. 851.81 s [vector] glength: OK
  11999. 851.81 s [vector] +++ OK, passed 100 tests.
  12000. 851.81 s [vector] sum: OK
  12001. 851.81 s [vector] +++ OK, passed 100 tests.
  12002. 851.81 s [vector] product: OK
  12003. 851.81 s [vector] +++ OK, passed 100 tests.
  12004. 851.81 s [vector] enumFromN: OK
  12005. 851.82 s [vector] +++ OK, passed 100 tests.
  12006. 851.82 s [vector] enumFromThenN: OK
  12007. 851.82 s [vector] +++ OK, passed 100 tests.
  12008. 851.82 s [vector] enumFromTo: OK
  12009. 851.82 s [vector] +++ OK, passed 100 tests.
  12010. 851.82 s [vector] enumFromThenTo: OK
  12011. 851.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12012. 851.82 s [vector] unstream
  12013. 851.82 s [vector] unstream == vunstream (exact): OK
  12014. 851.82 s [vector] +++ OK, passed 100 tests.
  12015. 851.82 s [vector] unstream == vunstream (unknown): OK
  12016. 851.82 s [vector] +++ OK, passed 100 tests.
  12017. 851.82 s [vector] unstreamR ~= vunstream (exact): OK
  12018. 851.82 s [vector] +++ OK, passed 100 tests.
  12019. 851.82 s [vector] unstreamR ~= vunstream (unknown): OK
  12020. 851.82 s [vector] +++ OK, passed 100 tests.
  12021. 851.82 s [vector] Tests.Vector.Primitive
  12022. 851.82 s [vector] Int
  12023. 851.82 s [vector] fromList.toList == id: OK
  12024. 851.82 s [vector] +++ OK, passed 100 tests.
  12025. 851.82 s [vector] toList.fromList == id: OK
  12026. 851.82 s [vector] +++ OK, passed 100 tests.
  12027. 851.82 s [vector] unstream.stream == id: OK
  12028. 851.82 s [vector] +++ OK, passed 100 tests.
  12029. 851.82 s [vector] stream.unstream == id: OK
  12030. 851.82 s [vector] +++ OK, passed 100 tests.
  12031. 851.82 s [vector] eq: OK
  12032. 851.82 s [vector] +++ OK, passed 100 tests.
  12033. 851.82 s [vector] length: OK
  12034. 851.82 s [vector] +++ OK, passed 100 tests.
  12035. 851.82 s [vector] null: OK
  12036. 851.82 s [vector] +++ OK, passed 100 tests.
  12037. 851.82 s [vector] index: OK
  12038. 851.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12039. 851.82 s [vector] safeIndex: OK
  12040. 851.82 s [vector] +++ OK, passed 100 tests.
  12041. 851.82 s [vector] head: OK
  12042. 851.82 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12043. 851.82 s [vector] last: OK
  12044. 851.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12045. 851.82 s [vector] unsafeIndex: OK
  12046. 851.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12047. 851.82 s [vector] unsafeHead: OK
  12048. 851.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12049. 851.82 s [vector] unsafeLast: OK
  12050. 851.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12051. 851.82 s [vector] slice: OK
  12052. 851.82 s [vector] +++ OK, passed 100 tests.
  12053. 851.82 s [vector] init: OK
  12054. 851.83 s [vector] +++ OK, passed 100 tests; 27 discarded.
  12055. 851.83 s [vector] tail: OK
  12056. 851.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12057. 851.83 s [vector] take: OK
  12058. 851.83 s [vector] +++ OK, passed 100 tests.
  12059. 851.83 s [vector] drop: OK
  12060. 851.83 s [vector] +++ OK, passed 100 tests.
  12061. 851.83 s [vector] splitAt: OK
  12062. 851.83 s [vector] +++ OK, passed 100 tests.
  12063. 851.83 s [vector] empty: OK
  12064. 851.83 s [vector] +++ OK, passed 1 test.
  12065. 851.83 s [vector] singleton: OK
  12066. 851.83 s [vector] +++ OK, passed 100 tests.
  12067. 851.83 s [vector] replicate: OK
  12068. 851.83 s [vector] +++ OK, passed 100 tests.
  12069. 851.83 s [vector] generate: OK
  12070. 851.83 s [vector] +++ OK, passed 100 tests.
  12071. 851.83 s [vector] iterateN: OK
  12072. 851.84 s [vector] +++ OK, passed 100 tests.
  12073. 851.85 s [vector] iterateNM: OK (0.01s)
  12074. 851.85 s [vector] +++ OK, passed 100 tests.
  12075. 851.90 s [vector] generateM: OK (0.04s)
  12076. 851.91 s [vector] +++ OK, passed 100 tests.
  12077. 851.91 s [vector] replicateM: OK (0.02s)
  12078. 851.91 s [vector] +++ OK, passed 100 tests.
  12079. 851.91 s [vector] create: OK
  12080. 851.91 s [vector] +++ OK, passed 100 tests.
  12081. 851.91 s [vector] createT: OK
  12082. 851.91 s [vector] +++ OK, passed 100 tests.
  12083. 851.91 s [vector] unfoldr: OK
  12084. 851.91 s [vector] +++ OK, passed 100 tests.
  12085. 851.91 s [vector] unfoldrN: OK
  12086. 851.91 s [vector] +++ OK, passed 100 tests.
  12087. 851.91 s [vector] unfoldrExactN: OK
  12088. 851.91 s [vector] +++ OK, passed 100 tests.
  12089. 851.92 s [vector] unfoldrM: OK
  12090. 851.92 s [vector] +++ OK, passed 100 tests.
  12091. 851.92 s [vector] unfoldrNM: OK
  12092. 851.93 s [vector] +++ OK, passed 100 tests.
  12093. 851.94 s [vector] unfoldrExactNM: OK (0.02s)
  12094. 851.94 s [vector] +++ OK, passed 100 tests.
  12095. 851.94 s [vector] constructN: OK
  12096. 851.94 s [vector] +++ OK, passed 100 tests.
  12097. 851.95 s [vector] constructrN: OK
  12098. 851.95 s [vector] +++ OK, passed 100 tests.
  12099. 851.95 s [vector] cons: OK
  12100. 851.95 s [vector] +++ OK, passed 100 tests.
  12101. 851.95 s [vector] snoc: OK
  12102. 851.95 s [vector] +++ OK, passed 100 tests.
  12103. 851.95 s [vector] append: OK
  12104. 851.96 s [vector] +++ OK, passed 100 tests.
  12105. 851.97 s [vector] concat: OK (0.02s)
  12106. 851.97 s [vector] +++ OK, passed 100 tests.
  12107. 851.97 s [vector] force: OK
  12108. 851.97 s [vector] +++ OK, passed 100 tests.
  12109. 851.97 s [vector] upd: OK
  12110. 851.97 s [vector] +++ OK, passed 100 tests.
  12111. 851.97 s [vector] accum: OK
  12112. 851.97 s [vector] +++ OK, passed 100 tests.
  12113. 851.97 s [vector] reverse: OK
  12114. 851.97 s [vector] +++ OK, passed 100 tests.
  12115. 851.98 s [vector] backpermute: OK
  12116. 851.98 s [vector] +++ OK, passed 100 tests.
  12117. 851.98 s [vector] map: OK
  12118. 851.98 s [vector] +++ OK, passed 100 tests.
  12119. 851.98 s [vector] imap: OK
  12120. 851.98 s [vector] +++ OK, passed 100 tests.
  12121. 851.98 s [vector] concatMap: OK
  12122. 851.98 s [vector] +++ OK, passed 100 tests.
  12123. 851.98 s [vector] mapM: OK
  12124. 851.99 s [vector] +++ OK, passed 100 tests.
  12125. 852.00 s [vector] mapM_: OK (0.01s)
  12126. 852.00 s [vector] +++ OK, passed 100 tests.
  12127. 852.01 s [vector] forM: OK
  12128. 852.01 s [vector] +++ OK, passed 100 tests.
  12129. 852.02 s [vector] forM_: OK (0.01s)
  12130. 852.02 s [vector] +++ OK, passed 100 tests.
  12131. 852.02 s [vector] imapM: OK
  12132. 852.03 s [vector] +++ OK, passed 100 tests.
  12133. 852.03 s [vector] imapM_: OK (0.01s)
  12134. 852.03 s [vector] +++ OK, passed 100 tests.
  12135. 852.04 s [vector] zipWith: OK
  12136. 852.04 s [vector] +++ OK, passed 100 tests.
  12137. 852.04 s [vector] zipWith3: OK
  12138. 852.04 s [vector] +++ OK, passed 100 tests.
  12139. 852.04 s [vector] izipWith: OK
  12140. 852.04 s [vector] +++ OK, passed 100 tests.
  12141. 852.04 s [vector] izipWith3: OK
  12142. 852.04 s [vector] +++ OK, passed 100 tests.
  12143. 852.06 s [vector] izipWithM: OK
  12144. 852.06 s [vector] +++ OK, passed 100 tests.
  12145. 852.06 s [vector] izipWithM_: OK (0.01s)
  12146. 852.06 s [vector] +++ OK, passed 100 tests.
  12147. 852.06 s [vector] zipWithM: OK
  12148. 852.07 s [vector] +++ OK, passed 100 tests.
  12149. 852.07 s [vector] zipWithM_: OK (0.01s)
  12150. 852.07 s [vector] +++ OK, passed 100 tests.
  12151. 852.07 s [vector] filter: OK
  12152. 852.08 s [vector] +++ OK, passed 100 tests.
  12153. 852.08 s [vector] ifilter: OK
  12154. 852.08 s [vector] +++ OK, passed 100 tests.
  12155. 852.10 s [vector] filterM: OK (0.02s)
  12156. 852.10 s [vector] +++ OK, passed 100 tests.
  12157. 852.10 s [vector] uniq: OK
  12158. 852.10 s [vector] +++ OK, passed 100 tests.
  12159. 852.10 s [vector] mapMaybe: OK
  12160. 852.10 s [vector] +++ OK, passed 100 tests.
  12161. 852.11 s [vector] imapMaybe: OK
  12162. 852.11 s [vector] +++ OK, passed 100 tests.
  12163. 852.11 s [vector] takeWhile: OK
  12164. 852.11 s [vector] +++ OK, passed 100 tests.
  12165. 852.11 s [vector] dropWhile: OK
  12166. 852.11 s [vector] +++ OK, passed 100 tests.
  12167. 852.11 s [vector] partition: OK
  12168. 852.11 s [vector] +++ OK, passed 100 tests.
  12169. 852.11 s [vector] partitionWith: OK
  12170. 852.11 s [vector] +++ OK, passed 100 tests.
  12171. 852.11 s [vector] span: OK
  12172. 852.11 s [vector] +++ OK, passed 100 tests.
  12173. 852.11 s [vector] break: OK
  12174. 852.12 s [vector] +++ OK, passed 100 tests.
  12175. 852.12 s [vector] spanR: OK
  12176. 852.12 s [vector] +++ OK, passed 100 tests.
  12177. 852.12 s [vector] breakR: OK
  12178. 852.12 s [vector] +++ OK, passed 100 tests.
  12179. 852.12 s [vector] groupBy: OK
  12180. 852.12 s [vector] +++ OK, passed 100 tests.
  12181. 852.12 s [vector] elem: OK
  12182. 852.12 s [vector] +++ OK, passed 100 tests.
  12183. 852.12 s [vector] notElem: OK
  12184. 852.12 s [vector] +++ OK, passed 100 tests.
  12185. 852.12 s [vector] find: OK
  12186. 852.12 s [vector] +++ OK, passed 100 tests.
  12187. 852.12 s [vector] findIndex: OK
  12188. 852.12 s [vector] +++ OK, passed 100 tests.
  12189. 852.12 s [vector] findIndexR: OK
  12190. 852.12 s [vector] +++ OK, passed 100 tests.
  12191. 852.12 s [vector] findIndices: OK
  12192. 852.12 s [vector] +++ OK, passed 100 tests.
  12193. 852.12 s [vector] elemIndex: OK
  12194. 852.12 s [vector] +++ OK, passed 100 tests.
  12195. 852.12 s [vector] elemIndices: OK
  12196. 852.12 s [vector] +++ OK, passed 100 tests.
  12197. 852.13 s [vector] foldl: OK
  12198. 852.13 s [vector] +++ OK, passed 100 tests.
  12199. 852.13 s [vector] foldl1: OK
  12200. 852.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12201. 852.13 s [vector] foldl': OK
  12202. 852.13 s [vector] +++ OK, passed 100 tests.
  12203. 852.13 s [vector] foldl1': OK
  12204. 852.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12205. 852.14 s [vector] foldr: OK
  12206. 852.14 s [vector] +++ OK, passed 100 tests.
  12207. 852.14 s [vector] foldr1: OK
  12208. 852.14 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12209. 852.14 s [vector] foldr': OK
  12210. 852.14 s [vector] +++ OK, passed 100 tests.
  12211. 852.15 s [vector] foldr1': OK
  12212. 852.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12213. 852.15 s [vector] ifoldl: OK
  12214. 852.15 s [vector] +++ OK, passed 100 tests.
  12215. 852.15 s [vector] ifoldl': OK
  12216. 852.15 s [vector] +++ OK, passed 100 tests.
  12217. 852.16 s [vector] ifoldr: OK
  12218. 852.16 s [vector] +++ OK, passed 100 tests.
  12219. 852.16 s [vector] ifoldr': OK
  12220. 852.16 s [vector] +++ OK, passed 100 tests.
  12221. 852.16 s [vector] ifoldM: OK
  12222. 852.16 s [vector] +++ OK, passed 100 tests.
  12223. 852.16 s [vector] ifoldM': OK
  12224. 852.18 s [vector] +++ OK, passed 100 tests.
  12225. 852.20 s [vector] ifoldM_: OK (0.02s)
  12226. 852.20 s [vector] +++ OK, passed 100 tests.
  12227. 852.21 s [vector] ifoldM'_: OK (0.03s)
  12228. 852.21 s [vector] +++ OK, passed 100 tests.
  12229. 852.22 s [vector] all: OK
  12230. 852.22 s [vector] +++ OK, passed 100 tests.
  12231. 852.22 s [vector] any: OK
  12232. 852.22 s [vector] +++ OK, passed 100 tests.
  12233. 852.22 s [vector] prescanl: OK
  12234. 852.22 s [vector] +++ OK, passed 100 tests.
  12235. 852.22 s [vector] prescanl': OK
  12236. 852.22 s [vector] +++ OK, passed 100 tests.
  12237. 852.23 s [vector] postscanl: OK
  12238. 852.23 s [vector] +++ OK, passed 100 tests.
  12239. 852.23 s [vector] postscanl': OK
  12240. 852.23 s [vector] +++ OK, passed 100 tests.
  12241. 852.23 s [vector] scanl: OK
  12242. 852.24 s [vector] +++ OK, passed 100 tests.
  12243. 852.24 s [vector] scanl': OK
  12244. 852.24 s [vector] +++ OK, passed 100 tests.
  12245. 852.24 s [vector] scanl1: OK
  12246. 852.24 s [vector] +++ OK, passed 100 tests.
  12247. 852.25 s [vector] scanl1': OK
  12248. 852.25 s [vector] +++ OK, passed 100 tests.
  12249. 852.25 s [vector] iscanl: OK
  12250. 852.25 s [vector] +++ OK, passed 100 tests.
  12251. 852.26 s [vector] iscanl': OK
  12252. 852.26 s [vector] +++ OK, passed 100 tests.
  12253. 852.26 s [vector] prescanr: OK
  12254. 852.26 s [vector] +++ OK, passed 100 tests.
  12255. 852.26 s [vector] prescanr': OK
  12256. 852.26 s [vector] +++ OK, passed 100 tests.
  12257. 852.26 s [vector] postscanr: OK
  12258. 852.26 s [vector] +++ OK, passed 100 tests.
  12259. 852.27 s [vector] postscanr': OK
  12260. 852.27 s [vector] +++ OK, passed 100 tests.
  12261. 852.27 s [vector] scanr: OK
  12262. 852.27 s [vector] +++ OK, passed 100 tests.
  12263. 852.27 s [vector] scanr': OK
  12264. 852.27 s [vector] +++ OK, passed 100 tests.
  12265. 852.28 s [vector] scanr1: OK
  12266. 852.28 s [vector] +++ OK, passed 100 tests.
  12267. 852.28 s [vector] scanr1': OK
  12268. 852.28 s [vector] +++ OK, passed 100 tests.
  12269. 852.28 s [vector] iscanr: OK
  12270. 852.28 s [vector] +++ OK, passed 100 tests.
  12271. 852.29 s [vector] iscanr': OK
  12272. 852.29 s [vector] +++ OK, passed 100 tests.
  12273. 852.29 s [vector] mut_read: OK
  12274. 852.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12275. 852.29 s [vector] mut_write: OK
  12276. 852.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12277. 852.29 s [vector] mut_modify: OK
  12278. 852.29 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12279. 852.31 s [vector] mut_generate: OK
  12280. 852.31 s [vector] +++ OK, passed 100 tests.
  12281. 852.32 s [vector] mut_generateM: OK (0.02s)
  12282. 852.32 s [vector] +++ OK, passed 100 tests.
  12283. 852.34 s [vector] mut_mapM_: OK (0.01s)
  12284. 852.34 s [vector] +++ OK, passed 100 tests.
  12285. 852.34 s [vector] mut_imapM_: OK (0.02s)
  12286. 852.34 s [vector] +++ OK, passed 100 tests.
  12287. 852.37 s [vector] mut_forM_: OK (0.02s)
  12288. 852.37 s [vector] +++ OK, passed 100 tests.
  12289. 852.39 s [vector] mut_iforM_: OK (0.02s)
  12290. 852.39 s [vector] +++ OK, passed 100 tests.
  12291. 852.39 s [vector] mut_foldr: OK
  12292. 852.39 s [vector] +++ OK, passed 100 tests.
  12293. 852.40 s [vector] mut_foldr': OK
  12294. 852.40 s [vector] +++ OK, passed 100 tests.
  12295. 852.40 s [vector] mut_foldl: OK
  12296. 852.40 s [vector] +++ OK, passed 100 tests.
  12297. 852.40 s [vector] mut_foldl': OK
  12298. 852.40 s [vector] +++ OK, passed 100 tests.
  12299. 852.41 s [vector] mut_ifoldr: OK
  12300. 852.41 s [vector] +++ OK, passed 100 tests.
  12301. 852.42 s [vector] mut_ifoldr': OK
  12302. 852.42 s [vector] +++ OK, passed 100 tests.
  12303. 852.42 s [vector] mut_ifoldl: OK
  12304. 852.42 s [vector] +++ OK, passed 100 tests.
  12305. 852.42 s [vector] mut_ifoldl': OK
  12306. 852.42 s [vector] +++ OK, passed 100 tests.
  12307. 852.42 s [vector] mut_foldM: OK
  12308. 852.42 s [vector] +++ OK, passed 100 tests.
  12309. 852.42 s [vector] mut_foldM': OK
  12310. 852.42 s [vector] +++ OK, passed 100 tests.
  12311. 852.43 s [vector] mut_foldrM: OK
  12312. 852.43 s [vector] +++ OK, passed 100 tests.
  12313. 852.44 s [vector] mut_foldrM': OK
  12314. 852.44 s [vector] +++ OK, passed 100 tests.
  12315. 852.44 s [vector] mut_ifoldM: OK
  12316. 852.44 s [vector] +++ OK, passed 100 tests.
  12317. 852.45 s [vector] mut_ifoldM': OK
  12318. 852.45 s [vector] +++ OK, passed 100 tests.
  12319. 852.45 s [vector] mut_ifoldrM: OK
  12320. 852.45 s [vector] +++ OK, passed 100 tests.
  12321. 852.45 s [vector] mut_ifoldrM': OK
  12322. 852.45 s [vector] +++ OK, passed 100 tests.
  12323. 852.45 s [vector] compare: OK
  12324. 852.45 s [vector] +++ OK, passed 100 tests.
  12325. 852.45 s [vector] maximum: OK
  12326. 852.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12327. 852.46 s [vector] minimum: OK
  12328. 852.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12329. 852.46 s [vector] minIndex: OK
  12330. 852.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12331. 852.46 s [vector] maxIndex: OK
  12332. 852.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12333. 852.46 s [vector] maximumBy: OK
  12334. 852.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12335. 852.46 s [vector] minimumBy: OK
  12336. 852.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12337. 852.46 s [vector] maximumOn: OK
  12338. 852.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12339. 852.46 s [vector] minimumOn: OK
  12340. 852.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12341. 852.46 s [vector] maxIndexBy: OK
  12342. 852.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12343. 852.46 s [vector] minIndexBy: OK
  12344. 852.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12345. 852.46 s [vector] ListFirstMaxIndexWins: OK
  12346. 852.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12347. 852.46 s [vector] FalseListFirstMaxIndexWins: OK
  12348. 852.46 s [vector] +++ OK, failed as expected. (after 1 test):
  12349. 852.46 s [vector] Exception:
  12350. 852.46 s [vector] Prelude.foldr1: empty list
  12351. 852.46 s [vector] CallStack (from HasCallStack):
  12352. 852.46 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  12353. 852.46 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  12354. 852.46 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12355. 852.46 s [vector] []
  12356. 852.46 s [vector] mempty: OK
  12357. 852.46 s [vector] +++ OK, passed 1 test.
  12358. 852.46 s [vector] mappend: OK
  12359. 852.46 s [vector] +++ OK, passed 100 tests.
  12360. 852.48 s [vector] mconcat: OK (0.02s)
  12361. 852.48 s [vector] +++ OK, passed 100 tests.
  12362. 852.49 s [vector] glength: OK
  12363. 852.49 s [vector] +++ OK, passed 100 tests.
  12364. 852.49 s [vector] sum: OK
  12365. 852.49 s [vector] +++ OK, passed 100 tests.
  12366. 852.49 s [vector] product: OK
  12367. 852.49 s [vector] +++ OK, passed 100 tests.
  12368. 852.49 s [vector] enumFromN: OK
  12369. 852.49 s [vector] +++ OK, passed 100 tests.
  12370. 852.49 s [vector] enumFromThenN: OK
  12371. 852.49 s [vector] +++ OK, passed 100 tests.
  12372. 852.49 s [vector] enumFromTo: OK
  12373. 852.49 s [vector] +++ OK, passed 100 tests.
  12374. 852.49 s [vector] enumFromThenTo: OK
  12375. 852.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12376. 852.49 s [vector] Double
  12377. 852.49 s [vector] fromList.toList == id: OK
  12378. 852.49 s [vector] +++ OK, passed 100 tests.
  12379. 852.49 s [vector] toList.fromList == id: OK
  12380. 852.49 s [vector] +++ OK, passed 100 tests.
  12381. 852.49 s [vector] unstream.stream == id: OK
  12382. 852.49 s [vector] +++ OK, passed 100 tests.
  12383. 852.49 s [vector] stream.unstream == id: OK
  12384. 852.49 s [vector] +++ OK, passed 100 tests.
  12385. 852.49 s [vector] eq: OK
  12386. 852.49 s [vector] +++ OK, passed 100 tests.
  12387. 852.49 s [vector] length: OK
  12388. 852.49 s [vector] +++ OK, passed 100 tests.
  12389. 852.49 s [vector] null: OK
  12390. 852.49 s [vector] +++ OK, passed 100 tests.
  12391. 852.49 s [vector] index: OK
  12392. 852.50 s [vector] +++ OK, passed 100 tests; 10 discarded.
  12393. 852.50 s [vector] safeIndex: OK
  12394. 852.50 s [vector] +++ OK, passed 100 tests.
  12395. 852.50 s [vector] head: OK
  12396. 852.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12397. 852.50 s [vector] last: OK
  12398. 852.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12399. 852.50 s [vector] unsafeIndex: OK
  12400. 852.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12401. 852.50 s [vector] unsafeHead: OK
  12402. 852.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12403. 852.50 s [vector] unsafeLast: OK
  12404. 852.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12405. 852.50 s [vector] slice: OK
  12406. 852.50 s [vector] +++ OK, passed 100 tests.
  12407. 852.50 s [vector] init: OK
  12408. 852.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12409. 852.50 s [vector] tail: OK
  12410. 852.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12411. 852.50 s [vector] take: OK
  12412. 852.50 s [vector] +++ OK, passed 100 tests.
  12413. 852.51 s [vector] drop: OK
  12414. 852.51 s [vector] +++ OK, passed 100 tests.
  12415. 852.51 s [vector] splitAt: OK
  12416. 852.51 s [vector] +++ OK, passed 100 tests.
  12417. 852.51 s [vector] empty: OK
  12418. 852.51 s [vector] +++ OK, passed 1 test.
  12419. 852.51 s [vector] singleton: OK
  12420. 852.51 s [vector] +++ OK, passed 100 tests.
  12421. 852.51 s [vector] replicate: OK
  12422. 852.51 s [vector] +++ OK, passed 100 tests.
  12423. 852.51 s [vector] generate: OK
  12424. 852.51 s [vector] +++ OK, passed 100 tests.
  12425. 852.53 s [vector] iterateN: OK
  12426. 852.53 s [vector] +++ OK, passed 100 tests.
  12427. 852.55 s [vector] iterateNM: OK (0.02s)
  12428. 852.55 s [vector] +++ OK, passed 100 tests.
  12429. 852.57 s [vector] generateM: OK (0.03s)
  12430. 852.57 s [vector] +++ OK, passed 100 tests.
  12431. 852.57 s [vector] replicateM: OK
  12432. 852.57 s [vector] +++ OK, passed 100 tests.
  12433. 852.57 s [vector] create: OK
  12434. 852.57 s [vector] +++ OK, passed 100 tests.
  12435. 852.57 s [vector] createT: OK
  12436. 852.57 s [vector] +++ OK, passed 100 tests.
  12437. 852.57 s [vector] unfoldr: OK
  12438. 852.57 s [vector] +++ OK, passed 100 tests.
  12439. 852.57 s [vector] unfoldrN: OK
  12440. 852.57 s [vector] +++ OK, passed 100 tests.
  12441. 852.57 s [vector] unfoldrExactN: OK
  12442. 852.57 s [vector] +++ OK, passed 100 tests.
  12443. 852.57 s [vector] unfoldrM: OK
  12444. 852.58 s [vector] +++ OK, passed 100 tests.
  12445. 852.59 s [vector] unfoldrNM: OK
  12446. 852.59 s [vector] +++ OK, passed 100 tests.
  12447. 852.59 s [vector] unfoldrExactNM: OK
  12448. 852.59 s [vector] +++ OK, passed 100 tests.
  12449. 852.60 s [vector] constructN: OK (0.01s)
  12450. 852.61 s [vector] +++ OK, passed 100 tests.
  12451. 852.61 s [vector] constructrN: OK (0.02s)
  12452. 852.61 s [vector] +++ OK, passed 100 tests.
  12453. 852.61 s [vector] cons: OK
  12454. 852.61 s [vector] +++ OK, passed 100 tests.
  12455. 852.61 s [vector] snoc: OK
  12456. 852.62 s [vector] +++ OK, passed 100 tests.
  12457. 852.62 s [vector] append: OK
  12458. 852.62 s [vector] +++ OK, passed 100 tests.
  12459. 852.64 s [vector] concat: OK (0.02s)
  12460. 852.64 s [vector] +++ OK, passed 100 tests.
  12461. 852.64 s [vector] force: OK
  12462. 852.64 s [vector] +++ OK, passed 100 tests.
  12463. 852.64 s [vector] upd: OK
  12464. 852.64 s [vector] +++ OK, passed 100 tests.
  12465. 852.66 s [vector] accum: OK (0.02s)
  12466. 852.66 s [vector] +++ OK, passed 100 tests.
  12467. 852.66 s [vector] reverse: OK
  12468. 852.66 s [vector] +++ OK, passed 100 tests.
  12469. 852.66 s [vector] backpermute: OK
  12470. 852.67 s [vector] +++ OK, passed 100 tests.
  12471. 852.68 s [vector] map: OK
  12472. 852.68 s [vector] +++ OK, passed 100 tests.
  12473. 852.68 s [vector] imap: OK
  12474. 852.68 s [vector] +++ OK, passed 100 tests.
  12475. 852.68 s [vector] concatMap: OK
  12476. 852.68 s [vector] +++ OK, passed 100 tests.
  12477. 852.69 s [vector] mapM: OK
  12478. 852.69 s [vector] +++ OK, passed 100 tests.
  12479. 852.74 s [vector] mapM_: OK (0.02s)
  12480. 852.74 s [vector] +++ OK, passed 100 tests.
  12481. 852.75 s [vector] forM: OK
  12482. 852.75 s [vector] +++ OK, passed 100 tests.
  12483. 852.79 s [vector] forM_: OK (0.04s)
  12484. 852.79 s [vector] +++ OK, passed 100 tests.
  12485. 852.79 s [vector] imapM: OK
  12486. 852.79 s [vector] +++ OK, passed 100 tests.
  12487. 852.82 s [vector] imapM_: OK (0.03s)
  12488. 852.82 s [vector] +++ OK, passed 100 tests.
  12489. 852.83 s [vector] zipWith: OK
  12490. 852.83 s [vector] +++ OK, passed 100 tests.
  12491. 852.84 s [vector] zipWith3: OK (0.01s)
  12492. 852.84 s [vector] +++ OK, passed 100 tests.
  12493. 852.86 s [vector] izipWith: OK
  12494. 852.86 s [vector] +++ OK, passed 100 tests.
  12495. 852.88 s [vector] izipWith3: OK (0.01s)
  12496. 852.89 s [vector] +++ OK, passed 100 tests.
  12497. 852.89 s [vector] izipWithM: OK
  12498. 852.89 s [vector] +++ OK, passed 100 tests.
  12499. 852.90 s [vector] izipWithM_: OK (0.03s)
  12500. 852.90 s [vector] +++ OK, passed 100 tests.
  12501. 852.92 s [vector] zipWithM: OK (0.01s)
  12502. 852.93 s [vector] +++ OK, passed 100 tests.
  12503. 852.94 s [vector] zipWithM_: OK (0.03s)
  12504. 852.94 s [vector] +++ OK, passed 100 tests.
  12505. 852.94 s [vector] filter: OK
  12506. 852.94 s [vector] +++ OK, passed 100 tests.
  12507. 852.97 s [vector] ifilter: OK (0.01s)
  12508. 852.97 s [vector] +++ OK, passed 100 tests.
  12509. 853.02 s [vector] filterM: OK (0.06s)
  12510. 853.02 s [vector] +++ OK, passed 100 tests.
  12511. 853.02 s [vector] uniq: OK
  12512. 853.02 s [vector] +++ OK, passed 100 tests.
  12513. 853.03 s [vector] mapMaybe: OK
  12514. 853.03 s [vector] +++ OK, passed 100 tests.
  12515. 853.04 s [vector] imapMaybe: OK (0.01s)
  12516. 853.04 s [vector] +++ OK, passed 100 tests.
  12517. 853.04 s [vector] takeWhile: OK
  12518. 853.04 s [vector] +++ OK, passed 100 tests.
  12519. 853.04 s [vector] dropWhile: OK
  12520. 853.05 s [vector] +++ OK, passed 100 tests.
  12521. 853.05 s [vector] partition: OK
  12522. 853.05 s [vector] +++ OK, passed 100 tests.
  12523. 853.08 s [vector] partitionWith: OK (0.02s)
  12524. 853.08 s [vector] +++ OK, passed 100 tests.
  12525. 853.08 s [vector] span: OK
  12526. 853.08 s [vector] +++ OK, passed 100 tests.
  12527. 853.09 s [vector] break: OK
  12528. 853.09 s [vector] +++ OK, passed 100 tests.
  12529. 853.09 s [vector] spanR: OK
  12530. 853.09 s [vector] +++ OK, passed 100 tests.
  12531. 853.10 s [vector] breakR: OK
  12532. 853.11 s [vector] +++ OK, passed 100 tests.
  12533. 853.11 s [vector] groupBy: OK (0.01s)
  12534. 853.11 s [vector] +++ OK, passed 100 tests.
  12535. 853.11 s [vector] elem: OK
  12536. 853.11 s [vector] +++ OK, passed 100 tests.
  12537. 853.11 s [vector] notElem: OK
  12538. 853.11 s [vector] +++ OK, passed 100 tests.
  12539. 853.11 s [vector] find: OK
  12540. 853.11 s [vector] +++ OK, passed 100 tests.
  12541. 853.11 s [vector] findIndex: OK
  12542. 853.11 s [vector] +++ OK, passed 100 tests.
  12543. 853.11 s [vector] findIndexR: OK
  12544. 853.11 s [vector] +++ OK, passed 100 tests.
  12545. 853.13 s [vector] findIndices: OK (0.01s)
  12546. 853.13 s [vector] +++ OK, passed 100 tests.
  12547. 853.13 s [vector] elemIndex: OK
  12548. 853.13 s [vector] +++ OK, passed 100 tests.
  12549. 853.15 s [vector] elemIndices: OK
  12550. 853.17 s [vector] +++ OK, passed 100 tests.
  12551. 853.17 s [vector] foldl: OK (0.02s)
  12552. 853.17 s [vector] +++ OK, passed 100 tests.
  12553. 853.17 s [vector] foldl1: OK (0.02s)
  12554. 853.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12555. 853.20 s [vector] foldl': OK (0.02s)
  12556. 853.20 s [vector] +++ OK, passed 100 tests.
  12557. 853.21 s [vector] foldl1': OK (0.02s)
  12558. 853.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12559. 853.22 s [vector] foldr: OK (0.01s)
  12560. 853.22 s [vector] +++ OK, passed 100 tests.
  12561. 853.24 s [vector] foldr1: OK (0.01s)
  12562. 853.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12563. 853.24 s [vector] foldr': OK (0.01s)
  12564. 853.24 s [vector] +++ OK, passed 100 tests.
  12565. 853.26 s [vector] foldr1': OK (0.01s)
  12566. 853.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12567. 853.28 s [vector] ifoldl: OK (0.02s)
  12568. 853.28 s [vector] +++ OK, passed 100 tests.
  12569. 853.31 s [vector] ifoldl': OK (0.02s)
  12570. 853.31 s [vector] +++ OK, passed 100 tests.
  12571. 853.32 s [vector] ifoldr: OK (0.02s)
  12572. 853.33 s [vector] +++ OK, passed 100 tests.
  12573. 853.33 s [vector] ifoldr': OK (0.02s)
  12574. 853.33 s [vector] +++ OK, passed 100 tests.
  12575. 853.34 s [vector] ifoldM: OK (0.02s)
  12576. 853.35 s [vector] +++ OK, passed 100 tests.
  12577. 853.36 s [vector] ifoldM': OK (0.02s)
  12578. 853.36 s [vector] +++ OK, passed 100 tests.
  12579. 853.40 s [vector] ifoldM_: OK (0.04s)
  12580. 853.40 s [vector] +++ OK, passed 100 tests.
  12581. 853.44 s [vector] ifoldM'_: OK (0.04s)
  12582. 853.44 s [vector] +++ OK, passed 100 tests.
  12583. 853.44 s [vector] all: OK
  12584. 853.44 s [vector] +++ OK, passed 100 tests.
  12585. 853.45 s [vector] any: OK
  12586. 853.45 s [vector] +++ OK, passed 100 tests.
  12587. 853.51 s [vector] prescanl: OK (0.01s)
  12588. 853.51 s [vector] +++ OK, passed 100 tests.
  12589. 853.53 s [vector] prescanl': OK (0.06s)
  12590. 853.53 s [vector] +++ OK, passed 100 tests.
  12591. 853.55 s [vector] postscanl: OK (0.02s)
  12592. 853.55 s [vector] +++ OK, passed 100 tests.
  12593. 853.56 s [vector] postscanl': OK (0.02s)
  12594. 853.56 s [vector] +++ OK, passed 100 tests.
  12595. 853.57 s [vector] scanl: OK (0.02s)
  12596. 853.57 s [vector] +++ OK, passed 100 tests.
  12597. 853.59 s [vector] scanl': OK (0.02s)
  12598. 853.59 s [vector] +++ OK, passed 100 tests.
  12599. 853.61 s [vector] scanl1: OK (0.02s)
  12600. 853.61 s [vector] +++ OK, passed 100 tests.
  12601. 853.63 s [vector] scanl1': OK (0.02s)
  12602. 853.63 s [vector] +++ OK, passed 100 tests.
  12603. 853.64 s [vector] iscanl: OK (0.02s)
  12604. 853.64 s [vector] +++ OK, passed 100 tests.
  12605. 853.65 s [vector] iscanl': OK (0.02s)
  12606. 853.65 s [vector] +++ OK, passed 100 tests.
  12607. 853.67 s [vector] prescanr: OK (0.02s)
  12608. 853.67 s [vector] +++ OK, passed 100 tests.
  12609. 853.69 s [vector] prescanr': OK (0.02s)
  12610. 853.69 s [vector] +++ OK, passed 100 tests.
  12611. 853.71 s [vector] postscanr: OK (0.02s)
  12612. 853.71 s [vector] +++ OK, passed 100 tests.
  12613. 853.73 s [vector] postscanr': OK (0.02s)
  12614. 853.73 s [vector] +++ OK, passed 100 tests.
  12615. 853.73 s [vector] scanr: OK (0.02s)
  12616. 853.73 s [vector] +++ OK, passed 100 tests.
  12617. 853.76 s [vector] scanr': OK (0.02s)
  12618. 853.76 s [vector] +++ OK, passed 100 tests.
  12619. 853.78 s [vector] scanr1: OK (0.02s)
  12620. 853.78 s [vector] +++ OK, passed 100 tests.
  12621. 853.78 s [vector] scanr1': OK (0.02s)
  12622. 853.78 s [vector] +++ OK, passed 100 tests.
  12623. 853.80 s [vector] iscanr: OK (0.02s)
  12624. 853.80 s [vector] +++ OK, passed 100 tests.
  12625. 853.81 s [vector] iscanr': OK (0.02s)
  12626. 853.81 s [vector] +++ OK, passed 100 tests.
  12627. 853.81 s [vector] mut_read: OK
  12628. 853.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12629. 853.81 s [vector] mut_write: OK
  12630. 853.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12631. 853.82 s [vector] mut_modify: OK
  12632. 853.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12633. 853.82 s [vector] mut_generate: OK
  12634. 853.84 s [vector] +++ OK, passed 100 tests.
  12635. 853.86 s [vector] mut_generateM: OK (0.02s)
  12636. 853.86 s [vector] +++ OK, passed 100 tests.
  12637. 853.90 s [vector] mut_mapM_: OK (0.04s)
  12638. 853.90 s [vector] +++ OK, passed 100 tests.
  12639. 853.94 s [vector] mut_imapM_: OK (0.03s)
  12640. 853.94 s [vector] +++ OK, passed 100 tests.
  12641. 853.98 s [vector] mut_forM_: OK (0.04s)
  12642. 853.98 s [vector] +++ OK, passed 100 tests.
  12643. 854.01 s [vector] mut_iforM_: OK (0.04s)
  12644. 854.01 s [vector] +++ OK, passed 100 tests.
  12645. 854.02 s [vector] mut_foldr: OK (0.01s)
  12646. 854.02 s [vector] +++ OK, passed 100 tests.
  12647. 854.03 s [vector] mut_foldr': OK (0.01s)
  12648. 854.03 s [vector] +++ OK, passed 100 tests.
  12649. 854.05 s [vector] mut_foldl: OK (0.01s)
  12650. 854.05 s [vector] +++ OK, passed 100 tests.
  12651. 854.05 s [vector] mut_foldl': OK (0.02s)
  12652. 854.05 s [vector] +++ OK, passed 100 tests.
  12653. 854.07 s [vector] mut_ifoldr: OK (0.02s)
  12654. 854.08 s [vector] +++ OK, passed 100 tests.
  12655. 854.10 s [vector] mut_ifoldr': OK (0.02s)
  12656. 854.10 s [vector] +++ OK, passed 100 tests.
  12657. 854.12 s [vector] mut_ifoldl: OK (0.02s)
  12658. 854.12 s [vector] +++ OK, passed 100 tests.
  12659. 854.13 s [vector] mut_ifoldl': OK (0.02s)
  12660. 854.13 s [vector] +++ OK, passed 100 tests.
  12661. 854.16 s [vector] mut_foldM: OK (0.02s)
  12662. 854.16 s [vector] +++ OK, passed 100 tests.
  12663. 854.17 s [vector] mut_foldM': OK (0.02s)
  12664. 854.17 s [vector] +++ OK, passed 100 tests.
  12665. 854.19 s [vector] mut_foldrM: OK (0.02s)
  12666. 854.20 s [vector] +++ OK, passed 100 tests.
  12667. 854.22 s [vector] mut_foldrM': OK (0.02s)
  12668. 854.22 s [vector] +++ OK, passed 100 tests.
  12669. 854.23 s [vector] mut_ifoldM: OK (0.02s)
  12670. 854.23 s [vector] +++ OK, passed 100 tests.
  12671. 854.23 s [vector] mut_ifoldM': OK (0.02s)
  12672. 854.24 s [vector] +++ OK, passed 100 tests.
  12673. 854.26 s [vector] mut_ifoldrM: OK (0.02s)
  12674. 854.26 s [vector] +++ OK, passed 100 tests.
  12675. 854.27 s [vector] mut_ifoldrM': OK (0.01s)
  12676. 854.27 s [vector] +++ OK, passed 100 tests.
  12677. 854.27 s [vector] compare: OK
  12678. 854.27 s [vector] +++ OK, passed 100 tests.
  12679. 854.27 s [vector] maximum: OK
  12680. 854.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12681. 854.27 s [vector] minimum: OK
  12682. 854.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12683. 854.27 s [vector] minIndex: OK
  12684. 854.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12685. 854.27 s [vector] maxIndex: OK
  12686. 854.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12687. 854.27 s [vector] maximumBy: OK
  12688. 854.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12689. 854.27 s [vector] minimumBy: OK
  12690. 854.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12691. 854.27 s [vector] maximumOn: OK
  12692. 854.27 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12693. 854.27 s [vector] minimumOn: OK
  12694. 854.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12695. 854.27 s [vector] maxIndexBy: OK
  12696. 854.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12697. 854.27 s [vector] minIndexBy: OK
  12698. 854.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12699. 854.28 s [vector] ListFirstMaxIndexWins: OK
  12700. 854.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12701. 854.28 s [vector] FalseListFirstMaxIndexWins: OK
  12702. 854.28 s [vector] +++ OK, failed as expected. (after 1 test):
  12703. 854.28 s [vector] Exception:
  12704. 854.28 s [vector] Prelude.foldr1: empty list
  12705. 854.28 s [vector] CallStack (from HasCallStack):
  12706. 854.28 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  12707. 854.28 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  12708. 854.28 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12709. 854.28 s [vector] []
  12710. 854.28 s [vector] mempty: OK
  12711. 854.28 s [vector] +++ OK, passed 1 test.
  12712. 854.28 s [vector] mappend: OK
  12713. 854.30 s [vector] +++ OK, passed 100 tests.
  12714. 854.31 s [vector] mconcat: OK (0.03s)
  12715. 854.31 s [vector] +++ OK, passed 100 tests.
  12716. 854.31 s [vector] glength: OK
  12717. 854.31 s [vector] +++ OK, passed 100 tests.
  12718. 854.31 s [vector] sum: OK
  12719. 854.31 s [vector] +++ OK, passed 100 tests.
  12720. 854.31 s [vector] product: OK
  12721. 854.31 s [vector] +++ OK, passed 100 tests.
  12722. 854.31 s [vector] enumFromN: OK
  12723. 854.31 s [vector] +++ OK, passed 100 tests.
  12724. 854.32 s [vector] enumFromThenN: OK
  12725. 854.32 s [vector] +++ OK, passed 100 tests.
  12726. 854.32 s [vector] enumFromTo: OK
  12727. 854.32 s [vector] +++ OK, passed 100 tests.
  12728. 854.32 s [vector] enumFromThenTo: OK
  12729. 854.32 s [vector] +++ OK, passed 100 tests; 3 discarded.
  12730. 854.32 s [vector] unstream
  12731. 854.32 s [vector] unstream == vunstream (exact): OK
  12732. 854.32 s [vector] +++ OK, passed 100 tests.
  12733. 854.32 s [vector] unstream == vunstream (unknown): OK
  12734. 854.32 s [vector] +++ OK, passed 100 tests.
  12735. 854.32 s [vector] unstreamR ~= vunstream (exact): OK
  12736. 854.32 s [vector] +++ OK, passed 100 tests.
  12737. 854.32 s [vector] unstreamR ~= vunstream (unknown): OK
  12738. 854.32 s [vector] +++ OK, passed 100 tests.
  12739. 854.32 s [vector] Tests.Vector.Storable
  12740. 854.32 s [vector] Data.Vector.Storable.Vector (Int)
  12741. 854.32 s [vector] fromList.toList == id: OK
  12742. 854.32 s [vector] +++ OK, passed 100 tests.
  12743. 854.32 s [vector] toList.fromList == id: OK
  12744. 854.32 s [vector] +++ OK, passed 100 tests.
  12745. 854.32 s [vector] unstream.stream == id: OK
  12746. 854.32 s [vector] +++ OK, passed 100 tests.
  12747. 854.32 s [vector] stream.unstream == id: OK
  12748. 854.32 s [vector] +++ OK, passed 100 tests.
  12749. 854.32 s [vector] eq: OK
  12750. 854.32 s [vector] +++ OK, passed 100 tests.
  12751. 854.32 s [vector] length: OK
  12752. 854.32 s [vector] +++ OK, passed 100 tests.
  12753. 854.32 s [vector] null: OK
  12754. 854.33 s [vector] +++ OK, passed 100 tests.
  12755. 854.33 s [vector] index: OK
  12756. 854.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12757. 854.33 s [vector] safeIndex: OK
  12758. 854.33 s [vector] +++ OK, passed 100 tests.
  12759. 854.33 s [vector] head: OK
  12760. 854.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12761. 854.33 s [vector] last: OK
  12762. 854.33 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12763. 854.33 s [vector] unsafeIndex: OK
  12764. 854.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12765. 854.33 s [vector] unsafeHead: OK
  12766. 854.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12767. 854.33 s [vector] unsafeLast: OK
  12768. 854.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12769. 854.33 s [vector] slice: OK
  12770. 854.33 s [vector] +++ OK, passed 100 tests.
  12771. 854.33 s [vector] init: OK
  12772. 854.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12773. 854.33 s [vector] tail: OK
  12774. 854.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12775. 854.33 s [vector] take: OK
  12776. 854.33 s [vector] +++ OK, passed 100 tests.
  12777. 854.33 s [vector] drop: OK
  12778. 854.33 s [vector] +++ OK, passed 100 tests.
  12779. 854.33 s [vector] splitAt: OK
  12780. 854.33 s [vector] +++ OK, passed 100 tests.
  12781. 854.33 s [vector] empty: OK
  12782. 854.33 s [vector] +++ OK, passed 1 test.
  12783. 854.33 s [vector] singleton: OK
  12784. 854.33 s [vector] +++ OK, passed 100 tests.
  12785. 854.33 s [vector] replicate: OK
  12786. 854.33 s [vector] +++ OK, passed 100 tests.
  12787. 854.34 s [vector] generate: OK
  12788. 854.34 s [vector] +++ OK, passed 100 tests.
  12789. 854.36 s [vector] iterateN: OK
  12790. 854.36 s [vector] +++ OK, passed 100 tests.
  12791. 854.37 s [vector] iterateNM: OK (0.03s)
  12792. 854.80 s [vector] +++ OK, passed 100 tests.
  12793. 854.80 s [vector] generateM: OK (0.02s)
  12794. 854.80 s [vector] +++ OK, passed 100 tests.
  12795. 854.80 s [vector] replicateM: OK
  12796. 854.80 s [vector] +++ OK, passed 100 tests.
  12797. 854.80 s [vector] create: OK
  12798. 854.80 s [vector] +++ OK, passed 100 tests.
  12799. 854.80 s [vector] createT: OK
  12800. 854.80 s [vector] +++ OK, passed 100 tests.
  12801. 854.80 s [vector] unfoldr: OK
  12802. 854.80 s [vector] +++ OK, passed 100 tests.
  12803. 854.80 s [vector] unfoldrN: OK
  12804. 854.80 s [vector] +++ OK, passed 100 tests.
  12805. 854.80 s [vector] unfoldrExactN: OK
  12806. 854.80 s [vector] +++ OK, passed 100 tests.
  12807. 854.80 s [vector] unfoldrM: OK
  12808. 854.80 s [vector] +++ OK, passed 100 tests.
  12809. 854.80 s [vector] unfoldrNM: OK (0.01s)
  12810. 854.80 s [vector] +++ OK, passed 100 tests.
  12811. 854.80 s [vector] unfoldrExactNM: OK (0.01s)
  12812. 854.80 s [vector] +++ OK, passed 100 tests.
  12813. 854.80 s [vector] constructN: OK
  12814. 854.80 s [vector] +++ OK, passed 100 tests.
  12815. 854.80 s [vector] constructrN: OK
  12816. 854.80 s [vector] +++ OK, passed 100 tests.
  12817. 854.80 s [vector] cons: OK
  12818. 854.80 s [vector] +++ OK, passed 100 tests.
  12819. 854.80 s [vector] snoc: OK
  12820. 854.80 s [vector] +++ OK, passed 100 tests.
  12821. 854.80 s [vector] append: OK
  12822. 854.80 s [vector] +++ OK, passed 100 tests.
  12823. 854.80 s [vector] concat: OK (0.02s)
  12824. 854.80 s [vector] +++ OK, passed 100 tests.
  12825. 854.80 s [vector] force: OK
  12826. 854.80 s [vector] +++ OK, passed 100 tests.
  12827. 854.80 s [vector] upd: OK
  12828. 854.80 s [vector] +++ OK, passed 100 tests.
  12829. 854.80 s [vector] accum: OK
  12830. 854.80 s [vector] +++ OK, passed 100 tests.
  12831. 854.80 s [vector] reverse: OK
  12832. 854.80 s [vector] +++ OK, passed 100 tests.
  12833. 854.80 s [vector] backpermute: OK
  12834. 854.80 s [vector] +++ OK, passed 100 tests.
  12835. 854.80 s [vector] map: OK
  12836. 854.80 s [vector] +++ OK, passed 100 tests.
  12837. 854.80 s [vector] imap: OK
  12838. 854.80 s [vector] +++ OK, passed 100 tests.
  12839. 854.80 s [vector] concatMap: OK
  12840. 854.80 s [vector] +++ OK, passed 100 tests.
  12841. 854.80 s [vector] mapM: OK
  12842. 854.80 s [vector] +++ OK, passed 100 tests.
  12843. 854.80 s [vector] mapM_: OK (0.02s)
  12844. 854.80 s [vector] +++ OK, passed 100 tests.
  12845. 854.80 s [vector] forM: OK
  12846. 854.80 s [vector] +++ OK, passed 100 tests.
  12847. 854.80 s [vector] forM_: OK (0.02s)
  12848. 854.80 s [vector] +++ OK, passed 100 tests.
  12849. 854.80 s [vector] imapM: OK
  12850. 854.80 s [vector] +++ OK, passed 100 tests.
  12851. 854.80 s [vector] imapM_: OK (0.02s)
  12852. 854.80 s [vector] +++ OK, passed 100 tests.
  12853. 854.80 s [vector] zipWith: OK
  12854. 854.80 s [vector] +++ OK, passed 100 tests.
  12855. 854.80 s [vector] zipWith3: OK
  12856. 854.80 s [vector] +++ OK, passed 100 tests.
  12857. 854.80 s [vector] izipWith: OK
  12858. 854.80 s [vector] +++ OK, passed 100 tests.
  12859. 854.80 s [vector] izipWith3: OK
  12860. 854.80 s [vector] +++ OK, passed 100 tests.
  12861. 854.80 s [vector] izipWithM: OK
  12862. 854.80 s [vector] +++ OK, passed 100 tests.
  12863. 854.80 s [vector] izipWithM_: OK (0.01s)
  12864. 854.80 s [vector] +++ OK, passed 100 tests.
  12865. 854.80 s [vector] zipWithM: OK
  12866. 854.80 s [vector] +++ OK, passed 100 tests.
  12867. 854.80 s [vector] zipWithM_: OK
  12868. 854.80 s [vector] +++ OK, passed 100 tests.
  12869. 854.80 s [vector] filter: OK
  12870. 854.80 s [vector] +++ OK, passed 100 tests.
  12871. 854.80 s [vector] ifilter: OK
  12872. 854.80 s [vector] +++ OK, passed 100 tests.
  12873. 854.80 s [vector] filterM: OK (0.02s)
  12874. 854.80 s [vector] +++ OK, passed 100 tests.
  12875. 854.80 s [vector] uniq: OK
  12876. 854.80 s [vector] +++ OK, passed 100 tests.
  12877. 854.80 s [vector] mapMaybe: OK
  12878. 854.80 s [vector] +++ OK, passed 100 tests.
  12879. 854.80 s [vector] imapMaybe: OK
  12880. 854.80 s [vector] +++ OK, passed 100 tests.
  12881. 854.80 s [vector] takeWhile: OK
  12882. 854.80 s [vector] +++ OK, passed 100 tests.
  12883. 854.80 s [vector] dropWhile: OK
  12884. 854.80 s [vector] +++ OK, passed 100 tests.
  12885. 854.80 s [vector] partition: OK
  12886. 854.80 s [vector] +++ OK, passed 100 tests.
  12887. 854.80 s [vector] partitionWith: OK
  12888. 854.80 s [vector] +++ OK, passed 100 tests.
  12889. 854.80 s [vector] span: OK
  12890. 854.80 s [vector] +++ OK, passed 100 tests.
  12891. 854.80 s [vector] break: OK
  12892. 854.80 s [vector] +++ OK, passed 100 tests.
  12893. 854.80 s [vector] spanR: OK
  12894. 854.80 s [vector] +++ OK, passed 100 tests.
  12895. 854.80 s [vector] breakR: OK
  12896. 854.80 s [vector] +++ OK, passed 100 tests.
  12897. 854.80 s [vector] groupBy: OK
  12898. 854.80 s [vector] +++ OK, passed 100 tests.
  12899. 854.80 s [vector] elem: OK
  12900. 854.80 s [vector] +++ OK, passed 100 tests.
  12901. 854.80 s [vector] notElem: OK
  12902. 854.80 s [vector] +++ OK, passed 100 tests.
  12903. 854.80 s [vector] find: OK
  12904. 854.80 s [vector] +++ OK, passed 100 tests.
  12905. 854.80 s [vector] findIndex: OK
  12906. 854.80 s [vector] +++ OK, passed 100 tests.
  12907. 854.80 s [vector] findIndexR: OK
  12908. 854.80 s [vector] +++ OK, passed 100 tests.
  12909. 854.80 s [vector] findIndices: OK
  12910. 854.80 s [vector] +++ OK, passed 100 tests.
  12911. 854.80 s [vector] elemIndex: OK
  12912. 854.80 s [vector] +++ OK, passed 100 tests.
  12913. 854.80 s [vector] elemIndices: OK
  12914. 854.80 s [vector] +++ OK, passed 100 tests.
  12915. 854.80 s [vector] foldl: OK
  12916. 854.80 s [vector] +++ OK, passed 100 tests.
  12917. 854.80 s [vector] foldl1: OK
  12918. 854.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12919. 854.80 s [vector] foldl': OK
  12920. 854.80 s [vector] +++ OK, passed 100 tests.
  12921. 854.80 s [vector] foldl1': OK
  12922. 854.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12923. 854.80 s [vector] foldr: OK
  12924. 854.80 s [vector] +++ OK, passed 100 tests.
  12925. 854.80 s [vector] foldr1: OK
  12926. 854.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12927. 854.80 s [vector] foldr': OK
  12928. 854.80 s [vector] +++ OK, passed 100 tests.
  12929. 854.80 s [vector] foldr1': OK
  12930. 854.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12931. 854.80 s [vector] ifoldl: OK
  12932. 854.80 s [vector] +++ OK, passed 100 tests.
  12933. 854.80 s [vector] ifoldl': OK
  12934. 854.80 s [vector] +++ OK, passed 100 tests.
  12935. 854.80 s [vector] ifoldr: OK
  12936. 854.80 s [vector] +++ OK, passed 100 tests.
  12937. 854.80 s [vector] ifoldr': OK
  12938. 854.80 s [vector] +++ OK, passed 100 tests.
  12939. 854.80 s [vector] ifoldM: OK
  12940. 854.80 s [vector] +++ OK, passed 100 tests.
  12941. 854.80 s [vector] ifoldM': OK
  12942. 854.80 s [vector] +++ OK, passed 100 tests.
  12943. 854.80 s [vector] ifoldM_: OK (0.02s)
  12944. 854.80 s [vector] +++ OK, passed 100 tests.
  12945. 854.80 s [vector] ifoldM'_: OK
  12946. 854.80 s [vector] +++ OK, passed 100 tests.
  12947. 854.80 s [vector] all: OK
  12948. 854.80 s [vector] +++ OK, passed 100 tests.
  12949. 854.80 s [vector] any: OK
  12950. 854.80 s [vector] +++ OK, passed 100 tests.
  12951. 854.80 s [vector] prescanl: OK
  12952. 854.81 s [vector] +++ OK, passed 100 tests.
  12953. 854.81 s [vector] prescanl': OK
  12954. 854.81 s [vector] +++ OK, passed 100 tests.
  12955. 854.81 s [vector] postscanl: OK
  12956. 854.81 s [vector] +++ OK, passed 100 tests.
  12957. 854.81 s [vector] postscanl': OK
  12958. 854.81 s [vector] +++ OK, passed 100 tests.
  12959. 854.81 s [vector] scanl: OK
  12960. 854.81 s [vector] +++ OK, passed 100 tests.
  12961. 854.81 s [vector] scanl': OK
  12962. 854.81 s [vector] +++ OK, passed 100 tests.
  12963. 854.81 s [vector] scanl1: OK
  12964. 854.81 s [vector] +++ OK, passed 100 tests.
  12965. 854.81 s [vector] scanl1': OK
  12966. 854.81 s [vector] +++ OK, passed 100 tests.
  12967. 854.81 s [vector] iscanl: OK
  12968. 854.81 s [vector] +++ OK, passed 100 tests.
  12969. 854.81 s [vector] iscanl': OK
  12970. 854.81 s [vector] +++ OK, passed 100 tests.
  12971. 854.81 s [vector] prescanr: OK
  12972. 854.81 s [vector] +++ OK, passed 100 tests.
  12973. 854.81 s [vector] prescanr': OK
  12974. 854.81 s [vector] +++ OK, passed 100 tests.
  12975. 854.81 s [vector] postscanr: OK
  12976. 854.81 s [vector] +++ OK, passed 100 tests.
  12977. 854.81 s [vector] postscanr': OK
  12978. 854.81 s [vector] +++ OK, passed 100 tests.
  12979. 854.81 s [vector] scanr: OK
  12980. 854.81 s [vector] +++ OK, passed 100 tests.
  12981. 854.81 s [vector] scanr': OK
  12982. 854.81 s [vector] +++ OK, passed 100 tests.
  12983. 854.81 s [vector] scanr1: OK
  12984. 854.81 s [vector] +++ OK, passed 100 tests.
  12985. 854.81 s [vector] scanr1': OK
  12986. 854.81 s [vector] +++ OK, passed 100 tests.
  12987. 854.81 s [vector] iscanr: OK
  12988. 854.81 s [vector] +++ OK, passed 100 tests.
  12989. 854.81 s [vector] iscanr': OK
  12990. 854.81 s [vector] +++ OK, passed 100 tests.
  12991. 854.81 s [vector] mut_read: OK
  12992. 854.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12993. 854.81 s [vector] mut_write: OK
  12994. 854.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12995. 854.81 s [vector] mut_modify: OK
  12996. 854.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12997. 854.81 s [vector] mut_generate: OK
  12998. 854.81 s [vector] +++ OK, passed 100 tests.
  12999. 854.81 s [vector] mut_generateM: OK (0.01s)
  13000. 854.81 s [vector] +++ OK, passed 100 tests.
  13001. 854.81 s [vector] mut_mapM_: OK
  13002. 854.81 s [vector] +++ OK, passed 100 tests.
  13003. 854.81 s [vector] mut_imapM_: OK (0.01s)
  13004. 854.81 s [vector] +++ OK, passed 100 tests.
  13005. 854.81 s [vector] mut_forM_: OK (0.01s)
  13006. 854.81 s [vector] +++ OK, passed 100 tests.
  13007. 854.82 s [vector] mut_iforM_: OK (0.02s)
  13008. 854.82 s [vector] +++ OK, passed 100 tests.
  13009. 854.82 s [vector] mut_foldr: OK
  13010. 854.83 s [vector] +++ OK, passed 100 tests.
  13011. 854.83 s [vector] mut_foldr': OK
  13012. 854.83 s [vector] +++ OK, passed 100 tests.
  13013. 854.83 s [vector] mut_foldl: OK
  13014. 854.83 s [vector] +++ OK, passed 100 tests.
  13015. 854.83 s [vector] mut_foldl': OK
  13016. 854.83 s [vector] +++ OK, passed 100 tests.
  13017. 854.83 s [vector] mut_ifoldr: OK
  13018. 854.83 s [vector] +++ OK, passed 100 tests.
  13019. 854.84 s [vector] mut_ifoldr': OK
  13020. 854.84 s [vector] +++ OK, passed 100 tests.
  13021. 854.84 s [vector] mut_ifoldl: OK
  13022. 854.84 s [vector] +++ OK, passed 100 tests.
  13023. 854.85 s [vector] mut_ifoldl': OK
  13024. 854.85 s [vector] +++ OK, passed 100 tests.
  13025. 854.85 s [vector] mut_foldM: OK
  13026. 854.85 s [vector] +++ OK, passed 100 tests.
  13027. 854.86 s [vector] mut_foldM': OK
  13028. 854.86 s [vector] +++ OK, passed 100 tests.
  13029. 854.86 s [vector] mut_foldrM: OK (0.01s)
  13030. 854.86 s [vector] +++ OK, passed 100 tests.
  13031. 854.87 s [vector] mut_foldrM': OK
  13032. 854.87 s [vector] +++ OK, passed 100 tests.
  13033. 854.87 s [vector] mut_ifoldM: OK
  13034. 854.87 s [vector] +++ OK, passed 100 tests.
  13035. 854.87 s [vector] mut_ifoldM': OK
  13036. 854.87 s [vector] +++ OK, passed 100 tests.
  13037. 854.88 s [vector] mut_ifoldrM: OK
  13038. 854.88 s [vector] +++ OK, passed 100 tests.
  13039. 854.88 s [vector] mut_ifoldrM': OK
  13040. 854.88 s [vector] +++ OK, passed 100 tests.
  13041. 854.88 s [vector] compare: OK
  13042. 854.88 s [vector] +++ OK, passed 100 tests.
  13043. 854.88 s [vector] maximum: OK
  13044. 854.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13045. 854.88 s [vector] minimum: OK
  13046. 854.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13047. 854.88 s [vector] minIndex: OK
  13048. 854.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13049. 854.88 s [vector] maxIndex: OK
  13050. 854.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13051. 854.88 s [vector] maximumBy: OK
  13052. 854.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13053. 854.89 s [vector] minimumBy: OK
  13054. 854.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13055. 854.89 s [vector] maximumOn: OK
  13056. 854.89 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13057. 854.89 s [vector] minimumOn: OK
  13058. 854.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13059. 854.89 s [vector] maxIndexBy: OK
  13060. 854.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13061. 854.89 s [vector] minIndexBy: OK
  13062. 854.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13063. 854.89 s [vector] ListFirstMaxIndexWins: OK
  13064. 854.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13065. 854.89 s [vector] FalseListFirstMaxIndexWins: OK
  13066. 854.89 s [vector] +++ OK, failed as expected. (after 1 test):
  13067. 854.89 s [vector] Exception:
  13068. 854.89 s [vector] Prelude.foldr1: empty list
  13069. 854.89 s [vector] CallStack (from HasCallStack):
  13070. 854.89 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  13071. 854.89 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  13072. 854.89 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13073. 854.89 s [vector] []
  13074. 854.89 s [vector] mempty: OK
  13075. 854.89 s [vector] +++ OK, passed 1 test.
  13076. 854.90 s [vector] mappend: OK
  13077. 854.90 s [vector] +++ OK, passed 100 tests.
  13078. 854.91 s [vector] mconcat: OK (0.02s)
  13079. 854.91 s [vector] +++ OK, passed 100 tests.
  13080. 854.91 s [vector] glength: OK
  13081. 854.91 s [vector] +++ OK, passed 100 tests.
  13082. 854.91 s [vector] sum: OK
  13083. 854.91 s [vector] +++ OK, passed 100 tests.
  13084. 854.91 s [vector] product: OK
  13085. 854.91 s [vector] +++ OK, passed 100 tests.
  13086. 854.91 s [vector] enumFromN: OK
  13087. 854.91 s [vector] +++ OK, passed 100 tests.
  13088. 854.91 s [vector] enumFromThenN: OK
  13089. 854.91 s [vector] +++ OK, passed 100 tests.
  13090. 854.91 s [vector] enumFromTo: OK
  13091. 854.91 s [vector] +++ OK, passed 100 tests.
  13092. 854.91 s [vector] enumFromThenTo: OK
  13093. 854.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13094. 854.91 s [vector] Data.Vector.Storable.Vector (Double)
  13095. 854.91 s [vector] fromList.toList == id: OK
  13096. 854.91 s [vector] +++ OK, passed 100 tests.
  13097. 854.91 s [vector] toList.fromList == id: OK
  13098. 854.91 s [vector] +++ OK, passed 100 tests.
  13099. 854.91 s [vector] unstream.stream == id: OK
  13100. 854.91 s [vector] +++ OK, passed 100 tests.
  13101. 854.91 s [vector] stream.unstream == id: OK
  13102. 854.91 s [vector] +++ OK, passed 100 tests.
  13103. 854.91 s [vector] eq: OK
  13104. 854.91 s [vector] +++ OK, passed 100 tests.
  13105. 854.91 s [vector] length: OK
  13106. 854.91 s [vector] +++ OK, passed 100 tests.
  13107. 854.91 s [vector] null: OK
  13108. 854.91 s [vector] +++ OK, passed 100 tests.
  13109. 854.91 s [vector] index: OK
  13110. 854.92 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13111. 854.92 s [vector] safeIndex: OK
  13112. 854.92 s [vector] +++ OK, passed 100 tests.
  13113. 854.92 s [vector] head: OK
  13114. 854.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13115. 854.92 s [vector] last: OK
  13116. 854.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13117. 854.92 s [vector] unsafeIndex: OK
  13118. 854.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13119. 854.92 s [vector] unsafeHead: OK
  13120. 854.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13121. 854.92 s [vector] unsafeLast: OK
  13122. 854.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13123. 854.92 s [vector] slice: OK
  13124. 854.92 s [vector] +++ OK, passed 100 tests.
  13125. 854.92 s [vector] init: OK
  13126. 854.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13127. 854.92 s [vector] tail: OK
  13128. 854.92 s [vector] +++ OK, passed 100 tests; 24 discarded.
  13129. 854.92 s [vector] take: OK
  13130. 854.92 s [vector] +++ OK, passed 100 tests.
  13131. 854.92 s [vector] drop: OK
  13132. 854.92 s [vector] +++ OK, passed 100 tests.
  13133. 854.92 s [vector] splitAt: OK
  13134. 854.92 s [vector] +++ OK, passed 100 tests.
  13135. 854.92 s [vector] empty: OK
  13136. 854.92 s [vector] +++ OK, passed 1 test.
  13137. 854.92 s [vector] singleton: OK
  13138. 854.93 s [vector] +++ OK, passed 100 tests.
  13139. 854.93 s [vector] replicate: OK
  13140. 854.93 s [vector] +++ OK, passed 100 tests.
  13141. 854.93 s [vector] generate: OK
  13142. 854.93 s [vector] +++ OK, passed 100 tests.
  13143. 854.93 s [vector] iterateN: OK
  13144. 854.93 s [vector] +++ OK, passed 100 tests.
  13145. 854.96 s [vector] iterateNM: OK (0.02s)
  13146. 854.96 s [vector] +++ OK, passed 100 tests.
  13147. 854.98 s [vector] generateM: OK (0.02s)
  13148. 854.98 s [vector] +++ OK, passed 100 tests.
  13149. 855.00 s [vector] replicateM: OK (0.02s)
  13150. 855.00 s [vector] +++ OK, passed 100 tests.
  13151. 855.00 s [vector] create: OK
  13152. 855.00 s [vector] +++ OK, passed 100 tests.
  13153. 855.00 s [vector] createT: OK
  13154. 855.00 s [vector] +++ OK, passed 100 tests.
  13155. 855.00 s [vector] unfoldr: OK
  13156. 855.00 s [vector] +++ OK, passed 100 tests.
  13157. 855.00 s [vector] unfoldrN: OK
  13158. 855.00 s [vector] +++ OK, passed 100 tests.
  13159. 855.00 s [vector] unfoldrExactN: OK
  13160. 855.00 s [vector] +++ OK, passed 100 tests.
  13161. 855.01 s [vector] unfoldrM: OK
  13162. 855.01 s [vector] +++ OK, passed 100 tests.
  13163. 855.02 s [vector] unfoldrNM: OK
  13164. 855.02 s [vector] +++ OK, passed 100 tests.
  13165. 855.03 s [vector] unfoldrExactNM: OK (0.01s)
  13166. 855.03 s [vector] +++ OK, passed 100 tests.
  13167. 855.04 s [vector] constructN: OK (0.01s)
  13168. 855.04 s [vector] +++ OK, passed 100 tests.
  13169. 855.05 s [vector] constructrN: OK (0.02s)
  13170. 855.05 s [vector] +++ OK, passed 100 tests.
  13171. 855.05 s [vector] cons: OK
  13172. 855.05 s [vector] +++ OK, passed 100 tests.
  13173. 855.05 s [vector] snoc: OK
  13174. 855.05 s [vector] +++ OK, passed 100 tests.
  13175. 855.05 s [vector] append: OK
  13176. 855.06 s [vector] +++ OK, passed 100 tests.
  13177. 855.08 s [vector] concat: OK (0.02s)
  13178. 855.08 s [vector] +++ OK, passed 100 tests.
  13179. 855.08 s [vector] force: OK
  13180. 855.08 s [vector] +++ OK, passed 100 tests.
  13181. 855.08 s [vector] upd: OK
  13182. 855.08 s [vector] +++ OK, passed 100 tests.
  13183. 855.09 s [vector] accum: OK
  13184. 855.09 s [vector] +++ OK, passed 100 tests.
  13185. 855.09 s [vector] reverse: OK
  13186. 855.09 s [vector] +++ OK, passed 100 tests.
  13187. 855.10 s [vector] backpermute: OK
  13188. 855.10 s [vector] +++ OK, passed 100 tests.
  13189. 855.11 s [vector] map: OK
  13190. 855.11 s [vector] +++ OK, passed 100 tests.
  13191. 855.12 s [vector] imap: OK
  13192. 855.12 s [vector] +++ OK, passed 100 tests.
  13193. 855.13 s [vector] concatMap: OK
  13194. 855.13 s [vector] +++ OK, passed 100 tests.
  13195. 855.13 s [vector] mapM: OK
  13196. 855.14 s [vector] +++ OK, passed 100 tests.
  13197. 855.18 s [vector] mapM_: OK (0.04s)
  13198. 855.18 s [vector] +++ OK, passed 100 tests.
  13199. 855.19 s [vector] forM: OK
  13200. 855.20 s [vector] +++ OK, passed 100 tests.
  13201. 855.23 s [vector] forM_: OK (0.04s)
  13202. 855.23 s [vector] +++ OK, passed 100 tests.
  13203. 855.23 s [vector] imapM: OK
  13204. 855.23 s [vector] +++ OK, passed 100 tests.
  13205. 855.28 s [vector] imapM_: OK (0.04s)
  13206. 855.28 s [vector] +++ OK, passed 100 tests.
  13207. 855.29 s [vector] zipWith: OK (0.01s)
  13208. 855.29 s [vector] +++ OK, passed 100 tests.
  13209. 855.29 s [vector] zipWith3: OK (0.01s)
  13210. 855.29 s [vector] +++ OK, passed 100 tests.
  13211. 855.31 s [vector] izipWith: OK (0.01s)
  13212. 855.31 s [vector] +++ OK, passed 100 tests.
  13213. 855.32 s [vector] izipWith3: OK (0.01s)
  13214. 855.32 s [vector] +++ OK, passed 100 tests.
  13215. 855.33 s [vector] izipWithM: OK (0.01s)
  13216. 855.33 s [vector] +++ OK, passed 100 tests.
  13217. 855.35 s [vector] izipWithM_: OK (0.03s)
  13218. 855.35 s [vector] +++ OK, passed 100 tests.
  13219. 855.36 s [vector] zipWithM: OK
  13220. 855.37 s [vector] +++ OK, passed 100 tests.
  13221. 855.40 s [vector] zipWithM_: OK (0.03s)
  13222. 855.40 s [vector] +++ OK, passed 100 tests.
  13223. 855.40 s [vector] filter: OK
  13224. 855.40 s [vector] +++ OK, passed 100 tests.
  13225. 855.40 s [vector] ifilter: OK
  13226. 855.40 s [vector] +++ OK, passed 100 tests.
  13227. 855.45 s [vector] filterM: OK (0.03s)
  13228. 855.45 s [vector] +++ OK, passed 100 tests.
  13229. 855.45 s [vector] uniq: OK
  13230. 855.45 s [vector] +++ OK, passed 100 tests.
  13231. 855.46 s [vector] mapMaybe: OK
  13232. 855.46 s [vector] +++ OK, passed 100 tests.
  13233. 855.46 s [vector] imapMaybe: OK
  13234. 855.46 s [vector] +++ OK, passed 100 tests.
  13235. 855.46 s [vector] takeWhile: OK
  13236. 855.47 s [vector] +++ OK, passed 100 tests.
  13237. 855.47 s [vector] dropWhile: OK
  13238. 855.47 s [vector] +++ OK, passed 100 tests.
  13239. 855.47 s [vector] partition: OK
  13240. 855.47 s [vector] +++ OK, passed 100 tests.
  13241. 855.48 s [vector] partitionWith: OK
  13242. 855.49 s [vector] +++ OK, passed 100 tests.
  13243. 855.49 s [vector] span: OK
  13244. 855.49 s [vector] +++ OK, passed 100 tests.
  13245. 855.49 s [vector] break: OK
  13246. 855.49 s [vector] +++ OK, passed 100 tests.
  13247. 855.49 s [vector] spanR: OK
  13248. 855.49 s [vector] +++ OK, passed 100 tests.
  13249. 855.50 s [vector] breakR: OK
  13250. 855.50 s [vector] +++ OK, passed 100 tests.
  13251. 855.50 s [vector] groupBy: OK
  13252. 855.50 s [vector] +++ OK, passed 100 tests.
  13253. 855.50 s [vector] elem: OK
  13254. 855.50 s [vector] +++ OK, passed 100 tests.
  13255. 855.50 s [vector] notElem: OK
  13256. 855.50 s [vector] +++ OK, passed 100 tests.
  13257. 855.50 s [vector] find: OK
  13258. 855.50 s [vector] +++ OK, passed 100 tests.
  13259. 855.50 s [vector] findIndex: OK
  13260. 855.50 s [vector] +++ OK, passed 100 tests.
  13261. 855.51 s [vector] findIndexR: OK
  13262. 855.51 s [vector] +++ OK, passed 100 tests.
  13263. 855.51 s [vector] findIndices: OK
  13264. 855.51 s [vector] +++ OK, passed 100 tests.
  13265. 855.51 s [vector] elemIndex: OK
  13266. 855.51 s [vector] +++ OK, passed 100 tests.
  13267. 855.53 s [vector] elemIndices: OK
  13268. 855.53 s [vector] +++ OK, passed 100 tests.
  13269. 855.53 s [vector] foldl: OK (0.02s)
  13270. 855.54 s [vector] +++ OK, passed 100 tests.
  13271. 855.56 s [vector] foldl1: OK (0.01s)
  13272. 855.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13273. 855.57 s [vector] foldl': OK (0.02s)
  13274. 855.57 s [vector] +++ OK, passed 100 tests.
  13275. 855.59 s [vector] foldl1': OK (0.02s)
  13276. 855.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13277. 855.61 s [vector] foldr: OK (0.02s)
  13278. 855.61 s [vector] +++ OK, passed 100 tests.
  13279. 855.61 s [vector] foldr1: OK (0.01s)
  13280. 855.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13281. 855.63 s [vector] foldr': OK (0.01s)
  13282. 855.63 s [vector] +++ OK, passed 100 tests.
  13283. 855.65 s [vector] foldr1': OK (0.01s)
  13284. 855.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13285. 855.65 s [vector] ifoldl: OK (0.01s)
  13286. 855.65 s [vector] +++ OK, passed 100 tests.
  13287. 855.67 s [vector] ifoldl': OK (0.01s)
  13288. 855.67 s [vector] +++ OK, passed 100 tests.
  13289. 855.69 s [vector] ifoldr: OK (0.01s)
  13290. 855.69 s [vector] +++ OK, passed 100 tests.
  13291. 855.69 s [vector] ifoldr': OK (0.01s)
  13292. 855.69 s [vector] +++ OK, passed 100 tests.
  13293. 855.72 s [vector] ifoldM: OK (0.01s)
  13294. 855.72 s [vector] +++ OK, passed 100 tests.
  13295. 855.73 s [vector] ifoldM': OK (0.01s)
  13296. 855.73 s [vector] +++ OK, passed 100 tests.
  13297. 855.75 s [vector] ifoldM_: OK (0.03s)
  13298. 855.75 s [vector] +++ OK, passed 100 tests.
  13299. 855.78 s [vector] ifoldM'_: OK (0.03s)
  13300. 855.78 s [vector] +++ OK, passed 100 tests.
  13301. 855.79 s [vector] all: OK
  13302. 855.80 s [vector] +++ OK, passed 100 tests.
  13303. 855.80 s [vector] any: OK
  13304. 855.80 s [vector] +++ OK, passed 100 tests.
  13305. 855.81 s [vector] prescanl: OK (0.01s)
  13306. 855.82 s [vector] +++ OK, passed 100 tests.
  13307. 855.82 s [vector] prescanl': OK (0.01s)
  13308. 855.83 s [vector] +++ OK, passed 100 tests.
  13309. 855.83 s [vector] postscanl: OK (0.02s)
  13310. 855.83 s [vector] +++ OK, passed 100 tests.
  13311. 855.83 s [vector] postscanl': OK (0.01s)
  13312. 855.83 s [vector] +++ OK, passed 100 tests.
  13313. 855.85 s [vector] scanl: OK (0.01s)
  13314. 855.86 s [vector] +++ OK, passed 100 tests.
  13315. 855.87 s [vector] scanl': OK (0.01s)
  13316. 855.87 s [vector] +++ OK, passed 100 tests.
  13317. 855.88 s [vector] scanl1: OK (0.01s)
  13318. 855.89 s [vector] +++ OK, passed 100 tests.
  13319. 855.89 s [vector] scanl1': OK (0.02s)
  13320. 855.89 s [vector] +++ OK, passed 100 tests.
  13321. 855.94 s [vector] iscanl: OK (0.03s)
  13322. 855.94 s [vector] +++ OK, passed 100 tests.
  13323. 855.96 s [vector] iscanl': OK (0.03s)
  13324. 855.96 s [vector] +++ OK, passed 100 tests.
  13325. 855.98 s [vector] prescanr: OK (0.02s)
  13326. 855.98 s [vector] +++ OK, passed 100 tests.
  13327. 855.99 s [vector] prescanr': OK (0.02s)
  13328. 855.99 s [vector] +++ OK, passed 100 tests.
  13329. 856.02 s [vector] postscanr: OK (0.02s)
  13330. 856.02 s [vector] +++ OK, passed 100 tests.
  13331. 856.03 s [vector] postscanr': OK (0.02s)
  13332. 856.03 s [vector] +++ OK, passed 100 tests.
  13333. 856.03 s [vector] scanr: OK (0.02s)
  13334. 856.03 s [vector] +++ OK, passed 100 tests.
  13335. 856.06 s [vector] scanr': OK (0.01s)
  13336. 856.06 s [vector] +++ OK, passed 100 tests.
  13337. 856.08 s [vector] scanr1: OK (0.01s)
  13338. 856.08 s [vector] +++ OK, passed 100 tests.
  13339. 856.09 s [vector] scanr1': OK (0.01s)
  13340. 856.09 s [vector] +++ OK, passed 100 tests.
  13341. 856.09 s [vector] iscanr: OK (0.02s)
  13342. 856.09 s [vector] +++ OK, passed 100 tests.
  13343. 856.11 s [vector] iscanr': OK (0.01s)
  13344. 856.11 s [vector] +++ OK, passed 100 tests.
  13345. 856.11 s [vector] mut_read: OK
  13346. 856.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13347. 856.11 s [vector] mut_write: OK
  13348. 856.11 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13349. 856.11 s [vector] mut_modify: OK
  13350. 856.11 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13351. 856.11 s [vector] mut_generate: OK
  13352. 856.12 s [vector] +++ OK, passed 100 tests.
  13353. 856.13 s [vector] mut_generateM: OK (0.02s)
  13354. 856.13 s [vector] +++ OK, passed 100 tests.
  13355. 856.17 s [vector] mut_mapM_: OK (0.03s)
  13356. 856.18 s [vector] +++ OK, passed 100 tests.
  13357. 856.19 s [vector] mut_imapM_: OK (0.03s)
  13358. 856.19 s [vector] +++ OK, passed 100 tests.
  13359. 856.23 s [vector] mut_forM_: OK (0.03s)
  13360. 856.23 s [vector] +++ OK, passed 100 tests.
  13361. 856.28 s [vector] mut_iforM_: OK (0.04s)
  13362. 856.28 s [vector] +++ OK, passed 100 tests.
  13363. 856.29 s [vector] mut_foldr: OK (0.01s)
  13364. 856.29 s [vector] +++ OK, passed 100 tests.
  13365. 856.31 s [vector] mut_foldr': OK (0.01s)
  13366. 856.31 s [vector] +++ OK, passed 100 tests.
  13367. 856.31 s [vector] mut_foldl: OK (0.01s)
  13368. 856.31 s [vector] +++ OK, passed 100 tests.
  13369. 856.33 s [vector] mut_foldl': OK (0.02s)
  13370. 856.33 s [vector] +++ OK, passed 100 tests.
  13371. 856.35 s [vector] mut_ifoldr: OK (0.02s)
  13372. 856.35 s [vector] +++ OK, passed 100 tests.
  13373. 856.37 s [vector] mut_ifoldr': OK (0.02s)
  13374. 856.37 s [vector] +++ OK, passed 100 tests.
  13375. 856.37 s [vector] mut_ifoldl: OK (0.02s)
  13376. 856.37 s [vector] +++ OK, passed 100 tests.
  13377. 856.39 s [vector] mut_ifoldl': OK (0.02s)
  13378. 856.39 s [vector] +++ OK, passed 100 tests.
  13379. 856.41 s [vector] mut_foldM: OK (0.01s)
  13380. 856.41 s [vector] +++ OK, passed 100 tests.
  13381. 856.44 s [vector] mut_foldM': OK (0.02s)
  13382. 856.44 s [vector] +++ OK, passed 100 tests.
  13383. 856.45 s [vector] mut_foldrM: OK (0.02s)
  13384. 856.45 s [vector] +++ OK, passed 100 tests.
  13385. 856.48 s [vector] mut_foldrM': OK (0.02s)
  13386. 856.48 s [vector] +++ OK, passed 100 tests.
  13387. 856.49 s [vector] mut_ifoldM: OK (0.02s)
  13388. 856.49 s [vector] +++ OK, passed 100 tests.
  13389. 856.51 s [vector] mut_ifoldM': OK (0.02s)
  13390. 856.51 s [vector] +++ OK, passed 100 tests.
  13391. 856.51 s [vector] mut_ifoldrM: OK (0.01s)
  13392. 856.52 s [vector] +++ OK, passed 100 tests.
  13393. 856.53 s [vector] mut_ifoldrM': OK (0.02s)
  13394. 856.53 s [vector] +++ OK, passed 100 tests.
  13395. 856.53 s [vector] compare: OK
  13396. 856.53 s [vector] +++ OK, passed 100 tests.
  13397. 856.53 s [vector] maximum: OK
  13398. 856.53 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13399. 856.53 s [vector] minimum: OK
  13400. 856.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13401. 856.53 s [vector] minIndex: OK
  13402. 856.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13403. 856.54 s [vector] maxIndex: OK
  13404. 856.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13405. 856.54 s [vector] maximumBy: OK
  13406. 856.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13407. 856.54 s [vector] minimumBy: OK
  13408. 856.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13409. 856.54 s [vector] maximumOn: OK
  13410. 856.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13411. 856.54 s [vector] minimumOn: OK
  13412. 856.54 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13413. 856.54 s [vector] maxIndexBy: OK
  13414. 856.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13415. 856.54 s [vector] minIndexBy: OK
  13416. 856.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13417. 856.54 s [vector] ListFirstMaxIndexWins: OK
  13418. 856.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13419. 856.54 s [vector] FalseListFirstMaxIndexWins: OK
  13420. 856.54 s [vector] +++ OK, failed as expected. (after 1 test):
  13421. 856.54 s [vector] Exception:
  13422. 856.54 s [vector] Prelude.foldr1: empty list
  13423. 856.54 s [vector] CallStack (from HasCallStack):
  13424. 856.54 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  13425. 856.54 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  13426. 856.54 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13427. 856.55 s [vector] []
  13428. 856.55 s [vector] mempty: OK
  13429. 856.56 s [vector] +++ OK, passed 1 test.
  13430. 856.56 s [vector] mappend: OK
  13431. 856.56 s [vector] +++ OK, passed 100 tests.
  13432. 856.57 s [vector] mconcat: OK (0.02s)
  13433. 856.57 s [vector] +++ OK, passed 100 tests.
  13434. 856.57 s [vector] glength: OK
  13435. 856.57 s [vector] +++ OK, passed 100 tests.
  13436. 856.57 s [vector] sum: OK
  13437. 856.57 s [vector] +++ OK, passed 100 tests.
  13438. 856.57 s [vector] product: OK
  13439. 856.57 s [vector] +++ OK, passed 100 tests.
  13440. 856.57 s [vector] enumFromN: OK
  13441. 856.57 s [vector] +++ OK, passed 100 tests.
  13442. 856.57 s [vector] enumFromThenN: OK
  13443. 856.57 s [vector] +++ OK, passed 100 tests.
  13444. 856.57 s [vector] enumFromTo: OK
  13445. 856.57 s [vector] +++ OK, passed 100 tests.
  13446. 856.57 s [vector] enumFromThenTo: OK
  13447. 856.57 s [vector] +++ OK, passed 100 tests; 1 discarded.
  13448. 856.57 s [vector] unstream
  13449. 856.57 s [vector] unstream == vunstream (exact): OK
  13450. 856.58 s [vector] +++ OK, passed 100 tests.
  13451. 856.58 s [vector] unstream == vunstream (unknown): OK
  13452. 856.58 s [vector] +++ OK, passed 100 tests.
  13453. 856.58 s [vector] unstreamR ~= vunstream (exact): OK
  13454. 856.58 s [vector] +++ OK, passed 100 tests.
  13455. 856.58 s [vector] unstreamR ~= vunstream (unknown): OK
  13456. 856.58 s [vector] +++ OK, passed 100 tests.
  13457. 856.58 s [vector] Tests.Vector.Strict
  13458. 856.58 s [vector] Bool
  13459. 856.58 s [vector] fromList.toList == id: OK
  13460. 856.58 s [vector] +++ OK, passed 100 tests.
  13461. 856.58 s [vector] toList.fromList == id: OK
  13462. 856.58 s [vector] +++ OK, passed 100 tests.
  13463. 856.58 s [vector] unstream.stream == id: OK
  13464. 856.58 s [vector] +++ OK, passed 100 tests.
  13465. 856.58 s [vector] stream.unstream == id: OK
  13466. 856.58 s [vector] +++ OK, passed 100 tests.
  13467. 856.58 s [vector] eq: OK
  13468. 856.58 s [vector] +++ OK, passed 100 tests.
  13469. 856.58 s [vector] length: OK
  13470. 856.58 s [vector] +++ OK, passed 100 tests.
  13471. 856.58 s [vector] null: OK
  13472. 856.58 s [vector] +++ OK, passed 100 tests.
  13473. 856.58 s [vector] index: OK
  13474. 856.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13475. 856.58 s [vector] safeIndex: OK
  13476. 856.58 s [vector] +++ OK, passed 100 tests.
  13477. 856.58 s [vector] head: OK
  13478. 856.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13479. 856.58 s [vector] last: OK
  13480. 856.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13481. 856.58 s [vector] unsafeIndex: OK
  13482. 856.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13483. 856.58 s [vector] unsafeHead: OK
  13484. 856.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13485. 856.58 s [vector] unsafeLast: OK
  13486. 856.58 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13487. 856.58 s [vector] slice: OK
  13488. 856.58 s [vector] +++ OK, passed 100 tests.
  13489. 856.58 s [vector] init: OK
  13490. 856.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13491. 856.58 s [vector] tail: OK
  13492. 856.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13493. 856.59 s [vector] take: OK
  13494. 856.59 s [vector] +++ OK, passed 100 tests.
  13495. 856.59 s [vector] drop: OK
  13496. 856.59 s [vector] +++ OK, passed 100 tests.
  13497. 856.59 s [vector] splitAt: OK
  13498. 856.59 s [vector] +++ OK, passed 100 tests.
  13499. 856.59 s [vector] empty: OK
  13500. 856.59 s [vector] +++ OK, passed 1 test.
  13501. 856.59 s [vector] singleton: OK
  13502. 856.59 s [vector] +++ OK, passed 100 tests.
  13503. 856.59 s [vector] replicate: OK
  13504. 856.59 s [vector] +++ OK, passed 100 tests.
  13505. 856.59 s [vector] generate: OK
  13506. 856.59 s [vector] +++ OK, passed 100 tests.
  13507. 856.59 s [vector] iterateN: OK
  13508. 856.59 s [vector] +++ OK, passed 100 tests.
  13509. 856.61 s [vector] iterateNM: OK (0.01s)
  13510. 856.61 s [vector] +++ OK, passed 100 tests.
  13511. 856.63 s [vector] generateM: OK (0.03s)
  13512. 856.63 s [vector] +++ OK, passed 100 tests.
  13513. 856.64 s [vector] replicateM: OK
  13514. 856.64 s [vector] +++ OK, passed 100 tests.
  13515. 856.64 s [vector] create: OK
  13516. 856.64 s [vector] +++ OK, passed 100 tests.
  13517. 856.64 s [vector] createT: OK
  13518. 856.64 s [vector] +++ OK, passed 100 tests.
  13519. 856.64 s [vector] unfoldr: OK
  13520. 856.64 s [vector] +++ OK, passed 100 tests.
  13521. 856.64 s [vector] unfoldrN: OK
  13522. 856.64 s [vector] +++ OK, passed 100 tests.
  13523. 856.64 s [vector] unfoldrExactN: OK
  13524. 856.64 s [vector] +++ OK, passed 100 tests.
  13525. 856.65 s [vector] unfoldrM: OK
  13526. 856.65 s [vector] +++ OK, passed 100 tests.
  13527. 856.65 s [vector] unfoldrNM: OK
  13528. 856.65 s [vector] +++ OK, passed 100 tests.
  13529. 856.67 s [vector] unfoldrExactNM: OK (0.02s)
  13530. 856.67 s [vector] +++ OK, passed 100 tests.
  13531. 856.69 s [vector] constructN: OK (0.01s)
  13532. 856.69 s [vector] +++ OK, passed 100 tests.
  13533. 856.69 s [vector] constructrN: OK
  13534. 856.69 s [vector] +++ OK, passed 100 tests.
  13535. 856.69 s [vector] cons: OK
  13536. 856.69 s [vector] +++ OK, passed 100 tests.
  13537. 856.69 s [vector] snoc: OK
  13538. 856.69 s [vector] +++ OK, passed 100 tests.
  13539. 856.69 s [vector] append: OK
  13540. 856.69 s [vector] +++ OK, passed 100 tests.
  13541. 856.70 s [vector] concat: OK
  13542. 856.70 s [vector] +++ OK, passed 100 tests.
  13543. 856.70 s [vector] force: OK
  13544. 856.70 s [vector] +++ OK, passed 100 tests.
  13545. 856.70 s [vector] upd: OK
  13546. 856.71 s [vector] +++ OK, passed 100 tests.
  13547. 856.71 s [vector] accum: OK
  13548. 856.71 s [vector] +++ OK, passed 100 tests.
  13549. 856.71 s [vector] reverse: OK
  13550. 856.71 s [vector] +++ OK, passed 100 tests.
  13551. 856.71 s [vector] backpermute: OK
  13552. 856.71 s [vector] +++ OK, passed 100 tests.
  13553. 856.71 s [vector] map: OK
  13554. 856.71 s [vector] +++ OK, passed 100 tests.
  13555. 856.71 s [vector] imap: OK
  13556. 856.71 s [vector] +++ OK, passed 100 tests.
  13557. 856.71 s [vector] concatMap: OK
  13558. 856.72 s [vector] +++ OK, passed 100 tests.
  13559. 856.72 s [vector] mapM: OK
  13560. 856.72 s [vector] +++ OK, passed 100 tests.
  13561. 856.73 s [vector] mapM_: OK (0.01s)
  13562. 856.73 s [vector] +++ OK, passed 100 tests.
  13563. 856.74 s [vector] forM: OK
  13564. 856.74 s [vector] +++ OK, passed 100 tests.
  13565. 856.74 s [vector] forM_: OK
  13566. 856.74 s [vector] +++ OK, passed 100 tests.
  13567. 856.74 s [vector] imapM: OK
  13568. 856.74 s [vector] +++ OK, passed 100 tests.
  13569. 856.75 s [vector] imapM_: OK
  13570. 856.75 s [vector] +++ OK, passed 100 tests.
  13571. 856.75 s [vector] zipWith: OK
  13572. 856.75 s [vector] +++ OK, passed 100 tests.
  13573. 856.75 s [vector] zipWith3: OK
  13574. 856.75 s [vector] +++ OK, passed 100 tests.
  13575. 856.75 s [vector] izipWith: OK
  13576. 856.75 s [vector] +++ OK, passed 100 tests.
  13577. 856.75 s [vector] izipWith3: OK
  13578. 856.77 s [vector] +++ OK, passed 100 tests.
  13579. 856.77 s [vector] izipWithM: OK
  13580. 856.77 s [vector] +++ OK, passed 100 tests.
  13581. 856.77 s [vector] izipWithM_: OK (0.01s)
  13582. 856.78 s [vector] +++ OK, passed 100 tests.
  13583. 856.78 s [vector] zipWithM: OK
  13584. 856.78 s [vector] +++ OK, passed 100 tests.
  13585. 856.78 s [vector] zipWithM_: OK
  13586. 856.78 s [vector] +++ OK, passed 100 tests.
  13587. 856.78 s [vector] filter: OK
  13588. 856.78 s [vector] +++ OK, passed 100 tests.
  13589. 856.79 s [vector] ifilter: OK
  13590. 856.79 s [vector] +++ OK, passed 100 tests.
  13591. 856.80 s [vector] filterM: OK (0.02s)
  13592. 856.80 s [vector] +++ OK, passed 100 tests.
  13593. 856.80 s [vector] uniq: OK
  13594. 856.80 s [vector] +++ OK, passed 100 tests.
  13595. 856.81 s [vector] mapMaybe: OK
  13596. 856.81 s [vector] +++ OK, passed 100 tests.
  13597. 856.81 s [vector] imapMaybe: OK
  13598. 856.81 s [vector] +++ OK, passed 100 tests.
  13599. 856.81 s [vector] takeWhile: OK
  13600. 856.81 s [vector] +++ OK, passed 100 tests.
  13601. 856.81 s [vector] dropWhile: OK
  13602. 856.81 s [vector] +++ OK, passed 100 tests.
  13603. 856.81 s [vector] partition: OK
  13604. 856.81 s [vector] +++ OK, passed 100 tests.
  13605. 856.81 s [vector] partitionWith: OK
  13606. 856.81 s [vector] +++ OK, passed 100 tests.
  13607. 856.81 s [vector] span: OK
  13608. 856.81 s [vector] +++ OK, passed 100 tests.
  13609. 856.81 s [vector] break: OK
  13610. 856.81 s [vector] +++ OK, passed 100 tests.
  13611. 856.81 s [vector] spanR: OK
  13612. 856.81 s [vector] +++ OK, passed 100 tests.
  13613. 856.81 s [vector] breakR: OK
  13614. 856.81 s [vector] +++ OK, passed 100 tests.
  13615. 856.81 s [vector] groupBy: OK
  13616. 856.81 s [vector] +++ OK, passed 100 tests.
  13617. 856.81 s [vector] elem: OK
  13618. 856.81 s [vector] +++ OK, passed 100 tests.
  13619. 856.81 s [vector] notElem: OK
  13620. 856.81 s [vector] +++ OK, passed 100 tests.
  13621. 856.81 s [vector] find: OK
  13622. 856.81 s [vector] +++ OK, passed 100 tests.
  13623. 856.81 s [vector] findIndex: OK
  13624. 856.81 s [vector] +++ OK, passed 100 tests.
  13625. 856.82 s [vector] findIndexR: OK
  13626. 856.82 s [vector] +++ OK, passed 100 tests.
  13627. 856.82 s [vector] findIndices: OK
  13628. 856.82 s [vector] +++ OK, passed 100 tests.
  13629. 856.82 s [vector] elemIndex: OK
  13630. 856.82 s [vector] +++ OK, passed 100 tests.
  13631. 856.82 s [vector] elemIndices: OK
  13632. 856.82 s [vector] +++ OK, passed 100 tests.
  13633. 856.82 s [vector] foldl: OK
  13634. 856.82 s [vector] +++ OK, passed 100 tests.
  13635. 856.82 s [vector] foldl1: OK
  13636. 856.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13637. 856.82 s [vector] foldl': OK
  13638. 856.82 s [vector] +++ OK, passed 100 tests.
  13639. 856.82 s [vector] foldl1': OK
  13640. 856.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13641. 856.82 s [vector] foldr: OK
  13642. 856.82 s [vector] +++ OK, passed 100 tests.
  13643. 856.82 s [vector] foldr1: OK
  13644. 856.83 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13645. 856.83 s [vector] foldr': OK
  13646. 856.83 s [vector] +++ OK, passed 100 tests.
  13647. 856.83 s [vector] foldr1': OK
  13648. 856.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13649. 856.83 s [vector] ifoldl: OK
  13650. 856.83 s [vector] +++ OK, passed 100 tests.
  13651. 856.83 s [vector] ifoldl': OK
  13652. 856.83 s [vector] +++ OK, passed 100 tests.
  13653. 856.83 s [vector] ifoldr: OK
  13654. 856.83 s [vector] +++ OK, passed 100 tests.
  13655. 856.84 s [vector] ifoldr': OK
  13656. 856.84 s [vector] +++ OK, passed 100 tests.
  13657. 856.84 s [vector] ifoldM: OK
  13658. 856.85 s [vector] +++ OK, passed 100 tests.
  13659. 856.85 s [vector] ifoldM': OK
  13660. 856.85 s [vector] +++ OK, passed 100 tests.
  13661. 856.85 s [vector] ifoldM_: OK (0.01s)
  13662. 856.85 s [vector] +++ OK, passed 100 tests.
  13663. 856.86 s [vector] ifoldM'_: OK (0.01s)
  13664. 856.86 s [vector] +++ OK, passed 100 tests.
  13665. 856.86 s [vector] all: OK
  13666. 856.86 s [vector] +++ OK, passed 100 tests.
  13667. 856.86 s [vector] any: OK
  13668. 856.86 s [vector] +++ OK, passed 100 tests.
  13669. 856.86 s [vector] prescanl: OK
  13670. 856.86 s [vector] +++ OK, passed 100 tests.
  13671. 856.86 s [vector] prescanl': OK
  13672. 856.87 s [vector] +++ OK, passed 100 tests.
  13673. 856.87 s [vector] postscanl: OK
  13674. 856.87 s [vector] +++ OK, passed 100 tests.
  13675. 856.87 s [vector] postscanl': OK
  13676. 856.87 s [vector] +++ OK, passed 100 tests.
  13677. 856.87 s [vector] scanl: OK
  13678. 856.87 s [vector] +++ OK, passed 100 tests.
  13679. 856.87 s [vector] scanl': OK
  13680. 856.87 s [vector] +++ OK, passed 100 tests.
  13681. 856.87 s [vector] scanl1: OK
  13682. 856.87 s [vector] +++ OK, passed 100 tests.
  13683. 856.87 s [vector] scanl1': OK
  13684. 856.87 s [vector] +++ OK, passed 100 tests.
  13685. 856.88 s [vector] iscanl: OK
  13686. 856.88 s [vector] +++ OK, passed 100 tests.
  13687. 856.88 s [vector] iscanl': OK
  13688. 856.88 s [vector] +++ OK, passed 100 tests.
  13689. 856.88 s [vector] prescanr: OK
  13690. 856.88 s [vector] +++ OK, passed 100 tests.
  13691. 856.88 s [vector] prescanr': OK
  13692. 856.88 s [vector] +++ OK, passed 100 tests.
  13693. 856.88 s [vector] postscanr: OK
  13694. 856.88 s [vector] +++ OK, passed 100 tests.
  13695. 856.88 s [vector] postscanr': OK
  13696. 856.88 s [vector] +++ OK, passed 100 tests.
  13697. 856.88 s [vector] scanr: OK
  13698. 856.89 s [vector] +++ OK, passed 100 tests.
  13699. 856.89 s [vector] scanr': OK
  13700. 856.89 s [vector] +++ OK, passed 100 tests.
  13701. 856.89 s [vector] scanr1: OK
  13702. 856.89 s [vector] +++ OK, passed 100 tests.
  13703. 856.89 s [vector] scanr1': OK
  13704. 856.89 s [vector] +++ OK, passed 100 tests.
  13705. 856.89 s [vector] iscanr: OK
  13706. 856.89 s [vector] +++ OK, passed 100 tests.
  13707. 856.89 s [vector] iscanr': OK
  13708. 856.89 s [vector] +++ OK, passed 100 tests.
  13709. 856.89 s [vector] mut_read: OK
  13710. 856.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13711. 856.89 s [vector] mut_write: OK
  13712. 856.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13713. 856.89 s [vector] mut_modify: OK
  13714. 856.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13715. 856.91 s [vector] mut_generate: OK
  13716. 856.91 s [vector] +++ OK, passed 100 tests.
  13717. 856.91 s [vector] mut_generateM: OK
  13718. 856.91 s [vector] +++ OK, passed 100 tests.
  13719. 856.92 s [vector] mut_mapM_: OK (0.01s)
  13720. 856.92 s [vector] +++ OK, passed 100 tests.
  13721. 856.93 s [vector] mut_imapM_: OK
  13722. 856.93 s [vector] +++ OK, passed 100 tests.
  13723. 856.94 s [vector] mut_forM_: OK
  13724. 856.94 s [vector] +++ OK, passed 100 tests.
  13725. 856.94 s [vector] mut_iforM_: OK (0.01s)
  13726. 856.94 s [vector] +++ OK, passed 100 tests.
  13727. 856.94 s [vector] mut_foldr: OK
  13728. 856.94 s [vector] +++ OK, passed 100 tests.
  13729. 856.94 s [vector] mut_foldr': OK
  13730. 856.94 s [vector] +++ OK, passed 100 tests.
  13731. 856.95 s [vector] mut_foldl: OK
  13732. 856.95 s [vector] +++ OK, passed 100 tests.
  13733. 856.95 s [vector] mut_foldl': OK
  13734. 856.95 s [vector] +++ OK, passed 100 tests.
  13735. 856.95 s [vector] mut_ifoldr: OK
  13736. 856.95 s [vector] +++ OK, passed 100 tests.
  13737. 856.95 s [vector] mut_ifoldr': OK
  13738. 856.95 s [vector] +++ OK, passed 100 tests.
  13739. 856.95 s [vector] mut_ifoldl: OK
  13740. 856.95 s [vector] +++ OK, passed 100 tests.
  13741. 856.95 s [vector] mut_ifoldl': OK
  13742. 856.95 s [vector] +++ OK, passed 100 tests.
  13743. 856.96 s [vector] mut_foldM: OK
  13744. 856.96 s [vector] +++ OK, passed 100 tests.
  13745. 856.96 s [vector] mut_foldM': OK
  13746. 856.96 s [vector] +++ OK, passed 100 tests.
  13747. 856.96 s [vector] mut_foldrM: OK
  13748. 856.96 s [vector] +++ OK, passed 100 tests.
  13749. 856.96 s [vector] mut_foldrM': OK
  13750. 856.96 s [vector] +++ OK, passed 100 tests.
  13751. 856.96 s [vector] mut_ifoldM: OK
  13752. 856.96 s [vector] +++ OK, passed 100 tests.
  13753. 856.97 s [vector] mut_ifoldM': OK
  13754. 856.97 s [vector] +++ OK, passed 100 tests.
  13755. 856.97 s [vector] mut_ifoldrM: OK
  13756. 856.97 s [vector] +++ OK, passed 100 tests.
  13757. 856.97 s [vector] mut_ifoldrM': OK
  13758. 856.97 s [vector] +++ OK, passed 100 tests.
  13759. 856.97 s [vector] compare: OK
  13760. 856.97 s [vector] +++ OK, passed 100 tests.
  13761. 856.97 s [vector] maximum: OK
  13762. 856.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13763. 856.97 s [vector] minimum: OK
  13764. 856.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13765. 856.97 s [vector] minIndex: OK
  13766. 856.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13767. 856.97 s [vector] maxIndex: OK
  13768. 856.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13769. 856.97 s [vector] maximumBy: OK
  13770. 856.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13771. 856.97 s [vector] minimumBy: OK
  13772. 856.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13773. 856.97 s [vector] maximumOn: OK
  13774. 856.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13775. 856.97 s [vector] minimumOn: OK
  13776. 856.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13777. 856.97 s [vector] maxIndexBy: OK
  13778. 856.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13779. 856.97 s [vector] minIndexBy: OK
  13780. 856.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13781. 856.97 s [vector] ListFirstMaxIndexWins: OK
  13782. 856.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13783. 856.97 s [vector] FalseListFirstMaxIndexWins: OK
  13784. 856.97 s [vector] +++ OK, failed as expected. (after 1 test):
  13785. 856.97 s [vector] Exception:
  13786. 856.97 s [vector] Prelude.foldr1: empty list
  13787. 856.97 s [vector] CallStack (from HasCallStack):
  13788. 856.97 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  13789. 856.97 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  13790. 856.97 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13791. 856.97 s [vector] []
  13792. 856.97 s [vector] zip: OK
  13793. 856.97 s [vector] +++ OK, passed 100 tests.
  13794. 856.97 s [vector] zip3: OK
  13795. 856.97 s [vector] +++ OK, passed 100 tests.
  13796. 856.97 s [vector] unzip: OK
  13797. 856.97 s [vector] +++ OK, passed 100 tests.
  13798. 856.97 s [vector] unzip3: OK
  13799. 856.97 s [vector] +++ OK, passed 100 tests.
  13800. 856.97 s [vector] indexed: OK
  13801. 856.97 s [vector] +++ OK, passed 100 tests.
  13802. 856.97 s [vector] update: OK
  13803. 856.97 s [vector] +++ OK, passed 100 tests.
  13804. 856.98 s [vector] concat: OK
  13805. 856.98 s [vector] +++ OK, passed 100 tests.
  13806. 856.99 s [vector] mempty: OK
  13807. 856.99 s [vector] +++ OK, passed 1 test.
  13808. 856.99 s [vector] mappend: OK
  13809. 856.99 s [vector] +++ OK, passed 100 tests.
  13810. 856.99 s [vector] mconcat: OK
  13811. 856.99 s [vector] +++ OK, passed 100 tests.
  13812. 857.00 s [vector] fmap: OK
  13813. 857.01 s [vector] +++ OK, passed 100 tests.
  13814. 857.01 s [vector] return: OK
  13815. 857.01 s [vector] +++ OK, passed 100 tests.
  13816. 857.01 s [vector] bind: OK
  13817. 857.01 s [vector] +++ OK, passed 100 tests.
  13818. 857.01 s [vector] mzip: OK
  13819. 857.01 s [vector] +++ OK, passed 100 tests.
  13820. 857.01 s [vector] munzip: OK
  13821. 857.01 s [vector] +++ OK, passed 100 tests.
  13822. 857.02 s [vector] applicative_pure: OK
  13823. 857.02 s [vector] +++ OK, passed 100 tests.
  13824. 857.02 s [vector] applicative_appl: OK (0.01s)
  13825. 857.02 s [vector] +++ OK, passed 100 tests.
  13826. 857.02 s [vector] alternative_empty: OK
  13827. 857.03 s [vector] +++ OK, passed 1 test.
  13828. 857.04 s [vector] alternative_or: OK
  13829. 857.04 s [vector] +++ OK, passed 100 tests.
  13830. 857.04 s [vector] sequence: OK (0.02s)
  13831. 857.04 s [vector] +++ OK, passed 100 tests.
  13832. 857.05 s [vector] sequence_: OK
  13833. 857.05 s [vector] +++ OK, passed 100 tests.
  13834. 857.05 s [vector] glength: OK
  13835. 857.05 s [vector] +++ OK, passed 100 tests.
  13836. 857.05 s [vector] and: OK
  13837. 857.05 s [vector] +++ OK, passed 100 tests.
  13838. 857.05 s [vector] or: OK
  13839. 857.05 s [vector] +++ OK, passed 100 tests.
  13840. 857.05 s [vector] Int
  13841. 857.05 s [vector] fromList.toList == id: OK
  13842. 857.05 s [vector] +++ OK, passed 100 tests.
  13843. 857.05 s [vector] toList.fromList == id: OK
  13844. 857.05 s [vector] +++ OK, passed 100 tests.
  13845. 857.05 s [vector] unstream.stream == id: OK
  13846. 857.05 s [vector] +++ OK, passed 100 tests.
  13847. 857.05 s [vector] stream.unstream == id: OK
  13848. 857.05 s [vector] +++ OK, passed 100 tests.
  13849. 857.05 s [vector] eq: OK
  13850. 857.05 s [vector] +++ OK, passed 100 tests.
  13851. 857.05 s [vector] length: OK
  13852. 857.05 s [vector] +++ OK, passed 100 tests.
  13853. 857.05 s [vector] null: OK
  13854. 857.05 s [vector] +++ OK, passed 100 tests.
  13855. 857.05 s [vector] index: OK
  13856. 857.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13857. 857.05 s [vector] safeIndex: OK
  13858. 857.06 s [vector] +++ OK, passed 100 tests.
  13859. 857.06 s [vector] head: OK
  13860. 857.06 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13861. 857.06 s [vector] last: OK
  13862. 857.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13863. 857.06 s [vector] unsafeIndex: OK
  13864. 857.06 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13865. 857.06 s [vector] unsafeHead: OK
  13866. 857.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13867. 857.06 s [vector] unsafeLast: OK
  13868. 857.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13869. 857.06 s [vector] slice: OK
  13870. 857.06 s [vector] +++ OK, passed 100 tests.
  13871. 857.06 s [vector] init: OK
  13872. 857.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13873. 857.06 s [vector] tail: OK
  13874. 857.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13875. 857.06 s [vector] take: OK
  13876. 857.06 s [vector] +++ OK, passed 100 tests.
  13877. 857.06 s [vector] drop: OK
  13878. 857.06 s [vector] +++ OK, passed 100 tests.
  13879. 857.06 s [vector] splitAt: OK
  13880. 857.06 s [vector] +++ OK, passed 100 tests.
  13881. 857.06 s [vector] empty: OK
  13882. 857.06 s [vector] +++ OK, passed 1 test.
  13883. 857.06 s [vector] singleton: OK
  13884. 857.06 s [vector] +++ OK, passed 100 tests.
  13885. 857.06 s [vector] replicate: OK
  13886. 857.06 s [vector] +++ OK, passed 100 tests.
  13887. 857.06 s [vector] generate: OK
  13888. 857.06 s [vector] +++ OK, passed 100 tests.
  13889. 857.06 s [vector] iterateN: OK
  13890. 857.08 s [vector] +++ OK, passed 100 tests.
  13891. 857.08 s [vector] iterateNM: OK (0.01s)
  13892. 857.08 s [vector] +++ OK, passed 100 tests.
  13893. 857.10 s [vector] generateM: OK
  13894. 857.10 s [vector] +++ OK, passed 100 tests.
  13895. 857.10 s [vector] replicateM: OK
  13896. 857.10 s [vector] +++ OK, passed 100 tests.
  13897. 857.10 s [vector] create: OK
  13898. 857.10 s [vector] +++ OK, passed 100 tests.
  13899. 857.10 s [vector] createT: OK
  13900. 857.10 s [vector] +++ OK, passed 100 tests.
  13901. 857.10 s [vector] unfoldr: OK
  13902. 857.10 s [vector] +++ OK, passed 100 tests.
  13903. 857.10 s [vector] unfoldrN: OK
  13904. 857.10 s [vector] +++ OK, passed 100 tests.
  13905. 857.10 s [vector] unfoldrExactN: OK
  13906. 857.11 s [vector] +++ OK, passed 100 tests.
  13907. 857.11 s [vector] unfoldrM: OK
  13908. 857.11 s [vector] +++ OK, passed 100 tests.
  13909. 857.12 s [vector] unfoldrNM: OK
  13910. 857.12 s [vector] +++ OK, passed 100 tests.
  13911. 857.12 s [vector] unfoldrExactNM: OK
  13912. 857.12 s [vector] +++ OK, passed 100 tests.
  13913. 857.13 s [vector] constructN: OK
  13914. 857.13 s [vector] +++ OK, passed 100 tests.
  13915. 857.13 s [vector] constructrN: OK
  13916. 857.13 s [vector] +++ OK, passed 100 tests.
  13917. 857.14 s [vector] cons: OK
  13918. 857.14 s [vector] +++ OK, passed 100 tests.
  13919. 857.14 s [vector] snoc: OK
  13920. 857.14 s [vector] +++ OK, passed 100 tests.
  13921. 857.14 s [vector] append: OK
  13922. 857.14 s [vector] +++ OK, passed 100 tests.
  13923. 857.14 s [vector] concat: OK
  13924. 857.14 s [vector] +++ OK, passed 100 tests.
  13925. 857.14 s [vector] force: OK
  13926. 857.14 s [vector] +++ OK, passed 100 tests.
  13927. 857.14 s [vector] upd: OK
  13928. 857.14 s [vector] +++ OK, passed 100 tests.
  13929. 857.14 s [vector] accum: OK
  13930. 857.14 s [vector] +++ OK, passed 100 tests.
  13931. 857.14 s [vector] reverse: OK
  13932. 857.14 s [vector] +++ OK, passed 100 tests.
  13933. 857.14 s [vector] backpermute: OK
  13934. 857.14 s [vector] +++ OK, passed 100 tests.
  13935. 857.14 s [vector] map: OK
  13936. 857.15 s [vector] +++ OK, passed 100 tests.
  13937. 857.15 s [vector] imap: OK
  13938. 857.15 s [vector] +++ OK, passed 100 tests.
  13939. 857.15 s [vector] concatMap: OK
  13940. 857.15 s [vector] +++ OK, passed 100 tests.
  13941. 857.15 s [vector] mapM: OK
  13942. 857.15 s [vector] +++ OK, passed 100 tests.
  13943. 857.17 s [vector] mapM_: OK (0.01s)
  13944. 857.17 s [vector] +++ OK, passed 100 tests.
  13945. 857.17 s [vector] forM: OK
  13946. 857.17 s [vector] +++ OK, passed 100 tests.
  13947. 857.18 s [vector] forM_: OK (0.01s)
  13948. 857.18 s [vector] +++ OK, passed 100 tests.
  13949. 857.18 s [vector] imapM: OK
  13950. 857.18 s [vector] +++ OK, passed 100 tests.
  13951. 857.20 s [vector] imapM_: OK (0.01s)
  13952. 857.20 s [vector] +++ OK, passed 100 tests.
  13953. 857.20 s [vector] zipWith: OK
  13954. 857.20 s [vector] +++ OK, passed 100 tests.
  13955. 857.20 s [vector] zipWith3: OK
  13956. 857.20 s [vector] +++ OK, passed 100 tests.
  13957. 857.20 s [vector] izipWith: OK
  13958. 857.20 s [vector] +++ OK, passed 100 tests.
  13959. 857.21 s [vector] izipWith3: OK
  13960. 857.21 s [vector] +++ OK, passed 100 tests.
  13961. 857.22 s [vector] izipWithM: OK
  13962. 857.22 s [vector] +++ OK, passed 100 tests.
  13963. 857.23 s [vector] izipWithM_: OK (0.02s)
  13964. 857.23 s [vector] +++ OK, passed 100 tests.
  13965. 857.23 s [vector] zipWithM: OK
  13966. 857.23 s [vector] +++ OK, passed 100 tests.
  13967. 857.25 s [vector] zipWithM_: OK (0.01s)
  13968. 857.25 s [vector] +++ OK, passed 100 tests.
  13969. 857.25 s [vector] filter: OK
  13970. 857.25 s [vector] +++ OK, passed 100 tests.
  13971. 857.26 s [vector] ifilter: OK
  13972. 857.26 s [vector] +++ OK, passed 100 tests.
  13973. 857.28 s [vector] filterM: OK (0.03s)
  13974. 857.28 s [vector] +++ OK, passed 100 tests.
  13975. 857.28 s [vector] uniq: OK
  13976. 857.28 s [vector] +++ OK, passed 100 tests.
  13977. 857.28 s [vector] mapMaybe: OK
  13978. 857.28 s [vector] +++ OK, passed 100 tests.
  13979. 857.28 s [vector] imapMaybe: OK
  13980. 857.28 s [vector] +++ OK, passed 100 tests.
  13981. 857.28 s [vector] takeWhile: OK
  13982. 857.28 s [vector] +++ OK, passed 100 tests.
  13983. 857.28 s [vector] dropWhile: OK
  13984. 857.28 s [vector] +++ OK, passed 100 tests.
  13985. 857.28 s [vector] partition: OK
  13986. 857.28 s [vector] +++ OK, passed 100 tests.
  13987. 857.28 s [vector] partitionWith: OK
  13988. 857.28 s [vector] +++ OK, passed 100 tests.
  13989. 857.28 s [vector] span: OK
  13990. 857.28 s [vector] +++ OK, passed 100 tests.
  13991. 857.28 s [vector] break: OK
  13992. 857.29 s [vector] +++ OK, passed 100 tests.
  13993. 857.29 s [vector] spanR: OK
  13994. 857.29 s [vector] +++ OK, passed 100 tests.
  13995. 857.29 s [vector] breakR: OK
  13996. 857.29 s [vector] +++ OK, passed 100 tests.
  13997. 857.29 s [vector] groupBy: OK
  13998. 857.29 s [vector] +++ OK, passed 100 tests.
  13999. 857.29 s [vector] elem: OK
  14000. 857.29 s [vector] +++ OK, passed 100 tests.
  14001. 857.29 s [vector] notElem: OK
  14002. 857.29 s [vector] +++ OK, passed 100 tests.
  14003. 857.29 s [vector] find: OK
  14004. 857.29 s [vector] +++ OK, passed 100 tests.
  14005. 857.29 s [vector] findIndex: OK
  14006. 857.29 s [vector] +++ OK, passed 100 tests.
  14007. 857.29 s [vector] findIndexR: OK
  14008. 857.29 s [vector] +++ OK, passed 100 tests.
  14009. 857.29 s [vector] findIndices: OK
  14010. 857.29 s [vector] +++ OK, passed 100 tests.
  14011. 857.29 s [vector] elemIndex: OK
  14012. 857.29 s [vector] +++ OK, passed 100 tests.
  14013. 857.30 s [vector] elemIndices: OK
  14014. 857.30 s [vector] +++ OK, passed 100 tests.
  14015. 857.30 s [vector] foldl: OK
  14016. 857.30 s [vector] +++ OK, passed 100 tests.
  14017. 857.30 s [vector] foldl1: OK
  14018. 857.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14019. 857.30 s [vector] foldl': OK
  14020. 857.30 s [vector] +++ OK, passed 100 tests.
  14021. 857.30 s [vector] foldl1': OK
  14022. 857.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14023. 857.31 s [vector] foldr: OK
  14024. 857.31 s [vector] +++ OK, passed 100 tests.
  14025. 857.31 s [vector] foldr1: OK
  14026. 857.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14027. 857.31 s [vector] foldr': OK
  14028. 857.31 s [vector] +++ OK, passed 100 tests.
  14029. 857.32 s [vector] foldr1': OK
  14030. 857.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14031. 857.32 s [vector] ifoldl: OK
  14032. 857.32 s [vector] +++ OK, passed 100 tests.
  14033. 857.32 s [vector] ifoldl': OK
  14034. 857.32 s [vector] +++ OK, passed 100 tests.
  14035. 857.32 s [vector] ifoldr: OK
  14036. 857.33 s [vector] +++ OK, passed 100 tests.
  14037. 857.33 s [vector] ifoldr': OK
  14038. 857.33 s [vector] +++ OK, passed 100 tests.
  14039. 857.33 s [vector] ifoldM: OK
  14040. 857.33 s [vector] +++ OK, passed 100 tests.
  14041. 857.33 s [vector] ifoldM': OK
  14042. 857.34 s [vector] +++ OK, passed 100 tests.
  14043. 857.36 s [vector] ifoldM_: OK (0.02s)
  14044. 857.36 s [vector] +++ OK, passed 100 tests.
  14045. 857.36 s [vector] ifoldM'_: OK (0.01s)
  14046. 857.36 s [vector] +++ OK, passed 100 tests.
  14047. 857.36 s [vector] all: OK
  14048. 857.36 s [vector] +++ OK, passed 100 tests.
  14049. 857.36 s [vector] any: OK
  14050. 857.37 s [vector] +++ OK, passed 100 tests.
  14051. 857.37 s [vector] prescanl: OK
  14052. 857.37 s [vector] +++ OK, passed 100 tests.
  14053. 857.37 s [vector] prescanl': OK
  14054. 857.37 s [vector] +++ OK, passed 100 tests.
  14055. 857.37 s [vector] postscanl: OK
  14056. 857.37 s [vector] +++ OK, passed 100 tests.
  14057. 857.37 s [vector] postscanl': OK
  14058. 857.38 s [vector] +++ OK, passed 100 tests.
  14059. 857.38 s [vector] scanl: OK
  14060. 857.38 s [vector] +++ OK, passed 100 tests.
  14061. 857.38 s [vector] scanl': OK
  14062. 857.38 s [vector] +++ OK, passed 100 tests.
  14063. 857.39 s [vector] scanl1: OK
  14064. 857.39 s [vector] +++ OK, passed 100 tests.
  14065. 857.39 s [vector] scanl1': OK
  14066. 857.39 s [vector] +++ OK, passed 100 tests.
  14067. 857.39 s [vector] iscanl: OK
  14068. 857.39 s [vector] +++ OK, passed 100 tests.
  14069. 857.39 s [vector] iscanl': OK
  14070. 857.39 s [vector] +++ OK, passed 100 tests.
  14071. 857.40 s [vector] prescanr: OK
  14072. 857.40 s [vector] +++ OK, passed 100 tests.
  14073. 857.40 s [vector] prescanr': OK
  14074. 857.40 s [vector] +++ OK, passed 100 tests.
  14075. 857.40 s [vector] postscanr: OK
  14076. 857.40 s [vector] +++ OK, passed 100 tests.
  14077. 857.41 s [vector] postscanr': OK
  14078. 857.41 s [vector] +++ OK, passed 100 tests.
  14079. 857.41 s [vector] scanr: OK
  14080. 857.41 s [vector] +++ OK, passed 100 tests.
  14081. 857.41 s [vector] scanr': OK
  14082. 857.41 s [vector] +++ OK, passed 100 tests.
  14083. 857.41 s [vector] scanr1: OK
  14084. 857.41 s [vector] +++ OK, passed 100 tests.
  14085. 857.41 s [vector] scanr1': OK
  14086. 857.42 s [vector] +++ OK, passed 100 tests.
  14087. 857.42 s [vector] iscanr: OK
  14088. 857.42 s [vector] +++ OK, passed 100 tests.
  14089. 857.42 s [vector] iscanr': OK
  14090. 857.42 s [vector] +++ OK, passed 100 tests.
  14091. 857.43 s [vector] mut_read: OK
  14092. 857.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14093. 857.43 s [vector] mut_write: OK
  14094. 857.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14095. 857.43 s [vector] mut_modify: OK
  14096. 857.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14097. 857.44 s [vector] mut_generate: OK
  14098. 857.44 s [vector] +++ OK, passed 100 tests.
  14099. 857.46 s [vector] mut_generateM: OK (0.01s)
  14100. 857.46 s [vector] +++ OK, passed 100 tests.
  14101. 857.46 s [vector] mut_mapM_: OK (0.02s)
  14102. 857.46 s [vector] +++ OK, passed 100 tests.
  14103. 857.48 s [vector] mut_imapM_: OK (0.02s)
  14104. 857.48 s [vector] +++ OK, passed 100 tests.
  14105. 857.50 s [vector] mut_forM_: OK (0.02s)
  14106. 857.50 s [vector] +++ OK, passed 100 tests.
  14107. 857.52 s [vector] mut_iforM_: OK (0.02s)
  14108. 857.52 s [vector] +++ OK, passed 100 tests.
  14109. 857.52 s [vector] mut_foldr: OK
  14110. 857.52 s [vector] +++ OK, passed 100 tests.
  14111. 857.52 s [vector] mut_foldr': OK
  14112. 857.52 s [vector] +++ OK, passed 100 tests.
  14113. 857.52 s [vector] mut_foldl: OK
  14114. 857.52 s [vector] +++ OK, passed 100 tests.
  14115. 857.53 s [vector] mut_foldl': OK
  14116. 857.53 s [vector] +++ OK, passed 100 tests.
  14117. 857.53 s [vector] mut_ifoldr: OK
  14118. 857.53 s [vector] +++ OK, passed 100 tests.
  14119. 857.54 s [vector] mut_ifoldr': OK
  14120. 857.54 s [vector] +++ OK, passed 100 tests.
  14121. 857.54 s [vector] mut_ifoldl: OK
  14122. 857.54 s [vector] +++ OK, passed 100 tests.
  14123. 857.54 s [vector] mut_ifoldl': OK
  14124. 857.54 s [vector] +++ OK, passed 100 tests.
  14125. 857.54 s [vector] mut_foldM: OK
  14126. 857.55 s [vector] +++ OK, passed 100 tests.
  14127. 857.55 s [vector] mut_foldM': OK
  14128. 857.55 s [vector] +++ OK, passed 100 tests.
  14129. 857.55 s [vector] mut_foldrM: OK
  14130. 857.55 s [vector] +++ OK, passed 100 tests.
  14131. 857.56 s [vector] mut_foldrM': OK
  14132. 857.56 s [vector] +++ OK, passed 100 tests.
  14133. 857.56 s [vector] mut_ifoldM: OK
  14134. 857.56 s [vector] +++ OK, passed 100 tests.
  14135. 857.56 s [vector] mut_ifoldM': OK
  14136. 857.57 s [vector] +++ OK, passed 100 tests.
  14137. 857.57 s [vector] mut_ifoldrM: OK
  14138. 857.57 s [vector] +++ OK, passed 100 tests.
  14139. 857.57 s [vector] mut_ifoldrM': OK
  14140. 857.57 s [vector] +++ OK, passed 100 tests.
  14141. 857.57 s [vector] compare: OK
  14142. 857.57 s [vector] +++ OK, passed 100 tests.
  14143. 857.57 s [vector] maximum: OK
  14144. 857.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14145. 857.57 s [vector] minimum: OK
  14146. 857.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14147. 857.57 s [vector] minIndex: OK
  14148. 857.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14149. 857.58 s [vector] maxIndex: OK
  14150. 857.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14151. 857.58 s [vector] maximumBy: OK
  14152. 857.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14153. 857.58 s [vector] minimumBy: OK
  14154. 857.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14155. 857.58 s [vector] maximumOn: OK
  14156. 857.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14157. 857.58 s [vector] minimumOn: OK
  14158. 857.58 s [vector] +++ OK, passed 100 tests; 27 discarded.
  14159. 857.58 s [vector] maxIndexBy: OK
  14160. 857.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14161. 857.58 s [vector] minIndexBy: OK
  14162. 857.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14163. 857.58 s [vector] ListFirstMaxIndexWins: OK
  14164. 857.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14165. 857.58 s [vector] FalseListFirstMaxIndexWins: OK
  14166. 857.58 s [vector] +++ OK, failed as expected. (after 1 test):
  14167. 857.58 s [vector] Exception:
  14168. 857.58 s [vector] Prelude.foldr1: empty list
  14169. 857.58 s [vector] CallStack (from HasCallStack):
  14170. 857.59 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14171. 857.59 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14172. 857.59 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14173. 857.59 s [vector] []
  14174. 857.59 s [vector] zip: OK
  14175. 857.59 s [vector] +++ OK, passed 100 tests.
  14176. 857.59 s [vector] zip3: OK
  14177. 857.59 s [vector] +++ OK, passed 100 tests.
  14178. 857.59 s [vector] unzip: OK
  14179. 857.59 s [vector] +++ OK, passed 100 tests.
  14180. 857.59 s [vector] unzip3: OK
  14181. 857.59 s [vector] +++ OK, passed 100 tests.
  14182. 857.59 s [vector] indexed: OK
  14183. 857.59 s [vector] +++ OK, passed 100 tests.
  14184. 857.59 s [vector] update: OK
  14185. 857.60 s [vector] +++ OK, passed 100 tests.
  14186. 857.60 s [vector] concat: OK (0.01s)
  14187. 857.60 s [vector] +++ OK, passed 100 tests.
  14188. 857.60 s [vector] mempty: OK
  14189. 857.60 s [vector] +++ OK, passed 1 test.
  14190. 857.60 s [vector] mappend: OK
  14191. 857.61 s [vector] +++ OK, passed 100 tests.
  14192. 857.61 s [vector] mconcat: OK (0.01s)
  14193. 857.61 s [vector] +++ OK, passed 100 tests.
  14194. 857.61 s [vector] fmap: OK
  14195. 857.61 s [vector] +++ OK, passed 100 tests.
  14196. 857.62 s [vector] return: OK
  14197. 857.62 s [vector] +++ OK, passed 100 tests.
  14198. 857.63 s [vector] bind: OK (0.02s)
  14199. 857.63 s [vector] +++ OK, passed 100 tests.
  14200. 857.63 s [vector] mzip: OK
  14201. 857.63 s [vector] +++ OK, passed 100 tests.
  14202. 857.63 s [vector] munzip: OK
  14203. 857.63 s [vector] +++ OK, passed 100 tests.
  14204. 857.63 s [vector] applicative_pure: OK
  14205. 857.63 s [vector] +++ OK, passed 100 tests.
  14206. 857.67 s [vector] applicative_appl: OK (0.03s)
  14207. 857.67 s [vector] +++ OK, passed 100 tests.
  14208. 857.67 s [vector] alternative_empty: OK
  14209. 857.67 s [vector] +++ OK, passed 1 test.
  14210. 857.68 s [vector] alternative_or: OK
  14211. 857.68 s [vector] +++ OK, passed 100 tests.
  14212. 857.72 s [vector] sequence: OK (0.04s)
  14213. 857.72 s [vector] +++ OK, passed 100 tests.
  14214. 857.72 s [vector] sequence_: OK (0.01s)
  14215. 857.72 s [vector] +++ OK, passed 100 tests.
  14216. 857.72 s [vector] glength: OK
  14217. 857.72 s [vector] +++ OK, passed 100 tests.
  14218. 857.72 s [vector] sum: OK
  14219. 857.72 s [vector] +++ OK, passed 100 tests.
  14220. 857.72 s [vector] product: OK
  14221. 857.72 s [vector] +++ OK, passed 100 tests.
  14222. 857.72 s [vector] enumFromN: OK
  14223. 857.72 s [vector] +++ OK, passed 100 tests.
  14224. 857.72 s [vector] enumFromThenN: OK
  14225. 857.72 s [vector] +++ OK, passed 100 tests.
  14226. 857.72 s [vector] enumFromTo: OK
  14227. 857.72 s [vector] +++ OK, passed 100 tests.
  14228. 857.72 s [vector] enumFromThenTo: OK
  14229. 857.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14230. 857.72 s [vector] unstream
  14231. 857.72 s [vector] unstream == vunstream (exact): OK
  14232. 857.72 s [vector] +++ OK, passed 100 tests.
  14233. 857.72 s [vector] unstream == vunstream (unknown): OK
  14234. 857.72 s [vector] +++ OK, passed 100 tests.
  14235. 857.72 s [vector] unstreamR ~= vunstream (exact): OK
  14236. 857.72 s [vector] +++ OK, passed 100 tests.
  14237. 857.72 s [vector] unstreamR ~= vunstream (unknown): OK
  14238. 857.72 s [vector] +++ OK, passed 100 tests.
  14239. 857.72 s [vector] Tests.Vector.Unboxed
  14240. 857.72 s [vector] ()
  14241. 857.72 s [vector] fromList.toList == id: OK
  14242. 857.72 s [vector] +++ OK, passed 100 tests.
  14243. 857.72 s [vector] toList.fromList == id: OK
  14244. 857.72 s [vector] +++ OK, passed 100 tests.
  14245. 857.72 s [vector] unstream.stream == id: OK
  14246. 857.72 s [vector] +++ OK, passed 100 tests.
  14247. 857.72 s [vector] stream.unstream == id: OK
  14248. 857.72 s [vector] +++ OK, passed 100 tests.
  14249. 857.72 s [vector] eq: OK
  14250. 857.72 s [vector] +++ OK, passed 100 tests.
  14251. 857.72 s [vector] length: OK
  14252. 857.72 s [vector] +++ OK, passed 100 tests.
  14253. 857.72 s [vector] null: OK
  14254. 857.72 s [vector] +++ OK, passed 100 tests.
  14255. 857.72 s [vector] index: OK
  14256. 857.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14257. 857.72 s [vector] safeIndex: OK
  14258. 857.72 s [vector] +++ OK, passed 100 tests.
  14259. 857.72 s [vector] head: OK
  14260. 857.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14261. 857.72 s [vector] last: OK
  14262. 857.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14263. 857.72 s [vector] unsafeIndex: OK
  14264. 857.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14265. 857.72 s [vector] unsafeHead: OK
  14266. 857.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14267. 857.72 s [vector] unsafeLast: OK
  14268. 857.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14269. 857.72 s [vector] slice: OK
  14270. 857.72 s [vector] +++ OK, passed 100 tests.
  14271. 857.73 s [vector] init: OK
  14272. 857.73 s [vector] +++ OK, passed 100 tests; 26 discarded.
  14273. 857.73 s [vector] tail: OK
  14274. 857.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14275. 857.73 s [vector] take: OK
  14276. 857.73 s [vector] +++ OK, passed 100 tests.
  14277. 857.73 s [vector] drop: OK
  14278. 857.73 s [vector] +++ OK, passed 100 tests.
  14279. 857.73 s [vector] splitAt: OK
  14280. 857.73 s [vector] +++ OK, passed 100 tests.
  14281. 857.73 s [vector] empty: OK
  14282. 857.73 s [vector] +++ OK, passed 1 test.
  14283. 857.73 s [vector] singleton: OK
  14284. 857.73 s [vector] +++ OK, passed 100 tests.
  14285. 857.73 s [vector] replicate: OK
  14286. 857.73 s [vector] +++ OK, passed 100 tests.
  14287. 857.73 s [vector] generate: OK
  14288. 857.73 s [vector] +++ OK, passed 100 tests.
  14289. 857.74 s [vector] iterateN: OK
  14290. 857.74 s [vector] +++ OK, passed 100 tests.
  14291. 857.75 s [vector] iterateNM: OK (0.02s)
  14292. 857.75 s [vector] +++ OK, passed 100 tests.
  14293. 857.75 s [vector] generateM: OK
  14294. 857.76 s [vector] +++ OK, passed 100 tests.
  14295. 857.77 s [vector] replicateM: OK (0.02s)
  14296. 857.77 s [vector] +++ OK, passed 100 tests.
  14297. 857.77 s [vector] create: OK
  14298. 857.77 s [vector] +++ OK, passed 100 tests.
  14299. 857.77 s [vector] createT: OK
  14300. 857.77 s [vector] +++ OK, passed 100 tests.
  14301. 857.77 s [vector] unfoldr: OK
  14302. 857.77 s [vector] +++ OK, passed 100 tests.
  14303. 857.77 s [vector] unfoldrN: OK
  14304. 857.77 s [vector] +++ OK, passed 100 tests.
  14305. 857.77 s [vector] unfoldrExactN: OK
  14306. 857.77 s [vector] +++ OK, passed 100 tests.
  14307. 857.77 s [vector] unfoldrM: OK
  14308. 857.77 s [vector] +++ OK, passed 100 tests.
  14309. 857.77 s [vector] unfoldrNM: OK
  14310. 857.77 s [vector] +++ OK, passed 100 tests.
  14311. 857.79 s [vector] unfoldrExactNM: OK (0.01s)
  14312. 857.79 s [vector] +++ OK, passed 100 tests.
  14313. 857.79 s [vector] constructN: OK
  14314. 857.79 s [vector] +++ OK, passed 100 tests.
  14315. 857.79 s [vector] constructrN: OK
  14316. 857.79 s [vector] +++ OK, passed 100 tests.
  14317. 857.79 s [vector] cons: OK
  14318. 857.79 s [vector] +++ OK, passed 100 tests.
  14319. 857.79 s [vector] snoc: OK
  14320. 857.79 s [vector] +++ OK, passed 100 tests.
  14321. 857.80 s [vector] append: OK
  14322. 857.80 s [vector] +++ OK, passed 100 tests.
  14323. 857.80 s [vector] concat: OK
  14324. 857.80 s [vector] +++ OK, passed 100 tests.
  14325. 857.80 s [vector] force: OK
  14326. 857.80 s [vector] +++ OK, passed 100 tests.
  14327. 857.80 s [vector] upd: OK
  14328. 857.80 s [vector] +++ OK, passed 100 tests.
  14329. 857.80 s [vector] accum: OK
  14330. 857.80 s [vector] +++ OK, passed 100 tests.
  14331. 857.80 s [vector] reverse: OK
  14332. 857.80 s [vector] +++ OK, passed 100 tests.
  14333. 857.80 s [vector] backpermute: OK
  14334. 857.80 s [vector] +++ OK, passed 100 tests.
  14335. 857.80 s [vector] map: OK
  14336. 857.80 s [vector] +++ OK, passed 100 tests.
  14337. 857.80 s [vector] imap: OK
  14338. 857.80 s [vector] +++ OK, passed 100 tests.
  14339. 857.81 s [vector] concatMap: OK
  14340. 857.81 s [vector] +++ OK, passed 100 tests.
  14341. 857.81 s [vector] mapM: OK
  14342. 857.81 s [vector] +++ OK, passed 100 tests.
  14343. 857.81 s [vector] mapM_: OK
  14344. 857.81 s [vector] +++ OK, passed 100 tests.
  14345. 857.81 s [vector] forM: OK
  14346. 857.81 s [vector] +++ OK, passed 100 tests.
  14347. 857.82 s [vector] forM_: OK
  14348. 857.82 s [vector] +++ OK, passed 100 tests.
  14349. 857.83 s [vector] imapM: OK
  14350. 857.83 s [vector] +++ OK, passed 100 tests.
  14351. 857.83 s [vector] imapM_: OK
  14352. 857.83 s [vector] +++ OK, passed 100 tests.
  14353. 857.83 s [vector] zipWith: OK
  14354. 857.83 s [vector] +++ OK, passed 100 tests.
  14355. 857.83 s [vector] zipWith3: OK
  14356. 857.83 s [vector] +++ OK, passed 100 tests.
  14357. 857.83 s [vector] izipWith: OK
  14358. 857.83 s [vector] +++ OK, passed 100 tests.
  14359. 857.83 s [vector] izipWith3: OK
  14360. 857.83 s [vector] +++ OK, passed 100 tests.
  14361. 857.84 s [vector] izipWithM: OK
  14362. 857.84 s [vector] +++ OK, passed 100 tests.
  14363. 857.84 s [vector] izipWithM_: OK
  14364. 857.84 s [vector] +++ OK, passed 100 tests.
  14365. 857.85 s [vector] zipWithM: OK
  14366. 857.85 s [vector] +++ OK, passed 100 tests.
  14367. 857.85 s [vector] zipWithM_: OK
  14368. 857.85 s [vector] +++ OK, passed 100 tests.
  14369. 857.85 s [vector] filter: OK
  14370. 857.85 s [vector] +++ OK, passed 100 tests.
  14371. 857.86 s [vector] ifilter: OK
  14372. 857.86 s [vector] +++ OK, passed 100 tests.
  14373. 857.86 s [vector] filterM: OK (0.01s)
  14374. 857.86 s [vector] +++ OK, passed 100 tests.
  14375. 857.86 s [vector] uniq: OK
  14376. 857.86 s [vector] +++ OK, passed 100 tests.
  14377. 857.86 s [vector] mapMaybe: OK
  14378. 857.86 s [vector] +++ OK, passed 100 tests.
  14379. 857.86 s [vector] imapMaybe: OK
  14380. 857.86 s [vector] +++ OK, passed 100 tests.
  14381. 857.86 s [vector] takeWhile: OK
  14382. 857.86 s [vector] +++ OK, passed 100 tests.
  14383. 857.87 s [vector] dropWhile: OK
  14384. 857.87 s [vector] +++ OK, passed 100 tests.
  14385. 857.87 s [vector] partition: OK
  14386. 857.87 s [vector] +++ OK, passed 100 tests.
  14387. 857.87 s [vector] partitionWith: OK
  14388. 857.87 s [vector] +++ OK, passed 100 tests.
  14389. 857.87 s [vector] span: OK
  14390. 857.87 s [vector] +++ OK, passed 100 tests.
  14391. 857.87 s [vector] break: OK
  14392. 857.87 s [vector] +++ OK, passed 100 tests.
  14393. 857.87 s [vector] spanR: OK
  14394. 857.87 s [vector] +++ OK, passed 100 tests.
  14395. 857.87 s [vector] breakR: OK
  14396. 857.87 s [vector] +++ OK, passed 100 tests.
  14397. 857.87 s [vector] groupBy: OK
  14398. 857.87 s [vector] +++ OK, passed 100 tests.
  14399. 857.87 s [vector] elem: OK
  14400. 857.87 s [vector] +++ OK, passed 100 tests.
  14401. 857.87 s [vector] notElem: OK
  14402. 857.87 s [vector] +++ OK, passed 100 tests.
  14403. 857.87 s [vector] find: OK
  14404. 857.87 s [vector] +++ OK, passed 100 tests.
  14405. 857.87 s [vector] findIndex: OK
  14406. 857.87 s [vector] +++ OK, passed 100 tests.
  14407. 857.87 s [vector] findIndexR: OK
  14408. 857.87 s [vector] +++ OK, passed 100 tests.
  14409. 857.87 s [vector] findIndices: OK
  14410. 857.87 s [vector] +++ OK, passed 100 tests.
  14411. 857.87 s [vector] elemIndex: OK
  14412. 857.87 s [vector] +++ OK, passed 100 tests.
  14413. 857.87 s [vector] elemIndices: OK
  14414. 857.87 s [vector] +++ OK, passed 100 tests.
  14415. 857.87 s [vector] foldl: OK
  14416. 857.87 s [vector] +++ OK, passed 100 tests.
  14417. 857.87 s [vector] foldl1: OK
  14418. 857.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14419. 857.87 s [vector] foldl': OK
  14420. 857.87 s [vector] +++ OK, passed 100 tests.
  14421. 857.87 s [vector] foldl1': OK
  14422. 857.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14423. 857.88 s [vector] foldr: OK
  14424. 857.88 s [vector] +++ OK, passed 100 tests.
  14425. 857.88 s [vector] foldr1: OK
  14426. 857.88 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14427. 857.88 s [vector] foldr': OK
  14428. 857.88 s [vector] +++ OK, passed 100 tests.
  14429. 857.88 s [vector] foldr1': OK
  14430. 857.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14431. 857.88 s [vector] ifoldl: OK
  14432. 857.88 s [vector] +++ OK, passed 100 tests.
  14433. 857.88 s [vector] ifoldl': OK
  14434. 857.88 s [vector] +++ OK, passed 100 tests.
  14435. 857.88 s [vector] ifoldr: OK
  14436. 857.88 s [vector] +++ OK, passed 100 tests.
  14437. 857.88 s [vector] ifoldr': OK
  14438. 857.88 s [vector] +++ OK, passed 100 tests.
  14439. 857.88 s [vector] ifoldM: OK
  14440. 857.88 s [vector] +++ OK, passed 100 tests.
  14441. 857.88 s [vector] ifoldM': OK
  14442. 857.89 s [vector] +++ OK, passed 100 tests.
  14443. 857.89 s [vector] ifoldM_: OK
  14444. 857.89 s [vector] +++ OK, passed 100 tests.
  14445. 857.90 s [vector] ifoldM'_: OK
  14446. 857.90 s [vector] +++ OK, passed 100 tests.
  14447. 857.90 s [vector] all: OK
  14448. 857.90 s [vector] +++ OK, passed 100 tests.
  14449. 857.90 s [vector] any: OK
  14450. 857.90 s [vector] +++ OK, passed 100 tests.
  14451. 857.90 s [vector] prescanl: OK
  14452. 857.90 s [vector] +++ OK, passed 100 tests.
  14453. 857.90 s [vector] prescanl': OK
  14454. 857.90 s [vector] +++ OK, passed 100 tests.
  14455. 857.90 s [vector] postscanl: OK
  14456. 857.90 s [vector] +++ OK, passed 100 tests.
  14457. 857.90 s [vector] postscanl': OK
  14458. 857.90 s [vector] +++ OK, passed 100 tests.
  14459. 857.90 s [vector] scanl: OK
  14460. 857.90 s [vector] +++ OK, passed 100 tests.
  14461. 857.90 s [vector] scanl': OK
  14462. 857.90 s [vector] +++ OK, passed 100 tests.
  14463. 857.90 s [vector] scanl1: OK
  14464. 857.90 s [vector] +++ OK, passed 100 tests.
  14465. 857.91 s [vector] scanl1': OK
  14466. 857.91 s [vector] +++ OK, passed 100 tests.
  14467. 857.91 s [vector] iscanl: OK
  14468. 857.91 s [vector] +++ OK, passed 100 tests.
  14469. 857.91 s [vector] iscanl': OK
  14470. 857.91 s [vector] +++ OK, passed 100 tests.
  14471. 857.91 s [vector] prescanr: OK
  14472. 857.91 s [vector] +++ OK, passed 100 tests.
  14473. 857.91 s [vector] prescanr': OK
  14474. 857.91 s [vector] +++ OK, passed 100 tests.
  14475. 857.91 s [vector] postscanr: OK
  14476. 857.91 s [vector] +++ OK, passed 100 tests.
  14477. 857.91 s [vector] postscanr': OK
  14478. 857.91 s [vector] +++ OK, passed 100 tests.
  14479. 857.91 s [vector] scanr: OK
  14480. 857.91 s [vector] +++ OK, passed 100 tests.
  14481. 857.91 s [vector] scanr': OK
  14482. 857.91 s [vector] +++ OK, passed 100 tests.
  14483. 857.91 s [vector] scanr1: OK
  14484. 857.91 s [vector] +++ OK, passed 100 tests.
  14485. 857.91 s [vector] scanr1': OK
  14486. 857.91 s [vector] +++ OK, passed 100 tests.
  14487. 857.92 s [vector] iscanr: OK
  14488. 857.92 s [vector] +++ OK, passed 100 tests.
  14489. 857.92 s [vector] iscanr': OK
  14490. 857.92 s [vector] +++ OK, passed 100 tests.
  14491. 857.92 s [vector] mut_read: OK
  14492. 857.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14493. 857.92 s [vector] mut_write: OK
  14494. 857.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14495. 857.92 s [vector] mut_modify: OK
  14496. 857.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14497. 857.92 s [vector] mut_generate: OK
  14498. 857.92 s [vector] +++ OK, passed 100 tests.
  14499. 857.93 s [vector] mut_generateM: OK
  14500. 857.93 s [vector] +++ OK, passed 100 tests.
  14501. 857.93 s [vector] mut_mapM_: OK
  14502. 857.94 s [vector] +++ OK, passed 100 tests.
  14503. 857.95 s [vector] mut_imapM_: OK
  14504. 857.95 s [vector] +++ OK, passed 100 tests.
  14505. 857.95 s [vector] mut_forM_: OK
  14506. 857.95 s [vector] +++ OK, passed 100 tests.
  14507. 857.96 s [vector] mut_iforM_: OK
  14508. 857.96 s [vector] +++ OK, passed 100 tests.
  14509. 857.96 s [vector] mut_foldr: OK
  14510. 857.96 s [vector] +++ OK, passed 100 tests.
  14511. 857.96 s [vector] mut_foldr': OK
  14512. 857.96 s [vector] +++ OK, passed 100 tests.
  14513. 857.96 s [vector] mut_foldl: OK
  14514. 857.96 s [vector] +++ OK, passed 100 tests.
  14515. 857.96 s [vector] mut_foldl': OK
  14516. 857.96 s [vector] +++ OK, passed 100 tests.
  14517. 857.96 s [vector] mut_ifoldr: OK
  14518. 857.96 s [vector] +++ OK, passed 100 tests.
  14519. 857.96 s [vector] mut_ifoldr': OK
  14520. 857.96 s [vector] +++ OK, passed 100 tests.
  14521. 857.96 s [vector] mut_ifoldl: OK
  14522. 857.96 s [vector] +++ OK, passed 100 tests.
  14523. 857.96 s [vector] mut_ifoldl': OK
  14524. 857.96 s [vector] +++ OK, passed 100 tests.
  14525. 857.96 s [vector] mut_foldM: OK
  14526. 857.96 s [vector] +++ OK, passed 100 tests.
  14527. 857.97 s [vector] mut_foldM': OK
  14528. 857.97 s [vector] +++ OK, passed 100 tests.
  14529. 857.97 s [vector] mut_foldrM: OK
  14530. 857.97 s [vector] +++ OK, passed 100 tests.
  14531. 857.97 s [vector] mut_foldrM': OK
  14532. 857.97 s [vector] +++ OK, passed 100 tests.
  14533. 857.97 s [vector] mut_ifoldM: OK
  14534. 857.97 s [vector] +++ OK, passed 100 tests.
  14535. 857.97 s [vector] mut_ifoldM': OK
  14536. 857.97 s [vector] +++ OK, passed 100 tests.
  14537. 857.97 s [vector] mut_ifoldrM: OK
  14538. 857.97 s [vector] +++ OK, passed 100 tests.
  14539. 857.97 s [vector] mut_ifoldrM': OK
  14540. 857.97 s [vector] +++ OK, passed 100 tests.
  14541. 857.97 s [vector] compare: OK
  14542. 857.97 s [vector] +++ OK, passed 100 tests.
  14543. 857.97 s [vector] maximum: OK
  14544. 857.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14545. 857.97 s [vector] minimum: OK
  14546. 857.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14547. 857.97 s [vector] minIndex: OK
  14548. 857.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14549. 857.97 s [vector] maxIndex: OK
  14550. 857.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14551. 857.97 s [vector] maximumBy: OK
  14552. 857.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14553. 857.97 s [vector] minimumBy: OK
  14554. 857.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14555. 857.97 s [vector] maximumOn: OK
  14556. 857.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14557. 857.97 s [vector] minimumOn: OK
  14558. 857.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14559. 857.97 s [vector] maxIndexBy: OK
  14560. 857.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14561. 857.97 s [vector] minIndexBy: OK
  14562. 857.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14563. 857.97 s [vector] ListFirstMaxIndexWins: OK
  14564. 857.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14565. 857.97 s [vector] FalseListFirstMaxIndexWins: OK
  14566. 857.97 s [vector] +++ OK, failed as expected. (after 1 test):
  14567. 857.97 s [vector] Exception:
  14568. 857.97 s [vector] Prelude.foldr1: empty list
  14569. 857.97 s [vector] CallStack (from HasCallStack):
  14570. 857.97 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14571. 857.97 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14572. 857.97 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14573. 857.97 s [vector] []
  14574. 857.97 s [vector] zip: OK
  14575. 857.97 s [vector] +++ OK, passed 100 tests.
  14576. 857.97 s [vector] zip3: OK
  14577. 857.97 s [vector] +++ OK, passed 100 tests.
  14578. 857.98 s [vector] unzip: OK
  14579. 857.98 s [vector] +++ OK, passed 100 tests.
  14580. 857.98 s [vector] unzip3: OK
  14581. 857.98 s [vector] +++ OK, passed 100 tests.
  14582. 857.98 s [vector] indexed: OK
  14583. 857.98 s [vector] +++ OK, passed 100 tests.
  14584. 857.98 s [vector] update: OK
  14585. 857.98 s [vector] +++ OK, passed 100 tests.
  14586. 857.98 s [vector] mempty: OK
  14587. 857.98 s [vector] +++ OK, passed 1 test.
  14588. 857.99 s [vector] mappend: OK
  14589. 857.99 s [vector] +++ OK, passed 100 tests.
  14590. 857.99 s [vector] mconcat: OK
  14591. 857.99 s [vector] +++ OK, passed 100 tests.
  14592. 857.99 s [vector] glength: OK
  14593. 857.99 s [vector] +++ OK, passed 100 tests.
  14594. 857.99 s [vector] (Bool)
  14595. 857.99 s [vector] fromList.toList == id: OK
  14596. 857.99 s [vector] +++ OK, passed 100 tests.
  14597. 857.99 s [vector] toList.fromList == id: OK
  14598. 857.99 s [vector] +++ OK, passed 100 tests.
  14599. 857.99 s [vector] unstream.stream == id: OK
  14600. 857.99 s [vector] +++ OK, passed 100 tests.
  14601. 857.99 s [vector] stream.unstream == id: OK
  14602. 857.99 s [vector] +++ OK, passed 100 tests.
  14603. 857.99 s [vector] eq: OK
  14604. 857.99 s [vector] +++ OK, passed 100 tests.
  14605. 857.99 s [vector] length: OK
  14606. 857.99 s [vector] +++ OK, passed 100 tests.
  14607. 857.99 s [vector] null: OK
  14608. 857.99 s [vector] +++ OK, passed 100 tests.
  14609. 857.99 s [vector] index: OK
  14610. 857.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14611. 857.99 s [vector] safeIndex: OK
  14612. 857.99 s [vector] +++ OK, passed 100 tests.
  14613. 857.99 s [vector] head: OK
  14614. 857.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14615. 857.99 s [vector] last: OK
  14616. 857.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14617. 857.99 s [vector] unsafeIndex: OK
  14618. 857.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14619. 857.99 s [vector] unsafeHead: OK
  14620. 857.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14621. 858.00 s [vector] unsafeLast: OK
  14622. 858.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14623. 858.00 s [vector] slice: OK
  14624. 858.00 s [vector] +++ OK, passed 100 tests.
  14625. 858.00 s [vector] init: OK
  14626. 858.00 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14627. 858.00 s [vector] tail: OK
  14628. 858.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14629. 858.00 s [vector] take: OK
  14630. 858.00 s [vector] +++ OK, passed 100 tests.
  14631. 858.00 s [vector] drop: OK
  14632. 858.00 s [vector] +++ OK, passed 100 tests.
  14633. 858.00 s [vector] splitAt: OK
  14634. 858.00 s [vector] +++ OK, passed 100 tests.
  14635. 858.00 s [vector] empty: OK
  14636. 858.00 s [vector] +++ OK, passed 1 test.
  14637. 858.00 s [vector] singleton: OK
  14638. 858.00 s [vector] +++ OK, passed 100 tests.
  14639. 858.00 s [vector] replicate: OK
  14640. 858.00 s [vector] +++ OK, passed 100 tests.
  14641. 858.00 s [vector] generate: OK
  14642. 858.00 s [vector] +++ OK, passed 100 tests.
  14643. 858.01 s [vector] iterateN: OK
  14644. 858.01 s [vector] +++ OK, passed 100 tests.
  14645. 858.03 s [vector] iterateNM: OK (0.03s)
  14646. 858.03 s [vector] +++ OK, passed 100 tests.
  14647. 858.06 s [vector] generateM: OK (0.01s)
  14648. 858.06 s [vector] +++ OK, passed 100 tests.
  14649. 858.06 s [vector] replicateM: OK (0.01s)
  14650. 858.06 s [vector] +++ OK, passed 100 tests.
  14651. 858.06 s [vector] create: OK
  14652. 858.06 s [vector] +++ OK, passed 100 tests.
  14653. 858.06 s [vector] createT: OK
  14654. 858.06 s [vector] +++ OK, passed 100 tests.
  14655. 858.06 s [vector] unfoldr: OK
  14656. 858.06 s [vector] +++ OK, passed 100 tests.
  14657. 858.06 s [vector] unfoldrN: OK
  14658. 858.06 s [vector] +++ OK, passed 100 tests.
  14659. 858.06 s [vector] unfoldrExactN: OK
  14660. 858.06 s [vector] +++ OK, passed 100 tests.
  14661. 858.08 s [vector] unfoldrM: OK (0.01s)
  14662. 858.08 s [vector] +++ OK, passed 100 tests.
  14663. 858.08 s [vector] unfoldrNM: OK
  14664. 858.09 s [vector] +++ OK, passed 100 tests.
  14665. 858.11 s [vector] unfoldrExactNM: OK (0.02s)
  14666. 858.11 s [vector] +++ OK, passed 100 tests.
  14667. 858.11 s [vector] constructN: OK
  14668. 858.11 s [vector] +++ OK, passed 100 tests.
  14669. 858.11 s [vector] constructrN: OK
  14670. 858.11 s [vector] +++ OK, passed 100 tests.
  14671. 858.11 s [vector] cons: OK
  14672. 858.11 s [vector] +++ OK, passed 100 tests.
  14673. 858.11 s [vector] snoc: OK
  14674. 858.12 s [vector] +++ OK, passed 100 tests.
  14675. 858.12 s [vector] append: OK
  14676. 858.12 s [vector] +++ OK, passed 100 tests.
  14677. 858.13 s [vector] concat: OK (0.02s)
  14678. 858.13 s [vector] +++ OK, passed 100 tests.
  14679. 858.13 s [vector] force: OK
  14680. 858.13 s [vector] +++ OK, passed 100 tests.
  14681. 858.13 s [vector] upd: OK
  14682. 858.13 s [vector] +++ OK, passed 100 tests.
  14683. 858.14 s [vector] accum: OK
  14684. 858.14 s [vector] +++ OK, passed 100 tests.
  14685. 858.14 s [vector] reverse: OK
  14686. 858.14 s [vector] +++ OK, passed 100 tests.
  14687. 858.14 s [vector] backpermute: OK
  14688. 858.14 s [vector] +++ OK, passed 100 tests.
  14689. 858.14 s [vector] map: OK
  14690. 858.14 s [vector] +++ OK, passed 100 tests.
  14691. 858.14 s [vector] imap: OK
  14692. 858.14 s [vector] +++ OK, passed 100 tests.
  14693. 858.14 s [vector] concatMap: OK
  14694. 858.14 s [vector] +++ OK, passed 100 tests.
  14695. 858.14 s [vector] mapM: OK
  14696. 858.16 s [vector] +++ OK, passed 100 tests.
  14697. 858.16 s [vector] mapM_: OK (0.01s)
  14698. 858.16 s [vector] +++ OK, passed 100 tests.
  14699. 858.17 s [vector] forM: OK
  14700. 858.17 s [vector] +++ OK, passed 100 tests.
  14701. 858.17 s [vector] forM_: OK (0.01s)
  14702. 858.17 s [vector] +++ OK, passed 100 tests.
  14703. 858.17 s [vector] imapM: OK
  14704. 858.17 s [vector] +++ OK, passed 100 tests.
  14705. 858.18 s [vector] imapM_: OK
  14706. 858.18 s [vector] +++ OK, passed 100 tests.
  14707. 858.19 s [vector] zipWith: OK
  14708. 858.19 s [vector] +++ OK, passed 100 tests.
  14709. 858.19 s [vector] zipWith3: OK
  14710. 858.19 s [vector] +++ OK, passed 100 tests.
  14711. 858.19 s [vector] izipWith: OK
  14712. 858.19 s [vector] +++ OK, passed 100 tests.
  14713. 858.19 s [vector] izipWith3: OK
  14714. 858.19 s [vector] +++ OK, passed 100 tests.
  14715. 858.20 s [vector] izipWithM: OK
  14716. 858.20 s [vector] +++ OK, passed 100 tests.
  14717. 858.20 s [vector] izipWithM_: OK
  14718. 858.20 s [vector] +++ OK, passed 100 tests.
  14719. 858.20 s [vector] zipWithM: OK
  14720. 858.22 s [vector] +++ OK, passed 100 tests.
  14721. 858.22 s [vector] zipWithM_: OK (0.01s)
  14722. 858.22 s [vector] +++ OK, passed 100 tests.
  14723. 858.22 s [vector] filter: OK
  14724. 858.22 s [vector] +++ OK, passed 100 tests.
  14725. 858.22 s [vector] ifilter: OK
  14726. 858.22 s [vector] +++ OK, passed 100 tests.
  14727. 858.23 s [vector] filterM: OK
  14728. 858.23 s [vector] +++ OK, passed 100 tests.
  14729. 858.23 s [vector] uniq: OK
  14730. 858.23 s [vector] +++ OK, passed 100 tests.
  14731. 858.23 s [vector] mapMaybe: OK
  14732. 858.23 s [vector] +++ OK, passed 100 tests.
  14733. 858.23 s [vector] imapMaybe: OK
  14734. 858.23 s [vector] +++ OK, passed 100 tests.
  14735. 858.23 s [vector] takeWhile: OK
  14736. 858.23 s [vector] +++ OK, passed 100 tests.
  14737. 858.23 s [vector] dropWhile: OK
  14738. 858.23 s [vector] +++ OK, passed 100 tests.
  14739. 858.23 s [vector] partition: OK
  14740. 858.24 s [vector] +++ OK, passed 100 tests.
  14741. 858.24 s [vector] partitionWith: OK
  14742. 858.24 s [vector] +++ OK, passed 100 tests.
  14743. 858.24 s [vector] span: OK
  14744. 858.24 s [vector] +++ OK, passed 100 tests.
  14745. 858.24 s [vector] break: OK
  14746. 858.24 s [vector] +++ OK, passed 100 tests.
  14747. 858.24 s [vector] spanR: OK
  14748. 858.24 s [vector] +++ OK, passed 100 tests.
  14749. 858.24 s [vector] breakR: OK
  14750. 858.24 s [vector] +++ OK, passed 100 tests.
  14751. 858.24 s [vector] groupBy: OK
  14752. 858.24 s [vector] +++ OK, passed 100 tests.
  14753. 858.24 s [vector] elem: OK
  14754. 858.24 s [vector] +++ OK, passed 100 tests.
  14755. 858.24 s [vector] notElem: OK
  14756. 858.24 s [vector] +++ OK, passed 100 tests.
  14757. 858.24 s [vector] find: OK
  14758. 858.24 s [vector] +++ OK, passed 100 tests.
  14759. 858.24 s [vector] findIndex: OK
  14760. 858.24 s [vector] +++ OK, passed 100 tests.
  14761. 858.24 s [vector] findIndexR: OK
  14762. 858.24 s [vector] +++ OK, passed 100 tests.
  14763. 858.24 s [vector] findIndices: OK
  14764. 858.24 s [vector] +++ OK, passed 100 tests.
  14765. 858.24 s [vector] elemIndex: OK
  14766. 858.24 s [vector] +++ OK, passed 100 tests.
  14767. 858.24 s [vector] elemIndices: OK
  14768. 858.24 s [vector] +++ OK, passed 100 tests.
  14769. 858.25 s [vector] foldl: OK
  14770. 858.25 s [vector] +++ OK, passed 100 tests.
  14771. 858.25 s [vector] foldl1: OK
  14772. 858.25 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14773. 858.25 s [vector] foldl': OK
  14774. 858.25 s [vector] +++ OK, passed 100 tests.
  14775. 858.25 s [vector] foldl1': OK
  14776. 858.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14777. 858.25 s [vector] foldr: OK
  14778. 858.25 s [vector] +++ OK, passed 100 tests.
  14779. 858.25 s [vector] foldr1: OK
  14780. 858.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14781. 858.25 s [vector] foldr': OK
  14782. 858.25 s [vector] +++ OK, passed 100 tests.
  14783. 858.25 s [vector] foldr1': OK
  14784. 858.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14785. 858.25 s [vector] ifoldl: OK
  14786. 858.25 s [vector] +++ OK, passed 100 tests.
  14787. 858.25 s [vector] ifoldl': OK
  14788. 858.26 s [vector] +++ OK, passed 100 tests.
  14789. 858.26 s [vector] ifoldr: OK
  14790. 858.26 s [vector] +++ OK, passed 100 tests.
  14791. 858.26 s [vector] ifoldr': OK
  14792. 858.26 s [vector] +++ OK, passed 100 tests.
  14793. 858.26 s [vector] ifoldM: OK
  14794. 858.26 s [vector] +++ OK, passed 100 tests.
  14795. 858.27 s [vector] ifoldM': OK
  14796. 858.27 s [vector] +++ OK, passed 100 tests.
  14797. 858.27 s [vector] ifoldM_: OK
  14798. 858.27 s [vector] +++ OK, passed 100 tests.
  14799. 858.28 s [vector] ifoldM'_: OK
  14800. 858.28 s [vector] +++ OK, passed 100 tests.
  14801. 858.28 s [vector] all: OK
  14802. 858.28 s [vector] +++ OK, passed 100 tests.
  14803. 858.28 s [vector] any: OK
  14804. 858.28 s [vector] +++ OK, passed 100 tests.
  14805. 858.28 s [vector] prescanl: OK
  14806. 858.28 s [vector] +++ OK, passed 100 tests.
  14807. 858.28 s [vector] prescanl': OK
  14808. 858.28 s [vector] +++ OK, passed 100 tests.
  14809. 858.28 s [vector] postscanl: OK
  14810. 858.28 s [vector] +++ OK, passed 100 tests.
  14811. 858.28 s [vector] postscanl': OK
  14812. 858.28 s [vector] +++ OK, passed 100 tests.
  14813. 858.28 s [vector] scanl: OK
  14814. 858.28 s [vector] +++ OK, passed 100 tests.
  14815. 858.28 s [vector] scanl': OK
  14816. 858.28 s [vector] +++ OK, passed 100 tests.
  14817. 858.29 s [vector] scanl1: OK
  14818. 858.29 s [vector] +++ OK, passed 100 tests.
  14819. 858.29 s [vector] scanl1': OK
  14820. 858.29 s [vector] +++ OK, passed 100 tests.
  14821. 858.29 s [vector] iscanl: OK
  14822. 858.29 s [vector] +++ OK, passed 100 tests.
  14823. 858.29 s [vector] iscanl': OK
  14824. 858.29 s [vector] +++ OK, passed 100 tests.
  14825. 858.29 s [vector] prescanr: OK
  14826. 858.29 s [vector] +++ OK, passed 100 tests.
  14827. 858.29 s [vector] prescanr': OK
  14828. 858.29 s [vector] +++ OK, passed 100 tests.
  14829. 858.29 s [vector] postscanr: OK
  14830. 858.30 s [vector] +++ OK, passed 100 tests.
  14831. 858.30 s [vector] postscanr': OK
  14832. 858.30 s [vector] +++ OK, passed 100 tests.
  14833. 858.30 s [vector] scanr: OK
  14834. 858.30 s [vector] +++ OK, passed 100 tests.
  14835. 858.30 s [vector] scanr': OK
  14836. 858.30 s [vector] +++ OK, passed 100 tests.
  14837. 858.30 s [vector] scanr1: OK
  14838. 858.30 s [vector] +++ OK, passed 100 tests.
  14839. 858.30 s [vector] scanr1': OK
  14840. 858.30 s [vector] +++ OK, passed 100 tests.
  14841. 858.30 s [vector] iscanr: OK
  14842. 858.30 s [vector] +++ OK, passed 100 tests.
  14843. 858.30 s [vector] iscanr': OK
  14844. 858.30 s [vector] +++ OK, passed 100 tests.
  14845. 858.31 s [vector] mut_read: OK
  14846. 858.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14847. 858.31 s [vector] mut_write: OK
  14848. 858.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14849. 858.31 s [vector] mut_modify: OK
  14850. 858.31 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14851. 858.31 s [vector] mut_generate: OK
  14852. 858.31 s [vector] +++ OK, passed 100 tests.
  14853. 858.31 s [vector] mut_generateM: OK
  14854. 858.31 s [vector] +++ OK, passed 100 tests.
  14855. 858.33 s [vector] mut_mapM_: OK
  14856. 858.33 s [vector] +++ OK, passed 100 tests.
  14857. 858.33 s [vector] mut_imapM_: OK
  14858. 858.33 s [vector] +++ OK, passed 100 tests.
  14859. 858.35 s [vector] mut_forM_: OK (0.01s)
  14860. 858.35 s [vector] +++ OK, passed 100 tests.
  14861. 858.35 s [vector] mut_iforM_: OK (0.01s)
  14862. 858.35 s [vector] +++ OK, passed 100 tests.
  14863. 858.35 s [vector] mut_foldr: OK
  14864. 858.35 s [vector] +++ OK, passed 100 tests.
  14865. 858.35 s [vector] mut_foldr': OK
  14866. 858.35 s [vector] +++ OK, passed 100 tests.
  14867. 858.35 s [vector] mut_foldl: OK
  14868. 858.35 s [vector] +++ OK, passed 100 tests.
  14869. 858.36 s [vector] mut_foldl': OK
  14870. 858.36 s [vector] +++ OK, passed 100 tests.
  14871. 858.36 s [vector] mut_ifoldr: OK
  14872. 858.36 s [vector] +++ OK, passed 100 tests.
  14873. 858.36 s [vector] mut_ifoldr': OK
  14874. 858.36 s [vector] +++ OK, passed 100 tests.
  14875. 858.36 s [vector] mut_ifoldl: OK
  14876. 858.36 s [vector] +++ OK, passed 100 tests.
  14877. 858.36 s [vector] mut_ifoldl': OK
  14878. 858.36 s [vector] +++ OK, passed 100 tests.
  14879. 858.37 s [vector] mut_foldM: OK
  14880. 858.37 s [vector] +++ OK, passed 100 tests.
  14881. 858.37 s [vector] mut_foldM': OK
  14882. 858.37 s [vector] +++ OK, passed 100 tests.
  14883. 858.37 s [vector] mut_foldrM: OK
  14884. 858.37 s [vector] +++ OK, passed 100 tests.
  14885. 858.37 s [vector] mut_foldrM': OK
  14886. 858.37 s [vector] +++ OK, passed 100 tests.
  14887. 858.37 s [vector] mut_ifoldM: OK
  14888. 858.37 s [vector] +++ OK, passed 100 tests.
  14889. 858.37 s [vector] mut_ifoldM': OK
  14890. 858.37 s [vector] +++ OK, passed 100 tests.
  14891. 858.37 s [vector] mut_ifoldrM: OK
  14892. 858.37 s [vector] +++ OK, passed 100 tests.
  14893. 858.37 s [vector] mut_ifoldrM': OK
  14894. 858.37 s [vector] +++ OK, passed 100 tests.
  14895. 858.37 s [vector] compare: OK
  14896. 858.37 s [vector] +++ OK, passed 100 tests.
  14897. 858.38 s [vector] maximum: OK
  14898. 858.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14899. 858.38 s [vector] minimum: OK
  14900. 858.38 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14901. 858.38 s [vector] minIndex: OK
  14902. 858.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14903. 858.38 s [vector] maxIndex: OK
  14904. 858.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14905. 858.38 s [vector] maximumBy: OK
  14906. 858.38 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14907. 858.38 s [vector] minimumBy: OK
  14908. 858.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14909. 858.38 s [vector] maximumOn: OK
  14910. 858.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14911. 858.38 s [vector] minimumOn: OK
  14912. 858.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14913. 858.38 s [vector] maxIndexBy: OK
  14914. 858.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14915. 858.38 s [vector] minIndexBy: OK
  14916. 858.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14917. 858.38 s [vector] ListFirstMaxIndexWins: OK
  14918. 858.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14919. 858.38 s [vector] FalseListFirstMaxIndexWins: OK
  14920. 858.38 s [vector] +++ OK, failed as expected. (after 1 test):
  14921. 858.38 s [vector] Exception:
  14922. 858.38 s [vector] Prelude.foldr1: empty list
  14923. 858.38 s [vector] CallStack (from HasCallStack):
  14924. 858.38 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14925. 858.38 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14926. 858.38 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14927. 858.38 s [vector] []
  14928. 858.38 s [vector] zip: OK
  14929. 858.38 s [vector] +++ OK, passed 100 tests.
  14930. 858.39 s [vector] zip3: OK
  14931. 858.39 s [vector] +++ OK, passed 100 tests.
  14932. 858.39 s [vector] unzip: OK
  14933. 858.39 s [vector] +++ OK, passed 100 tests.
  14934. 858.39 s [vector] unzip3: OK
  14935. 858.39 s [vector] +++ OK, passed 100 tests.
  14936. 858.39 s [vector] indexed: OK
  14937. 858.39 s [vector] +++ OK, passed 100 tests.
  14938. 858.39 s [vector] update: OK
  14939. 858.39 s [vector] +++ OK, passed 100 tests.
  14940. 858.39 s [vector] mempty: OK
  14941. 858.39 s [vector] +++ OK, passed 1 test.
  14942. 858.39 s [vector] mappend: OK
  14943. 858.39 s [vector] +++ OK, passed 100 tests.
  14944. 858.41 s [vector] mconcat: OK (0.01s)
  14945. 858.41 s [vector] +++ OK, passed 100 tests.
  14946. 858.41 s [vector] glength: OK
  14947. 858.41 s [vector] +++ OK, passed 100 tests.
  14948. 858.41 s [vector] and: OK
  14949. 858.41 s [vector] +++ OK, passed 100 tests.
  14950. 858.41 s [vector] or: OK
  14951. 858.41 s [vector] +++ OK, passed 100 tests.
  14952. 858.41 s [vector] (Int)
  14953. 858.41 s [vector] fromList.toList == id: OK
  14954. 858.41 s [vector] +++ OK, passed 100 tests.
  14955. 858.41 s [vector] toList.fromList == id: OK
  14956. 858.41 s [vector] +++ OK, passed 100 tests.
  14957. 858.41 s [vector] unstream.stream == id: OK
  14958. 858.41 s [vector] +++ OK, passed 100 tests.
  14959. 858.41 s [vector] stream.unstream == id: OK
  14960. 858.41 s [vector] +++ OK, passed 100 tests.
  14961. 858.41 s [vector] eq: OK
  14962. 858.41 s [vector] +++ OK, passed 100 tests.
  14963. 858.41 s [vector] length: OK
  14964. 858.41 s [vector] +++ OK, passed 100 tests.
  14965. 858.41 s [vector] null: OK
  14966. 858.41 s [vector] +++ OK, passed 100 tests.
  14967. 858.41 s [vector] index: OK
  14968. 858.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14969. 858.41 s [vector] safeIndex: OK
  14970. 858.41 s [vector] +++ OK, passed 100 tests.
  14971. 858.41 s [vector] head: OK
  14972. 858.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14973. 858.41 s [vector] last: OK
  14974. 858.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14975. 858.41 s [vector] unsafeIndex: OK
  14976. 858.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14977. 858.41 s [vector] unsafeHead: OK
  14978. 858.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14979. 858.41 s [vector] unsafeLast: OK
  14980. 858.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14981. 858.42 s [vector] slice: OK
  14982. 858.42 s [vector] +++ OK, passed 100 tests.
  14983. 858.42 s [vector] init: OK
  14984. 858.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14985. 858.42 s [vector] tail: OK
  14986. 858.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14987. 858.42 s [vector] take: OK
  14988. 858.42 s [vector] +++ OK, passed 100 tests.
  14989. 858.42 s [vector] drop: OK
  14990. 858.42 s [vector] +++ OK, passed 100 tests.
  14991. 858.42 s [vector] splitAt: OK
  14992. 858.42 s [vector] +++ OK, passed 100 tests.
  14993. 858.42 s [vector] empty: OK
  14994. 858.42 s [vector] +++ OK, passed 1 test.
  14995. 858.42 s [vector] singleton: OK
  14996. 858.42 s [vector] +++ OK, passed 100 tests.
  14997. 858.42 s [vector] replicate: OK
  14998. 858.42 s [vector] +++ OK, passed 100 tests.
  14999. 858.42 s [vector] generate: OK
  15000. 858.42 s [vector] +++ OK, passed 100 tests.
  15001. 858.42 s [vector] iterateN: OK
  15002. 858.43 s [vector] +++ OK, passed 100 tests.
  15003. 858.43 s [vector] iterateNM: OK (0.01s)
  15004. 858.43 s [vector] +++ OK, passed 100 tests.
  15005. 858.46 s [vector] generateM: OK (0.01s)
  15006. 858.46 s [vector] +++ OK, passed 100 tests.
  15007. 858.47 s [vector] replicateM: OK (0.02s)
  15008. 858.47 s [vector] +++ OK, passed 100 tests.
  15009. 858.47 s [vector] create: OK
  15010. 858.47 s [vector] +++ OK, passed 100 tests.
  15011. 858.47 s [vector] createT: OK
  15012. 858.47 s [vector] +++ OK, passed 100 tests.
  15013. 858.47 s [vector] unfoldr: OK
  15014. 858.47 s [vector] +++ OK, passed 100 tests.
  15015. 858.47 s [vector] unfoldrN: OK
  15016. 858.47 s [vector] +++ OK, passed 100 tests.
  15017. 858.47 s [vector] unfoldrExactN: OK
  15018. 858.47 s [vector] +++ OK, passed 100 tests.
  15019. 858.47 s [vector] unfoldrM: OK
  15020. 858.47 s [vector] +++ OK, passed 100 tests.
  15021. 858.47 s [vector] unfoldrNM: OK
  15022. 858.48 s [vector] +++ OK, passed 100 tests.
  15023. 858.49 s [vector] unfoldrExactNM: OK (0.01s)
  15024. 858.49 s [vector] +++ OK, passed 100 tests.
  15025. 858.49 s [vector] constructN: OK
  15026. 858.49 s [vector] +++ OK, passed 100 tests.
  15027. 858.49 s [vector] constructrN: OK
  15028. 858.49 s [vector] +++ OK, passed 100 tests.
  15029. 858.50 s [vector] cons: OK
  15030. 858.50 s [vector] +++ OK, passed 100 tests.
  15031. 858.50 s [vector] snoc: OK
  15032. 858.50 s [vector] +++ OK, passed 100 tests.
  15033. 858.51 s [vector] append: OK
  15034. 858.51 s [vector] +++ OK, passed 100 tests.
  15035. 858.51 s [vector] concat: OK (0.01s)
  15036. 858.51 s [vector] +++ OK, passed 100 tests.
  15037. 858.51 s [vector] force: OK
  15038. 858.51 s [vector] +++ OK, passed 100 tests.
  15039. 858.52 s [vector] upd: OK
  15040. 858.52 s [vector] +++ OK, passed 100 tests.
  15041. 858.52 s [vector] accum: OK
  15042. 858.52 s [vector] +++ OK, passed 100 tests.
  15043. 858.52 s [vector] reverse: OK
  15044. 858.52 s [vector] +++ OK, passed 100 tests.
  15045. 858.52 s [vector] backpermute: OK
  15046. 858.52 s [vector] +++ OK, passed 100 tests.
  15047. 858.52 s [vector] map: OK
  15048. 858.52 s [vector] +++ OK, passed 100 tests.
  15049. 858.52 s [vector] imap: OK
  15050. 858.52 s [vector] +++ OK, passed 100 tests.
  15051. 858.53 s [vector] concatMap: OK
  15052. 858.53 s [vector] +++ OK, passed 100 tests.
  15053. 858.53 s [vector] mapM: OK
  15054. 858.53 s [vector] +++ OK, passed 100 tests.
  15055. 858.54 s [vector] mapM_: OK (0.02s)
  15056. 858.54 s [vector] +++ OK, passed 100 tests.
  15057. 858.54 s [vector] forM: OK
  15058. 858.55 s [vector] +++ OK, passed 100 tests.
  15059. 858.56 s [vector] forM_: OK (0.02s)
  15060. 858.56 s [vector] +++ OK, passed 100 tests.
  15061. 858.57 s [vector] imapM: OK
  15062. 858.57 s [vector] +++ OK, passed 100 tests.
  15063. 858.58 s [vector] imapM_: OK (0.02s)
  15064. 858.58 s [vector] +++ OK, passed 100 tests.
  15065. 858.58 s [vector] zipWith: OK
  15066. 858.58 s [vector] +++ OK, passed 100 tests.
  15067. 858.59 s [vector] zipWith3: OK
  15068. 858.59 s [vector] +++ OK, passed 100 tests.
  15069. 858.59 s [vector] izipWith: OK
  15070. 858.59 s [vector] +++ OK, passed 100 tests.
  15071. 858.59 s [vector] izipWith3: OK
  15072. 858.59 s [vector] +++ OK, passed 100 tests.
  15073. 858.59 s [vector] izipWithM: OK
  15074. 858.59 s [vector] +++ OK, passed 100 tests.
  15075. 858.60 s [vector] izipWithM_: OK (0.01s)
  15076. 858.60 s [vector] +++ OK, passed 100 tests.
  15077. 858.60 s [vector] zipWithM: OK
  15078. 858.60 s [vector] +++ OK, passed 100 tests.
  15079. 858.61 s [vector] zipWithM_: OK
  15080. 858.62 s [vector] +++ OK, passed 100 tests.
  15081. 858.62 s [vector] filter: OK
  15082. 858.62 s [vector] +++ OK, passed 100 tests.
  15083. 858.63 s [vector] ifilter: OK
  15084. 858.63 s [vector] +++ OK, passed 100 tests.
  15085. 858.65 s [vector] filterM: OK (0.03s)
  15086. 858.65 s [vector] +++ OK, passed 100 tests.
  15087. 858.65 s [vector] uniq: OK
  15088. 858.65 s [vector] +++ OK, passed 100 tests.
  15089. 858.65 s [vector] mapMaybe: OK
  15090. 858.65 s [vector] +++ OK, passed 100 tests.
  15091. 858.65 s [vector] imapMaybe: OK
  15092. 858.65 s [vector] +++ OK, passed 100 tests.
  15093. 858.65 s [vector] takeWhile: OK
  15094. 858.65 s [vector] +++ OK, passed 100 tests.
  15095. 858.66 s [vector] dropWhile: OK
  15096. 858.66 s [vector] +++ OK, passed 100 tests.
  15097. 858.66 s [vector] partition: OK
  15098. 858.66 s [vector] +++ OK, passed 100 tests.
  15099. 858.66 s [vector] partitionWith: OK
  15100. 858.66 s [vector] +++ OK, passed 100 tests.
  15101. 858.66 s [vector] span: OK
  15102. 858.66 s [vector] +++ OK, passed 100 tests.
  15103. 858.66 s [vector] break: OK
  15104. 858.66 s [vector] +++ OK, passed 100 tests.
  15105. 858.66 s [vector] spanR: OK
  15106. 858.66 s [vector] +++ OK, passed 100 tests.
  15107. 858.66 s [vector] breakR: OK
  15108. 858.67 s [vector] +++ OK, passed 100 tests.
  15109. 858.67 s [vector] groupBy: OK
  15110. 858.67 s [vector] +++ OK, passed 100 tests.
  15111. 858.67 s [vector] elem: OK
  15112. 858.67 s [vector] +++ OK, passed 100 tests.
  15113. 858.67 s [vector] notElem: OK
  15114. 858.67 s [vector] +++ OK, passed 100 tests.
  15115. 858.67 s [vector] find: OK
  15116. 858.67 s [vector] +++ OK, passed 100 tests.
  15117. 858.67 s [vector] findIndex: OK
  15118. 858.67 s [vector] +++ OK, passed 100 tests.
  15119. 858.67 s [vector] findIndexR: OK
  15120. 858.67 s [vector] +++ OK, passed 100 tests.
  15121. 858.67 s [vector] findIndices: OK
  15122. 858.67 s [vector] +++ OK, passed 100 tests.
  15123. 858.67 s [vector] elemIndex: OK
  15124. 858.67 s [vector] +++ OK, passed 100 tests.
  15125. 858.67 s [vector] elemIndices: OK
  15126. 858.67 s [vector] +++ OK, passed 100 tests.
  15127. 858.67 s [vector] foldl: OK
  15128. 858.67 s [vector] +++ OK, passed 100 tests.
  15129. 858.68 s [vector] foldl1: OK
  15130. 858.68 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15131. 858.68 s [vector] foldl': OK
  15132. 858.68 s [vector] +++ OK, passed 100 tests.
  15133. 858.68 s [vector] foldl1': OK
  15134. 858.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15135. 858.69 s [vector] foldr: OK
  15136. 858.69 s [vector] +++ OK, passed 100 tests.
  15137. 858.69 s [vector] foldr1: OK
  15138. 858.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15139. 858.69 s [vector] foldr': OK
  15140. 858.69 s [vector] +++ OK, passed 100 tests.
  15141. 858.69 s [vector] foldr1': OK
  15142. 858.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15143. 858.70 s [vector] ifoldl: OK
  15144. 858.70 s [vector] +++ OK, passed 100 tests.
  15145. 858.70 s [vector] ifoldl': OK
  15146. 858.70 s [vector] +++ OK, passed 100 tests.
  15147. 858.70 s [vector] ifoldr: OK
  15148. 858.70 s [vector] +++ OK, passed 100 tests.
  15149. 858.71 s [vector] ifoldr': OK
  15150. 858.71 s [vector] +++ OK, passed 100 tests.
  15151. 858.71 s [vector] ifoldM: OK
  15152. 858.71 s [vector] +++ OK, passed 100 tests.
  15153. 858.71 s [vector] ifoldM': OK
  15154. 858.71 s [vector] +++ OK, passed 100 tests.
  15155. 858.74 s [vector] ifoldM_: OK (0.01s)
  15156. 858.74 s [vector] +++ OK, passed 100 tests.
  15157. 858.74 s [vector] ifoldM'_: OK (0.01s)
  15158. 858.74 s [vector] +++ OK, passed 100 tests.
  15159. 858.74 s [vector] all: OK
  15160. 858.74 s [vector] +++ OK, passed 100 tests.
  15161. 858.74 s [vector] any: OK
  15162. 858.74 s [vector] +++ OK, passed 100 tests.
  15163. 858.74 s [vector] prescanl: OK
  15164. 858.74 s [vector] +++ OK, passed 100 tests.
  15165. 858.74 s [vector] prescanl': OK
  15166. 858.74 s [vector] +++ OK, passed 100 tests.
  15167. 858.75 s [vector] postscanl: OK
  15168. 858.75 s [vector] +++ OK, passed 100 tests.
  15169. 858.75 s [vector] postscanl': OK
  15170. 858.75 s [vector] +++ OK, passed 100 tests.
  15171. 858.75 s [vector] scanl: OK
  15172. 858.75 s [vector] +++ OK, passed 100 tests.
  15173. 858.75 s [vector] scanl': OK
  15174. 858.75 s [vector] +++ OK, passed 100 tests.
  15175. 858.75 s [vector] scanl1: OK
  15176. 858.76 s [vector] +++ OK, passed 100 tests.
  15177. 858.76 s [vector] scanl1': OK
  15178. 858.76 s [vector] +++ OK, passed 100 tests.
  15179. 858.77 s [vector] iscanl: OK
  15180. 858.77 s [vector] +++ OK, passed 100 tests.
  15181. 858.77 s [vector] iscanl': OK
  15182. 858.77 s [vector] +++ OK, passed 100 tests.
  15183. 858.77 s [vector] prescanr: OK
  15184. 858.77 s [vector] +++ OK, passed 100 tests.
  15185. 858.78 s [vector] prescanr': OK
  15186. 858.78 s [vector] +++ OK, passed 100 tests.
  15187. 858.78 s [vector] postscanr: OK
  15188. 858.78 s [vector] +++ OK, passed 100 tests.
  15189. 858.79 s [vector] postscanr': OK
  15190. 858.79 s [vector] +++ OK, passed 100 tests.
  15191. 858.79 s [vector] scanr: OK
  15192. 858.79 s [vector] +++ OK, passed 100 tests.
  15193. 858.79 s [vector] scanr': OK
  15194. 858.79 s [vector] +++ OK, passed 100 tests.
  15195. 858.80 s [vector] scanr1: OK
  15196. 858.80 s [vector] +++ OK, passed 100 tests.
  15197. 858.80 s [vector] scanr1': OK
  15198. 858.80 s [vector] +++ OK, passed 100 tests.
  15199. 858.81 s [vector] iscanr: OK
  15200. 858.81 s [vector] +++ OK, passed 100 tests.
  15201. 858.81 s [vector] iscanr': OK
  15202. 858.81 s [vector] +++ OK, passed 100 tests.
  15203. 858.81 s [vector] mut_read: OK
  15204. 858.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15205. 858.81 s [vector] mut_write: OK
  15206. 858.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15207. 858.81 s [vector] mut_modify: OK
  15208. 858.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15209. 858.81 s [vector] mut_generate: OK
  15210. 858.81 s [vector] +++ OK, passed 100 tests.
  15211. 858.82 s [vector] mut_generateM: OK
  15212. 858.84 s [vector] +++ OK, passed 100 tests.
  15213. 858.85 s [vector] mut_mapM_: OK (0.02s)
  15214. 858.85 s [vector] +++ OK, passed 100 tests.
  15215. 858.85 s [vector] mut_imapM_: OK (0.02s)
  15216. 858.86 s [vector] +++ OK, passed 100 tests.
  15217. 858.88 s [vector] mut_forM_: OK (0.02s)
  15218. 858.88 s [vector] +++ OK, passed 100 tests.
  15219. 858.89 s [vector] mut_iforM_: OK (0.02s)
  15220. 858.89 s [vector] +++ OK, passed 100 tests.
  15221. 858.89 s [vector] mut_foldr: OK
  15222. 858.89 s [vector] +++ OK, passed 100 tests.
  15223. 858.90 s [vector] mut_foldr': OK
  15224. 858.90 s [vector] +++ OK, passed 100 tests.
  15225. 858.90 s [vector] mut_foldl: OK
  15226. 858.90 s [vector] +++ OK, passed 100 tests.
  15227. 858.90 s [vector] mut_foldl': OK
  15228. 858.90 s [vector] +++ OK, passed 100 tests.
  15229. 858.91 s [vector] mut_ifoldr: OK
  15230. 858.91 s [vector] +++ OK, passed 100 tests.
  15231. 858.91 s [vector] mut_ifoldr': OK
  15232. 858.91 s [vector] +++ OK, passed 100 tests.
  15233. 858.91 s [vector] mut_ifoldl: OK
  15234. 858.91 s [vector] +++ OK, passed 100 tests.
  15235. 858.91 s [vector] mut_ifoldl': OK
  15236. 858.91 s [vector] +++ OK, passed 100 tests.
  15237. 858.92 s [vector] mut_foldM: OK
  15238. 858.92 s [vector] +++ OK, passed 100 tests.
  15239. 858.92 s [vector] mut_foldM': OK
  15240. 858.92 s [vector] +++ OK, passed 100 tests.
  15241. 858.92 s [vector] mut_foldrM: OK
  15242. 858.92 s [vector] +++ OK, passed 100 tests.
  15243. 858.93 s [vector] mut_foldrM': OK
  15244. 858.93 s [vector] +++ OK, passed 100 tests.
  15245. 858.93 s [vector] mut_ifoldM: OK
  15246. 858.93 s [vector] +++ OK, passed 100 tests.
  15247. 858.93 s [vector] mut_ifoldM': OK
  15248. 858.93 s [vector] +++ OK, passed 100 tests.
  15249. 858.93 s [vector] mut_ifoldrM: OK
  15250. 858.94 s [vector] +++ OK, passed 100 tests.
  15251. 858.94 s [vector] mut_ifoldrM': OK
  15252. 858.94 s [vector] +++ OK, passed 100 tests.
  15253. 858.94 s [vector] compare: OK
  15254. 858.94 s [vector] +++ OK, passed 100 tests.
  15255. 858.94 s [vector] maximum: OK
  15256. 858.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15257. 858.94 s [vector] minimum: OK
  15258. 858.94 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15259. 858.94 s [vector] minIndex: OK
  15260. 858.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15261. 858.94 s [vector] maxIndex: OK
  15262. 858.94 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15263. 858.94 s [vector] maximumBy: OK
  15264. 858.94 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15265. 858.94 s [vector] minimumBy: OK
  15266. 858.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15267. 858.94 s [vector] maximumOn: OK
  15268. 858.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15269. 858.94 s [vector] minimumOn: OK
  15270. 858.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15271. 858.94 s [vector] maxIndexBy: OK
  15272. 858.94 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15273. 858.94 s [vector] minIndexBy: OK
  15274. 858.94 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15275. 858.94 s [vector] ListFirstMaxIndexWins: OK
  15276. 858.94 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15277. 858.94 s [vector] FalseListFirstMaxIndexWins: OK
  15278. 858.94 s [vector] +++ OK, failed as expected. (after 1 test):
  15279. 858.94 s [vector] Exception:
  15280. 858.94 s [vector] Prelude.foldr1: empty list
  15281. 858.94 s [vector] CallStack (from HasCallStack):
  15282. 858.94 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  15283. 858.94 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  15284. 858.94 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15285. 858.94 s [vector] []
  15286. 858.94 s [vector] zip: OK
  15287. 858.94 s [vector] +++ OK, passed 100 tests.
  15288. 858.95 s [vector] zip3: OK
  15289. 858.95 s [vector] +++ OK, passed 100 tests.
  15290. 858.95 s [vector] unzip: OK
  15291. 858.95 s [vector] +++ OK, passed 100 tests.
  15292. 858.95 s [vector] unzip3: OK
  15293. 858.95 s [vector] +++ OK, passed 100 tests.
  15294. 858.95 s [vector] indexed: OK
  15295. 858.95 s [vector] +++ OK, passed 100 tests.
  15296. 858.95 s [vector] update: OK
  15297. 858.95 s [vector] +++ OK, passed 100 tests.
  15298. 858.95 s [vector] mempty: OK
  15299. 858.95 s [vector] +++ OK, passed 1 test.
  15300. 858.96 s [vector] mappend: OK
  15301. 858.96 s [vector] +++ OK, passed 100 tests.
  15302. 858.97 s [vector] mconcat: OK (0.02s)
  15303. 858.97 s [vector] +++ OK, passed 100 tests.
  15304. 858.97 s [vector] glength: OK
  15305. 858.97 s [vector] +++ OK, passed 100 tests.
  15306. 858.97 s [vector] sum: OK
  15307. 858.97 s [vector] +++ OK, passed 100 tests.
  15308. 858.97 s [vector] product: OK
  15309. 858.97 s [vector] +++ OK, passed 100 tests.
  15310. 858.97 s [vector] enumFromN: OK
  15311. 858.97 s [vector] +++ OK, passed 100 tests.
  15312. 858.97 s [vector] enumFromThenN: OK
  15313. 858.97 s [vector] +++ OK, passed 100 tests.
  15314. 858.97 s [vector] enumFromTo: OK
  15315. 858.97 s [vector] +++ OK, passed 100 tests.
  15316. 858.97 s [vector] enumFromThenTo: OK
  15317. 858.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15318. 858.97 s [vector] (Float)
  15319. 858.97 s [vector] fromList.toList == id: OK
  15320. 858.97 s [vector] +++ OK, passed 100 tests.
  15321. 858.97 s [vector] toList.fromList == id: OK
  15322. 858.97 s [vector] +++ OK, passed 100 tests.
  15323. 858.97 s [vector] unstream.stream == id: OK
  15324. 858.98 s [vector] +++ OK, passed 100 tests.
  15325. 858.98 s [vector] stream.unstream == id: OK
  15326. 858.98 s [vector] +++ OK, passed 100 tests.
  15327. 858.98 s [vector] eq: OK
  15328. 858.98 s [vector] +++ OK, passed 100 tests.
  15329. 858.98 s [vector] length: OK
  15330. 858.98 s [vector] +++ OK, passed 100 tests.
  15331. 858.98 s [vector] null: OK
  15332. 858.98 s [vector] +++ OK, passed 100 tests.
  15333. 858.98 s [vector] index: OK
  15334. 858.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15335. 858.98 s [vector] safeIndex: OK
  15336. 858.98 s [vector] +++ OK, passed 100 tests.
  15337. 858.98 s [vector] head: OK
  15338. 858.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15339. 858.98 s [vector] last: OK
  15340. 858.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15341. 858.98 s [vector] unsafeIndex: OK
  15342. 858.98 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15343. 858.99 s [vector] unsafeHead: OK
  15344. 858.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15345. 858.99 s [vector] unsafeLast: OK
  15346. 858.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15347. 858.99 s [vector] slice: OK
  15348. 858.99 s [vector] +++ OK, passed 100 tests.
  15349. 858.99 s [vector] init: OK
  15350. 858.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15351. 858.99 s [vector] tail: OK
  15352. 858.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15353. 858.99 s [vector] take: OK
  15354. 858.99 s [vector] +++ OK, passed 100 tests.
  15355. 858.99 s [vector] drop: OK
  15356. 858.99 s [vector] +++ OK, passed 100 tests.
  15357. 858.99 s [vector] splitAt: OK
  15358. 858.99 s [vector] +++ OK, passed 100 tests.
  15359. 858.99 s [vector] empty: OK
  15360. 858.99 s [vector] +++ OK, passed 1 test.
  15361. 858.99 s [vector] singleton: OK
  15362. 858.99 s [vector] +++ OK, passed 100 tests.
  15363. 858.99 s [vector] replicate: OK
  15364. 858.99 s [vector] +++ OK, passed 100 tests.
  15365. 858.99 s [vector] generate: OK
  15366. 858.99 s [vector] +++ OK, passed 100 tests.
  15367. 859.00 s [vector] iterateN: OK
  15368. 859.00 s [vector] +++ OK, passed 100 tests.
  15369. 859.02 s [vector] iterateNM: OK (0.02s)
  15370. 859.02 s [vector] +++ OK, passed 100 tests.
  15371. 859.04 s [vector] generateM: OK (0.03s)
  15372. 859.04 s [vector] +++ OK, passed 100 tests.
  15373. 859.04 s [vector] replicateM: OK
  15374. 859.04 s [vector] +++ OK, passed 100 tests.
  15375. 859.04 s [vector] create: OK
  15376. 859.04 s [vector] +++ OK, passed 100 tests.
  15377. 859.04 s [vector] createT: OK
  15378. 859.04 s [vector] +++ OK, passed 100 tests.
  15379. 859.05 s [vector] unfoldr: OK
  15380. 859.05 s [vector] +++ OK, passed 100 tests.
  15381. 859.05 s [vector] unfoldrN: OK
  15382. 859.05 s [vector] +++ OK, passed 100 tests.
  15383. 859.05 s [vector] unfoldrExactN: OK
  15384. 859.05 s [vector] +++ OK, passed 100 tests.
  15385. 859.05 s [vector] unfoldrM: OK
  15386. 859.05 s [vector] +++ OK, passed 100 tests.
  15387. 859.05 s [vector] unfoldrNM: OK
  15388. 859.05 s [vector] +++ OK, passed 100 tests.
  15389. 859.07 s [vector] unfoldrExactNM: OK (0.01s)
  15390. 859.07 s [vector] +++ OK, passed 100 tests.
  15391. 859.07 s [vector] constructN: OK
  15392. 859.07 s [vector] +++ OK, passed 100 tests.
  15393. 859.08 s [vector] constructrN: OK
  15394. 859.08 s [vector] +++ OK, passed 100 tests.
  15395. 859.08 s [vector] cons: OK
  15396. 859.08 s [vector] +++ OK, passed 100 tests.
  15397. 859.08 s [vector] snoc: OK
  15398. 859.08 s [vector] +++ OK, passed 100 tests.
  15399. 859.10 s [vector] append: OK
  15400. 859.10 s [vector] +++ OK, passed 100 tests.
  15401. 859.11 s [vector] concat: OK (0.02s)
  15402. 859.11 s [vector] +++ OK, passed 100 tests.
  15403. 859.11 s [vector] force: OK
  15404. 859.11 s [vector] +++ OK, passed 100 tests.
  15405. 859.11 s [vector] upd: OK
  15406. 859.12 s [vector] +++ OK, passed 100 tests.
  15407. 859.12 s [vector] accum: OK
  15408. 859.12 s [vector] +++ OK, passed 100 tests.
  15409. 859.12 s [vector] reverse: OK
  15410. 859.12 s [vector] +++ OK, passed 100 tests.
  15411. 859.12 s [vector] backpermute: OK
  15412. 859.12 s [vector] +++ OK, passed 100 tests.
  15413. 859.13 s [vector] map: OK
  15414. 859.13 s [vector] +++ OK, passed 100 tests.
  15415. 859.13 s [vector] imap: OK
  15416. 859.13 s [vector] +++ OK, passed 100 tests.
  15417. 859.13 s [vector] concatMap: OK
  15418. 859.14 s [vector] +++ OK, passed 100 tests.
  15419. 859.15 s [vector] mapM: OK
  15420. 859.16 s [vector] +++ OK, passed 100 tests.
  15421. 859.18 s [vector] mapM_: OK (0.03s)
  15422. 859.18 s [vector] +++ OK, passed 100 tests.
  15423. 859.20 s [vector] forM: OK (0.01s)
  15424. 859.20 s [vector] +++ OK, passed 100 tests.
  15425. 859.24 s [vector] forM_: OK (0.05s)
  15426. 859.24 s [vector] +++ OK, passed 100 tests.
  15427. 859.26 s [vector] imapM: OK
  15428. 859.26 s [vector] +++ OK, passed 100 tests.
  15429. 859.27 s [vector] imapM_: OK (0.03s)
  15430. 859.28 s [vector] +++ OK, passed 100 tests.
  15431. 859.29 s [vector] zipWith: OK (0.01s)
  15432. 859.29 s [vector] +++ OK, passed 100 tests.
  15433. 859.29 s [vector] zipWith3: OK
  15434. 859.29 s [vector] +++ OK, passed 100 tests.
  15435. 859.30 s [vector] izipWith: OK
  15436. 859.30 s [vector] +++ OK, passed 100 tests.
  15437. 859.30 s [vector] izipWith3: OK
  15438. 859.31 s [vector] +++ OK, passed 100 tests.
  15439. 859.31 s [vector] izipWithM: OK
  15440. 859.31 s [vector] +++ OK, passed 100 tests.
  15441. 859.33 s [vector] izipWithM_: OK (0.02s)
  15442. 859.33 s [vector] +++ OK, passed 100 tests.
  15443. 859.34 s [vector] zipWithM: OK
  15444. 859.36 s [vector] +++ OK, passed 100 tests.
  15445. 859.37 s [vector] zipWithM_: OK (0.02s)
  15446. 859.37 s [vector] +++ OK, passed 100 tests.
  15447. 859.38 s [vector] filter: OK
  15448. 859.38 s [vector] +++ OK, passed 100 tests.
  15449. 859.39 s [vector] ifilter: OK (0.01s)
  15450. 859.82 s [vector] +++ OK, passed 100 tests.
  15451. 859.82 s [vector] filterM: OK (0.04s)
  15452. 859.82 s [vector] +++ OK, passed 100 tests.
  15453. 859.83 s [vector] uniq: OK
  15454. 859.83 s [vector] +++ OK, passed 100 tests.
  15455. 859.83 s [vector] mapMaybe: OK
  15456. 859.83 s [vector] +++ OK, passed 100 tests.
  15457. 859.83 s [vector] imapMaybe: OK
  15458. 859.83 s [vector] +++ OK, passed 100 tests.
  15459. 859.83 s [vector] takeWhile: OK
  15460. 859.83 s [vector] +++ OK, passed 100 tests.
  15461. 859.83 s [vector] dropWhile: OK
  15462. 859.83 s [vector] +++ OK, passed 100 tests.
  15463. 859.83 s [vector] partition: OK
  15464. 859.83 s [vector] +++ OK, passed 100 tests.
  15465. 859.83 s [vector] partitionWith: OK
  15466. 859.83 s [vector] +++ OK, passed 100 tests.
  15467. 859.83 s [vector] span: OK
  15468. 859.83 s [vector] +++ OK, passed 100 tests.
  15469. 859.83 s [vector] break: OK
  15470. 859.83 s [vector] +++ OK, passed 100 tests.
  15471. 859.83 s [vector] spanR: OK
  15472. 859.83 s [vector] +++ OK, passed 100 tests.
  15473. 859.83 s [vector] breakR: OK
  15474. 859.83 s [vector] +++ OK, passed 100 tests.
  15475. 859.83 s [vector] groupBy: OK
  15476. 859.83 s [vector] +++ OK, passed 100 tests.
  15477. 859.83 s [vector] elem: OK
  15478. 859.83 s [vector] +++ OK, passed 100 tests.
  15479. 859.83 s [vector] notElem: OK
  15480. 859.83 s [vector] +++ OK, passed 100 tests.
  15481. 859.83 s [vector] find: OK
  15482. 859.83 s [vector] +++ OK, passed 100 tests.
  15483. 859.83 s [vector] findIndex: OK
  15484. 859.83 s [vector] +++ OK, passed 100 tests.
  15485. 859.83 s [vector] findIndexR: OK
  15486. 859.83 s [vector] +++ OK, passed 100 tests.
  15487. 859.83 s [vector] findIndices: OK
  15488. 859.83 s [vector] +++ OK, passed 100 tests.
  15489. 859.83 s [vector] elemIndex: OK
  15490. 859.83 s [vector] +++ OK, passed 100 tests.
  15491. 859.83 s [vector] elemIndices: OK
  15492. 859.83 s [vector] +++ OK, passed 100 tests.
  15493. 859.83 s [vector] foldl: OK
  15494. 859.83 s [vector] +++ OK, passed 100 tests.
  15495. 859.83 s [vector] foldl1: OK
  15496. 859.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15497. 859.83 s [vector] foldl': OK
  15498. 859.83 s [vector] +++ OK, passed 100 tests.
  15499. 859.83 s [vector] foldl1': OK
  15500. 859.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15501. 859.83 s [vector] foldr: OK
  15502. 859.83 s [vector] +++ OK, passed 100 tests.
  15503. 859.83 s [vector] foldr1: OK
  15504. 859.83 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15505. 859.83 s [vector] foldr': OK
  15506. 859.83 s [vector] +++ OK, passed 100 tests.
  15507. 859.83 s [vector] foldr1': OK
  15508. 859.83 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15509. 859.83 s [vector] ifoldl: OK
  15510. 859.83 s [vector] +++ OK, passed 100 tests.
  15511. 859.83 s [vector] ifoldl': OK
  15512. 859.83 s [vector] +++ OK, passed 100 tests.
  15513. 859.83 s [vector] ifoldr: OK
  15514. 859.83 s [vector] +++ OK, passed 100 tests.
  15515. 859.83 s [vector] ifoldr': OK
  15516. 859.83 s [vector] +++ OK, passed 100 tests.
  15517. 859.83 s [vector] ifoldM: OK
  15518. 859.83 s [vector] +++ OK, passed 100 tests.
  15519. 859.83 s [vector] ifoldM': OK
  15520. 859.83 s [vector] +++ OK, passed 100 tests.
  15521. 859.83 s [vector] ifoldM_: OK (0.03s)
  15522. 859.83 s [vector] +++ OK, passed 100 tests.
  15523. 859.83 s [vector] ifoldM'_: OK (0.03s)
  15524. 859.83 s [vector] +++ OK, passed 100 tests.
  15525. 859.83 s [vector] all: OK
  15526. 859.83 s [vector] +++ OK, passed 100 tests.
  15527. 859.83 s [vector] any: OK
  15528. 859.83 s [vector] +++ OK, passed 100 tests.
  15529. 859.83 s [vector] prescanl: OK
  15530. 859.83 s [vector] +++ OK, passed 100 tests.
  15531. 859.83 s [vector] prescanl': OK (0.01s)
  15532. 859.83 s [vector] +++ OK, passed 100 tests.
  15533. 859.83 s [vector] postscanl: OK
  15534. 859.83 s [vector] +++ OK, passed 100 tests.
  15535. 859.83 s [vector] postscanl': OK
  15536. 859.83 s [vector] +++ OK, passed 100 tests.
  15537. 859.83 s [vector] scanl: OK
  15538. 859.83 s [vector] +++ OK, passed 100 tests.
  15539. 859.83 s [vector] scanl': OK
  15540. 859.83 s [vector] +++ OK, passed 100 tests.
  15541. 859.83 s [vector] scanl1: OK
  15542. 859.83 s [vector] +++ OK, passed 100 tests.
  15543. 859.83 s [vector] scanl1': OK
  15544. 859.83 s [vector] +++ OK, passed 100 tests.
  15545. 859.83 s [vector] iscanl: OK
  15546. 859.83 s [vector] +++ OK, passed 100 tests.
  15547. 859.83 s [vector] iscanl': OK
  15548. 859.83 s [vector] +++ OK, passed 100 tests.
  15549. 859.83 s [vector] prescanr: OK
  15550. 859.83 s [vector] +++ OK, passed 100 tests.
  15551. 859.83 s [vector] prescanr': OK
  15552. 859.83 s [vector] +++ OK, passed 100 tests.
  15553. 859.83 s [vector] postscanr: OK
  15554. 859.83 s [vector] +++ OK, passed 100 tests.
  15555. 859.83 s [vector] postscanr': OK
  15556. 859.83 s [vector] +++ OK, passed 100 tests.
  15557. 859.83 s [vector] scanr: OK
  15558. 859.83 s [vector] +++ OK, passed 100 tests.
  15559. 859.83 s [vector] scanr': OK
  15560. 859.83 s [vector] +++ OK, passed 100 tests.
  15561. 859.83 s [vector] scanr1: OK
  15562. 859.83 s [vector] +++ OK, passed 100 tests.
  15563. 859.83 s [vector] scanr1': OK
  15564. 859.83 s [vector] +++ OK, passed 100 tests.
  15565. 859.83 s [vector] iscanr: OK
  15566. 859.83 s [vector] +++ OK, passed 100 tests.
  15567. 859.83 s [vector] iscanr': OK
  15568. 859.83 s [vector] +++ OK, passed 100 tests.
  15569. 859.83 s [vector] mut_read: OK
  15570. 859.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15571. 859.83 s [vector] mut_write: OK
  15572. 859.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15573. 859.83 s [vector] mut_modify: OK
  15574. 859.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15575. 859.83 s [vector] mut_generate: OK
  15576. 859.83 s [vector] +++ OK, passed 100 tests.
  15577. 859.86 s [vector] mut_generateM: OK (0.02s)
  15578. 859.86 s [vector] +++ OK, passed 100 tests.
  15579. 859.89 s [vector] mut_mapM_: OK (0.03s)
  15580. 859.89 s [vector] +++ OK, passed 100 tests.
  15581. 859.92 s [vector] mut_imapM_: OK (0.03s)
  15582. 859.92 s [vector] +++ OK, passed 100 tests.
  15583. 859.96 s [vector] mut_forM_: OK (0.03s)
  15584. 859.96 s [vector] +++ OK, passed 100 tests.
  15585. 859.98 s [vector] mut_iforM_: OK (0.03s)
  15586. 859.98 s [vector] +++ OK, passed 100 tests.
  15587. 859.98 s [vector] mut_foldr: OK
  15588. 859.99 s [vector] +++ OK, passed 100 tests.
  15589. 859.99 s [vector] mut_foldr': OK
  15590. 859.99 s [vector] +++ OK, passed 100 tests.
  15591. 859.99 s [vector] mut_foldl: OK
  15592. 859.99 s [vector] +++ OK, passed 100 tests.
  15593. 860.01 s [vector] mut_foldl': OK
  15594. 860.01 s [vector] +++ OK, passed 100 tests.
  15595. 860.04 s [vector] mut_ifoldr: OK (0.01s)
  15596. 860.04 s [vector] +++ OK, passed 100 tests.
  15597. 860.04 s [vector] mut_ifoldr': OK (0.02s)
  15598. 860.04 s [vector] +++ OK, passed 100 tests.
  15599. 860.05 s [vector] mut_ifoldl: OK (0.01s)
  15600. 860.05 s [vector] +++ OK, passed 100 tests.
  15601. 860.05 s [vector] mut_ifoldl': OK
  15602. 860.05 s [vector] +++ OK, passed 100 tests.
  15603. 860.07 s [vector] mut_foldM: OK
  15604. 860.07 s [vector] +++ OK, passed 100 tests.
  15605. 860.07 s [vector] mut_foldM': OK
  15606. 860.08 s [vector] +++ OK, passed 100 tests.
  15607. 860.08 s [vector] mut_foldrM: OK
  15608. 860.08 s [vector] +++ OK, passed 100 tests.
  15609. 860.08 s [vector] mut_foldrM': OK
  15610. 860.09 s [vector] +++ OK, passed 100 tests.
  15611. 860.10 s [vector] mut_ifoldM: OK
  15612. 860.10 s [vector] +++ OK, passed 100 tests.
  15613. 860.10 s [vector] mut_ifoldM': OK
  15614. 860.11 s [vector] +++ OK, passed 100 tests.
  15615. 860.11 s [vector] mut_ifoldrM: OK
  15616. 860.11 s [vector] +++ OK, passed 100 tests.
  15617. 860.12 s [vector] mut_ifoldrM': OK
  15618. 860.12 s [vector] +++ OK, passed 100 tests.
  15619. 860.12 s [vector] compare: OK
  15620. 860.12 s [vector] +++ OK, passed 100 tests.
  15621. 860.12 s [vector] maximum: OK
  15622. 860.12 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15623. 860.12 s [vector] minimum: OK
  15624. 860.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15625. 860.12 s [vector] minIndex: OK
  15626. 860.12 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15627. 860.12 s [vector] maxIndex: OK
  15628. 860.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15629. 860.12 s [vector] maximumBy: OK
  15630. 860.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15631. 860.13 s [vector] minimumBy: OK
  15632. 860.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15633. 860.13 s [vector] maximumOn: OK
  15634. 860.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15635. 860.13 s [vector] minimumOn: OK
  15636. 860.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15637. 860.13 s [vector] maxIndexBy: OK
  15638. 860.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15639. 860.13 s [vector] minIndexBy: OK
  15640. 860.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15641. 860.13 s [vector] ListFirstMaxIndexWins: OK
  15642. 860.13 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15643. 860.13 s [vector] FalseListFirstMaxIndexWins: OK
  15644. 860.13 s [vector] +++ OK, failed as expected. (after 1 test):
  15645. 860.13 s [vector] Exception:
  15646. 860.13 s [vector] Prelude.foldr1: empty list
  15647. 860.13 s [vector] CallStack (from HasCallStack):
  15648. 860.13 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  15649. 860.13 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  15650. 860.13 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15651. 860.13 s [vector] []
  15652. 860.13 s [vector] zip: OK
  15653. 860.13 s [vector] +++ OK, passed 100 tests.
  15654. 860.13 s [vector] zip3: OK
  15655. 860.14 s [vector] +++ OK, passed 100 tests.
  15656. 860.14 s [vector] unzip: OK
  15657. 860.14 s [vector] +++ OK, passed 100 tests.
  15658. 860.14 s [vector] unzip3: OK
  15659. 860.14 s [vector] +++ OK, passed 100 tests.
  15660. 860.14 s [vector] indexed: OK
  15661. 860.14 s [vector] +++ OK, passed 100 tests.
  15662. 860.14 s [vector] update: OK
  15663. 860.14 s [vector] +++ OK, passed 100 tests.
  15664. 860.14 s [vector] mempty: OK
  15665. 860.14 s [vector] +++ OK, passed 1 test.
  15666. 860.14 s [vector] mappend: OK
  15667. 860.15 s [vector] +++ OK, passed 100 tests.
  15668. 860.17 s [vector] mconcat: OK (0.02s)
  15669. 860.17 s [vector] +++ OK, passed 100 tests.
  15670. 860.17 s [vector] glength: OK
  15671. 860.17 s [vector] +++ OK, passed 100 tests.
  15672. 860.17 s [vector] sum: OK
  15673. 860.17 s [vector] +++ OK, passed 100 tests.
  15674. 860.17 s [vector] product: OK
  15675. 860.17 s [vector] +++ OK, passed 100 tests.
  15676. 860.17 s [vector] enumFromN: OK
  15677. 860.17 s [vector] +++ OK, passed 100 tests.
  15678. 860.17 s [vector] enumFromThenN: OK
  15679. 860.17 s [vector] +++ OK, passed 100 tests.
  15680. 860.17 s [vector] enumFromTo: OK
  15681. 860.17 s [vector] +++ OK, passed 100 tests.
  15682. 860.17 s [vector] enumFromThenTo: OK
  15683. 860.17 s [vector] +++ OK, passed 100 tests; 2 discarded.
  15684. 860.17 s [vector] (Double)
  15685. 860.18 s [vector] fromList.toList == id: OK
  15686. 860.18 s [vector] +++ OK, passed 100 tests.
  15687. 860.18 s [vector] toList.fromList == id: OK
  15688. 860.18 s [vector] +++ OK, passed 100 tests.
  15689. 860.18 s [vector] unstream.stream == id: OK
  15690. 860.18 s [vector] +++ OK, passed 100 tests.
  15691. 860.18 s [vector] stream.unstream == id: OK
  15692. 860.18 s [vector] +++ OK, passed 100 tests.
  15693. 860.18 s [vector] eq: OK
  15694. 860.18 s [vector] +++ OK, passed 100 tests.
  15695. 860.18 s [vector] length: OK
  15696. 860.18 s [vector] +++ OK, passed 100 tests.
  15697. 860.18 s [vector] null: OK
  15698. 860.18 s [vector] +++ OK, passed 100 tests.
  15699. 860.18 s [vector] index: OK
  15700. 860.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15701. 860.18 s [vector] safeIndex: OK
  15702. 860.19 s [vector] +++ OK, passed 100 tests.
  15703. 860.19 s [vector] head: OK
  15704. 860.19 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15705. 860.19 s [vector] last: OK
  15706. 860.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15707. 860.19 s [vector] unsafeIndex: OK
  15708. 860.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15709. 860.19 s [vector] unsafeHead: OK
  15710. 860.19 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15711. 860.19 s [vector] unsafeLast: OK
  15712. 860.19 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15713. 860.19 s [vector] slice: OK
  15714. 860.19 s [vector] +++ OK, passed 100 tests.
  15715. 860.19 s [vector] init: OK
  15716. 860.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15717. 860.20 s [vector] tail: OK
  15718. 860.20 s [vector] +++ OK, passed 100 tests; 24 discarded.
  15719. 860.20 s [vector] take: OK
  15720. 860.20 s [vector] +++ OK, passed 100 tests.
  15721. 860.20 s [vector] drop: OK
  15722. 860.20 s [vector] +++ OK, passed 100 tests.
  15723. 860.20 s [vector] splitAt: OK
  15724. 860.20 s [vector] +++ OK, passed 100 tests.
  15725. 860.20 s [vector] empty: OK
  15726. 860.20 s [vector] +++ OK, passed 1 test.
  15727. 860.20 s [vector] singleton: OK
  15728. 860.20 s [vector] +++ OK, passed 100 tests.
  15729. 860.20 s [vector] replicate: OK
  15730. 860.20 s [vector] +++ OK, passed 100 tests.
  15731. 860.20 s [vector] generate: OK
  15732. 860.20 s [vector] +++ OK, passed 100 tests.
  15733. 860.21 s [vector] iterateN: OK
  15734. 860.22 s [vector] +++ OK, passed 100 tests.
  15735. 860.26 s [vector] iterateNM: OK (0.04s)
  15736. 860.26 s [vector] +++ OK, passed 100 tests.
  15737. 860.28 s [vector] generateM: OK (0.02s)
  15738. 860.28 s [vector] +++ OK, passed 100 tests.
  15739. 860.28 s [vector] replicateM: OK
  15740. 860.28 s [vector] +++ OK, passed 100 tests.
  15741. 860.28 s [vector] create: OK
  15742. 860.28 s [vector] +++ OK, passed 100 tests.
  15743. 860.28 s [vector] createT: OK
  15744. 860.28 s [vector] +++ OK, passed 100 tests.
  15745. 860.28 s [vector] unfoldr: OK
  15746. 860.28 s [vector] +++ OK, passed 100 tests.
  15747. 860.28 s [vector] unfoldrN: OK
  15748. 860.28 s [vector] +++ OK, passed 100 tests.
  15749. 860.28 s [vector] unfoldrExactN: OK
  15750. 860.28 s [vector] +++ OK, passed 100 tests.
  15751. 860.28 s [vector] unfoldrM: OK
  15752. 860.30 s [vector] +++ OK, passed 100 tests.
  15753. 860.31 s [vector] unfoldrNM: OK (0.01s)
  15754. 860.31 s [vector] +++ OK, passed 100 tests.
  15755. 860.32 s [vector] unfoldrExactNM: OK (0.02s)
  15756. 860.32 s [vector] +++ OK, passed 100 tests.
  15757. 860.34 s [vector] constructN: OK (0.01s)
  15758. 860.34 s [vector] +++ OK, passed 100 tests.
  15759. 860.34 s [vector] constructrN: OK (0.02s)
  15760. 860.35 s [vector] +++ OK, passed 100 tests.
  15761. 860.35 s [vector] cons: OK
  15762. 860.35 s [vector] +++ OK, passed 100 tests.
  15763. 860.35 s [vector] snoc: OK
  15764. 860.35 s [vector] +++ OK, passed 100 tests.
  15765. 860.36 s [vector] append: OK
  15766. 860.36 s [vector] +++ OK, passed 100 tests.
  15767. 860.37 s [vector] concat: OK (0.02s)
  15768. 860.37 s [vector] +++ OK, passed 100 tests.
  15769. 860.37 s [vector] force: OK
  15770. 860.37 s [vector] +++ OK, passed 100 tests.
  15771. 860.37 s [vector] upd: OK
  15772. 860.38 s [vector] +++ OK, passed 100 tests.
  15773. 860.39 s [vector] accum: OK (0.01s)
  15774. 860.39 s [vector] +++ OK, passed 100 tests.
  15775. 860.39 s [vector] reverse: OK
  15776. 860.39 s [vector] +++ OK, passed 100 tests.
  15777. 860.39 s [vector] backpermute: OK
  15778. 860.39 s [vector] +++ OK, passed 100 tests.
  15779. 860.40 s [vector] map: OK
  15780. 860.41 s [vector] +++ OK, passed 100 tests.
  15781. 860.42 s [vector] imap: OK
  15782. 860.42 s [vector] +++ OK, passed 100 tests.
  15783. 860.43 s [vector] concatMap: OK (0.01s)
  15784. 860.43 s [vector] +++ OK, passed 100 tests.
  15785. 860.44 s [vector] mapM: OK
  15786. 860.44 s [vector] +++ OK, passed 100 tests.
  15787. 860.47 s [vector] mapM_: OK (0.03s)
  15788. 860.48 s [vector] +++ OK, passed 100 tests.
  15789. 860.48 s [vector] forM: OK
  15790. 860.48 s [vector] +++ OK, passed 100 tests.
  15791. 860.52 s [vector] forM_: OK (0.03s)
  15792. 860.52 s [vector] +++ OK, passed 100 tests.
  15793. 860.54 s [vector] imapM: OK
  15794. 860.54 s [vector] +++ OK, passed 100 tests.
  15795. 860.56 s [vector] imapM_: OK (0.04s)
  15796. 860.56 s [vector] +++ OK, passed 100 tests.
  15797. 860.58 s [vector] zipWith: OK (0.01s)
  15798. 860.58 s [vector] +++ OK, passed 100 tests.
  15799. 860.58 s [vector] zipWith3: OK (0.01s)
  15800. 860.59 s [vector] +++ OK, passed 100 tests.
  15801. 860.60 s [vector] izipWith: OK
  15802. 860.60 s [vector] +++ OK, passed 100 tests.
  15803. 860.61 s [vector] izipWith3: OK (0.01s)
  15804. 860.61 s [vector] +++ OK, passed 100 tests.
  15805. 860.62 s [vector] izipWithM: OK
  15806. 860.62 s [vector] +++ OK, passed 100 tests.
  15807. 860.65 s [vector] izipWithM_: OK (0.03s)
  15808. 860.65 s [vector] +++ OK, passed 100 tests.
  15809. 860.65 s [vector] zipWithM: OK
  15810. 860.65 s [vector] +++ OK, passed 100 tests.
  15811. 860.68 s [vector] zipWithM_: OK (0.02s)
  15812. 860.68 s [vector] +++ OK, passed 100 tests.
  15813. 860.69 s [vector] filter: OK
  15814. 860.70 s [vector] +++ OK, passed 100 tests.
  15815. 860.70 s [vector] ifilter: OK
  15816. 860.70 s [vector] +++ OK, passed 100 tests.
  15817. 860.74 s [vector] filterM: OK (0.05s)
  15818. 860.74 s [vector] +++ OK, passed 100 tests.
  15819. 860.75 s [vector] uniq: OK
  15820. 860.75 s [vector] +++ OK, passed 100 tests.
  15821. 860.75 s [vector] mapMaybe: OK
  15822. 860.75 s [vector] +++ OK, passed 100 tests.
  15823. 860.76 s [vector] imapMaybe: OK
  15824. 860.76 s [vector] +++ OK, passed 100 tests.
  15825. 860.76 s [vector] takeWhile: OK
  15826. 860.76 s [vector] +++ OK, passed 100 tests.
  15827. 860.77 s [vector] dropWhile: OK
  15828. 860.77 s [vector] +++ OK, passed 100 tests.
  15829. 860.77 s [vector] partition: OK
  15830. 860.78 s [vector] +++ OK, passed 100 tests.
  15831. 860.78 s [vector] partitionWith: OK
  15832. 860.78 s [vector] +++ OK, passed 100 tests.
  15833. 860.78 s [vector] span: OK
  15834. 860.78 s [vector] +++ OK, passed 100 tests.
  15835. 860.78 s [vector] break: OK
  15836. 860.78 s [vector] +++ OK, passed 100 tests.
  15837. 860.78 s [vector] spanR: OK
  15838. 860.78 s [vector] +++ OK, passed 100 tests.
  15839. 860.78 s [vector] breakR: OK
  15840. 860.80 s [vector] +++ OK, passed 100 tests.
  15841. 860.80 s [vector] groupBy: OK (0.01s)
  15842. 860.80 s [vector] +++ OK, passed 100 tests.
  15843. 860.80 s [vector] elem: OK
  15844. 860.80 s [vector] +++ OK, passed 100 tests.
  15845. 860.80 s [vector] notElem: OK
  15846. 860.80 s [vector] +++ OK, passed 100 tests.
  15847. 860.80 s [vector] find: OK
  15848. 860.80 s [vector] +++ OK, passed 100 tests.
  15849. 860.80 s [vector] findIndex: OK
  15850. 860.80 s [vector] +++ OK, passed 100 tests.
  15851. 860.80 s [vector] findIndexR: OK
  15852. 860.81 s [vector] +++ OK, passed 100 tests.
  15853. 860.81 s [vector] findIndices: OK
  15854. 860.81 s [vector] +++ OK, passed 100 tests.
  15855. 860.81 s [vector] elemIndex: OK
  15856. 860.81 s [vector] +++ OK, passed 100 tests.
  15857. 860.82 s [vector] elemIndices: OK
  15858. 860.82 s [vector] +++ OK, passed 100 tests.
  15859. 860.84 s [vector] foldl: OK (0.01s)
  15860. 860.84 s [vector] +++ OK, passed 100 tests.
  15861. 860.85 s [vector] foldl1: OK (0.01s)
  15862. 860.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15863. 860.86 s [vector] foldl': OK (0.01s)
  15864. 860.86 s [vector] +++ OK, passed 100 tests.
  15865. 860.87 s [vector] foldl1': OK (0.01s)
  15866. 860.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15867. 860.90 s [vector] foldr: OK (0.02s)
  15868. 860.90 s [vector] +++ OK, passed 100 tests.
  15869. 860.91 s [vector] foldr1: OK (0.01s)
  15870. 860.91 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15871. 860.91 s [vector] foldr': OK (0.02s)
  15872. 860.91 s [vector] +++ OK, passed 100 tests.
  15873. 860.94 s [vector] foldr1': OK (0.01s)
  15874. 860.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15875. 860.97 s [vector] ifoldl: OK (0.02s)
  15876. 860.97 s [vector] +++ OK, passed 100 tests.
  15877. 860.97 s [vector] ifoldl': OK (0.01s)
  15878. 860.97 s [vector] +++ OK, passed 100 tests.
  15879. 860.97 s [vector] ifoldr: OK (0.01s)
  15880. 860.97 s [vector] +++ OK, passed 100 tests.
  15881. 860.99 s [vector] ifoldr': OK (0.01s)
  15882. 861.00 s [vector] +++ OK, passed 100 tests.
  15883. 861.01 s [vector] ifoldM: OK (0.02s)
  15884. 861.01 s [vector] +++ OK, passed 100 tests.
  15885. 861.01 s [vector] ifoldM': OK (0.01s)
  15886. 861.01 s [vector] +++ OK, passed 100 tests.
  15887. 861.06 s [vector] ifoldM_: OK (0.04s)
  15888. 861.06 s [vector] +++ OK, passed 100 tests.
  15889. 861.09 s [vector] ifoldM'_: OK (0.04s)
  15890. 861.09 s [vector] +++ OK, passed 100 tests.
  15891. 861.09 s [vector] all: OK
  15892. 861.09 s [vector] +++ OK, passed 100 tests.
  15893. 861.09 s [vector] any: OK
  15894. 861.09 s [vector] +++ OK, passed 100 tests.
  15895. 861.12 s [vector] prescanl: OK (0.01s)
  15896. 861.12 s [vector] +++ OK, passed 100 tests.
  15897. 861.14 s [vector] prescanl': OK (0.02s)
  15898. 861.14 s [vector] +++ OK, passed 100 tests.
  15899. 861.15 s [vector] postscanl: OK (0.02s)
  15900. 861.15 s [vector] +++ OK, passed 100 tests.
  15901. 861.16 s [vector] postscanl': OK (0.02s)
  15902. 861.16 s [vector] +++ OK, passed 100 tests.
  15903. 861.18 s [vector] scanl: OK (0.02s)
  15904. 861.18 s [vector] +++ OK, passed 100 tests.
  15905. 861.20 s [vector] scanl': OK (0.02s)
  15906. 861.20 s [vector] +++ OK, passed 100 tests.
  15907. 861.21 s [vector] scanl1: OK (0.01s)
  15908. 861.21 s [vector] +++ OK, passed 100 tests.
  15909. 861.22 s [vector] scanl1': OK (0.02s)
  15910. 861.22 s [vector] +++ OK, passed 100 tests.
  15911. 861.24 s [vector] iscanl: OK (0.02s)
  15912. 861.24 s [vector] +++ OK, passed 100 tests.
  15913. 861.26 s [vector] iscanl': OK (0.02s)
  15914. 861.26 s [vector] +++ OK, passed 100 tests.
  15915. 861.27 s [vector] prescanr: OK (0.02s)
  15916. 861.27 s [vector] +++ OK, passed 100 tests.
  15917. 861.29 s [vector] prescanr': OK (0.02s)
  15918. 861.29 s [vector] +++ OK, passed 100 tests.
  15919. 861.29 s [vector] postscanr: OK (0.01s)
  15920. 861.29 s [vector] +++ OK, passed 100 tests.
  15921. 861.31 s [vector] postscanr': OK
  15922. 861.31 s [vector] +++ OK, passed 100 tests.
  15923. 861.34 s [vector] scanr: OK (0.02s)
  15924. 861.34 s [vector] +++ OK, passed 100 tests.
  15925. 861.34 s [vector] scanr': OK (0.02s)
  15926. 861.34 s [vector] +++ OK, passed 100 tests.
  15927. 861.35 s [vector] scanr1: OK (0.01s)
  15928. 861.35 s [vector] +++ OK, passed 100 tests.
  15929. 861.38 s [vector] scanr1': OK (0.02s)
  15930. 861.38 s [vector] +++ OK, passed 100 tests.
  15931. 861.39 s [vector] iscanr: OK (0.02s)
  15932. 861.39 s [vector] +++ OK, passed 100 tests.
  15933. 861.40 s [vector] iscanr': OK (0.01s)
  15934. 861.40 s [vector] +++ OK, passed 100 tests.
  15935. 861.40 s [vector] mut_read: OK
  15936. 861.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15937. 861.40 s [vector] mut_write: OK
  15938. 861.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15939. 861.40 s [vector] mut_modify: OK
  15940. 861.40 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15941. 861.40 s [vector] mut_generate: OK
  15942. 861.41 s [vector] +++ OK, passed 100 tests.
  15943. 861.43 s [vector] mut_generateM: OK (0.01s)
  15944. 861.43 s [vector] +++ OK, passed 100 tests.
  15945. 861.47 s [vector] mut_mapM_: OK (0.03s)
  15946. 861.47 s [vector] +++ OK, passed 100 tests.
  15947. 861.49 s [vector] mut_imapM_: OK (0.03s)
  15948. 861.49 s [vector] +++ OK, passed 100 tests.
  15949. 861.53 s [vector] mut_forM_: OK (0.03s)
  15950. 861.53 s [vector] +++ OK, passed 100 tests.
  15951. 861.56 s [vector] mut_iforM_: OK (0.03s)
  15952. 861.56 s [vector] +++ OK, passed 100 tests.
  15953. 861.56 s [vector] mut_foldr: OK (0.01s)
  15954. 861.56 s [vector] +++ OK, passed 100 tests.
  15955. 861.58 s [vector] mut_foldr': OK (0.01s)
  15956. 861.58 s [vector] +++ OK, passed 100 tests.
  15957. 861.60 s [vector] mut_foldl: OK (0.02s)
  15958. 861.61 s [vector] +++ OK, passed 100 tests.
  15959. 861.62 s [vector] mut_foldl': OK (0.02s)
  15960. 861.62 s [vector] +++ OK, passed 100 tests.
  15961. 861.62 s [vector] mut_ifoldr: OK (0.01s)
  15962. 861.62 s [vector] +++ OK, passed 100 tests.
  15963. 861.63 s [vector] mut_ifoldr': OK (0.01s)
  15964. 861.64 s [vector] +++ OK, passed 100 tests.
  15965. 861.66 s [vector] mut_ifoldl: OK (0.02s)
  15966. 861.66 s [vector] +++ OK, passed 100 tests.
  15967. 861.68 s [vector] mut_ifoldl': OK (0.01s)
  15968. 861.68 s [vector] +++ OK, passed 100 tests.
  15969. 861.68 s [vector] mut_foldM: OK (0.02s)
  15970. 861.68 s [vector] +++ OK, passed 100 tests.
  15971. 861.71 s [vector] mut_foldM': OK (0.01s)
  15972. 861.71 s [vector] +++ OK, passed 100 tests.
  15973. 861.73 s [vector] mut_foldrM: OK (0.02s)
  15974. 861.73 s [vector] +++ OK, passed 100 tests.
  15975. 861.73 s [vector] mut_foldrM': OK (0.02s)
  15976. 861.73 s [vector] +++ OK, passed 100 tests.
  15977. 861.75 s [vector] mut_ifoldM: OK (0.02s)
  15978. 861.75 s [vector] +++ OK, passed 100 tests.
  15979. 861.77 s [vector] mut_ifoldM': OK (0.02s)
  15980. 861.77 s [vector] +++ OK, passed 100 tests.
  15981. 861.79 s [vector] mut_ifoldrM: OK (0.02s)
  15982. 861.79 s [vector] +++ OK, passed 100 tests.
  15983. 861.79 s [vector] mut_ifoldrM': OK (0.02s)
  15984. 861.79 s [vector] +++ OK, passed 100 tests.
  15985. 861.79 s [vector] compare: OK
  15986. 861.79 s [vector] +++ OK, passed 100 tests.
  15987. 861.79 s [vector] maximum: OK
  15988. 861.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15989. 861.79 s [vector] minimum: OK
  15990. 861.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15991. 861.79 s [vector] minIndex: OK
  15992. 861.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15993. 861.80 s [vector] maxIndex: OK
  15994. 861.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15995. 861.80 s [vector] maximumBy: OK
  15996. 861.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15997. 861.80 s [vector] minimumBy: OK
  15998. 861.80 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15999. 861.80 s [vector] maximumOn: OK
  16000. 861.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16001. 861.80 s [vector] minimumOn: OK
  16002. 861.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16003. 861.80 s [vector] maxIndexBy: OK
  16004. 861.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16005. 861.80 s [vector] minIndexBy: OK
  16006. 861.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16007. 861.80 s [vector] ListFirstMaxIndexWins: OK
  16008. 861.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16009. 861.80 s [vector] FalseListFirstMaxIndexWins: OK
  16010. 861.80 s [vector] +++ OK, failed as expected. (after 1 test):
  16011. 861.80 s [vector] Exception:
  16012. 861.80 s [vector] Prelude.foldr1: empty list
  16013. 861.80 s [vector] CallStack (from HasCallStack):
  16014. 861.80 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  16015. 861.80 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  16016. 861.80 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16017. 861.80 s [vector] []
  16018. 861.80 s [vector] zip: OK
  16019. 861.80 s [vector] +++ OK, passed 100 tests.
  16020. 861.81 s [vector] zip3: OK
  16021. 861.81 s [vector] +++ OK, passed 100 tests.
  16022. 861.81 s [vector] unzip: OK
  16023. 861.81 s [vector] +++ OK, passed 100 tests.
  16024. 861.81 s [vector] unzip3: OK
  16025. 861.81 s [vector] +++ OK, passed 100 tests.
  16026. 861.81 s [vector] indexed: OK
  16027. 861.81 s [vector] +++ OK, passed 100 tests.
  16028. 861.81 s [vector] update: OK
  16029. 861.81 s [vector] +++ OK, passed 100 tests.
  16030. 861.82 s [vector] mempty: OK
  16031. 861.82 s [vector] +++ OK, passed 1 test.
  16032. 861.82 s [vector] mappend: OK
  16033. 861.83 s [vector] +++ OK, passed 100 tests.
  16034. 861.84 s [vector] mconcat: OK (0.02s)
  16035. 861.84 s [vector] +++ OK, passed 100 tests.
  16036. 861.84 s [vector] glength: OK
  16037. 861.84 s [vector] +++ OK, passed 100 tests.
  16038. 861.84 s [vector] sum: OK
  16039. 861.84 s [vector] +++ OK, passed 100 tests.
  16040. 861.84 s [vector] product: OK
  16041. 861.84 s [vector] +++ OK, passed 100 tests.
  16042. 861.84 s [vector] enumFromN: OK
  16043. 861.84 s [vector] +++ OK, passed 100 tests.
  16044. 861.85 s [vector] enumFromThenN: OK
  16045. 861.85 s [vector] +++ OK, passed 100 tests.
  16046. 861.85 s [vector] enumFromTo: OK
  16047. 861.85 s [vector] +++ OK, passed 100 tests.
  16048. 861.85 s [vector] enumFromThenTo: OK
  16049. 861.85 s [vector] +++ OK, passed 100 tests.
  16050. 861.85 s [vector] (Int,Bool)
  16051. 861.85 s [vector] fromList.toList == id: OK
  16052. 861.85 s [vector] +++ OK, passed 100 tests.
  16053. 861.85 s [vector] toList.fromList == id: OK
  16054. 861.85 s [vector] +++ OK, passed 100 tests.
  16055. 861.85 s [vector] unstream.stream == id: OK
  16056. 861.85 s [vector] +++ OK, passed 100 tests.
  16057. 861.85 s [vector] stream.unstream == id: OK
  16058. 861.85 s [vector] +++ OK, passed 100 tests.
  16059. 861.85 s [vector] eq: OK
  16060. 861.85 s [vector] +++ OK, passed 100 tests.
  16061. 861.85 s [vector] length: OK
  16062. 861.85 s [vector] +++ OK, passed 100 tests.
  16063. 861.85 s [vector] null: OK
  16064. 861.85 s [vector] +++ OK, passed 100 tests.
  16065. 861.85 s [vector] index: OK
  16066. 861.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16067. 861.85 s [vector] safeIndex: OK
  16068. 861.86 s [vector] +++ OK, passed 100 tests.
  16069. 861.86 s [vector] head: OK
  16070. 861.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16071. 861.86 s [vector] last: OK
  16072. 861.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16073. 861.86 s [vector] unsafeIndex: OK
  16074. 861.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16075. 861.86 s [vector] unsafeHead: OK
  16076. 861.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16077. 861.86 s [vector] unsafeLast: OK
  16078. 861.86 s [vector] +++ OK, passed 100 tests; 23 discarded.
  16079. 861.86 s [vector] slice: OK
  16080. 861.86 s [vector] +++ OK, passed 100 tests.
  16081. 861.86 s [vector] init: OK
  16082. 861.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16083. 861.86 s [vector] tail: OK
  16084. 861.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16085. 861.86 s [vector] take: OK
  16086. 861.86 s [vector] +++ OK, passed 100 tests.
  16087. 861.86 s [vector] drop: OK
  16088. 861.86 s [vector] +++ OK, passed 100 tests.
  16089. 861.87 s [vector] splitAt: OK
  16090. 861.87 s [vector] +++ OK, passed 100 tests.
  16091. 861.87 s [vector] empty: OK
  16092. 861.87 s [vector] +++ OK, passed 1 test.
  16093. 861.87 s [vector] singleton: OK
  16094. 861.87 s [vector] +++ OK, passed 100 tests.
  16095. 861.87 s [vector] replicate: OK
  16096. 861.87 s [vector] +++ OK, passed 100 tests.
  16097. 861.87 s [vector] generate: OK
  16098. 861.87 s [vector] +++ OK, passed 100 tests.
  16099. 861.89 s [vector] iterateN: OK
  16100. 861.89 s [vector] +++ OK, passed 100 tests.
  16101. 861.90 s [vector] iterateNM: OK (0.02s)
  16102. 861.91 s [vector] +++ OK, passed 100 tests.
  16103. 861.93 s [vector] generateM: OK (0.03s)
  16104. 861.93 s [vector] +++ OK, passed 100 tests.
  16105. 861.93 s [vector] replicateM: OK
  16106. 861.93 s [vector] +++ OK, passed 100 tests.
  16107. 861.93 s [vector] create: OK
  16108. 861.93 s [vector] +++ OK, passed 100 tests.
  16109. 861.93 s [vector] createT: OK
  16110. 861.93 s [vector] +++ OK, passed 100 tests.
  16111. 861.93 s [vector] unfoldr: OK
  16112. 861.93 s [vector] +++ OK, passed 100 tests.
  16113. 861.93 s [vector] unfoldrN: OK
  16114. 861.93 s [vector] +++ OK, passed 100 tests.
  16115. 861.93 s [vector] unfoldrExactN: OK
  16116. 861.94 s [vector] +++ OK, passed 100 tests.
  16117. 861.94 s [vector] unfoldrM: OK
  16118. 861.94 s [vector] +++ OK, passed 100 tests.
  16119. 861.95 s [vector] unfoldrNM: OK
  16120. 861.95 s [vector] +++ OK, passed 100 tests.
  16121. 861.98 s [vector] unfoldrExactNM: OK (0.03s)
  16122. 861.98 s [vector] +++ OK, passed 100 tests.
  16123. 861.98 s [vector] constructN: OK
  16124. 861.98 s [vector] +++ OK, passed 100 tests.
  16125. 861.99 s [vector] constructrN: OK
  16126. 861.99 s [vector] +++ OK, passed 100 tests.
  16127. 861.99 s [vector] cons: OK
  16128. 861.99 s [vector] +++ OK, passed 100 tests.
  16129. 861.99 s [vector] snoc: OK
  16130. 861.99 s [vector] +++ OK, passed 100 tests.
  16131. 862.01 s [vector] append: OK
  16132. 862.01 s [vector] +++ OK, passed 100 tests.
  16133. 862.03 s [vector] concat: OK (0.04s)
  16134. 862.03 s [vector] +++ OK, passed 100 tests.
  16135. 862.03 s [vector] force: OK
  16136. 862.03 s [vector] +++ OK, passed 100 tests.
  16137. 862.04 s [vector] upd: OK
  16138. 862.04 s [vector] +++ OK, passed 100 tests.
  16139. 862.04 s [vector] accum: OK
  16140. 862.04 s [vector] +++ OK, passed 100 tests.
  16141. 862.04 s [vector] reverse: OK
  16142. 862.04 s [vector] +++ OK, passed 100 tests.
  16143. 862.04 s [vector] backpermute: OK
  16144. 862.04 s [vector] +++ OK, passed 100 tests.
  16145. 862.05 s [vector] map: OK
  16146. 862.05 s [vector] +++ OK, passed 100 tests.
  16147. 862.05 s [vector] imap: OK
  16148. 862.05 s [vector] +++ OK, passed 100 tests.
  16149. 862.06 s [vector] concatMap: OK
  16150. 862.06 s [vector] +++ OK, passed 100 tests.
  16151. 862.06 s [vector] mapM: OK
  16152. 862.06 s [vector] +++ OK, passed 100 tests.
  16153. 862.08 s [vector] mapM_: OK (0.01s)
  16154. 862.08 s [vector] +++ OK, passed 100 tests.
  16155. 862.09 s [vector] forM: OK
  16156. 862.09 s [vector] +++ OK, passed 100 tests.
  16157. 862.11 s [vector] forM_: OK (0.03s)
  16158. 862.11 s [vector] +++ OK, passed 100 tests.
  16159. 862.11 s [vector] imapM: OK
  16160. 862.13 s [vector] +++ OK, passed 100 tests.
  16161. 862.15 s [vector] imapM_: OK (0.03s)
  16162. 862.15 s [vector] +++ OK, passed 100 tests.
  16163. 862.15 s [vector] zipWith: OK
  16164. 862.15 s [vector] +++ OK, passed 100 tests.
  16165. 862.17 s [vector] zipWith3: OK (0.02s)
  16166. 862.17 s [vector] +++ OK, passed 100 tests.
  16167. 862.17 s [vector] izipWith: OK
  16168. 862.17 s [vector] +++ OK, passed 100 tests.
  16169. 862.18 s [vector] izipWith3: OK
  16170. 862.18 s [vector] +++ OK, passed 100 tests.
  16171. 862.19 s [vector] izipWithM: OK
  16172. 862.19 s [vector] +++ OK, passed 100 tests.
  16173. 862.20 s [vector] izipWithM_: OK (0.02s)
  16174. 862.20 s [vector] +++ OK, passed 100 tests.
  16175. 862.20 s [vector] zipWithM: OK
  16176. 862.20 s [vector] +++ OK, passed 100 tests.
  16177. 862.22 s [vector] zipWithM_: OK (0.02s)
  16178. 862.22 s [vector] +++ OK, passed 100 tests.
  16179. 862.22 s [vector] filter: OK
  16180. 862.22 s [vector] +++ OK, passed 100 tests.
  16181. 862.25 s [vector] ifilter: OK
  16182. 862.25 s [vector] +++ OK, passed 100 tests.
  16183. 862.26 s [vector] filterM: OK (0.03s)
  16184. 862.26 s [vector] +++ OK, passed 100 tests.
  16185. 862.26 s [vector] uniq: OK
  16186. 862.26 s [vector] +++ OK, passed 100 tests.
  16187. 862.27 s [vector] mapMaybe: OK
  16188. 862.27 s [vector] +++ OK, passed 100 tests.
  16189. 862.27 s [vector] imapMaybe: OK
  16190. 862.27 s [vector] +++ OK, passed 100 tests.
  16191. 862.27 s [vector] takeWhile: OK
  16192. 862.27 s [vector] +++ OK, passed 100 tests.
  16193. 862.27 s [vector] dropWhile: OK
  16194. 862.27 s [vector] +++ OK, passed 100 tests.
  16195. 862.27 s [vector] partition: OK
  16196. 862.27 s [vector] +++ OK, passed 100 tests.
  16197. 862.28 s [vector] partitionWith: OK
  16198. 862.28 s [vector] +++ OK, passed 100 tests.
  16199. 862.28 s [vector] span: OK
  16200. 862.28 s [vector] +++ OK, passed 100 tests.
  16201. 862.28 s [vector] break: OK
  16202. 862.28 s [vector] +++ OK, passed 100 tests.
  16203. 862.28 s [vector] spanR: OK
  16204. 862.28 s [vector] +++ OK, passed 100 tests.
  16205. 862.28 s [vector] breakR: OK
  16206. 862.29 s [vector] +++ OK, passed 100 tests.
  16207. 862.29 s [vector] groupBy: OK
  16208. 862.29 s [vector] +++ OK, passed 100 tests.
  16209. 862.29 s [vector] elem: OK
  16210. 862.29 s [vector] +++ OK, passed 100 tests.
  16211. 862.29 s [vector] notElem: OK
  16212. 862.29 s [vector] +++ OK, passed 100 tests.
  16213. 862.29 s [vector] find: OK
  16214. 862.29 s [vector] +++ OK, passed 100 tests.
  16215. 862.29 s [vector] findIndex: OK
  16216. 862.29 s [vector] +++ OK, passed 100 tests.
  16217. 862.30 s [vector] findIndexR: OK
  16218. 862.30 s [vector] +++ OK, passed 100 tests.
  16219. 862.30 s [vector] findIndices: OK
  16220. 862.30 s [vector] +++ OK, passed 100 tests.
  16221. 862.31 s [vector] elemIndex: OK
  16222. 862.31 s [vector] +++ OK, passed 100 tests.
  16223. 862.32 s [vector] elemIndices: OK
  16224. 862.32 s [vector] +++ OK, passed 100 tests.
  16225. 862.32 s [vector] foldl: OK
  16226. 862.32 s [vector] +++ OK, passed 100 tests.
  16227. 862.32 s [vector] foldl1: OK
  16228. 862.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16229. 862.32 s [vector] foldl': OK
  16230. 862.33 s [vector] +++ OK, passed 100 tests.
  16231. 862.33 s [vector] foldl1': OK
  16232. 862.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16233. 862.33 s [vector] foldr: OK
  16234. 862.33 s [vector] +++ OK, passed 100 tests.
  16235. 862.33 s [vector] foldr1: OK
  16236. 862.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16237. 862.33 s [vector] foldr': OK
  16238. 862.33 s [vector] +++ OK, passed 100 tests.
  16239. 862.34 s [vector] foldr1': OK
  16240. 862.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16241. 862.34 s [vector] ifoldl: OK
  16242. 862.34 s [vector] +++ OK, passed 100 tests.
  16243. 862.34 s [vector] ifoldl': OK
  16244. 862.34 s [vector] +++ OK, passed 100 tests.
  16245. 862.34 s [vector] ifoldr: OK
  16246. 862.34 s [vector] +++ OK, passed 100 tests.
  16247. 862.35 s [vector] ifoldr': OK
  16248. 862.35 s [vector] +++ OK, passed 100 tests.
  16249. 862.35 s [vector] ifoldM: OK
  16250. 862.35 s [vector] +++ OK, passed 100 tests.
  16251. 862.36 s [vector] ifoldM': OK
  16252. 862.36 s [vector] +++ OK, passed 100 tests.
  16253. 862.39 s [vector] ifoldM_: OK (0.02s)
  16254. 862.39 s [vector] +++ OK, passed 100 tests.
  16255. 862.40 s [vector] ifoldM'_: OK (0.02s)
  16256. 862.40 s [vector] +++ OK, passed 100 tests.
  16257. 862.40 s [vector] all: OK
  16258. 862.40 s [vector] +++ OK, passed 100 tests.
  16259. 862.41 s [vector] any: OK
  16260. 862.41 s [vector] +++ OK, passed 100 tests.
  16261. 862.41 s [vector] prescanl: OK
  16262. 862.41 s [vector] +++ OK, passed 100 tests.
  16263. 862.41 s [vector] prescanl': OK
  16264. 862.41 s [vector] +++ OK, passed 100 tests.
  16265. 862.42 s [vector] postscanl: OK
  16266. 862.42 s [vector] +++ OK, passed 100 tests.
  16267. 862.42 s [vector] postscanl': OK
  16268. 862.42 s [vector] +++ OK, passed 100 tests.
  16269. 862.43 s [vector] scanl: OK
  16270. 862.43 s [vector] +++ OK, passed 100 tests.
  16271. 862.43 s [vector] scanl': OK
  16272. 862.43 s [vector] +++ OK, passed 100 tests.
  16273. 862.44 s [vector] scanl1: OK
  16274. 862.44 s [vector] +++ OK, passed 100 tests.
  16275. 862.44 s [vector] scanl1': OK
  16276. 862.45 s [vector] +++ OK, passed 100 tests.
  16277. 862.45 s [vector] iscanl: OK
  16278. 862.45 s [vector] +++ OK, passed 100 tests.
  16279. 862.46 s [vector] iscanl': OK
  16280. 862.46 s [vector] +++ OK, passed 100 tests.
  16281. 862.46 s [vector] prescanr: OK
  16282. 862.46 s [vector] +++ OK, passed 100 tests.
  16283. 862.46 s [vector] prescanr': OK
  16284. 862.46 s [vector] +++ OK, passed 100 tests.
  16285. 862.46 s [vector] postscanr: OK
  16286. 862.47 s [vector] +++ OK, passed 100 tests.
  16287. 862.47 s [vector] postscanr': OK
  16288. 862.47 s [vector] +++ OK, passed 100 tests.
  16289. 862.47 s [vector] scanr: OK
  16290. 862.48 s [vector] +++ OK, passed 100 tests.
  16291. 862.48 s [vector] scanr': OK
  16292. 862.48 s [vector] +++ OK, passed 100 tests.
  16293. 862.49 s [vector] scanr1: OK
  16294. 862.49 s [vector] +++ OK, passed 100 tests.
  16295. 862.49 s [vector] scanr1': OK
  16296. 862.49 s [vector] +++ OK, passed 100 tests.
  16297. 862.50 s [vector] iscanr: OK
  16298. 862.50 s [vector] +++ OK, passed 100 tests.
  16299. 862.50 s [vector] iscanr': OK
  16300. 862.50 s [vector] +++ OK, passed 100 tests.
  16301. 862.50 s [vector] mut_read: OK
  16302. 862.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16303. 862.50 s [vector] mut_write: OK
  16304. 862.50 s [vector] +++ OK, passed 100 tests; 22 discarded.
  16305. 862.50 s [vector] mut_modify: OK
  16306. 862.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16307. 862.51 s [vector] mut_generate: OK
  16308. 862.51 s [vector] +++ OK, passed 100 tests.
  16309. 862.53 s [vector] mut_generateM: OK (0.02s)
  16310. 862.53 s [vector] +++ OK, passed 100 tests.
  16311. 862.56 s [vector] mut_mapM_: OK (0.02s)
  16312. 862.56 s [vector] +++ OK, passed 100 tests.
  16313. 862.58 s [vector] mut_imapM_: OK (0.03s)
  16314. 862.58 s [vector] +++ OK, passed 100 tests.
  16315. 862.62 s [vector] mut_forM_: OK (0.03s)
  16316. 862.63 s [vector] +++ OK, passed 100 tests.
  16317. 862.64 s [vector] mut_iforM_: OK (0.02s)
  16318. 862.64 s [vector] +++ OK, passed 100 tests.
  16319. 862.65 s [vector] mut_foldr: OK
  16320. 862.65 s [vector] +++ OK, passed 100 tests.
  16321. 862.65 s [vector] mut_foldr': OK
  16322. 862.65 s [vector] +++ OK, passed 100 tests.
  16323. 862.65 s [vector] mut_foldl: OK
  16324. 862.65 s [vector] +++ OK, passed 100 tests.
  16325. 862.66 s [vector] mut_foldl': OK
  16326. 862.66 s [vector] +++ OK, passed 100 tests.
  16327. 862.66 s [vector] mut_ifoldr: OK
  16328. 862.66 s [vector] +++ OK, passed 100 tests.
  16329. 862.66 s [vector] mut_ifoldr': OK
  16330. 862.67 s [vector] +++ OK, passed 100 tests.
  16331. 862.67 s [vector] mut_ifoldl: OK
  16332. 862.67 s [vector] +++ OK, passed 100 tests.
  16333. 862.68 s [vector] mut_ifoldl': OK
  16334. 862.68 s [vector] +++ OK, passed 100 tests.
  16335. 862.68 s [vector] mut_foldM: OK
  16336. 862.68 s [vector] +++ OK, passed 100 tests.
  16337. 862.69 s [vector] mut_foldM': OK
  16338. 862.69 s [vector] +++ OK, passed 100 tests.
  16339. 862.69 s [vector] mut_foldrM: OK
  16340. 862.69 s [vector] +++ OK, passed 100 tests.
  16341. 862.69 s [vector] mut_foldrM': OK
  16342. 862.69 s [vector] +++ OK, passed 100 tests.
  16343. 862.69 s [vector] mut_ifoldM: OK
  16344. 862.70 s [vector] +++ OK, passed 100 tests.
  16345. 862.70 s [vector] mut_ifoldM': OK
  16346. 862.70 s [vector] +++ OK, passed 100 tests.
  16347. 862.70 s [vector] mut_ifoldrM: OK
  16348. 862.71 s [vector] +++ OK, passed 100 tests.
  16349. 862.71 s [vector] mut_ifoldrM': OK
  16350. 862.71 s [vector] +++ OK, passed 100 tests.
  16351. 862.71 s [vector] compare: OK
  16352. 862.71 s [vector] +++ OK, passed 100 tests.
  16353. 862.71 s [vector] maximum: OK
  16354. 862.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16355. 862.71 s [vector] minimum: OK
  16356. 862.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16357. 862.71 s [vector] minIndex: OK
  16358. 862.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16359. 862.71 s [vector] maxIndex: OK
  16360. 862.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16361. 862.71 s [vector] maximumBy: OK
  16362. 862.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16363. 862.72 s [vector] minimumBy: OK
  16364. 862.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16365. 862.72 s [vector] maximumOn: OK
  16366. 862.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16367. 862.72 s [vector] minimumOn: OK
  16368. 862.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16369. 862.72 s [vector] maxIndexBy: OK
  16370. 862.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16371. 862.72 s [vector] minIndexBy: OK
  16372. 862.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16373. 862.72 s [vector] ListFirstMaxIndexWins: OK
  16374. 862.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16375. 862.72 s [vector] FalseListFirstMaxIndexWins: OK
  16376. 862.72 s [vector] +++ OK, failed as expected. (after 1 test):
  16377. 862.72 s [vector] Exception:
  16378. 862.72 s [vector] Prelude.foldr1: empty list
  16379. 862.72 s [vector] CallStack (from HasCallStack):
  16380. 862.72 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  16381. 862.72 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  16382. 862.72 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16383. 862.72 s [vector] []
  16384. 862.72 s [vector] zip: OK
  16385. 862.72 s [vector] +++ OK, passed 100 tests.
  16386. 862.72 s [vector] zip3: OK
  16387. 862.73 s [vector] +++ OK, passed 100 tests.
  16388. 862.73 s [vector] unzip: OK
  16389. 862.73 s [vector] +++ OK, passed 100 tests.
  16390. 862.74 s [vector] unzip3: OK
  16391. 862.74 s [vector] +++ OK, passed 100 tests.
  16392. 862.74 s [vector] indexed: OK
  16393. 862.74 s [vector] +++ OK, passed 100 tests.
  16394. 862.74 s [vector] update: OK
  16395. 862.74 s [vector] +++ OK, passed 100 tests.
  16396. 862.74 s [vector] mempty: OK
  16397. 862.74 s [vector] +++ OK, passed 1 test.
  16398. 862.75 s [vector] mappend: OK
  16399. 862.75 s [vector] +++ OK, passed 100 tests.
  16400. 862.78 s [vector] mconcat: OK (0.04s)
  16401. 862.78 s [vector] +++ OK, passed 100 tests.
  16402. 862.78 s [vector] glength: OK
  16403. 862.78 s [vector] +++ OK, passed 100 tests.
  16404. 862.78 s [vector] (Int,Bool,Int)
  16405. 862.78 s [vector] fromList.toList == id: OK
  16406. 862.78 s [vector] +++ OK, passed 100 tests.
  16407. 862.78 s [vector] toList.fromList == id: OK
  16408. 862.78 s [vector] +++ OK, passed 100 tests.
  16409. 862.78 s [vector] unstream.stream == id: OK
  16410. 862.78 s [vector] +++ OK, passed 100 tests.
  16411. 862.79 s [vector] stream.unstream == id: OK
  16412. 862.79 s [vector] +++ OK, passed 100 tests.
  16413. 862.79 s [vector] eq: OK
  16414. 862.79 s [vector] +++ OK, passed 100 tests.
  16415. 862.79 s [vector] length: OK
  16416. 862.79 s [vector] +++ OK, passed 100 tests.
  16417. 862.79 s [vector] null: OK
  16418. 862.79 s [vector] +++ OK, passed 100 tests.
  16419. 862.79 s [vector] index: OK
  16420. 862.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16421. 862.79 s [vector] safeIndex: OK
  16422. 862.79 s [vector] +++ OK, passed 100 tests.
  16423. 862.79 s [vector] head: OK
  16424. 862.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16425. 862.79 s [vector] last: OK
  16426. 862.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16427. 862.79 s [vector] unsafeIndex: OK
  16428. 862.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16429. 862.79 s [vector] unsafeHead: OK
  16430. 862.79 s [vector] +++ OK, passed 100 tests; 10 discarded.
  16431. 862.79 s [vector] unsafeLast: OK
  16432. 862.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16433. 862.80 s [vector] slice: OK
  16434. 862.80 s [vector] +++ OK, passed 100 tests.
  16435. 862.80 s [vector] init: OK
  16436. 862.80 s [vector] +++ OK, passed 100 tests; 23 discarded.
  16437. 862.80 s [vector] tail: OK
  16438. 862.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16439. 862.80 s [vector] take: OK
  16440. 862.80 s [vector] +++ OK, passed 100 tests.
  16441. 862.80 s [vector] drop: OK
  16442. 862.80 s [vector] +++ OK, passed 100 tests.
  16443. 862.80 s [vector] splitAt: OK
  16444. 862.80 s [vector] +++ OK, passed 100 tests.
  16445. 862.80 s [vector] empty: OK
  16446. 862.80 s [vector] +++ OK, passed 1 test.
  16447. 862.81 s [vector] singleton: OK
  16448. 862.81 s [vector] +++ OK, passed 100 tests.
  16449. 862.81 s [vector] replicate: OK
  16450. 862.81 s [vector] +++ OK, passed 100 tests.
  16451. 862.81 s [vector] generate: OK
  16452. 862.81 s [vector] +++ OK, passed 100 tests.
  16453. 862.82 s [vector] iterateN: OK
  16454. 862.82 s [vector] +++ OK, passed 100 tests.
  16455. 862.85 s [vector] iterateNM: OK (0.02s)
  16456. 862.85 s [vector] +++ OK, passed 100 tests.
  16457. 862.88 s [vector] generateM: OK (0.04s)
  16458. 862.88 s [vector] +++ OK, passed 100 tests.
  16459. 862.88 s [vector] replicateM: OK (0.01s)
  16460. 862.88 s [vector] +++ OK, passed 100 tests.
  16461. 862.88 s [vector] create: OK
  16462. 862.88 s [vector] +++ OK, passed 100 tests.
  16463. 862.88 s [vector] createT: OK
  16464. 862.89 s [vector] +++ OK, passed 100 tests.
  16465. 862.89 s [vector] unfoldr: OK
  16466. 862.89 s [vector] +++ OK, passed 100 tests.
  16467. 862.89 s [vector] unfoldrN: OK
  16468. 862.89 s [vector] +++ OK, passed 100 tests.
  16469. 862.89 s [vector] unfoldrExactN: OK
  16470. 862.89 s [vector] +++ OK, passed 100 tests.
  16471. 862.89 s [vector] unfoldrM: OK
  16472. 862.89 s [vector] +++ OK, passed 100 tests.
  16473. 862.89 s [vector] unfoldrNM: OK
  16474. 862.91 s [vector] +++ OK, passed 100 tests.
  16475. 862.93 s [vector] unfoldrExactNM: OK (0.03s)
  16476. 862.93 s [vector] +++ OK, passed 100 tests.
  16477. 862.94 s [vector] constructN: OK
  16478. 862.95 s [vector] +++ OK, passed 100 tests.
  16479. 862.95 s [vector] constructrN: OK
  16480. 862.95 s [vector] +++ OK, passed 100 tests.
  16481. 862.95 s [vector] cons: OK
  16482. 862.95 s [vector] +++ OK, passed 100 tests.
  16483. 862.95 s [vector] snoc: OK
  16484. 862.95 s [vector] +++ OK, passed 100 tests.
  16485. 862.95 s [vector] append: OK
  16486. 862.95 s [vector] +++ OK, passed 100 tests.
  16487. 863.00 s [vector] concat: OK (0.04s)
  16488. 863.00 s [vector] +++ OK, passed 100 tests.
  16489. 863.00 s [vector] force: OK
  16490. 863.01 s [vector] +++ OK, passed 100 tests.
  16491. 863.02 s [vector] upd: OK
  16492. 863.02 s [vector] +++ OK, passed 100 tests.
  16493. 863.02 s [vector] accum: OK
  16494. 863.02 s [vector] +++ OK, passed 100 tests.
  16495. 863.02 s [vector] reverse: OK
  16496. 863.02 s [vector] +++ OK, passed 100 tests.
  16497. 863.02 s [vector] backpermute: OK
  16498. 863.02 s [vector] +++ OK, passed 100 tests.
  16499. 863.03 s [vector] map: OK
  16500. 863.03 s [vector] +++ OK, passed 100 tests.
  16501. 863.04 s [vector] imap: OK
  16502. 863.04 s [vector] +++ OK, passed 100 tests.
  16503. 863.04 s [vector] concatMap: OK
  16504. 863.05 s [vector] +++ OK, passed 100 tests.
  16505. 863.06 s [vector] mapM: OK
  16506. 863.07 s [vector] +++ OK, passed 100 tests.
  16507. 863.10 s [vector] mapM_: OK (0.04s)
  16508. 863.10 s [vector] +++ OK, passed 100 tests.
  16509. 863.10 s [vector] forM: OK
  16510. 863.11 s [vector] +++ OK, passed 100 tests.
  16511. 863.14 s [vector] forM_: OK (0.04s)
  16512. 863.14 s [vector] +++ OK, passed 100 tests.
  16513. 863.14 s [vector] imapM: OK
  16514. 863.14 s [vector] +++ OK, passed 100 tests.
  16515. 863.21 s [vector] imapM_: OK (0.06s)
  16516. 863.21 s [vector] +++ OK, passed 100 tests.
  16517. 863.21 s [vector] zipWith: OK
  16518. 863.22 s [vector] +++ OK, passed 100 tests.
  16519. 863.22 s [vector] zipWith3: OK
  16520. 863.22 s [vector] +++ OK, passed 100 tests.
  16521. 863.22 s [vector] izipWith: OK
  16522. 863.23 s [vector] +++ OK, passed 100 tests.
  16523. 863.23 s [vector] izipWith3: OK
  16524. 863.23 s [vector] +++ OK, passed 100 tests.
  16525. 863.23 s [vector] izipWithM: OK
  16526. 863.25 s [vector] +++ OK, passed 100 tests.
  16527. 863.27 s [vector] izipWithM_: OK (0.03s)
  16528. 863.27 s [vector] +++ OK, passed 100 tests.
  16529. 863.29 s [vector] zipWithM: OK
  16530. 863.29 s [vector] +++ OK, passed 100 tests.
  16531. 863.30 s [vector] zipWithM_: OK (0.03s)
  16532. 863.30 s [vector] +++ OK, passed 100 tests.
  16533. 863.30 s [vector] filter: OK
  16534. 863.31 s [vector] +++ OK, passed 100 tests.
  16535. 863.33 s [vector] ifilter: OK
  16536. 863.33 s [vector] +++ OK, passed 100 tests.
  16537. 863.38 s [vector] filterM: OK (0.07s)
  16538. 863.38 s [vector] +++ OK, passed 100 tests.
  16539. 863.38 s [vector] uniq: OK
  16540. 863.38 s [vector] +++ OK, passed 100 tests.
  16541. 863.38 s [vector] mapMaybe: OK
  16542. 863.39 s [vector] +++ OK, passed 100 tests.
  16543. 863.39 s [vector] imapMaybe: OK
  16544. 863.39 s [vector] +++ OK, passed 100 tests.
  16545. 863.39 s [vector] takeWhile: OK
  16546. 863.39 s [vector] +++ OK, passed 100 tests.
  16547. 863.39 s [vector] dropWhile: OK
  16548. 863.39 s [vector] +++ OK, passed 100 tests.
  16549. 863.39 s [vector] partition: OK
  16550. 863.39 s [vector] +++ OK, passed 100 tests.
  16551. 863.40 s [vector] partitionWith: OK
  16552. 863.40 s [vector] +++ OK, passed 100 tests.
  16553. 863.40 s [vector] span: OK
  16554. 863.40 s [vector] +++ OK, passed 100 tests.
  16555. 863.41 s [vector] break: OK
  16556. 863.41 s [vector] +++ OK, passed 100 tests.
  16557. 863.41 s [vector] spanR: OK
  16558. 863.41 s [vector] +++ OK, passed 100 tests.
  16559. 863.42 s [vector] breakR: OK
  16560. 863.42 s [vector] +++ OK, passed 100 tests.
  16561. 863.42 s [vector] groupBy: OK
  16562. 863.42 s [vector] +++ OK, passed 100 tests.
  16563. 863.42 s [vector] elem: OK
  16564. 863.42 s [vector] +++ OK, passed 100 tests.
  16565. 863.42 s [vector] notElem: OK
  16566. 863.42 s [vector] +++ OK, passed 100 tests.
  16567. 863.42 s [vector] find: OK
  16568. 863.42 s [vector] +++ OK, passed 100 tests.
  16569. 863.42 s [vector] findIndex: OK
  16570. 863.42 s [vector] +++ OK, passed 100 tests.
  16571. 863.43 s [vector] findIndexR: OK
  16572. 863.43 s [vector] +++ OK, passed 100 tests.
  16573. 863.43 s [vector] findIndices: OK
  16574. 863.43 s [vector] +++ OK, passed 100 tests.
  16575. 863.43 s [vector] elemIndex: OK
  16576. 863.43 s [vector] +++ OK, passed 100 tests.
  16577. 863.44 s [vector] elemIndices: OK
  16578. 863.44 s [vector] +++ OK, passed 100 tests.
  16579. 863.44 s [vector] foldl: OK
  16580. 863.44 s [vector] +++ OK, passed 100 tests.
  16581. 863.44 s [vector] foldl1: OK
  16582. 863.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16583. 863.45 s [vector] foldl': OK
  16584. 863.45 s [vector] +++ OK, passed 100 tests.
  16585. 863.45 s [vector] foldl1': OK
  16586. 863.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16587. 863.47 s [vector] foldr: OK
  16588. 863.47 s [vector] +++ OK, passed 100 tests.
  16589. 863.47 s [vector] foldr1: OK
  16590. 863.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16591. 863.47 s [vector] foldr': OK
  16592. 863.47 s [vector] +++ OK, passed 100 tests.
  16593. 863.48 s [vector] foldr1': OK
  16594. 863.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16595. 863.49 s [vector] ifoldl: OK
  16596. 863.49 s [vector] +++ OK, passed 100 tests.
  16597. 863.50 s [vector] ifoldl': OK
  16598. 863.50 s [vector] +++ OK, passed 100 tests.
  16599. 863.51 s [vector] ifoldr: OK
  16600. 863.51 s [vector] +++ OK, passed 100 tests.
  16601. 863.51 s [vector] ifoldr': OK
  16602. 863.51 s [vector] +++ OK, passed 100 tests.
  16603. 863.52 s [vector] ifoldM: OK
  16604. 863.52 s [vector] +++ OK, passed 100 tests.
  16605. 863.52 s [vector] ifoldM': OK
  16606. 863.53 s [vector] +++ OK, passed 100 tests.
  16607. 863.56 s [vector] ifoldM_: OK (0.03s)
  16608. 863.56 s [vector] +++ OK, passed 100 tests.
  16609. 863.59 s [vector] ifoldM'_: OK (0.03s)
  16610. 863.59 s [vector] +++ OK, passed 100 tests.
  16611. 863.59 s [vector] all: OK
  16612. 863.59 s [vector] +++ OK, passed 100 tests.
  16613. 863.59 s [vector] any: OK
  16614. 863.60 s [vector] +++ OK, passed 100 tests.
  16615. 863.60 s [vector] prescanl: OK
  16616. 863.60 s [vector] +++ OK, passed 100 tests.
  16617. 863.61 s [vector] prescanl': OK
  16618. 863.61 s [vector] +++ OK, passed 100 tests.
  16619. 863.62 s [vector] postscanl: OK
  16620. 863.62 s [vector] +++ OK, passed 100 tests.
  16621. 863.62 s [vector] postscanl': OK
  16622. 863.63 s [vector] +++ OK, passed 100 tests.
  16623. 863.64 s [vector] scanl: OK
  16624. 863.64 s [vector] +++ OK, passed 100 tests.
  16625. 863.64 s [vector] scanl': OK
  16626. 863.64 s [vector] +++ OK, passed 100 tests.
  16627. 863.65 s [vector] scanl1: OK
  16628. 863.65 s [vector] +++ OK, passed 100 tests.
  16629. 863.65 s [vector] scanl1': OK
  16630. 863.65 s [vector] +++ OK, passed 100 tests.
  16631. 863.66 s [vector] iscanl: OK
  16632. 863.66 s [vector] +++ OK, passed 100 tests.
  16633. 863.67 s [vector] iscanl': OK
  16634. 863.67 s [vector] +++ OK, passed 100 tests.
  16635. 863.67 s [vector] prescanr: OK
  16636. 863.67 s [vector] +++ OK, passed 100 tests.
  16637. 863.68 s [vector] prescanr': OK
  16638. 863.68 s [vector] +++ OK, passed 100 tests.
  16639. 863.69 s [vector] postscanr: OK
  16640. 863.69 s [vector] +++ OK, passed 100 tests.
  16641. 863.69 s [vector] postscanr': OK
  16642. 863.69 s [vector] +++ OK, passed 100 tests.
  16643. 863.71 s [vector] scanr: OK
  16644. 863.71 s [vector] +++ OK, passed 100 tests.
  16645. 863.71 s [vector] scanr': OK
  16646. 863.71 s [vector] +++ OK, passed 100 tests.
  16647. 863.72 s [vector] scanr1: OK
  16648. 863.72 s [vector] +++ OK, passed 100 tests.
  16649. 863.73 s [vector] scanr1': OK
  16650. 863.73 s [vector] +++ OK, passed 100 tests.
  16651. 863.73 s [vector] iscanr: OK
  16652. 863.74 s [vector] +++ OK, passed 100 tests.
  16653. 863.74 s [vector] iscanr': OK
  16654. 863.74 s [vector] +++ OK, passed 100 tests.
  16655. 863.74 s [vector] mut_read: OK
  16656. 863.74 s [vector] +++ OK, passed 100 tests; 27 discarded.
  16657. 863.74 s [vector] mut_write: OK
  16658. 863.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16659. 863.74 s [vector] mut_modify: OK
  16660. 863.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16661. 863.74 s [vector] mut_generate: OK
  16662. 863.76 s [vector] +++ OK, passed 100 tests.
  16663. 863.77 s [vector] mut_generateM: OK (0.02s)
  16664. 863.78 s [vector] +++ OK, passed 100 tests.
  16665. 863.82 s [vector] mut_mapM_: OK (0.04s)
  16666. 863.82 s [vector] +++ OK, passed 100 tests.
  16667. 863.86 s [vector] mut_imapM_: OK (0.05s)
  16668. 863.86 s [vector] +++ OK, passed 100 tests.
  16669. 863.92 s [vector] mut_forM_: OK (0.04s)
  16670. 863.92 s [vector] +++ OK, passed 100 tests.
  16671. 863.94 s [vector] mut_iforM_: OK (0.04s)
  16672. 863.94 s [vector] +++ OK, passed 100 tests.
  16673. 863.95 s [vector] mut_foldr: OK
  16674. 863.95 s [vector] +++ OK, passed 100 tests.
  16675. 863.95 s [vector] mut_foldr': OK
  16676. 863.95 s [vector] +++ OK, passed 100 tests.
  16677. 863.96 s [vector] mut_foldl: OK
  16678. 863.96 s [vector] +++ OK, passed 100 tests.
  16679. 863.96 s [vector] mut_foldl': OK
  16680. 863.97 s [vector] +++ OK, passed 100 tests.
  16681. 863.98 s [vector] mut_ifoldr: OK
  16682. 863.98 s [vector] +++ OK, passed 100 tests.
  16683. 863.99 s [vector] mut_ifoldr': OK
  16684. 863.99 s [vector] +++ OK, passed 100 tests.
  16685. 864.00 s [vector] mut_ifoldl: OK
  16686. 864.00 s [vector] +++ OK, passed 100 tests.
  16687. 864.00 s [vector] mut_ifoldl': OK
  16688. 864.00 s [vector] +++ OK, passed 100 tests.
  16689. 864.01 s [vector] mut_foldM: OK
  16690. 864.01 s [vector] +++ OK, passed 100 tests.
  16691. 864.02 s [vector] mut_foldM': OK
  16692. 864.02 s [vector] +++ OK, passed 100 tests.
  16693. 864.02 s [vector] mut_foldrM: OK
  16694. 864.02 s [vector] +++ OK, passed 100 tests.
  16695. 864.03 s [vector] mut_foldrM': OK
  16696. 864.03 s [vector] +++ OK, passed 100 tests.
  16697. 864.04 s [vector] mut_ifoldM: OK
  16698. 864.04 s [vector] +++ OK, passed 100 tests.
  16699. 864.04 s [vector] mut_ifoldM': OK
  16700. 864.04 s [vector] +++ OK, passed 100 tests.
  16701. 864.04 s [vector] mut_ifoldrM: OK
  16702. 864.05 s [vector] +++ OK, passed 100 tests.
  16703. 864.05 s [vector] mut_ifoldrM': OK
  16704. 864.05 s [vector] +++ OK, passed 100 tests.
  16705. 864.05 s [vector] compare: OK
  16706. 864.05 s [vector] +++ OK, passed 100 tests.
  16707. 864.06 s [vector] maximum: OK
  16708. 864.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16709. 864.06 s [vector] minimum: OK
  16710. 864.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16711. 864.06 s [vector] minIndex: OK
  16712. 864.06 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16713. 864.06 s [vector] maxIndex: OK
  16714. 864.06 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16715. 864.06 s [vector] maximumBy: OK
  16716. 864.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16717. 864.06 s [vector] minimumBy: OK
  16718. 864.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16719. 864.06 s [vector] maximumOn: OK
  16720. 864.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16721. 864.06 s [vector] minimumOn: OK
  16722. 864.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16723. 864.06 s [vector] maxIndexBy: OK
  16724. 864.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16725. 864.07 s [vector] minIndexBy: OK
  16726. 864.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16727. 864.07 s [vector] ListFirstMaxIndexWins: OK
  16728. 864.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16729. 864.07 s [vector] FalseListFirstMaxIndexWins: OK
  16730. 864.07 s [vector] +++ OK, failed as expected. (after 1 test):
  16731. 864.07 s [vector] Exception:
  16732. 864.07 s [vector] Prelude.foldr1: empty list
  16733. 864.07 s [vector] CallStack (from HasCallStack):
  16734. 864.07 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  16735. 864.07 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  16736. 864.07 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16737. 864.07 s [vector] []
  16738. 864.07 s [vector] zip: OK
  16739. 864.07 s [vector] +++ OK, passed 100 tests.
  16740. 864.08 s [vector] zip3: OK
  16741. 864.08 s [vector] +++ OK, passed 100 tests.
  16742. 864.08 s [vector] unzip: OK
  16743. 864.08 s [vector] +++ OK, passed 100 tests.
  16744. 864.08 s [vector] unzip3: OK
  16745. 864.08 s [vector] +++ OK, passed 100 tests.
  16746. 864.08 s [vector] indexed: OK
  16747. 864.09 s [vector] +++ OK, passed 100 tests.
  16748. 864.09 s [vector] update: OK
  16749. 864.09 s [vector] +++ OK, passed 100 tests.
  16750. 864.09 s [vector] mempty: OK
  16751. 864.09 s [vector] +++ OK, passed 1 test.
  16752. 864.09 s [vector] mappend: OK
  16753. 864.09 s [vector] +++ OK, passed 100 tests.
  16754. 864.15 s [vector] mconcat: OK (0.05s)
  16755. 864.15 s [vector] +++ OK, passed 100 tests.
  16756. 864.15 s [vector] glength: OK
  16757. 864.15 s [vector] +++ OK, passed 100 tests.
  16758. 864.15 s [vector] unstream
  16759. 864.15 s [vector] unstream == vunstream (exact): OK
  16760. 864.15 s [vector] +++ OK, passed 100 tests.
  16761. 864.15 s [vector] unstream == vunstream (unknown): OK
  16762. 864.15 s [vector] +++ OK, passed 100 tests.
  16763. 864.15 s [vector] unstreamR ~= vunstream (exact): OK
  16764. 864.15 s [vector] +++ OK, passed 100 tests.
  16765. 864.15 s [vector] unstreamR ~= vunstream (unknown): OK
  16766. 864.15 s [vector] +++ OK, passed 100 tests.
  16767. 864.15 s [vector] Data.Vector.Storable.Vector Alignment
  16768. 864.15 s [vector] Aligned Double: OK
  16769. 864.15 s [vector] Aligned Int: OK
  16770. 864.15 s [vector] Regression tests
  16771. 864.15 s [vector] enumFromTo crash #188
  16772. 864.15 s [vector] Word8: OK
  16773. 864.15 s [vector] Word16: OK
  16774. 864.15 s [vector] Word32: OK
  16775. 864.15 s [vector] Word64: OK
  16776. 864.15 s [vector] Word: OK
  16777. 864.15 s [vector] Int8: OK
  16778. 864.15 s [vector] Int16: OK
  16779. 864.15 s [vector] Int32: OK
  16780. 864.15 s [vector] Int64: OK
  16781. 864.15 s [vector] Int: OK
  16782. 864.15 s [vector] Char: OK
  16783. 864.15 s [vector] Negative tests
  16784. 864.15 s [vector] slice out of bounds #257
  16785. 864.15 s [vector] Boxed
  16786. 864.15 s [vector] Negative ix: OK
  16787. 864.15 s [vector] Negative size: OK
  16788. 864.15 s [vector] Negative ix and size: OK
  16789. 864.15 s [vector] Too large ix: OK
  16790. 864.15 s [vector] Too large size: OK
  16791. 864.15 s [vector] Too large ix and size: OK
  16792. 864.15 s [vector] Overflow: OK
  16793. 864.15 s [vector] OutOfMemory: OK
  16794. 864.15 s [vector] Primitive
  16795. 864.15 s [vector] Negative ix: OK
  16796. 864.15 s [vector] Negative size: OK
  16797. 864.15 s [vector] Negative ix and size: OK
  16798. 864.15 s [vector] Too large ix: OK
  16799. 864.15 s [vector] Too large size: OK
  16800. 864.15 s [vector] Too large ix and size: OK
  16801. 864.15 s [vector] Overflow: OK
  16802. 864.15 s [vector] OutOfMemory: OK
  16803. 864.15 s [vector] Storable
  16804. 864.15 s [vector] Negative ix: OK
  16805. 864.15 s [vector] Negative size: OK
  16806. 864.15 s [vector] Negative ix and size: OK
  16807. 864.15 s [vector] Too large ix: OK
  16808. 864.15 s [vector] Too large size: OK
  16809. 864.15 s [vector] Too large ix and size: OK
  16810. 864.15 s [vector] Overflow: OK
  16811. 864.15 s [vector] OutOfMemory: OK
  16812. 864.15 s [vector] Unboxed
  16813. 864.15 s [vector] Negative ix: OK
  16814. 864.16 s [vector] Negative size: OK
  16815. 864.16 s [vector] Negative ix and size: OK
  16816. 864.16 s [vector] Too large ix: OK
  16817. 864.16 s [vector] Too large size: OK
  16818. 864.16 s [vector] Too large ix and size: OK
  16819. 864.16 s [vector] Overflow: OK
  16820. 864.16 s [vector] OutOfMemory: OK
  16821. 864.16 s [vector] take #282
  16822. 864.16 s [vector] Boxed: OK
  16823. 864.16 s [vector] Primitive: OK
  16824. 864.16 s [vector] Storable: OK
  16825. 864.16 s [vector] Unboxed: OK
  16826. 864.16 s [vector] Data.Vector
  16827. 864.16 s [vector] MonadFix: OK
  16828. 864.16 s [vector] toFromArray: OK
  16829. 864.16 s [vector] toFromArraySlice: OK
  16830. 864.16 s [vector] toFromArraySliceUnsafe: OK
  16831. 864.16 s [vector] toFromMutableArray: OK
  16832. 864.16 s [vector] Data.Vector.Mutable (Move): OK
  16833. 864.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16834. 864.16 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  16835. 864.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16836. 864.16 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  16837. 864.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16838. 864.16 s [vector] Data.Vector.Storable.Mutable (Move): OK
  16839. 864.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16840. 864.19 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.02s)
  16841. 864.19 s [vector] +++ OK, passed 1 test.
  16842. 864.19 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  16843. 864.19 s [vector] +++ OK, passed 1 test.
  16844. 864.20 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  16845. 864.20 s [vector] +++ OK, passed 100 tests.
  16846. 864.20 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  16847. 864.20 s [vector] +++ OK, passed 100 tests.
  16848. 864.20 s [vector]
  16849. 864.20 s [vector] All 2808 tests passed (13.65s)
  16850. 864.21 s [vector] Test suite vector-tests-O2: PASS
  16851. 864.21 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  16852. 864.21 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  16853. 864.22 s [vector] checkPhase completed in 31 seconds
  16854. 864.23 s [vector] Phase: haddockPhase
  16855. 864.24 s [vector] Phase: installPhase
  16856. 864.32 s [vector] Installing library in /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  16857. 865.27 s [vector] Installing internal library benchmarks-O2 in /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/vector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2
  16858. 865.86 s [vector] Phase: fixupPhase
  16859. 865.95 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0
  16860. 865.95 s [vector] shrinking /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSvector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO-ghc9.6.3.so
  16861. 866.06 s [vector] shrinking /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSvector-0.13.2.0-CeC1EjakYH1Ao4Hi3caoco-benchmarks-O2-ghc9.6.3.so
  16862. 866.09 s [vector] checking for references to /build/ in /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0...
  16863. 866.16 s [vector] patching script interpreter paths in /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0
  16864. 866.18 s [vector] stripping (with command strip and flags -S -p) in /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0/lib
  16865. 867.65 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0
  16866. 868.60 s [vector:post-build] Pushing 1 paths (93 are already present) using zstd to cache sellout ⏳
  16867. 868.60 s [vector:post-build]
  16868. 868.97 s [vector:post-build] Pushing /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0 (57.20 MiB)
  16869. 870.84 s [vector:post-build]
  16870. 870.84 s [vector:post-build] All done.
  16871. 870.93 s [vector:post-build] Uploading to the NixCI cache: /nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0
  16872. 871.09 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16873. 871.14 s [vector:post-build] copying 1 paths...
  16874. 871.14 s [vector:post-build] copying path '/nix/store/s52pmjar097fm1m352r36wcz4ch108f0-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  16875. 890.96 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16876. 891.25 s [vector:post-build] copying 1 paths...
  16877. 891.25 s [vector:post-build] copying path '/nix/store/4mvr7ylhr3rywbhazyw3pdgdhyrln9cp-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  16878. 891.65 s Progress: 103 of 113 built, 172 of 172 downloaded from cache
  16879. 891.78 s Building /nix/store/dbqfxi0pwxrhrcicgk12f7jf559ayfki-nothunks-0.3.0.0.drv
  16880. 891.96 s [nothunks] Phase: setupCompilerEnvironmentPhase
  16881. 891.97 s [nothunks] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  16882. 892.47 s [nothunks] Phase: unpackPhase
  16883. 892.48 s [nothunks] unpacking source archive /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
  16884. 892.49 s [nothunks] source root is nothunks-0.3.0.0
  16885. 892.50 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.0.0/test/Test/NoThunks/Class.hs"
  16886. 892.52 s [nothunks] Phase: patchPhase
  16887. 892.53 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.0.0/revision/1.cabal.
  16888. 892.53 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  16889. 892.57 s [nothunks] Phase: compileBuildDriverPhase
  16890. 892.59 s [nothunks] setupCompileFlags: -package-db=/build/tmp.CKo8zeKZ5d/setup-package.conf.d -threaded
  16891. 892.71 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.CKo8zeKZ5d/Main.o )
  16892. 892.83 s [nothunks] [2 of 2] Linking Setup
  16893. 894.64 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  16894. 894.67 s [nothunks] Phase: configurePhase
  16895. 894.68 s [nothunks] configureFlags: --verbose --prefix=/nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.CKo8zeKZ5d/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  16896. 894.70 s [nothunks] Using Parsec parser
  16897. 894.70 s [nothunks] Configuring nothunks-0.3.0.0...
  16898. 895.59 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  16899. 895.59 s [nothunks] Dependency base: using base-4.18.1.0
  16900. 895.60 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.11.5.2
  16901. 895.60 s [nothunks] Dependency containers: using containers-0.6.7
  16902. 895.60 s [nothunks] Dependency ghc-heap: using ghc-heap-9.6.3
  16903. 895.60 s [nothunks] Dependency stm: using stm-2.5.1.0
  16904. 895.60 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.0.2
  16905. 895.60 s [nothunks] Dependency time: using time-1.12.2
  16906. 895.60 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  16907. 895.60 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.2: using wherefrom-compat-0.1.1.1
  16908. 895.60 s [nothunks] Dependency base: using base-4.18.1.0
  16909. 895.60 s [nothunks] Dependency containers: using containers-0.6.7
  16910. 895.60 s [nothunks] Dependency ghc-prim: using ghc-prim-0.10.0
  16911. 895.60 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  16912. 895.60 s [nothunks] Dependency nothunks: using nothunks-0.3.0.0
  16913. 895.60 s [nothunks] Dependency random: using random-1.2.1.3
  16914. 895.60 s [nothunks] Dependency stm: using stm-2.5.1.0
  16915. 895.60 s [nothunks] Dependency tasty: using tasty-1.5.3
  16916. 895.60 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  16917. 896.18 s [nothunks] Source component graph:
  16918. 896.18 s [nothunks] component lib
  16919. 896.18 s [nothunks] component test:nothunks-test dependency lib
  16920. 896.18 s [nothunks] Configured component graph:
  16921. 896.23 s [nothunks] component nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  16922. 896.23 s [nothunks] include base-4.18.1.0
  16923. 896.23 s [nothunks] include bytestring-0.11.5.2
  16924. 896.23 s [nothunks] include containers-0.6.7
  16925. 896.23 s [nothunks] include ghc-heap-9.6.3
  16926. 896.23 s [nothunks] include stm-2.5.1.0
  16927. 896.23 s [nothunks] include text-2.0.2
  16928. 896.23 s [nothunks] include time-1.12.2
  16929. 896.23 s [nothunks] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  16930. 896.23 s [nothunks] include wherefrom-compat-0.1.1.1-HCMmGRXYVZn7F7b71WSuvO
  16931. 896.23 s [nothunks] component nothunks-0.3.0.0-9L4TmBxK8nOHaSlA5TZk5H-nothunks-test
  16932. 896.23 s [nothunks] include base-4.18.1.0
  16933. 896.23 s [nothunks] include containers-0.6.7
  16934. 896.23 s [nothunks] include ghc-prim-0.10.0
  16935. 896.23 s [nothunks] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  16936. 896.23 s [nothunks] include nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  16937. 896.23 s [nothunks] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  16938. 896.23 s [nothunks] include stm-2.5.1.0
  16939. 896.23 s [nothunks] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  16940. 896.23 s [nothunks] include tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1
  16941. 896.23 s [nothunks] Linked component graph:
  16942. 896.23 s [nothunks] unit nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  16943. 896.23 s [nothunks] include base-4.18.1.0
  16944. 896.23 s [nothunks] include bytestring-0.11.5.2
  16945. 896.24 s [nothunks] include containers-0.6.7
  16946. 896.24 s [nothunks] include ghc-heap-9.6.3
  16947. 896.24 s [nothunks] include stm-2.5.1.0
  16948. 896.24 s [nothunks] include text-2.0.2
  16949. 896.24 s [nothunks] include time-1.12.2
  16950. 896.24 s [nothunks] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  16951. 896.24 s [nothunks] include wherefrom-compat-0.1.1.1-HCMmGRXYVZn7F7b71WSuvO
  16952. 896.24 s [nothunks] NoThunks.Class=nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB:NoThunks.Class
  16953. 896.24 s [nothunks] unit nothunks-0.3.0.0-9L4TmBxK8nOHaSlA5TZk5H-nothunks-test
  16954. 896.24 s [nothunks] include base-4.18.1.0
  16955. 896.24 s [nothunks] include containers-0.6.7
  16956. 896.24 s [nothunks] include ghc-prim-0.10.0
  16957. 896.24 s [nothunks] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  16958. 896.24 s [nothunks] include nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  16959. 896.24 s [nothunks] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  16960. 896.24 s [nothunks] include stm-2.5.1.0
  16961. 896.24 s [nothunks] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  16962. 896.24 s [nothunks] include tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1
  16963. 896.24 s [nothunks] Ready component graph:
  16964. 896.24 s [nothunks] definite nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  16965. 896.24 s [nothunks] depends base-4.18.1.0
  16966. 896.24 s [nothunks] depends bytestring-0.11.5.2
  16967. 896.24 s [nothunks] depends containers-0.6.7
  16968. 896.24 s [nothunks] depends ghc-heap-9.6.3
  16969. 896.24 s [nothunks] depends stm-2.5.1.0
  16970. 896.24 s [nothunks] depends text-2.0.2
  16971. 896.24 s [nothunks] depends time-1.12.2
  16972. 896.24 s [nothunks] depends vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  16973. 896.24 s [nothunks] depends wherefrom-compat-0.1.1.1-HCMmGRXYVZn7F7b71WSuvO
  16974. 896.24 s [nothunks] definite nothunks-0.3.0.0-9L4TmBxK8nOHaSlA5TZk5H-nothunks-test
  16975. 896.24 s [nothunks] depends base-4.18.1.0
  16976. 896.24 s [nothunks] depends containers-0.6.7
  16977. 896.24 s [nothunks] depends ghc-prim-0.10.0
  16978. 896.24 s [nothunks] depends hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  16979. 896.24 s [nothunks] depends nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  16980. 896.24 s [nothunks] depends random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  16981. 896.24 s [nothunks] depends stm-2.5.1.0
  16982. 896.24 s [nothunks] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  16983. 896.24 s [nothunks] depends tasty-hedgehog-1.4.0.2-LxUvW2D8BE4jjTizq9Qu1
  16984. 896.24 s [nothunks] Using Cabal-3.10.1.0 compiled by ghc-9.6
  16985. 896.24 s [nothunks] Using compiler: ghc-9.6.3
  16986. 896.24 s [nothunks] Using install prefix:
  16987. 896.24 s [nothunks] /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0
  16988. 896.24 s [nothunks] Executables installed in:
  16989. 896.24 s [nothunks] /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/bin
  16990. 896.24 s [nothunks] Libraries installed in:
  16991. 896.24 s [nothunks] /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  16992. 896.24 s [nothunks] Dynamic Libraries installed in:
  16993. 896.24 s [nothunks] /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  16994. 896.24 s [nothunks] Private executables installed in:
  16995. 896.24 s [nothunks] /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/libexec/x86_64-linux-ghc-9.6.3/nothunks-0.3.0.0
  16996. 896.24 s [nothunks] Data files installed in:
  16997. 896.24 s [nothunks] /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/share/x86_64-linux-ghc-9.6.3/nothunks-0.3.0.0
  16998. 896.24 s [nothunks] Documentation installed in:
  16999. 896.24 s [nothunks] /nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0
  17000. 896.24 s [nothunks] Configuration files installed in:
  17001. 896.24 s [nothunks] /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/etc
  17002. 896.24 s [nothunks] No alex found
  17003. 896.24 s [nothunks] Using ar found on system at:
  17004. 896.24 s [nothunks] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  17005. 896.24 s [nothunks] No c2hs found
  17006. 896.24 s [nothunks] No cpphs found
  17007. 896.24 s [nothunks] No doctest found
  17008. 896.24 s [nothunks] Using gcc version 14.3.0 given by user at:
  17009. 896.24 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  17010. 896.24 s [nothunks] Using ghc version 9.6.3 found on system at:
  17011. 896.24 s [nothunks] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  17012. 896.24 s [nothunks] Using ghc-pkg version 9.6.3 found on system at:
  17013. 896.24 s [nothunks] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  17014. 896.24 s [nothunks] No ghcjs found
  17015. 896.24 s [nothunks] No ghcjs-pkg found
  17016. 896.24 s [nothunks] No greencard found
  17017. 896.24 s [nothunks] Using haddock version 2.29.1 found on system at:
  17018. 896.24 s [nothunks] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  17019. 896.24 s [nothunks] No happy found
  17020. 896.24 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  17021. 896.24 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17022. 896.24 s [nothunks] No hmake found
  17023. 896.24 s [nothunks] Using hpc version 0.68 found on system at:
  17024. 896.24 s [nothunks] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  17025. 896.24 s [nothunks] Using hsc2hs version 0.68.9 found on system at:
  17026. 896.24 s [nothunks] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  17027. 896.24 s [nothunks] Using hscolour version 1.25 found on system at:
  17028. 896.24 s [nothunks] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  17029. 896.24 s [nothunks] No jhc found
  17030. 896.24 s [nothunks] Using ld found on system at:
  17031. 896.24 s [nothunks] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  17032. 896.24 s [nothunks] No pkg-config found
  17033. 896.24 s [nothunks] Using runghc version 9.6.3 found on system at:
  17034. 896.24 s [nothunks] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  17035. 896.24 s [nothunks] Using strip version 2.44 found on system at:
  17036. 896.24 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  17037. 896.24 s [nothunks] Using tar found on system at:
  17038. 896.24 s [nothunks] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  17039. 896.24 s [nothunks] No uhc found
  17040. 896.43 s [nothunks] Phase: buildPhase
  17041. 896.64 s [nothunks] Preprocessing library for nothunks-0.3.0.0..
  17042. 896.67 s [nothunks] Building library for nothunks-0.3.0.0..
  17043. 896.95 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  17044. 901.05 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  17045. 905.96 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
  17046. 905.96 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.0.0..
  17047. 906.09 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 )
  17048. 908.90 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  17049. 909.40 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  17050. 910.60 s [nothunks] Phase: checkPhase
  17051. 910.63 s [nothunks] Running 1 test suites...
  17052. 910.63 s [nothunks] Test suite nothunks-test: RUNNING...
  17053. 910.64 s [nothunks] Tests
  17054. 910.64 s [nothunks] NoThunks.Class
  17055. 910.64 s [nothunks] Sanity
  17056. 910.64 s [nothunks] IntNotNF: OK
  17057. 910.64 s [nothunks] ✓ <interactive> passed 1 test.
  17058. 910.64 s [nothunks] IntIsNF: OK
  17059. 910.64 s [nothunks] ✓ <interactive> passed 1 test.
  17060. 910.64 s [nothunks] Pair: OK
  17061. 910.64 s [nothunks] ✓ <interactive> passed 1 test.
  17062. 910.64 s [nothunks] Sum: OK
  17063. 910.64 s [nothunks] ✓ <interactive> passed 1 test.
  17064. 910.64 s [nothunks] Fn: OK
  17065. 910.64 s [nothunks] ✓ <interactive> passed 1 test.
  17066. 910.64 s [nothunks] IO: OK
  17067. 910.64 s [nothunks] ✓ <interactive> passed 1 test.
  17068. 910.65 s [nothunks] InspectHeap
  17069. 910.67 s [nothunks] Int: OK (0.02s)
  17070. 910.67 s [nothunks] ✓ <interactive> passed 1000 tests.
  17071. 910.67 s [nothunks] Just ["Int"] 49% █████████▊··········
  17072. 910.67 s [nothunks] Nothing 51% ██████████▏·········
  17073. 910.69 s [nothunks] IntInt: OK (0.02s)
  17074. 910.69 s [nothunks] ✓ <interactive> passed 1000 tests.
  17075. 910.69 s [nothunks] Just ["(,)"] 51% ██████████▏·········
  17076. 910.69 s [nothunks] Just ["Int","(,)"] 36% ███████▎············
  17077. 910.69 s [nothunks] Nothing 13% ██▌·················
  17078. 910.71 s [nothunks] SumInt: OK (0.02s)
  17079. 910.71 s [nothunks] ✓ <interactive> passed 1000 tests.
  17080. 910.71 s [nothunks] Just ["Either"] 33% ██████▋·············
  17081. 910.71 s [nothunks] Just ["Int","Either"] 34% ██████▉·············
  17082. 910.71 s [nothunks] Nothing 32% ██████▍·············
  17083. 910.73 s [nothunks] ListInt: OK (0.02s)
  17084. 910.73 s [nothunks] ✓ <interactive> passed 1000 tests.
  17085. 910.73 s [nothunks] Just ["Int","List"] 22% ████▎···············
  17086. 910.73 s [nothunks] Just ["List"] 44% ████████▊···········
  17087. 910.73 s [nothunks] Nothing 34% ██████▊·············
  17088. 910.75 s [nothunks] IntListInt: OK (0.03s)
  17089. 910.75 s [nothunks] ✓ <interactive> passed 1000 tests.
  17090. 910.75 s [nothunks] Just ["(,)"] 50% █████████▉··········
  17091. 910.75 s [nothunks] Just ["Int","(,)"] 26% █████▎··············
  17092. 910.75 s [nothunks] Just ["Int","List","(,)"] 5% █···················
  17093. 910.75 s [nothunks] Just ["List","(,)"] 10% █▉··················
  17094. 910.75 s [nothunks] Nothing 9% █▊··················
  17095. 910.77 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  17096. 910.77 s [nothunks] after 9 tests and 1 shrink.
  17097. 910.77 s [nothunks] shrink path: 9:c
  17098. 910.77 s [nothunks] Nothing 89% █████████████████▊··
  17099. 910.77 s [nothunks]
  17100. 910.77 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  17101. 910.77 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  17102. 910.77 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  17103. 910.77 s [nothunks] 168 ┃ -> Proxy a
  17104. 910.77 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  17105. 910.77 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  17106. 910.77 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  17107. 910.77 s [nothunks] 172 ┃ -> Property
  17108. 910.77 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  17109. 910.77 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  17110. 910.77 s [nothunks] ┃ │ Wrap
  17111. 910.77 s [nothunks] ┃ │ { unwrap =
  17112. 910.77 s [nothunks] ┃ │ SeqEnqueue
  17113. 910.77 s [nothunks] ┃ │ (IntValue 0)
  17114. 910.77 s [nothunks] ┃ │ (SeqEnqueue
  17115. 910.77 s [nothunks] ┃ │ (IntValue 0)
  17116. 910.77 s [nothunks] ┃ │ (SeqEnqueue
  17117. 910.77 s [nothunks] ┃ │ (IntValue 0)
  17118. 910.77 s [nothunks] ┃ │ (SeqEnqueue
  17119. 910.77 s [nothunks] ┃ │ (IntValue 0)
  17120. 910.77 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  17121. 910.77 s [nothunks] ┃ │ }
  17122. 910.77 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  17123. 910.77 s [nothunks] 176 ┃ fromModel m $ \a -> do
  17124. 910.77 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  17125. 910.77 s [nothunks] ┃ │ IsNF
  17126. 910.77 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  17127. 910.77 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  17128. 910.77 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17129. 910.77 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  17130. 910.77 s [nothunks] ┃ │ - Just
  17131. 910.77 s [nothunks] ┃ │ - ThunkInfo
  17132. 910.77 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  17133. 910.77 s [nothunks] ┃ │ + Nothing
  17134. 910.77 s [nothunks]
  17135. 910.77 s [nothunks] This failure can be reproduced by running:
  17136. 910.78 s [nothunks] > recheckAt (Seed 17030691440204569342 13718076039328241651) "9:c" EXPECTED FAILURE
  17137. 910.78 s [nothunks]
  17138. 910.79 s [nothunks] OK (0.02s)
  17139. 910.79 s [nothunks] ✓ <interactive> passed 1 test.
  17140. 910.79 s [nothunks] Model
  17141. 910.80 s [nothunks] Int: OK (0.01s)
  17142. 910.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  17143. 910.80 s [nothunks] Just ["Int"] 50% ██████████··········
  17144. 910.80 s [nothunks] Nothing 50% ██████████··········
  17145. 910.82 s [nothunks] IntInt: OK (0.02s)
  17146. 910.82 s [nothunks] ✓ <interactive> passed 1000 tests.
  17147. 910.82 s [nothunks] Just ["(,)"] 49% █████████▊··········
  17148. 910.82 s [nothunks] Just ["Int","(,)"] 39% ███████▋············
  17149. 910.82 s [nothunks] Nothing 12% ██▍·················
  17150. 910.84 s [nothunks] SumInt: OK (0.01s)
  17151. 910.84 s [nothunks] ✓ <interactive> passed 1000 tests.
  17152. 910.84 s [nothunks] Just ["Either"] 35% ███████·············
  17153. 910.84 s [nothunks] Just ["Int","Either"] 31% ██████▏·············
  17154. 910.84 s [nothunks] Nothing 34% ██████▋·············
  17155. 910.86 s [nothunks] ListInt: OK (0.02s)
  17156. 910.86 s [nothunks] ✓ <interactive> passed 1000 tests.
  17157. 910.86 s [nothunks] Just ["Int","List"] 22% ████▍···············
  17158. 910.86 s [nothunks] Just ["List"] 44% ████████▊···········
  17159. 910.86 s [nothunks] Nothing 33% ██████▋·············
  17160. 910.87 s [nothunks] IntListInt: OK (0.03s)
  17161. 910.87 s [nothunks] ✓ <interactive> passed 1000 tests.
  17162. 910.87 s [nothunks] Just ["(,)"] 51% ██████████▏·········
  17163. 910.87 s [nothunks] Just ["Int","(,)"] 24% ████▊···············
  17164. 910.87 s [nothunks] Just ["Int","List","(,)"] 6% █▏··················
  17165. 910.87 s [nothunks] Just ["List","(,)"] 12% ██▎·················
  17166. 910.87 s [nothunks] Nothing 7% █▍··················
  17167. 910.95 s [nothunks] SeqInt: OK (0.08s)
  17168. 910.95 s [nothunks] ✓ <interactive> passed 1000 tests.
  17169. 910.95 s [nothunks] Just ["Int","Seq"] 48% █████████▋··········
  17170. 910.95 s [nothunks] Nothing 52% ██████████▎·········
  17171. 910.97 s [nothunks] AllowThunksIn: OK (0.03s)
  17172. 911.05 s [nothunks] ✓ <interactive> passed 1000 tests.
  17173. 911.06 s [nothunks] Just ["Int","field2","Record"] 26% █████···············
  17174. 911.06 s [nothunks] Just ["Record"] 49% █████████▊··········
  17175. 911.06 s [nothunks] Nothing 25% █████···············
  17176. 911.06 s [nothunks] Fn: OK (0.01s)
  17177. 911.06 s [nothunks] ✓ <interactive> passed 1000 tests.
  17178. 911.06 s [nothunks] Just ["->"] 26% █████▎··············
  17179. 911.06 s [nothunks] Nothing 74% ██████████████▋·····
  17180. 911.06 s [nothunks] IO: OK (0.01s)
  17181. 911.06 s [nothunks] ✓ <interactive> passed 1000 tests.
  17182. 911.06 s [nothunks] Just ["IO"] 24% ████▊···············
  17183. 911.06 s [nothunks] Nothing 76% ███████████████▏····
  17184. 911.06 s [nothunks] ThunkFreeFn: OK (0.01s)
  17185. 911.06 s [nothunks] ✓ <interactive> passed 1000 tests.
  17186. 911.06 s [nothunks] Just ["->"] 25% █████···············
  17187. 911.06 s [nothunks] Just ["...","->"] 37% ███████▎············
  17188. 911.06 s [nothunks] Nothing 38% ███████▋············
  17189. 911.06 s [nothunks] ThunkFreeIO: OK (0.01s)
  17190. 911.06 s [nothunks] ✓ <interactive> passed 1000 tests.
  17191. 911.06 s [nothunks] Just ["...","IO"] 38% ███████▌············
  17192. 911.06 s [nothunks] Just ["IO"] 24% ████▋···············
  17193. 911.06 s [nothunks] Nothing 38% ███████▋············
  17194. 911.06 s [nothunks] MutableVars
  17195. 911.06 s [nothunks] IORef
  17196. 911.06 s [nothunks] NotNF: OK
  17197. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17198. 911.06 s [nothunks] NF: OK
  17199. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17200. 911.06 s [nothunks] NotNFPure: OK
  17201. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17202. 911.06 s [nothunks] NFPure: OK
  17203. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17204. 911.06 s [nothunks] NotNFAtomically: OK
  17205. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17206. 911.06 s [nothunks] NFAtomically: OK
  17207. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17208. 911.06 s [nothunks] MVar
  17209. 911.06 s [nothunks] NotNF: OK
  17210. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17211. 911.06 s [nothunks] NF: OK
  17212. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17213. 911.06 s [nothunks] NotNFPure: OK
  17214. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17215. 911.06 s [nothunks] NFPure: OK
  17216. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17217. 911.06 s [nothunks] NotNFAtomically: OK
  17218. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17219. 911.06 s [nothunks] NFAtomically: OK
  17220. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17221. 911.06 s [nothunks] TVar
  17222. 911.06 s [nothunks] NotNF: OK
  17223. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17224. 911.06 s [nothunks] NF: OK
  17225. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17226. 911.06 s [nothunks] NotNFPure: OK
  17227. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17228. 911.06 s [nothunks] NFPure: OK
  17229. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17230. 911.06 s [nothunks] NotNFAtomically: OK
  17231. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17232. 911.06 s [nothunks] NFAtomically: OK
  17233. 911.06 s [nothunks] ✓ <interactive> passed 1 test.
  17234. 911.06 s [nothunks]
  17235. 911.06 s [nothunks] All 41 tests passed (0.37s)
  17236. 911.06 s [nothunks] Test suite nothunks-test: PASS
  17237. 911.06 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
  17238. 911.06 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  17239. 911.06 s [nothunks] Phase: haddockPhase
  17240. 911.25 s [nothunks] Preprocessing library for nothunks-0.3.0.0..
  17241. 911.25 s [nothunks] Running Haddock on library for nothunks-0.3.0.0..
  17242. 911.25 s [nothunks] Warning: The documentation for the following packages are not installed. No
  17243. 911.25 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  17244. 911.32 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  17245. 911.98 s [nothunks] Warning: 'GHC' is out of scope.
  17246. 911.98 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17247. 911.98 s [nothunks] Warning: 'a' is out of scope.
  17248. 911.98 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17249. 911.99 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  17250. 911.99 s [nothunks] Missing documentation for:
  17251. 911.99 s [nothunks] Module header
  17252. 912.56 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  17253. 912.56 s [nothunks] - Data.Vector.Vector
  17254. 912.56 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  17255. 912.56 s [nothunks] - NoThunks.Class.HasFields
  17256. 912.56 s [nothunks] - NoThunks.Class.Elem
  17257. 912.56 s [nothunks] - NoThunks.Class.GShowTypeOf
  17258. 912.56 s [nothunks] - NoThunks.Class.GWRecordField
  17259. 912.56 s [nothunks] - NoThunks.Class.checkContainsThunks
  17260. 915.69 s [nothunks] Documentation created: dist/doc/html/nothunks/index.html,
  17261. 915.69 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  17262. 915.75 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
  17263. 915.77 s [nothunks] Phase: installPhase
  17264. 915.85 s [nothunks] Installing library in /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  17265. 916.15 s [nothunks] Phase: fixupPhase
  17266. 916.17 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0
  17267. 916.23 s [nothunks] shrinking /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSnothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB-ghc9.6.3.so
  17268. 916.23 s [nothunks] checking for references to /build/ in /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0...
  17269. 916.23 s [nothunks] patching script interpreter paths in /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0
  17270. 916.23 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0/lib
  17271. 916.29 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc
  17272. 916.30 s [nothunks] checking for references to /build/ in /nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc...
  17273. 916.31 s [nothunks] patching script interpreter paths in /nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc
  17274. 916.45 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0
  17275. 917.17 s [nothunks:post-build] Pushing 2 paths (96 are already present) using zstd to cache sellout ⏳
  17276. 917.17 s [nothunks:post-build]
  17277. 917.53 s [nothunks:post-build] Pushing /nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc (836.24 KiB)
  17278. 917.61 s [nothunks:post-build] Pushing /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0 (2.74 MiB)
  17279. 918.61 s [nothunks:post-build]
  17280. 918.61 s [nothunks:post-build] All done.
  17281. 918.67 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc /nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0
  17282. 918.82 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17283. 919.05 s [nothunks:post-build] copying 2 paths...
  17284. 919.05 s [nothunks:post-build] copying path '/nix/store/5fh13b6dhfh3l2a38f4q10jbvdgpm325-nothunks-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
  17285. 919.45 s [nothunks:post-build] copying path '/nix/store/ghgcajl4c6db895q7ndfcgcd4ynxdyih-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...
  17286. 920.62 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17287. 921.03 s [nothunks:post-build] copying 1 paths...
  17288. 921.03 s [nothunks:post-build] copying path '/nix/store/dbqfxi0pwxrhrcicgk12f7jf559ayfki-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  17289. 921.38 s Progress: 104 of 113 built, 172 of 172 downloaded from cache
  17290. 921.45 s Building /nix/store/babfbfa6s7vb79lijcmrkdgalir99spf-unordered-containers-0.2.20.drv
  17291. 921.63 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  17292. 921.64 s [unordered-containers] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  17293. 922.08 s [unordered-containers] Phase: unpackPhase
  17294. 922.08 s [unordered-containers] unpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
  17295. 922.10 s [unordered-containers] source root is unordered-containers-0.2.20
  17296. 922.12 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
  17297. 922.14 s [unordered-containers] Phase: patchPhase
  17298. 922.15 s [unordered-containers] Replace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
  17299. 922.17 s [unordered-containers] Phase: compileBuildDriverPhase
  17300. 922.17 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.Zy4dW2Ra7L/setup-package.conf.d -threaded
  17301. 922.27 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Zy4dW2Ra7L/Main.o )
  17302. 922.35 s [unordered-containers] [2 of 2] Linking Setup
  17303. 924.30 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  17304. 924.31 s [unordered-containers] Phase: configurePhase
  17305. 924.32 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.Zy4dW2Ra7L/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  17306. 924.33 s [unordered-containers] Using Parsec parser
  17307. 924.33 s [unordered-containers] Configuring unordered-containers-0.2.20...
  17308. 925.06 s [unordered-containers] Flags chosen: debug=False
  17309. 925.06 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.18.1.0
  17310. 925.06 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.4.8.1
  17311. 925.06 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
  17312. 925.06 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.20.0.0
  17313. 925.06 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.15
  17314. 925.06 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  17315. 925.06 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
  17316. 925.06 s [unordered-containers] Dependency base: using base-4.18.1.0
  17317. 925.06 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.7
  17318. 925.06 s [unordered-containers] Dependency hashable: using hashable-1.4.7.0
  17319. 925.06 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.0.0
  17320. 925.06 s [unordered-containers] Dependency random: using random-1.2.1.3
  17321. 925.06 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  17322. 925.06 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  17323. 925.06 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
  17324. 925.06 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20
  17325. 925.41 s [unordered-containers] Source component graph:
  17326. 925.41 s [unordered-containers] component lib
  17327. 925.41 s [unordered-containers] component test:unordered-containers-tests dependency lib
  17328. 925.41 s [unordered-containers] Configured component graph:
  17329. 925.41 s [unordered-containers] component unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  17330. 925.41 s [unordered-containers] include base-4.18.1.0
  17331. 925.41 s [unordered-containers] include deepseq-1.4.8.1
  17332. 925.41 s [unordered-containers] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  17333. 925.41 s [unordered-containers] include template-haskell-2.20.0.0
  17334. 925.41 s [unordered-containers] component unordered-containers-0.2.20-GdIQipvEzcJ42tjT2Yroyv-unordered-containers-tests
  17335. 925.41 s [unordered-containers] include ChasingBottoms-1.3.1.15-JeN0fNcjSC1ugbIhfA4yW
  17336. 925.41 s [unordered-containers] include HUnit-1.6.2.0-Cmk1z9y2zFk3aX4g3H2nfT
  17337. 925.41 s [unordered-containers] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  17338. 925.41 s [unordered-containers] include base-4.18.1.0
  17339. 925.41 s [unordered-containers] include containers-0.6.7
  17340. 925.41 s [unordered-containers] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  17341. 925.41 s [unordered-containers] include nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  17342. 925.41 s [unordered-containers] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  17343. 925.41 s [unordered-containers] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  17344. 925.41 s [unordered-containers] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  17345. 925.41 s [unordered-containers] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  17346. 925.41 s [unordered-containers] include unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  17347. 925.41 s [unordered-containers] Linked component graph:
  17348. 925.41 s [unordered-containers] unit unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  17349. 925.42 s [unordered-containers] include base-4.18.1.0
  17350. 925.42 s [unordered-containers] include deepseq-1.4.8.1
  17351. 925.42 s [unordered-containers] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  17352. 925.42 s [unordered-containers] include template-haskell-2.20.0.0
  17353. 925.42 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn:Data.HashSet.Internal
  17354. 925.42 s [unordered-containers] unit unordered-containers-0.2.20-GdIQipvEzcJ42tjT2Yroyv-unordered-containers-tests
  17355. 925.42 s [unordered-containers] include ChasingBottoms-1.3.1.15-JeN0fNcjSC1ugbIhfA4yW
  17356. 925.42 s [unordered-containers] include HUnit-1.6.2.0-Cmk1z9y2zFk3aX4g3H2nfT
  17357. 925.42 s [unordered-containers] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  17358. 925.42 s [unordered-containers] include base-4.18.1.0
  17359. 925.42 s [unordered-containers] include containers-0.6.7
  17360. 925.42 s [unordered-containers] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  17361. 925.42 s [unordered-containers] include nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  17362. 925.42 s [unordered-containers] include random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  17363. 925.42 s [unordered-containers] include tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  17364. 925.42 s [unordered-containers] include tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  17365. 925.42 s [unordered-containers] include tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  17366. 925.42 s [unordered-containers] include unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  17367. 925.42 s [unordered-containers] Ready component graph:
  17368. 925.42 s [unordered-containers] definite unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  17369. 925.42 s [unordered-containers] depends base-4.18.1.0
  17370. 925.42 s [unordered-containers] depends deepseq-1.4.8.1
  17371. 925.42 s [unordered-containers] depends hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  17372. 925.42 s [unordered-containers] depends template-haskell-2.20.0.0
  17373. 925.42 s [unordered-containers] definite unordered-containers-0.2.20-GdIQipvEzcJ42tjT2Yroyv-unordered-containers-tests
  17374. 925.42 s [unordered-containers] depends ChasingBottoms-1.3.1.15-JeN0fNcjSC1ugbIhfA4yW
  17375. 925.42 s [unordered-containers] depends HUnit-1.6.2.0-Cmk1z9y2zFk3aX4g3H2nfT
  17376. 925.42 s [unordered-containers] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  17377. 925.42 s [unordered-containers] depends base-4.18.1.0
  17378. 925.42 s [unordered-containers] depends containers-0.6.7
  17379. 925.42 s [unordered-containers] depends hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  17380. 925.42 s [unordered-containers] depends nothunks-0.3.0.0-7ohoJeH9HDPHW0lcjAtCYB
  17381. 925.42 s [unordered-containers] depends random-1.2.1.3-9k6Qv394i0yCaivAy2bSc0
  17382. 925.42 s [unordered-containers] depends tasty-1.5.3-9zGpMC6Ttly7LCIedANHX6
  17383. 925.42 s [unordered-containers] depends tasty-hunit-0.10.2-HGm8sccssx1BtIU4TO93vm
  17384. 925.42 s [unordered-containers] depends tasty-quickcheck-0.11-HhViYyBQlQLAr2fMuKMnwF
  17385. 925.42 s [unordered-containers] depends unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  17386. 925.42 s [unordered-containers] Using Cabal-3.10.1.0 compiled by ghc-9.6
  17387. 925.42 s [unordered-containers] Using compiler: ghc-9.6.3
  17388. 925.42 s [unordered-containers] Using install prefix:
  17389. 925.42 s [unordered-containers] /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20
  17390. 925.42 s [unordered-containers] Executables installed in:
  17391. 925.42 s [unordered-containers] /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/bin
  17392. 925.42 s [unordered-containers] Libraries installed in:
  17393. 925.42 s [unordered-containers] /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  17394. 925.42 s [unordered-containers] Dynamic Libraries installed in:
  17395. 925.42 s [unordered-containers] /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  17396. 925.42 s [unordered-containers] Private executables installed in:
  17397. 925.42 s [unordered-containers] /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.6.3/unordered-containers-0.2.20
  17398. 925.42 s [unordered-containers] Data files installed in:
  17399. 925.42 s [unordered-containers] /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.6.3/unordered-containers-0.2.20
  17400. 925.42 s [unordered-containers] Documentation installed in:
  17401. 925.42 s [unordered-containers] /nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
  17402. 925.42 s [unordered-containers] Configuration files installed in:
  17403. 925.42 s [unordered-containers] /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/etc
  17404. 925.42 s [unordered-containers] No alex found
  17405. 925.42 s [unordered-containers] Using ar found on system at:
  17406. 925.42 s [unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  17407. 925.42 s [unordered-containers] No c2hs found
  17408. 925.42 s [unordered-containers] No cpphs found
  17409. 925.42 s [unordered-containers] No doctest found
  17410. 925.42 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  17411. 925.42 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  17412. 925.42 s [unordered-containers] Using ghc version 9.6.3 found on system at:
  17413. 925.42 s [unordered-containers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  17414. 925.42 s [unordered-containers] Using ghc-pkg version 9.6.3 found on system at:
  17415. 925.42 s [unordered-containers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  17416. 925.42 s [unordered-containers] No ghcjs found
  17417. 925.42 s [unordered-containers] No ghcjs-pkg found
  17418. 925.42 s [unordered-containers] No greencard found
  17419. 925.42 s [unordered-containers] Using haddock version 2.29.1 found on system at:
  17420. 925.42 s [unordered-containers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  17421. 925.42 s [unordered-containers] No happy found
  17422. 925.42 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  17423. 925.42 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17424. 925.42 s [unordered-containers] No hmake found
  17425. 925.42 s [unordered-containers] Using hpc version 0.68 found on system at:
  17426. 925.42 s [unordered-containers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  17427. 925.42 s [unordered-containers] Using hsc2hs version 0.68.9 found on system at:
  17428. 925.42 s [unordered-containers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  17429. 925.42 s [unordered-containers] Using hscolour version 1.25 found on system at:
  17430. 925.42 s [unordered-containers] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  17431. 925.42 s [unordered-containers] No jhc found
  17432. 925.42 s [unordered-containers] Using ld found on system at:
  17433. 925.42 s [unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  17434. 925.42 s [unordered-containers] No pkg-config found
  17435. 925.42 s [unordered-containers] Using runghc version 9.6.3 found on system at:
  17436. 925.42 s [unordered-containers] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  17437. 925.42 s [unordered-containers] Using strip version 2.44 found on system at:
  17438. 925.42 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  17439. 925.42 s [unordered-containers] Using tar found on system at:
  17440. 925.42 s [unordered-containers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  17441. 925.42 s [unordered-containers] No uhc found
  17442. 925.63 s [unordered-containers] Phase: buildPhase
  17443. 925.71 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20..
  17444. 925.72 s [unordered-containers] Building library for unordered-containers-0.2.20..
  17445. 925.83 s [unordered-containers]
  17446. 925.83 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  17447. 925.83 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17448. 925.83 s [unordered-containers] |
  17449. 925.83 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17450. 925.83 s [unordered-containers] | ^^^^^^^^^^
  17451. 926.11 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 )
  17452. 926.33 s [unordered-containers]
  17453. 926.34 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  17454. 926.34 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17455. 926.34 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17456. 926.34 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17457. 926.34 s [unordered-containers] |
  17458. 926.34 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17459. 926.34 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17460. 927.04 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 )
  17461. 927.13 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 )
  17462. 935.40 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 )
  17463. 935.75 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 )
  17464. 937.57 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 )
  17465. 937.57 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  17466. 937.57 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 )
  17467. 937.67 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 )
  17468. 938.01 s [unordered-containers]
  17469. 938.01 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  17470. 938.01 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17471. 938.01 s [unordered-containers] |
  17472. 938.01 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17473. 938.01 s [unordered-containers] | ^^^^^^^^^^
  17474. 938.39 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  17475. 938.54 s [unordered-containers]
  17476. 938.54 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  17477. 938.54 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17478. 938.54 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17479. 938.54 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17480. 938.54 s [unordered-containers] |
  17481. 938.54 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17482. 938.54 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17483. 939.32 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  17484. 939.32 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  17485. 949.44 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  17486. 950.32 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  17487. 953.12 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  17488. 953.12 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  17489. 953.12 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  17490. 953.24 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  17491. 954.58 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  17492. 954.58 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  17493. 954.77 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 )
  17494. 955.09 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  17495. 957.87 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 )
  17496. 957.87 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  17497. 957.87 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 )
  17498. 957.87 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 )
  17499. 963.67 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 )
  17500. 963.70 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  17501. 963.70 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  17502. 964.09 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  17503. 964.99 s [unordered-containers] buildPhase completed in 39 seconds
  17504. 964.99 s [unordered-containers] Phase: checkPhase
  17505. 965.02 s [unordered-containers] Running 1 test suites...
  17506. 965.02 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  17507. 965.04 s [unordered-containers] All
  17508. 965.04 s [unordered-containers] Properties
  17509. 965.04 s [unordered-containers] Data.HashMap.Lazy
  17510. 965.04 s [unordered-containers] instances
  17511. 965.04 s [unordered-containers] Eq
  17512. 965.06 s [unordered-containers] ==: OK (0.02s)
  17513. 965.07 s [unordered-containers] +++ OK, passed 100 tests.
  17514. 965.07 s [unordered-containers] /=: OK (0.03s)
  17515. 965.08 s [unordered-containers] +++ OK, passed 100 tests.
  17516. 965.08 s [unordered-containers] Ord
  17517. 965.08 s [unordered-containers] compare reflexive: OK (0.01s)
  17518. 965.08 s [unordered-containers] +++ OK, passed 100 tests.
  17519. 965.08 s [unordered-containers] compare transitive: OK (0.03s)
  17520. 965.08 s [unordered-containers] +++ OK, passed 100 tests.
  17521. 965.08 s [unordered-containers] compare antisymmetric: OK (0.02s)
  17522. 965.08 s [unordered-containers] +++ OK, passed 100 tests.
  17523. 965.08 s [unordered-containers] Ord => Eq: OK (0.01s)
  17524. 965.08 s [unordered-containers] +++ OK, passed 100 tests.
  17525. 965.14 s [unordered-containers] Read/Show: OK (0.10s)
  17526. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17527. 965.15 s [unordered-containers] Functor: OK (0.06s)
  17528. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17529. 965.15 s [unordered-containers] Foldable: OK (0.02s)
  17530. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17531. 965.15 s [unordered-containers] Bifoldable
  17532. 965.15 s [unordered-containers] bifoldMap: OK (0.01s)
  17533. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17534. 965.15 s [unordered-containers] bifoldr: OK (0.02s)
  17535. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17536. 965.15 s [unordered-containers] bifoldl: OK (0.02s)
  17537. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17538. 965.15 s [unordered-containers] Hashable: OK (0.02s)
  17539. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17540. 965.15 s [unordered-containers] empty
  17541. 965.15 s [unordered-containers] valid: OK
  17542. 965.15 s [unordered-containers] +++ OK, passed 1 test.
  17543. 965.15 s [unordered-containers] singleton
  17544. 965.15 s [unordered-containers] valid: OK (0.01s)
  17545. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17546. 965.15 s [unordered-containers] size: OK (0.02s)
  17547. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17548. 965.15 s [unordered-containers] member: OK
  17549. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17550. 965.15 s [unordered-containers] lookup: OK (0.02s)
  17551. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17552. 965.15 s [unordered-containers] !?: OK
  17553. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17554. 965.15 s [unordered-containers] insert
  17555. 965.15 s [unordered-containers] model: OK (0.01s)
  17556. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17557. 965.15 s [unordered-containers] valid: OK
  17558. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17559. 965.15 s [unordered-containers] insertWith
  17560. 965.15 s [unordered-containers] insertWith: OK
  17561. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17562. 965.15 s [unordered-containers] valid: OK
  17563. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17564. 965.15 s [unordered-containers] delete
  17565. 965.15 s [unordered-containers] model: OK
  17566. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17567. 965.15 s [unordered-containers] valid: OK
  17568. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17569. 965.15 s [unordered-containers] adjust
  17570. 965.15 s [unordered-containers] model: OK
  17571. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17572. 965.15 s [unordered-containers] valid: OK (0.01s)
  17573. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17574. 965.15 s [unordered-containers] update
  17575. 965.15 s [unordered-containers] model: OK (0.01s)
  17576. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17577. 965.15 s [unordered-containers] valid: OK
  17578. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17579. 965.15 s [unordered-containers] alter
  17580. 965.15 s [unordered-containers] model: OK
  17581. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17582. 965.15 s [unordered-containers] valid: OK
  17583. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17584. 965.15 s [unordered-containers] alterF
  17585. 965.15 s [unordered-containers] model
  17586. 965.15 s [unordered-containers] []: OK (0.08s)
  17587. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17588. 965.15 s [unordered-containers] adjust: OK (0.01s)
  17589. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17590. 965.15 s [unordered-containers] insert: OK (0.02s)
  17591. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17592. 965.15 s [unordered-containers] insertWith: OK
  17593. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17594. 965.15 s [unordered-containers] delete: OK
  17595. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17596. 965.15 s [unordered-containers] lookup: OK (0.02s)
  17597. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17598. 965.15 s [unordered-containers] valid: OK (0.03s)
  17599. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17600. 965.15 s [unordered-containers] isSubmapOf
  17601. 965.15 s [unordered-containers] model: OK
  17602. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17603. 965.15 s [unordered-containers] m ⊆ m: OK
  17604. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17605. 965.15 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.01s)
  17606. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17607. 965.15 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.03s)
  17608. 965.15 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  17609. 965.15 s [unordered-containers] m1\m2 ⊆ m1: OK
  17610. 965.15 s [unordered-containers] +++ OK, passed 100 tests.
  17611. 965.15 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.05s)
  17612. 965.15 s [unordered-containers] +++ OK, passed 100 tests; 175 discarded.
  17613. 965.15 s [unordered-containers] delete k m ⊆ m: OK
  17614. 965.15 s [unordered-containers] +++ OK, passed 100 tests; 20 discarded.
  17615. 965.15 s [unordered-containers] m ⊈ delete k m : OK (0.01s)
  17616. 965.15 s [unordered-containers] +++ OK, passed 100 tests; 19 discarded.
  17617. 965.15 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  17618. 965.15 s [unordered-containers] +++ OK, passed 100 tests; 3 discarded.
  17619. 965.15 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.01s)
  17620. 965.17 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  17621. 965.17 s [unordered-containers] union
  17622. 965.17 s [unordered-containers] model: OK (0.02s)
  17623. 965.17 s [unordered-containers] +++ OK, passed 100 tests.
  17624. 965.17 s [unordered-containers] valid: OK
  17625. 965.17 s [unordered-containers] +++ OK, passed 100 tests.
  17626. 965.17 s [unordered-containers] unionWith
  17627. 965.17 s [unordered-containers] model: OK (0.02s)
  17628. 965.17 s [unordered-containers] +++ OK, passed 100 tests.
  17629. 965.17 s [unordered-containers] valid: OK (0.02s)
  17630. 965.17 s [unordered-containers] +++ OK, passed 100 tests.
  17631. 965.17 s [unordered-containers] unionWithKey
  17632. 965.17 s [unordered-containers] model: OK (0.06s)
  17633. 965.17 s [unordered-containers] +++ OK, passed 100 tests.
  17634. 965.17 s [unordered-containers] valid: OK (0.01s)
  17635. 965.17 s [unordered-containers] +++ OK, passed 100 tests.
  17636. 965.17 s [unordered-containers] unions
  17637. 965.85 s [unordered-containers] model: OK (0.77s)
  17638. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17639. 965.85 s [unordered-containers] valid: OK (0.26s)
  17640. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17641. 965.85 s [unordered-containers] difference
  17642. 965.85 s [unordered-containers] model: OK (0.01s)
  17643. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17644. 965.85 s [unordered-containers] valid: OK (0.03s)
  17645. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17646. 965.85 s [unordered-containers] differenceWith
  17647. 965.85 s [unordered-containers] model: OK (0.10s)
  17648. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17649. 965.85 s [unordered-containers] valid: OK
  17650. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17651. 965.85 s [unordered-containers] intersection
  17652. 965.85 s [unordered-containers] model: OK
  17653. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17654. 965.85 s [unordered-containers] valid: OK
  17655. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17656. 965.85 s [unordered-containers] intersectionWith
  17657. 965.85 s [unordered-containers] model: OK (0.04s)
  17658. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17659. 965.85 s [unordered-containers] valid: OK (0.01s)
  17660. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17661. 965.85 s [unordered-containers] intersectionWithKey
  17662. 965.85 s [unordered-containers] model: OK (0.05s)
  17663. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17664. 965.85 s [unordered-containers] valid: OK (0.02s)
  17665. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17666. 965.85 s [unordered-containers] compose
  17667. 965.85 s [unordered-containers] valid: OK (0.04s)
  17668. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17669. 965.85 s [unordered-containers] map
  17670. 965.85 s [unordered-containers] model: OK (0.11s)
  17671. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17672. 965.85 s [unordered-containers] valid: OK
  17673. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17674. 965.85 s [unordered-containers] traverseWithKey
  17675. 965.85 s [unordered-containers] model: OK (0.12s)
  17676. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17677. 965.85 s [unordered-containers] valid: OK (0.02s)
  17678. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17679. 965.85 s [unordered-containers] mapKeys
  17680. 965.85 s [unordered-containers] model: OK
  17681. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17682. 965.85 s [unordered-containers] valid: OK (0.26s)
  17683. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17684. 965.85 s [unordered-containers] foldr: OK (0.02s)
  17685. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17686. 965.85 s [unordered-containers] foldl: OK (0.01s)
  17687. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17688. 965.85 s [unordered-containers] foldrWithKey: OK (0.01s)
  17689. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17690. 965.85 s [unordered-containers] foldlWithKey: OK (0.02s)
  17691. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17692. 965.85 s [unordered-containers] foldrWithKey': OK (0.01s)
  17693. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17694. 965.85 s [unordered-containers] foldlWithKey': OK (0.02s)
  17695. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17696. 965.85 s [unordered-containers] foldl': OK (0.02s)
  17697. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17698. 965.85 s [unordered-containers] foldr': OK (0.01s)
  17699. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17700. 965.85 s [unordered-containers] foldMapWithKey: OK (0.01s)
  17701. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17702. 965.85 s [unordered-containers] filter
  17703. 965.85 s [unordered-containers] model: OK (0.09s)
  17704. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17705. 965.85 s [unordered-containers] valid: OK (0.03s)
  17706. 965.85 s [unordered-containers] +++ OK, passed 100 tests.
  17707. 965.85 s [unordered-containers] filterWithKey
  17708. 965.99 s [unordered-containers] model: OK (0.85s)
  17709. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17710. 965.99 s [unordered-containers] valid: OK (0.53s)
  17711. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17712. 965.99 s [unordered-containers] mapMaybe
  17713. 965.99 s [unordered-containers] model: OK (0.08s)
  17714. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17715. 965.99 s [unordered-containers] valid: OK (0.03s)
  17716. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17717. 965.99 s [unordered-containers] mapMaybeWithKey
  17718. 965.99 s [unordered-containers] model: OK (0.83s)
  17719. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17720. 965.99 s [unordered-containers] valid: OK (0.41s)
  17721. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17722. 965.99 s [unordered-containers] elems: OK (0.05s)
  17723. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17724. 965.99 s [unordered-containers] keys: OK (0.04s)
  17725. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17726. 965.99 s [unordered-containers] fromList
  17727. 965.99 s [unordered-containers] model: OK (0.02s)
  17728. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17729. 965.99 s [unordered-containers] valid: OK (0.01s)
  17730. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17731. 965.99 s [unordered-containers] fromListWith
  17732. 965.99 s [unordered-containers] model: OK (0.04s)
  17733. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17734. 965.99 s [unordered-containers] valid: OK (0.01s)
  17735. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17736. 965.99 s [unordered-containers] fromListWithKey
  17737. 965.99 s [unordered-containers] model: OK (0.02s)
  17738. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17739. 965.99 s [unordered-containers] valid: OK (0.02s)
  17740. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17741. 965.99 s [unordered-containers] toList: OK (0.02s)
  17742. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17743. 965.99 s [unordered-containers] Data.HashMap.Strict
  17744. 965.99 s [unordered-containers] instances
  17745. 965.99 s [unordered-containers] Eq
  17746. 965.99 s [unordered-containers] ==: OK (0.03s)
  17747. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17748. 965.99 s [unordered-containers] /=: OK
  17749. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17750. 965.99 s [unordered-containers] Ord
  17751. 965.99 s [unordered-containers] compare reflexive: OK
  17752. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17753. 965.99 s [unordered-containers] compare transitive: OK (0.03s)
  17754. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17755. 965.99 s [unordered-containers] compare antisymmetric: OK (0.03s)
  17756. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17757. 965.99 s [unordered-containers] Ord => Eq: OK (0.03s)
  17758. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17759. 965.99 s [unordered-containers] Read/Show: OK (0.25s)
  17760. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17761. 965.99 s [unordered-containers] Functor: OK (0.06s)
  17762. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17763. 965.99 s [unordered-containers] Foldable: OK (0.05s)
  17764. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17765. 965.99 s [unordered-containers] Bifoldable
  17766. 965.99 s [unordered-containers] bifoldMap: OK (0.03s)
  17767. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17768. 965.99 s [unordered-containers] bifoldr: OK (0.02s)
  17769. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17770. 965.99 s [unordered-containers] bifoldl: OK (0.02s)
  17771. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17772. 965.99 s [unordered-containers] Hashable: OK (0.03s)
  17773. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17774. 965.99 s [unordered-containers] empty
  17775. 965.99 s [unordered-containers] valid: OK
  17776. 965.99 s [unordered-containers] +++ OK, passed 1 test.
  17777. 965.99 s [unordered-containers] singleton
  17778. 965.99 s [unordered-containers] valid: OK
  17779. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17780. 965.99 s [unordered-containers] size: OK (0.01s)
  17781. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17782. 965.99 s [unordered-containers] member: OK (0.01s)
  17783. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17784. 965.99 s [unordered-containers] lookup: OK (0.02s)
  17785. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17786. 965.99 s [unordered-containers] !?: OK (0.02s)
  17787. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17788. 965.99 s [unordered-containers] insert
  17789. 965.99 s [unordered-containers] model: OK (0.03s)
  17790. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17791. 965.99 s [unordered-containers] valid: OK (0.03s)
  17792. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17793. 965.99 s [unordered-containers] insertWith
  17794. 965.99 s [unordered-containers] insertWith: OK (0.03s)
  17795. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17796. 965.99 s [unordered-containers] valid: OK (0.01s)
  17797. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17798. 965.99 s [unordered-containers] delete
  17799. 965.99 s [unordered-containers] model: OK (0.02s)
  17800. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17801. 965.99 s [unordered-containers] valid: OK (0.01s)
  17802. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17803. 965.99 s [unordered-containers] adjust
  17804. 965.99 s [unordered-containers] model: OK (0.04s)
  17805. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17806. 965.99 s [unordered-containers] valid: OK (0.03s)
  17807. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17808. 965.99 s [unordered-containers] update
  17809. 965.99 s [unordered-containers] model: OK (0.01s)
  17810. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17811. 965.99 s [unordered-containers] valid: OK (0.03s)
  17812. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17813. 965.99 s [unordered-containers] alter
  17814. 965.99 s [unordered-containers] model: OK (0.03s)
  17815. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17816. 965.99 s [unordered-containers] valid: OK (0.03s)
  17817. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17818. 965.99 s [unordered-containers] alterF
  17819. 965.99 s [unordered-containers] model
  17820. 965.99 s [unordered-containers] []: OK (0.17s)
  17821. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17822. 965.99 s [unordered-containers] adjust: OK (0.04s)
  17823. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17824. 965.99 s [unordered-containers] insert: OK (0.03s)
  17825. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17826. 965.99 s [unordered-containers] insertWith: OK (0.03s)
  17827. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17828. 965.99 s [unordered-containers] delete: OK (0.02s)
  17829. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17830. 965.99 s [unordered-containers] lookup: OK (0.02s)
  17831. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17832. 965.99 s [unordered-containers] valid: OK (0.06s)
  17833. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17834. 965.99 s [unordered-containers] isSubmapOf
  17835. 965.99 s [unordered-containers] model: OK (0.03s)
  17836. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17837. 965.99 s [unordered-containers] m ⊆ m: OK (0.02s)
  17838. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17839. 965.99 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.02s)
  17840. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17841. 965.99 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.02s)
  17842. 965.99 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  17843. 965.99 s [unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
  17844. 965.99 s [unordered-containers] +++ OK, passed 100 tests.
  17845. 965.99 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.05s)
  17846. 965.99 s [unordered-containers] +++ OK, passed 100 tests; 186 discarded.
  17847. 965.99 s [unordered-containers] delete k m ⊆ m: OK
  17848. 965.99 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  17849. 965.99 s [unordered-containers] m ⊈ delete k m : OK
  17850. 965.99 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  17851. 965.99 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  17852. 965.99 s [unordered-containers] +++ OK, passed 100 tests; 4 discarded.
  17853. 965.99 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  17854. 965.99 s [unordered-containers] +++ OK, passed 100 tests; 7 discarded.
  17855. 965.99 s [unordered-containers] union
  17856. 966.00 s [unordered-containers] model: OK (0.05s)
  17857. 966.00 s [unordered-containers] +++ OK, passed 100 tests.
  17858. 966.00 s [unordered-containers] valid: OK (0.02s)
  17859. 966.00 s [unordered-containers] +++ OK, passed 100 tests.
  17860. 966.00 s [unordered-containers] unionWith
  17861. 966.00 s [unordered-containers] model: OK (0.06s)
  17862. 966.00 s [unordered-containers] +++ OK, passed 100 tests.
  17863. 966.00 s [unordered-containers] valid: OK (0.03s)
  17864. 966.00 s [unordered-containers] +++ OK, passed 100 tests.
  17865. 966.00 s [unordered-containers] unionWithKey
  17866. 966.00 s [unordered-containers] model: OK (0.07s)
  17867. 966.00 s [unordered-containers] +++ OK, passed 100 tests.
  17868. 966.00 s [unordered-containers] valid: OK (0.03s)
  17869. 966.00 s [unordered-containers] +++ OK, passed 100 tests.
  17870. 966.00 s [unordered-containers] unions
  17871. 966.04 s [unordered-containers] model: OK (0.67s)
  17872. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17873. 966.04 s [unordered-containers] valid: OK (0.44s)
  17874. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17875. 966.04 s [unordered-containers] difference
  17876. 966.04 s [unordered-containers] model: OK (0.04s)
  17877. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17878. 966.04 s [unordered-containers] valid: OK (0.04s)
  17879. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17880. 966.04 s [unordered-containers] differenceWith
  17881. 966.04 s [unordered-containers] model: OK (0.06s)
  17882. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17883. 966.04 s [unordered-containers] valid: OK (0.05s)
  17884. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17885. 966.04 s [unordered-containers] intersection
  17886. 966.04 s [unordered-containers] model: OK (0.01s)
  17887. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17888. 966.04 s [unordered-containers] valid: OK (0.03s)
  17889. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17890. 966.04 s [unordered-containers] intersectionWith
  17891. 966.04 s [unordered-containers] model: OK (0.10s)
  17892. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17893. 966.04 s [unordered-containers] valid: OK (0.03s)
  17894. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17895. 966.04 s [unordered-containers] intersectionWithKey
  17896. 966.04 s [unordered-containers] model: OK (0.07s)
  17897. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17898. 966.04 s [unordered-containers] valid: OK (0.04s)
  17899. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17900. 966.04 s [unordered-containers] compose
  17901. 966.04 s [unordered-containers] valid: OK (0.02s)
  17902. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17903. 966.04 s [unordered-containers] map
  17904. 966.04 s [unordered-containers] model: OK (0.09s)
  17905. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17906. 966.04 s [unordered-containers] valid: OK (0.04s)
  17907. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17908. 966.04 s [unordered-containers] traverseWithKey
  17909. 966.04 s [unordered-containers] model: OK (0.10s)
  17910. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17911. 966.04 s [unordered-containers] valid: OK (0.01s)
  17912. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17913. 966.04 s [unordered-containers] mapKeys
  17914. 966.04 s [unordered-containers] model: OK (0.03s)
  17915. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17916. 966.04 s [unordered-containers] valid: OK (0.37s)
  17917. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17918. 966.04 s [unordered-containers] foldr: OK (0.01s)
  17919. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17920. 966.04 s [unordered-containers] foldl: OK (0.01s)
  17921. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17922. 966.04 s [unordered-containers] foldrWithKey: OK (0.01s)
  17923. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17924. 966.04 s [unordered-containers] foldlWithKey: OK (0.01s)
  17925. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17926. 966.04 s [unordered-containers] foldrWithKey': OK (0.02s)
  17927. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17928. 966.04 s [unordered-containers] foldlWithKey': OK (0.02s)
  17929. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17930. 966.04 s [unordered-containers] foldl': OK (0.03s)
  17931. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17932. 966.04 s [unordered-containers] foldr': OK (0.02s)
  17933. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17934. 966.04 s [unordered-containers] foldMapWithKey: OK (0.02s)
  17935. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17936. 966.04 s [unordered-containers] filter
  17937. 966.04 s [unordered-containers] model: OK (0.12s)
  17938. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17939. 966.04 s [unordered-containers] valid: OK (0.05s)
  17940. 966.04 s [unordered-containers] +++ OK, passed 100 tests.
  17941. 966.04 s [unordered-containers] filterWithKey
  17942. 966.23 s [unordered-containers] model: OK (0.71s)
  17943. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17944. 966.23 s [unordered-containers] valid: OK (0.43s)
  17945. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17946. 966.23 s [unordered-containers] mapMaybe
  17947. 966.23 s [unordered-containers] model: OK (0.10s)
  17948. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17949. 966.23 s [unordered-containers] valid: OK (0.05s)
  17950. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17951. 966.23 s [unordered-containers] mapMaybeWithKey
  17952. 966.23 s [unordered-containers] model: OK (0.69s)
  17953. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17954. 966.23 s [unordered-containers] valid: OK (0.38s)
  17955. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17956. 966.23 s [unordered-containers] elems: OK (0.04s)
  17957. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17958. 966.23 s [unordered-containers] keys: OK (0.03s)
  17959. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17960. 966.23 s [unordered-containers] fromList
  17961. 966.23 s [unordered-containers] model: OK (0.03s)
  17962. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17963. 966.23 s [unordered-containers] valid: OK (0.02s)
  17964. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17965. 966.23 s [unordered-containers] fromListWith
  17966. 966.23 s [unordered-containers] model: OK (0.04s)
  17967. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17968. 966.23 s [unordered-containers] valid: OK (0.01s)
  17969. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17970. 966.23 s [unordered-containers] fromListWithKey
  17971. 966.23 s [unordered-containers] model: OK (0.02s)
  17972. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17973. 966.23 s [unordered-containers] valid: OK (0.03s)
  17974. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17975. 966.23 s [unordered-containers] toList: OK (0.02s)
  17976. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17977. 966.23 s [unordered-containers] Data.HashSet
  17978. 966.23 s [unordered-containers] instances
  17979. 966.23 s [unordered-containers] Eq
  17980. 966.23 s [unordered-containers] ==: OK (0.03s)
  17981. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17982. 966.23 s [unordered-containers] == permutations: OK (0.03s)
  17983. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17984. 966.23 s [unordered-containers] /=: OK (0.04s)
  17985. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17986. 966.23 s [unordered-containers] Ord
  17987. 966.23 s [unordered-containers] compare reflexive: OK (0.02s)
  17988. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17989. 966.23 s [unordered-containers] compare transitive: OK (0.03s)
  17990. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17991. 966.23 s [unordered-containers] compare antisymmetric: OK (0.03s)
  17992. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17993. 966.23 s [unordered-containers] Ord => Eq: OK
  17994. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17995. 966.23 s [unordered-containers] Read/Show: OK (0.20s)
  17996. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17997. 966.23 s [unordered-containers] Foldable: OK (0.01s)
  17998. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  17999. 966.23 s [unordered-containers] Hashable: OK (0.03s)
  18000. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18001. 966.23 s [unordered-containers] size: OK (0.04s)
  18002. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18003. 966.23 s [unordered-containers] member: OK (0.02s)
  18004. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18005. 966.23 s [unordered-containers] insert: OK (0.01s)
  18006. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18007. 966.23 s [unordered-containers] delete: OK (0.02s)
  18008. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18009. 966.23 s [unordered-containers] union: OK (0.03s)
  18010. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18011. 966.23 s [unordered-containers] map: OK (0.43s)
  18012. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18013. 966.23 s [unordered-containers] foldr: OK (0.01s)
  18014. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18015. 966.23 s [unordered-containers] foldl': OK (0.02s)
  18016. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18017. 966.23 s [unordered-containers] filter: OK (0.45s)
  18018. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18019. 966.23 s [unordered-containers] toList: OK (0.02s)
  18020. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18021. 966.23 s [unordered-containers] Data.HashMap.Internal.List
  18022. 966.23 s [unordered-containers] isPermutationBy: OK (0.02s)
  18023. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18024. 966.23 s [unordered-containers] isPermutationBy of different length: OK
  18025. 966.23 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  18026. 966.23 s [unordered-containers] pUnorderedCompare: OK (0.06s)
  18027. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18028. 966.23 s [unordered-containers] modelUnorderedCompare
  18029. 966.23 s [unordered-containers] reflexive: OK
  18030. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18031. 966.23 s [unordered-containers] anti-symmetric: OK
  18032. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18033. 966.23 s [unordered-containers] transitive: OK (0.02s)
  18034. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18035. 966.23 s [unordered-containers] Regression tests
  18036. 966.23 s [unordered-containers] issue32: OK
  18037. 966.23 s [unordered-containers] issue39a: OK
  18038. 966.23 s [unordered-containers] issue39b: OK
  18039. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18040. 966.23 s [unordered-containers] issue254 lazy: OK
  18041. 966.23 s [unordered-containers] issue254 strict: OK
  18042. 966.23 s [unordered-containers] issue379
  18043. 966.23 s [unordered-containers] Lazy.unionWith: OK
  18044. 966.23 s [unordered-containers] union: OK
  18045. 966.23 s [unordered-containers] Strict.unionWith: OK
  18046. 966.23 s [unordered-containers] Strict.unionWithKey: OK
  18047. 966.23 s [unordered-containers] issue381
  18048. 966.23 s [unordered-containers] mapMaybe: OK
  18049. 966.23 s [unordered-containers] mapMaybeWithKey: OK
  18050. 966.23 s [unordered-containers] issue382: OK
  18051. 966.23 s [unordered-containers] issue383: OK
  18052. 966.23 s [unordered-containers] issue420: OK
  18053. 966.23 s [unordered-containers] Strictness
  18054. 966.23 s [unordered-containers] HashMap.Strict
  18055. 966.23 s [unordered-containers] singleton is key-strict: OK
  18056. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18057. 966.23 s [unordered-containers] singleton is value-strict: OK
  18058. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18059. 966.23 s [unordered-containers] member is key-strict: OK
  18060. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18061. 966.23 s [unordered-containers] lookup is key-strict: OK
  18062. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18063. 966.23 s [unordered-containers] lookupDefault is key-strict: OK
  18064. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18065. 966.23 s [unordered-containers] findWithDefault is key-strict: OK
  18066. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18067. 966.23 s [unordered-containers] ! is key-strict: OK
  18068. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18069. 966.23 s [unordered-containers] delete is key-strict: OK
  18070. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18071. 966.23 s [unordered-containers] adjust is key-strict: OK (0.02s)
  18072. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18073. 966.23 s [unordered-containers] adjust is value-strict: OK (0.03s)
  18074. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18075. 966.23 s [unordered-containers] insert is key-strict: OK (0.01s)
  18076. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18077. 966.23 s [unordered-containers] insert is value-strict: OK
  18078. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18079. 966.23 s [unordered-containers] insertWith is key-strict: OK
  18080. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18081. 966.23 s [unordered-containers] insertWith is value-strict: OK (0.02s)
  18082. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18083. 966.23 s [unordered-containers] fromList is key-strict: OK
  18084. 966.23 s [unordered-containers] +++ OK, passed 1 test.
  18085. 966.23 s [unordered-containers] fromList is value-strict: OK
  18086. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18087. 966.23 s [unordered-containers] fromListWith is key-strict: OK (0.01s)
  18088. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18089. 966.23 s [unordered-containers] fromListWith is value-strict: OK
  18090. 966.23 s [unordered-containers] +++ OK, passed 100 tests.
  18091. 966.23 s [unordered-containers]
  18092. 966.23 s [unordered-containers] All 256 tests passed (1.20s)
  18093. 966.25 s [unordered-containers] Test suite unordered-containers-tests: PASS
  18094. 966.25 s [unordered-containers] Test suite logged to:
  18095. 966.25 s [unordered-containers] dist/test/unordered-containers-0.2.20-unordered-containers-tests.log
  18096. 966.25 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  18097. 966.26 s [unordered-containers] Phase: haddockPhase
  18098. 966.41 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20..
  18099. 966.41 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20..
  18100. 966.46 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18101. 966.59 s [unordered-containers]
  18102. 966.59 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  18103. 966.59 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  18104. 966.59 s [unordered-containers] |
  18105. 966.59 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  18106. 966.59 s [unordered-containers] | ^^^^^^^^^^
  18107. 966.92 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  18108. 966.92 s [unordered-containers] Missing documentation for:
  18109. 966.92 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  18110. 966.92 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  18111. 966.92 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:207)
  18112. 966.92 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:224)
  18113. 966.92 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:228)
  18114. 966.92 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:232)
  18115. 966.92 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:241)
  18116. 966.92 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:153)
  18117. 966.92 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:161)
  18118. 966.92 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:248)
  18119. 966.92 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:254)
  18120. 966.92 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:261)
  18121. 966.92 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:273)
  18122. 966.92 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:267)
  18123. 966.92 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:139)
  18124. 966.92 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:279)
  18125. 966.92 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:285)
  18126. 966.92 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:135)
  18127. 966.92 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:291)
  18128. 966.92 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:313)
  18129. 966.92 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:403)
  18130. 966.92 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:374)
  18131. 966.92 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:393)
  18132. 966.92 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:384)
  18133. 966.92 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:416)
  18134. 966.92 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:435)
  18135. 966.92 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:460)
  18136. 966.92 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:536)
  18137. 966.92 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:552)
  18138. 966.92 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:528)
  18139. 966.92 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:493)
  18140. 966.92 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:505)
  18141. 967.06 s [unordered-containers]
  18142. 967.06 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  18143. 967.06 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  18144. 967.06 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  18145. 967.06 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  18146. 967.06 s [unordered-containers] |
  18147. 967.06 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  18148. 967.06 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  18149. 967.08 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  18150. 967.08 s [unordered-containers] Missing documentation for:
  18151. 967.08 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:39)
  18152. 967.08 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:82)
  18153. 967.08 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:67)
  18154. 967.47 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  18155. 967.47 s [unordered-containers] * at Data/HashMap/Internal.hs:225:7
  18156. 967.47 s [unordered-containers] * at Data/HashMap/Internal.hs:185:1
  18157. 967.47 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  18158. 967.47 s [unordered-containers] by specifying the type/value namespace explicitly.
  18159. 967.47 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
  18160. 967.48 s [unordered-containers] Warning: 'at' is out of scope.
  18161. 967.48 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18162. 967.49 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  18163. 967.49 s [unordered-containers] Missing documentation for:
  18164. 967.49 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:185)
  18165. 967.49 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1854)
  18166. 967.49 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2367)
  18167. 967.49 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:510)
  18168. 967.49 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:494)
  18169. 967.49 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:677)
  18170. 967.49 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:657)
  18171. 967.49 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:659)
  18172. 967.49 s [unordered-containers] insert' (Data/HashMap/Internal.hs:805)
  18173. 967.49 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1123)
  18174. 967.49 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:847)
  18175. 967.49 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:882)
  18176. 968.06 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  18177. 968.06 s [unordered-containers] Missing documentation for:
  18178. 968.06 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:97)
  18179. 968.07 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  18180. 968.07 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  18181. 968.12 s [unordered-containers] Warning: 'lookup' is out of scope.
  18182. 968.12 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18183. 968.12 s [unordered-containers] Warning: 'at' is out of scope.
  18184. 968.12 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18185. 968.12 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  18186. 968.22 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  18187. 968.32 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  18188. 968.32 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  18189. 968.33 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  18190. 971.84 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/index.html,
  18191. 971.84 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  18192. 972.04 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  18193. 972.04 s [unordered-containers] Phase: installPhase
  18194. 972.04 s [unordered-containers] Installing library in /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  18195. 972.28 s [unordered-containers] Phase: fixupPhase
  18196. 972.30 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20
  18197. 972.30 s [unordered-containers] shrinking /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSunordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn-ghc9.6.3.so
  18198. 972.31 s [unordered-containers] checking for references to /build/ in /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20...
  18199. 972.32 s [unordered-containers] patching script interpreter paths in /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20
  18200. 972.33 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20/lib
  18201. 972.45 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc
  18202. 972.46 s [unordered-containers] checking for references to /build/ in /nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc...
  18203. 972.47 s [unordered-containers] patching script interpreter paths in /nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc
  18204. 972.59 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20
  18205. 973.10 s [unordered-containers:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  18206. 973.10 s [unordered-containers:post-build]
  18207. 973.48 s [unordered-containers:post-build] Pushing /nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc (4.48 MiB)
  18208. 973.52 s [unordered-containers:post-build] Pushing /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20 (9.35 MiB)
  18209. 974.69 s [unordered-containers:post-build]
  18210. 974.69 s [unordered-containers:post-build] All done.
  18211. 974.71 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc /nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20
  18212. 974.76 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18213. 975.00 s [unordered-containers:post-build] copying 2 paths...
  18214. 975.00 s [unordered-containers:post-build] copying path '/nix/store/f7p9rdbcdf7dlknij5ayqaxcnpxb62yh-unordered-containers-0.2.20-doc' to 'https://cache.nix-ci.com'...
  18215. 975.84 s [unordered-containers:post-build] copying path '/nix/store/p8ipwhmsq6451y90ww30lck0pii42q9b-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...
  18216. 978.26 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18217. 978.53 s [unordered-containers:post-build] copying 1 paths...
  18218. 978.58 s [unordered-containers:post-build] copying path '/nix/store/babfbfa6s7vb79lijcmrkdgalir99spf-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...
  18219. 978.78 s Progress: 105 of 113 built, 172 of 172 downloaded from cache
  18220. 978.83 s Building /nix/store/sgxmkybiia4rmszzf7qkvzi242byy698-quickcheck-instances-0.3.32.drv
  18221. 978.96 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  18222. 978.97 s [quickcheck-instances] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  18223. 979.15 s [quickcheck-instances] Phase: unpackPhase
  18224. 979.15 s [quickcheck-instances] unpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
  18225. 979.16 s [quickcheck-instances] source root is quickcheck-instances-0.3.32
  18226. 979.16 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
  18227. 979.17 s [quickcheck-instances] Phase: patchPhase
  18228. 979.17 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
  18229. 979.18 s [quickcheck-instances] Phase: compileBuildDriverPhase
  18230. 979.18 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.NdG8gnz2b1/setup-package.conf.d -threaded
  18231. 979.22 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.NdG8gnz2b1/Main.o )
  18232. 979.27 s [quickcheck-instances] [2 of 2] Linking Setup
  18233. 980.47 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  18234. 980.49 s [quickcheck-instances] Phase: configurePhase
  18235. 980.49 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.NdG8gnz2b1/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  18236. 980.50 s [quickcheck-instances] Using Parsec parser
  18237. 980.50 s [quickcheck-instances] Configuring quickcheck-instances-0.3.32...
  18238. 980.82 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  18239. 980.82 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
  18240. 980.82 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.5.0
  18241. 980.82 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.18.1.0
  18242. 980.82 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.11.5.2
  18243. 980.82 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  18244. 980.82 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.7
  18245. 980.82 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  18246. 980.82 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  18247. 980.82 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  18248. 980.82 s [quickcheck-instances] integer-logarithms-1.0.4
  18249. 980.82 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  18250. 980.82 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  18251. 980.82 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  18252. 980.82 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
  18253. 980.82 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  18254. 980.82 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.8
  18255. 980.82 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  18256. 980.82 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  18257. 980.82 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  18258. 980.82 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.7
  18259. 980.82 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
  18260. 980.82 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  18261. 980.82 s [quickcheck-instances] unordered-containers-0.2.20
  18262. 980.82 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  18263. 980.82 s [quickcheck-instances] Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
  18264. 980.82 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.14.3
  18265. 980.82 s [quickcheck-instances] Dependency base: using base-4.18.1.0
  18266. 980.82 s [quickcheck-instances] Dependency containers: using containers-0.6.7
  18267. 980.82 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  18268. 980.82 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.32
  18269. 980.82 s [quickcheck-instances] Dependency tagged: using tagged-0.8.8
  18270. 980.82 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  18271. 981.05 s [quickcheck-instances] Source component graph:
  18272. 981.05 s [quickcheck-instances] component lib
  18273. 981.05 s [quickcheck-instances] component test:self-test dependency lib
  18274. 981.05 s [quickcheck-instances] Configured component graph:
  18275. 981.05 s [quickcheck-instances] component quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18276. 981.05 s [quickcheck-instances] include OneTuple-0.4.2-4RYUUrRewNpIt4JzrjaVAt
  18277. 981.05 s [quickcheck-instances] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18278. 981.05 s [quickcheck-instances] include array-0.5.5.0
  18279. 981.05 s [quickcheck-instances] include base-4.18.1.0
  18280. 981.05 s [quickcheck-instances] include bytestring-0.11.5.2
  18281. 981.05 s [quickcheck-instances] include case-insensitive-1.2.1.0-2Fr30x162J97VVTi3Jt0ZA
  18282. 981.05 s [quickcheck-instances] include containers-0.6.7
  18283. 981.05 s [quickcheck-instances] include data-fix-0.3.4-7Z2HzEJJxjpGfhwNdMyfvw
  18284. 981.05 s [quickcheck-instances] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  18285. 981.05 s [quickcheck-instances] include integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  18286. 981.05 s [quickcheck-instances] include old-time-1.1.0.4-AMitDc381sTFfBdOk6gZUs
  18287. 981.05 s [quickcheck-instances] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  18288. 981.05 s [quickcheck-instances] include scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  18289. 981.05 s [quickcheck-instances] include splitmix-0.1.1-DhujvlRHzy3LbShgpelvxY
  18290. 981.05 s [quickcheck-instances] include strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a
  18291. 981.05 s [quickcheck-instances] include tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  18292. 981.05 s [quickcheck-instances] include text-2.0.2
  18293. 981.05 s [quickcheck-instances] include text-short-0.1.6-Lu2CIjn4Axd1kTZu1MVDaa
  18294. 981.05 s [quickcheck-instances] include these-1.2.1-5P6Fv3Pe7oRFsFG3HrYm87
  18295. 981.05 s [quickcheck-instances] include time-compat-1.9.7-CgIQc7E2JHn8kYFCatkL43
  18296. 981.05 s [quickcheck-instances] include transformers-0.6.1.0
  18297. 981.05 s [quickcheck-instances] include unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  18298. 981.05 s [quickcheck-instances] include uuid-types-1.0.6-LSnHSQasIz2KiEYrGocUTH
  18299. 981.05 s [quickcheck-instances] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  18300. 981.05 s [quickcheck-instances] component quickcheck-instances-0.3.32-7ZgY07HvcUlWXnEgoAJUN-self-test
  18301. 981.05 s [quickcheck-instances] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18302. 981.05 s [quickcheck-instances] include base-4.18.1.0
  18303. 981.05 s [quickcheck-instances] include containers-0.6.7
  18304. 981.05 s [quickcheck-instances] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  18305. 981.05 s [quickcheck-instances] include quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18306. 981.05 s [quickcheck-instances] include tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  18307. 981.05 s [quickcheck-instances] include uuid-types-1.0.6-LSnHSQasIz2KiEYrGocUTH
  18308. 981.05 s [quickcheck-instances] Linked component graph:
  18309. 981.05 s [quickcheck-instances] unit quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18310. 981.05 s [quickcheck-instances] include OneTuple-0.4.2-4RYUUrRewNpIt4JzrjaVAt
  18311. 981.05 s [quickcheck-instances] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18312. 981.05 s [quickcheck-instances] include array-0.5.5.0
  18313. 981.05 s [quickcheck-instances] include base-4.18.1.0
  18314. 981.05 s [quickcheck-instances] include bytestring-0.11.5.2
  18315. 981.05 s [quickcheck-instances] include case-insensitive-1.2.1.0-2Fr30x162J97VVTi3Jt0ZA
  18316. 981.05 s [quickcheck-instances] include containers-0.6.7
  18317. 981.05 s [quickcheck-instances] include data-fix-0.3.4-7Z2HzEJJxjpGfhwNdMyfvw
  18318. 981.05 s [quickcheck-instances] include hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  18319. 981.05 s [quickcheck-instances] include integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  18320. 981.05 s [quickcheck-instances] include old-time-1.1.0.4-AMitDc381sTFfBdOk6gZUs
  18321. 981.05 s [quickcheck-instances] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  18322. 981.05 s [quickcheck-instances] include scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  18323. 981.05 s [quickcheck-instances] include splitmix-0.1.1-DhujvlRHzy3LbShgpelvxY
  18324. 981.05 s [quickcheck-instances] include strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a
  18325. 981.05 s [quickcheck-instances] include tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  18326. 981.05 s [quickcheck-instances] include text-2.0.2
  18327. 981.05 s [quickcheck-instances] include text-short-0.1.6-Lu2CIjn4Axd1kTZu1MVDaa
  18328. 981.05 s [quickcheck-instances] include these-1.2.1-5P6Fv3Pe7oRFsFG3HrYm87
  18329. 981.05 s [quickcheck-instances] include time-compat-1.9.7-CgIQc7E2JHn8kYFCatkL43
  18330. 981.05 s [quickcheck-instances] include transformers-0.6.1.0
  18331. 981.05 s [quickcheck-instances] include unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  18332. 981.05 s [quickcheck-instances] include uuid-types-1.0.6-LSnHSQasIz2KiEYrGocUTH
  18333. 981.05 s [quickcheck-instances] include vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  18334. 981.05 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv:Test.QuickCheck.Instances.Void
  18335. 981.05 s [quickcheck-instances] unit quickcheck-instances-0.3.32-7ZgY07HvcUlWXnEgoAJUN-self-test
  18336. 981.05 s [quickcheck-instances] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18337. 981.05 s [quickcheck-instances] include base-4.18.1.0
  18338. 981.05 s [quickcheck-instances] include containers-0.6.7
  18339. 981.05 s [quickcheck-instances] include primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  18340. 981.05 s [quickcheck-instances] include quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18341. 981.05 s [quickcheck-instances] include tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  18342. 981.05 s [quickcheck-instances] include uuid-types-1.0.6-LSnHSQasIz2KiEYrGocUTH
  18343. 981.05 s [quickcheck-instances] Ready component graph:
  18344. 981.05 s [quickcheck-instances] definite quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18345. 981.05 s [quickcheck-instances] depends OneTuple-0.4.2-4RYUUrRewNpIt4JzrjaVAt
  18346. 981.05 s [quickcheck-instances] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18347. 981.05 s [quickcheck-instances] depends array-0.5.5.0
  18348. 981.05 s [quickcheck-instances] depends base-4.18.1.0
  18349. 981.05 s [quickcheck-instances] depends bytestring-0.11.5.2
  18350. 981.05 s [quickcheck-instances] depends case-insensitive-1.2.1.0-2Fr30x162J97VVTi3Jt0ZA
  18351. 981.05 s [quickcheck-instances] depends containers-0.6.7
  18352. 981.05 s [quickcheck-instances] depends data-fix-0.3.4-7Z2HzEJJxjpGfhwNdMyfvw
  18353. 981.05 s [quickcheck-instances] depends hashable-1.4.7.0-4pQcVzsiriKJL8YNcpzeI3
  18354. 981.05 s [quickcheck-instances] depends integer-logarithms-1.0.4-634gX6SnNksJOgHR1DSNl1
  18355. 981.05 s [quickcheck-instances] depends old-time-1.1.0.4-AMitDc381sTFfBdOk6gZUs
  18356. 981.05 s [quickcheck-instances] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  18357. 981.05 s [quickcheck-instances] depends scientific-0.3.8.0-EXTb8i03tpyEFLFbbBcyqj
  18358. 981.05 s [quickcheck-instances] depends splitmix-0.1.1-DhujvlRHzy3LbShgpelvxY
  18359. 981.05 s [quickcheck-instances] depends strict-0.5.1-JQp8IUgd9mIGuI9YRo3e6a
  18360. 981.05 s [quickcheck-instances] depends tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  18361. 981.05 s [quickcheck-instances] depends text-2.0.2
  18362. 981.05 s [quickcheck-instances] depends text-short-0.1.6-Lu2CIjn4Axd1kTZu1MVDaa
  18363. 981.05 s [quickcheck-instances] depends these-1.2.1-5P6Fv3Pe7oRFsFG3HrYm87
  18364. 981.05 s [quickcheck-instances] depends time-compat-1.9.7-CgIQc7E2JHn8kYFCatkL43
  18365. 981.05 s [quickcheck-instances] depends transformers-0.6.1.0
  18366. 981.05 s [quickcheck-instances] depends unordered-containers-0.2.20-Jvmv6sO8RGN72Ih9Ec3cPn
  18367. 981.05 s [quickcheck-instances] depends uuid-types-1.0.6-LSnHSQasIz2KiEYrGocUTH
  18368. 981.05 s [quickcheck-instances] depends vector-0.13.2.0-JxdPGLzxQoqG597l8mW4DO
  18369. 981.05 s [quickcheck-instances] definite quickcheck-instances-0.3.32-7ZgY07HvcUlWXnEgoAJUN-self-test
  18370. 981.05 s [quickcheck-instances] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18371. 981.05 s [quickcheck-instances] depends base-4.18.1.0
  18372. 981.05 s [quickcheck-instances] depends containers-0.6.7
  18373. 981.05 s [quickcheck-instances] depends primitive-0.9.1.0-4Xu9LMuZ2cCJzEReDHZuyI
  18374. 981.05 s [quickcheck-instances] depends quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18375. 981.06 s [quickcheck-instances] depends tagged-0.8.8-KnTUHMtQah6DmtzwHmdxEL
  18376. 981.06 s [quickcheck-instances] depends uuid-types-1.0.6-LSnHSQasIz2KiEYrGocUTH
  18377. 981.06 s [quickcheck-instances] Using Cabal-3.10.1.0 compiled by ghc-9.6
  18378. 981.06 s [quickcheck-instances] Using compiler: ghc-9.6.3
  18379. 981.06 s [quickcheck-instances] Using install prefix:
  18380. 981.06 s [quickcheck-instances] /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32
  18381. 981.06 s [quickcheck-instances] Executables installed in:
  18382. 981.06 s [quickcheck-instances] /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/bin
  18383. 981.06 s [quickcheck-instances] Libraries installed in:
  18384. 981.06 s [quickcheck-instances] /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18385. 981.06 s [quickcheck-instances] Dynamic Libraries installed in:
  18386. 981.06 s [quickcheck-instances] /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  18387. 981.06 s [quickcheck-instances] Private executables installed in:
  18388. 981.06 s [quickcheck-instances] /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.6.3/quickcheck-instances-0.3.32
  18389. 981.06 s [quickcheck-instances] Data files installed in:
  18390. 981.06 s [quickcheck-instances] /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.6.3/quickcheck-instances-0.3.32
  18391. 981.06 s [quickcheck-instances] Documentation installed in:
  18392. 981.06 s [quickcheck-instances] /nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
  18393. 981.06 s [quickcheck-instances] Configuration files installed in:
  18394. 981.06 s [quickcheck-instances] /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/etc
  18395. 981.06 s [quickcheck-instances] No alex found
  18396. 981.06 s [quickcheck-instances] Using ar found on system at:
  18397. 981.06 s [quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  18398. 981.06 s [quickcheck-instances] No c2hs found
  18399. 981.06 s [quickcheck-instances] No cpphs found
  18400. 981.06 s [quickcheck-instances] No doctest found
  18401. 981.06 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  18402. 981.06 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  18403. 981.06 s [quickcheck-instances] Using ghc version 9.6.3 found on system at:
  18404. 981.06 s [quickcheck-instances] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  18405. 981.06 s [quickcheck-instances] Using ghc-pkg version 9.6.3 found on system at:
  18406. 981.06 s [quickcheck-instances] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  18407. 981.06 s [quickcheck-instances] No ghcjs found
  18408. 981.06 s [quickcheck-instances] No ghcjs-pkg found
  18409. 981.06 s [quickcheck-instances] No greencard found
  18410. 981.06 s [quickcheck-instances] Using haddock version 2.29.1 found on system at:
  18411. 981.06 s [quickcheck-instances] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  18412. 981.06 s [quickcheck-instances] No happy found
  18413. 981.06 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  18414. 981.06 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18415. 981.06 s [quickcheck-instances] No hmake found
  18416. 981.06 s [quickcheck-instances] Using hpc version 0.68 found on system at:
  18417. 981.06 s [quickcheck-instances] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  18418. 981.06 s [quickcheck-instances] Using hsc2hs version 0.68.9 found on system at:
  18419. 981.06 s [quickcheck-instances] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  18420. 981.06 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  18421. 981.06 s [quickcheck-instances] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  18422. 981.06 s [quickcheck-instances] No jhc found
  18423. 981.06 s [quickcheck-instances] Using ld found on system at:
  18424. 981.06 s [quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  18425. 981.06 s [quickcheck-instances] No pkg-config found
  18426. 981.06 s [quickcheck-instances] Using runghc version 9.6.3 found on system at:
  18427. 981.06 s [quickcheck-instances] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  18428. 981.06 s [quickcheck-instances] Using strip version 2.44 found on system at:
  18429. 981.06 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  18430. 981.06 s [quickcheck-instances] Using tar found on system at:
  18431. 981.06 s [quickcheck-instances] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  18432. 981.06 s [quickcheck-instances] No uhc found
  18433. 981.18 s [quickcheck-instances] Phase: buildPhase
  18434. 981.23 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32..
  18435. 981.24 s [quickcheck-instances] Building library for quickcheck-instances-0.3.32..
  18436. 981.34 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 )
  18437. 981.41 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 )
  18438. 981.62 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 )
  18439. 981.71 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 )
  18440. 981.90 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 )
  18441. 981.90 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 )
  18442. 981.90 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 )
  18443. 981.90 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 )
  18444. 981.90 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 )
  18445. 981.91 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 )
  18446. 981.91 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 )
  18447. 981.91 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 )
  18448. 981.91 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 )
  18449. 981.91 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 )
  18450. 981.91 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 )
  18451. 982.01 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 )
  18452. 982.01 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 )
  18453. 982.02 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 )
  18454. 982.02 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 )
  18455. 982.04 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 )
  18456. 982.36 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 )
  18457. 982.36 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 )
  18458. 982.36 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 )
  18459. 982.36 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 )
  18460. 982.36 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 )
  18461. 982.36 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 )
  18462. 982.65 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 )
  18463. 982.80 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 )
  18464. 982.81 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 )
  18465. 983.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 )
  18466. 983.23 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 )
  18467. 983.40 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 )
  18468. 983.40 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 )
  18469. 983.40 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 )
  18470. 983.40 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 )
  18471. 983.40 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 )
  18472. 983.47 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 )
  18473. 983.59 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 )
  18474. 983.71 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 )
  18475. 983.71 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 )
  18476. 983.71 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 )
  18477. 983.71 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 )
  18478. 983.71 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 )
  18479. 983.71 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 )
  18480. 983.71 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 )
  18481. 983.71 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 )
  18482. 983.87 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 )
  18483. 983.87 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 )
  18484. 983.87 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 )
  18485. 983.87 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 )
  18486. 983.87 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 )
  18487. 983.87 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  18488. 985.22 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
  18489. 985.22 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.32..
  18490. 985.28 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  18491. 985.52 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  18492. 986.16 s [quickcheck-instances] Phase: checkPhase
  18493. 986.19 s [quickcheck-instances] Running 1 test suites...
  18494. 986.19 s [quickcheck-instances] Test suite self-test: RUNNING...
  18495. 986.20 s [quickcheck-instances] +++ OK, passed 100 tests.
  18496. 986.20 s [quickcheck-instances] +++ OK, passed 100 tests.
  18497. 986.20 s [quickcheck-instances] +++ OK, passed 100 tests.
  18498. 986.20 s [quickcheck-instances] +++ OK, passed 100 tests.
  18499. 986.20 s [quickcheck-instances] +++ OK, passed 100 tests.
  18500. 986.21 s [quickcheck-instances] Test suite self-test: PASS
  18501. 986.21 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
  18502. 986.21 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  18503. 986.21 s [quickcheck-instances] Phase: haddockPhase
  18504. 986.33 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32..
  18505. 986.34 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.32..
  18506. 986.34 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  18507. 986.34 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  18508. 986.38 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18509. 986.53 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  18510. 986.53 s [quickcheck-instances] Missing documentation for:
  18511. 986.53 s [quickcheck-instances] Module header
  18512. 986.64 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  18513. 986.64 s [quickcheck-instances] Missing documentation for:
  18514. 986.64 s [quickcheck-instances] Module header
  18515. 986.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  18516. 986.65 s [quickcheck-instances] Missing documentation for:
  18517. 986.65 s [quickcheck-instances] Module header
  18518. 986.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  18519. 986.67 s [quickcheck-instances] Missing documentation for:
  18520. 986.67 s [quickcheck-instances] Module header
  18521. 986.68 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  18522. 986.68 s [quickcheck-instances] Missing documentation for:
  18523. 986.68 s [quickcheck-instances] Module header
  18524. 986.68 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  18525. 986.68 s [quickcheck-instances] Missing documentation for:
  18526. 986.69 s [quickcheck-instances] Module header
  18527. 986.69 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  18528. 986.69 s [quickcheck-instances] Missing documentation for:
  18529. 986.69 s [quickcheck-instances] Module header
  18530. 986.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  18531. 986.70 s [quickcheck-instances] Missing documentation for:
  18532. 986.70 s [quickcheck-instances] Module header
  18533. 986.73 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  18534. 986.73 s [quickcheck-instances] Missing documentation for:
  18535. 986.73 s [quickcheck-instances] Module header
  18536. 986.74 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  18537. 986.74 s [quickcheck-instances] Missing documentation for:
  18538. 986.74 s [quickcheck-instances] Module header
  18539. 986.74 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  18540. 986.74 s [quickcheck-instances] Missing documentation for:
  18541. 986.74 s [quickcheck-instances] Module header
  18542. 986.76 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18543. 986.76 s [quickcheck-instances] Missing documentation for:
  18544. 986.76 s [quickcheck-instances] Module header
  18545. 986.85 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18546. 986.85 s [quickcheck-instances] Missing documentation for:
  18547. 986.85 s [quickcheck-instances] Module header
  18548. 986.87 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18549. 986.87 s [quickcheck-instances] Missing documentation for:
  18550. 986.87 s [quickcheck-instances] Module header
  18551. 986.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18552. 986.92 s [quickcheck-instances] Missing documentation for:
  18553. 986.92 s [quickcheck-instances] Module header
  18554. 986.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18555. 986.93 s [quickcheck-instances] Missing documentation for:
  18556. 986.93 s [quickcheck-instances] Module header
  18557. 986.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18558. 986.93 s [quickcheck-instances] Missing documentation for:
  18559. 986.93 s [quickcheck-instances] Module header
  18560. 986.94 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18561. 986.94 s [quickcheck-instances] Missing documentation for:
  18562. 986.94 s [quickcheck-instances] Module header
  18563. 986.99 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18564. 986.99 s [quickcheck-instances] Missing documentation for:
  18565. 986.99 s [quickcheck-instances] Module header
  18566. 987.03 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18567. 987.03 s [quickcheck-instances] Missing documentation for:
  18568. 987.03 s [quickcheck-instances] Module header
  18569. 987.04 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18570. 987.04 s [quickcheck-instances] Missing documentation for:
  18571. 987.04 s [quickcheck-instances] Module header
  18572. 987.05 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18573. 987.05 s [quickcheck-instances] Missing documentation for:
  18574. 987.05 s [quickcheck-instances] Module header
  18575. 987.08 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18576. 987.08 s [quickcheck-instances] Missing documentation for:
  18577. 987.08 s [quickcheck-instances] Module header
  18578. 987.21 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18579. 987.21 s [quickcheck-instances] Missing documentation for:
  18580. 987.21 s [quickcheck-instances] Module header
  18581. 987.22 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18582. 987.56 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18583. 987.56 s [quickcheck-instances] - Data.Vector.Vector
  18584. 987.56 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18585. 987.56 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18586. 987.56 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18587. 987.56 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18588. 990.75 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/index.html,
  18589. 990.87 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18590. 990.87 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
  18591. 990.87 s [quickcheck-instances] Phase: installPhase
  18592. 990.87 s [quickcheck-instances] Installing library in /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18593. 991.28 s [quickcheck-instances] Phase: fixupPhase
  18594. 991.30 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32
  18595. 991.31 s [quickcheck-instances] shrinking /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSquickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv-ghc9.6.3.so
  18596. 991.32 s [quickcheck-instances] checking for references to /build/ in /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32...
  18597. 991.34 s [quickcheck-instances] patching script interpreter paths in /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32
  18598. 991.35 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32/lib
  18599. 991.48 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc
  18600. 991.49 s [quickcheck-instances] checking for references to /build/ in /nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc...
  18601. 991.50 s [quickcheck-instances] patching script interpreter paths in /nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc
  18602. 991.62 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32
  18603. 992.12 s [quickcheck-instances:post-build] Pushing 2 paths (130 are already present) using zstd to cache sellout ⏳
  18604. 992.12 s [quickcheck-instances:post-build]
  18605. 992.48 s [quickcheck-instances:post-build] Pushing /nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc (1.48 MiB)
  18606. 992.57 s [quickcheck-instances:post-build] Pushing /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32 (5.36 MiB)
  18607. 993.55 s [quickcheck-instances:post-build]
  18608. 993.55 s [quickcheck-instances:post-build] All done.
  18609. 993.57 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc /nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32
  18610. 993.61 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18611. 993.82 s [quickcheck-instances:post-build] copying 2 paths...
  18612. 993.82 s [quickcheck-instances:post-build] copying path '/nix/store/cyjg3lm7jv2ls5jmg8vsamwysnwwyl4w-quickcheck-instances-0.3.32-doc' to 'https://cache.nix-ci.com'...
  18613. 994.23 s [quickcheck-instances:post-build] copying path '/nix/store/dgg6va2m6zgxh7f8p3nf90s76f4sx7yx-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...
  18614. 995.64 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18615. 995.91 s [quickcheck-instances:post-build] copying 1 paths...
  18616. 995.99 s [quickcheck-instances:post-build] copying path '/nix/store/sgxmkybiia4rmszzf7qkvzi242byy698-quickcheck-instances-0.3.32.drv' to 'https://cache.nix-ci.com'...
  18617. 996.14 s Progress: 106 of 113 built, 172 of 172 downloaded from cache
  18618. 996.18 s Building /nix/store/x99zyf7nmnvmp6j1y0hnm8by5c7zl8wy-extra-1.7.16.drv
  18619. 996.31 s [extra] Phase: setupCompilerEnvironmentPhase
  18620. 996.31 s [extra] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  18621. 996.47 s [extra] Phase: unpackPhase
  18622. 996.48 s [extra] unpacking source archive /nix/store/zap07ayqyv48lfcxp4yva8sylcvy2knk-extra-1.7.16.tar.gz
  18623. 996.48 s [extra] source root is extra-1.7.16
  18624. 996.49 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.7.16/test/TestUtil.hs"
  18625. 996.49 s [extra] Phase: patchPhase
  18626. 996.50 s [extra] Replace Cabal file with edited version from mirror://hackage/extra-1.7.16/revision/1.cabal.
  18627. 996.50 s [extra] Phase: compileBuildDriverPhase
  18628. 996.50 s [extra] setupCompileFlags: -package-db=/build/tmp.sG5gVvvsxc/setup-package.conf.d -threaded
  18629. 996.54 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.sG5gVvvsxc/Main.o )
  18630. 996.58 s [extra] [2 of 2] Linking Setup
  18631. 997.59 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18632. 997.60 s [extra] Phase: configurePhase
  18633. 997.60 s [extra] configureFlags: --verbose --prefix=/nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc/share/doc/extra-1.7.16 --with-gcc=gcc --package-db=/build/tmp.sG5gVvvsxc/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  18634. 997.61 s [extra] Using Parsec parser
  18635. 997.61 s [extra] Configuring extra-1.7.16...
  18636. 997.88 s [extra] Dependency base >=4.9 && <4.21: using base-4.18.1.0
  18637. 997.88 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18638. 997.88 s [extra] Dependency directory: using directory-1.3.8.1
  18639. 997.88 s [extra] Dependency filepath: using filepath-1.4.100.4
  18640. 997.88 s [extra] Dependency process: using process-1.6.17.0
  18641. 997.88 s [extra] Dependency time: using time-1.12.2
  18642. 997.88 s [extra] Dependency unix: using unix-2.8.1.0
  18643. 997.88 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.14.3
  18644. 997.88 s [extra] Dependency base >=4 && <5: using base-4.18.1.0
  18645. 997.88 s [extra] Dependency directory: using directory-1.3.8.1
  18646. 997.88 s [extra] Dependency extra: using extra-1.7.16
  18647. 997.88 s [extra] Dependency filepath: using filepath-1.4.100.4
  18648. 997.89 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.32
  18649. 997.89 s [extra] Dependency unix: using unix-2.8.1.0
  18650. 998.11 s [extra] Source component graph:
  18651. 998.11 s [extra] component lib
  18652. 998.11 s [extra] component test:extra-test dependency lib
  18653. 998.11 s [extra] Configured component graph:
  18654. 998.11 s [extra] component extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  18655. 998.11 s [extra] include base-4.18.1.0
  18656. 998.11 s [extra] include clock-0.8.4-Bnns7LmnhG01nLONJf4lGG
  18657. 998.11 s [extra] include directory-1.3.8.1
  18658. 998.11 s [extra] include filepath-1.4.100.4
  18659. 998.11 s [extra] include process-1.6.17.0
  18660. 998.11 s [extra] include time-1.12.2
  18661. 998.11 s [extra] include unix-2.8.1.0
  18662. 998.11 s [extra] component extra-1.7.16-J8bYhHK3Zlq51B5DJeRAR1-extra-test
  18663. 998.11 s [extra] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18664. 998.11 s [extra] include base-4.18.1.0
  18665. 998.11 s [extra] include directory-1.3.8.1
  18666. 998.11 s [extra] include extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  18667. 998.11 s [extra] include filepath-1.4.100.4
  18668. 998.11 s [extra] include quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18669. 998.11 s [extra] include unix-2.8.1.0
  18670. 998.11 s [extra] Linked component graph:
  18671. 998.11 s [extra] unit extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  18672. 998.11 s [extra] include base-4.18.1.0
  18673. 998.11 s [extra] include clock-0.8.4-Bnns7LmnhG01nLONJf4lGG
  18674. 998.11 s [extra] include directory-1.3.8.1
  18675. 998.11 s [extra] include filepath-1.4.100.4
  18676. 998.11 s [extra] include process-1.6.17.0
  18677. 998.11 s [extra] include time-1.12.2
  18678. 998.11 s [extra] include unix-2.8.1.0
  18679. 998.11 s [extra] Control.Concurrent.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Control.Exception.Extra,Control.Monad.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Control.Monad.Extra,Data.Either.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.Either.Extra,Data.Foldable.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.Foldable.Extra,Data.IORef.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.IORef.Extra,Data.List.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.Typeable.Extra,Data.Version.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Data.Version.Extra,Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Extra,Numeric.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Numeric.Extra,System.Directory.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:System.Directory.Extra,System.Environment.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:System.Environment.Extra,System.IO.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:System.IO.Extra,System.Info.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:System.Info.Extra,System.Process.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:System.Process.Extra,System.Time.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:System.Time.Extra,Text.Read.Extra=extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ:Text.Read.Extra
  18680. 998.11 s [extra] unit extra-1.7.16-J8bYhHK3Zlq51B5DJeRAR1-extra-test
  18681. 998.11 s [extra] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18682. 998.11 s [extra] include base-4.18.1.0
  18683. 998.11 s [extra] include directory-1.3.8.1
  18684. 998.11 s [extra] include extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  18685. 998.11 s [extra] include filepath-1.4.100.4
  18686. 998.11 s [extra] include quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18687. 998.11 s [extra] include unix-2.8.1.0
  18688. 998.11 s [extra] Ready component graph:
  18689. 998.11 s [extra] definite extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  18690. 998.11 s [extra] depends base-4.18.1.0
  18691. 998.11 s [extra] depends clock-0.8.4-Bnns7LmnhG01nLONJf4lGG
  18692. 998.11 s [extra] depends directory-1.3.8.1
  18693. 998.11 s [extra] depends filepath-1.4.100.4
  18694. 998.11 s [extra] depends process-1.6.17.0
  18695. 998.11 s [extra] depends time-1.12.2
  18696. 998.11 s [extra] depends unix-2.8.1.0
  18697. 998.11 s [extra] definite extra-1.7.16-J8bYhHK3Zlq51B5DJeRAR1-extra-test
  18698. 998.11 s [extra] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  18699. 998.11 s [extra] depends base-4.18.1.0
  18700. 998.11 s [extra] depends directory-1.3.8.1
  18701. 998.11 s [extra] depends extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  18702. 998.11 s [extra] depends filepath-1.4.100.4
  18703. 998.11 s [extra] depends quickcheck-instances-0.3.32-9fGeBu9hiv82mPGYbzXPCv
  18704. 998.11 s [extra] depends unix-2.8.1.0
  18705. 998.11 s [extra] Using Cabal-3.10.1.0 compiled by ghc-9.6
  18706. 998.11 s [extra] Using compiler: ghc-9.6.3
  18707. 998.11 s [extra] Using install prefix: /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16
  18708. 998.11 s [extra] Executables installed in:
  18709. 998.11 s [extra] /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/bin
  18710. 998.11 s [extra] Libraries installed in:
  18711. 998.11 s [extra] /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  18712. 998.11 s [extra] Dynamic Libraries installed in:
  18713. 998.11 s [extra] /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  18714. 998.11 s [extra] Private executables installed in:
  18715. 998.11 s [extra] /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/libexec/x86_64-linux-ghc-9.6.3/extra-1.7.16
  18716. 998.11 s [extra] Data files installed in:
  18717. 998.11 s [extra] /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/share/x86_64-linux-ghc-9.6.3/extra-1.7.16
  18718. 998.11 s [extra] Documentation installed in:
  18719. 998.11 s [extra] /nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc/share/doc/extra-1.7.16
  18720. 998.11 s [extra] Configuration files installed in:
  18721. 998.11 s [extra] /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/etc
  18722. 998.11 s [extra] No alex found
  18723. 998.11 s [extra] Using ar found on system at:
  18724. 998.11 s [extra] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  18725. 998.11 s [extra] No c2hs found
  18726. 998.11 s [extra] No cpphs found
  18727. 998.11 s [extra] No doctest found
  18728. 998.11 s [extra] Using gcc version 14.3.0 given by user at:
  18729. 998.11 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  18730. 998.11 s [extra] Using ghc version 9.6.3 found on system at:
  18731. 998.11 s [extra] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  18732. 998.11 s [extra] Using ghc-pkg version 9.6.3 found on system at:
  18733. 998.11 s [extra] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  18734. 998.11 s [extra] No ghcjs found
  18735. 998.11 s [extra] No ghcjs-pkg found
  18736. 998.11 s [extra] No greencard found
  18737. 998.11 s [extra] Using haddock version 2.29.1 found on system at:
  18738. 998.11 s [extra] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  18739. 998.11 s [extra] No happy found
  18740. 998.11 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18741. 998.11 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18742. 998.11 s [extra] No hmake found
  18743. 998.11 s [extra] Using hpc version 0.68 found on system at:
  18744. 998.11 s [extra] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  18745. 998.11 s [extra] Using hsc2hs version 0.68.9 found on system at:
  18746. 998.11 s [extra] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  18747. 998.11 s [extra] Using hscolour version 1.25 found on system at:
  18748. 998.11 s [extra] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  18749. 998.11 s [extra] No jhc found
  18750. 998.11 s [extra] Using ld found on system at:
  18751. 998.11 s [extra] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  18752. 998.11 s [extra] No pkg-config found
  18753. 998.11 s [extra] Using runghc version 9.6.3 found on system at:
  18754. 998.11 s [extra] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  18755. 998.11 s [extra] Using strip version 2.44 found on system at:
  18756. 998.11 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  18757. 998.11 s [extra] Using tar found on system at:
  18758. 998.11 s [extra] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  18759. 998.11 s [extra] No uhc found
  18760. 998.21 s [extra] Phase: buildPhase
  18761. 998.26 s [extra] Preprocessing library for extra-1.7.16..
  18762. 998.26 s [extra] Building library for extra-1.7.16..
  18763. 998.47 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 )
  18764. 998.54 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 )
  18765. 998.54 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 )
  18766. 998.56 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 )
  18767. 998.56 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18768. 998.56 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18769. 998.56 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 )
  18770. 999.54 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 )
  18771. 999.58 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 )
  18772. 999.64 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 )
  18773. 999.65 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 )
  18774. 999.65 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 )
  18775. 999.80 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 )
  18776. 999.86 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 )
  18777. 1000.03 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 )
  18778. 1000.03 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 )
  18779. 1000.03 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 )
  18780. 1000.20 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 )
  18781. 1000.20 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 )
  18782. 1000.24 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 )
  18783. 1000.24 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18784. 1000.31 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 )
  18785. 1000.71 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18786. 1000.88 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18787. 1000.88 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18788. 1000.90 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18789. 1000.90 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18790. 1000.90 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18791. 1000.90 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18792. 1002.09 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18793. 1002.22 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18794. 1002.30 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18795. 1002.30 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18796. 1002.30 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18797. 1002.52 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18798. 1002.65 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18799. 1002.80 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18800. 1002.80 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18801. 1002.80 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18802. 1003.02 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18803. 1003.02 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18804. 1003.13 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18805. 1003.13 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18806. 1003.26 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18807. 1004.27 s [extra] Preprocessing test suite 'extra-test' for extra-1.7.16..
  18808. 1004.27 s [extra] Building test suite 'extra-test' for extra-1.7.16..
  18809. 1004.36 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18810. 1004.72 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18811. 1006.63 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18812. 1006.63 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18813. 1007.00 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18814. 1007.90 s [extra] Phase: checkPhase
  18815. 1007.94 s [extra] Running 1 test suites...
  18816. 1007.94 s [extra] Test suite extra-test: RUNNING...
  18817. 1007.95 s [extra] withTempFile
  18818. 1007.99 s [extra] +++ OK, passed 1 test.
  18819. 1007.99 s [extra] captureOutput
  18820. 1007.99 s [extra] +++ OK, passed 1 test.
  18821. 1007.99 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18822. 1007.99 s [extra] +++ OK, passed 100 tests.
  18823. 1007.99 s [extra] \(x :: IO Int) -> join (once x) == x
  18824. 1008.02 s [extra] +++ OK, passed 100 tests.
  18825. 1008.02 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18826. 1008.06 s [extra] +++ OK, passed 100 tests.
  18827. 1008.06 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18828. 1008.10 s [extra] +++ OK, passed 100 tests.
  18829. 1008.10 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18830. 1008.18 s [extra] +++ OK, passed 100 tests.
  18831. 1008.18 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18832. 1008.22 s [extra] +++ OK, passed 100 tests.
  18833. 1008.22 s [extra] stringException "test" == pure "test"
  18834. 1008.22 s [extra] +++ OK, passed 1 test.
  18835. 1008.22 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18836. 1008.22 s [extra] +++ OK, passed 1 test.
  18837. 1008.22 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18838. 1008.22 s [extra] +++ OK, passed 1 test.
  18839. 1008.22 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18840. 1008.23 s [extra] +++ OK, passed 1 test.
  18841. 1008.23 s [extra] ignore (print 1) == print 1
  18842. 1008.23 s [extra] +++ OK, passed 1 test.
  18843. 1008.23 s [extra] ignore (fail "die") == pure ()
  18844. 1008.23 s [extra] +++ OK, passed 1 test.
  18845. 1008.23 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18846. 1008.23 s [extra] +++ OK, passed 1 test.
  18847. 1008.23 s [extra] seq (errorIO "foo") (print 1) == print 1
  18848. 1008.23 s [extra] +++ OK, passed 1 test.
  18849. 1008.23 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18850. 1008.23 s [extra] +++ OK, passed 1 test.
  18851. 1008.23 s [extra] seq (assertIO False) (print 1) == print 1
  18852. 1008.23 s [extra] +++ OK, passed 1 test.
  18853. 1008.23 s [extra] retry 1 (print "x") == print "x"
  18854. 1008.23 s [extra] +++ OK, passed 1 test.
  18855. 1008.23 s [extra] retry 3 (fail "die") == fail "die"
  18856. 1008.23 s [extra] +++ OK, passed 1 test.
  18857. 1008.23 s [extra] whenJust Nothing print == pure ()
  18858. 1008.23 s [extra] +++ OK, passed 1 test.
  18859. 1008.23 s [extra] whenJust (Just 1) print == print 1
  18860. 1008.23 s [extra] +++ OK, passed 1 test.
  18861. 1008.23 s [extra] pureIf @Maybe True 5 == Just 5
  18862. 1008.23 s [extra] +++ OK, passed 1 test.
  18863. 1008.23 s [extra] pureIf @Maybe False 5 == Nothing
  18864. 1008.23 s [extra] +++ OK, passed 1 test.
  18865. 1008.23 s [extra] pureIf @[] True 5 == [5]
  18866. 1008.23 s [extra] +++ OK, passed 1 test.
  18867. 1008.23 s [extra] pureIf @[] False 5 == []
  18868. 1008.23 s [extra] +++ OK, passed 1 test.
  18869. 1008.23 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18870. 1008.23 s [extra] +++ OK, passed 1 test.
  18871. 1008.23 s [extra] whenMaybe False (print 1) == pure Nothing
  18872. 1008.23 s [extra] +++ OK, passed 1 test.
  18873. 1008.23 s [extra] \(x :: Maybe ()) -> unit x == x
  18874. 1008.23 s [extra] +++ OK, passed 100 tests.
  18875. 1008.23 s [extra] fold1M (\x y -> Just x) [] == undefined
  18876. 1008.23 s [extra] +++ OK, passed 1 test.
  18877. 1008.23 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18878. 1008.23 s [extra] +++ OK, passed 1 test.
  18879. 1008.23 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18880. 1008.23 s [extra] +++ OK, passed 1 test.
  18881. 1008.23 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18882. 1008.23 s [extra] +++ OK, passed 1 test.
  18883. 1008.23 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18884. 1008.23 s [extra] +++ OK, passed 1 test.
  18885. 1008.23 s [extra] Just True ||^ undefined == Just True
  18886. 1008.23 s [extra] +++ OK, passed 1 test.
  18887. 1008.23 s [extra] Just False ||^ Just True == Just True
  18888. 1008.23 s [extra] +++ OK, passed 1 test.
  18889. 1008.23 s [extra] Just False ||^ Just False == Just False
  18890. 1008.23 s [extra] +++ OK, passed 1 test.
  18891. 1008.23 s [extra] Just False &&^ undefined == Just False
  18892. 1008.23 s [extra] +++ OK, passed 1 test.
  18893. 1008.23 s [extra] Just True &&^ Just True == Just True
  18894. 1008.23 s [extra] +++ OK, passed 1 test.
  18895. 1008.23 s [extra] Just True &&^ Just False == Just False
  18896. 1008.23 s [extra] +++ OK, passed 1 test.
  18897. 1008.23 s [extra] anyM Just [False,True ,undefined] == Just True
  18898. 1008.23 s [extra] +++ OK, passed 1 test.
  18899. 1008.23 s [extra] anyM Just [False,False,undefined] == undefined
  18900. 1008.23 s [extra] +++ OK, passed 1 test.
  18901. 1008.23 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18902. 1008.23 s [extra] +++ OK, passed 100 tests.
  18903. 1008.23 s [extra] allM Just [True,False,undefined] == Just False
  18904. 1008.24 s [extra] +++ OK, passed 1 test.
  18905. 1008.24 s [extra] allM Just [True,True ,undefined] == undefined
  18906. 1008.24 s [extra] +++ OK, passed 1 test.
  18907. 1008.24 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18908. 1008.24 s [extra] +++ OK, passed 100 tests.
  18909. 1008.24 s [extra] orM [Just False,Just True ,undefined] == Just True
  18910. 1008.24 s [extra] +++ OK, passed 1 test.
  18911. 1008.24 s [extra] orM [Just False,Just False,undefined] == undefined
  18912. 1008.24 s [extra] +++ OK, passed 1 test.
  18913. 1008.24 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18914. 1008.24 s [extra] +++ OK, passed 100 tests.
  18915. 1008.24 s [extra] andM [Just True,Just False,undefined] == Just False
  18916. 1008.24 s [extra] +++ OK, passed 1 test.
  18917. 1008.24 s [extra] andM [Just True,Just True ,undefined] == undefined
  18918. 1008.24 s [extra] +++ OK, passed 1 test.
  18919. 1008.24 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18920. 1008.24 s [extra] +++ OK, passed 100 tests.
  18921. 1008.24 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18922. 1008.24 s [extra] +++ OK, passed 1 test.
  18923. 1008.24 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18924. 1008.24 s [extra] +++ OK, passed 1 test.
  18925. 1008.24 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18926. 1008.24 s [extra] +++ OK, passed 1 test.
  18927. 1008.24 s [extra] fromLeft 1 (Left 3) == 3
  18928. 1008.24 s [extra] +++ OK, passed 1 test.
  18929. 1008.24 s [extra] fromLeft 1 (Right "foo") == 1
  18930. 1008.24 s [extra] +++ OK, passed 1 test.
  18931. 1008.24 s [extra] fromRight 1 (Right 3) == 3
  18932. 1008.24 s [extra] +++ OK, passed 1 test.
  18933. 1008.24 s [extra] fromRight 1 (Left "foo") == 1
  18934. 1008.24 s [extra] +++ OK, passed 1 test.
  18935. 1008.24 s [extra] \x -> fromLeft' (Left x) == x
  18936. 1008.24 s [extra] +++ OK, passed 100 tests.
  18937. 1008.24 s [extra] \x -> fromLeft' (Right x) == undefined
  18938. 1008.24 s [extra] +++ OK, passed 100 tests.
  18939. 1008.24 s [extra] \x -> fromRight' (Right x) == x
  18940. 1008.24 s [extra] +++ OK, passed 100 tests.
  18941. 1008.24 s [extra] \x -> fromRight' (Left x) == undefined
  18942. 1008.24 s [extra] +++ OK, passed 100 tests.
  18943. 1008.24 s [extra] \x -> fromEither (Left x ) == x
  18944. 1008.24 s [extra] +++ OK, passed 100 tests.
  18945. 1008.24 s [extra] \x -> fromEither (Right x) == x
  18946. 1008.24 s [extra] +++ OK, passed 100 tests.
  18947. 1008.24 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18948. 1008.24 s [extra] +++ OK, passed 100 tests.
  18949. 1008.24 s [extra] \a -> maybeToEither a Nothing == Left a
  18950. 1008.24 s [extra] +++ OK, passed 100 tests.
  18951. 1008.24 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18952. 1008.24 s [extra] +++ OK, passed 100 tests.
  18953. 1008.24 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18954. 1008.24 s [extra] +++ OK, passed 100 tests.
  18955. 1008.24 s [extra] mapLeft show (Left 1) == Left "1"
  18956. 1008.24 s [extra] +++ OK, passed 1 test.
  18957. 1008.24 s [extra] mapLeft show (Right True) == Right True
  18958. 1008.24 s [extra] +++ OK, passed 1 test.
  18959. 1008.24 s [extra] mapRight show (Left 1) == Left 1
  18960. 1008.24 s [extra] +++ OK, passed 1 test.
  18961. 1008.24 s [extra] mapRight show (Right True) == Right "True"
  18962. 1008.24 s [extra] +++ OK, passed 1 test.
  18963. 1008.24 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18964. 1008.25 s [extra] +++ OK, passed 100 tests.
  18965. 1008.25 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18966. 1008.25 s [extra] +++ OK, passed 100 tests.
  18967. 1008.25 s [extra] \xs -> repeatedly line1 xs == lines xs
  18968. 1008.25 s [extra] +++ OK, passed 100 tests.
  18969. 1008.25 s [extra] disjoint [1,2,3] [4,5] == True
  18970. 1008.25 s [extra] +++ OK, passed 1 test.
  18971. 1008.25 s [extra] disjoint [1,2,3] [4,1] == False
  18972. 1008.25 s [extra] +++ OK, passed 1 test.
  18973. 1008.26 s [extra] disjointOrd [1,2,3] [4,5] == True
  18974. 1008.26 s [extra] +++ OK, passed 1 test.
  18975. 1008.26 s [extra] disjointOrd [1,2,3] [4,1] == False
  18976. 1008.26 s [extra] +++ OK, passed 1 test.
  18977. 1008.26 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18978. 1008.26 s [extra] +++ OK, passed 1 test.
  18979. 1008.26 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18980. 1008.26 s [extra] +++ OK, passed 1 test.
  18981. 1008.26 s [extra] anySame [1,1,2] == True
  18982. 1008.26 s [extra] +++ OK, passed 1 test.
  18983. 1008.26 s [extra] anySame [1,2,3] == False
  18984. 1008.26 s [extra] +++ OK, passed 1 test.
  18985. 1008.26 s [extra] anySame (1:2:1:undefined) == True
  18986. 1008.26 s [extra] +++ OK, passed 1 test.
  18987. 1008.26 s [extra] anySame [] == False
  18988. 1008.26 s [extra] +++ OK, passed 1 test.
  18989. 1008.26 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18990. 1008.26 s [extra] +++ OK, passed 100 tests.
  18991. 1008.26 s [extra] allSame [1,1,2] == False
  18992. 1008.26 s [extra] +++ OK, passed 1 test.
  18993. 1008.26 s [extra] allSame [1,1,1] == True
  18994. 1008.26 s [extra] +++ OK, passed 1 test.
  18995. 1008.26 s [extra] allSame [1] == True
  18996. 1008.26 s [extra] +++ OK, passed 1 test.
  18997. 1008.26 s [extra] allSame [] == True
  18998. 1008.26 s [extra] +++ OK, passed 1 test.
  18999. 1008.26 s [extra] allSame (1:1:2:undefined) == False
  19000. 1008.26 s [extra] +++ OK, passed 1 test.
  19001. 1008.26 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  19002. 1008.26 s [extra] +++ OK, passed 100 tests.
  19003. 1008.26 s [extra] headDef 1 [] == 1
  19004. 1008.26 s [extra] +++ OK, passed 1 test.
  19005. 1008.26 s [extra] headDef 1 [2,3,4] == 2
  19006. 1008.26 s [extra] +++ OK, passed 1 test.
  19007. 1008.26 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  19008. 1008.26 s [extra] +++ OK, passed 100 tests.
  19009. 1008.26 s [extra] lastDef 1 [] == 1
  19010. 1008.26 s [extra] +++ OK, passed 1 test.
  19011. 1008.26 s [extra] lastDef 1 [2,3,4] == 4
  19012. 1008.26 s [extra] +++ OK, passed 1 test.
  19013. 1008.26 s [extra] \x xs -> lastDef x xs == last (x:xs)
  19014. 1008.26 s [extra] +++ OK, passed 100 tests.
  19015. 1008.26 s [extra] [2,3,4] !? 1 == Just 3
  19016. 1008.26 s [extra] +++ OK, passed 1 test.
  19017. 1008.26 s [extra] [2,3,4] !? (-1) == Nothing
  19018. 1008.26 s [extra] +++ OK, passed 1 test.
  19019. 1008.26 s [extra] [] !? 0 == Nothing
  19020. 1008.26 s [extra] +++ OK, passed 1 test.
  19021. 1008.26 s [extra] notNull [] == False
  19022. 1008.26 s [extra] +++ OK, passed 1 test.
  19023. 1008.26 s [extra] notNull [1] == True
  19024. 1008.26 s [extra] +++ OK, passed 1 test.
  19025. 1008.26 s [extra] \xs -> notNull xs == not (null xs)
  19026. 1008.26 s [extra] +++ OK, passed 100 tests.
  19027. 1008.26 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  19028. 1008.26 s [extra] +++ OK, passed 1 test.
  19029. 1008.26 s [extra] list 1 (\v _ -> v - 2) [] == 1
  19030. 1008.26 s [extra] +++ OK, passed 1 test.
  19031. 1008.26 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  19032. 1008.26 s [extra] +++ OK, passed 100 tests.
  19033. 1008.26 s [extra] unsnoc "test" == Just ("tes",'t')
  19034. 1008.26 s [extra] +++ OK, passed 1 test.
  19035. 1008.26 s [extra] unsnoc "" == Nothing
  19036. 1008.26 s [extra] +++ OK, passed 1 test.
  19037. 1008.26 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  19038. 1008.26 s [extra] +++ OK, passed 100 tests.
  19039. 1008.26 s [extra] cons 't' "est" == "test"
  19040. 1008.26 s [extra] +++ OK, passed 1 test.
  19041. 1008.26 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  19042. 1008.26 s [extra] +++ OK, passed 100 tests.
  19043. 1008.26 s [extra] snoc "tes" 't' == "test"
  19044. 1008.26 s [extra] +++ OK, passed 1 test.
  19045. 1008.27 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  19046. 1008.27 s [extra] +++ OK, passed 100 tests.
  19047. 1008.27 s [extra] enumerate == [False, True]
  19048. 1008.27 s [extra] +++ OK, passed 1 test.
  19049. 1008.27 s [extra] takeEnd 3 "hello" == "llo"
  19050. 1008.27 s [extra] +++ OK, passed 1 test.
  19051. 1008.27 s [extra] takeEnd 5 "bye" == "bye"
  19052. 1008.27 s [extra] +++ OK, passed 1 test.
  19053. 1008.27 s [extra] takeEnd (-1) "bye" == ""
  19054. 1008.27 s [extra] +++ OK, passed 1 test.
  19055. 1008.27 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  19056. 1008.27 s [extra] +++ OK, passed 100 tests.
  19057. 1008.27 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  19058. 1008.27 s [extra] +++ OK, passed 100 tests.
  19059. 1008.27 s [extra] dropEnd 3 "hello" == "he"
  19060. 1008.27 s [extra] +++ OK, passed 1 test.
  19061. 1008.27 s [extra] dropEnd 5 "bye" == ""
  19062. 1008.27 s [extra] +++ OK, passed 1 test.
  19063. 1008.27 s [extra] dropEnd (-1) "bye" == "bye"
  19064. 1008.27 s [extra] +++ OK, passed 1 test.
  19065. 1008.27 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  19066. 1008.27 s [extra] +++ OK, passed 100 tests.
  19067. 1008.27 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  19068. 1008.27 s [extra] +++ OK, passed 100 tests.
  19069. 1008.27 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  19070. 1008.27 s [extra] +++ OK, passed 100 tests.
  19071. 1008.27 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  19072. 1008.27 s [extra] +++ OK, passed 1 test.
  19073. 1008.27 s [extra] splitAtEnd 3 "he" == ("", "he")
  19074. 1008.27 s [extra] +++ OK, passed 1 test.
  19075. 1008.27 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  19076. 1008.27 s [extra] +++ OK, passed 100 tests.
  19077. 1008.27 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  19078. 1008.27 s [extra] +++ OK, passed 100 tests.
  19079. 1008.27 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  19080. 1008.27 s [extra] +++ OK, passed 100 tests.
  19081. 1008.27 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  19082. 1008.27 s [extra] +++ OK, passed 1 test.
  19083. 1008.27 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  19084. 1008.27 s [extra] +++ OK, passed 100 tests.
  19085. 1008.27 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  19086. 1008.27 s [extra] +++ OK, passed 1 test.
  19087. 1008.27 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  19088. 1008.27 s [extra] +++ OK, passed 1 test.
  19089. 1008.27 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  19090. 1008.27 s [extra] +++ OK, passed 1 test.
  19091. 1008.27 s [extra] trim " hello " == "hello"
  19092. 1008.27 s [extra] +++ OK, passed 1 test.
  19093. 1008.27 s [extra] trimStart " hello " == "hello "
  19094. 1008.27 s [extra] +++ OK, passed 1 test.
  19095. 1008.27 s [extra] trimEnd " hello " == " hello"
  19096. 1008.27 s [extra] +++ OK, passed 1 test.
  19097. 1008.27 s [extra] \s -> trim s == trimEnd (trimStart s)
  19098. 1008.27 s [extra] +++ OK, passed 100 tests.
  19099. 1008.27 s [extra] lower "This is A TEST" == "this is a test"
  19100. 1008.27 s [extra] +++ OK, passed 1 test.
  19101. 1008.27 s [extra] lower "" == ""
  19102. 1008.28 s [extra] +++ OK, passed 1 test.
  19103. 1008.28 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  19104. 1008.28 s [extra] +++ OK, passed 1 test.
  19105. 1008.28 s [extra] upper "" == ""
  19106. 1008.28 s [extra] +++ OK, passed 1 test.
  19107. 1008.28 s [extra] word1 "" == ("", "")
  19108. 1008.28 s [extra] +++ OK, passed 1 test.
  19109. 1008.28 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  19110. 1008.28 s [extra] +++ OK, passed 1 test.
  19111. 1008.28 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  19112. 1008.28 s [extra] +++ OK, passed 1 test.
  19113. 1008.28 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  19114. 1008.28 s [extra] +++ OK, passed 100 tests.
  19115. 1008.28 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  19116. 1008.28 s [extra] +++ OK, passed 100 tests.
  19117. 1008.28 s [extra] line1 "" == ("", "")
  19118. 1008.28 s [extra] +++ OK, passed 1 test.
  19119. 1008.28 s [extra] line1 "test" == ("test","")
  19120. 1008.28 s [extra] +++ OK, passed 1 test.
  19121. 1008.28 s [extra] line1 "test\n" == ("test","")
  19122. 1008.28 s [extra] +++ OK, passed 1 test.
  19123. 1008.28 s [extra] line1 "test\nrest" == ("test","rest")
  19124. 1008.28 s [extra] +++ OK, passed 1 test.
  19125. 1008.28 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  19126. 1008.28 s [extra] +++ OK, passed 1 test.
  19127. 1008.28 s [extra] escapeHTML "this is a test" == "this is a test"
  19128. 1008.28 s [extra] +++ OK, passed 1 test.
  19129. 1008.28 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  19130. 1008.28 s [extra] +++ OK, passed 1 test.
  19131. 1008.28 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  19132. 1008.28 s [extra] +++ OK, passed 1 test.
  19133. 1008.28 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  19134. 1008.28 s [extra] +++ OK, passed 100 tests.
  19135. 1008.28 s [extra] escapeJSON "this is a test" == "this is a test"
  19136. 1008.28 s [extra] +++ OK, passed 1 test.
  19137. 1008.28 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  19138. 1008.28 s [extra] +++ OK, passed 1 test.
  19139. 1008.28 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  19140. 1008.28 s [extra] +++ OK, passed 1 test.
  19141. 1008.28 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  19142. 1008.28 s [extra] +++ OK, passed 100 tests.
  19143. 1008.28 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  19144. 1008.28 s [extra] +++ OK, passed 1 test.
  19145. 1008.28 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  19146. 1008.28 s [extra] +++ OK, passed 1 test.
  19147. 1008.28 s [extra] maximumOn id [] == undefined
  19148. 1008.28 s [extra] +++ OK, passed 1 test.
  19149. 1008.28 s [extra] maximumOn length ["test","extra","a"] == "extra"
  19150. 1008.28 s [extra] +++ OK, passed 1 test.
  19151. 1008.28 s [extra] minimumOn id [] == undefined
  19152. 1008.28 s [extra] +++ OK, passed 1 test.
  19153. 1008.28 s [extra] minimumOn length ["test","extra","a"] == "a"
  19154. 1008.28 s [extra] +++ OK, passed 1 test.
  19155. 1008.28 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  19156. 1008.28 s [extra] +++ OK, passed 1 test.
  19157. 1008.28 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  19158. 1008.29 s [extra] +++ OK, passed 100 tests.
  19159. 1008.29 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  19160. 1008.29 s [extra] +++ OK, passed 100 tests.
  19161. 1008.29 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19162. 1008.29 s [extra] +++ OK, passed 1 test.
  19163. 1008.29 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19164. 1008.29 s [extra] +++ OK, passed 1 test.
  19165. 1008.29 s [extra] sum' [1, 2, 3] == 6
  19166. 1008.29 s [extra] +++ OK, passed 1 test.
  19167. 1008.29 s [extra] sumOn' read ["1", "2", "3"] == 6
  19168. 1008.29 s [extra] +++ OK, passed 1 test.
  19169. 1008.29 s [extra] product' [1, 2, 4] == 8
  19170. 1008.29 s [extra] +++ OK, passed 1 test.
  19171. 1008.29 s [extra] productOn' read ["1", "2", "4"] == 8
  19172. 1008.29 s [extra] +++ OK, passed 1 test.
  19173. 1008.29 s [extra] merge "ace" "bd" == "abcde"
  19174. 1008.29 s [extra] +++ OK, passed 1 test.
  19175. 1008.29 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  19176. 1008.29 s [extra] +++ OK, passed 100 tests.
  19177. 1008.29 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  19178. 1008.29 s [extra] +++ OK, passed 1 test.
  19179. 1008.29 s [extra] replace "el" "e" "Hello" == "Helo"
  19180. 1008.29 s [extra] +++ OK, passed 1 test.
  19181. 1008.29 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  19182. 1008.29 s [extra] +++ OK, passed 1 test.
  19183. 1008.29 s [extra] replace "" "x" "" == "x"
  19184. 1008.29 s [extra] +++ OK, passed 1 test.
  19185. 1008.29 s [extra] \xs ys -> replace xs xs ys == ys
  19186. 1008.29 s [extra] +++ OK, passed 100 tests.
  19187. 1008.29 s [extra] breakEnd isLower "youRE" == ("you","RE")
  19188. 1008.29 s [extra] +++ OK, passed 1 test.
  19189. 1008.29 s [extra] breakEnd isLower "youre" == ("youre","")
  19190. 1008.29 s [extra] +++ OK, passed 1 test.
  19191. 1008.29 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  19192. 1008.29 s [extra] +++ OK, passed 1 test.
  19193. 1008.29 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  19194. 1008.29 s [extra] +++ OK, passed 100 tests.
  19195. 1008.29 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  19196. 1008.30 s [extra] +++ OK, passed 1 test.
  19197. 1008.30 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  19198. 1008.30 s [extra] +++ OK, passed 1 test.
  19199. 1008.30 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  19200. 1008.30 s [extra] +++ OK, passed 100 tests.
  19201. 1008.30 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  19202. 1008.30 s [extra] +++ OK, passed 100 tests.
  19203. 1008.30 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  19204. 1008.30 s [extra] +++ OK, passed 1 test.
  19205. 1008.30 s [extra] \s -> wordsBy isSpace s == words s
  19206. 1008.30 s [extra] +++ OK, passed 100 tests.
  19207. 1008.30 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  19208. 1008.30 s [extra] +++ OK, passed 1 test.
  19209. 1008.30 s [extra] \s -> linesBy (== '\n') s == lines s
  19210. 1008.30 s [extra] +++ OK, passed 100 tests.
  19211. 1008.30 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  19212. 1008.30 s [extra] +++ OK, passed 1 test.
  19213. 1008.30 s [extra] firstJust id [Nothing,Just 3] == Just 3
  19214. 1008.30 s [extra] +++ OK, passed 1 test.
  19215. 1008.30 s [extra] firstJust id [Nothing,Nothing] == Nothing
  19216. 1008.30 s [extra] +++ OK, passed 1 test.
  19217. 1008.30 s [extra] drop1 "" == ""
  19218. 1008.30 s [extra] +++ OK, passed 1 test.
  19219. 1008.30 s [extra] drop1 "test" == "est"
  19220. 1008.30 s [extra] +++ OK, passed 1 test.
  19221. 1008.30 s [extra] \xs -> drop 1 xs == drop1 xs
  19222. 1008.30 s [extra] +++ OK, passed 100 tests.
  19223. 1008.30 s [extra] dropEnd1 "" == ""
  19224. 1008.30 s [extra] +++ OK, passed 1 test.
  19225. 1008.30 s [extra] dropEnd1 "test" == "tes"
  19226. 1008.30 s [extra] +++ OK, passed 1 test.
  19227. 1008.30 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  19228. 1008.30 s [extra] +++ OK, passed 100 tests.
  19229. 1008.30 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  19230. 1008.30 s [extra] +++ OK, passed 1 test.
  19231. 1008.30 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  19232. 1008.32 s [extra] +++ OK, passed 100 tests.
  19233. 1008.32 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  19234. 1008.32 s [extra] +++ OK, passed 1 test.
  19235. 1008.32 s [extra] breakOn "/" "foobar" == ("foobar", "")
  19236. 1008.33 s [extra] +++ OK, passed 1 test.
  19237. 1008.33 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  19238. 1008.33 s [extra] +++ OK, passed 100 tests.
  19239. 1008.33 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  19240. 1008.33 s [extra] +++ OK, passed 1 test.
  19241. 1008.33 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  19242. 1008.33 s [extra] +++ OK, passed 1 test.
  19243. 1008.33 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  19244. 1008.33 s [extra] +++ OK, passed 1 test.
  19245. 1008.33 s [extra] splitOn "x" "x" == ["",""]
  19246. 1008.33 s [extra] +++ OK, passed 1 test.
  19247. 1008.33 s [extra] splitOn "x" "" == [""]
  19248. 1008.33 s [extra] +++ OK, passed 1 test.
  19249. 1008.33 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  19250. 1008.33 s [extra] +++ OK, passed 100 tests; 15 discarded.
  19251. 1008.33 s [extra] \c x -> splitOn [c] x == split (==c) x
  19252. 1008.33 s [extra] +++ OK, passed 100 tests.
  19253. 1008.33 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  19254. 1008.33 s [extra] +++ OK, passed 1 test.
  19255. 1008.33 s [extra] split (== 'a') "" == [""]
  19256. 1008.33 s [extra] +++ OK, passed 1 test.
  19257. 1008.33 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  19258. 1008.33 s [extra] +++ OK, passed 1 test.
  19259. 1008.33 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  19260. 1008.33 s [extra] +++ OK, passed 1 test.
  19261. 1008.33 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  19262. 1008.33 s [extra] +++ OK, passed 1 test.
  19263. 1008.33 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  19264. 1008.33 s [extra] +++ OK, passed 1 test.
  19265. 1008.33 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  19266. 1008.33 s [extra] +++ OK, passed 1 test.
  19267. 1008.33 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  19268. 1008.33 s [extra] +++ OK, passed 1 test.
  19269. 1008.33 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  19270. 1008.33 s [extra] +++ OK, passed 1 test.
  19271. 1008.33 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  19272. 1008.33 s [extra] +++ OK, passed 1 test.
  19273. 1008.33 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  19274. 1008.33 s [extra] +++ OK, passed 1 test.
  19275. 1008.33 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  19276. 1008.33 s [extra] +++ OK, passed 1 test.
  19277. 1008.33 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  19278. 1008.33 s [extra] +++ OK, passed 1 test.
  19279. 1008.33 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  19280. 1008.33 s [extra] +++ OK, passed 1 test.
  19281. 1008.33 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  19282. 1008.33 s [extra] +++ OK, passed 1 test.
  19283. 1008.33 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  19284. 1008.33 s [extra] +++ OK, passed 1 test.
  19285. 1008.33 s [extra] stripSuffix "" "baz" == Just "baz"
  19286. 1008.34 s [extra] +++ OK, passed 1 test.
  19287. 1008.34 s [extra] stripSuffix "foo" "quux" == Nothing
  19288. 1008.34 s [extra] +++ OK, passed 1 test.
  19289. 1008.34 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  19290. 1008.34 s [extra] +++ OK, passed 1 test.
  19291. 1008.34 s [extra] stripInfix "/" "foobar" == Nothing
  19292. 1008.34 s [extra] +++ OK, passed 1 test.
  19293. 1008.34 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  19294. 1008.34 s [extra] +++ OK, passed 1 test.
  19295. 1008.34 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  19296. 1008.34 s [extra] +++ OK, passed 1 test.
  19297. 1008.34 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  19298. 1008.34 s [extra] +++ OK, passed 1 test.
  19299. 1008.34 s [extra] chunksOf 8 "" == []
  19300. 1008.34 s [extra] +++ OK, passed 1 test.
  19301. 1008.34 s [extra] chunksOf 0 "test" == undefined
  19302. 1008.34 s [extra] +++ OK, passed 1 test.
  19303. 1008.34 s [extra] nubSort "this is a test" == " aehist"
  19304. 1008.34 s [extra] +++ OK, passed 1 test.
  19305. 1008.34 s [extra] \xs -> nubSort xs == nub (sort xs)
  19306. 1008.34 s [extra] +++ OK, passed 100 tests.
  19307. 1008.34 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  19308. 1008.34 s [extra] +++ OK, passed 1 test.
  19309. 1008.34 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  19310. 1008.34 s [extra] +++ OK, passed 1 test.
  19311. 1008.34 s [extra] nubOrd "this is a test" == "this ae"
  19312. 1008.34 s [extra] +++ OK, passed 1 test.
  19313. 1008.34 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  19314. 1008.34 s [extra] +++ OK, passed 1 test.
  19315. 1008.34 s [extra] \xs -> nubOrd xs == nub xs
  19316. 1008.34 s [extra] +++ OK, passed 100 tests.
  19317. 1008.34 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  19318. 1008.34 s [extra] +++ OK, passed 1 test.
  19319. 1008.34 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  19320. 1008.34 s [extra] +++ OK, passed 1 test.
  19321. 1008.34 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  19322. 1008.34 s [extra] +++ OK, passed 1 test.
  19323. 1008.34 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  19324. 1008.34 s [extra] +++ OK, passed 1 test.
  19325. 1008.34 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  19326. 1008.34 s [extra] +++ OK, passed 1 test.
  19327. 1008.34 s [extra] compareLength [1,2,3] 1 == GT
  19328. 1008.34 s [extra] +++ OK, passed 1 test.
  19329. 1008.34 s [extra] compareLength [1,2] 2 == EQ
  19330. 1008.34 s [extra] +++ OK, passed 1 test.
  19331. 1008.34 s [extra] \(xs :: [Int]) n -> compareLength xs n == compare (length xs) n
  19332. 1008.34 s [extra] +++ OK, passed 100 tests.
  19333. 1008.34 s [extra] compareLength (1:2:3:undefined) 2 == GT
  19334. 1008.34 s [extra] +++ OK, passed 1 test.
  19335. 1008.34 s [extra] comparingLength [1,2,3] [False] == GT
  19336. 1008.34 s [extra] +++ OK, passed 1 test.
  19337. 1008.34 s [extra] comparingLength [1,2] "ab" == EQ
  19338. 1008.34 s [extra] +++ OK, passed 1 test.
  19339. 1008.34 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  19340. 1008.35 s [extra] +++ OK, passed 100 tests.
  19341. 1008.35 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  19342. 1008.36 s [extra] +++ OK, passed 1 test.
  19343. 1008.36 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  19344. 1008.36 s [extra] +++ OK, passed 1 test.
  19345. 1008.36 s [extra] mwhen True "test" == "test"
  19346. 1008.36 s [extra] +++ OK, passed 1 test.
  19347. 1008.36 s [extra] mwhen False "test" == ""
  19348. 1008.36 s [extra] +++ OK, passed 1 test.
  19349. 1008.36 s [extra] first succ (1,"test") == (2,"test")
  19350. 1008.36 s [extra] +++ OK, passed 1 test.
  19351. 1008.36 s [extra] second reverse (1,"test") == (1,"tset")
  19352. 1008.36 s [extra] +++ OK, passed 1 test.
  19353. 1008.36 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  19354. 1008.36 s [extra] +++ OK, passed 1 test.
  19355. 1008.36 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  19356. 1008.36 s [extra] +++ OK, passed 1 test.
  19357. 1008.36 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  19358. 1008.36 s [extra] +++ OK, passed 1 test.
  19359. 1008.36 s [extra] (succ &&& pred) 1 == (2,0)
  19360. 1008.36 s [extra] +++ OK, passed 1 test.
  19361. 1008.36 s [extra] dupe 12 == (12, 12)
  19362. 1008.36 s [extra] +++ OK, passed 1 test.
  19363. 1008.36 s [extra] both succ (1,2) == (2,3)
  19364. 1008.36 s [extra] +++ OK, passed 1 test.
  19365. 1008.36 s [extra] first3 succ (1,1,1) == (2,1,1)
  19366. 1008.36 s [extra] +++ OK, passed 1 test.
  19367. 1008.36 s [extra] second3 succ (1,1,1) == (1,2,1)
  19368. 1008.36 s [extra] +++ OK, passed 1 test.
  19369. 1008.36 s [extra] third3 succ (1,1,1) == (1,1,2)
  19370. 1008.36 s [extra] +++ OK, passed 1 test.
  19371. 1008.36 s [extra] \x -> readVersion (showVersion x) == x
  19372. 1008.36 s [extra] +++ OK, passed 100 tests.
  19373. 1008.36 s [extra] readVersion "hello" == undefined
  19374. 1008.36 s [extra] +++ OK, passed 1 test.
  19375. 1008.36 s [extra] showDP 4 pi == "3.1416"
  19376. 1008.36 s [extra] +++ OK, passed 1 test.
  19377. 1008.36 s [extra] showDP 0 pi == "3"
  19378. 1008.36 s [extra] +++ OK, passed 1 test.
  19379. 1008.36 s [extra] showDP 2 3 == "3.00"
  19380. 1008.36 s [extra] +++ OK, passed 1 test.
  19381. 1008.36 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  19382. 1008.36 s [extra] +++ OK, passed 1 test.
  19383. 1008.36 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  19384. 1008.36 s [extra] +++ OK, passed 1 test.
  19385. 1008.36 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  19386. 1008.36 s [extra] +++ OK, passed 1 test.
  19387. 1008.36 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  19388. 1008.36 s [extra] +++ OK, passed 1 test.
  19389. 1008.36 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  19390. 1008.36 s [extra] +++ OK, passed 1 test.
  19391. 1008.36 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19392. 1008.36 s [extra] +++ OK, passed 1 test.
  19393. 1008.36 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19394. 1008.36 s [extra] +++ OK, passed 1 test.
  19395. 1008.36 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  19396. 1008.36 s [extra] +++ OK, passed 1 test.
  19397. 1008.36 s [extra] isWindows == (os == "mingw32")
  19398. 1008.36 s [extra] +++ OK, passed 1 test.
  19399. 1008.36 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  19400. 1008.39 s [extra] +++ OK, passed 100 tests.
  19401. 1008.39 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  19402. 1008.43 s [extra] +++ OK, passed 100 tests.
  19403. 1008.43 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  19404. 1008.45 s [extra] +++ OK, passed 100 tests.
  19405. 1008.45 s [extra] captureOutput (print 1) == pure ("1\n",())
  19406. 1008.46 s [extra] +++ OK, passed 1 test.
  19407. 1008.46 s [extra] withTempFile doesFileExist == pure True
  19408. 1008.46 s [extra] +++ OK, passed 1 test.
  19409. 1008.46 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  19410. 1008.46 s [extra] +++ OK, passed 1 test.
  19411. 1008.46 s [extra] withTempFile readFile' == pure ""
  19412. 1008.46 s [extra] +++ OK, passed 1 test.
  19413. 1008.46 s [extra] withTempDir doesDirectoryExist == pure True
  19414. 1008.46 s [extra] +++ OK, passed 1 test.
  19415. 1008.46 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  19416. 1008.46 s [extra] +++ OK, passed 1 test.
  19417. 1008.46 s [extra] withTempDir listFiles == pure []
  19418. 1008.46 s [extra] +++ OK, passed 1 test.
  19419. 1008.46 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  19420. 1008.46 s [extra] +++ OK, passed 1 test.
  19421. 1008.46 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  19422. 1008.46 s [extra] +++ OK, passed 1 test.
  19423. 1008.46 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  19424. 1008.46 s [extra] +++ OK, passed 1 test.
  19425. 1008.46 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  19426. 1008.46 s [extra] +++ OK, passed 1 test.
  19427. 1008.46 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  19428. 1008.46 s [extra] +++ OK, passed 1 test.
  19429. 1008.46 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  19430. 1008.46 s [extra] +++ OK, passed 1 test.
  19431. 1008.46 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  19432. 1009.46 s [extra] +++ OK, passed 1 test.
  19433. 1009.46 s [extra] timeout (-3) (print 1) == pure Nothing
  19434. 1009.46 s [extra] +++ OK, passed 1 test.
  19435. 1009.46 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  19436. 1009.46 s [extra] +++ OK, passed 1 test.
  19437. 1009.46 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  19438. 1009.56 s [extra] 0.100432901
  19439. 1009.56 s [extra] +++ OK, passed 1 test.
  19440. 1009.56 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  19441. 1009.66 s [extra] +++ OK, passed 1 test.
  19442. 1009.66 s [extra] showDuration 3.435 == "3.44s"
  19443. 1009.66 s [extra] +++ OK, passed 1 test.
  19444. 1009.66 s [extra] showDuration 623.8 == "10m24s"
  19445. 1009.66 s [extra] +++ OK, passed 1 test.
  19446. 1009.66 s [extra] showDuration 62003.8 == "17h13m"
  19447. 1009.66 s [extra] +++ OK, passed 1 test.
  19448. 1009.66 s [extra] showDuration 1e8 == "27777h47m"
  19449. 1009.66 s [extra] +++ OK, passed 1 test.
  19450. 1009.66 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  19451. 1009.66 s [extra] +++ OK, passed 1 test.
  19452. 1009.67 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  19453. 1010.67 s [extra] +++ OK, passed 1 test.
  19454. 1010.67 s [extra] Extra export
  19455. 1010.67 s [extra] +++ OK, passed 1 test.
  19456. 1010.67 s [extra] withTempFile
  19457. 1010.69 s [extra] ....done
  19458. 1010.69 s [extra] withTempDir
  19459. 1010.71 s [extra] ....done
  19460. 1010.71 s [extra] retry
  19461. 1010.71 s [extra] +++ OK, passed 1 test.
  19462. 1010.71 s [extra] barrier
  19463. 1010.71 s [extra] Success (323 tests)
  19464. 1010.75 s [extra] Test suite extra-test: PASS
  19465. 1010.75 s [extra] Test suite logged to: dist/test/extra-1.7.16-extra-test.log
  19466. 1010.75 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  19467. 1010.76 s [extra] Phase: haddockPhase
  19468. 1010.98 s [extra] Preprocessing library for extra-1.7.16..
  19469. 1010.99 s [extra] Running Haddock on library for extra-1.7.16..
  19470. 1011.09 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  19471. 1011.60 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  19472. 1011.62 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  19473. 1011.64 s [extra] Warning: 'Arrow' is out of scope.
  19474. 1011.64 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19475. 1011.64 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  19476. 1011.66 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  19477. 1011.71 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  19478. 1011.94 s [extra] Warning: '(:)' is out of scope.
  19479. 1011.94 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19480. 1011.95 s [extra] Warning: 'firstJustM' is out of scope.
  19481. 1011.95 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19482. 1011.96 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  19483. 1012.24 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  19484. 1012.27 s [extra] 100% ( 22 / 22) in 'Data.List.NonEmpty.Extra'
  19485. 1012.29 s [extra] Warning: 'fromJust' is out of scope.
  19486. 1012.29 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19487. 1012.30 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  19488. 1012.35 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19489. 1012.40 s [extra] Warning: 'partition' is out of scope.
  19490. 1012.40 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19491. 1012.40 s [extra] Warning: 'mconcatMap' is out of scope.
  19492. 1012.40 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19493. 1012.41 s [extra] Warning: 'find' is out of scope.
  19494. 1012.41 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19495. 1012.41 s [extra] 100% ( 38 / 38) in 'Control.Monad.Extra'
  19496. 1012.46 s [extra] 92% ( 12 / 13) in 'Data.Foldable.Extra'
  19497. 1012.46 s [extra] Missing documentation for:
  19498. 1012.46 s [extra] Module header
  19499. 1012.52 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19500. 1012.59 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19501. 1012.61 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19502. 1012.78 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19503. 1012.82 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19504. 1012.84 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19505. 1012.88 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19506. 1013.13 s [extra] 100% (268 /268) in 'Extra'
  19507. 1013.29 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19508. 1017.51 s [extra] Documentation created: dist/doc/html/extra/index.html,
  19509. 1017.51 s [extra] dist/doc/html/extra/extra.txt
  19510. 1017.73 s [extra] Preprocessing test suite 'extra-test' for extra-1.7.16..
  19511. 1017.74 s [extra] Phase: installPhase
  19512. 1018.03 s [extra] Installing library in /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  19513. 1019.42 s [extra] Phase: fixupPhase
  19514. 1019.58 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16
  19515. 1019.63 s [extra] shrinking /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSextra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ-ghc9.6.3.so
  19516. 1019.63 s [extra] checking for references to /build/ in /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16...
  19517. 1019.69 s [extra] patching script interpreter paths in /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16
  19518. 1019.71 s [extra] stripping (with command strip and flags -S -p) in /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16/lib
  19519. 1020.60 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc
  19520. 1020.61 s [extra] checking for references to /build/ in /nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc...
  19521. 1020.63 s [extra] patching script interpreter paths in /nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc
  19522. 1020.98 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16 /nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc
  19523. 1022.30 s [extra:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  19524. 1022.30 s [extra:post-build]
  19525. 1022.70 s [extra:post-build] Pushing /nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc (2.95 MiB)
  19526. 1022.91 s [extra:post-build] Pushing /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16 (4.13 MiB)
  19527. 1024.03 s [extra:post-build]
  19528. 1024.03 s [extra:post-build] All done.
  19529. 1024.21 s [extra:post-build] Uploading to the NixCI cache: /nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16 /nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc
  19530. 1024.50 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19531. 1024.79 s [extra:post-build] copying 2 paths...
  19532. 1024.84 s [extra:post-build] copying path '/nix/store/lr3a0vkrla8kpzgcdm2fffrpqlb6rgrx-extra-1.7.16-doc' to 'https://cache.nix-ci.com'...
  19533. 1025.82 s [extra:post-build] copying path '/nix/store/3b65hn0h7gdni44pa26n1b7jrv2hvj2s-extra-1.7.16' to 'https://cache.nix-ci.com'...
  19534. 1028.34 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19535. 1028.74 s [extra:post-build] copying 1 paths...
  19536. 1028.74 s [extra:post-build] copying path '/nix/store/x99zyf7nmnvmp6j1y0hnm8by5c7zl8wy-extra-1.7.16.drv' to 'https://cache.nix-ci.com'...
  19537. 1029.13 s Progress: 107 of 113 built, 172 of 172 downloaded from cache
  19538. 1029.23 s Building /nix/store/hkmvcq18gdpc2h5crjzvsb77mzn2gj9k-algebraic-graphs-0.7.drv
  19539. 1029.33 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19540. 1029.34 s [algebraic-graphs] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  19541. 1029.55 s [algebraic-graphs] Phase: unpackPhase
  19542. 1029.56 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19543. 1029.63 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19544. 1029.66 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19545. 1029.68 s [algebraic-graphs] Phase: patchPhase
  19546. 1029.70 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19547. 1029.84 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19548. 1029.88 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.UChYUFiN8f/setup-package.conf.d -threaded
  19549. 1030.02 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.UChYUFiN8f/Main.o )
  19550. 1030.20 s [algebraic-graphs] [2 of 2] Linking Setup
  19551. 1031.87 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19552. 1031.89 s [algebraic-graphs] Phase: configurePhase
  19553. 1031.89 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.UChYUFiN8f/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/lib
  19554. 1031.91 s [algebraic-graphs] Using Parsec parser
  19555. 1031.91 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19556. 1032.40 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.5.0
  19557. 1032.40 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.18.1.0
  19558. 1032.40 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19559. 1032.40 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  19560. 1032.40 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19561. 1032.40 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
  19562. 1032.40 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19563. 1032.40 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.5.0
  19564. 1032.40 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.18.1.0
  19565. 1032.40 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19566. 1032.40 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  19567. 1032.40 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.7.16
  19568. 1032.40 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.6: using
  19569. 1032.40 s [algebraic-graphs] inspection-testing-0.5.0.3
  19570. 1032.40 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19571. 1032.79 s [algebraic-graphs] Source component graph:
  19572. 1032.79 s [algebraic-graphs] component lib
  19573. 1032.79 s [algebraic-graphs] component test:main dependency lib
  19574. 1032.79 s [algebraic-graphs] Configured component graph:
  19575. 1032.79 s [algebraic-graphs] component algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  19576. 1032.79 s [algebraic-graphs] include array-0.5.5.0
  19577. 1032.79 s [algebraic-graphs] include base-4.18.1.0
  19578. 1032.79 s [algebraic-graphs] include containers-0.6.7
  19579. 1032.79 s [algebraic-graphs] include deepseq-1.4.8.1
  19580. 1032.79 s [algebraic-graphs] include transformers-0.6.1.0
  19581. 1032.79 s [algebraic-graphs] component algebraic-graphs-0.7-3GNigIVBdVFH4d8mj8WRCt-main
  19582. 1032.79 s [algebraic-graphs] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  19583. 1032.79 s [algebraic-graphs] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  19584. 1032.79 s [algebraic-graphs] include array-0.5.5.0
  19585. 1032.79 s [algebraic-graphs] include base-4.18.1.0
  19586. 1032.79 s [algebraic-graphs] include containers-0.6.7
  19587. 1032.79 s [algebraic-graphs] include deepseq-1.4.8.1
  19588. 1032.79 s [algebraic-graphs] include extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  19589. 1032.79 s [algebraic-graphs] include inspection-testing-0.5.0.3-9igwMEhiwfIEUBfr9Ix7CK
  19590. 1032.79 s [algebraic-graphs] include transformers-0.6.1.0
  19591. 1032.79 s [algebraic-graphs] Linked component graph:
  19592. 1032.79 s [algebraic-graphs] unit algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  19593. 1032.79 s [algebraic-graphs] include array-0.5.5.0
  19594. 1032.79 s [algebraic-graphs] include base-4.18.1.0
  19595. 1032.79 s [algebraic-graphs] include containers-0.6.7
  19596. 1032.79 s [algebraic-graphs] include deepseq-1.4.8.1
  19597. 1032.79 s [algebraic-graphs] include transformers-0.6.1.0
  19598. 1032.79 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj:Data.Graph.Typed
  19599. 1032.79 s [algebraic-graphs] unit algebraic-graphs-0.7-3GNigIVBdVFH4d8mj8WRCt-main
  19600. 1032.80 s [algebraic-graphs] include QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  19601. 1032.80 s [algebraic-graphs] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  19602. 1032.80 s [algebraic-graphs] include array-0.5.5.0
  19603. 1032.80 s [algebraic-graphs] include base-4.18.1.0
  19604. 1032.80 s [algebraic-graphs] include containers-0.6.7
  19605. 1032.80 s [algebraic-graphs] include deepseq-1.4.8.1
  19606. 1032.80 s [algebraic-graphs] include extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  19607. 1032.80 s [algebraic-graphs] include inspection-testing-0.5.0.3-9igwMEhiwfIEUBfr9Ix7CK
  19608. 1032.80 s [algebraic-graphs] include transformers-0.6.1.0
  19609. 1032.80 s [algebraic-graphs] Ready component graph:
  19610. 1032.80 s [algebraic-graphs] definite algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  19611. 1032.80 s [algebraic-graphs] depends array-0.5.5.0
  19612. 1032.80 s [algebraic-graphs] depends base-4.18.1.0
  19613. 1032.80 s [algebraic-graphs] depends containers-0.6.7
  19614. 1032.80 s [algebraic-graphs] depends deepseq-1.4.8.1
  19615. 1032.80 s [algebraic-graphs] depends transformers-0.6.1.0
  19616. 1032.80 s [algebraic-graphs] definite algebraic-graphs-0.7-3GNigIVBdVFH4d8mj8WRCt-main
  19617. 1032.80 s [algebraic-graphs] depends QuickCheck-2.14.3-IAjrznsuljOBEe2hEqHytS
  19618. 1032.80 s [algebraic-graphs] depends algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  19619. 1032.80 s [algebraic-graphs] depends array-0.5.5.0
  19620. 1032.80 s [algebraic-graphs] depends base-4.18.1.0
  19621. 1032.80 s [algebraic-graphs] depends containers-0.6.7
  19622. 1032.80 s [algebraic-graphs] depends deepseq-1.4.8.1
  19623. 1032.80 s [algebraic-graphs] depends extra-1.7.16-6u90tMa5XsYFEeN9uSc9pJ
  19624. 1032.80 s [algebraic-graphs] depends inspection-testing-0.5.0.3-9igwMEhiwfIEUBfr9Ix7CK
  19625. 1032.80 s [algebraic-graphs] depends transformers-0.6.1.0
  19626. 1032.80 s [algebraic-graphs] Using Cabal-3.10.1.0 compiled by ghc-9.6
  19627. 1032.80 s [algebraic-graphs] Using compiler: ghc-9.6.3
  19628. 1032.80 s [algebraic-graphs] Using install prefix:
  19629. 1032.80 s [algebraic-graphs] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  19630. 1032.80 s [algebraic-graphs] Executables installed in:
  19631. 1032.80 s [algebraic-graphs] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/bin
  19632. 1032.80 s [algebraic-graphs] Libraries installed in:
  19633. 1032.80 s [algebraic-graphs] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  19634. 1032.80 s [algebraic-graphs] Dynamic Libraries installed in:
  19635. 1032.80 s [algebraic-graphs] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  19636. 1032.80 s [algebraic-graphs] Private executables installed in:
  19637. 1032.80 s [algebraic-graphs] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.6.3/algebraic-graphs-0.7
  19638. 1032.80 s [algebraic-graphs] Data files installed in:
  19639. 1032.80 s [algebraic-graphs] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.6.3/algebraic-graphs-0.7
  19640. 1032.80 s [algebraic-graphs] Documentation installed in:
  19641. 1032.80 s [algebraic-graphs] /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19642. 1032.80 s [algebraic-graphs] Configuration files installed in:
  19643. 1032.80 s [algebraic-graphs] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/etc
  19644. 1032.80 s [algebraic-graphs] No alex found
  19645. 1032.80 s [algebraic-graphs] Using ar found on system at:
  19646. 1032.80 s [algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  19647. 1032.80 s [algebraic-graphs] No c2hs found
  19648. 1032.80 s [algebraic-graphs] No cpphs found
  19649. 1032.80 s [algebraic-graphs] No doctest found
  19650. 1032.80 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19651. 1032.80 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  19652. 1032.80 s [algebraic-graphs] Using ghc version 9.6.3 found on system at:
  19653. 1032.80 s [algebraic-graphs] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  19654. 1032.80 s [algebraic-graphs] Using ghc-pkg version 9.6.3 found on system at:
  19655. 1032.80 s [algebraic-graphs] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  19656. 1032.80 s [algebraic-graphs] No ghcjs found
  19657. 1032.80 s [algebraic-graphs] No ghcjs-pkg found
  19658. 1032.80 s [algebraic-graphs] No greencard found
  19659. 1032.80 s [algebraic-graphs] Using haddock version 2.29.1 found on system at:
  19660. 1032.80 s [algebraic-graphs] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  19661. 1032.80 s [algebraic-graphs] No happy found
  19662. 1032.80 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19663. 1032.80 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19664. 1032.80 s [algebraic-graphs] No hmake found
  19665. 1032.80 s [algebraic-graphs] Using hpc version 0.68 found on system at:
  19666. 1032.80 s [algebraic-graphs] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  19667. 1032.80 s [algebraic-graphs] Using hsc2hs version 0.68.9 found on system at:
  19668. 1032.80 s [algebraic-graphs] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  19669. 1032.80 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19670. 1032.80 s [algebraic-graphs] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  19671. 1032.80 s [algebraic-graphs] No jhc found
  19672. 1032.80 s [algebraic-graphs] Using ld found on system at:
  19673. 1032.80 s [algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  19674. 1032.80 s [algebraic-graphs] No pkg-config found
  19675. 1032.80 s [algebraic-graphs] Using runghc version 9.6.3 found on system at:
  19676. 1032.80 s [algebraic-graphs] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  19677. 1032.80 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19678. 1032.80 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  19679. 1032.80 s [algebraic-graphs] Using tar found on system at:
  19680. 1032.80 s [algebraic-graphs] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  19681. 1032.80 s [algebraic-graphs] No uhc found
  19682. 1033.02 s [algebraic-graphs] Phase: buildPhase
  19683. 1033.13 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  19684. 1033.13 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  19685. 1033.28 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 )
  19686. 1034.84 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 )
  19687. 1035.89 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 )
  19688. 1036.63 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 )
  19689. 1036.63 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19690. 1037.91 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 )
  19691. 1038.57 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 )
  19692. 1039.17 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 )
  19693. 1040.54 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 )
  19694. 1040.54 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 )
  19695. 1040.54 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 )
  19696. 1040.54 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 )
  19697. 1040.54 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 )
  19698. 1040.54 s [algebraic-graphs]
  19699. 1040.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19700. 1040.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19701. 1040.54 s [algebraic-graphs] will become an error in a future GHC release.
  19702. 1040.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19703. 1040.54 s [algebraic-graphs] |
  19704. 1040.54 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19705. 1040.54 s [algebraic-graphs] | ^
  19706. 1040.54 s [algebraic-graphs]
  19707. 1040.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19708. 1040.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19709. 1040.54 s [algebraic-graphs] will become an error in a future GHC release.
  19710. 1040.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19711. 1040.54 s [algebraic-graphs] |
  19712. 1040.54 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19713. 1040.54 s [algebraic-graphs] | ^
  19714. 1040.54 s [algebraic-graphs]
  19715. 1040.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19716. 1040.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19717. 1040.54 s [algebraic-graphs] will become an error in a future GHC release.
  19718. 1040.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19719. 1040.54 s [algebraic-graphs] |
  19720. 1040.54 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19721. 1040.54 s [algebraic-graphs] | ^
  19722. 1040.54 s [algebraic-graphs]
  19723. 1040.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19724. 1040.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19725. 1040.54 s [algebraic-graphs] will become an error in a future GHC release.
  19726. 1040.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19727. 1040.54 s [algebraic-graphs] |
  19728. 1040.54 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19729. 1040.54 s [algebraic-graphs] | ^
  19730. 1040.54 s [algebraic-graphs]
  19731. 1040.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19732. 1040.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19733. 1040.54 s [algebraic-graphs] will become an error in a future GHC release.
  19734. 1040.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19735. 1040.54 s [algebraic-graphs] |
  19736. 1040.54 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19737. 1040.54 s [algebraic-graphs] | ^
  19738. 1040.54 s [algebraic-graphs]
  19739. 1040.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19740. 1040.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19741. 1040.54 s [algebraic-graphs] will become an error in a future GHC release.
  19742. 1040.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19743. 1040.54 s [algebraic-graphs] |
  19744. 1040.54 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19745. 1040.54 s [algebraic-graphs] | ^
  19746. 1040.54 s [algebraic-graphs]
  19747. 1040.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19748. 1040.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19749. 1040.54 s [algebraic-graphs] will become an error in a future GHC release.
  19750. 1040.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19751. 1040.54 s [algebraic-graphs] |
  19752. 1040.54 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19753. 1040.54 s [algebraic-graphs] | ^
  19754. 1040.54 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 )
  19755. 1041.01 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 )
  19756. 1041.85 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 )
  19757. 1042.29 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 )
  19758. 1042.29 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 )
  19759. 1043.04 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 )
  19760. 1043.33 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 )
  19761. 1043.75 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 )
  19762. 1043.75 s [algebraic-graphs]
  19763. 1043.75 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19764. 1043.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19765. 1043.75 s [algebraic-graphs] will become an error in a future GHC release.
  19766. 1043.75 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19767. 1043.75 s [algebraic-graphs] |
  19768. 1043.75 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19769. 1043.75 s [algebraic-graphs] | ^
  19770. 1043.75 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 )
  19771. 1043.75 s [algebraic-graphs]
  19772. 1043.75 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19773. 1043.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19774. 1043.75 s [algebraic-graphs] will become an error in a future GHC release.
  19775. 1043.75 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19776. 1043.75 s [algebraic-graphs] |
  19777. 1043.75 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19778. 1043.75 s [algebraic-graphs] | ^
  19779. 1043.75 s [algebraic-graphs]
  19780. 1043.75 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19781. 1043.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19782. 1043.75 s [algebraic-graphs] will become an error in a future GHC release.
  19783. 1043.75 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19784. 1043.75 s [algebraic-graphs] |
  19785. 1043.75 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19786. 1043.75 s [algebraic-graphs] | ^
  19787. 1043.75 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 )
  19788. 1043.75 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 )
  19789. 1043.75 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 )
  19790. 1043.95 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 )
  19791. 1043.98 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 )
  19792. 1043.98 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 )
  19793. 1044.08 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 )
  19794. 1044.43 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19795. 1045.79 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19796. 1046.73 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 )
  19797. 1047.39 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19798. 1047.39 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19799. 1048.99 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 )
  19800. 1049.64 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 )
  19801. 1050.19 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 )
  19802. 1051.32 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19803. 1051.32 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 )
  19804. 1051.32 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 )
  19805. 1051.32 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 )
  19806. 1051.32 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19807. 1051.32 s [algebraic-graphs]
  19808. 1051.32 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19809. 1051.32 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19810. 1051.32 s [algebraic-graphs] will become an error in a future GHC release.
  19811. 1051.32 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19812. 1051.32 s [algebraic-graphs] |
  19813. 1051.32 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19814. 1051.32 s [algebraic-graphs] | ^
  19815. 1051.32 s [algebraic-graphs]
  19816. 1051.32 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19817. 1051.32 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19818. 1051.32 s [algebraic-graphs] will become an error in a future GHC release.
  19819. 1051.32 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19820. 1051.32 s [algebraic-graphs] |
  19821. 1051.32 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19822. 1051.32 s [algebraic-graphs] | ^
  19823. 1051.32 s [algebraic-graphs]
  19824. 1051.32 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19825. 1051.32 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19826. 1051.32 s [algebraic-graphs] will become an error in a future GHC release.
  19827. 1051.32 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19828. 1051.32 s [algebraic-graphs] |
  19829. 1051.32 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19830. 1051.32 s [algebraic-graphs] | ^
  19831. 1051.32 s [algebraic-graphs]
  19832. 1051.32 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19833. 1051.32 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19834. 1051.32 s [algebraic-graphs] will become an error in a future GHC release.
  19835. 1051.32 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19836. 1051.32 s [algebraic-graphs] |
  19837. 1051.32 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19838. 1051.32 s [algebraic-graphs] | ^
  19839. 1051.32 s [algebraic-graphs]
  19840. 1051.32 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19841. 1051.32 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19842. 1051.32 s [algebraic-graphs] will become an error in a future GHC release.
  19843. 1051.32 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19844. 1051.32 s [algebraic-graphs] |
  19845. 1051.32 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19846. 1051.32 s [algebraic-graphs] | ^
  19847. 1051.32 s [algebraic-graphs]
  19848. 1051.32 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19849. 1051.32 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19850. 1051.32 s [algebraic-graphs] will become an error in a future GHC release.
  19851. 1051.32 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19852. 1051.32 s [algebraic-graphs] |
  19853. 1051.32 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19854. 1051.32 s [algebraic-graphs] | ^
  19855. 1051.32 s [algebraic-graphs]
  19856. 1051.32 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19857. 1051.32 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19858. 1051.32 s [algebraic-graphs] will become an error in a future GHC release.
  19859. 1051.32 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19860. 1051.32 s [algebraic-graphs] |
  19861. 1051.32 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19862. 1051.33 s [algebraic-graphs] | ^
  19863. 1051.33 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19864. 1051.47 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 )
  19865. 1052.12 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19866. 1052.12 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 )
  19867. 1052.16 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19868. 1053.56 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 )
  19869. 1054.06 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 )
  19870. 1054.33 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19871. 1054.33 s [algebraic-graphs]
  19872. 1054.33 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19873. 1054.33 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19874. 1054.33 s [algebraic-graphs] will become an error in a future GHC release.
  19875. 1054.33 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19876. 1054.33 s [algebraic-graphs] |
  19877. 1054.33 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19878. 1054.33 s [algebraic-graphs] | ^
  19879. 1054.33 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 )
  19880. 1054.33 s [algebraic-graphs]
  19881. 1054.33 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19882. 1054.33 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19883. 1054.33 s [algebraic-graphs] will become an error in a future GHC release.
  19884. 1054.33 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19885. 1054.33 s [algebraic-graphs] |
  19886. 1054.33 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19887. 1054.33 s [algebraic-graphs] | ^
  19888. 1054.33 s [algebraic-graphs]
  19889. 1054.33 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19890. 1054.33 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19891. 1054.33 s [algebraic-graphs] will become an error in a future GHC release.
  19892. 1054.33 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19893. 1054.33 s [algebraic-graphs] |
  19894. 1054.33 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19895. 1054.33 s [algebraic-graphs] | ^
  19896. 1054.33 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19897. 1054.33 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19898. 1054.33 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 )
  19899. 1054.50 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 )
  19900. 1054.50 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 )
  19901. 1054.50 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 )
  19902. 1054.51 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19903. 1055.98 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  19904. 1055.98 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  19905. 1056.11 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 )
  19906. 1058.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 )
  19907. 1063.25 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 )
  19908. 1063.25 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 )
  19909. 1063.39 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 )
  19910. 1066.16 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 )
  19911. 1066.16 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 )
  19912. 1066.16 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 )
  19913. 1071.07 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 )
  19914. 1071.42 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 )
  19915. 1071.42 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 )
  19916. 1072.59 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 )
  19917. 1072.59 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 )
  19918. 1072.59 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 )
  19919. 1073.57 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 )
  19920. 1073.57 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 )
  19921. 1073.57 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 )
  19922. 1073.57 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 )
  19923. 1073.57 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 )
  19924. 1073.57 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 )
  19925. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19926. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19927. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19928. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19929. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19930. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19931. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19932. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19933. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19934. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19935. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19936. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19937. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19938. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19939. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19940. 1073.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19941. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19942. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19943. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19944. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19945. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19946. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19947. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19948. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19949. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19950. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19951. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19952. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19953. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19954. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19955. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19956. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19957. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19958. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19959. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19960. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19961. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19962. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19963. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19964. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19965. 1073.58 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19966. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19967. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19968. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19969. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19970. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19971. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19972. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19973. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19974. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19975. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19976. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19977. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19978. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19979. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19980. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19981. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19982. 1073.59 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19983. 1073.59 s [algebraic-graphs] inspection testing successful
  19984. 1073.59 s [algebraic-graphs] expected successes: 58
  19985. 1073.59 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 )
  19986. 1073.59 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 )
  19987. 1073.59 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 )
  19988. 1074.63 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19989. 1075.92 s [algebraic-graphs] buildPhase completed in 43 seconds
  19990. 1075.92 s [algebraic-graphs] Phase: checkPhase
  19991. 1075.96 s [algebraic-graphs] Running 1 test suites...
  19992. 1075.96 s [algebraic-graphs] Test suite main: RUNNING...
  19993. 1086.78 s [algebraic-graphs]
  19994. 1086.78 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19995. 1086.82 s [algebraic-graphs] OK: show empty == "empty"
  19996. 1086.82 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19997. 1086.82 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19998. 1086.82 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19999. 1086.82 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  20000. 1086.82 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  20001. 1086.82 s [algebraic-graphs]
  20002. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  20003. 1086.82 s [algebraic-graphs] OK: fromAcyclic empty == empty
  20004. 1086.82 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  20005. 1086.82 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  20006. 1086.82 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  20007. 1086.82 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  20008. 1086.82 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  20009. 1086.82 s [algebraic-graphs]
  20010. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  20011. 1086.82 s [algebraic-graphs] OK: isEmpty empty == True
  20012. 1086.82 s [algebraic-graphs] OK: hasVertex x empty == False
  20013. 1086.82 s [algebraic-graphs] OK: vertexCount empty == 0
  20014. 1086.82 s [algebraic-graphs] OK: edgeCount empty == 0
  20015. 1086.82 s [algebraic-graphs]
  20016. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  20017. 1086.82 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20018. 1086.82 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20019. 1086.82 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20020. 1086.82 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20021. 1086.82 s [algebraic-graphs]
  20022. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  20023. 1086.82 s [algebraic-graphs] OK: vertices [] == empty
  20024. 1086.82 s [algebraic-graphs] OK: vertices [x] == vertex x
  20025. 1086.82 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20026. 1086.82 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20027. 1086.82 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20028. 1086.82 s [algebraic-graphs]
  20029. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  20030. 1086.82 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  20031. 1086.82 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  20032. 1086.82 s [algebraic-graphs]
  20033. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  20034. 1086.82 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  20035. 1086.82 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  20036. 1086.82 s [algebraic-graphs]
  20037. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  20038. 1086.82 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20039. 1086.82 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20040. 1086.82 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20041. 1086.82 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  20042. 1086.82 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20043. 1086.82 s [algebraic-graphs]
  20044. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  20045. 1086.82 s [algebraic-graphs] OK: isEmpty empty == True
  20046. 1086.82 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20047. 1086.82 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20048. 1086.82 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  20049. 1086.82 s [algebraic-graphs]
  20050. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  20051. 1086.82 s [algebraic-graphs] OK: hasVertex x empty == False
  20052. 1086.82 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20053. 1086.82 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20054. 1086.82 s [algebraic-graphs]
  20055. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  20056. 1086.82 s [algebraic-graphs] OK: hasEdge x y empty == False
  20057. 1086.82 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20058. 1086.82 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  20059. 1086.82 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20060. 1086.82 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20061. 1086.82 s [algebraic-graphs]
  20062. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  20063. 1086.82 s [algebraic-graphs] OK: vertexCount empty == 0
  20064. 1086.82 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20065. 1086.82 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20066. 1086.82 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20067. 1086.82 s [algebraic-graphs]
  20068. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  20069. 1086.82 s [algebraic-graphs] OK: edgeCount empty == 0
  20070. 1086.82 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20071. 1086.82 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  20072. 1086.82 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20073. 1086.82 s [algebraic-graphs]
  20074. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  20075. 1086.82 s [algebraic-graphs] OK: vertexList empty == []
  20076. 1086.82 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20077. 1086.82 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20078. 1086.82 s [algebraic-graphs]
  20079. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  20080. 1086.82 s [algebraic-graphs] OK: edgeList empty == []
  20081. 1086.82 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20082. 1086.82 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  20083. 1086.82 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20084. 1086.82 s [algebraic-graphs]
  20085. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  20086. 1086.82 s [algebraic-graphs] OK: adjacencyList empty == []
  20087. 1086.82 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20088. 1086.82 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  20089. 1086.82 s [algebraic-graphs]
  20090. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  20091. 1086.82 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20092. 1086.82 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20093. 1086.82 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20094. 1086.82 s [algebraic-graphs]
  20095. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  20096. 1086.82 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20097. 1086.82 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20098. 1086.82 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  20099. 1086.82 s [algebraic-graphs]
  20100. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  20101. 1086.82 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20102. 1086.82 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20103. 1086.82 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  20104. 1086.82 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  20105. 1086.82 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  20106. 1086.82 s [algebraic-graphs]
  20107. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  20108. 1086.82 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20109. 1086.82 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20110. 1086.82 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  20111. 1086.82 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  20112. 1086.82 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  20113. 1086.82 s [algebraic-graphs]
  20114. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  20115. 1086.82 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20116. 1086.82 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20117. 1086.82 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  20118. 1086.82 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20119. 1086.82 s [algebraic-graphs]
  20120. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  20121. 1086.82 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  20122. 1086.82 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20123. 1086.82 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20124. 1086.82 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  20125. 1086.82 s [algebraic-graphs]
  20126. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  20127. 1086.82 s [algebraic-graphs] OK: transpose empty == empty
  20128. 1086.82 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20129. 1086.82 s [algebraic-graphs] OK: transpose . transpose == id
  20130. 1086.82 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20131. 1086.82 s [algebraic-graphs]
  20132. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  20133. 1086.82 s [algebraic-graphs] OK: induce (const True ) x == x
  20134. 1086.82 s [algebraic-graphs] OK: induce (const False) x == empty
  20135. 1086.82 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20136. 1086.82 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20137. 1086.82 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20138. 1086.82 s [algebraic-graphs]
  20139. 1086.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  20140. 1086.82 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20141. 1086.83 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  20142. 1086.83 s [algebraic-graphs]
  20143. 1086.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  20144. 1086.83 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  20145. 1086.83 s [algebraic-graphs]
  20146. 1086.83 s [algebraic-graphs] OK: box x y ~~ box y x
  20147. 1086.83 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20148. 1086.83 s [algebraic-graphs] OK: box x empty ~~ empty
  20149. 1086.83 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20150. 1086.83 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20151. 1086.83 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20152. 1086.83 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20153. 1086.83 s [algebraic-graphs]
  20154. 1086.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  20155. 1086.83 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20156. 1086.83 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20157. 1086.83 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  20158. 1086.83 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20159. 1086.83 s [algebraic-graphs]
  20160. 1086.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  20161. 1086.83 s [algebraic-graphs] OK: topSort empty == []
  20162. 1086.83 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  20163. 1086.83 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  20164. 1086.83 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  20165. 1086.83 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  20166. 1086.83 s [algebraic-graphs]
  20167. 1086.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  20168. 1086.83 s [algebraic-graphs] OK: scc empty == empty
  20169. 1086.83 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20170. 1086.83 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20171. 1086.83 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  20172. 1086.83 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20173. 1086.83 s [algebraic-graphs]
  20174. 1086.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  20175. 1086.83 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  20176. 1086.83 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  20177. 1086.83 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  20178. 1086.83 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  20179. 1086.83 s [algebraic-graphs]
  20180. 1086.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  20181. 1086.83 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  20182. 1086.83 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  20183. 1086.83 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  20184. 1086.83 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  20185. 1086.83 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  20186. 1086.83 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  20187. 1091.32 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  20188. 1091.32 s [algebraic-graphs]
  20189. 1091.32 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  20190. 1091.32 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  20191. 1091.32 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  20192. 1091.32 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  20193. 1091.32 s [algebraic-graphs]
  20194. 1091.32 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  20195. 1091.32 s [algebraic-graphs] OK: Arbitrary
  20196. 1091.32 s [algebraic-graphs] OK: empty
  20197. 1091.32 s [algebraic-graphs] OK: vertex
  20198. 1091.32 s [algebraic-graphs] OK: vertices
  20199. 1091.32 s [algebraic-graphs] OK: union
  20200. 1091.32 s [algebraic-graphs] OK: join
  20201. 1091.32 s [algebraic-graphs] OK: transpose
  20202. 1091.32 s [algebraic-graphs] OK: box
  20203. 1091.32 s [algebraic-graphs] OK: transitiveClosure
  20204. 1091.32 s [algebraic-graphs] OK: scc
  20205. 1091.32 s [algebraic-graphs] OK: toAcyclic
  20206. 1091.32 s [algebraic-graphs] OK: toAcyclicOrd
  20207. 1091.32 s [algebraic-graphs]
  20208. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap ============
  20209. 1091.32 s [algebraic-graphs] OK: Axioms of graphs
  20210. 1091.32 s [algebraic-graphs]
  20211. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  20212. 1091.32 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  20213. 1091.32 s [algebraic-graphs]
  20214. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  20215. 1091.32 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20216. 1091.32 s [algebraic-graphs]
  20217. 1091.32 s [algebraic-graphs] OK: consistent empty == True
  20218. 1091.32 s [algebraic-graphs] OK: consistent (vertex x) == True
  20219. 1091.32 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20220. 1091.32 s [algebraic-graphs] OK: consistent (connect x y) == True
  20221. 1091.32 s [algebraic-graphs] OK: consistent (edge x y) == True
  20222. 1091.32 s [algebraic-graphs] OK: consistent (edges xs) == True
  20223. 1091.32 s [algebraic-graphs] OK: consistent (stars xs) == True
  20224. 1091.32 s [algebraic-graphs]
  20225. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  20226. 1091.32 s [algebraic-graphs] OK: show (empty ) == "empty"
  20227. 1091.32 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20228. 1091.32 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20229. 1091.32 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20230. 1091.32 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20231. 1091.32 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20232. 1091.32 s [algebraic-graphs]
  20233. 1091.32 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20234. 1091.32 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20235. 1091.32 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20236. 1091.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20237. 1091.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20238. 1091.32 s [algebraic-graphs]
  20239. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  20240. 1091.32 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20241. 1091.32 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20242. 1091.32 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20243. 1091.32 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20244. 1091.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20245. 1091.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20246. 1091.32 s [algebraic-graphs] OK: x <= x + y
  20247. 1091.32 s [algebraic-graphs] OK: x + y <= x * y
  20248. 1091.32 s [algebraic-graphs]
  20249. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  20250. 1091.32 s [algebraic-graphs] OK: isEmpty empty == True
  20251. 1091.32 s [algebraic-graphs] OK: hasVertex x empty == False
  20252. 1091.32 s [algebraic-graphs] OK: vertexCount empty == 0
  20253. 1091.32 s [algebraic-graphs] OK: edgeCount empty == 0
  20254. 1091.32 s [algebraic-graphs]
  20255. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  20256. 1091.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20257. 1091.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20258. 1091.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20259. 1091.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20260. 1091.32 s [algebraic-graphs]
  20261. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  20262. 1091.32 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20263. 1091.32 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20264. 1091.32 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20265. 1091.32 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20266. 1091.32 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20267. 1091.32 s [algebraic-graphs]
  20268. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  20269. 1091.32 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20270. 1091.32 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20271. 1091.32 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20272. 1091.32 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20273. 1091.32 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20274. 1091.32 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20275. 1091.32 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20276. 1091.32 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20277. 1091.32 s [algebraic-graphs]
  20278. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  20279. 1091.32 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20280. 1091.32 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20281. 1091.32 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20282. 1091.32 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20283. 1091.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20284. 1091.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20285. 1091.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20286. 1091.32 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20287. 1091.32 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20288. 1091.32 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20289. 1091.32 s [algebraic-graphs]
  20290. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  20291. 1091.32 s [algebraic-graphs] OK: vertices [] == empty
  20292. 1091.32 s [algebraic-graphs] OK: vertices [x] == vertex x
  20293. 1091.32 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20294. 1091.32 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20295. 1091.32 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20296. 1091.32 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20297. 1091.32 s [algebraic-graphs]
  20298. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  20299. 1091.32 s [algebraic-graphs] OK: edges [] == empty
  20300. 1091.32 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20301. 1091.32 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20302. 1091.32 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20303. 1091.32 s [algebraic-graphs]
  20304. 1091.32 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  20305. 1091.32 s [algebraic-graphs] OK: overlays [] == empty
  20306. 1091.33 s [algebraic-graphs] OK: overlays [x] == x
  20307. 1091.33 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20308. 1091.33 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20309. 1091.33 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20310. 1091.33 s [algebraic-graphs]
  20311. 1091.33 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  20312. 1091.33 s [algebraic-graphs] OK: connects [] == empty
  20313. 1091.33 s [algebraic-graphs] OK: connects [x] == x
  20314. 1091.33 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20315. 1091.33 s [algebraic-graphs] OK: connects == foldr connect empty
  20316. 1091.33 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20317. 1091.33 s [algebraic-graphs]
  20318. 1091.33 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  20319. 1091.33 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  20320. 1091.33 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  20321. 1091.33 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  20322. 1091.33 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  20323. 1091.33 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  20324. 1091.33 s [algebraic-graphs]
  20325. 1091.33 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  20326. 1091.33 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20327. 1091.33 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20328. 1091.33 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20329. 1091.33 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20330. 1091.33 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20331. 1091.33 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20332. 1091.33 s [algebraic-graphs]
  20333. 1091.33 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  20334. 1091.33 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20335. 1091.33 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20336. 1091.33 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20337. 1091.33 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20338. 1091.33 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20339. 1091.33 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20340. 1091.33 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20341. 1091.33 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20342. 1091.33 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20343. 1091.33 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20344. 1091.33 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20345. 1091.33 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20346. 1091.33 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20347. 1091.33 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20348. 1091.33 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20349. 1091.33 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20350. 1091.33 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20351. 1091.33 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20352. 1091.33 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20353. 1091.33 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20354. 1091.33 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20355. 1091.33 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20356. 1091.33 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20357. 1091.33 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20358. 1091.33 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20359. 1091.33 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20360. 1091.33 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20361. 1091.33 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20362. 1091.33 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20363. 1091.33 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20364. 1091.33 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20365. 1091.33 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20366. 1091.33 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20367. 1091.33 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20368. 1092.17 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20369. 1092.17 s [algebraic-graphs]
  20370. 1092.17 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  20371. 1092.27 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20372. 1092.27 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20373. 1092.27 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20374. 1092.27 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20375. 1092.27 s [algebraic-graphs]
  20376. 1092.27 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  20377. 1092.27 s [algebraic-graphs] OK: isEmpty empty == True
  20378. 1092.27 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20379. 1092.27 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20380. 1092.27 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20381. 1092.27 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20382. 1092.27 s [algebraic-graphs]
  20383. 1092.27 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  20384. 1092.27 s [algebraic-graphs] OK: hasVertex x empty == False
  20385. 1092.27 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20386. 1092.27 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20387. 1092.27 s [algebraic-graphs]
  20388. 1092.27 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  20389. 1092.27 s [algebraic-graphs] OK: hasEdge x y empty == False
  20390. 1092.27 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20391. 1092.27 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20392. 1092.27 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20393. 1092.27 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20394. 1092.27 s [algebraic-graphs]
  20395. 1092.27 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20396. 1092.27 s [algebraic-graphs] OK: vertexCount empty == 0
  20397. 1092.27 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20398. 1092.27 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20399. 1092.27 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20400. 1092.27 s [algebraic-graphs]
  20401. 1092.27 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20402. 1092.27 s [algebraic-graphs] OK: edgeCount empty == 0
  20403. 1092.27 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20404. 1092.27 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20405. 1092.27 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20406. 1092.27 s [algebraic-graphs]
  20407. 1092.27 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20408. 1092.27 s [algebraic-graphs] OK: vertexList empty == []
  20409. 1092.27 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20410. 1092.27 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20411. 1092.27 s [algebraic-graphs]
  20412. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20413. 1092.28 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20414. 1092.28 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20415. 1092.28 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20416. 1092.28 s [algebraic-graphs]
  20417. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20418. 1092.28 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20419. 1092.28 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20420. 1092.28 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20421. 1092.28 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20422. 1092.28 s [algebraic-graphs]
  20423. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20424. 1092.28 s [algebraic-graphs] OK: edgeList empty == []
  20425. 1092.28 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20426. 1092.28 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20427. 1092.28 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20428. 1092.28 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20429. 1092.28 s [algebraic-graphs]
  20430. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20431. 1092.28 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20432. 1092.28 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20433. 1092.28 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20434. 1092.28 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20435. 1092.28 s [algebraic-graphs]
  20436. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20437. 1092.28 s [algebraic-graphs] OK: adjacencyList empty == []
  20438. 1092.28 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20439. 1092.28 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20440. 1092.28 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20441. 1092.28 s [algebraic-graphs]
  20442. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20443. 1092.28 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20444. 1092.28 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20445. 1092.28 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20446. 1092.28 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20447. 1092.28 s [algebraic-graphs]
  20448. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20449. 1092.28 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20450. 1092.28 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20451. 1092.28 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20452. 1092.28 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20453. 1092.28 s [algebraic-graphs]
  20454. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20455. 1092.28 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20456. 1092.28 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20457. 1092.28 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20458. 1092.28 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20459. 1092.28 s [algebraic-graphs]
  20460. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20461. 1092.28 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20462. 1092.28 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20463. 1092.28 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20464. 1092.28 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20465. 1092.28 s [algebraic-graphs]
  20466. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20467. 1092.28 s [algebraic-graphs] OK: path [] == empty
  20468. 1092.28 s [algebraic-graphs] OK: path [x] == vertex x
  20469. 1092.28 s [algebraic-graphs] OK: path [x,y] == edge x y
  20470. 1092.28 s [algebraic-graphs]
  20471. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20472. 1092.28 s [algebraic-graphs] OK: circuit [] == empty
  20473. 1092.28 s [algebraic-graphs] OK: circuit [x] == edge x x
  20474. 1092.28 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20475. 1092.28 s [algebraic-graphs]
  20476. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20477. 1092.28 s [algebraic-graphs] OK: clique [] == empty
  20478. 1092.28 s [algebraic-graphs] OK: clique [x] == vertex x
  20479. 1092.28 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20480. 1092.28 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20481. 1092.28 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20482. 1092.28 s [algebraic-graphs]
  20483. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20484. 1092.28 s [algebraic-graphs] OK: biclique [] [] == empty
  20485. 1092.28 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20486. 1092.28 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20487. 1092.28 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20488. 1092.28 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20489. 1092.28 s [algebraic-graphs]
  20490. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20491. 1092.28 s [algebraic-graphs] OK: star x [] == vertex x
  20492. 1092.28 s [algebraic-graphs] OK: star x [y] == edge x y
  20493. 1092.28 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20494. 1092.28 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20495. 1092.28 s [algebraic-graphs]
  20496. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20497. 1092.28 s [algebraic-graphs] OK: stars [] == empty
  20498. 1092.28 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20499. 1092.28 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20500. 1092.28 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20501. 1092.28 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20502. 1092.28 s [algebraic-graphs] OK: stars . adjacencyList == id
  20503. 1092.28 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20504. 1092.28 s [algebraic-graphs]
  20505. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20506. 1092.28 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20507. 1092.28 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20508. 1092.28 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20509. 1092.28 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20510. 1092.28 s [algebraic-graphs]
  20511. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20512. 1092.28 s [algebraic-graphs] OK: forest [] == empty
  20513. 1092.28 s [algebraic-graphs] OK: forest [x] == tree x
  20514. 1092.28 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20515. 1092.28 s [algebraic-graphs] OK: forest == overlays . map tree
  20516. 1092.28 s [algebraic-graphs]
  20517. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20518. 1092.28 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20519. 1092.28 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20520. 1092.28 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20521. 1092.28 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20522. 1092.28 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20523. 1092.28 s [algebraic-graphs]
  20524. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20525. 1092.28 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20526. 1092.28 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20527. 1092.28 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20528. 1092.28 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20529. 1092.28 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20530. 1092.28 s [algebraic-graphs]
  20531. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20532. 1092.28 s [algebraic-graphs] OK: replaceVertex x x == id
  20533. 1092.28 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20534. 1092.28 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20535. 1092.28 s [algebraic-graphs]
  20536. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20537. 1092.28 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20538. 1092.28 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20539. 1092.28 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20540. 1092.28 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20541. 1092.28 s [algebraic-graphs]
  20542. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20543. 1092.28 s [algebraic-graphs] OK: transpose empty == empty
  20544. 1092.28 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20545. 1092.28 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20546. 1092.28 s [algebraic-graphs] OK: transpose . transpose == id
  20547. 1092.28 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20548. 1092.28 s [algebraic-graphs]
  20549. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20550. 1092.28 s [algebraic-graphs] OK: gmap f empty == empty
  20551. 1092.28 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20552. 1092.28 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20553. 1092.28 s [algebraic-graphs] OK: gmap id == id
  20554. 1092.28 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20555. 1092.28 s [algebraic-graphs]
  20556. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20557. 1092.28 s [algebraic-graphs] OK: induce (const True ) x == x
  20558. 1092.28 s [algebraic-graphs] OK: induce (const False) x == empty
  20559. 1092.28 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20560. 1092.28 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20561. 1092.28 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20562. 1092.28 s [algebraic-graphs]
  20563. 1092.28 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20564. 1092.28 s [algebraic-graphs] OK: compose empty x == empty
  20565. 1092.28 s [algebraic-graphs] OK: compose x empty == empty
  20566. 1092.28 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20567. 1092.28 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20568. 1092.28 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20569. 1092.28 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20570. 1092.45 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20571. 1092.45 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20572. 1092.45 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20573. 1092.45 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20574. 1092.45 s [algebraic-graphs]
  20575. 1092.45 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20576. 1092.45 s [algebraic-graphs] OK: closure empty == empty
  20577. 1092.45 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20578. 1092.45 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20579. 1092.45 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20580. 1092.45 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20581. 1092.45 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20582. 1092.45 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20583. 1092.45 s [algebraic-graphs] OK: closure . closure == closure
  20584. 1092.45 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20585. 1092.45 s [algebraic-graphs]
  20586. 1092.45 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20587. 1092.45 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20588. 1092.45 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20589. 1092.45 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20590. 1092.45 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20591. 1092.45 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20592. 1092.45 s [algebraic-graphs]
  20593. 1092.45 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20594. 1092.45 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20595. 1092.45 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20596. 1092.45 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20597. 1092.45 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20598. 1092.45 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20599. 1092.45 s [algebraic-graphs]
  20600. 1092.45 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20601. 1092.45 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20602. 1092.45 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20603. 1092.45 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20604. 1092.45 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20605. 1092.45 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20606. 1092.45 s [algebraic-graphs]
  20607. 1092.45 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20608. 1092.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20609. 1092.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20610. 1092.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20611. 1092.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20612. 1092.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20613. 1092.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20614. 1092.45 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20615. 1092.45 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20616. 1092.45 s [algebraic-graphs] OK: bfsForest x [] == []
  20617. 1092.45 s [algebraic-graphs] OK: bfsForest empty vs == []
  20618. 1092.45 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20619. 1092.45 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20620. 1092.45 s [algebraic-graphs]
  20621. 1092.45 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20622. 1092.45 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20623. 1092.45 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20624. 1092.45 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20625. 1092.45 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20626. 1092.45 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20627. 1092.45 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20628. 1092.45 s [algebraic-graphs] OK: bfs empty vs == []
  20629. 1092.45 s [algebraic-graphs] OK: bfs x [] == []
  20630. 1092.45 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20631. 1092.45 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20632. 1092.45 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20633. 1092.45 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20634. 1092.45 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20635. 1092.45 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20636. 1092.45 s [algebraic-graphs]
  20637. 1092.45 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20638. 1092.45 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20639. 1092.45 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20640. 1092.45 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20641. 1092.45 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20642. 1092.45 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20643. 1092.45 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20644. 1092.45 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20645. 1092.46 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20646. 1092.46 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20647. 1092.46 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20648. 1092.46 s [algebraic-graphs]
  20649. 1092.46 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20650. 1092.46 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20651. 1092.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20652. 1092.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20653. 1092.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20654. 1092.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20655. 1092.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20656. 1092.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20657. 1092.46 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20658. 1092.46 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20659. 1092.46 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20660. 1092.46 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20661. 1092.46 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20662. 1092.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20663. 1092.46 s [algebraic-graphs]
  20664. 1092.46 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20665. 1092.46 s [algebraic-graphs] OK: dfs empty vs == []
  20666. 1092.46 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20667. 1092.46 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20668. 1092.46 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20669. 1092.46 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20670. 1092.46 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20671. 1092.46 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20672. 1092.46 s [algebraic-graphs] OK: dfs x [] == []
  20673. 1092.46 s [algebraic-graphs]
  20674. 1092.46 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20675. 1092.46 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20676. 1092.46 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20677. 1092.46 s [algebraic-graphs]
  20678. 1092.46 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20679. 1092.46 s [algebraic-graphs] OK: reachable empty x == []
  20680. 1092.46 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20681. 1092.46 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20682. 1092.46 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20683. 1092.46 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20684. 1092.46 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20685. 1092.46 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20686. 1092.46 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20687. 1092.46 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20688. 1092.46 s [algebraic-graphs]
  20689. 1092.46 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20690. 1092.46 s [algebraic-graphs]
  20691. 1092.46 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20692. 1092.46 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20693. 1092.46 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20694. 1092.46 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20695. 1092.46 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20696. 1092.46 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20697. 1092.46 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20698. 1092.46 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20699. 1092.46 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20700. 1092.46 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20701. 1092.46 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20702. 1092.46 s [algebraic-graphs]
  20703. 1092.46 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20704. 1092.46 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20705. 1092.46 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20706. 1092.46 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20707. 1092.46 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20708. 1092.46 s [algebraic-graphs]
  20709. 1092.46 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20710. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20711. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20712. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20713. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20714. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20715. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20716. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20717. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20718. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20719. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20720. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20721. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20722. 1092.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20723. 1099.12 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20724. 1099.13 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20725. 1099.17 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20726. 1099.17 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20727. 1099.17 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20728. 1099.17 s [algebraic-graphs]
  20729. 1099.17 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20730. 1099.17 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20731. 1099.17 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20732. 1099.17 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20733. 1099.17 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20734. 1099.17 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20735. 1099.17 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20736. 1099.17 s [algebraic-graphs]
  20737. 1099.17 s [algebraic-graphs] ============ AdjacencyMap ============
  20738. 1099.17 s [algebraic-graphs] OK: Axioms of graphs
  20739. 1099.17 s [algebraic-graphs]
  20740. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20741. 1099.17 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20742. 1099.17 s [algebraic-graphs]
  20743. 1099.17 s [algebraic-graphs] OK: consistent empty == True
  20744. 1099.17 s [algebraic-graphs] OK: consistent (vertex x) == True
  20745. 1099.17 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20746. 1099.17 s [algebraic-graphs] OK: consistent (connect x y) == True
  20747. 1099.17 s [algebraic-graphs] OK: consistent (edge x y) == True
  20748. 1099.17 s [algebraic-graphs] OK: consistent (edges xs) == True
  20749. 1099.17 s [algebraic-graphs] OK: consistent (stars xs) == True
  20750. 1099.17 s [algebraic-graphs]
  20751. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20752. 1099.17 s [algebraic-graphs] OK: show (empty ) == "empty"
  20753. 1099.17 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20754. 1099.17 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20755. 1099.17 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20756. 1099.17 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20757. 1099.17 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20758. 1099.17 s [algebraic-graphs]
  20759. 1099.17 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20760. 1099.17 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20761. 1099.17 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20762. 1099.17 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20763. 1099.17 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20764. 1099.17 s [algebraic-graphs]
  20765. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20766. 1099.17 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20767. 1099.17 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20768. 1099.17 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20769. 1099.17 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20770. 1099.17 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20771. 1099.17 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20772. 1099.17 s [algebraic-graphs] OK: x <= x + y
  20773. 1099.17 s [algebraic-graphs] OK: x + y <= x * y
  20774. 1099.17 s [algebraic-graphs]
  20775. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20776. 1099.17 s [algebraic-graphs] OK: isEmpty empty == True
  20777. 1099.17 s [algebraic-graphs] OK: hasVertex x empty == False
  20778. 1099.17 s [algebraic-graphs] OK: vertexCount empty == 0
  20779. 1099.17 s [algebraic-graphs] OK: edgeCount empty == 0
  20780. 1099.17 s [algebraic-graphs]
  20781. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20782. 1099.17 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20783. 1099.17 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20784. 1099.17 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20785. 1099.17 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20786. 1099.17 s [algebraic-graphs]
  20787. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20788. 1099.17 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20789. 1099.17 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20790. 1099.17 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20791. 1099.17 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20792. 1099.17 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20793. 1099.17 s [algebraic-graphs]
  20794. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20795. 1099.17 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20796. 1099.17 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20797. 1099.17 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20798. 1099.17 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20799. 1099.17 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20800. 1099.17 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20801. 1099.17 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20802. 1099.17 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20803. 1099.17 s [algebraic-graphs]
  20804. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20805. 1099.17 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20806. 1099.17 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20807. 1099.17 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20808. 1099.17 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20809. 1099.17 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20810. 1099.17 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20811. 1099.17 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20812. 1099.17 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20813. 1099.17 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20814. 1099.17 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20815. 1099.17 s [algebraic-graphs]
  20816. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20817. 1099.17 s [algebraic-graphs] OK: vertices [] == empty
  20818. 1099.17 s [algebraic-graphs] OK: vertices [x] == vertex x
  20819. 1099.17 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20820. 1099.17 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20821. 1099.17 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20822. 1099.17 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20823. 1099.17 s [algebraic-graphs]
  20824. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20825. 1099.17 s [algebraic-graphs] OK: edges [] == empty
  20826. 1099.17 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20827. 1099.17 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20828. 1099.17 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20829. 1099.17 s [algebraic-graphs]
  20830. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20831. 1099.17 s [algebraic-graphs] OK: overlays [] == empty
  20832. 1099.17 s [algebraic-graphs] OK: overlays [x] == x
  20833. 1099.17 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20834. 1099.17 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20835. 1099.17 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20836. 1099.17 s [algebraic-graphs]
  20837. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20838. 1099.17 s [algebraic-graphs] OK: connects [] == empty
  20839. 1099.17 s [algebraic-graphs] OK: connects [x] == x
  20840. 1099.17 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20841. 1099.17 s [algebraic-graphs] OK: connects == foldr connect empty
  20842. 1099.17 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20843. 1099.17 s [algebraic-graphs]
  20844. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20845. 1099.17 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20846. 1099.17 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20847. 1099.17 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20848. 1099.17 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20849. 1099.17 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20850. 1099.17 s [algebraic-graphs]
  20851. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20852. 1099.17 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20853. 1099.17 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20854. 1099.17 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20855. 1099.17 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20856. 1099.17 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20857. 1099.17 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20858. 1099.17 s [algebraic-graphs]
  20859. 1099.17 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20860. 1099.17 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20861. 1099.17 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20862. 1099.17 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20863. 1099.17 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20864. 1099.17 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20865. 1099.17 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20866. 1099.17 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20867. 1099.17 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20868. 1099.17 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20869. 1099.17 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20870. 1099.17 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20871. 1099.17 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20872. 1099.17 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20873. 1099.17 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20874. 1099.17 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20875. 1099.17 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20876. 1099.17 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20877. 1099.17 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20878. 1099.17 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20879. 1099.17 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20880. 1099.17 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20881. 1099.17 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20882. 1099.17 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20883. 1099.17 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20884. 1099.17 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20885. 1099.17 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20886. 1099.17 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20887. 1099.17 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20888. 1099.17 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20889. 1099.17 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20890. 1099.17 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20891. 1099.17 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20892. 1099.17 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20893. 1101.04 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20894. 1101.04 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20895. 1101.04 s [algebraic-graphs]
  20896. 1101.04 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20897. 1101.04 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20898. 1101.04 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20899. 1101.04 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20900. 1101.04 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20901. 1101.04 s [algebraic-graphs]
  20902. 1101.04 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20903. 1101.04 s [algebraic-graphs] OK: isEmpty empty == True
  20904. 1101.04 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20905. 1101.05 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20906. 1101.05 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20907. 1101.05 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20908. 1101.05 s [algebraic-graphs]
  20909. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20910. 1101.05 s [algebraic-graphs] OK: hasVertex x empty == False
  20911. 1101.05 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20912. 1101.05 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20913. 1101.05 s [algebraic-graphs]
  20914. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20915. 1101.05 s [algebraic-graphs] OK: hasEdge x y empty == False
  20916. 1101.05 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20917. 1101.05 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20918. 1101.05 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20919. 1101.05 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20920. 1101.05 s [algebraic-graphs]
  20921. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20922. 1101.05 s [algebraic-graphs] OK: vertexCount empty == 0
  20923. 1101.05 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20924. 1101.05 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20925. 1101.05 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20926. 1101.05 s [algebraic-graphs]
  20927. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20928. 1101.05 s [algebraic-graphs] OK: edgeCount empty == 0
  20929. 1101.05 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20930. 1101.05 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20931. 1101.05 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20932. 1101.05 s [algebraic-graphs]
  20933. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20934. 1101.05 s [algebraic-graphs] OK: vertexList empty == []
  20935. 1101.05 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20936. 1101.05 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20937. 1101.05 s [algebraic-graphs]
  20938. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20939. 1101.05 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20940. 1101.05 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20941. 1101.05 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20942. 1101.05 s [algebraic-graphs]
  20943. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20944. 1101.05 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20945. 1101.05 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20946. 1101.05 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20947. 1101.05 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20948. 1101.05 s [algebraic-graphs]
  20949. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20950. 1101.05 s [algebraic-graphs] OK: edgeList empty == []
  20951. 1101.05 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20952. 1101.05 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20953. 1101.05 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20954. 1101.05 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20955. 1101.05 s [algebraic-graphs]
  20956. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20957. 1101.05 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20958. 1101.05 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20959. 1101.05 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20960. 1101.05 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20961. 1101.05 s [algebraic-graphs]
  20962. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20963. 1101.05 s [algebraic-graphs] OK: adjacencyList empty == []
  20964. 1101.05 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20965. 1101.05 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20966. 1101.05 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20967. 1101.05 s [algebraic-graphs]
  20968. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20969. 1101.05 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20970. 1101.05 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20971. 1101.05 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20972. 1101.05 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20973. 1101.05 s [algebraic-graphs]
  20974. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20975. 1101.05 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20976. 1101.05 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20977. 1101.05 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20978. 1101.05 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20979. 1101.05 s [algebraic-graphs]
  20980. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20981. 1101.05 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20982. 1101.05 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20983. 1101.05 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20984. 1101.05 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20985. 1101.05 s [algebraic-graphs]
  20986. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20987. 1101.05 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20988. 1101.05 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20989. 1101.05 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20990. 1101.05 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20991. 1101.05 s [algebraic-graphs]
  20992. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20993. 1101.05 s [algebraic-graphs] OK: path [] == empty
  20994. 1101.05 s [algebraic-graphs] OK: path [x] == vertex x
  20995. 1101.05 s [algebraic-graphs] OK: path [x,y] == edge x y
  20996. 1101.05 s [algebraic-graphs]
  20997. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20998. 1101.05 s [algebraic-graphs] OK: circuit [] == empty
  20999. 1101.05 s [algebraic-graphs] OK: circuit [x] == edge x x
  21000. 1101.05 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21001. 1101.05 s [algebraic-graphs]
  21002. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  21003. 1101.05 s [algebraic-graphs] OK: clique [] == empty
  21004. 1101.05 s [algebraic-graphs] OK: clique [x] == vertex x
  21005. 1101.05 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21006. 1101.05 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21007. 1101.05 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21008. 1101.05 s [algebraic-graphs]
  21009. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  21010. 1101.05 s [algebraic-graphs] OK: biclique [] [] == empty
  21011. 1101.05 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21012. 1101.05 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21013. 1101.05 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21014. 1101.05 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21015. 1101.05 s [algebraic-graphs]
  21016. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.star ============
  21017. 1101.05 s [algebraic-graphs] OK: star x [] == vertex x
  21018. 1101.05 s [algebraic-graphs] OK: star x [y] == edge x y
  21019. 1101.05 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21020. 1101.05 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21021. 1101.05 s [algebraic-graphs]
  21022. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  21023. 1101.05 s [algebraic-graphs] OK: stars [] == empty
  21024. 1101.05 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21025. 1101.05 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21026. 1101.05 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21027. 1101.05 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21028. 1101.05 s [algebraic-graphs] OK: stars . adjacencyList == id
  21029. 1101.05 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21030. 1101.05 s [algebraic-graphs]
  21031. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  21032. 1101.05 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21033. 1101.05 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21034. 1101.05 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21035. 1101.05 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21036. 1101.05 s [algebraic-graphs]
  21037. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  21038. 1101.05 s [algebraic-graphs] OK: forest [] == empty
  21039. 1101.05 s [algebraic-graphs] OK: forest [x] == tree x
  21040. 1101.05 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21041. 1101.05 s [algebraic-graphs] OK: forest == overlays . map tree
  21042. 1101.05 s [algebraic-graphs]
  21043. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  21044. 1101.05 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21045. 1101.05 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21046. 1101.05 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21047. 1101.05 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21048. 1101.05 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21049. 1101.05 s [algebraic-graphs]
  21050. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  21051. 1101.05 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21052. 1101.05 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21053. 1101.05 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21054. 1101.05 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21055. 1101.05 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21056. 1101.05 s [algebraic-graphs]
  21057. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  21058. 1101.05 s [algebraic-graphs] OK: replaceVertex x x == id
  21059. 1101.05 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21060. 1101.05 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21061. 1101.05 s [algebraic-graphs]
  21062. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  21063. 1101.05 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21064. 1101.05 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21065. 1101.05 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21066. 1101.05 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21067. 1101.05 s [algebraic-graphs]
  21068. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  21069. 1101.05 s [algebraic-graphs] OK: transpose empty == empty
  21070. 1101.05 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21071. 1101.05 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21072. 1101.05 s [algebraic-graphs] OK: transpose . transpose == id
  21073. 1101.05 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21074. 1101.05 s [algebraic-graphs]
  21075. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  21076. 1101.05 s [algebraic-graphs] OK: gmap f empty == empty
  21077. 1101.05 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21078. 1101.05 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21079. 1101.05 s [algebraic-graphs] OK: gmap id == id
  21080. 1101.05 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21081. 1101.05 s [algebraic-graphs]
  21082. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  21083. 1101.05 s [algebraic-graphs] OK: induce (const True ) x == x
  21084. 1101.05 s [algebraic-graphs] OK: induce (const False) x == empty
  21085. 1101.05 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21086. 1101.05 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21087. 1101.05 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21088. 1101.05 s [algebraic-graphs]
  21089. 1101.05 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  21090. 1101.05 s [algebraic-graphs] OK: compose empty x == empty
  21091. 1101.05 s [algebraic-graphs] OK: compose x empty == empty
  21092. 1101.05 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21093. 1101.05 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21094. 1101.05 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21095. 1101.05 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21096. 1104.73 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21097. 1104.73 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21098. 1104.82 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21099. 1104.82 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21100. 1104.83 s [algebraic-graphs]
  21101. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  21102. 1104.83 s [algebraic-graphs] OK: closure empty == empty
  21103. 1104.83 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  21104. 1104.83 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  21105. 1104.83 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21106. 1104.83 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  21107. 1104.83 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  21108. 1104.83 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  21109. 1104.83 s [algebraic-graphs] OK: closure . closure == closure
  21110. 1104.83 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  21111. 1104.83 s [algebraic-graphs]
  21112. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  21113. 1104.83 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  21114. 1104.83 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  21115. 1104.83 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  21116. 1104.83 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21117. 1104.83 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  21118. 1104.83 s [algebraic-graphs]
  21119. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  21120. 1104.83 s [algebraic-graphs] OK: symmetricClosure empty == empty
  21121. 1104.83 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  21122. 1104.83 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  21123. 1104.83 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  21124. 1104.83 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  21125. 1104.83 s [algebraic-graphs]
  21126. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  21127. 1104.83 s [algebraic-graphs] OK: transitiveClosure empty == empty
  21128. 1104.83 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  21129. 1104.83 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  21130. 1104.83 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  21131. 1104.83 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  21132. 1104.83 s [algebraic-graphs]
  21133. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.box ============
  21134. 1104.83 s [algebraic-graphs] OK: box x y ~~ box y x
  21135. 1104.83 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21136. 1104.83 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21137. 1104.83 s [algebraic-graphs] OK: box x empty ~~ empty
  21138. 1104.83 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21139. 1104.83 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21140. 1104.83 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21141. 1104.83 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21142. 1104.83 s [algebraic-graphs]
  21143. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  21144. 1104.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  21145. 1104.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  21146. 1104.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  21147. 1104.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  21148. 1104.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  21149. 1104.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  21150. 1104.83 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  21151. 1104.83 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  21152. 1104.83 s [algebraic-graphs] OK: bfsForest x [] == []
  21153. 1104.83 s [algebraic-graphs] OK: bfsForest empty vs == []
  21154. 1104.83 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21155. 1104.83 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  21156. 1104.83 s [algebraic-graphs]
  21157. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  21158. 1104.83 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  21159. 1104.83 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  21160. 1104.83 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  21161. 1104.83 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  21162. 1104.83 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  21163. 1104.83 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  21164. 1104.83 s [algebraic-graphs] OK: bfs empty vs == []
  21165. 1104.83 s [algebraic-graphs] OK: bfs x [] == []
  21166. 1104.83 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  21167. 1104.83 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  21168. 1104.83 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  21169. 1104.83 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  21170. 1104.83 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  21171. 1104.83 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  21172. 1104.83 s [algebraic-graphs]
  21173. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  21174. 1104.83 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  21175. 1104.83 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  21176. 1104.83 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  21177. 1104.83 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  21178. 1104.83 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  21179. 1104.83 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  21180. 1104.83 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  21181. 1104.83 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  21182. 1104.83 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  21183. 1104.83 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  21184. 1104.83 s [algebraic-graphs]
  21185. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  21186. 1104.83 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  21187. 1104.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  21188. 1104.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  21189. 1104.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  21190. 1104.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  21191. 1104.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  21192. 1104.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  21193. 1104.83 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  21194. 1104.83 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  21195. 1104.83 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  21196. 1104.83 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  21197. 1104.83 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21198. 1104.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  21199. 1104.83 s [algebraic-graphs]
  21200. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21201. 1104.83 s [algebraic-graphs] OK: dfs empty vs == []
  21202. 1104.83 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  21203. 1104.83 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  21204. 1104.83 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  21205. 1104.83 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  21206. 1104.83 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  21207. 1104.83 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  21208. 1104.83 s [algebraic-graphs] OK: dfs x [] == []
  21209. 1104.83 s [algebraic-graphs]
  21210. 1104.83 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  21211. 1104.83 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  21212. 1104.83 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  21213. 1104.83 s [algebraic-graphs]
  21214. 1104.83 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21215. 1104.83 s [algebraic-graphs] OK: reachable empty x == []
  21216. 1104.83 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  21217. 1104.83 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  21218. 1104.83 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  21219. 1104.83 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  21220. 1104.83 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  21221. 1104.83 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  21222. 1104.83 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  21223. 1104.83 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  21224. 1104.84 s [algebraic-graphs]
  21225. 1104.84 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  21226. 1104.84 s [algebraic-graphs]
  21227. 1104.84 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  21228. 1104.84 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  21229. 1104.84 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  21230. 1104.84 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  21231. 1104.84 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  21232. 1104.84 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  21233. 1104.84 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  21234. 1104.84 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  21235. 1104.84 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  21236. 1104.84 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  21237. 1104.84 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  21238. 1104.84 s [algebraic-graphs]
  21239. 1104.84 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  21240. 1104.84 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  21241. 1104.84 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  21242. 1104.84 s [algebraic-graphs] OK: isAcyclic . circuit == null
  21243. 1104.84 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  21244. 1104.84 s [algebraic-graphs]
  21245. 1104.84 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  21246. 1104.84 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  21247. 1104.84 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  21248. 1104.84 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  21249. 1104.84 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  21250. 1104.84 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  21251. 1104.84 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  21252. 1104.84 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  21253. 1112.86 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  21254. 1112.86 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  21255. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  21256. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  21257. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  21258. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  21259. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  21260. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  21261. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  21262. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  21263. 1112.90 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  21264. 1112.90 s [algebraic-graphs]
  21265. 1112.90 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  21266. 1112.90 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  21267. 1112.90 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  21268. 1112.90 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  21269. 1112.90 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  21270. 1112.90 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  21271. 1112.90 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  21272. 1112.90 s [algebraic-graphs]
  21273. 1112.90 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  21274. 1112.90 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21275. 1112.90 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21276. 1112.90 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21277. 1112.90 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21278. 1112.90 s [algebraic-graphs]
  21279. 1112.90 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  21280. 1112.90 s [algebraic-graphs] OK: scc empty == empty
  21281. 1112.90 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  21282. 1112.90 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  21283. 1112.90 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  21284. 1112.90 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  21285. 1112.90 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  21286. 1112.90 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  21287. 1112.90 s [algebraic-graphs] OK: isAcyclic . scc == const True
  21288. 1112.90 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  21289. 1112.90 s [algebraic-graphs] OK: scc g == KL.scc g
  21290. 1112.90 s [algebraic-graphs]
  21291. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  21292. 1112.90 s [algebraic-graphs] OK: 0 == rightVertex 0
  21293. 1112.90 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  21294. 1112.90 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  21295. 1112.90 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  21296. 1112.90 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  21297. 1112.90 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  21298. 1112.90 s [algebraic-graphs]
  21299. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  21300. 1112.90 s [algebraic-graphs] OK: show empty == "empty"
  21301. 1112.90 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  21302. 1112.90 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  21303. 1112.90 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  21304. 1112.90 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  21305. 1112.90 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  21306. 1112.90 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  21307. 1112.90 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  21308. 1112.90 s [algebraic-graphs]
  21309. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  21310. 1112.90 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  21311. 1112.90 s [algebraic-graphs]
  21312. 1112.90 s [algebraic-graphs] OK: x + y == y + x
  21313. 1112.90 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  21314. 1112.90 s [algebraic-graphs] OK: x * empty == x
  21315. 1112.90 s [algebraic-graphs] OK: empty * x == x
  21316. 1112.90 s [algebraic-graphs] OK: x * y == y * x
  21317. 1112.90 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  21318. 1112.90 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  21319. 1112.90 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  21320. 1112.90 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  21321. 1112.90 s [algebraic-graphs] OK: x + empty == x
  21322. 1112.90 s [algebraic-graphs] OK: empty + x == x
  21323. 1112.90 s [algebraic-graphs] OK: x + x == x
  21324. 1112.90 s [algebraic-graphs] OK: x * y + x + y == x * y
  21325. 1112.90 s [algebraic-graphs] OK: x * x * x == x * x
  21326. 1112.90 s [algebraic-graphs]
  21327. 1112.90 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  21328. 1112.90 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  21329. 1112.90 s [algebraic-graphs]
  21330. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  21331. 1112.90 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21332. 1112.90 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21333. 1112.90 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21334. 1112.90 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21335. 1112.90 s [algebraic-graphs]
  21336. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  21337. 1112.90 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21338. 1112.90 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21339. 1112.90 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21340. 1112.90 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21341. 1112.90 s [algebraic-graphs]
  21342. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  21343. 1112.90 s [algebraic-graphs] OK: isEmpty empty == True
  21344. 1112.90 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21345. 1112.90 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21346. 1112.90 s [algebraic-graphs] OK: hasVertex x empty == False
  21347. 1112.90 s [algebraic-graphs]
  21348. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  21349. 1112.90 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21350. 1112.90 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21351. 1112.90 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21352. 1112.90 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21353. 1112.90 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  21354. 1112.90 s [algebraic-graphs]
  21355. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  21356. 1112.90 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21357. 1112.90 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21358. 1112.90 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21359. 1112.90 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21360. 1112.90 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  21361. 1112.90 s [algebraic-graphs]
  21362. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  21363. 1112.90 s [algebraic-graphs] OK: vertex . Left == leftVertex
  21364. 1112.90 s [algebraic-graphs] OK: vertex . Right == rightVertex
  21365. 1112.90 s [algebraic-graphs]
  21366. 1112.90 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  21367. 1112.90 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  21368. 1112.90 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21369. 1112.90 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21370. 1112.90 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21371. 1112.90 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  21372. 1112.91 s [algebraic-graphs]
  21373. 1112.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  21374. 1112.91 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21375. 1112.91 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21376. 1112.91 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21377. 1112.91 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21378. 1112.91 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21379. 1112.91 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21380. 1112.91 s [algebraic-graphs]
  21381. 1112.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  21382. 1112.91 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  21383. 1112.91 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  21384. 1112.91 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  21385. 1112.91 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  21386. 1112.91 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  21387. 1112.91 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21388. 1112.91 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21389. 1112.91 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21390. 1112.91 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21391. 1112.91 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21392. 1112.91 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  21393. 1112.91 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  21394. 1112.91 s [algebraic-graphs]
  21395. 1112.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21396. 1112.91 s [algebraic-graphs] OK: vertices [] [] == empty
  21397. 1112.91 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21398. 1112.91 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21399. 1112.91 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21400. 1112.91 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21401. 1112.91 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21402. 1112.91 s [algebraic-graphs]
  21403. 1112.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21404. 1112.91 s [algebraic-graphs] OK: edges [] == empty
  21405. 1112.91 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21406. 1112.91 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21407. 1112.91 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21408. 1112.91 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21409. 1112.91 s [algebraic-graphs]
  21410. 1112.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21411. 1112.91 s [algebraic-graphs] OK: overlays [] == empty
  21412. 1112.91 s [algebraic-graphs] OK: overlays [x] == x
  21413. 1112.91 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21414. 1112.91 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21415. 1112.91 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21416. 1112.91 s [algebraic-graphs]
  21417. 1112.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21418. 1112.91 s [algebraic-graphs] OK: connects [] == empty
  21419. 1112.91 s [algebraic-graphs] OK: connects [x] == x
  21420. 1112.91 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21421. 1112.91 s [algebraic-graphs] OK: connects == foldr connect empty
  21422. 1112.91 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21423. 1112.91 s [algebraic-graphs]
  21424. 1112.91 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21425. 1114.35 s [algebraic-graphs] OK: swap empty == empty
  21426. 1114.35 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21427. 1114.35 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21428. 1114.35 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21429. 1114.35 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21430. 1114.35 s [algebraic-graphs] OK: swap . swap == id
  21431. 1114.35 s [algebraic-graphs]
  21432. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21433. 1114.35 s [algebraic-graphs] OK: toBipartite empty == empty
  21434. 1114.35 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21435. 1114.35 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21436. 1114.35 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21437. 1114.35 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21438. 1114.35 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21439. 1114.35 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21440. 1114.35 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21441. 1114.35 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21442. 1114.35 s [algebraic-graphs]
  21443. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21444. 1114.35 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21445. 1114.35 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21446. 1114.35 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21447. 1114.35 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21448. 1114.35 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21449. 1114.35 s [algebraic-graphs]
  21450. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21451. 1114.35 s [algebraic-graphs] OK: fromBipartite empty == empty
  21452. 1114.35 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21453. 1114.35 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21454. 1114.35 s [algebraic-graphs]
  21455. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21456. 1114.35 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21457. 1114.35 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21458. 1114.35 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21459. 1114.35 s [algebraic-graphs]
  21460. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21461. 1114.35 s [algebraic-graphs] OK: isEmpty empty == True
  21462. 1114.35 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21463. 1114.35 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21464. 1114.35 s [algebraic-graphs] OK: isEmpty == (==) empty
  21465. 1114.35 s [algebraic-graphs]
  21466. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21467. 1114.35 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21468. 1114.35 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21469. 1114.35 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21470. 1114.35 s [algebraic-graphs]
  21471. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21472. 1114.35 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21473. 1114.35 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21474. 1114.35 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21475. 1114.35 s [algebraic-graphs]
  21476. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21477. 1114.35 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21478. 1114.35 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21479. 1114.35 s [algebraic-graphs]
  21480. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21481. 1114.35 s [algebraic-graphs] OK: hasEdge x y empty == False
  21482. 1114.35 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21483. 1114.35 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21484. 1114.35 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21485. 1114.35 s [algebraic-graphs]
  21486. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21487. 1114.35 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21488. 1114.35 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21489. 1114.35 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21490. 1114.35 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21491. 1114.35 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21492. 1114.35 s [algebraic-graphs]
  21493. 1114.35 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21494. 1114.35 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21495. 1114.35 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21496. 1114.38 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21497. 1114.38 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21498. 1114.38 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21499. 1114.38 s [algebraic-graphs]
  21500. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21501. 1114.38 s [algebraic-graphs] OK: vertexCount empty == 0
  21502. 1114.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21503. 1114.38 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21504. 1114.38 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21505. 1114.38 s [algebraic-graphs]
  21506. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21507. 1114.38 s [algebraic-graphs] OK: edgeCount empty == 0
  21508. 1114.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21509. 1114.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21510. 1114.38 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21511. 1114.38 s [algebraic-graphs]
  21512. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21513. 1114.38 s [algebraic-graphs] OK: leftVertexList empty == []
  21514. 1114.38 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21515. 1114.38 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21516. 1114.38 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21517. 1114.38 s [algebraic-graphs]
  21518. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21519. 1114.38 s [algebraic-graphs] OK: rightVertexList empty == []
  21520. 1114.38 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21521. 1114.38 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21522. 1114.38 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21523. 1114.38 s [algebraic-graphs]
  21524. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21525. 1114.38 s [algebraic-graphs] OK: vertexList empty == []
  21526. 1114.38 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21527. 1114.38 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21528. 1114.38 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21529. 1114.38 s [algebraic-graphs]
  21530. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21531. 1114.38 s [algebraic-graphs] OK: edgeList empty == []
  21532. 1114.38 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21533. 1114.38 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21534. 1114.38 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21535. 1114.38 s [algebraic-graphs]
  21536. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21537. 1114.38 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21538. 1114.38 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21539. 1114.38 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21540. 1114.38 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21541. 1114.38 s [algebraic-graphs]
  21542. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21543. 1114.38 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21544. 1114.38 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21545. 1114.38 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21546. 1114.38 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21547. 1114.38 s [algebraic-graphs]
  21548. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21549. 1114.38 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21550. 1114.38 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21551. 1114.38 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21552. 1114.38 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21553. 1114.38 s [algebraic-graphs]
  21554. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21555. 1114.38 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21556. 1114.38 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21557. 1114.38 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21558. 1114.38 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21559. 1114.38 s [algebraic-graphs]
  21560. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21561. 1114.38 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21562. 1114.38 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21563. 1114.38 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21564. 1114.38 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21565. 1114.38 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21566. 1114.38 s [algebraic-graphs]
  21567. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21568. 1114.38 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21569. 1114.38 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21570. 1114.38 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21571. 1114.38 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21572. 1114.38 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21573. 1114.38 s [algebraic-graphs]
  21574. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21575. 1114.38 s [algebraic-graphs] OK: evenList [] == Nil
  21576. 1114.38 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21577. 1114.38 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21578. 1114.38 s [algebraic-graphs]
  21579. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21580. 1114.38 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21581. 1114.38 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21582. 1114.38 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21583. 1114.38 s [algebraic-graphs]
  21584. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21585. 1114.38 s [algebraic-graphs] OK: path Nil == empty
  21586. 1114.38 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21587. 1114.38 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21588. 1114.38 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21589. 1114.38 s [algebraic-graphs]
  21590. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21591. 1114.38 s [algebraic-graphs] OK: circuit [] == empty
  21592. 1114.38 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21593. 1114.38 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21594. 1114.38 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21595. 1114.38 s [algebraic-graphs]
  21596. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21597. 1114.38 s [algebraic-graphs] OK: biclique [] [] == empty
  21598. 1114.38 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21599. 1114.38 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21600. 1114.38 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21601. 1114.38 s [algebraic-graphs]
  21602. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21603. 1114.38 s [algebraic-graphs] OK: star x [] == leftVertex x
  21604. 1114.38 s [algebraic-graphs] OK: star x [y] == edge x y
  21605. 1114.38 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21606. 1114.38 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21607. 1114.38 s [algebraic-graphs]
  21608. 1114.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21609. 1114.38 s [algebraic-graphs] OK: stars [] == empty
  21610. 1114.38 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21611. 1114.38 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21612. 1114.38 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21613. 1143.38 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21614. 1143.41 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21615. 1143.41 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21616. 1143.41 s [algebraic-graphs]
  21617. 1143.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21618. 1143.41 s [algebraic-graphs] OK: mesh xs [] == empty
  21619. 1143.41 s [algebraic-graphs] OK: mesh [] ys == empty
  21620. 1143.41 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21621. 1143.41 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21622. 1143.41 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21623. 1143.41 s [algebraic-graphs]
  21624. 1143.41 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21625. 1143.41 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21626. 1143.41 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21627. 1143.41 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21628. 1143.41 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21629. 1143.42 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21630. 1143.42 s [algebraic-graphs]
  21631. 1143.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21632. 1143.42 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21633. 1143.42 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21634. 1143.42 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21635. 1143.42 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21636. 1143.42 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21637. 1143.42 s [algebraic-graphs]
  21638. 1143.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21639. 1143.42 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21640. 1143.42 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21641. 1143.42 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21642. 1143.42 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21643. 1143.42 s [algebraic-graphs]
  21644. 1143.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21645. 1143.42 s [algebraic-graphs] OK: bimap f g empty == empty
  21646. 1143.42 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21647. 1143.42 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21648. 1143.42 s [algebraic-graphs] OK: bimap id id == id
  21649. 1143.42 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21650. 1143.42 s [algebraic-graphs]
  21651. 1143.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21652. 1143.42 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21653. 1143.42 s [algebraic-graphs]
  21654. 1143.42 s [algebraic-graphs] OK: box x y ~~ box y x
  21655. 1143.42 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21656. 1143.42 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21657. 1143.42 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21658. 1143.42 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21659. 1143.42 s [algebraic-graphs] OK: box x empty ~~ empty
  21660. 1143.42 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21661. 1143.42 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21662. 1143.42 s [algebraic-graphs]
  21663. 1143.42 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21664. 1143.42 s [algebraic-graphs]
  21665. 1143.42 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21666. 1143.43 s [algebraic-graphs] OK: consistent empty == True
  21667. 1143.43 s [algebraic-graphs] OK: consistent (vertex x) == True
  21668. 1143.43 s [algebraic-graphs] OK: consistent (edge x y) == True
  21669. 1143.43 s [algebraic-graphs] OK: consistent (edges x) == True
  21670. 1143.43 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21671. 1143.43 s [algebraic-graphs] OK: consistent (swap x) == True
  21672. 1143.43 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21673. 1143.43 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21674. 1143.43 s [algebraic-graphs]
  21675. 1143.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21676. 1143.43 s [algebraic-graphs] OK: detectParts empty == Right empty
  21677. 1143.43 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21678. 1143.43 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21679. 1143.43 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21680. 1143.43 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21681. 1143.43 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21682. 1143.43 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21683. 1143.43 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21684. 1143.43 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21685. 1143.43 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21686. 1143.43 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21687. 1143.43 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21688. 1143.43 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21689. 1143.43 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21690. 1143.43 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21691. 1143.43 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21692. 1143.43 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21693. 1143.43 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21694. 1143.43 s [algebraic-graphs]
  21695. 1143.43 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21696. 1143.43 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21697. 1143.43 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21698. 1143.43 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21699. 1143.43 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21700. 1143.43 s [algebraic-graphs]
  21701. 1143.43 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21702. 1143.43 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21703. 1143.43 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21704. 1143.43 s [algebraic-graphs]
  21705. 1143.43 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21706. 1143.43 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21707. 1143.43 s [algebraic-graphs]
  21708. 1143.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21709. 1143.43 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21710. 1143.43 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21711. 1143.43 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21712. 1143.43 s [algebraic-graphs]
  21713. 1143.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21714. 1143.43 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21715. 1143.43 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21716. 1143.43 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21717. 1143.43 s [algebraic-graphs]
  21718. 1143.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21719. 1143.43 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21720. 1143.43 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21721. 1143.43 s [algebraic-graphs]
  21722. 1143.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21723. 1143.43 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21724. 1143.43 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21725. 1143.43 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21726. 1143.43 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21727. 1143.43 s [algebraic-graphs]
  21728. 1143.43 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21729. 1143.43 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21730. 1143.43 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21731. 1143.43 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21732. 1143.43 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21733. 1143.43 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21734. 1143.44 s [algebraic-graphs]
  21735. 1143.44 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21736. 1143.44 s [algebraic-graphs] OK: maxMatching empty == matching []
  21737. 1143.44 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21738. 1143.44 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21739. 1143.44 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21740. 1143.44 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21741. 1143.44 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21742. 1143.44 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21743. 1143.44 s [algebraic-graphs]
  21744. 1143.44 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21745. 1143.44 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21746. 1143.44 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21747. 1143.44 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21748. 1143.44 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21749. 1143.44 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21750. 1143.44 s [algebraic-graphs]
  21751. 1143.44 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21752. 1143.44 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21753. 1147.98 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21754. 1147.98 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21755. 1147.98 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21756. 1147.98 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21757. 1147.98 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21758. 1147.98 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21759. 1147.98 s [algebraic-graphs]
  21760. 1147.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21761. 1147.98 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21762. 1147.98 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21763. 1147.98 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21764. 1147.98 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21765. 1147.98 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21766. 1147.98 s [algebraic-graphs]
  21767. 1147.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21768. 1147.98 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21769. 1147.98 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21770. 1147.98 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21771. 1147.98 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21772. 1147.98 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21773. 1147.98 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21774. 1147.98 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21775. 1147.98 s [algebraic-graphs]
  21776. 1147.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21777. 1147.98 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21778. 1147.98 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21779. 1147.98 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21780. 1147.98 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21781. 1147.98 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21782. 1147.98 s [algebraic-graphs]
  21783. 1147.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21784. 1147.98 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21785. 1147.98 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21786. 1147.98 s [algebraic-graphs]
  21787. 1147.98 s [algebraic-graphs] ============ Export.Eq ============
  21788. 1147.98 s [algebraic-graphs] OK: mempty /= literal ""
  21789. 1147.98 s [algebraic-graphs]
  21790. 1147.98 s [algebraic-graphs] ============ Export.Ord ============
  21791. 1147.98 s [algebraic-graphs] OK: mempty < literal ""
  21792. 1147.98 s [algebraic-graphs]
  21793. 1147.98 s [algebraic-graphs] ============ Export.isEmpty ============
  21794. 1147.98 s [algebraic-graphs] OK: isEmpty mempty == True
  21795. 1147.98 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21796. 1147.98 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21797. 1147.98 s [algebraic-graphs]
  21798. 1147.98 s [algebraic-graphs] ============ Export.literal ============
  21799. 1147.98 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21800. 1147.98 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21801. 1147.98 s [algebraic-graphs] OK: render . literal == id
  21802. 1147.98 s [algebraic-graphs]
  21803. 1147.98 s [algebraic-graphs] ============ Export.render ============
  21804. 1147.98 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21805. 1147.98 s [algebraic-graphs] OK: render mempty == mempty
  21806. 1147.98 s [algebraic-graphs]
  21807. 1147.98 s [algebraic-graphs] ============ Export.<+> ============
  21808. 1147.98 s [algebraic-graphs] OK: x <+> mempty == x
  21809. 1147.98 s [algebraic-graphs] OK: mempty <+> x == x
  21810. 1147.98 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21811. 1147.98 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21812. 1147.98 s [algebraic-graphs]
  21813. 1147.98 s [algebraic-graphs] ============ Export.brackets ============
  21814. 1147.98 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21815. 1147.98 s [algebraic-graphs] OK: brackets mempty == "[]"
  21816. 1147.98 s [algebraic-graphs]
  21817. 1147.98 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21818. 1147.98 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21819. 1147.98 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21820. 1147.98 s [algebraic-graphs]
  21821. 1147.98 s [algebraic-graphs] ============ Export.indent ============
  21822. 1147.98 s [algebraic-graphs] OK: indent 0 == id
  21823. 1147.98 s [algebraic-graphs] OK: indent 1 mempty == " "
  21824. 1147.98 s [algebraic-graphs]
  21825. 1147.98 s [algebraic-graphs] ============ Export.unlines ============
  21826. 1147.98 s [algebraic-graphs] OK: unlines [] == mempty
  21827. 1147.98 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21828. 1147.98 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21829. 1147.98 s [algebraic-graphs]
  21830. 1147.98 s [algebraic-graphs] ============ Export.export ============
  21831. 1147.98 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21832. 1147.98 s [algebraic-graphs]
  21833. 1147.98 s [algebraic-graphs] ============ Export.Dot.export ============
  21834. 1147.98 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21835. 1147.98 s [algebraic-graphs]
  21836. 1147.98 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21837. 1147.98 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21838. 1147.98 s [algebraic-graphs]
  21839. 1147.98 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21840. 1147.98 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21841. 1147.98 s [algebraic-graphs]
  21842. 1147.98 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21843. 1147.98 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21844. 1147.98 s [algebraic-graphs]
  21845. 1147.98 s [algebraic-graphs] ============ Graph ============
  21846. 1147.98 s [algebraic-graphs] OK: Axioms of graphs
  21847. 1147.98 s [algebraic-graphs] OK: Theorems of graphs
  21848. 1147.98 s [algebraic-graphs]
  21849. 1147.98 s [algebraic-graphs] ============ Graph.Ord ============
  21850. 1147.98 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21851. 1147.98 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21852. 1147.98 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21853. 1147.98 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21854. 1147.98 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21855. 1147.98 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21856. 1147.98 s [algebraic-graphs] OK: x <= x + y
  21857. 1147.98 s [algebraic-graphs] OK: x + y <= x * y
  21858. 1147.98 s [algebraic-graphs]
  21859. 1147.98 s [algebraic-graphs] ============ Graph.empty ============
  21860. 1147.98 s [algebraic-graphs] OK: isEmpty empty == True
  21861. 1147.98 s [algebraic-graphs] OK: hasVertex x empty == False
  21862. 1147.98 s [algebraic-graphs] OK: vertexCount empty == 0
  21863. 1147.98 s [algebraic-graphs] OK: edgeCount empty == 0
  21864. 1147.98 s [algebraic-graphs]
  21865. 1147.98 s [algebraic-graphs] ============ Graph.vertex ============
  21866. 1147.98 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21867. 1147.98 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21868. 1147.98 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21869. 1147.98 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21870. 1147.98 s [algebraic-graphs]
  21871. 1147.98 s [algebraic-graphs] ============ Graph.edge ============
  21872. 1147.98 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21873. 1147.98 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21874. 1147.98 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21875. 1147.98 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21876. 1147.98 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21877. 1147.98 s [algebraic-graphs]
  21878. 1147.98 s [algebraic-graphs] ============ Graph.overlay ============
  21879. 1147.98 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21880. 1147.98 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21881. 1147.98 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21882. 1147.98 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21883. 1147.98 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21884. 1147.98 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21885. 1147.98 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21886. 1147.98 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21887. 1147.98 s [algebraic-graphs]
  21888. 1147.98 s [algebraic-graphs] ============ Graph.connect ============
  21889. 1147.98 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21890. 1147.98 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21891. 1147.98 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21892. 1147.98 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21893. 1147.98 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21894. 1147.98 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21895. 1147.98 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21896. 1147.98 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21897. 1147.98 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21898. 1147.98 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21899. 1147.98 s [algebraic-graphs]
  21900. 1147.98 s [algebraic-graphs] ============ Graph.vertices ============
  21901. 1147.98 s [algebraic-graphs] OK: vertices [] == empty
  21902. 1147.98 s [algebraic-graphs] OK: vertices [x] == vertex x
  21903. 1147.98 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21904. 1147.98 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21905. 1147.98 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21906. 1147.98 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21907. 1147.98 s [algebraic-graphs]
  21908. 1147.98 s [algebraic-graphs] ============ Graph.edges ============
  21909. 1147.98 s [algebraic-graphs] OK: edges [] == empty
  21910. 1147.98 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21911. 1147.98 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21912. 1147.98 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21913. 1147.98 s [algebraic-graphs]
  21914. 1147.98 s [algebraic-graphs] ============ Graph.overlays ============
  21915. 1147.98 s [algebraic-graphs] OK: overlays [] == empty
  21916. 1147.98 s [algebraic-graphs] OK: overlays [x] == x
  21917. 1147.98 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21918. 1147.98 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21919. 1147.98 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21920. 1147.98 s [algebraic-graphs]
  21921. 1147.98 s [algebraic-graphs] ============ Graph.connects ============
  21922. 1147.98 s [algebraic-graphs] OK: connects [] == empty
  21923. 1147.98 s [algebraic-graphs] OK: connects [x] == x
  21924. 1147.98 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21925. 1147.98 s [algebraic-graphs] OK: connects == foldr connect empty
  21926. 1147.98 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21927. 1147.98 s [algebraic-graphs]
  21928. 1147.98 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21929. 1147.98 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21930. 1147.98 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21931. 1147.98 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21932. 1147.98 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21933. 1147.98 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21934. 1147.98 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21935. 1147.98 s [algebraic-graphs]
  21936. 1147.98 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21937. 1147.98 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21938. 1147.98 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21939. 1147.98 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21940. 1147.98 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21941. 1147.98 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21942. 1147.98 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21943. 1147.98 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21944. 1147.98 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21945. 1147.98 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21946. 1149.27 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21947. 1149.27 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21948. 1149.38 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21949. 1149.38 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21950. 1149.38 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21951. 1149.38 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21952. 1149.38 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21953. 1149.38 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21954. 1149.38 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21955. 1149.38 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21956. 1149.38 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21957. 1149.38 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21958. 1149.38 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21959. 1149.38 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21960. 1149.38 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21961. 1149.38 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21962. 1149.38 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21963. 1149.38 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21964. 1149.38 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21965. 1149.38 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21966. 1149.38 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21967. 1149.38 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21968. 1149.38 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21969. 1149.38 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21970. 1149.38 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21971. 1149.38 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21972. 1149.38 s [algebraic-graphs]
  21973. 1149.38 s [algebraic-graphs] ============ Graph.foldg ============
  21974. 1149.38 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21975. 1149.38 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21976. 1149.38 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21977. 1149.38 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21978. 1149.38 s [algebraic-graphs]
  21979. 1149.38 s [algebraic-graphs] ============ Graph.isEmpty ============
  21980. 1149.38 s [algebraic-graphs] OK: isEmpty empty == True
  21981. 1149.38 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21982. 1149.38 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21983. 1149.38 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21984. 1149.38 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21985. 1149.38 s [algebraic-graphs]
  21986. 1149.38 s [algebraic-graphs] ============ Graph.hasVertex ============
  21987. 1149.38 s [algebraic-graphs] OK: hasVertex x empty == False
  21988. 1149.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21989. 1149.38 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21990. 1149.38 s [algebraic-graphs]
  21991. 1149.38 s [algebraic-graphs] ============ Graph.hasEdge ============
  21992. 1149.38 s [algebraic-graphs] OK: hasEdge x y empty == False
  21993. 1149.38 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21994. 1149.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21995. 1149.38 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21996. 1149.38 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21997. 1149.38 s [algebraic-graphs]
  21998. 1149.38 s [algebraic-graphs] ============ Graph.vertexCount ============
  21999. 1149.38 s [algebraic-graphs] OK: vertexCount empty == 0
  22000. 1149.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22001. 1149.38 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22002. 1149.38 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22003. 1149.38 s [algebraic-graphs]
  22004. 1149.38 s [algebraic-graphs] ============ Graph.edgeCount ============
  22005. 1149.38 s [algebraic-graphs] OK: edgeCount empty == 0
  22006. 1149.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22007. 1149.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22008. 1149.38 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22009. 1149.38 s [algebraic-graphs]
  22010. 1149.38 s [algebraic-graphs] ============ Graph.vertexList ============
  22011. 1149.38 s [algebraic-graphs] OK: vertexList empty == []
  22012. 1149.38 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22013. 1149.38 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22014. 1149.38 s [algebraic-graphs]
  22015. 1149.38 s [algebraic-graphs] ============ Graph.vertexSet ============
  22016. 1149.38 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22017. 1149.38 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22018. 1149.38 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22019. 1149.38 s [algebraic-graphs]
  22020. 1149.38 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  22021. 1149.38 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  22022. 1149.39 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  22023. 1149.39 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  22024. 1149.39 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  22025. 1149.39 s [algebraic-graphs]
  22026. 1149.39 s [algebraic-graphs] ============ Graph.edgeList ============
  22027. 1149.39 s [algebraic-graphs] OK: edgeList empty == []
  22028. 1149.39 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22029. 1149.39 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22030. 1149.39 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22031. 1149.39 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  22032. 1149.39 s [algebraic-graphs]
  22033. 1149.39 s [algebraic-graphs] ============ Graph.edgeSet ============
  22034. 1149.39 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22035. 1149.39 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22036. 1149.39 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22037. 1149.39 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  22038. 1149.39 s [algebraic-graphs]
  22039. 1149.39 s [algebraic-graphs] ============ Graph.adjacencyList ============
  22040. 1149.39 s [algebraic-graphs] OK: adjacencyList empty == []
  22041. 1149.39 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  22042. 1149.39 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  22043. 1149.39 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  22044. 1149.39 s [algebraic-graphs]
  22045. 1149.39 s [algebraic-graphs] ============ Graph.preSet ============
  22046. 1149.39 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22047. 1149.39 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22048. 1149.39 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22049. 1149.39 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22050. 1149.39 s [algebraic-graphs]
  22051. 1149.39 s [algebraic-graphs] ============ Graph.preIntSet ============
  22052. 1149.39 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  22053. 1149.39 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  22054. 1149.39 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  22055. 1149.39 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  22056. 1149.39 s [algebraic-graphs]
  22057. 1149.39 s [algebraic-graphs] ============ Graph.postSet ============
  22058. 1149.39 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22059. 1149.39 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22060. 1149.39 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22061. 1149.39 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22062. 1149.39 s [algebraic-graphs]
  22063. 1149.39 s [algebraic-graphs] ============ Graph.postIntSet ============
  22064. 1149.39 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  22065. 1149.39 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  22066. 1149.39 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  22067. 1149.39 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  22068. 1149.39 s [algebraic-graphs]
  22069. 1149.39 s [algebraic-graphs] ============ Graph.size ============
  22070. 1149.39 s [algebraic-graphs] OK: size empty == 1
  22071. 1149.39 s [algebraic-graphs] OK: size (vertex x) == 1
  22072. 1149.39 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22073. 1149.39 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22074. 1149.39 s [algebraic-graphs] OK: size x >= 1
  22075. 1149.39 s [algebraic-graphs] OK: size x >= vertexCount x
  22076. 1149.39 s [algebraic-graphs]
  22077. 1149.39 s [algebraic-graphs] ============ Graph.path ============
  22078. 1149.39 s [algebraic-graphs] OK: path [] == empty
  22079. 1149.39 s [algebraic-graphs] OK: path [x] == vertex x
  22080. 1149.39 s [algebraic-graphs] OK: path [x,y] == edge x y
  22081. 1149.39 s [algebraic-graphs]
  22082. 1149.39 s [algebraic-graphs] ============ Graph.circuit ============
  22083. 1149.39 s [algebraic-graphs] OK: circuit [] == empty
  22084. 1149.39 s [algebraic-graphs] OK: circuit [x] == edge x x
  22085. 1149.39 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  22086. 1149.39 s [algebraic-graphs]
  22087. 1149.39 s [algebraic-graphs] ============ Graph.clique ============
  22088. 1149.39 s [algebraic-graphs] OK: clique [] == empty
  22089. 1149.39 s [algebraic-graphs] OK: clique [x] == vertex x
  22090. 1149.39 s [algebraic-graphs] OK: clique [x,y] == edge x y
  22091. 1149.39 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  22092. 1149.39 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  22093. 1149.39 s [algebraic-graphs]
  22094. 1149.39 s [algebraic-graphs] ============ Graph.biclique ============
  22095. 1149.39 s [algebraic-graphs] OK: biclique [] [] == empty
  22096. 1149.39 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  22097. 1149.39 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  22098. 1149.39 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22099. 1149.39 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  22100. 1149.39 s [algebraic-graphs]
  22101. 1149.39 s [algebraic-graphs] ============ Graph.star ============
  22102. 1149.39 s [algebraic-graphs] OK: star x [] == vertex x
  22103. 1149.39 s [algebraic-graphs] OK: star x [y] == edge x y
  22104. 1149.39 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  22105. 1149.39 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  22106. 1149.39 s [algebraic-graphs]
  22107. 1149.39 s [algebraic-graphs] ============ Graph.stars ============
  22108. 1149.39 s [algebraic-graphs] OK: stars [] == empty
  22109. 1149.39 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  22110. 1149.39 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  22111. 1149.39 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  22112. 1149.39 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  22113. 1149.39 s [algebraic-graphs] OK: stars . adjacencyList == id
  22114. 1149.39 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  22115. 1149.39 s [algebraic-graphs]
  22116. 1149.39 s [algebraic-graphs] ============ Graph.tree ============
  22117. 1149.39 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22118. 1149.39 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  22119. 1149.39 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22120. 1149.39 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  22121. 1149.39 s [algebraic-graphs]
  22122. 1149.39 s [algebraic-graphs] ============ Graph.forest ============
  22123. 1149.39 s [algebraic-graphs] OK: forest [] == empty
  22124. 1149.39 s [algebraic-graphs] OK: forest [x] == tree x
  22125. 1149.39 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  22126. 1149.39 s [algebraic-graphs] OK: forest == overlays . map tree
  22127. 1149.39 s [algebraic-graphs]
  22128. 1149.39 s [algebraic-graphs] ============ Graph.removeVertex ============
  22129. 1155.03 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22130. 1155.03 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22131. 1155.03 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  22132. 1155.14 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  22133. 1155.14 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22134. 1155.14 s [algebraic-graphs]
  22135. 1155.14 s [algebraic-graphs] ============ Graph.removeEdge ============
  22136. 1155.14 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  22137. 1155.14 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22138. 1155.14 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22139. 1155.14 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22140. 1155.14 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22141. 1155.14 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22142. 1155.14 s [algebraic-graphs]
  22143. 1155.14 s [algebraic-graphs] ============ Graph.replaceVertex ============
  22144. 1155.14 s [algebraic-graphs] OK: replaceVertex x x == id
  22145. 1155.14 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22146. 1155.14 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22147. 1155.14 s [algebraic-graphs]
  22148. 1155.14 s [algebraic-graphs] ============ Graph.mergeVertices ============
  22149. 1155.14 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22150. 1155.14 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22151. 1155.14 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22152. 1155.14 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22153. 1155.14 s [algebraic-graphs]
  22154. 1155.14 s [algebraic-graphs] ============ Graph.transpose ============
  22155. 1155.14 s [algebraic-graphs] OK: transpose empty == empty
  22156. 1155.14 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22157. 1155.14 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22158. 1155.14 s [algebraic-graphs] OK: transpose . transpose == id
  22159. 1155.14 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22160. 1155.14 s [algebraic-graphs]
  22161. 1155.14 s [algebraic-graphs] ============ Graph.gmap ============
  22162. 1155.14 s [algebraic-graphs] OK: gmap f empty == empty
  22163. 1155.14 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22164. 1155.14 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22165. 1155.14 s [algebraic-graphs] OK: gmap id == id
  22166. 1155.14 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22167. 1155.14 s [algebraic-graphs]
  22168. 1155.14 s [algebraic-graphs] ============ Graph.induce ============
  22169. 1155.14 s [algebraic-graphs] OK: induce (const True ) x == x
  22170. 1155.14 s [algebraic-graphs] OK: induce (const False) x == empty
  22171. 1155.14 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22172. 1155.14 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22173. 1155.14 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22174. 1155.14 s [algebraic-graphs]
  22175. 1155.14 s [algebraic-graphs] ============ Graph.induceJust ============
  22176. 1155.14 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22177. 1155.14 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22178. 1155.14 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22179. 1155.14 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22180. 1155.14 s [algebraic-graphs]
  22181. 1155.14 s [algebraic-graphs] ============ Graph.compose ============
  22182. 1155.14 s [algebraic-graphs] OK: compose empty x == empty
  22183. 1155.14 s [algebraic-graphs] OK: compose x empty == empty
  22184. 1155.14 s [algebraic-graphs] OK: compose (vertex x) y == empty
  22185. 1155.14 s [algebraic-graphs] OK: compose x (vertex y) == empty
  22186. 1155.14 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  22187. 1155.14 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  22188. 1155.14 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  22189. 1155.14 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  22190. 1155.14 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  22191. 1155.14 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  22192. 1155.14 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  22193. 1155.14 s [algebraic-graphs]
  22194. 1155.14 s [algebraic-graphs] ============ Graph.(===) ============
  22195. 1155.14 s [algebraic-graphs] OK: x === x == True
  22196. 1155.14 s [algebraic-graphs] OK: x === x + empty == False
  22197. 1155.14 s [algebraic-graphs] OK: x + y === x + y == True
  22198. 1155.14 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22199. 1155.14 s [algebraic-graphs] OK: x + y === x * y == False
  22200. 1155.14 s [algebraic-graphs]
  22201. 1155.14 s [algebraic-graphs] ============ Graph.mesh ============
  22202. 1155.14 s [algebraic-graphs] OK: mesh xs [] == empty
  22203. 1155.14 s [algebraic-graphs] OK: mesh [] ys == empty
  22204. 1155.14 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  22205. 1155.14 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  22206. 1155.14 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  22207. 1155.14 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22208. 1155.14 s [algebraic-graphs]
  22209. 1155.14 s [algebraic-graphs] ============ Graph.torus ============
  22210. 1155.14 s [algebraic-graphs] OK: torus xs [] == empty
  22211. 1155.14 s [algebraic-graphs] OK: torus [] ys == empty
  22212. 1155.14 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  22213. 1155.14 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  22214. 1155.14 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  22215. 1155.14 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  22216. 1155.14 s [algebraic-graphs]
  22217. 1155.14 s [algebraic-graphs] ============ Graph.deBruijn ============
  22218. 1155.14 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  22219. 1155.14 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  22220. 1155.14 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  22221. 1155.14 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  22222. 1155.14 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  22223. 1155.14 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  22224. 1155.14 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  22225. 1155.14 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  22226. 1155.14 s [algebraic-graphs]
  22227. 1155.14 s [algebraic-graphs] ============ Graph.splitVertex ============
  22228. 1155.14 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  22229. 1155.14 s [algebraic-graphs] OK: splitVertex x [x] == id
  22230. 1155.14 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  22231. 1155.14 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22232. 1155.14 s [algebraic-graphs]
  22233. 1155.14 s [algebraic-graphs] ============ Graph.bind ============
  22234. 1155.14 s [algebraic-graphs] OK: bind empty f == empty
  22235. 1155.14 s [algebraic-graphs] OK: bind (vertex x) f == f x
  22236. 1155.14 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  22237. 1155.14 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  22238. 1155.14 s [algebraic-graphs] OK: bind x (const empty) == empty
  22239. 1155.14 s [algebraic-graphs] OK: bind x vertex == x
  22240. 1155.14 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  22241. 1155.14 s [algebraic-graphs]
  22242. 1155.14 s [algebraic-graphs] ============ Graph.simplify ============
  22243. 1155.14 s [algebraic-graphs] OK: simplify == id
  22244. 1155.14 s [algebraic-graphs] OK: size (simplify x) <= size x
  22245. 1155.14 s [algebraic-graphs]
  22246. 1155.14 s [algebraic-graphs] ============ Graph.box ============
  22247. 1155.14 s [algebraic-graphs] OK: box x y ~~ box y x
  22248. 1155.14 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22249. 1155.14 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22250. 1155.14 s [algebraic-graphs] OK: box x empty ~~ empty
  22251. 1155.14 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22252. 1155.14 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22253. 1155.14 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22254. 1155.14 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22255. 1155.14 s [algebraic-graphs]
  22256. 1155.14 s [algebraic-graphs] ============ Graph.sparsify ============
  22257. 1155.14 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22258. 1155.14 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22259. 1155.14 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22260. 1155.14 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22261. 1155.14 s [algebraic-graphs]
  22262. 1155.14 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  22263. 1155.14 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22264. 1155.14 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22265. 1155.14 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22266. 1155.14 s [algebraic-graphs]
  22267. 1155.14 s [algebraic-graphs] ============ Graph.context ============
  22268. 1155.14 s [algebraic-graphs] OK: context (const False) x == Nothing
  22269. 1155.14 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  22270. 1155.14 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  22271. 1155.14 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  22272. 1155.14 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  22273. 1155.14 s [algebraic-graphs]
  22274. 1155.14 s [algebraic-graphs] ============ Graph.buildg ============
  22275. 1155.14 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  22276. 1155.14 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  22277. 1155.14 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
  22278. 1155.14 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
  22279. 1155.14 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  22280. 1155.14 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  22281. 1155.14 s [algebraic-graphs]
  22282. 1155.14 s [algebraic-graphs] ============ Internal.List ============
  22283. 1155.14 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  22284. 1155.14 s [algebraic-graphs]
  22285. 1155.14 s [algebraic-graphs] ============ Graph.Label ============
  22286. 1155.14 s [algebraic-graphs]
  22287. 1155.14 s [algebraic-graphs] ============ Any: instances ============
  22288. 1155.14 s [algebraic-graphs] OK: Semiring
  22289. 1155.14 s [algebraic-graphs] OK: StarSemiring
  22290. 1155.14 s [algebraic-graphs] OK: Dioid
  22291. 1155.14 s [algebraic-graphs]
  22292. 1155.14 s [algebraic-graphs] ============ Distance Int: instances ============
  22293. 1155.14 s [algebraic-graphs] OK: Semiring
  22294. 1155.14 s [algebraic-graphs] OK: StarSemiring
  22295. 1155.14 s [algebraic-graphs] OK: Dioid
  22296. 1155.14 s [algebraic-graphs]
  22297. 1155.14 s [algebraic-graphs] ============ Capacity Int: instances ============
  22298. 1155.14 s [algebraic-graphs] OK: Semiring
  22299. 1155.14 s [algebraic-graphs] OK: StarSemiring
  22300. 1155.14 s [algebraic-graphs] OK: Dioid
  22301. 1155.14 s [algebraic-graphs]
  22302. 1155.14 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  22303. 1155.14 s [algebraic-graphs] OK: LeftNearRing
  22304. 1155.14 s [algebraic-graphs]
  22305. 1155.14 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  22306. 1155.14 s [algebraic-graphs] OK: Semiring
  22307. 1155.14 s [algebraic-graphs] OK: Dioid
  22308. 1155.14 s [algebraic-graphs]
  22309. 1155.14 s [algebraic-graphs] ============ Count Int: instances ============
  22310. 1155.14 s [algebraic-graphs] OK: Semiring
  22311. 1155.14 s [algebraic-graphs] OK: StarSemiring
  22312. 1155.14 s [algebraic-graphs]
  22313. 1155.14 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  22314. 1155.14 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  22315. 1155.14 s [algebraic-graphs] OK: empty
  22316. 1155.14 s [algebraic-graphs] OK: vertex
  22317. 1155.14 s [algebraic-graphs] OK: edge
  22318. 1155.14 s [algebraic-graphs] OK: overlay
  22319. 1155.14 s [algebraic-graphs] OK: connect
  22320. 1155.15 s [algebraic-graphs] OK: vertices
  22321. 1155.15 s [algebraic-graphs] OK: edges
  22322. 1155.15 s [algebraic-graphs] OK: overlays
  22323. 1155.15 s [algebraic-graphs] OK: fromAdjacencyMaps
  22324. 1155.15 s [algebraic-graphs] OK: removeVertex
  22325. 1155.15 s [algebraic-graphs] OK: removeEdge
  22326. 1155.15 s [algebraic-graphs] OK: replaceVertex
  22327. 1155.15 s [algebraic-graphs] OK: replaceEdge
  22328. 1155.15 s [algebraic-graphs] OK: transpose
  22329. 1155.15 s [algebraic-graphs] OK: gmap
  22330. 1155.15 s [algebraic-graphs] OK: emap
  22331. 1155.15 s [algebraic-graphs] OK: induce
  22332. 1155.15 s [algebraic-graphs] OK: closure
  22333. 1155.15 s [algebraic-graphs] OK: reflexiveClosure
  22334. 1155.15 s [algebraic-graphs] OK: symmetricClosure
  22335. 1155.15 s [algebraic-graphs] OK: transitiveClosure
  22336. 1155.15 s [algebraic-graphs]
  22337. 1155.15 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  22338. 1155.15 s [algebraic-graphs] OK: isEmpty empty == True
  22339. 1155.15 s [algebraic-graphs] OK: hasVertex x empty == False
  22340. 1155.15 s [algebraic-graphs] OK: vertexCount empty == 0
  22341. 1155.24 s [algebraic-graphs] OK: edgeCount empty == 0
  22342. 1155.24 s [algebraic-graphs]
  22343. 1155.24 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  22344. 1155.24 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22345. 1155.24 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22346. 1155.24 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22347. 1155.24 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22348. 1155.24 s [algebraic-graphs]
  22349. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  22350. 1159.16 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22351. 1159.16 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22352. 1159.16 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22353. 1159.16 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22354. 1159.16 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22355. 1159.16 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22356. 1159.16 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22357. 1159.16 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22358. 1159.16 s [algebraic-graphs]
  22359. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  22360. 1159.16 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22361. 1159.16 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22362. 1159.16 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22363. 1159.16 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22364. 1159.16 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22365. 1159.16 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22366. 1159.16 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22367. 1159.16 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22368. 1159.16 s [algebraic-graphs]
  22369. 1159.16 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22370. 1159.16 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22371. 1159.16 s [algebraic-graphs]
  22372. 1159.16 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22373. 1159.16 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22374. 1159.16 s [algebraic-graphs]
  22375. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  22376. 1159.16 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22377. 1159.16 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22378. 1159.16 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22379. 1159.16 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22380. 1159.16 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22381. 1159.16 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22382. 1159.16 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22383. 1159.16 s [algebraic-graphs]
  22384. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  22385. 1159.16 s [algebraic-graphs] OK: vertices [] == empty
  22386. 1159.16 s [algebraic-graphs] OK: vertices [x] == vertex x
  22387. 1159.16 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22388. 1159.16 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22389. 1159.16 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22390. 1159.16 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22391. 1159.16 s [algebraic-graphs]
  22392. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  22393. 1159.16 s [algebraic-graphs] OK: edges [] == empty
  22394. 1159.16 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22395. 1159.16 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22396. 1159.16 s [algebraic-graphs]
  22397. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22398. 1159.16 s [algebraic-graphs] OK: overlays [] == empty
  22399. 1159.16 s [algebraic-graphs] OK: overlays [x] == x
  22400. 1159.16 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22401. 1159.16 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22402. 1159.16 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22403. 1159.16 s [algebraic-graphs]
  22404. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22405. 1159.16 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22406. 1159.16 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22407. 1159.16 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22408. 1159.16 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22409. 1159.16 s [algebraic-graphs]
  22410. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22411. 1159.16 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22412. 1159.16 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22413. 1159.16 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22414. 1159.16 s [algebraic-graphs]
  22415. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22416. 1159.16 s [algebraic-graphs] OK: isEmpty empty == True
  22417. 1159.16 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22418. 1159.16 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22419. 1159.16 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22420. 1159.16 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22421. 1159.16 s [algebraic-graphs]
  22422. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22423. 1159.16 s [algebraic-graphs] OK: hasVertex x empty == False
  22424. 1159.16 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22425. 1159.16 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22426. 1159.16 s [algebraic-graphs]
  22427. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22428. 1159.16 s [algebraic-graphs] OK: hasEdge x y empty == False
  22429. 1159.16 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22430. 1159.16 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22431. 1159.16 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22432. 1159.16 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22433. 1159.16 s [algebraic-graphs]
  22434. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22435. 1159.16 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22436. 1159.16 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22437. 1159.16 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22438. 1159.16 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22439. 1159.16 s [algebraic-graphs]
  22440. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22441. 1159.16 s [algebraic-graphs] OK: vertexCount empty == 0
  22442. 1159.16 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22443. 1159.16 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22444. 1159.16 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22445. 1159.16 s [algebraic-graphs]
  22446. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22447. 1159.16 s [algebraic-graphs] OK: edgeCount empty == 0
  22448. 1159.16 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22449. 1159.16 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22450. 1159.16 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22451. 1159.16 s [algebraic-graphs]
  22452. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22453. 1159.16 s [algebraic-graphs] OK: vertexList empty == []
  22454. 1159.16 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22455. 1159.16 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22456. 1159.16 s [algebraic-graphs]
  22457. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22458. 1159.16 s [algebraic-graphs] OK: edgeList empty == []
  22459. 1159.16 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22460. 1159.16 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22461. 1159.16 s [algebraic-graphs]
  22462. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22463. 1159.16 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22464. 1159.16 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22465. 1159.16 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22466. 1159.16 s [algebraic-graphs]
  22467. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22468. 1159.16 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22469. 1159.16 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22470. 1159.16 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22471. 1159.16 s [algebraic-graphs]
  22472. 1159.16 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22473. 1159.16 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22474. 1159.16 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22475. 1159.16 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22476. 1159.17 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22477. 1159.17 s [algebraic-graphs]
  22478. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22479. 1159.17 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22480. 1159.17 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22481. 1159.17 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22482. 1159.17 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22483. 1159.17 s [algebraic-graphs]
  22484. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22485. 1159.17 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22486. 1159.17 s [algebraic-graphs]
  22487. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22488. 1159.17 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22489. 1159.17 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22490. 1159.17 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22491. 1159.17 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22492. 1159.17 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22493. 1159.17 s [algebraic-graphs]
  22494. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22495. 1159.17 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22496. 1159.17 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22497. 1159.17 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22498. 1159.17 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22499. 1159.17 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22500. 1159.17 s [algebraic-graphs]
  22501. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22502. 1159.17 s [algebraic-graphs] OK: replaceVertex x x == id
  22503. 1159.17 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22504. 1159.17 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22505. 1159.17 s [algebraic-graphs]
  22506. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22507. 1159.17 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22508. 1159.17 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22509. 1159.17 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22510. 1159.17 s [algebraic-graphs]
  22511. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22512. 1159.17 s [algebraic-graphs] OK: transpose empty == empty
  22513. 1159.17 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22514. 1159.17 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22515. 1159.17 s [algebraic-graphs] OK: transpose . transpose == id
  22516. 1159.17 s [algebraic-graphs]
  22517. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22518. 1159.17 s [algebraic-graphs] OK: gmap f empty == empty
  22519. 1159.17 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22520. 1159.17 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22521. 1159.17 s [algebraic-graphs] OK: gmap id == id
  22522. 1159.17 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22523. 1159.17 s [algebraic-graphs]
  22524. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22525. 1159.17 s [algebraic-graphs] OK: emap h empty == empty
  22526. 1159.17 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22527. 1159.17 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22528. 1159.17 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22529. 1159.17 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22530. 1159.17 s [algebraic-graphs] OK: emap id == id
  22531. 1159.17 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22532. 1159.17 s [algebraic-graphs]
  22533. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22534. 1159.17 s [algebraic-graphs] OK: induce (const True ) x == x
  22535. 1159.17 s [algebraic-graphs] OK: induce (const False) x == empty
  22536. 1159.17 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22537. 1159.17 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22538. 1159.17 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22539. 1159.17 s [algebraic-graphs]
  22540. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22541. 1161.03 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22542. 1161.03 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22543. 1161.12 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22544. 1161.12 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22545. 1161.12 s [algebraic-graphs]
  22546. 1161.12 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22547. 1161.13 s [algebraic-graphs] OK: closure empty == empty
  22548. 1161.13 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22549. 1161.13 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22550. 1161.13 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22551. 1161.13 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22552. 1161.13 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22553. 1161.13 s [algebraic-graphs] OK: closure . closure == closure
  22554. 1161.13 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22555. 1161.13 s [algebraic-graphs]
  22556. 1161.13 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22557. 1161.13 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22558. 1161.13 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22559. 1161.13 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22560. 1161.13 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22561. 1161.13 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22562. 1161.13 s [algebraic-graphs]
  22563. 1161.13 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22564. 1161.13 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22565. 1161.13 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22566. 1161.13 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22567. 1161.13 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22568. 1161.13 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22569. 1161.13 s [algebraic-graphs]
  22570. 1161.13 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22571. 1161.13 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22572. 1161.13 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22573. 1161.13 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22574. 1161.13 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22575. 1161.13 s [algebraic-graphs]
  22576. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22577. 1161.13 s [algebraic-graphs] OK: isEmpty empty == True
  22578. 1161.13 s [algebraic-graphs] OK: hasVertex x empty == False
  22579. 1161.13 s [algebraic-graphs] OK: vertexCount empty == 0
  22580. 1161.13 s [algebraic-graphs] OK: edgeCount empty == 0
  22581. 1161.13 s [algebraic-graphs]
  22582. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22583. 1161.13 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22584. 1161.13 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22585. 1161.13 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22586. 1161.13 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22587. 1161.13 s [algebraic-graphs]
  22588. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22589. 1161.13 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22590. 1161.13 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22591. 1161.13 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22592. 1161.13 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22593. 1161.13 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22594. 1161.13 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22595. 1161.13 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22596. 1161.13 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22597. 1161.13 s [algebraic-graphs]
  22598. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22599. 1161.13 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22600. 1161.13 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22601. 1161.13 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22602. 1161.13 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22603. 1161.13 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22604. 1161.13 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22605. 1161.13 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22606. 1161.13 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22607. 1161.13 s [algebraic-graphs]
  22608. 1161.13 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22609. 1161.13 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22610. 1161.13 s [algebraic-graphs]
  22611. 1161.13 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22612. 1161.13 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22613. 1161.13 s [algebraic-graphs]
  22614. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22615. 1161.13 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22616. 1161.13 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22617. 1161.13 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22618. 1161.13 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22619. 1161.13 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22620. 1161.13 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22621. 1161.13 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22622. 1161.13 s [algebraic-graphs]
  22623. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22624. 1161.13 s [algebraic-graphs] OK: vertices [] == empty
  22625. 1161.13 s [algebraic-graphs] OK: vertices [x] == vertex x
  22626. 1161.13 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22627. 1161.13 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22628. 1161.13 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22629. 1161.13 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22630. 1161.13 s [algebraic-graphs]
  22631. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22632. 1161.13 s [algebraic-graphs] OK: edges [] == empty
  22633. 1161.13 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22634. 1161.13 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22635. 1161.13 s [algebraic-graphs]
  22636. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22637. 1161.13 s [algebraic-graphs] OK: overlays [] == empty
  22638. 1161.13 s [algebraic-graphs] OK: overlays [x] == x
  22639. 1161.13 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22640. 1161.13 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22641. 1161.13 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22642. 1161.13 s [algebraic-graphs]
  22643. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22644. 1161.13 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22645. 1161.13 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22646. 1161.13 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22647. 1161.13 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22648. 1161.13 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22649. 1161.13 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22650. 1161.13 s [algebraic-graphs]
  22651. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22652. 1161.13 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22653. 1161.13 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22654. 1161.13 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22655. 1161.13 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22656. 1161.13 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22657. 1161.13 s [algebraic-graphs]
  22658. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22659. 1161.13 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22660. 1161.13 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22661. 1161.13 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22662. 1161.13 s [algebraic-graphs]
  22663. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22664. 1161.13 s [algebraic-graphs] OK: isEmpty empty == True
  22665. 1161.13 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22666. 1161.13 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22667. 1161.13 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22668. 1161.13 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22669. 1161.13 s [algebraic-graphs]
  22670. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22671. 1161.13 s [algebraic-graphs] OK: size empty == 1
  22672. 1161.13 s [algebraic-graphs] OK: size (vertex x) == 1
  22673. 1161.13 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22674. 1161.13 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22675. 1161.13 s [algebraic-graphs] OK: size x >= 1
  22676. 1161.13 s [algebraic-graphs] OK: size x >= vertexCount x
  22677. 1161.13 s [algebraic-graphs]
  22678. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22679. 1161.13 s [algebraic-graphs] OK: hasVertex x empty == False
  22680. 1161.13 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22681. 1161.13 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22682. 1161.13 s [algebraic-graphs]
  22683. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22684. 1161.13 s [algebraic-graphs] OK: hasEdge x y empty == False
  22685. 1161.13 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22686. 1161.13 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22687. 1161.13 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22688. 1161.13 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22689. 1161.13 s [algebraic-graphs]
  22690. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22691. 1161.13 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22692. 1161.13 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22693. 1161.13 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22694. 1161.13 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22695. 1161.13 s [algebraic-graphs]
  22696. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22697. 1161.13 s [algebraic-graphs] OK: vertexCount empty == 0
  22698. 1161.13 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22699. 1161.13 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22700. 1161.13 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22701. 1161.13 s [algebraic-graphs]
  22702. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22703. 1161.13 s [algebraic-graphs] OK: edgeCount empty == 0
  22704. 1161.13 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22705. 1161.13 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22706. 1161.13 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22707. 1161.13 s [algebraic-graphs]
  22708. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22709. 1161.13 s [algebraic-graphs] OK: vertexList empty == []
  22710. 1161.13 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22711. 1161.13 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22712. 1161.13 s [algebraic-graphs]
  22713. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22714. 1161.13 s [algebraic-graphs] OK: edgeList empty == []
  22715. 1161.13 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22716. 1161.13 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22717. 1161.13 s [algebraic-graphs]
  22718. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22719. 1161.13 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22720. 1161.13 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22721. 1161.13 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22722. 1161.13 s [algebraic-graphs]
  22723. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22724. 1161.13 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22725. 1161.13 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22726. 1161.13 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22727. 1161.13 s [algebraic-graphs]
  22728. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22729. 1161.13 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22730. 1161.13 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22731. 1165.53 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22732. 1165.53 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22733. 1165.53 s [algebraic-graphs]
  22734. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22735. 1165.53 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22736. 1165.53 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22737. 1165.53 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22738. 1165.53 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22739. 1165.53 s [algebraic-graphs]
  22740. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22741. 1165.53 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22742. 1165.53 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22743. 1165.53 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22744. 1165.53 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22745. 1165.53 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22746. 1165.53 s [algebraic-graphs]
  22747. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22748. 1165.53 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22749. 1165.53 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22750. 1165.53 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22751. 1165.53 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22752. 1165.53 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22753. 1165.53 s [algebraic-graphs]
  22754. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22755. 1165.53 s [algebraic-graphs] OK: replaceVertex x x == id
  22756. 1165.53 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22757. 1165.53 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22758. 1165.53 s [algebraic-graphs]
  22759. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22760. 1165.53 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22761. 1165.53 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22762. 1165.53 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22763. 1165.53 s [algebraic-graphs]
  22764. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22765. 1165.53 s [algebraic-graphs] OK: transpose empty == empty
  22766. 1165.53 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22767. 1165.53 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22768. 1165.53 s [algebraic-graphs] OK: transpose . transpose == id
  22769. 1165.53 s [algebraic-graphs]
  22770. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22771. 1165.53 s [algebraic-graphs] OK: fmap f empty == empty
  22772. 1165.53 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22773. 1165.53 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22774. 1165.53 s [algebraic-graphs] OK: fmap id == id
  22775. 1165.53 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22776. 1165.53 s [algebraic-graphs]
  22777. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22778. 1165.53 s [algebraic-graphs] OK: emap h empty == empty
  22779. 1165.53 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22780. 1165.53 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22781. 1165.53 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22782. 1165.53 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22783. 1165.53 s [algebraic-graphs] OK: emap id == id
  22784. 1165.53 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22785. 1165.53 s [algebraic-graphs]
  22786. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22787. 1165.53 s [algebraic-graphs] OK: induce (const True ) x == x
  22788. 1165.53 s [algebraic-graphs] OK: induce (const False) x == empty
  22789. 1165.53 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22790. 1165.53 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22791. 1165.53 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22792. 1165.53 s [algebraic-graphs]
  22793. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22794. 1165.54 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22795. 1165.54 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22796. 1165.54 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22797. 1165.54 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22798. 1165.54 s [algebraic-graphs]
  22799. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22800. 1165.54 s [algebraic-graphs] OK: closure empty == empty
  22801. 1165.54 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22802. 1165.54 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22803. 1165.54 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22804. 1165.54 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22805. 1165.54 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22806. 1165.54 s [algebraic-graphs] OK: closure . closure == closure
  22807. 1165.54 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22808. 1165.54 s [algebraic-graphs]
  22809. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22810. 1165.54 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22811. 1165.54 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22812. 1165.54 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22813. 1165.54 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22814. 1165.54 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22815. 1165.54 s [algebraic-graphs]
  22816. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22817. 1165.54 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22818. 1165.54 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22819. 1165.54 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22820. 1165.54 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22821. 1165.54 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22822. 1165.54 s [algebraic-graphs]
  22823. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22824. 1165.54 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22825. 1165.54 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22826. 1165.54 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22827. 1165.54 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22828. 1165.54 s [algebraic-graphs]
  22829. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22830. 1165.54 s [algebraic-graphs] OK: context (const False) x == Nothing
  22831. 1165.54 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22832. 1165.54 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22833. 1165.54 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22834. 1165.54 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22835. 1165.54 s [algebraic-graphs]
  22836. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22837. 1165.54 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22838. 1165.54 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22839. 1165.54 s [algebraic-graphs]
  22840. 1165.54 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22841. 1165.54 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22842. 1165.54 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22843. 1165.54 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22844. 1165.54 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22845. 1165.54 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22846. 1165.54 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22847. 1165.54 s [algebraic-graphs] OK: x <= x + y
  22848. 1165.54 s [algebraic-graphs] OK: x + y <= x * y
  22849. 1165.54 s [algebraic-graphs]
  22850. 1165.54 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22851. 1165.54 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22852. 1165.54 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22853. 1165.54 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22854. 1165.54 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22855. 1165.54 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22856. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22857. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22858. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22859. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22860. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22861. 1165.54 s [algebraic-graphs]
  22862. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22863. 1165.54 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22864. 1165.54 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22865. 1165.54 s [algebraic-graphs]
  22866. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22867. 1165.54 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22868. 1165.54 s [algebraic-graphs]
  22869. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22870. 1165.54 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22871. 1165.54 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22872. 1165.54 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22873. 1165.54 s [algebraic-graphs]
  22874. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22875. 1165.54 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22876. 1165.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22877. 1165.54 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22878. 1165.54 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22879. 1165.54 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22880. 1165.54 s [algebraic-graphs]
  22881. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22882. 1165.54 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22883. 1165.54 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22884. 1165.54 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22885. 1165.54 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22886. 1165.54 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22887. 1165.54 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22888. 1165.54 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22889. 1165.54 s [algebraic-graphs]
  22890. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22891. 1165.54 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22892. 1165.54 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22893. 1165.54 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22894. 1165.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22895. 1165.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22896. 1165.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22897. 1165.54 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22898. 1165.54 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22899. 1165.54 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22900. 1165.54 s [algebraic-graphs]
  22901. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22902. 1165.54 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22903. 1165.54 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22904. 1165.54 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22905. 1165.54 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22906. 1165.54 s [algebraic-graphs]
  22907. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22908. 1165.54 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22909. 1165.54 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22910. 1165.54 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22911. 1165.54 s [algebraic-graphs]
  22912. 1169.83 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22913. 1169.83 s [algebraic-graphs] OK: overlays1 [x] == x
  22914. 1169.94 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22915. 1169.94 s [algebraic-graphs]
  22916. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22917. 1169.94 s [algebraic-graphs] OK: connects1 [x] == x
  22918. 1169.94 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22919. 1169.94 s [algebraic-graphs]
  22920. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22921. 1169.94 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22922. 1169.94 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22923. 1169.94 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22924. 1169.94 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22925. 1169.94 s [algebraic-graphs]
  22926. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22927. 1169.94 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22928. 1169.94 s [algebraic-graphs]
  22929. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22930. 1169.94 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22931. 1169.94 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22932. 1169.94 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22933. 1169.94 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22934. 1169.94 s [algebraic-graphs]
  22935. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22936. 1169.94 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22937. 1169.94 s [algebraic-graphs] OK: vertexCount x >= 1
  22938. 1169.94 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22939. 1169.94 s [algebraic-graphs]
  22940. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22941. 1169.94 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22942. 1169.94 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22943. 1169.94 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22944. 1169.94 s [algebraic-graphs]
  22945. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22946. 1169.94 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22947. 1169.94 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22948. 1169.94 s [algebraic-graphs]
  22949. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22950. 1169.94 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22951. 1169.94 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22952. 1169.94 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22953. 1169.94 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22954. 1169.94 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22955. 1169.94 s [algebraic-graphs]
  22956. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22957. 1169.94 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22958. 1169.94 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22959. 1169.94 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22960. 1169.94 s [algebraic-graphs]
  22961. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22962. 1169.94 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22963. 1169.94 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22964. 1169.94 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22965. 1169.94 s [algebraic-graphs]
  22966. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22967. 1169.94 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22968. 1169.94 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22969. 1169.94 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22970. 1169.95 s [algebraic-graphs]
  22971. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22972. 1169.95 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22973. 1169.95 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22974. 1169.95 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22975. 1169.95 s [algebraic-graphs]
  22976. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22977. 1169.95 s [algebraic-graphs] OK: path1 [x] == vertex x
  22978. 1169.95 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22979. 1169.95 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22980. 1169.95 s [algebraic-graphs]
  22981. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22982. 1169.95 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22983. 1169.95 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22984. 1169.95 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22985. 1169.95 s [algebraic-graphs]
  22986. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22987. 1169.95 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22988. 1169.95 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22989. 1169.95 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22990. 1169.95 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22991. 1169.95 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22992. 1169.95 s [algebraic-graphs]
  22993. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22994. 1169.95 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22995. 1169.95 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22996. 1169.95 s [algebraic-graphs]
  22997. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22998. 1169.95 s [algebraic-graphs] OK: star x [] == vertex x
  22999. 1169.95 s [algebraic-graphs] OK: star x [y] == edge x y
  23000. 1169.95 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23001. 1169.95 s [algebraic-graphs]
  23002. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  23003. 1169.95 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23004. 1169.95 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23005. 1169.95 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23006. 1169.95 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23007. 1169.95 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23008. 1169.95 s [algebraic-graphs]
  23009. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  23010. 1169.95 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23011. 1169.95 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23012. 1169.95 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23013. 1169.95 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23014. 1169.95 s [algebraic-graphs]
  23015. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  23016. 1169.95 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23017. 1169.95 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23018. 1169.95 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23019. 1169.95 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23020. 1169.95 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23021. 1169.95 s [algebraic-graphs]
  23022. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  23023. 1169.95 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23024. 1169.95 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23025. 1169.95 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23026. 1169.95 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23027. 1169.95 s [algebraic-graphs]
  23028. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  23029. 1169.95 s [algebraic-graphs] OK: replaceVertex x x == id
  23030. 1169.95 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23031. 1169.95 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23032. 1169.95 s [algebraic-graphs]
  23033. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  23034. 1169.95 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23035. 1169.95 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23036. 1169.95 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23037. 1169.95 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23038. 1169.95 s [algebraic-graphs]
  23039. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  23040. 1169.95 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23041. 1169.95 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23042. 1169.95 s [algebraic-graphs] OK: transpose . transpose == id
  23043. 1169.95 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23044. 1169.95 s [algebraic-graphs]
  23045. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  23046. 1169.95 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23047. 1169.95 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23048. 1169.95 s [algebraic-graphs] OK: gmap id == id
  23049. 1169.95 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23050. 1169.95 s [algebraic-graphs]
  23051. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  23052. 1169.95 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23053. 1169.95 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23054. 1169.95 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23055. 1169.95 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23056. 1169.95 s [algebraic-graphs]
  23057. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  23058. 1169.95 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23059. 1169.95 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23060. 1169.95 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  23061. 1169.95 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  23062. 1169.95 s [algebraic-graphs]
  23063. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  23064. 1169.95 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23065. 1169.95 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23066. 1169.95 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23067. 1169.95 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  23068. 1169.95 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23069. 1169.95 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23070. 1169.95 s [algebraic-graphs] OK: closure . closure == closure
  23071. 1169.95 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23072. 1169.95 s [algebraic-graphs]
  23073. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  23074. 1169.95 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23075. 1169.95 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23076. 1169.95 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23077. 1169.95 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23078. 1169.95 s [algebraic-graphs]
  23079. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  23080. 1169.95 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23081. 1169.95 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  23082. 1169.95 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23083. 1169.95 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23084. 1169.95 s [algebraic-graphs]
  23085. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  23086. 1169.95 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23087. 1169.95 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23088. 1169.95 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  23089. 1169.95 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23090. 1169.95 s [algebraic-graphs]
  23091. 1169.95 s [algebraic-graphs] ============ NonEmpty.Graph.============
  23092. 1169.95 s [algebraic-graphs] OK: Axioms of non-empty graphs
  23093. 1169.95 s [algebraic-graphs] OK: Theorems of non-empty graphs
  23094. 1169.95 s [algebraic-graphs]
  23095. 1169.95 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  23096. 1169.95 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23097. 1169.95 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23098. 1169.95 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23099. 1169.95 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23100. 1169.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23101. 1169.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23102. 1169.95 s [algebraic-graphs] OK: x <= x + y
  23103. 1169.95 s [algebraic-graphs] OK: x + y <= x * y
  23104. 1169.95 s [algebraic-graphs]
  23105. 1169.95 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  23106. 1169.95 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  23107. 1169.95 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  23108. 1169.95 s [algebraic-graphs] OK: fmap id == id
  23109. 1169.95 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  23110. 1169.95 s [algebraic-graphs]
  23111. 1169.95 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  23112. 1169.95 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  23113. 1172.11 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  23114. 1172.11 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  23115. 1172.11 s [algebraic-graphs] OK: (x >>= vertex) == x
  23116. 1172.11 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  23117. 1172.11 s [algebraic-graphs]
  23118. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  23119. 1172.11 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  23120. 1172.11 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  23121. 1172.11 s [algebraic-graphs]
  23122. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  23123. 1172.11 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23124. 1172.11 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23125. 1172.11 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23126. 1172.11 s [algebraic-graphs] OK: size (vertex x) == 1
  23127. 1172.11 s [algebraic-graphs]
  23128. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  23129. 1172.11 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23130. 1172.11 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23131. 1172.11 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23132. 1172.11 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23133. 1172.11 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23134. 1172.11 s [algebraic-graphs]
  23135. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  23136. 1172.11 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23137. 1172.11 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23138. 1172.11 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23139. 1172.11 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23140. 1172.11 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23141. 1172.11 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23142. 1172.11 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23143. 1172.11 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23144. 1172.11 s [algebraic-graphs]
  23145. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  23146. 1172.11 s [algebraic-graphs] OK: overlay1 empty x == x
  23147. 1172.11 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  23148. 1172.11 s [algebraic-graphs]
  23149. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  23150. 1172.11 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23151. 1172.11 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23152. 1172.11 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23153. 1172.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23154. 1172.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23155. 1172.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23156. 1172.11 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23157. 1172.11 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23158. 1172.11 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23159. 1172.11 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23160. 1172.11 s [algebraic-graphs]
  23161. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  23162. 1172.11 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  23163. 1172.11 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  23164. 1172.11 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  23165. 1172.11 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23166. 1172.11 s [algebraic-graphs]
  23167. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  23168. 1172.11 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  23169. 1172.11 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  23170. 1172.11 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  23171. 1172.11 s [algebraic-graphs]
  23172. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  23173. 1172.11 s [algebraic-graphs] OK: overlays1 [x] == x
  23174. 1172.11 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  23175. 1172.11 s [algebraic-graphs]
  23176. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  23177. 1172.11 s [algebraic-graphs] OK: connects1 [x] == x
  23178. 1172.12 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  23179. 1172.12 s [algebraic-graphs]
  23180. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  23181. 1172.12 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  23182. 1172.12 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  23183. 1172.12 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  23184. 1172.12 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  23185. 1172.12 s [algebraic-graphs]
  23186. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  23187. 1172.12 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23188. 1172.12 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23189. 1172.12 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  23190. 1172.12 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23191. 1172.12 s [algebraic-graphs]
  23192. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  23193. 1172.12 s [algebraic-graphs] OK: x === x == True
  23194. 1172.12 s [algebraic-graphs] OK: x + y === x + y == True
  23195. 1172.12 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  23196. 1172.12 s [algebraic-graphs] OK: x + y === x * y == False
  23197. 1172.12 s [algebraic-graphs]
  23198. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  23199. 1172.12 s [algebraic-graphs] OK: size (vertex x) == 1
  23200. 1172.12 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23201. 1172.12 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23202. 1172.12 s [algebraic-graphs] OK: size x >= 1
  23203. 1172.12 s [algebraic-graphs] OK: size x >= vertexCount x
  23204. 1172.12 s [algebraic-graphs]
  23205. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  23206. 1172.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23207. 1172.12 s [algebraic-graphs]
  23208. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  23209. 1172.12 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23210. 1172.12 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23211. 1172.12 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23212. 1172.12 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23213. 1172.12 s [algebraic-graphs]
  23214. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  23215. 1172.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23216. 1172.12 s [algebraic-graphs] OK: vertexCount x >= 1
  23217. 1172.12 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  23218. 1172.12 s [algebraic-graphs]
  23219. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  23220. 1172.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23221. 1172.12 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23222. 1172.12 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23223. 1172.12 s [algebraic-graphs]
  23224. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  23225. 1172.12 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  23226. 1172.12 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  23227. 1172.12 s [algebraic-graphs]
  23228. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  23229. 1172.12 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23230. 1172.12 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23231. 1172.12 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23232. 1172.12 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  23233. 1172.12 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23234. 1172.12 s [algebraic-graphs]
  23235. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  23236. 1172.12 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23237. 1172.12 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23238. 1172.12 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  23239. 1172.12 s [algebraic-graphs]
  23240. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  23241. 1172.12 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23242. 1172.12 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23243. 1172.12 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  23244. 1172.12 s [algebraic-graphs]
  23245. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  23246. 1172.12 s [algebraic-graphs] OK: path1 [x] == vertex x
  23247. 1172.12 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  23248. 1172.12 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  23249. 1172.12 s [algebraic-graphs]
  23250. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  23251. 1172.12 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  23252. 1172.12 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  23253. 1172.12 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  23254. 1172.12 s [algebraic-graphs]
  23255. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  23256. 1172.12 s [algebraic-graphs] OK: clique1 [x] == vertex x
  23257. 1172.12 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  23258. 1172.12 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  23259. 1172.12 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  23260. 1172.12 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  23261. 1172.12 s [algebraic-graphs]
  23262. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  23263. 1172.12 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23264. 1172.12 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  23265. 1172.12 s [algebraic-graphs]
  23266. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  23267. 1172.12 s [algebraic-graphs] OK: star x [] == vertex x
  23268. 1172.12 s [algebraic-graphs] OK: star x [y] == edge x y
  23269. 1172.12 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23270. 1172.12 s [algebraic-graphs]
  23271. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  23272. 1172.12 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23273. 1172.12 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23274. 1172.12 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23275. 1172.12 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23276. 1172.12 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23277. 1172.12 s [algebraic-graphs]
  23278. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  23279. 1172.12 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23280. 1172.12 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23281. 1172.12 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23282. 1172.12 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23283. 1172.12 s [algebraic-graphs]
  23284. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  23285. 1172.12 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  23286. 1172.12 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  23287. 1172.12 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  23288. 1172.12 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  23289. 1172.12 s [algebraic-graphs]
  23290. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  23291. 1172.12 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  23292. 1172.12 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  23293. 1172.12 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  23294. 1172.12 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  23295. 1172.12 s [algebraic-graphs]
  23296. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  23297. 1172.12 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23298. 1172.12 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23299. 1172.12 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23300. 1172.12 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23301. 1172.12 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23302. 1172.12 s [algebraic-graphs]
  23303. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  23304. 1172.12 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23305. 1172.12 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23306. 1172.12 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23307. 1172.12 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23308. 1172.12 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  23309. 1172.12 s [algebraic-graphs]
  23310. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  23311. 1172.12 s [algebraic-graphs] OK: replaceVertex x x == id
  23312. 1172.12 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23313. 1172.12 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23314. 1172.12 s [algebraic-graphs]
  23315. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  23316. 1172.12 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23317. 1181.02 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23318. 1181.02 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23319. 1181.06 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23320. 1181.06 s [algebraic-graphs]
  23321. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  23322. 1181.06 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  23323. 1181.06 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  23324. 1181.06 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  23325. 1181.06 s [algebraic-graphs]
  23326. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  23327. 1181.06 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23328. 1181.06 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23329. 1181.06 s [algebraic-graphs] OK: transpose . transpose == id
  23330. 1181.06 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23331. 1181.06 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23332. 1181.06 s [algebraic-graphs]
  23333. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  23334. 1181.06 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23335. 1181.06 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23336. 1181.06 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23337. 1181.06 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23338. 1181.06 s [algebraic-graphs]
  23339. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  23340. 1181.06 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23341. 1181.06 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23342. 1181.06 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  23343. 1181.06 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  23344. 1181.06 s [algebraic-graphs]
  23345. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  23346. 1181.06 s [algebraic-graphs] OK: simplify == id
  23347. 1181.06 s [algebraic-graphs] OK: size (simplify x) <= size x
  23348. 1181.06 s [algebraic-graphs] OK: simplify 1 === 1
  23349. 1181.06 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  23350. 1181.06 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  23351. 1181.06 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  23352. 1181.06 s [algebraic-graphs]
  23353. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  23354. 1181.06 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  23355. 1181.06 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  23356. 1181.06 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  23357. 1181.06 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  23358. 1181.06 s [algebraic-graphs]
  23359. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  23360. 1181.06 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  23361. 1181.06 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  23362. 1181.06 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  23363. 1181.06 s [algebraic-graphs]
  23364. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  23365. 1181.06 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  23366. 1181.06 s [algebraic-graphs] OK: box x y ~~ box y x
  23367. 1181.06 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  23368. 1181.06 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  23369. 1181.06 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  23370. 1181.06 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23371. 1181.06 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  23372. 1181.06 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  23373. 1181.06 s [algebraic-graphs]
  23374. 1181.06 s [algebraic-graphs] ============ Relation ============
  23375. 1181.06 s [algebraic-graphs] OK: Axioms of graphs
  23376. 1181.06 s [algebraic-graphs]
  23377. 1181.06 s [algebraic-graphs] ============ Relation.consistent ============
  23378. 1181.06 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23379. 1181.06 s [algebraic-graphs]
  23380. 1181.06 s [algebraic-graphs] OK: consistent empty == True
  23381. 1181.06 s [algebraic-graphs] OK: consistent (vertex x) == True
  23382. 1181.06 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23383. 1181.06 s [algebraic-graphs] OK: consistent (connect x y) == True
  23384. 1181.06 s [algebraic-graphs] OK: consistent (edge x y) == True
  23385. 1181.06 s [algebraic-graphs] OK: consistent (edges xs) == True
  23386. 1181.06 s [algebraic-graphs] OK: consistent (stars xs) == True
  23387. 1181.06 s [algebraic-graphs]
  23388. 1181.06 s [algebraic-graphs] ============ Relation.Show ============
  23389. 1181.06 s [algebraic-graphs] OK: show (empty ) == "empty"
  23390. 1181.06 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23391. 1181.06 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23392. 1181.06 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23393. 1181.06 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23394. 1181.06 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23395. 1181.06 s [algebraic-graphs]
  23396. 1181.06 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23397. 1181.06 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23398. 1181.06 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23399. 1181.06 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23400. 1181.06 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23401. 1181.06 s [algebraic-graphs]
  23402. 1181.06 s [algebraic-graphs] ============ Relation.Ord ============
  23403. 1181.06 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23404. 1181.06 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23405. 1181.06 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23406. 1181.06 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23407. 1181.06 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23408. 1181.06 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23409. 1181.06 s [algebraic-graphs] OK: x <= x + y
  23410. 1181.06 s [algebraic-graphs] OK: x + y <= x * y
  23411. 1181.06 s [algebraic-graphs]
  23412. 1181.06 s [algebraic-graphs] ============ Relation.empty ============
  23413. 1181.06 s [algebraic-graphs] OK: isEmpty empty == True
  23414. 1181.06 s [algebraic-graphs] OK: hasVertex x empty == False
  23415. 1181.06 s [algebraic-graphs] OK: vertexCount empty == 0
  23416. 1181.06 s [algebraic-graphs] OK: edgeCount empty == 0
  23417. 1181.06 s [algebraic-graphs]
  23418. 1181.06 s [algebraic-graphs] ============ Relation.vertex ============
  23419. 1181.06 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23420. 1181.06 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23421. 1181.06 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23422. 1181.06 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23423. 1181.06 s [algebraic-graphs]
  23424. 1181.06 s [algebraic-graphs] ============ Relation.edge ============
  23425. 1181.06 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23426. 1181.06 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23427. 1181.06 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23428. 1181.06 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23429. 1181.06 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23430. 1181.06 s [algebraic-graphs]
  23431. 1181.06 s [algebraic-graphs] ============ Relation.overlay ============
  23432. 1181.06 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23433. 1181.06 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23434. 1181.06 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23435. 1181.06 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23436. 1181.06 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23437. 1181.06 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23438. 1181.06 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23439. 1181.06 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23440. 1181.06 s [algebraic-graphs]
  23441. 1181.06 s [algebraic-graphs] ============ Relation.connect ============
  23442. 1181.06 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23443. 1181.06 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23444. 1181.06 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23445. 1181.06 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23446. 1181.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23447. 1181.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23448. 1181.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23449. 1181.06 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23450. 1181.06 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23451. 1181.06 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23452. 1181.06 s [algebraic-graphs]
  23453. 1181.07 s [algebraic-graphs] ============ Relation.vertices ============
  23454. 1181.07 s [algebraic-graphs] OK: vertices [] == empty
  23455. 1181.07 s [algebraic-graphs] OK: vertices [x] == vertex x
  23456. 1181.07 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23457. 1181.07 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23458. 1181.07 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23459. 1181.07 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23460. 1181.07 s [algebraic-graphs]
  23461. 1181.07 s [algebraic-graphs] ============ Relation.edges ============
  23462. 1181.07 s [algebraic-graphs] OK: edges [] == empty
  23463. 1181.07 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23464. 1181.07 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23465. 1181.07 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23466. 1181.07 s [algebraic-graphs]
  23467. 1181.07 s [algebraic-graphs] ============ Relation.overlays ============
  23468. 1181.07 s [algebraic-graphs] OK: overlays [] == empty
  23469. 1181.07 s [algebraic-graphs] OK: overlays [x] == x
  23470. 1181.07 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23471. 1181.07 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23472. 1181.07 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23473. 1181.07 s [algebraic-graphs]
  23474. 1181.07 s [algebraic-graphs] ============ Relation.connects ============
  23475. 1181.07 s [algebraic-graphs] OK: connects [] == empty
  23476. 1181.07 s [algebraic-graphs] OK: connects [x] == x
  23477. 1181.07 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23478. 1181.07 s [algebraic-graphs] OK: connects == foldr connect empty
  23479. 1181.07 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23480. 1181.07 s [algebraic-graphs]
  23481. 1181.07 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23482. 1181.07 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23483. 1181.07 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23484. 1181.07 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23485. 1181.07 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23486. 1181.07 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23487. 1181.07 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23488. 1181.07 s [algebraic-graphs]
  23489. 1181.07 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23490. 1181.07 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23491. 1181.07 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23492. 1181.07 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23493. 1181.07 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23494. 1181.07 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23495. 1181.07 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23496. 1181.07 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23497. 1181.07 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23498. 1181.07 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23499. 1181.07 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23500. 1181.07 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23501. 1181.07 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23502. 1181.07 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23503. 1181.07 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23504. 1181.07 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23505. 1181.07 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23506. 1181.07 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23507. 1185.07 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23508. 1185.08 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23509. 1185.08 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23510. 1185.08 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23511. 1185.08 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23512. 1185.08 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23513. 1185.08 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23514. 1185.08 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23515. 1185.08 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23516. 1185.08 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23517. 1185.08 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23518. 1185.08 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23519. 1185.08 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23520. 1185.08 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23521. 1185.08 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23522. 1185.08 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23523. 1185.08 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23524. 1185.08 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23525. 1185.08 s [algebraic-graphs]
  23526. 1185.08 s [algebraic-graphs] ============ Relation.foldg ============
  23527. 1185.08 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23528. 1185.08 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23529. 1185.08 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23530. 1185.08 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23531. 1185.08 s [algebraic-graphs]
  23532. 1185.08 s [algebraic-graphs] ============ Relation.isEmpty ============
  23533. 1185.08 s [algebraic-graphs] OK: isEmpty empty == True
  23534. 1185.08 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23535. 1185.08 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23536. 1185.08 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23537. 1185.08 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23538. 1185.08 s [algebraic-graphs]
  23539. 1185.08 s [algebraic-graphs] ============ Relation.hasVertex ============
  23540. 1185.08 s [algebraic-graphs] OK: hasVertex x empty == False
  23541. 1185.08 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23542. 1185.08 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23543. 1185.08 s [algebraic-graphs]
  23544. 1185.08 s [algebraic-graphs] ============ Relation.hasEdge ============
  23545. 1185.08 s [algebraic-graphs] OK: hasEdge x y empty == False
  23546. 1185.08 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23547. 1185.08 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23548. 1185.08 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23549. 1185.08 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23550. 1185.08 s [algebraic-graphs]
  23551. 1185.08 s [algebraic-graphs] ============ Relation.vertexCount ============
  23552. 1185.08 s [algebraic-graphs] OK: vertexCount empty == 0
  23553. 1185.08 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23554. 1185.08 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23555. 1185.08 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23556. 1185.08 s [algebraic-graphs]
  23557. 1185.08 s [algebraic-graphs] ============ Relation.edgeCount ============
  23558. 1185.08 s [algebraic-graphs] OK: edgeCount empty == 0
  23559. 1185.08 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23560. 1185.08 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23561. 1185.08 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23562. 1185.08 s [algebraic-graphs]
  23563. 1185.08 s [algebraic-graphs] ============ Relation.vertexList ============
  23564. 1185.08 s [algebraic-graphs] OK: vertexList empty == []
  23565. 1185.08 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23566. 1185.08 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23567. 1185.08 s [algebraic-graphs]
  23568. 1185.08 s [algebraic-graphs] ============ Relation.vertexSet ============
  23569. 1185.08 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23570. 1185.08 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23571. 1185.08 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23572. 1185.08 s [algebraic-graphs]
  23573. 1185.08 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23574. 1185.08 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23575. 1185.08 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23576. 1185.08 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23577. 1185.08 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23578. 1185.08 s [algebraic-graphs]
  23579. 1185.08 s [algebraic-graphs] ============ Relation.edgeList ============
  23580. 1185.08 s [algebraic-graphs] OK: edgeList empty == []
  23581. 1185.08 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23582. 1185.08 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23583. 1185.08 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23584. 1185.08 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23585. 1185.08 s [algebraic-graphs]
  23586. 1185.08 s [algebraic-graphs] ============ Relation.edgeSet ============
  23587. 1185.08 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23588. 1185.08 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23589. 1185.08 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23590. 1185.08 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23591. 1185.08 s [algebraic-graphs]
  23592. 1185.08 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23593. 1185.08 s [algebraic-graphs] OK: adjacencyList empty == []
  23594. 1185.08 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23595. 1185.08 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23596. 1185.08 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23597. 1185.08 s [algebraic-graphs]
  23598. 1185.08 s [algebraic-graphs] ============ Relation.preSet ============
  23599. 1185.08 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23600. 1185.08 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23601. 1185.08 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23602. 1185.08 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23603. 1185.08 s [algebraic-graphs]
  23604. 1185.08 s [algebraic-graphs] ============ Relation.preIntSet ============
  23605. 1185.08 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23606. 1185.08 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23607. 1185.08 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23608. 1185.08 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23609. 1185.08 s [algebraic-graphs]
  23610. 1185.08 s [algebraic-graphs] ============ Relation.postSet ============
  23611. 1185.08 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23612. 1185.08 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23613. 1185.08 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23614. 1185.08 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23615. 1185.08 s [algebraic-graphs]
  23616. 1185.08 s [algebraic-graphs] ============ Relation.postIntSet ============
  23617. 1185.08 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23618. 1185.08 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23619. 1185.08 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23620. 1185.08 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23621. 1185.08 s [algebraic-graphs]
  23622. 1185.08 s [algebraic-graphs] ============ Relation.path ============
  23623. 1185.08 s [algebraic-graphs] OK: path [] == empty
  23624. 1185.08 s [algebraic-graphs] OK: path [x] == vertex x
  23625. 1185.08 s [algebraic-graphs] OK: path [x,y] == edge x y
  23626. 1185.08 s [algebraic-graphs]
  23627. 1185.08 s [algebraic-graphs] ============ Relation.circuit ============
  23628. 1185.08 s [algebraic-graphs] OK: circuit [] == empty
  23629. 1185.08 s [algebraic-graphs] OK: circuit [x] == edge x x
  23630. 1185.08 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23631. 1185.08 s [algebraic-graphs]
  23632. 1185.08 s [algebraic-graphs] ============ Relation.clique ============
  23633. 1185.08 s [algebraic-graphs] OK: clique [] == empty
  23634. 1185.08 s [algebraic-graphs] OK: clique [x] == vertex x
  23635. 1185.08 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23636. 1185.08 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23637. 1185.08 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23638. 1185.08 s [algebraic-graphs]
  23639. 1185.08 s [algebraic-graphs] ============ Relation.biclique ============
  23640. 1185.08 s [algebraic-graphs] OK: biclique [] [] == empty
  23641. 1185.08 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23642. 1185.08 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23643. 1185.08 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23644. 1185.08 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23645. 1185.08 s [algebraic-graphs]
  23646. 1185.08 s [algebraic-graphs] ============ Relation.star ============
  23647. 1185.08 s [algebraic-graphs] OK: star x [] == vertex x
  23648. 1185.08 s [algebraic-graphs] OK: star x [y] == edge x y
  23649. 1185.08 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23650. 1185.08 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23651. 1185.08 s [algebraic-graphs]
  23652. 1185.08 s [algebraic-graphs] ============ Relation.stars ============
  23653. 1185.08 s [algebraic-graphs] OK: stars [] == empty
  23654. 1185.08 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23655. 1185.08 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23656. 1185.08 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23657. 1185.08 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23658. 1185.08 s [algebraic-graphs] OK: stars . adjacencyList == id
  23659. 1185.08 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23660. 1185.08 s [algebraic-graphs]
  23661. 1185.08 s [algebraic-graphs] ============ Relation.tree ============
  23662. 1185.08 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23663. 1185.08 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23664. 1185.08 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23665. 1185.08 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23666. 1185.08 s [algebraic-graphs]
  23667. 1185.08 s [algebraic-graphs] ============ Relation.forest ============
  23668. 1185.08 s [algebraic-graphs] OK: forest [] == empty
  23669. 1185.08 s [algebraic-graphs] OK: forest [x] == tree x
  23670. 1185.08 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23671. 1185.08 s [algebraic-graphs] OK: forest == overlays . map tree
  23672. 1185.08 s [algebraic-graphs]
  23673. 1185.08 s [algebraic-graphs] ============ Relation.removeVertex ============
  23674. 1185.08 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23675. 1185.08 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23676. 1185.08 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23677. 1185.08 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23678. 1185.08 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23679. 1185.08 s [algebraic-graphs]
  23680. 1185.08 s [algebraic-graphs] ============ Relation.removeEdge ============
  23681. 1185.08 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23682. 1185.08 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23683. 1185.08 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23684. 1185.08 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23685. 1185.08 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23686. 1185.08 s [algebraic-graphs]
  23687. 1185.08 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23688. 1185.08 s [algebraic-graphs] OK: replaceVertex x x == id
  23689. 1185.08 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23690. 1185.08 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23691. 1185.08 s [algebraic-graphs]
  23692. 1185.08 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23693. 1185.08 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23694. 1220.75 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23695. 1220.75 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23696. 1220.80 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23697. 1220.80 s [algebraic-graphs]
  23698. 1220.80 s [algebraic-graphs] ============ Relation.transpose ============
  23699. 1220.80 s [algebraic-graphs] OK: transpose empty == empty
  23700. 1220.80 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23701. 1220.80 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23702. 1220.80 s [algebraic-graphs] OK: transpose . transpose == id
  23703. 1220.80 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23704. 1220.80 s [algebraic-graphs]
  23705. 1220.80 s [algebraic-graphs] ============ Relation.gmap ============
  23706. 1220.80 s [algebraic-graphs] OK: gmap f empty == empty
  23707. 1220.80 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23708. 1220.80 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23709. 1220.80 s [algebraic-graphs] OK: gmap id == id
  23710. 1220.80 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23711. 1220.80 s [algebraic-graphs]
  23712. 1220.80 s [algebraic-graphs] ============ Relation.induce ============
  23713. 1220.80 s [algebraic-graphs] OK: induce (const True ) x == x
  23714. 1220.80 s [algebraic-graphs] OK: induce (const False) x == empty
  23715. 1220.80 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23716. 1220.80 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23717. 1220.80 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23718. 1220.80 s [algebraic-graphs]
  23719. 1220.80 s [algebraic-graphs] ============ Relation.compose ============
  23720. 1220.80 s [algebraic-graphs] OK: compose empty x == empty
  23721. 1220.80 s [algebraic-graphs] OK: compose x empty == empty
  23722. 1220.80 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23723. 1220.80 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23724. 1220.80 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23725. 1220.80 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23726. 1220.80 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23727. 1220.80 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23728. 1220.80 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23729. 1220.80 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23730. 1220.80 s [algebraic-graphs]
  23731. 1220.80 s [algebraic-graphs] ============ Relation.closure ============
  23732. 1220.80 s [algebraic-graphs] OK: closure empty == empty
  23733. 1220.80 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23734. 1220.80 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23735. 1220.80 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23736. 1220.80 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23737. 1220.80 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23738. 1220.80 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23739. 1220.80 s [algebraic-graphs] OK: closure . closure == closure
  23740. 1220.80 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23741. 1220.80 s [algebraic-graphs]
  23742. 1220.80 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23743. 1220.80 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23744. 1220.80 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23745. 1220.80 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23746. 1220.80 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23747. 1220.80 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23748. 1220.80 s [algebraic-graphs]
  23749. 1220.80 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23750. 1220.80 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23751. 1220.80 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23752. 1220.80 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23753. 1220.80 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23754. 1220.80 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23755. 1220.80 s [algebraic-graphs]
  23756. 1220.80 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23757. 1220.80 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23758. 1220.80 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23759. 1220.80 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23760. 1220.80 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23761. 1220.80 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23762. 1220.80 s [algebraic-graphs]
  23763. 1220.80 s [algebraic-graphs] ============ Relation.induceJust ============
  23764. 1220.80 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23765. 1220.80 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23766. 1220.80 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23767. 1220.80 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23768. 1220.80 s [algebraic-graphs]
  23769. 1220.80 s [algebraic-graphs] ============ ReflexiveRelation ============
  23770. 1220.80 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23771. 1220.80 s [algebraic-graphs]
  23772. 1220.80 s [algebraic-graphs] ============ TransitiveRelation ============
  23773. 1220.80 s [algebraic-graphs] OK: Axioms of transitive graphs
  23774. 1220.80 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23775. 1220.80 s [algebraic-graphs]
  23776. 1220.80 s [algebraic-graphs] ============ PreorderRelation ============
  23777. 1220.80 s [algebraic-graphs] OK: Axioms of preorder graphs
  23778. 1220.80 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23779. 1220.80 s [algebraic-graphs]
  23780. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation ============
  23781. 1220.80 s [algebraic-graphs] OK: Axioms of undirected graphs
  23782. 1220.80 s [algebraic-graphs]
  23783. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23784. 1220.80 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23785. 1220.80 s [algebraic-graphs]
  23786. 1220.80 s [algebraic-graphs] OK: consistent empty == True
  23787. 1220.80 s [algebraic-graphs] OK: consistent (vertex x) == True
  23788. 1220.80 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23789. 1220.80 s [algebraic-graphs] OK: consistent (connect x y) == True
  23790. 1220.80 s [algebraic-graphs] OK: consistent (edge x y) == True
  23791. 1220.80 s [algebraic-graphs] OK: consistent (edges xs) == True
  23792. 1220.80 s [algebraic-graphs] OK: consistent (stars xs) == True
  23793. 1220.80 s [algebraic-graphs]
  23794. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23795. 1220.80 s [algebraic-graphs] OK: show (empty ) == "empty"
  23796. 1220.80 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23797. 1220.80 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23798. 1220.80 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23799. 1220.80 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23800. 1220.80 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23801. 1220.80 s [algebraic-graphs]
  23802. 1220.80 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23803. 1220.80 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23804. 1220.80 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23805. 1220.80 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23806. 1220.80 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23807. 1220.80 s [algebraic-graphs]
  23808. 1220.80 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23809. 1220.80 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23810. 1220.80 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23811. 1220.80 s [algebraic-graphs]
  23812. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23813. 1220.80 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23814. 1220.80 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23815. 1220.80 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23816. 1220.80 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23817. 1220.80 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23818. 1220.80 s [algebraic-graphs]
  23819. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23820. 1220.80 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23821. 1220.80 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23822. 1220.80 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23823. 1220.80 s [algebraic-graphs]
  23824. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23825. 1220.80 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23826. 1220.80 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23827. 1220.80 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23828. 1220.80 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23829. 1220.80 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23830. 1220.80 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23831. 1220.80 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23832. 1220.80 s [algebraic-graphs] OK: x <= x + y
  23833. 1220.80 s [algebraic-graphs] OK: x + y <= x * y
  23834. 1220.80 s [algebraic-graphs]
  23835. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23836. 1220.80 s [algebraic-graphs] OK: isEmpty empty == True
  23837. 1220.80 s [algebraic-graphs] OK: hasVertex x empty == False
  23838. 1220.80 s [algebraic-graphs] OK: vertexCount empty == 0
  23839. 1220.80 s [algebraic-graphs] OK: edgeCount empty == 0
  23840. 1220.80 s [algebraic-graphs]
  23841. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23842. 1220.80 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23843. 1220.80 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23844. 1220.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23845. 1220.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23846. 1220.80 s [algebraic-graphs]
  23847. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23848. 1220.80 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23849. 1220.80 s [algebraic-graphs] OK: edge x y == edge y x
  23850. 1220.80 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23851. 1220.80 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23852. 1220.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23853. 1220.80 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23854. 1220.80 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23855. 1220.80 s [algebraic-graphs]
  23856. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23857. 1220.80 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23858. 1220.80 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23859. 1220.80 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23860. 1220.80 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23861. 1220.80 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23862. 1220.80 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23863. 1220.80 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23864. 1220.80 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23865. 1220.80 s [algebraic-graphs]
  23866. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23867. 1220.80 s [algebraic-graphs] OK: connect x y == connect y x
  23868. 1220.80 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23869. 1220.80 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23870. 1220.80 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23871. 1220.80 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23872. 1220.80 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23873. 1220.80 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23874. 1220.80 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23875. 1220.81 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23876. 1220.81 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23877. 1220.81 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23878. 1220.81 s [algebraic-graphs]
  23879. 1220.81 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23880. 1220.81 s [algebraic-graphs] OK: vertices [] == empty
  23881. 1220.81 s [algebraic-graphs] OK: vertices [x] == vertex x
  23882. 1220.81 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23883. 1220.81 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23884. 1220.81 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23885. 1220.81 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23886. 1220.81 s [algebraic-graphs]
  23887. 1220.81 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23888. 1220.81 s [algebraic-graphs] OK: edges [] == empty
  23889. 1220.81 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23890. 1220.81 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23891. 1220.81 s [algebraic-graphs]
  23892. 1220.81 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23893. 1220.81 s [algebraic-graphs] OK: overlays [] == empty
  23894. 1239.01 s [algebraic-graphs] OK: overlays [x] == x
  23895. 1239.09 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23896. 1239.09 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23897. 1239.09 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23898. 1239.09 s [algebraic-graphs]
  23899. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23900. 1239.09 s [algebraic-graphs] OK: connects [] == empty
  23901. 1239.09 s [algebraic-graphs] OK: connects [x] == x
  23902. 1239.09 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23903. 1239.09 s [algebraic-graphs] OK: connects == foldr connect empty
  23904. 1239.09 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23905. 1239.09 s [algebraic-graphs] OK: connects == connects . reverse
  23906. 1239.09 s [algebraic-graphs]
  23907. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23908. 1239.09 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23909. 1239.09 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23910. 1239.09 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23911. 1239.09 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23912. 1239.09 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23913. 1239.09 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23914. 1239.09 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23915. 1239.09 s [algebraic-graphs]
  23916. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23917. 1239.09 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23918. 1239.09 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23919. 1239.09 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23920. 1239.09 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23921. 1239.09 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23922. 1239.09 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23923. 1239.09 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23924. 1239.09 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23925. 1239.09 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23926. 1239.09 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23927. 1239.09 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23928. 1239.09 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23929. 1239.09 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23930. 1239.09 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23931. 1239.09 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23932. 1239.09 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23933. 1239.09 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23934. 1239.09 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23935. 1239.09 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23936. 1239.09 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23937. 1239.09 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23938. 1239.09 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23939. 1239.09 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23940. 1239.09 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23941. 1239.09 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23942. 1239.09 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23943. 1239.09 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23944. 1239.09 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23945. 1239.09 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23946. 1239.09 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23947. 1239.09 s [algebraic-graphs]
  23948. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23949. 1239.09 s [algebraic-graphs] OK: isEmpty empty == True
  23950. 1239.09 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23951. 1239.09 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23952. 1239.09 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23953. 1239.09 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23954. 1239.09 s [algebraic-graphs]
  23955. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23956. 1239.09 s [algebraic-graphs] OK: hasVertex x empty == False
  23957. 1239.09 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23958. 1239.09 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23959. 1239.09 s [algebraic-graphs]
  23960. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23961. 1239.09 s [algebraic-graphs] OK: hasEdge x y empty == False
  23962. 1239.09 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23963. 1239.09 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23964. 1239.09 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23965. 1239.09 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23966. 1239.09 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23967. 1239.09 s [algebraic-graphs]
  23968. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23969. 1239.09 s [algebraic-graphs] OK: vertexCount empty == 0
  23970. 1239.09 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23971. 1239.09 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23972. 1239.09 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23973. 1239.09 s [algebraic-graphs]
  23974. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23975. 1239.09 s [algebraic-graphs] OK: edgeCount empty == 0
  23976. 1239.09 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23977. 1239.09 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23978. 1239.09 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23979. 1239.09 s [algebraic-graphs]
  23980. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23981. 1239.09 s [algebraic-graphs] OK: vertexList empty == []
  23982. 1239.09 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23983. 1239.09 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23984. 1239.09 s [algebraic-graphs]
  23985. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23986. 1239.09 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23987. 1239.09 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23988. 1239.09 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23989. 1239.09 s [algebraic-graphs]
  23990. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23991. 1239.09 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23992. 1239.09 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23993. 1239.09 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23994. 1239.09 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23995. 1239.09 s [algebraic-graphs]
  23996. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23997. 1239.09 s [algebraic-graphs] OK: edgeList empty == []
  23998. 1239.09 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23999. 1239.09 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  24000. 1239.09 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  24001. 1239.09 s [algebraic-graphs]
  24002. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  24003. 1239.09 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  24004. 1239.09 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  24005. 1239.09 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  24006. 1239.09 s [algebraic-graphs]
  24007. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  24008. 1239.09 s [algebraic-graphs] OK: adjacencyList empty == []
  24009. 1239.09 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  24010. 1239.09 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  24011. 1239.09 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  24012. 1239.09 s [algebraic-graphs]
  24013. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  24014. 1239.09 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  24015. 1239.09 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  24016. 1239.09 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  24017. 1239.09 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  24018. 1239.09 s [algebraic-graphs]
  24019. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  24020. 1239.09 s [algebraic-graphs] OK: path [] == empty
  24021. 1239.09 s [algebraic-graphs] OK: path [x] == vertex x
  24022. 1239.09 s [algebraic-graphs] OK: path [x,y] == edge x y
  24023. 1239.09 s [algebraic-graphs] OK: path == path . reverse
  24024. 1239.09 s [algebraic-graphs]
  24025. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  24026. 1239.09 s [algebraic-graphs] OK: circuit [] == empty
  24027. 1239.09 s [algebraic-graphs] OK: circuit [x] == edge x x
  24028. 1239.09 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24029. 1239.09 s [algebraic-graphs] OK: circuit == circuit . reverse
  24030. 1239.09 s [algebraic-graphs]
  24031. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  24032. 1239.09 s [algebraic-graphs] OK: clique [] == empty
  24033. 1239.09 s [algebraic-graphs] OK: clique [x] == vertex x
  24034. 1239.09 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24035. 1239.09 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24036. 1239.09 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24037. 1239.09 s [algebraic-graphs] OK: clique == clique . reverse
  24038. 1239.09 s [algebraic-graphs]
  24039. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  24040. 1239.09 s [algebraic-graphs] OK: biclique [] [] == empty
  24041. 1239.09 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24042. 1239.09 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24043. 1239.09 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24044. 1239.09 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24045. 1239.09 s [algebraic-graphs]
  24046. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  24047. 1239.09 s [algebraic-graphs] OK: star x [] == vertex x
  24048. 1239.09 s [algebraic-graphs] OK: star x [y] == edge x y
  24049. 1239.09 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24050. 1239.09 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24051. 1239.09 s [algebraic-graphs]
  24052. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  24053. 1239.09 s [algebraic-graphs] OK: stars [] == empty
  24054. 1239.09 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24055. 1239.09 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24056. 1239.09 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24057. 1239.09 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24058. 1239.09 s [algebraic-graphs] OK: stars . adjacencyList == id
  24059. 1239.09 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24060. 1239.09 s [algebraic-graphs]
  24061. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  24062. 1239.09 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24063. 1239.09 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24064. 1239.09 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24065. 1239.09 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24066. 1239.09 s [algebraic-graphs]
  24067. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  24068. 1239.09 s [algebraic-graphs] OK: forest [] == empty
  24069. 1246.69 s [algebraic-graphs] OK: forest [x] == tree x
  24070. 1246.69 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24071. 1246.73 s [algebraic-graphs] OK: forest == overlays . map tree
  24072. 1246.73 s [algebraic-graphs]
  24073. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  24074. 1246.73 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24075. 1246.73 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24076. 1246.73 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24077. 1246.73 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24078. 1246.73 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24079. 1246.73 s [algebraic-graphs]
  24080. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  24081. 1246.73 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24082. 1246.73 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24083. 1246.73 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24084. 1246.73 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24085. 1246.73 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24086. 1246.73 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24087. 1246.73 s [algebraic-graphs]
  24088. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  24089. 1246.73 s [algebraic-graphs] OK: replaceVertex x x == id
  24090. 1246.73 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24091. 1246.73 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24092. 1246.73 s [algebraic-graphs]
  24093. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  24094. 1246.73 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24095. 1246.73 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24096. 1246.73 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24097. 1246.73 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24098. 1246.73 s [algebraic-graphs]
  24099. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  24100. 1246.73 s [algebraic-graphs] OK: gmap f empty == empty
  24101. 1246.73 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24102. 1246.73 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24103. 1246.73 s [algebraic-graphs] OK: gmap id == id
  24104. 1246.73 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24105. 1246.73 s [algebraic-graphs]
  24106. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  24107. 1246.73 s [algebraic-graphs] OK: induce (const True ) x == x
  24108. 1246.73 s [algebraic-graphs] OK: induce (const False) x == empty
  24109. 1246.73 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24110. 1246.73 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24111. 1246.73 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24112. 1246.73 s [algebraic-graphs]
  24113. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  24114. 1246.73 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24115. 1246.73 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24116. 1246.73 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24117. 1246.73 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24118. 1246.73 s [algebraic-graphs]
  24119. 1246.73 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  24120. 1246.73 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  24121. 1246.73 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  24122. 1246.73 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  24123. 1246.73 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  24124. 1246.73 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  24125. 1246.73 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  24126. 1246.73 s [algebraic-graphs]
  24127. 1246.73 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  24128. 1246.73 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  24129. 1246.73 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  24130. 1246.73 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  24131. 1246.73 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  24132. 1246.73 s [algebraic-graphs]
  24133. 1246.74 s [algebraic-graphs] ============ Typed ============
  24134. 1246.74 s [algebraic-graphs]
  24135. 1246.74 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  24136. 1246.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24137. 1246.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24138. 1246.74 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  24139. 1246.74 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24140. 1246.74 s [algebraic-graphs]
  24141. 1246.74 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  24142. 1246.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24143. 1246.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24144. 1246.74 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  24145. 1246.74 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24146. 1246.74 s [algebraic-graphs]
  24147. 1246.74 s [algebraic-graphs] ============ Typed.dfsForest ============
  24148. 1246.74 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  24149. 1246.74 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  24150. 1246.74 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  24151. 1246.74 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  24152. 1246.74 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  24153. 1246.74 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  24154. 1246.74 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  24155. 1246.74 s [algebraic-graphs]
  24156. 1246.74 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  24157. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  24158. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  24159. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  24160. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  24161. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  24162. 1246.74 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  24163. 1246.74 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  24164. 1246.74 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  24165. 1246.74 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  24166. 1246.74 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  24167. 1246.74 s [algebraic-graphs]
  24168. 1246.74 s [algebraic-graphs] ============ Typed.dfs ============
  24169. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  24170. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  24171. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  24172. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  24173. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  24174. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  24175. 1246.74 s [algebraic-graphs] OK: dfs % x $ [] == []
  24176. 1246.74 s [algebraic-graphs]
  24177. 1246.74 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  24178. 1246.74 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  24179. 1246.74 s [algebraic-graphs]
  24180. 1246.74 s [algebraic-graphs] ============ Typed.topSort ============
  24181. 1246.74 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  24182. 1246.74 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  24183. 1246.74 s [algebraic-graphs]
  24184. 1246.74 s [algebraic-graphs] ============ Graph.Undirected ============
  24185. 1246.74 s [algebraic-graphs] OK: Axioms of undirected graphs
  24186. 1246.74 s [algebraic-graphs]
  24187. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  24188. 1246.74 s [algebraic-graphs] OK: show (empty ) == "empty"
  24189. 1246.74 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  24190. 1246.74 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  24191. 1246.74 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  24192. 1246.74 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  24193. 1246.74 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  24194. 1246.74 s [algebraic-graphs]
  24195. 1246.74 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  24196. 1246.74 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  24197. 1246.74 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  24198. 1246.74 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  24199. 1246.74 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  24200. 1246.74 s [algebraic-graphs]
  24201. 1246.74 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  24202. 1246.74 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  24203. 1246.74 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  24204. 1246.74 s [algebraic-graphs]
  24205. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  24206. 1246.74 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  24207. 1246.74 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24208. 1246.74 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  24209. 1246.74 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  24210. 1246.74 s [algebraic-graphs]
  24211. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  24212. 1246.74 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  24213. 1246.74 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24214. 1246.74 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  24215. 1246.74 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  24216. 1246.74 s [algebraic-graphs]
  24217. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  24218. 1246.74 s [algebraic-graphs] OK: complement empty == empty
  24219. 1246.74 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  24220. 1246.74 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  24221. 1246.74 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  24222. 1246.74 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  24223. 1246.74 s [algebraic-graphs] OK: complement . complement == id
  24224. 1246.74 s [algebraic-graphs]
  24225. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  24226. 1246.74 s [algebraic-graphs] OK: vertex 1 < vertex 2
  24227. 1246.74 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  24228. 1246.74 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  24229. 1246.74 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  24230. 1246.74 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  24231. 1246.74 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  24232. 1246.74 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  24233. 1246.74 s [algebraic-graphs] OK: x <= x + y
  24234. 1246.74 s [algebraic-graphs] OK: x + y <= x * y
  24235. 1246.74 s [algebraic-graphs]
  24236. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  24237. 1246.74 s [algebraic-graphs] OK: isEmpty empty == True
  24238. 1246.74 s [algebraic-graphs] OK: hasVertex x empty == False
  24239. 1246.74 s [algebraic-graphs] OK: vertexCount empty == 0
  24240. 1246.74 s [algebraic-graphs] OK: edgeCount empty == 0
  24241. 1246.74 s [algebraic-graphs]
  24242. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  24243. 1246.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24244. 1246.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24245. 1246.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24246. 1246.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24247. 1246.74 s [algebraic-graphs]
  24248. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  24249. 1246.74 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  24250. 1246.74 s [algebraic-graphs] OK: edge x y == edge y x
  24251. 1256.33 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  24252. 1256.33 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24253. 1256.33 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24254. 1256.37 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  24255. 1256.37 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  24256. 1256.37 s [algebraic-graphs]
  24257. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  24258. 1256.37 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  24259. 1256.37 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  24260. 1256.37 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  24261. 1256.37 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  24262. 1256.37 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  24263. 1256.37 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24264. 1256.37 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  24265. 1256.37 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  24266. 1256.37 s [algebraic-graphs]
  24267. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  24268. 1256.37 s [algebraic-graphs] OK: connect x y == connect y x
  24269. 1256.37 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  24270. 1256.37 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  24271. 1256.37 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  24272. 1256.37 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  24273. 1256.37 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  24274. 1256.37 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  24275. 1256.37 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  24276. 1256.37 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  24277. 1256.37 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  24278. 1256.37 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  24279. 1256.37 s [algebraic-graphs]
  24280. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  24281. 1256.37 s [algebraic-graphs] OK: vertices [] == empty
  24282. 1256.37 s [algebraic-graphs] OK: vertices [x] == vertex x
  24283. 1256.37 s [algebraic-graphs] OK: vertices == overlays . map vertex
  24284. 1256.37 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  24285. 1256.37 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  24286. 1256.37 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24287. 1256.37 s [algebraic-graphs]
  24288. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  24289. 1256.37 s [algebraic-graphs] OK: edges [] == empty
  24290. 1256.37 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  24291. 1256.37 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  24292. 1256.37 s [algebraic-graphs]
  24293. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  24294. 1256.37 s [algebraic-graphs] OK: overlays [] == empty
  24295. 1256.37 s [algebraic-graphs] OK: overlays [x] == x
  24296. 1256.37 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  24297. 1256.37 s [algebraic-graphs] OK: overlays == foldr overlay empty
  24298. 1256.37 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  24299. 1256.37 s [algebraic-graphs]
  24300. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  24301. 1256.37 s [algebraic-graphs] OK: connects [] == empty
  24302. 1256.37 s [algebraic-graphs] OK: connects [x] == x
  24303. 1256.37 s [algebraic-graphs] OK: connects [x,y] == connect x y
  24304. 1256.37 s [algebraic-graphs] OK: connects == foldr connect empty
  24305. 1256.37 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  24306. 1256.37 s [algebraic-graphs] OK: connects == connects . reverse
  24307. 1256.37 s [algebraic-graphs]
  24308. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  24309. 1256.37 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  24310. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  24311. 1256.37 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  24312. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  24313. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  24314. 1256.37 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  24315. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  24316. 1256.37 s [algebraic-graphs]
  24317. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.path ============
  24318. 1256.37 s [algebraic-graphs] OK: path [] == empty
  24319. 1256.37 s [algebraic-graphs] OK: path [x] == vertex x
  24320. 1256.37 s [algebraic-graphs] OK: path [x,y] == edge x y
  24321. 1256.37 s [algebraic-graphs] OK: path == path . reverse
  24322. 1256.37 s [algebraic-graphs]
  24323. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  24324. 1256.37 s [algebraic-graphs] OK: circuit [] == empty
  24325. 1256.37 s [algebraic-graphs] OK: circuit [x] == edge x x
  24326. 1256.37 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24327. 1256.37 s [algebraic-graphs] OK: circuit == circuit . reverse
  24328. 1256.37 s [algebraic-graphs]
  24329. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  24330. 1256.37 s [algebraic-graphs] OK: clique [] == empty
  24331. 1256.37 s [algebraic-graphs] OK: clique [x] == vertex x
  24332. 1256.37 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24333. 1256.37 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24334. 1256.37 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24335. 1256.37 s [algebraic-graphs] OK: clique == clique . reverse
  24336. 1256.37 s [algebraic-graphs]
  24337. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  24338. 1256.37 s [algebraic-graphs] OK: biclique [] [] == empty
  24339. 1256.37 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24340. 1256.37 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24341. 1256.37 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24342. 1256.37 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24343. 1256.37 s [algebraic-graphs]
  24344. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.star ============
  24345. 1256.37 s [algebraic-graphs] OK: star x [] == vertex x
  24346. 1256.37 s [algebraic-graphs] OK: star x [y] == edge x y
  24347. 1256.37 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24348. 1256.37 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24349. 1256.37 s [algebraic-graphs]
  24350. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  24351. 1256.37 s [algebraic-graphs] OK: stars [] == empty
  24352. 1256.37 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24353. 1256.37 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24354. 1256.37 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24355. 1256.37 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24356. 1256.37 s [algebraic-graphs] OK: stars . adjacencyList == id
  24357. 1256.37 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24358. 1256.37 s [algebraic-graphs]
  24359. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  24360. 1256.37 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24361. 1256.37 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24362. 1256.37 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24363. 1256.37 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24364. 1256.37 s [algebraic-graphs]
  24365. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  24366. 1256.37 s [algebraic-graphs] OK: forest [] == empty
  24367. 1256.37 s [algebraic-graphs] OK: forest [x] == tree x
  24368. 1256.37 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24369. 1256.37 s [algebraic-graphs] OK: forest == overlays . map tree
  24370. 1256.37 s [algebraic-graphs]
  24371. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  24372. 1256.37 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24373. 1256.37 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24374. 1256.37 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24375. 1256.37 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24376. 1256.37 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24377. 1256.37 s [algebraic-graphs]
  24378. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  24379. 1256.37 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24380. 1256.37 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24381. 1256.37 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24382. 1256.37 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24383. 1256.37 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24384. 1256.37 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24385. 1256.37 s [algebraic-graphs]
  24386. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  24387. 1256.37 s [algebraic-graphs] OK: replaceVertex x x == id
  24388. 1256.37 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24389. 1256.37 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24390. 1256.37 s [algebraic-graphs]
  24391. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  24392. 1256.37 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24393. 1256.37 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24394. 1256.37 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24395. 1256.37 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24396. 1256.37 s [algebraic-graphs]
  24397. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24398. 1256.37 s [algebraic-graphs] OK: gmap f empty == empty
  24399. 1256.37 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24400. 1256.37 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24401. 1256.37 s [algebraic-graphs] OK: gmap id == id
  24402. 1256.37 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24403. 1256.37 s [algebraic-graphs]
  24404. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24405. 1256.37 s [algebraic-graphs] OK: induce (const True ) x == x
  24406. 1256.37 s [algebraic-graphs] OK: induce (const False) x == empty
  24407. 1256.37 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24408. 1256.37 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24409. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24410. 1256.37 s [algebraic-graphs]
  24411. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24412. 1256.37 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24413. 1256.37 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24414. 1256.37 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24415. 1256.37 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24416. 1256.37 s [algebraic-graphs] Test suite main: PASS
  24417. 1256.37 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24418. 1256.37 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24419. 1256.37 s [algebraic-graphs] checkPhase completed in 3 minutes 1 seconds
  24420. 1256.37 s [algebraic-graphs] Phase: haddockPhase
  24421. 1256.50 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  24422. 1256.51 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  24423. 1256.56 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  24424. 1256.96 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24425. 1257.08 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24426. 1257.27 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24427. 1257.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24428. 1257.27 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24429. 1257.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24430. 1257.27 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24431. 1257.27 s [algebraic-graphs] Missing documentation for:
  24432. 1257.27 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24433. 1257.32 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24434. 1257.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24435. 1257.32 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24436. 1257.42 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24437. 1257.58 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24438. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24439. 1257.58 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24440. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24441. 1257.58 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24442. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24443. 1257.58 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24444. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24445. 1257.58 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24446. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24447. 1257.59 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24448. 1257.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24449. 1257.59 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24450. 1257.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24451. 1257.59 s [algebraic-graphs] Warning: 'box' is out of scope.
  24452. 1257.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24453. 1257.59 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24454. 1257.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24455. 1257.59 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24456. 1257.68 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24457. 1257.68 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24458. 1257.70 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24459. 1257.81 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24460. 1257.81 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24461. 1257.81 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24462. 1258.09 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24463. 1258.24 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24464. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24465. 1258.24 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24466. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24467. 1258.24 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24468. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24469. 1258.24 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24470. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24471. 1258.24 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24472. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24473. 1258.25 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24474. 1258.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24475. 1258.25 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24476. 1258.37 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24477. 1258.37 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24478. 1258.37 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24479. 1258.37 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24480. 1258.38 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24481. 1258.38 s [algebraic-graphs] Missing documentation for:
  24482. 1258.38 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24483. 1258.62 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24484. 1258.68 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24485. 1258.75 s [algebraic-graphs]
  24486. 1258.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24487. 1258.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24488. 1258.76 s [algebraic-graphs] will become an error in a future GHC release.
  24489. 1258.76 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24490. 1258.76 s [algebraic-graphs] |
  24491. 1258.76 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24492. 1258.76 s [algebraic-graphs] | ^
  24493. 1258.76 s [algebraic-graphs]
  24494. 1258.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24495. 1258.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24496. 1258.76 s [algebraic-graphs] will become an error in a future GHC release.
  24497. 1258.76 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24498. 1258.76 s [algebraic-graphs] |
  24499. 1258.76 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24500. 1258.76 s [algebraic-graphs] | ^
  24501. 1258.76 s [algebraic-graphs]
  24502. 1258.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24503. 1258.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24504. 1258.76 s [algebraic-graphs] will become an error in a future GHC release.
  24505. 1258.76 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24506. 1258.76 s [algebraic-graphs] |
  24507. 1258.76 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24508. 1258.76 s [algebraic-graphs] | ^
  24509. 1258.76 s [algebraic-graphs]
  24510. 1258.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24511. 1258.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24512. 1258.76 s [algebraic-graphs] will become an error in a future GHC release.
  24513. 1258.76 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24514. 1258.76 s [algebraic-graphs] |
  24515. 1258.76 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24516. 1258.77 s [algebraic-graphs] | ^
  24517. 1258.77 s [algebraic-graphs]
  24518. 1258.77 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24519. 1258.77 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24520. 1258.77 s [algebraic-graphs] will become an error in a future GHC release.
  24521. 1258.77 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24522. 1258.77 s [algebraic-graphs] |
  24523. 1258.77 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24524. 1258.77 s [algebraic-graphs] | ^
  24525. 1258.77 s [algebraic-graphs]
  24526. 1258.77 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24527. 1258.77 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24528. 1258.77 s [algebraic-graphs] will become an error in a future GHC release.
  24529. 1258.77 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24530. 1258.77 s [algebraic-graphs] |
  24531. 1258.77 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24532. 1258.77 s [algebraic-graphs] | ^
  24533. 1258.77 s [algebraic-graphs]
  24534. 1258.77 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24535. 1258.77 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24536. 1258.77 s [algebraic-graphs] will become an error in a future GHC release.
  24537. 1258.77 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24538. 1258.77 s [algebraic-graphs] |
  24539. 1258.77 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24540. 1258.77 s [algebraic-graphs] | ^
  24541. 1258.86 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24542. 1258.86 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24543. 1258.87 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24544. 1259.02 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24545. 1259.26 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24546. 1259.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24547. 1259.28 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24548. 1259.48 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24549. 1259.64 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24550. 1259.81 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24551. 1259.84 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24552. 1259.89 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24553. 1259.89 s [algebraic-graphs]
  24554. 1259.90 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24555. 1259.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24556. 1259.90 s [algebraic-graphs] will become an error in a future GHC release.
  24557. 1259.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24558. 1259.90 s [algebraic-graphs] |
  24559. 1259.90 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24560. 1259.90 s [algebraic-graphs] | ^
  24561. 1259.93 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24562. 1259.93 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24563. 1259.94 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24564. 1259.96 s [algebraic-graphs]
  24565. 1259.96 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24566. 1259.96 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24567. 1259.96 s [algebraic-graphs] will become an error in a future GHC release.
  24568. 1259.96 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24569. 1259.96 s [algebraic-graphs] |
  24570. 1259.96 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24571. 1259.96 s [algebraic-graphs] | ^
  24572. 1259.96 s [algebraic-graphs]
  24573. 1259.96 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24574. 1259.96 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24575. 1259.96 s [algebraic-graphs] will become an error in a future GHC release.
  24576. 1259.96 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24577. 1259.96 s [algebraic-graphs] |
  24578. 1259.96 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24579. 1259.96 s [algebraic-graphs] | ^
  24580. 1260.07 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24581. 1260.21 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24582. 1260.32 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24583. 1260.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24584. 1260.32 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24585. 1260.35 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24586. 1260.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24587. 1260.35 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24588. 1260.38 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24589. 1260.38 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24590. 1260.38 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24591. 1260.42 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24592. 1260.42 s [algebraic-graphs] Missing documentation for:
  24593. 1260.42 s [algebraic-graphs] Module header
  24594. 1260.42 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24595. 1260.42 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  24596. 1260.42 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  24597. 1260.42 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  24598. 1260.42 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  24599. 1260.42 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  24600. 1260.42 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  24601. 1260.45 s [algebraic-graphs] Warning: 'array' is out of scope.
  24602. 1260.45 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24603. 1260.46 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24604. 1260.46 s [algebraic-graphs] Missing documentation for:
  24605. 1260.46 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  24606. 1266.07 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/index.html,
  24607. 1266.07 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24608. 1266.16 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  24609. 1266.18 s [algebraic-graphs] Phase: installPhase
  24610. 1266.26 s [algebraic-graphs] Installing library in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  24611. 1267.07 s [algebraic-graphs] Phase: fixupPhase
  24612. 1267.09 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  24613. 1267.09 s [algebraic-graphs] shrinking /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSalgebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj-ghc9.6.3.so
  24614. 1267.12 s [algebraic-graphs] checking for references to /build/ in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7...
  24615. 1267.14 s [algebraic-graphs] patching script interpreter paths in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  24616. 1267.15 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/lib
  24617. 1267.45 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc
  24618. 1267.47 s [algebraic-graphs] checking for references to /build/ in /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc...
  24619. 1267.49 s [algebraic-graphs] patching script interpreter paths in /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc
  24620. 1267.63 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  24621. 1268.18 s [algebraic-graphs:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  24622. 1268.18 s [algebraic-graphs:post-build]
  24623. 1268.61 s [algebraic-graphs:post-build] Pushing /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7 (24.31 MiB)
  24624. 1268.70 s [algebraic-graphs:post-build] Pushing /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc (10.39 MiB)
  24625. 1270.08 s [algebraic-graphs:post-build]
  24626. 1270.08 s [algebraic-graphs:post-build] All done.
  24627. 1270.10 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  24628. 1270.14 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24629. 1270.45 s [algebraic-graphs:post-build] copying 2 paths...
  24630. 1270.45 s [algebraic-graphs:post-build] copying path '/nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24631. 1272.01 s [algebraic-graphs:post-build] copying path '/nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24632. 1278.51 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24633. 1278.76 s [algebraic-graphs:post-build] copying 1 paths...
  24634. 1278.80 s [algebraic-graphs:post-build] copying path '/nix/store/hkmvcq18gdpc2h5crjzvsb77mzn2gj9k-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  24635. 1279.01 s Progress: 108 of 113 built, 172 of 172 downloaded from cache
  24636. 1279.07 s Building /nix/store/sn6sxdxi7j5g095cvnrnq2xqgzrvlrjm-algebraic-graph-duoids-0.0.1.0.drv
  24637. 1279.24 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  24638. 1279.25 s [algebraic-graph-duoids] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  24639. 1279.46 s [algebraic-graph-duoids] Phase: unpackPhase
  24640. 1279.46 s [algebraic-graph-duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
  24641. 1279.47 s [algebraic-graph-duoids] source root is algebraic-graphs
  24642. 1279.48 s [algebraic-graph-duoids] Phase: patchPhase
  24643. 1279.49 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  24644. 1279.49 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.WveZHtOhFG/setup-package.conf.d -threaded
  24645. 1279.54 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.WveZHtOhFG/Main.o )
  24646. 1279.60 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  24647. 1280.84 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  24648. 1280.86 s [algebraic-graph-duoids] Phase: configurePhase
  24649. 1280.86 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.WveZHtOhFG/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/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/lib
  24650. 1280.87 s [algebraic-graph-duoids] Using Parsec parser
  24651. 1280.87 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  24652. 1281.17 s [algebraic-graph-duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  24653. 1281.46 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24654. 1281.47 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24655. 1281.47 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.18.1.0
  24656. 1281.47 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  24657. 1281.47 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24658. 1281.47 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24659. 1281.47 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24660. 1281.47 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.18.1.0
  24661. 1281.47 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  24662. 1281.47 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  24663. 1281.47 s [algebraic-graph-duoids] hedgehog-1.5
  24664. 1281.47 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24665. 1281.47 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24666. 1281.47 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.18.1.0
  24667. 1281.47 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  24668. 1281.47 s [algebraic-graph-duoids] <0.25: using doctest-0.22.6
  24669. 1281.47 s [algebraic-graph-duoids] Source component graph:
  24670. 1281.47 s [algebraic-graph-duoids] component lib
  24671. 1281.47 s [algebraic-graph-duoids] component test:doctests dependency lib
  24672. 1281.47 s [algebraic-graph-duoids] component test:laws dependency lib
  24673. 1281.47 s [algebraic-graph-duoids] Configured component graph:
  24674. 1281.47 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24675. 1281.47 s [algebraic-graph-duoids] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  24676. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  24677. 1281.47 s [algebraic-graph-duoids] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  24678. 1281.47 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-95mgeXNOyDA41E2CAEEDWO-doctests
  24679. 1281.47 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24680. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  24681. 1281.47 s [algebraic-graph-duoids] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  24682. 1281.47 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-3O037TAv3cT3C4RWSEk3FL-laws
  24683. 1281.47 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24684. 1281.47 s [algebraic-graph-duoids] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  24685. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  24686. 1281.47 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  24687. 1281.47 s [algebraic-graph-duoids] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  24688. 1281.47 s [algebraic-graph-duoids] Linked component graph:
  24689. 1281.47 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24690. 1281.47 s [algebraic-graph-duoids] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  24691. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  24692. 1281.47 s [algebraic-graph-duoids] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  24693. 1281.47 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu:Algebra.Graph.Duoid.Orphans
  24694. 1281.47 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-95mgeXNOyDA41E2CAEEDWO-doctests
  24695. 1281.47 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24696. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  24697. 1281.47 s [algebraic-graph-duoids] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  24698. 1281.47 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-3O037TAv3cT3C4RWSEk3FL-laws
  24699. 1281.47 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24700. 1281.47 s [algebraic-graph-duoids] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  24701. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  24702. 1281.47 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  24703. 1281.47 s [algebraic-graph-duoids] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  24704. 1281.47 s [algebraic-graph-duoids] Ready component graph:
  24705. 1281.47 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24706. 1281.47 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  24707. 1281.47 s [algebraic-graph-duoids] depends base-4.18.1.0
  24708. 1281.47 s [algebraic-graph-duoids] depends duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  24709. 1281.47 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-3O037TAv3cT3C4RWSEk3FL-laws
  24710. 1281.47 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24711. 1281.47 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  24712. 1281.47 s [algebraic-graph-duoids] depends base-4.18.1.0
  24713. 1281.47 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  24714. 1281.47 s [algebraic-graph-duoids] depends hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  24715. 1281.47 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-95mgeXNOyDA41E2CAEEDWO-doctests
  24716. 1281.47 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24717. 1281.47 s [algebraic-graph-duoids] depends base-4.18.1.0
  24718. 1281.47 s [algebraic-graph-duoids] depends doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  24719. 1281.47 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.6
  24720. 1281.47 s [algebraic-graph-duoids] Using compiler: ghc-9.6.3
  24721. 1281.47 s [algebraic-graph-duoids] Using install prefix:
  24722. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  24723. 1281.47 s [algebraic-graph-duoids] Executables installed in:
  24724. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/bin
  24725. 1281.47 s [algebraic-graph-duoids] Libraries installed in:
  24726. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24727. 1281.47 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  24728. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  24729. 1281.47 s [algebraic-graph-duoids] Private executables installed in:
  24730. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.6.3/algebraic-graph-duoids-0.0.1.0
  24731. 1281.47 s [algebraic-graph-duoids] Data files installed in:
  24732. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.6.3/algebraic-graph-duoids-0.0.1.0
  24733. 1281.47 s [algebraic-graph-duoids] Documentation installed in:
  24734. 1281.47 s [algebraic-graph-duoids] /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  24735. 1281.47 s [algebraic-graph-duoids] Configuration files installed in:
  24736. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/etc
  24737. 1281.47 s [algebraic-graph-duoids] No alex found
  24738. 1281.47 s [algebraic-graph-duoids] Using ar found on system at:
  24739. 1281.47 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  24740. 1281.47 s [algebraic-graph-duoids] No c2hs found
  24741. 1281.47 s [algebraic-graph-duoids] No cpphs found
  24742. 1281.47 s [algebraic-graph-duoids] Using doctest version 0.22.6 found on system at:
  24743. 1281.47 s [algebraic-graph-duoids] /nix/store/1rhhhdgycbwrgfgqrs5rr0mmh6r4ly3h-doctest-0.22.6/bin/doctest
  24744. 1281.47 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  24745. 1281.47 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  24746. 1281.47 s [algebraic-graph-duoids] Using ghc version 9.6.3 found on system at:
  24747. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  24748. 1281.47 s [algebraic-graph-duoids] Using ghc-pkg version 9.6.3 found on system at:
  24749. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  24750. 1281.47 s [algebraic-graph-duoids] No ghcjs found
  24751. 1281.47 s [algebraic-graph-duoids] No ghcjs-pkg found
  24752. 1281.47 s [algebraic-graph-duoids] No greencard found
  24753. 1281.47 s [algebraic-graph-duoids] Using haddock version 2.29.1 found on system at:
  24754. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  24755. 1281.47 s [algebraic-graph-duoids] No happy found
  24756. 1281.47 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  24757. 1281.47 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  24758. 1281.47 s [algebraic-graph-duoids] No hmake found
  24759. 1281.47 s [algebraic-graph-duoids] Using hpc version 0.68 found on system at:
  24760. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  24761. 1281.47 s [algebraic-graph-duoids] Using hsc2hs version 0.68.9 found on system at:
  24762. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  24763. 1281.47 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  24764. 1281.47 s [algebraic-graph-duoids] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  24765. 1281.47 s [algebraic-graph-duoids] No jhc found
  24766. 1281.47 s [algebraic-graph-duoids] Using ld found on system at:
  24767. 1281.47 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  24768. 1281.47 s [algebraic-graph-duoids] No pkg-config found
  24769. 1281.47 s [algebraic-graph-duoids] Using runghc version 9.6.3 found on system at:
  24770. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  24771. 1281.47 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  24772. 1281.47 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  24773. 1281.47 s [algebraic-graph-duoids] Using tar found on system at:
  24774. 1281.47 s [algebraic-graph-duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  24775. 1281.47 s [algebraic-graph-duoids] No uhc found
  24776. 1281.60 s [algebraic-graph-duoids] Phase: buildPhase
  24777. 1281.66 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24778. 1281.66 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  24779. 1281.72 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 )
  24780. 1281.77 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 )
  24781. 1282.75 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  24782. 1282.88 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 )
  24783. 1284.78 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24784. 1284.78 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24785. 1284.87 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  24786. 1285.19 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  24787. 1286.04 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24788. 1286.04 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24789. 1286.11 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 )
  24790. 1286.30 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  24791. 1286.61 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  24792. 1290.33 s [algebraic-graph-duoids] Phase: checkPhase
  24793. 1290.57 s [algebraic-graph-duoids] Running 2 test suites...
  24794. 1290.57 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  24795. 1290.61 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  24796. 1290.61 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  24797. 1290.61 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  24798. 1290.61 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  24799. 1290.61 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  24800. 1290.61 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  24801. 1290.61 s [algebraic-graph-duoids] ✓ 5 succeeded.
  24802. 1290.61 s [algebraic-graph-duoids] Test suite laws: PASS
  24803. 1290.61 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  24804. 1290.61 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  24805. 1291.03 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  24806. 1291.08 s [algebraic-graph-duoids] Test suite doctests: PASS
  24807. 1291.08 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  24808. 1291.08 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  24809. 1291.10 s [algebraic-graph-duoids] Phase: haddockPhase
  24810. 1291.24 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24811. 1291.24 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  24812. 1291.41 s [algebraic-graph-duoids] 20% ( 1 / 5) in 'Algebra.Graph.Duoid'
  24813. 1291.41 s [algebraic-graph-duoids] Missing documentation for:
  24814. 1291.41 s [algebraic-graph-duoids] parEmptyGraph (src/Algebra/Graph/Duoid.hs:23)
  24815. 1291.41 s [algebraic-graph-duoids] seqEmptyGraph (src/Algebra/Graph/Duoid.hs:26)
  24816. 1291.41 s [algebraic-graph-duoids] parGraph (src/Algebra/Graph/Duoid.hs:29)
  24817. 1291.41 s [algebraic-graph-duoids] seqGraph (src/Algebra/Graph/Duoid.hs:32)
  24818. 1291.46 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  24819. 1293.61 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  24820. 1293.61 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  24821. 1293.66 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24822. 1293.66 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24823. 1293.68 s [algebraic-graph-duoids] Phase: installPhase
  24824. 1293.75 s [algebraic-graph-duoids] Installing library in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  24825. 1293.96 s [algebraic-graph-duoids] Phase: fixupPhase
  24826. 1293.98 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  24827. 1293.98 s [algebraic-graph-duoids] shrinking /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSalgebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu-ghc9.6.3.so
  24828. 1293.98 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0...
  24829. 1293.99 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  24830. 1294.00 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib
  24831. 1294.04 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc
  24832. 1294.04 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc...
  24833. 1294.05 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc
  24834. 1294.14 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  24835. 1294.61 s [algebraic-graph-duoids:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  24836. 1294.61 s [algebraic-graph-duoids:post-build]
  24837. 1294.99 s [algebraic-graph-duoids:post-build] Pushing /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0 (1.21 MiB)
  24838. 1295.05 s [algebraic-graph-duoids:post-build] Pushing /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc (522.79 KiB)
  24839. 1296.17 s [algebraic-graph-duoids:post-build]
  24840. 1296.17 s [algebraic-graph-duoids:post-build] All done.
  24841. 1296.19 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  24842. 1296.26 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24843. 1296.26 s [algebraic-graph-duoids:post-build] copying 2 paths...
  24844. 1296.26 s [algebraic-graph-duoids:post-build] copying path '/nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  24845. 1296.65 s [algebraic-graph-duoids:post-build] copying path '/nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  24846. 1298.02 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24847. 1298.33 s [algebraic-graph-duoids:post-build] copying 1 paths...
  24848. 1298.33 s [algebraic-graph-duoids:post-build] copying path '/nix/store/sn6sxdxi7j5g095cvnrnq2xqgzrvlrjm-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  24849. 1298.61 s Progress: 109 of 113 built, 172 of 172 downloaded from cache
  24850. 1298.67 s Building /nix/store/04skf427dn17vq8ip7iw034vq2la7y1q-ghc-9.6.3-with-packages.drv
  24851. 1298.72 s [ghc-9.6.3-with-packages] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/nix-support:
  24852. 1298.72 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24853. 1298.73 s [ghc-9.6.3-with-packages] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/nix-support:
  24854. 1298.73 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24855. 1298.73 s [ghc-9.6.3-with-packages] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/nix-support:
  24856. 1298.73 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24857. 1298.74 s [ghc-9.6.3-with-packages] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/nix-support:
  24858. 1298.74 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24859. 1298.74 s [ghc-9.6.3-with-packages] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/nix-support:
  24860. 1298.74 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24861. 1298.75 s [ghc-9.6.3-with-packages] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/nix-support:
  24862. 1298.75 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24863. 1298.75 s [ghc-9.6.3-with-packages] /nix/store/50p4c5pa9jr87ghaxak4nz048zjh792p-ansi-terminal-1.1.2/nix-support:
  24864. 1298.75 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24865. 1298.75 s [ghc-9.6.3-with-packages] /nix/store/50p4c5pa9jr87ghaxak4nz048zjh792p-ansi-terminal-1.1.2/nix-support:
  24866. 1298.75 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24867. 1298.75 s [ghc-9.6.3-with-packages] /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5/nix-support:
  24868. 1298.75 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24869. 1298.76 s [ghc-9.6.3-with-packages] /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5/nix-support:
  24870. 1298.76 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24871. 1298.76 s [ghc-9.6.3-with-packages] /nix/store/l78smfvlamnbs6dq5dip89qyb3i01hca-barbies-2.1.1.0/nix-support:
  24872. 1298.76 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24873. 1298.76 s [ghc-9.6.3-with-packages] /nix/store/l78smfvlamnbs6dq5dip89qyb3i01hca-barbies-2.1.1.0/nix-support:
  24874. 1298.76 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24875. 1298.77 s [ghc-9.6.3-with-packages] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/nix-support:
  24876. 1298.77 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24877. 1298.77 s [ghc-9.6.3-with-packages] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/nix-support:
  24878. 1298.77 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24879. 1298.77 s [ghc-9.6.3-with-packages] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/nix-support:
  24880. 1298.77 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24881. 1298.77 s [ghc-9.6.3-with-packages] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/nix-support:
  24882. 1298.77 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24883. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/11ji5jbp8d31m3jhc44qa6852x9yrpqj-mmorph-1.2.0/nix-support:
  24884. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24885. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/11ji5jbp8d31m3jhc44qa6852x9yrpqj-mmorph-1.2.0/nix-support:
  24886. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24887. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/g7r8i4j1sq499ng6m6k90cdygj39v40b-monad-control-1.0.3.1/nix-support:
  24888. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24889. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/g7r8i4j1sq499ng6m6k90cdygj39v40b-monad-control-1.0.3.1/nix-support:
  24890. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24891. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/bdriwlkszkbilzbid9ywn2pxnll3vsgw-pretty-show-1.10/nix-support:
  24892. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24893. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/bdriwlkszkbilzbid9ywn2pxnll3vsgw-pretty-show-1.10/nix-support:
  24894. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24895. 1298.79 s [ghc-9.6.3-with-packages] /nix/store/4pas9p9qm4hcq0jacd5gbvx1wdbdm8qq-primitive-0.9.1.0/nix-support:
  24896. 1298.79 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24897. 1298.79 s [ghc-9.6.3-with-packages] /nix/store/4pas9p9qm4hcq0jacd5gbvx1wdbdm8qq-primitive-0.9.1.0/nix-support:
  24898. 1298.79 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24899. 1298.79 s [ghc-9.6.3-with-packages] /nix/store/7i0h7h1m8kxxvb8vymqwim3w4ixy6vdp-random-1.2.1.3/nix-support:
  24900. 1298.79 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24901. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/7i0h7h1m8kxxvb8vymqwim3w4ixy6vdp-random-1.2.1.3/nix-support:
  24902. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24903. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/4688rpnf7ryrv8npscr2a4ps0g7jp7n8-resourcet-1.3.0/nix-support:
  24904. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24905. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/4688rpnf7ryrv8npscr2a4ps0g7jp7n8-resourcet-1.3.0/nix-support:
  24906. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24907. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/rlya20y03shhyam99n5ylx45hvbk83i2-safe-exceptions-0.1.7.4/nix-support:
  24908. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24909. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/rlya20y03shhyam99n5ylx45hvbk83i2-safe-exceptions-0.1.7.4/nix-support:
  24910. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24911. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/q13c0pm6f0g5frncyldm3yikhrp856y2-transformers-base-0.4.6/nix-support:
  24912. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24913. 1298.81 s [ghc-9.6.3-with-packages] /nix/store/q13c0pm6f0g5frncyldm3yikhrp856y2-transformers-base-0.4.6/nix-support:
  24914. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24915. 1298.81 s [ghc-9.6.3-with-packages] /nix/store/w1831qcz75ihsdmlnzxifylnzah9bszj-wl-pprint-annotated-0.1.0.1/nix-support:
  24916. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24917. 1298.81 s [ghc-9.6.3-with-packages] /nix/store/w1831qcz75ihsdmlnzxifylnzah9bszj-wl-pprint-annotated-0.1.0.1/nix-support:
  24918. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24919. 1298.81 s [ghc-9.6.3-with-packages] /nix/store/qd7ifqr4hi6b9v60ix1wkvafd2pjjpn7-ansi-terminal-types-1.1/nix-support:
  24920. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24921. 1298.82 s [ghc-9.6.3-with-packages] /nix/store/qd7ifqr4hi6b9v60ix1wkvafd2pjjpn7-ansi-terminal-types-1.1/nix-support:
  24922. 1298.82 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24923. 1298.82 s [ghc-9.6.3-with-packages] /nix/store/i01cfmnc0vqryiyibk4bsbdppdzxsx72-hashable-1.4.7.0/nix-support:
  24924. 1298.82 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24925. 1298.83 s [ghc-9.6.3-with-packages] /nix/store/i01cfmnc0vqryiyibk4bsbdppdzxsx72-hashable-1.4.7.0/nix-support:
  24926. 1298.83 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24927. 1298.83 s [ghc-9.6.3-with-packages] /nix/store/hyhrgyzsaqpk5k2bzfghdr2iw3gkg932-distributive-0.6.2.1/nix-support:
  24928. 1298.83 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24929. 1298.83 s [ghc-9.6.3-with-packages] /nix/store/hyhrgyzsaqpk5k2bzfghdr2iw3gkg932-distributive-0.6.2.1/nix-support:
  24930. 1298.83 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24931. 1298.83 s [ghc-9.6.3-with-packages] /nix/store/fpzjqfhar6pi07fj4gj6aijsg32nkw7s-constraints-0.14.2/nix-support:
  24932. 1298.83 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24933. 1298.84 s [ghc-9.6.3-with-packages] /nix/store/fpzjqfhar6pi07fj4gj6aijsg32nkw7s-constraints-0.14.2/nix-support:
  24934. 1298.84 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24935. 1298.84 s [ghc-9.6.3-with-packages] /nix/store/iwc102rdjzcjwlpjlndb6imcdm9zzwgy-lifted-base-0.2.3.12/nix-support:
  24936. 1298.84 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24937. 1298.84 s [ghc-9.6.3-with-packages] /nix/store/iwc102rdjzcjwlpjlndb6imcdm9zzwgy-lifted-base-0.2.3.12/nix-support:
  24938. 1298.84 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24939. 1298.85 s [ghc-9.6.3-with-packages] /nix/store/zmn0ap38l4g69lcjwiw2kmplfsq1af4r-transformers-compat-0.7.2/nix-support:
  24940. 1298.85 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24941. 1298.85 s [ghc-9.6.3-with-packages] /nix/store/zmn0ap38l4g69lcjwiw2kmplfsq1af4r-transformers-compat-0.7.2/nix-support:
  24942. 1298.85 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24943. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/vcpbd4xzmcp57zr42bb4860xpq003j3p-splitmix-0.1.1/nix-support:
  24944. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24945. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/vcpbd4xzmcp57zr42bb4860xpq003j3p-splitmix-0.1.1/nix-support:
  24946. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24947. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/70dymfj4rb9i9m88rprl50aw8gswi364-unliftio-core-0.2.1.0/nix-support:
  24948. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24949. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/70dymfj4rb9i9m88rprl50aw8gswi364-unliftio-core-0.2.1.0/nix-support:
  24950. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24951. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/flv8w02hdrmwqxw64lqwl0h20bxzqnp0-base-orphans-0.9.3/nix-support:
  24952. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24953. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/flv8w02hdrmwqxw64lqwl0h20bxzqnp0-base-orphans-0.9.3/nix-support:
  24954. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24955. 1298.87 s [ghc-9.6.3-with-packages] /nix/store/aj1zri1ypx7p7da7ncqrzfsyvjslvgwr-os-string-2.0.7/nix-support:
  24956. 1298.87 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24957. 1298.87 s [ghc-9.6.3-with-packages] /nix/store/aj1zri1ypx7p7da7ncqrzfsyvjslvgwr-os-string-2.0.7/nix-support:
  24958. 1298.87 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24959. 1298.87 s [ghc-9.6.3-with-packages] /nix/store/056xwdbxzpm4fappfvb1knb44wz2pfb7-tagged-0.8.8/nix-support:
  24960. 1298.87 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24961. 1298.87 s [ghc-9.6.3-with-packages] /nix/store/056xwdbxzpm4fappfvb1knb44wz2pfb7-tagged-0.8.8/nix-support:
  24962. 1298.87 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24963. 1298.88 s [ghc-9.6.3-with-packages] /nix/store/3v9igj5pmilrqckb7dp9b6g7s8d1h8ms-boring-0.2.2/nix-support:
  24964. 1298.88 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24965. 1298.88 s [ghc-9.6.3-with-packages] /nix/store/3v9igj5pmilrqckb7dp9b6g7s8d1h8ms-boring-0.2.2/nix-support:
  24966. 1298.88 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24967. 1299.67 s [ghc-9.6.3-with-packages] Warning: include-dirs: /nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages/lib/ghc-9.6.3/lib/../lib/x86_64-linux-ghc-9.6.3/directory-1.3.8.1/include doesn't exist or isn't a directory
  24968. 1300.81 s [ghc-9.6.3-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages
  24969. 1301.47 s [ghc-9.6.3-with-packages:post-build] Pushing 1 paths (140 are already present) using zstd to cache sellout ⏳
  24970. 1301.47 s [ghc-9.6.3-with-packages:post-build]
  24971. 1301.84 s [ghc-9.6.3-with-packages:post-build] Pushing /nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages (4.19 MiB)
  24972. 1303.72 s [ghc-9.6.3-with-packages:post-build]
  24973. 1303.72 s [ghc-9.6.3-with-packages:post-build] All done.
  24974. 1303.75 s [ghc-9.6.3-with-packages:post-build] Uploading to the NixCI cache: /nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages
  24975. 1303.80 s [ghc-9.6.3-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24976. 1304.02 s [ghc-9.6.3-with-packages:post-build] copying 1 paths...
  24977. 1304.02 s [ghc-9.6.3-with-packages:post-build] copying path '/nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages' to 'https://cache.nix-ci.com'...
  24978. 1305.09 s [ghc-9.6.3-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24979. 1305.33 s [ghc-9.6.3-with-packages:post-build] copying 1 paths...
  24980. 1305.33 s [ghc-9.6.3-with-packages:post-build] copying path '/nix/store/04skf427dn17vq8ip7iw034vq2la7y1q-ghc-9.6.3-with-packages.drv' to 'https://cache.nix-ci.com'...
  24981. 1305.56 s Progress: 110 of 112 built, 172 of 172 downloaded from cache
  24982. 1305.61 s Building /nix/store/2vzf4cl7iwrm9xplzxch1rvvb22zjjrb-all-packages.drv
  24983. 1305.68 s [all-packages] created 3 symlinks in user environment
  24984. 1305.72 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages
  24985. 1306.23 s [all-packages:post-build] Pushing 1 paths (141 are already present) using zstd to cache sellout ⏳
  24986. 1306.23 s [all-packages:post-build]
  24987. 1306.60 s [all-packages:post-build] Pushing /nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages (872.00 B)
  24988. 1307.57 s [all-packages:post-build]
  24989. 1307.57 s [all-packages:post-build] All done.
  24990. 1307.65 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages
  24991. 1307.81 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1308.04 s [all-packages:post-build] copying 1 paths...
  24993. 1308.04 s [all-packages:post-build] copying path '/nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages' to 'https://cache.nix-ci.com'...
  24994. 1308.37 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1308.63 s [all-packages:post-build] copying 1 paths...
  24996. 1308.63 s [all-packages:post-build] copying path '/nix/store/2vzf4cl7iwrm9xplzxch1rvvb22zjjrb-all-packages.drv' to 'https://cache.nix-ci.com'...
  24997. 1308.87 s Progress: 111 of 112 built, 172 of 172 downloaded from cache
  24998. 1308.87 s Progress: 112 of 112 built, 172 of 172 downloaded from cache
  24999. 1308.87 s /nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages
  25000. 1308.93 s Build succeeded.
Tail Raw Logs